Graphical properties of easily localizable sensor networks

被引：74

作者：

Anderson, Brian D. O. ^{[1
,2
]}

Belhumeur, Peter N. ^{[3
]}

Eren, Tolga ^{[3
]}

Goldenberg, David K. ^{[4
]}

Morse, A. Stephen ^{[5
]}

Whiteley, Walter ^{[6
]}

Yang, Y. Richard ^{[4
]}

机构：

[1] Australian Natl Univ, Natl ICT Australia, Canberra, ACT, Australia

[2] Australian Natl Univ, Res Sch Informat Sci & Engn, Canberra, ACT, Australia

[3] Columbia Univ, Dept Comp Sci, New York, NY 10027 USA

[4] Yale Univ, Dept Comp Sci, New Haven, CT 06520 USA

[5] Yale Univ, Dept Elect Engn, New Haven, CT USA

[6] York Univ, Dept Math & Stat, Toronto, ON M3J 2R7, Canada

来源：

WIRELESS NETWORKS | 2009年 / 15卷 / 02期

基金：

澳大利亚研究理事会; 美国国家卫生研究院; 加拿大自然科学与工程研究理事会; 美国国家科学基金会;

关键词：

Localization; Sensor networks; Global rigidity; Graph theory; RIGIDITY;

D O I：

10.1007/s11276-007-0034-9

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

The sensor network localization problem is one of determining the Euclidean positions of all sensors in a network given knowledge of the Euclidean positions of some, and knowledge of a number of inter-sensor distances. This paper identifies graphical properties which can ensure unique localizability, and further sets of properties which can ensure not only unique localizability but also provide guarantees on the associated computational complexity, which can even be linear in the number of sensors on occasions. Sensor networks with minimal connectedness properties in which sensor transmit powers can be increased to increase the sensing radius lend themselves to the acquiring of the needed graphical properties. Results are presented for networks in both two and three dimensions.

引用

页码：177 / 191

页数：15

共 44 条

[41]

Tay T.-S., 1985, Structural Topology, V11, P21

[42] STATISTICAL-THEORY OF PASSIVE LOCATION SYSTEMS [J].

TORRIERI, DJ .

IEEE TRANSACTIONS ON AEROSPACE AND ELECTRONIC SYSTEMS, 1984, 20 (02) :183-198

[43]

WEISER M, 1993, COMMUNICATIONS A JUL

[44]

WHITELEY W, 1996, CONT MATH, V197

← 1 2 3 4 5 →