Cooperative method for wireless sensor network localization

In order to obtain an efficient wireless sensor network localization, several enhancements based on the decentralized approach are proposed. These features can be used in the cases when multiple distance measurements are used as input, where each node iteratively updates its estimated position using...

Full description

Saved in:
Bibliographic Details
Published inAd hoc networks Vol. 40; pp. 61 - 72
Main Authors Stanoev, Angel, Filiposka, Sonja, In, Visarath, Kocarev, Ljupco
Format Journal Article
LanguageEnglish
Published Elsevier B.V 01.04.2016
Subjects
Online AccessGet full text
ISSN1570-8705
1570-8713
DOI10.1016/j.adhoc.2016.01.003

Cover

More Information
Summary:In order to obtain an efficient wireless sensor network localization, several enhancements based on the decentralized approach are proposed. These features can be used in the cases when multiple distance measurements are used as input, where each node iteratively updates its estimated position using a maximum likelihood estimation method based on the previously estimated positions of its neighbors. Three novel features are introduced. First, a backbone is constructed, that is, a subset of nodes that are intermediaries between multiple beacon nodes, which guides the localization process of the other (non-backbone) nodes. Second, the space is perturbed more often during the earlier time steps to avoid reaching poor local minima in some cases regarding the localization optimization function. Third, for better localization of the non-backbone (or peripheral) nodes and avoidance of the rigidity problem, 2-hop neighboring distances are approximated. The introduced features are incorporated in a range-based algorithm that is fully distributed, shows good performance, and is scalable to arbitrary network size.
Bibliography:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 23
ISSN:1570-8705
1570-8713
DOI:10.1016/j.adhoc.2016.01.003