A Theory of Network Localization

Author

Aspnes, James ; Eren, Tolga ; Goldenberg, David K. ; Morse, A.S. ; Whiteley, Walter ; Yang, Y. Richard ; Anderson, Brian D O ; Belhumeur, Peter N.

Author_Institution

Dept. of Comput. Sci., Yale Univ., New Haven, CT

Volume

5

Issue

12

fYear

2006

Firstpage

1663

Lastpage

1678

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

Keywords

computational complexity; graph theory; wireless sensor networks; computational complexity; graph rigidity theory; grounded graphs; network localization theory; sensor networks; Algorithm design and analysis; Computational complexity; Computer networks; Computer vision; Global Positioning System; Large-scale systems; Mathematics; Mobile computing; Pervasive computing; Printers; Computer systems organization; algorithm/protocol design and analysis; analysis of algorithms and problem complexity; architectures; communication/networking and IT; computer applications; discrete mathematics; geometrical problems and computation; graph theory; location-dependent and sensitive; mathematics of computing; mobile applications; mobile computing; network problems; nonnumerical algorithms and problems; theory of computation; wireless sensor networks.;

fLanguage

English

Journal_Title

Mobile Computing, IEEE Transactions on

Publisher

ieee

ISSN

1536-1233

Type

jour

DOI

10.1109/TMC.2006.174

Filename

1717436