Abstract
Node localization in wireless sensor networks (WSNs) has received a considerable amount of attention. In this paper, using the natural low-rank properties of the Euclidean distance matrix (EDM), we formulate the node location finding problem from only a small fraction of random entries of the EDM as a low-rank matrix recovery problem. A Bayesian-learning-based method is utilized to recover the original EDM, based on which the relative positions of all the sensor nodes in WSNs are accurately estimated by applying classical multi-dimensional scaling (MDS). In addition, with the location knowledge of anchor nodes, we transform the relative positions into absolute positions. The simulation results illustrate that our proposed approach leads to superior performance over various other methods.
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.
