Distributed networked localization using neighboring distances only through a computational topology control approach. (March 2020)

• Record Type: Journal Article
• Authors: Wang, Xiaochu; Sun, Ting; Sun, Changhao; Wang, Junqi
• Is Part Of: International journal of distributed sensor networks. Volume 16:Number 3(2020)
• Publication Date: 2020-03
• Subjects: Node localization -- distributed algorithm -- global optimum -- sensor networks -- topology control; Sensor networks -- Periodicals; Intelligent agents (Computer software) -- Periodicals; Multisensor data fusion -- Periodicals; 681.2
• DOI: 10.1177/1550147720912397
• Languages: English
• ISSNs: 1550-1329

Abstract

For large-scale wireless sensor networks, the nonlinear localization problem where only neighboring distances are available to each individual sensor nodes have been attracting great research attention. In general, distributed algorithms for this problem are likely to suffer from the failures that localizations are trapped in local minima. Focusing on this issue, this article considers a fully distributed algorithm by introducing a novel mechanism, where each individual node is allowed to computationally interact with a random subset of its neighbors, for helping localizations escape from local minima. Theoretical analyses reveal that with the proposed algorithm, any local minimum of the localization will be unstable, and the global optimum would finally be achieved with probability 1 after enough time of iterations. Numerical simulations are given as well to demonstrate the effectiveness of the algorithm.