Performance Limits and Geometric Properties of Array Localization
Yanjun Han, Yuan Shen, Xiao-Ping Zhang, Moe Z. Win, Huadong Meng

TL;DR
This paper analyzes the fundamental limits of array-based localization accuracy in wireless networks, considering static and dynamic scenarios, and introduces geometric measures to evaluate network performance.
Contribution
It derives the Cramér-Rao bound for array localization, decomposes Fisher information into distance and direction components, and proposes geometric performance measures.
Findings
Localization information is a weighted sum of anchor-antenna Fisher matrices.
Doppler shift adds direction information in dynamic scenarios.
Performance measures are validated through formulas and simulations.
Abstract
Location-aware networks are of great importance and interest in both civil and military applications. This paper determines the localization accuracy of an agent, which is equipped with an antenna array and localizes itself using wireless measurements with anchor nodes, in a far-field environment. In view of the Cram\'er-Rao bound, we first derive the localization information for static scenarios and demonstrate that such information is a weighed sum of Fisher information matrices from each anchor-antenna measurement pair. Each matrix can be further decomposed into two parts: a distance part with intensity proportional to the squared baseband effective bandwidth of the transmitted signal and a direction part with intensity associated with the normalized anchor-antenna visual angle. Moreover, in dynamic scenarios, we show that the Doppler shift contributes additional direction…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
