A Fractional Programming Method for Target Localization in Asynchronous Networks

In this paper, we address the target device localization problem in the asynchronous networks. For the purpose of saving power resources, the target device is not synchronized with the anchor nodes, but is only required to listen to the signals transmitted from the anchors, which, however, introduce...
Ausführliche Beschreibung

Gespeichert in:

Autor*in:	Gang Wang [verfasserIn] Nirwan Ansari [verfasserIn] Youming Li [verfasserIn]

Format:	E-Artikel
Sprache:	Englisch

Erschienen:	2018

Schlagwörter:	Fractional programming (FP) localization time-of-arrival (TOA) time-difference-of-arrival (TDOA)

Übergeordnetes Werk:	In: IEEE Access - IEEE, 2014, 6(2018), Seite 56727-56736
Übergeordnetes Werk:	volume:6 ; year:2018 ; pages:56727-56736

Links:	Link aufrufen Link aufrufen Link aufrufen Journal toc

DOI / URN:	10.1109/ACCESS.2018.2873453

Katalog-ID:	DOAJ015298329

Internformat


LEADER	01000caa a22002652 4500
001	DOAJ015298329
003	DE-627
005	20230310073730.0
007	cr uuu---uuuuu
008	230226s2018 xx \|\|\|\|\|o 00\| \|\|eng c
024	7		\|a 10.1109/ACCESS.2018.2873453 \|2 doi
035			\|a (DE-627)DOAJ015298329
035			\|a (DE-599)DOAJ8661026e1d37461995297a688ad786b3
040			\|a DE-627 \|b ger \|c DE-627 \|e rakwb
041			\|a eng
050		0	\|a TK1-9971
100	0		\|a Gang Wang \|e verfasserin \|4 aut
245	1	2	\|a A Fractional Programming Method for Target Localization in Asynchronous Networks
264		1	\|c 2018
336			\|a Text \|b txt \|2 rdacontent
337			\|a Computermedien \|b c \|2 rdamedia
338			\|a Online-Ressource \|b cr \|2 rdacarrier
520			\|a In this paper, we address the target device localization problem in the asynchronous networks. For the purpose of saving power resources, the target device is not synchronized with the anchor nodes, but is only required to listen to the signals transmitted from the anchors, which, however, introduces two extra nuisance parameters: the target's clock skew and clock offset. By transforming the time-of-arrival measurements into time-difference-of-arrival measurements, the clock offset of the target's clock is eradicated. However, there still exists the unknown clock skew, which may degrade the localization performance. Since the range of the clock skew is usually known as a priori, we assume that it follows a uniform distribution within this range. By doing so, we take it as a part of measurement noise and estimate the target node position only. To estimate the target node position, we formulate a fractional programming problem and further show that it can be solved by solving one single mixed semidefinite and second-order cone program (SD/SOCP). Simulation results illustrate the superior performance of the proposed method over the existing methods.
650		4	\|a Fractional programming (FP)
650		4	\|a localization
650		4	\|a time-of-arrival (TOA)
650		4	\|a time-difference-of-arrival (TDOA)
653		0	\|a Electrical engineering. Electronics. Nuclear engineering
700	0		\|a Nirwan Ansari \|e verfasserin \|4 aut
700	0		\|a Youming Li \|e verfasserin \|4 aut
773	0	8	\|i In \|t IEEE Access \|d IEEE, 2014 \|g 6(2018), Seite 56727-56736 \|w (DE-627)728440385 \|w (DE-600)2687964-5 \|x 21693536 \|7 nnns
773	1	8	\|g volume:6 \|g year:2018 \|g pages:56727-56736
856	4	0	\|u https://doi.org/10.1109/ACCESS.2018.2873453 \|z kostenfrei
856	4	0	\|u https://doaj.org/article/8661026e1d37461995297a688ad786b3 \|z kostenfrei
856	4	0	\|u https://ieeexplore.ieee.org/document/8478381/ \|z kostenfrei
856	4	2	\|u https://doaj.org/toc/2169-3536 \|y Journal toc \|z kostenfrei
912			\|a GBV_USEFLAG_A
912			\|a SYSFLAG_A
912			\|a GBV_DOAJ
912			\|a GBV_ILN_11
912			\|a GBV_ILN_20
912			\|a GBV_ILN_22
912			\|a GBV_ILN_23
912			\|a GBV_ILN_24
912			\|a GBV_ILN_31
912			\|a GBV_ILN_39
912			\|a GBV_ILN_40
912			\|a GBV_ILN_60
912			\|a GBV_ILN_62
912			\|a GBV_ILN_63
912			\|a GBV_ILN_65
912			\|a GBV_ILN_69
912			\|a GBV_ILN_70
912			\|a GBV_ILN_73
912			\|a GBV_ILN_95
912			\|a GBV_ILN_105
912			\|a GBV_ILN_110
912			\|a GBV_ILN_151
912			\|a GBV_ILN_161
912			\|a GBV_ILN_170
912			\|a GBV_ILN_213
912			\|a GBV_ILN_230
912			\|a GBV_ILN_285
912			\|a GBV_ILN_293
912			\|a GBV_ILN_370
912			\|a GBV_ILN_602
912			\|a GBV_ILN_2014
912			\|a GBV_ILN_4012
912			\|a GBV_ILN_4037
912			\|a GBV_ILN_4112
912			\|a GBV_ILN_4125
912			\|a GBV_ILN_4126
912			\|a GBV_ILN_4249
912			\|a GBV_ILN_4305
912			\|a GBV_ILN_4306
912			\|a GBV_ILN_4307
912			\|a GBV_ILN_4313
912			\|a GBV_ILN_4322
912			\|a GBV_ILN_4323
912			\|a GBV_ILN_4324
912			\|a GBV_ILN_4325
912			\|a GBV_ILN_4335
912			\|a GBV_ILN_4338
912			\|a GBV_ILN_4367
912			\|a GBV_ILN_4700
951			\|a AR
952			\|d 6 \|j 2018 \|h 56727-56736

Indexfelder

author_variant	g w gw n a na y l yl
matchkey_str	article:21693536:2018----::fatoapormigehdotrelclztoi
hierarchy_sort_str	2018
callnumber-subject-code	TK
publishDate	2018
allfields	10.1109/ACCESS.2018.2873453 doi (DE-627)DOAJ015298329 (DE-599)DOAJ8661026e1d37461995297a688ad786b3 DE-627 ger DE-627 rakwb eng TK1-9971 Gang Wang verfasserin aut A Fractional Programming Method for Target Localization in Asynchronous Networks 2018 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier In this paper, we address the target device localization problem in the asynchronous networks. For the purpose of saving power resources, the target device is not synchronized with the anchor nodes, but is only required to listen to the signals transmitted from the anchors, which, however, introduces two extra nuisance parameters: the target's clock skew and clock offset. By transforming the time-of-arrival measurements into time-difference-of-arrival measurements, the clock offset of the target's clock is eradicated. However, there still exists the unknown clock skew, which may degrade the localization performance. Since the range of the clock skew is usually known as a priori, we assume that it follows a uniform distribution within this range. By doing so, we take it as a part of measurement noise and estimate the target node position only. To estimate the target node position, we formulate a fractional programming problem and further show that it can be solved by solving one single mixed semidefinite and second-order cone program (SD/SOCP). Simulation results illustrate the superior performance of the proposed method over the existing methods. Fractional programming (FP) localization time-of-arrival (TOA) time-difference-of-arrival (TDOA) Electrical engineering. Electronics. Nuclear engineering Nirwan Ansari verfasserin aut Youming Li verfasserin aut In IEEE Access IEEE, 2014 6(2018), Seite 56727-56736 (DE-627)728440385 (DE-600)2687964-5 21693536 nnns volume:6 year:2018 pages:56727-56736 https://doi.org/10.1109/ACCESS.2018.2873453 kostenfrei https://doaj.org/article/8661026e1d37461995297a688ad786b3 kostenfrei https://ieeexplore.ieee.org/document/8478381/ kostenfrei https://doaj.org/toc/2169-3536 Journal toc kostenfrei GBV_USEFLAG_A SYSFLAG_A GBV_DOAJ GBV_ILN_11 GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_95 GBV_ILN_105 GBV_ILN_110 GBV_ILN_151 GBV_ILN_161 GBV_ILN_170 GBV_ILN_213 GBV_ILN_230 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_2014 GBV_ILN_4012 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4249 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4335 GBV_ILN_4338 GBV_ILN_4367 GBV_ILN_4700 AR 6 2018 56727-56736
spelling	10.1109/ACCESS.2018.2873453 doi (DE-627)DOAJ015298329 (DE-599)DOAJ8661026e1d37461995297a688ad786b3 DE-627 ger DE-627 rakwb eng TK1-9971 Gang Wang verfasserin aut A Fractional Programming Method for Target Localization in Asynchronous Networks 2018 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier In this paper, we address the target device localization problem in the asynchronous networks. For the purpose of saving power resources, the target device is not synchronized with the anchor nodes, but is only required to listen to the signals transmitted from the anchors, which, however, introduces two extra nuisance parameters: the target's clock skew and clock offset. By transforming the time-of-arrival measurements into time-difference-of-arrival measurements, the clock offset of the target's clock is eradicated. However, there still exists the unknown clock skew, which may degrade the localization performance. Since the range of the clock skew is usually known as a priori, we assume that it follows a uniform distribution within this range. By doing so, we take it as a part of measurement noise and estimate the target node position only. To estimate the target node position, we formulate a fractional programming problem and further show that it can be solved by solving one single mixed semidefinite and second-order cone program (SD/SOCP). Simulation results illustrate the superior performance of the proposed method over the existing methods. Fractional programming (FP) localization time-of-arrival (TOA) time-difference-of-arrival (TDOA) Electrical engineering. Electronics. Nuclear engineering Nirwan Ansari verfasserin aut Youming Li verfasserin aut In IEEE Access IEEE, 2014 6(2018), Seite 56727-56736 (DE-627)728440385 (DE-600)2687964-5 21693536 nnns volume:6 year:2018 pages:56727-56736 https://doi.org/10.1109/ACCESS.2018.2873453 kostenfrei https://doaj.org/article/8661026e1d37461995297a688ad786b3 kostenfrei https://ieeexplore.ieee.org/document/8478381/ kostenfrei https://doaj.org/toc/2169-3536 Journal toc kostenfrei GBV_USEFLAG_A SYSFLAG_A GBV_DOAJ GBV_ILN_11 GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_95 GBV_ILN_105 GBV_ILN_110 GBV_ILN_151 GBV_ILN_161 GBV_ILN_170 GBV_ILN_213 GBV_ILN_230 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_2014 GBV_ILN_4012 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4249 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4335 GBV_ILN_4338 GBV_ILN_4367 GBV_ILN_4700 AR 6 2018 56727-56736
allfields_unstemmed	10.1109/ACCESS.2018.2873453 doi (DE-627)DOAJ015298329 (DE-599)DOAJ8661026e1d37461995297a688ad786b3 DE-627 ger DE-627 rakwb eng TK1-9971 Gang Wang verfasserin aut A Fractional Programming Method for Target Localization in Asynchronous Networks 2018 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier In this paper, we address the target device localization problem in the asynchronous networks. For the purpose of saving power resources, the target device is not synchronized with the anchor nodes, but is only required to listen to the signals transmitted from the anchors, which, however, introduces two extra nuisance parameters: the target's clock skew and clock offset. By transforming the time-of-arrival measurements into time-difference-of-arrival measurements, the clock offset of the target's clock is eradicated. However, there still exists the unknown clock skew, which may degrade the localization performance. Since the range of the clock skew is usually known as a priori, we assume that it follows a uniform distribution within this range. By doing so, we take it as a part of measurement noise and estimate the target node position only. To estimate the target node position, we formulate a fractional programming problem and further show that it can be solved by solving one single mixed semidefinite and second-order cone program (SD/SOCP). Simulation results illustrate the superior performance of the proposed method over the existing methods. Fractional programming (FP) localization time-of-arrival (TOA) time-difference-of-arrival (TDOA) Electrical engineering. Electronics. Nuclear engineering Nirwan Ansari verfasserin aut Youming Li verfasserin aut In IEEE Access IEEE, 2014 6(2018), Seite 56727-56736 (DE-627)728440385 (DE-600)2687964-5 21693536 nnns volume:6 year:2018 pages:56727-56736 https://doi.org/10.1109/ACCESS.2018.2873453 kostenfrei https://doaj.org/article/8661026e1d37461995297a688ad786b3 kostenfrei https://ieeexplore.ieee.org/document/8478381/ kostenfrei https://doaj.org/toc/2169-3536 Journal toc kostenfrei GBV_USEFLAG_A SYSFLAG_A GBV_DOAJ GBV_ILN_11 GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_95 GBV_ILN_105 GBV_ILN_110 GBV_ILN_151 GBV_ILN_161 GBV_ILN_170 GBV_ILN_213 GBV_ILN_230 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_2014 GBV_ILN_4012 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4249 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4335 GBV_ILN_4338 GBV_ILN_4367 GBV_ILN_4700 AR 6 2018 56727-56736
allfieldsGer	10.1109/ACCESS.2018.2873453 doi (DE-627)DOAJ015298329 (DE-599)DOAJ8661026e1d37461995297a688ad786b3 DE-627 ger DE-627 rakwb eng TK1-9971 Gang Wang verfasserin aut A Fractional Programming Method for Target Localization in Asynchronous Networks 2018 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier In this paper, we address the target device localization problem in the asynchronous networks. For the purpose of saving power resources, the target device is not synchronized with the anchor nodes, but is only required to listen to the signals transmitted from the anchors, which, however, introduces two extra nuisance parameters: the target's clock skew and clock offset. By transforming the time-of-arrival measurements into time-difference-of-arrival measurements, the clock offset of the target's clock is eradicated. However, there still exists the unknown clock skew, which may degrade the localization performance. Since the range of the clock skew is usually known as a priori, we assume that it follows a uniform distribution within this range. By doing so, we take it as a part of measurement noise and estimate the target node position only. To estimate the target node position, we formulate a fractional programming problem and further show that it can be solved by solving one single mixed semidefinite and second-order cone program (SD/SOCP). Simulation results illustrate the superior performance of the proposed method over the existing methods. Fractional programming (FP) localization time-of-arrival (TOA) time-difference-of-arrival (TDOA) Electrical engineering. Electronics. Nuclear engineering Nirwan Ansari verfasserin aut Youming Li verfasserin aut In IEEE Access IEEE, 2014 6(2018), Seite 56727-56736 (DE-627)728440385 (DE-600)2687964-5 21693536 nnns volume:6 year:2018 pages:56727-56736 https://doi.org/10.1109/ACCESS.2018.2873453 kostenfrei https://doaj.org/article/8661026e1d37461995297a688ad786b3 kostenfrei https://ieeexplore.ieee.org/document/8478381/ kostenfrei https://doaj.org/toc/2169-3536 Journal toc kostenfrei GBV_USEFLAG_A SYSFLAG_A GBV_DOAJ GBV_ILN_11 GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_95 GBV_ILN_105 GBV_ILN_110 GBV_ILN_151 GBV_ILN_161 GBV_ILN_170 GBV_ILN_213 GBV_ILN_230 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_2014 GBV_ILN_4012 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4249 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4335 GBV_ILN_4338 GBV_ILN_4367 GBV_ILN_4700 AR 6 2018 56727-56736
allfieldsSound	10.1109/ACCESS.2018.2873453 doi (DE-627)DOAJ015298329 (DE-599)DOAJ8661026e1d37461995297a688ad786b3 DE-627 ger DE-627 rakwb eng TK1-9971 Gang Wang verfasserin aut A Fractional Programming Method for Target Localization in Asynchronous Networks 2018 Text txt rdacontent Computermedien c rdamedia Online-Ressource cr rdacarrier In this paper, we address the target device localization problem in the asynchronous networks. For the purpose of saving power resources, the target device is not synchronized with the anchor nodes, but is only required to listen to the signals transmitted from the anchors, which, however, introduces two extra nuisance parameters: the target's clock skew and clock offset. By transforming the time-of-arrival measurements into time-difference-of-arrival measurements, the clock offset of the target's clock is eradicated. However, there still exists the unknown clock skew, which may degrade the localization performance. Since the range of the clock skew is usually known as a priori, we assume that it follows a uniform distribution within this range. By doing so, we take it as a part of measurement noise and estimate the target node position only. To estimate the target node position, we formulate a fractional programming problem and further show that it can be solved by solving one single mixed semidefinite and second-order cone program (SD/SOCP). Simulation results illustrate the superior performance of the proposed method over the existing methods. Fractional programming (FP) localization time-of-arrival (TOA) time-difference-of-arrival (TDOA) Electrical engineering. Electronics. Nuclear engineering Nirwan Ansari verfasserin aut Youming Li verfasserin aut In IEEE Access IEEE, 2014 6(2018), Seite 56727-56736 (DE-627)728440385 (DE-600)2687964-5 21693536 nnns volume:6 year:2018 pages:56727-56736 https://doi.org/10.1109/ACCESS.2018.2873453 kostenfrei https://doaj.org/article/8661026e1d37461995297a688ad786b3 kostenfrei https://ieeexplore.ieee.org/document/8478381/ kostenfrei https://doaj.org/toc/2169-3536 Journal toc kostenfrei GBV_USEFLAG_A SYSFLAG_A GBV_DOAJ GBV_ILN_11 GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_95 GBV_ILN_105 GBV_ILN_110 GBV_ILN_151 GBV_ILN_161 GBV_ILN_170 GBV_ILN_213 GBV_ILN_230 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_2014 GBV_ILN_4012 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4249 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4335 GBV_ILN_4338 GBV_ILN_4367 GBV_ILN_4700 AR 6 2018 56727-56736
language	English
source	In IEEE Access 6(2018), Seite 56727-56736 volume:6 year:2018 pages:56727-56736
sourceStr	In IEEE Access 6(2018), Seite 56727-56736 volume:6 year:2018 pages:56727-56736
format_phy_str_mv	Article
institution	findex.gbv.de
topic_facet	Fractional programming (FP) localization time-of-arrival (TOA) time-difference-of-arrival (TDOA) Electrical engineering. Electronics. Nuclear engineering
isfreeaccess_bool	true
container_title	IEEE Access
authorswithroles_txt_mv	Gang Wang @@aut@@ Nirwan Ansari @@aut@@ Youming Li @@aut@@
publishDateDaySort_date	2018-01-01T00:00:00Z
hierarchy_top_id	728440385
id	DOAJ015298329
language_de	englisch
fullrecord	<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">DOAJ015298329</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230310073730.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">230226s2018 xx \|\|\|\|\|o 00\| \|\|eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1109/ACCESS.2018.2873453</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)DOAJ015298329</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)DOAJ8661026e1d37461995297a688ad786b3</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">TK1-9971</subfield></datafield><datafield tag="100" ind1="0" ind2=" "><subfield code="a">Gang Wang</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="2"><subfield code="a">A Fractional Programming Method for Target Localization in Asynchronous Networks</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2018</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">Computermedien</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Online-Ressource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">In this paper, we address the target device localization problem in the asynchronous networks. For the purpose of saving power resources, the target device is not synchronized with the anchor nodes, but is only required to listen to the signals transmitted from the anchors, which, however, introduces two extra nuisance parameters: the target's clock skew and clock offset. By transforming the time-of-arrival measurements into time-difference-of-arrival measurements, the clock offset of the target's clock is eradicated. However, there still exists the unknown clock skew, which may degrade the localization performance. Since the range of the clock skew is usually known as a priori, we assume that it follows a uniform distribution within this range. By doing so, we take it as a part of measurement noise and estimate the target node position only. To estimate the target node position, we formulate a fractional programming problem and further show that it can be solved by solving one single mixed semidefinite and second-order cone program (SD/SOCP). Simulation results illustrate the superior performance of the proposed method over the existing methods.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Fractional programming (FP)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">localization</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">time-of-arrival (TOA)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">time-difference-of-arrival (TDOA)</subfield></datafield><datafield tag="653" ind1=" " ind2="0"><subfield code="a">Electrical engineering. Electronics. Nuclear engineering</subfield></datafield><datafield tag="700" ind1="0" ind2=" "><subfield code="a">Nirwan Ansari</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="0" ind2=" "><subfield code="a">Youming Li</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">In</subfield><subfield code="t">IEEE Access</subfield><subfield code="d">IEEE, 2014</subfield><subfield code="g">6(2018), Seite 56727-56736</subfield><subfield code="w">(DE-627)728440385</subfield><subfield code="w">(DE-600)2687964-5</subfield><subfield code="x">21693536</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:6</subfield><subfield code="g">year:2018</subfield><subfield code="g">pages:56727-56736</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1109/ACCESS.2018.2873453</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doaj.org/article/8661026e1d37461995297a688ad786b3</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://ieeexplore.ieee.org/document/8478381/</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="u">https://doaj.org/toc/2169-3536</subfield><subfield code="y">Journal toc</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_DOAJ</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_11</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_20</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_22</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_23</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_24</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_31</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_39</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_40</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_60</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_62</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_63</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_65</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_69</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_73</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_95</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_105</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_110</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_151</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_161</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_170</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_213</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_230</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_285</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_293</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_370</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_602</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2014</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4012</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4037</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4112</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4125</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4126</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4249</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4305</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4306</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4307</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4313</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4322</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4323</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4324</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4325</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4335</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4338</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4367</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4700</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">6</subfield><subfield code="j">2018</subfield><subfield code="h">56727-56736</subfield></datafield></record></collection>
callnumber-first	T - Technology
author	Gang Wang
spellingShingle	Gang Wang misc TK1-9971 misc Fractional programming (FP) misc localization misc time-of-arrival (TOA) misc time-difference-of-arrival (TDOA) misc Electrical engineering. Electronics. Nuclear engineering A Fractional Programming Method for Target Localization in Asynchronous Networks
authorStr	Gang Wang
ppnlink_with_tag_str_mv	@@773@@(DE-627)728440385
format	electronic Article
delete_txt_mv	keep
author_role	aut aut aut
collection	DOAJ
remote_str	true
callnumber-label	TK1-9971
illustrated	Not Illustrated
issn	21693536
topic_title	TK1-9971 A Fractional Programming Method for Target Localization in Asynchronous Networks Fractional programming (FP) localization time-of-arrival (TOA) time-difference-of-arrival (TDOA)
topic	misc TK1-9971 misc Fractional programming (FP) misc localization misc time-of-arrival (TOA) misc time-difference-of-arrival (TDOA) misc Electrical engineering. Electronics. Nuclear engineering
topic_unstemmed	misc TK1-9971 misc Fractional programming (FP) misc localization misc time-of-arrival (TOA) misc time-difference-of-arrival (TDOA) misc Electrical engineering. Electronics. Nuclear engineering
topic_browse	misc TK1-9971 misc Fractional programming (FP) misc localization misc time-of-arrival (TOA) misc time-difference-of-arrival (TDOA) misc Electrical engineering. Electronics. Nuclear engineering
format_facet	Elektronische Aufsätze Aufsätze Elektronische Ressource
format_main_str_mv	Text Zeitschrift/Artikel
carriertype_str_mv	cr
hierarchy_parent_title	IEEE Access
hierarchy_parent_id	728440385
hierarchy_top_title	IEEE Access
isfreeaccess_txt	true
familylinks_str_mv	(DE-627)728440385 (DE-600)2687964-5
title	A Fractional Programming Method for Target Localization in Asynchronous Networks
ctrlnum	(DE-627)DOAJ015298329 (DE-599)DOAJ8661026e1d37461995297a688ad786b3
title_full	A Fractional Programming Method for Target Localization in Asynchronous Networks
author_sort	Gang Wang
journal	IEEE Access
journalStr	IEEE Access
callnumber-first-code	T
lang_code	eng
isOA_bool	true
recordtype	marc
publishDateSort	2018
contenttype_str_mv	txt
container_start_page	56727
author_browse	Gang Wang Nirwan Ansari Youming Li
container_volume	6
class	TK1-9971
format_se	Elektronische Aufsätze
author-letter	Gang Wang
doi_str_mv	10.1109/ACCESS.2018.2873453
author2-role	verfasserin
title_sort	fractional programming method for target localization in asynchronous networks
callnumber	TK1-9971
title_auth	A Fractional Programming Method for Target Localization in Asynchronous Networks
abstract	In this paper, we address the target device localization problem in the asynchronous networks. For the purpose of saving power resources, the target device is not synchronized with the anchor nodes, but is only required to listen to the signals transmitted from the anchors, which, however, introduces two extra nuisance parameters: the target's clock skew and clock offset. By transforming the time-of-arrival measurements into time-difference-of-arrival measurements, the clock offset of the target's clock is eradicated. However, there still exists the unknown clock skew, which may degrade the localization performance. Since the range of the clock skew is usually known as a priori, we assume that it follows a uniform distribution within this range. By doing so, we take it as a part of measurement noise and estimate the target node position only. To estimate the target node position, we formulate a fractional programming problem and further show that it can be solved by solving one single mixed semidefinite and second-order cone program (SD/SOCP). Simulation results illustrate the superior performance of the proposed method over the existing methods.
abstractGer	In this paper, we address the target device localization problem in the asynchronous networks. For the purpose of saving power resources, the target device is not synchronized with the anchor nodes, but is only required to listen to the signals transmitted from the anchors, which, however, introduces two extra nuisance parameters: the target's clock skew and clock offset. By transforming the time-of-arrival measurements into time-difference-of-arrival measurements, the clock offset of the target's clock is eradicated. However, there still exists the unknown clock skew, which may degrade the localization performance. Since the range of the clock skew is usually known as a priori, we assume that it follows a uniform distribution within this range. By doing so, we take it as a part of measurement noise and estimate the target node position only. To estimate the target node position, we formulate a fractional programming problem and further show that it can be solved by solving one single mixed semidefinite and second-order cone program (SD/SOCP). Simulation results illustrate the superior performance of the proposed method over the existing methods.
abstract_unstemmed	In this paper, we address the target device localization problem in the asynchronous networks. For the purpose of saving power resources, the target device is not synchronized with the anchor nodes, but is only required to listen to the signals transmitted from the anchors, which, however, introduces two extra nuisance parameters: the target's clock skew and clock offset. By transforming the time-of-arrival measurements into time-difference-of-arrival measurements, the clock offset of the target's clock is eradicated. However, there still exists the unknown clock skew, which may degrade the localization performance. Since the range of the clock skew is usually known as a priori, we assume that it follows a uniform distribution within this range. By doing so, we take it as a part of measurement noise and estimate the target node position only. To estimate the target node position, we formulate a fractional programming problem and further show that it can be solved by solving one single mixed semidefinite and second-order cone program (SD/SOCP). Simulation results illustrate the superior performance of the proposed method over the existing methods.
collection_details	GBV_USEFLAG_A SYSFLAG_A GBV_DOAJ GBV_ILN_11 GBV_ILN_20 GBV_ILN_22 GBV_ILN_23 GBV_ILN_24 GBV_ILN_31 GBV_ILN_39 GBV_ILN_40 GBV_ILN_60 GBV_ILN_62 GBV_ILN_63 GBV_ILN_65 GBV_ILN_69 GBV_ILN_70 GBV_ILN_73 GBV_ILN_95 GBV_ILN_105 GBV_ILN_110 GBV_ILN_151 GBV_ILN_161 GBV_ILN_170 GBV_ILN_213 GBV_ILN_230 GBV_ILN_285 GBV_ILN_293 GBV_ILN_370 GBV_ILN_602 GBV_ILN_2014 GBV_ILN_4012 GBV_ILN_4037 GBV_ILN_4112 GBV_ILN_4125 GBV_ILN_4126 GBV_ILN_4249 GBV_ILN_4305 GBV_ILN_4306 GBV_ILN_4307 GBV_ILN_4313 GBV_ILN_4322 GBV_ILN_4323 GBV_ILN_4324 GBV_ILN_4325 GBV_ILN_4335 GBV_ILN_4338 GBV_ILN_4367 GBV_ILN_4700
title_short	A Fractional Programming Method for Target Localization in Asynchronous Networks
url	https://doi.org/10.1109/ACCESS.2018.2873453 https://doaj.org/article/8661026e1d37461995297a688ad786b3 https://ieeexplore.ieee.org/document/8478381/ https://doaj.org/toc/2169-3536
remote_bool	true
author2	Nirwan Ansari Youming Li
author2Str	Nirwan Ansari Youming Li
ppnlink	728440385
callnumber-subject	TK - Electrical and Nuclear Engineering
mediatype_str_mv	c
isOA_txt	true
hochschulschrift_bool	false
doi_str	10.1109/ACCESS.2018.2873453
callnumber-a	TK1-9971
up_date	2024-07-03T14:09:20.614Z
_version_	1803567246205779968
fullrecord_marcxml	<?xml version="1.0" encoding="UTF-8"?><collection xmlns="http://www.loc.gov/MARC21/slim"><record><leader>01000caa a22002652 4500</leader><controlfield tag="001">DOAJ015298329</controlfield><controlfield tag="003">DE-627</controlfield><controlfield tag="005">20230310073730.0</controlfield><controlfield tag="007">cr uuu---uuuuu</controlfield><controlfield tag="008">230226s2018 xx \|\|\|\|\|o 00\| \|\|eng c</controlfield><datafield tag="024" ind1="7" ind2=" "><subfield code="a">10.1109/ACCESS.2018.2873453</subfield><subfield code="2">doi</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-627)DOAJ015298329</subfield></datafield><datafield tag="035" ind1=" " ind2=" "><subfield code="a">(DE-599)DOAJ8661026e1d37461995297a688ad786b3</subfield></datafield><datafield tag="040" ind1=" " ind2=" "><subfield code="a">DE-627</subfield><subfield code="b">ger</subfield><subfield code="c">DE-627</subfield><subfield code="e">rakwb</subfield></datafield><datafield tag="041" ind1=" " ind2=" "><subfield code="a">eng</subfield></datafield><datafield tag="050" ind1=" " ind2="0"><subfield code="a">TK1-9971</subfield></datafield><datafield tag="100" ind1="0" ind2=" "><subfield code="a">Gang Wang</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="245" ind1="1" ind2="2"><subfield code="a">A Fractional Programming Method for Target Localization in Asynchronous Networks</subfield></datafield><datafield tag="264" ind1=" " ind2="1"><subfield code="c">2018</subfield></datafield><datafield tag="336" ind1=" " ind2=" "><subfield code="a">Text</subfield><subfield code="b">txt</subfield><subfield code="2">rdacontent</subfield></datafield><datafield tag="337" ind1=" " ind2=" "><subfield code="a">Computermedien</subfield><subfield code="b">c</subfield><subfield code="2">rdamedia</subfield></datafield><datafield tag="338" ind1=" " ind2=" "><subfield code="a">Online-Ressource</subfield><subfield code="b">cr</subfield><subfield code="2">rdacarrier</subfield></datafield><datafield tag="520" ind1=" " ind2=" "><subfield code="a">In this paper, we address the target device localization problem in the asynchronous networks. For the purpose of saving power resources, the target device is not synchronized with the anchor nodes, but is only required to listen to the signals transmitted from the anchors, which, however, introduces two extra nuisance parameters: the target's clock skew and clock offset. By transforming the time-of-arrival measurements into time-difference-of-arrival measurements, the clock offset of the target's clock is eradicated. However, there still exists the unknown clock skew, which may degrade the localization performance. Since the range of the clock skew is usually known as a priori, we assume that it follows a uniform distribution within this range. By doing so, we take it as a part of measurement noise and estimate the target node position only. To estimate the target node position, we formulate a fractional programming problem and further show that it can be solved by solving one single mixed semidefinite and second-order cone program (SD/SOCP). Simulation results illustrate the superior performance of the proposed method over the existing methods.</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">Fractional programming (FP)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">localization</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">time-of-arrival (TOA)</subfield></datafield><datafield tag="650" ind1=" " ind2="4"><subfield code="a">time-difference-of-arrival (TDOA)</subfield></datafield><datafield tag="653" ind1=" " ind2="0"><subfield code="a">Electrical engineering. Electronics. Nuclear engineering</subfield></datafield><datafield tag="700" ind1="0" ind2=" "><subfield code="a">Nirwan Ansari</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="700" ind1="0" ind2=" "><subfield code="a">Youming Li</subfield><subfield code="e">verfasserin</subfield><subfield code="4">aut</subfield></datafield><datafield tag="773" ind1="0" ind2="8"><subfield code="i">In</subfield><subfield code="t">IEEE Access</subfield><subfield code="d">IEEE, 2014</subfield><subfield code="g">6(2018), Seite 56727-56736</subfield><subfield code="w">(DE-627)728440385</subfield><subfield code="w">(DE-600)2687964-5</subfield><subfield code="x">21693536</subfield><subfield code="7">nnns</subfield></datafield><datafield tag="773" ind1="1" ind2="8"><subfield code="g">volume:6</subfield><subfield code="g">year:2018</subfield><subfield code="g">pages:56727-56736</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doi.org/10.1109/ACCESS.2018.2873453</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://doaj.org/article/8661026e1d37461995297a688ad786b3</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="856" ind1="4" ind2="0"><subfield code="u">https://ieeexplore.ieee.org/document/8478381/</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="856" ind1="4" ind2="2"><subfield code="u">https://doaj.org/toc/2169-3536</subfield><subfield code="y">Journal toc</subfield><subfield code="z">kostenfrei</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_USEFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">SYSFLAG_A</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_DOAJ</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_11</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_20</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_22</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_23</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_24</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_31</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_39</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_40</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_60</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_62</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_63</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_65</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_69</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_70</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_73</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_95</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_105</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_110</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_151</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_161</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_170</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_213</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_230</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_285</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_293</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_370</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_602</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_2014</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4012</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4037</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4112</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4125</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4126</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4249</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4305</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4306</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4307</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4313</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4322</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4323</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4324</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4325</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4335</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4338</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4367</subfield></datafield><datafield tag="912" ind1=" " ind2=" "><subfield code="a">GBV_ILN_4700</subfield></datafield><datafield tag="951" ind1=" " ind2=" "><subfield code="a">AR</subfield></datafield><datafield tag="952" ind1=" " ind2=" "><subfield code="d">6</subfield><subfield code="j">2018</subfield><subfield code="h">56727-56736</subfield></datafield></record></collection>
score	7.4019566

Nicht das Richtige dabei?

Schreiben Sie uns!

A Fractional Programming Method for Target Localization in Asynchronous Networks

Nicht das Richtige dabei?

Zugang & Verfügbarkeit

Vorhandene Bände

Nicht das Richtige dabei?