Sensor network localization with imprecise distances

被引：86

作者：

Cao, Ming ^{[1
]}

Anderson, Brian D. O.

Morse, A. Stephen

机构：

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

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

[3] Natl ICT Australia Ltd, Canberra, ACT 2601, Australia

来源：

SYSTEMS & CONTROL LETTERS | 2006年 / 55卷 / 11期

关键词：

sensor networks; localization; distance geometry; optimization;

D O I：

10.1016/j.sysconle.2006.05.004

中图分类号：

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

学科分类号：

0812 ;

摘要：

An approach to formulate geometric relations among distances between nodes as equality constraints is introduced in this paper to study the localization problem with imprecise distance information in sensor networks. These constraints can be further used to formulate optimization problems for distance estimation. The optimization solutions correspond to a set of distances that are consistent with the fact that sensor nodes live in the same plane or 3D space as the anchor nodes. These techniques serve as the foundation for most of the existing localization algorithms that depend on the sensors' distances to anchors to compute each sensor's location. (C) 2006 Elsevier B.V. All rights reserved.

引用

页码：887 / 893

页数：7

共 16 条

[1]

BLUMENTHAL L., 1953, THEORY APPL DISTANCE

[2]

Coxeter HSM, 1969, INTRO GEOMETRY, P12

[3]

Crippen G. M., 1988, DISTANCE GEOMETRY MO

[4]

Culler D., 2002, P 1 ACM INT WORKSH S

[5]

GANDER W, 1981, NUMER MATH, V36, P291, DOI 10.1007/BF01396656

[6]

Golub G., 1965, Numerische Mathematik, V7, P206, DOI DOI 10.1007/BF01436075

[7] QUADRATICALLY CONSTRAINED LEAST-SQUARES AND QUADRATIC PROBLEMS [J].

GOLUB, GH ;

VONMATT, U .

NUMERISCHE MATHEMATIK, 1991, 59 (06) :561-580

[8] Distributed localization in wireless sensor networks: a quantitative comparison [J].

Langendoen, K ;

Reijers, N .

COMPUTER NETWORKS, 2003, 43 (04) :499-518

[9]

MOORE D, 2004, P SENSYS

[10]

NICULESCU D, 2003, J AD HOC NETWORKS, V1, P247

← 1 2 →