Distributed networked localization using neighboring distances only through a computational topology control approach

Xiaochu Wang, Ting Sun, Changhao Sun and Junqi Wang

International Journal of Distributed Sensor Networks, 2020, vol. 16, issue 3, 1550147720912397

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.

Keywords: Node localization; distributed algorithm; global optimum; sensor networks; topology control (search for similar items in EconPapers)
Date: 2020
References: View complete reference list from CitEc
Citations:

Downloads: (external link)
https://journals.sagepub.com/doi/10.1177/1550147720912397 (text/html)

Related works:
This item may be available elsewhere in EconPapers: Search for items with the same title.

Export reference: BibTeX RIS (EndNote, ProCite, RefMan) HTML/Text

Persistent link: https://EconPapers.repec.org/RePEc:sae:intdis:v:16:y:2020:i:3:p:1550147720912397

DOI: 10.1177/1550147720912397

Access Statistics for this article

More articles in International Journal of Distributed Sensor Networks
Bibliographic data for series maintained by SAGE Publications ().