Abstract
This paper studies the problem of determining the sensor locations in a large sensor network using only relative distance (range) measurements. Based on a generalized barycentric coordinate representation, our work generalizes the DILOC algorithm to the localization problem under arbitrary deployments of sensor nodes and anchor nodes. First, a criterion and algorithm are developed to determine a generalized barycentric coordinate of a node with respect to its neighboring nodes, which do not require the node to be inside the convex hull of its neighbors. Next, for the localization problem based on the generalized barycentric coordinate representation, a necessary and sufficient condition for the localizability of a sensor network with a generic configuration is obtained. Finally, a new linear iterative algorithm is proposed to ensure distributed implementation as well as global convergence to the true coordinates.
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.
