Abstract
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.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
