Your Search Results

Use this resource - and many more! - in your textbook!

AcademicPub holds over eight million pieces of educational content for you to mix-and-match your way.

Experience the freedom of customizing your course pack with AcademicPub!
Not an educator but still interested in using this content? No problem! Visit our provider's page to contact the publisher and get permission directly.

A Theory of Network Localization

By: Eren, T.; Aspnes, J.; Belhumeur, P.N.; Anderson, B.D.O.; Goldenberg, D.K.; Yang, Y.R.; Whiteley, W.; Morse, A.S.;

2006 / IEEE


This item was taken from the IEEE Periodical ' A Theory of Network Localization ' In this paper, we provide a theoretical foundation for the problem of network localization in which some nodes know their locations and other nodes determine their locations by measuring the distances to their neighbors. We construct grounded graphs to model network localization and apply graph rigidity theory to test the conditions for unique localizability and to construct uniquely localizable networks. We further study the computational complexity of network localization and investigate a subclass of grounded graphs where localization can be computed efficiently. We conclude with a discussion of localization in sensor networks where the sensors are placed randomly