Abstract
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.
| Original language | English (US) |
|---|---|
| Title of host publication | 2019 IEEE International Conference on Communications Workshops (ICC Workshops) |
| Publisher | IEEE |
| ISBN (Print) | 9781728123738 |
| DOIs | |
| State | Published - Jul 11 2019 |
| Externally published | Yes |
Bibliographical note
KAUST Repository Item: Exported on 2022-06-30Acknowledged 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.