Localization of sensor networks using sweeps

被引：19

作者：

Fang, J. ^{[1
]}

Cao, M. ^{[1
]}

Morse, A. S. ^{[1
]}

Anderson, B. D. O. ^{[2
,3
]}

机构：

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

[2] Australian Natl Univ, Canberra, ACT, Australia

[3] Natl ICT Australia Ltd, Sydney, NSW, Australia

来源：

PROCEEDINGS OF THE 45TH IEEE CONFERENCE ON DECISION AND CONTROL, VOLS 1-14 | 2006年

基金：

美国国家科学基金会; 澳大利亚研究理事会;

关键词：

D O I：

10.1109/CDC.2006.377052

中图分类号：

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

学科分类号：

0812 ;

摘要：

The sensor network localization problem with distance information is to determine the positions of all sensors in a network given the positions of some sensors and the distances between some pairs of sensors. We present a specialized localization algorithm and identify the graph properties of some classes of networks that can be localized by the algorithm. We also give an important application of our algorithm in creating formations in multi-agent systems.

引用

页码：4645 / +

页数：2

共 9 条

[1] Recursive position estimation in sensor networks [J].

Albowicz, J ;

Chen, A ;

Zhang, LX .

NETWORK PROTOCOLS, 2001, :35-41

[2]

ANDERSON BDO, UNPUB WIRELESS NETWO

[3]

ASPNES J, 2005, T MOBILE COMPUTING

[4]

DOHERTY L, 2001, P IEEE INFOCOM

[5]

EREN T, 2004, P IEEE INFOCOM

[6]

GOLDENBERG D, 2005, P IEEE INFOCOM

[7]

Goldenberg David K., 2006, LOCALIZATION SPARSE

[8]

NICULESCU D, 2001, P IEEE GLOBECOM

[9] The n-hop multilateration primitive for node localization problems [J].

Savvides, A ;

Park, H ;

Srivastava, MB .

MOBILE NETWORKS & APPLICATIONS, 2003, 8 (04) :443-451

← 1 →