Asynchronous distributed localization in networks with communication delays and packet losses

This paper studies the problem of determining sensor locations in a large sensor network using only relative distance (range) measurement. Based on the barycentric coordinate representation, we propose a totally asynchronous distributed algorithm under DILOC framework due to independence of sensor u...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:Automatica (Oxford) Ročník 96; s. 134 - 140
Hlavní autoři: Huang, Xu-Zhou, Tian, Yu-Ping
Médium: Journal Article
Jazyk:angličtina
Vydáno: Elsevier Ltd 01.10.2018
Témata:
Asynchronous algorithm
Barycentric coordinate
Network localization
Packet loss
Time-varying delay
Network localization
Asynchronous algorithm
Time-varying delay
Barycentric coordinate
Packet loss
ISSN:0005-1098, 1873-2836
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:This paper studies the problem of determining sensor locations in a large sensor network using only relative distance (range) measurement. Based on the barycentric coordinate representation, we propose a totally asynchronous distributed algorithm under DILOC framework due to independence of sensor update instants and unreliable networks with communication delays and packet losses. Through modeling the asynchronous algorithm as a linear difference equation with time-varying delays, we prove that the location estimates of sensors are globally convergent to the true coordinates if: (1) time interval between any two consecutive update instants is bounded from below and above, (2) communication delays and successive packet losses between sensors are finite. Simulation examples are provided to demonstrate the effectiveness of the theoretical result.
ISSN:0005-1098
1873-2836
DOI:10.1016/j.automatica.2018.06.048