TY - GEN
T1 - Efficiency of cooperation and its geometric interpretation in network localization
AU - Xiong, Yifeng
AU - Wu, Nan
AU - Shen, Yuan
AU - Win, Moe Z.
N1 - KAUST Repository Item: Exported on 2022-06-30
Acknowledged KAUST grant number(s): OSR-2015-SENSORS-2700
Acknowledgements: This research was supported in part by the KAUST Sensor Research Initiative under Award OSR-2015-SENSORS-2700, and in part by the “National Science Foundation of China (NSFC)” (Grant Nos. 61571041, 61871256), and in part by the “A Foundation for the Author of National Excellent Doctoral Dissertation of P.R. China (FANEDD)” (Grant No. 201445).
This publication acknowledges KAUST support, but has no KAUST affiliated authors.
PY - 2019/7/11
Y1 - 2019/7/11
N2 - Network localization is an enabling technique for various wireless applications. Cooperation among nodes can provide significant coverage and accuracy improvements for location-aware networks. On the other hand, it also incurs complex coupling of position information among nodes, which hinders the understanding of the localization performance. In this paper, we develop a graph-theoretical approach to the analysis of information coupling. We show that the efficiency of cooperation for a specific node depends on the number of routes spanning from itself to the anchors, which implies that the popular sequential position estimators may be far from optimal in large networks. Our results can provide guidelines for the design of network operation techniques.
AB - Network localization is an enabling technique for various wireless applications. Cooperation among nodes can provide significant coverage and accuracy improvements for location-aware networks. On the other hand, it also incurs complex coupling of position information among nodes, which hinders the understanding of the localization performance. In this paper, we develop a graph-theoretical approach to the analysis of information coupling. We show that the efficiency of cooperation for a specific node depends on the number of routes spanning from itself to the anchors, which implies that the popular sequential position estimators may be far from optimal in large networks. Our results can provide guidelines for the design of network operation techniques.
UR - http://hdl.handle.net/10754/679463
UR - https://ieeexplore.ieee.org/document/8757179/
UR - http://www.scopus.com/inward/record.url?scp=85070292236&partnerID=8YFLogxK
U2 - 10.1109/ICCW.2019.8757179
DO - 10.1109/ICCW.2019.8757179
M3 - Conference contribution
SN - 9781728123738
BT - 2019 IEEE International Conference on Communications Workshops (ICC Workshops)
PB - IEEE
ER -