A Theory of Network Localization
IEEE Transactions on Mobile Computing2006Vol. 5(12), pp. 1663–1678
Citations Over TimeTop 1% of 2006 papers
James Aspnes, Tolga Eren, David K. Goldenberg, A. Stephen Morse, Walter Whiteley, Yufan Yang, Brian D. O. Anderson, Peter N. Belhumeur
Abstract
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.
Related Papers
- → The origins and early development of the psychological contract construct(1997)231 cited
- Review of journal of construction of modern and contemporary times in China(2005)
- The Generic Cabling System of Construct(2005)
- Susquehanna Chorale Spring Concert "Roots and Wings"(2017)
- → The Development of Leader-Member Exchange Construct and the Emergence of Algorithmic Leader-Member Exchange Construct in the Gig Economy(2023)