Abstract
Distance-based network localization is known to have solution, in general, if the network is globally rigid. In this technical note we relax this condition with reference to unit disk graphs. To this end, shadow edges are introduced to model the fact that selected nodes are not able to sense each other. We provide a localization algorithm based on such edges and a necessary and sufficient localizability condition. We also investigate the relation between the proposed approach and trilateration, showing from both a theoretical and empirical perspective that shadow edge localization succeeds also when trilateration fails.
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.
