Space-Time Hierarchical-Graph Based Cooperative Localization in Wireless Sensor Networks
Tiejun Lv, Hui Gao, Xiaopeng Li, Shaoshi Yang, Lajos Hanzo

TL;DR
This paper introduces a space-time hierarchical-graph scheme for cooperative localization in wireless sensor networks, improving accuracy and efficiency by layered position estimation, optimized message passing, and energy-saving mechanisms.
Contribution
It proposes a novel hierarchical-graph based method that enhances localization accuracy and reduces computational and energy costs in sensor networks.
Findings
The scheme exhibits fast convergence in localization tasks.
It reduces energy consumption and network traffic.
It outperforms benchmark localization schemes.
Abstract
It has been shown that cooperative localization is capable of improving both the positioning accuracy and coverage in scenarios where the global positioning system (GPS) has a poor performance. However, due to its potentially excessive computational complexity, at the time of writing the application of cooperative localization remains limited in practice. In this paper, we address the efficient cooperative positioning problem in wireless sensor networks. A space-time hierarchical-graph based scheme exhibiting fast convergence is proposed for localizing the agent nodes. In contrast to conventional methods, agent nodes are divided into different layers with the aid of the space-time hierarchical-model and their positions are estimated gradually. In particular, an information propagation rule is conceived upon considering the quality of positional information. According to the rule, the…
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.
