Abstract
Distributed localization in wireless sensor networks is essential for verifying the positions of the sensor nodes deployed in the sensing field based on information interactions. However, the information transmitted from the controller to the actuator for each sensor node may be lost owing to communication noise, channel interference, or network congestion. With this in mind, this paper aims at investigating the distributed localization for wireless sensor networks subject to random lossy links. The barycentric coordinate, which can be determined by the distance measurements between node pairs in the network, is used as the basic scheme for range-based localization. First, based on the characterization of random link loss in wireless sensor networks with a Bernoulli random variable, a distributed iterative localization algorithm is proposed. And then, the global convergence of the proposed localization algorithm which ensures accurate localization is theoretically proved by using the convergence of sub-stochastic matrices’ product. Finally, numerical examples are conducted to illustrate the effectiveness of the proposed localization algorithm.
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.
