Cooperative Localization in Massive Networks

DOI10.1109/TIT.2021.3126346zbMATH Open1489.94046arXiv2110.08062MaRDI QIDQ5030360FDOQ5030360

Authors: Yifeng Xiong, Nan Wu, Yuan Shen, Moe Z. Win 

Publication date: 17 February 2022

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Abstract: Network localization is capable of providing accurate and ubiquitous position information for numerous wireless applications. This paper studies the accuracy of cooperative network localization in large-scale wireless networks. Based on a decomposition of the equivalent Fisher information matrix (EFIM), we develop a random-walk-inspired approach for the analysis of EFIM, and propose a position information routing interpretation of cooperative network localization. Using this approach, we show that in large lattice and stochastic geometric networks, when anchors are uniformly distributed, the average localization error of agents grows logarithmically with the reciprocal of anchor density in an asymptotic regime. The results are further illustrated using numerical examples.

Full work available at URL: https://arxiv.org/abs/2110.08062

zbMATH Keywords

accuracy of cooperative network localizationaverage localization error of agentequivalent Fisher information matrix (EFIM)large-scale wireless networks

Mathematics Subject Classification ID

Statistical aspects of information-theoretic topics (62B10) Informational aspects of data analysis and big data (94A16)

Cited In (4)

• Location-Aided Fast Distributed Consensus in Wireless Networks
• Cooperative localization bounds for indoor ultra-wideband wireless sensor networks
• Cooperative Detection by Multi-Agent Networks in the Presence of Position Uncertainty
• On Using the Relative Configuration to Explore Cooperative Localization

This page was built for publication: Cooperative Localization in Massive Networks

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5030360)