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.
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
Global Positioning System
Wireless Sensor Networks.
Computer Systems Organization
Communication/networking And It
Algorithm/protocol Design And Analysis
Theory Of Computation
Analysis Of Algorithms And Problem Complexity
Nonnumerical Algorithms And Problems
Geometrical Problems And Computation
Mathematics Of Computing
Location-dependent And Sensitive
Graph Rigidity Theory
Network Localization Theory
Wireless Sensor Networks
Computing And Processing
Algorithm Design And Analysis