Cooperative Localization in Massive Networks
arXiv:2110.08062 · doi:10.1109/TIT.2021.3126346
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.
References in corpus (9)
- Fundamental Limits of Wideband Localization - Part II: Cooperative Networks
- Modeling and Analysis of Cellular Networks using Stochastic Geometry: A Tutorial
- Direct Localization for Massive MIMO
- Distributed Maximum Likelihood Sensor Network Localization
- A Stochastic Geometry Framework for Analyzing Pairwise-Cooperative Cellular Networks
- Performance Limits and Geometric Properties of Array Localization
- Cooperative Network Synchronization: Asymptotic Analysis
- Cooperative Joint Localization and Clock Synchronization Based on Gaussian Message Passing in Asynchronous Wireless Networks
- On the Outage Probability of Localization in Randomly Deployed Wireless Networks