Using angle of arrival (bearing) information in network localization

被引：0

作者：

Eren, Tolga ^{[1
]}

Whiteley, Walter ^{[2
]}

Belhumeur, Peter N. ^{[3
]}

机构：

[1] Kirikkale Univ, Dept Elect Engn, Kirikkale, Turkey

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

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

来源：

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

基金：

美国国家科学基金会;

关键词：

D O I：

暂无

中图分类号：

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

学科分类号：

0812 ;

摘要：

In this paper, we consider using angle of arrival information (bearing) for sensor network localization. The essential property we require in this paper is that a node can infer heading information from its neighbors. We address the uniqueness of network localization solutions by the theory of globally rigid graphs. We show that while the parallel rigidity problem for formations with bearings is isomorphic to the distance case, the global rigidity of the formation is simpler (in fact identical to the simpler rigidity case) for a network with bearings, compared to formations with distances.

引用

页码：4677 / +

页数：2

共 17 条

[1] Ash J. N., 2004, Proceedings of the 2004 Allerton Conference on Communication, Control, and Computing, P1861
[2] ASPNES J, 2006, IN PRESS IEEE T MOBI
[3] Generic global rigidity
Connelly, R
[J]. DISCRETE & COMPUTATIONAL GEOMETRY, 2005, 33 (04) : 549 - 563
[4] Eren T, 2003, 42ND IEEE CONFERENCE ON DECISION AND CONTROL, VOLS 1-6, PROCEEDINGS, P3064
[5] EREN T, 2005, CUCS00806
[6] EREN T, 2005, CUCS01005
[7] FIDAN B, IEE P CONTR THEOR AP
[8] HENDRICKX JM, 2005, P 44 IEEE C DEC CONT
[9] NICULESCU D, 2003, P IEEE INFOCOM 03 SA
[10] Locating the nodes
Patwari, N
Ash, JN
Kyperountas, S
Hero, AO
Moses, RL
Correal, NS
[J]. IEEE SIGNAL PROCESSING MAGAZINE, 2005, 22 (04) : 54 - 69

← 1 2 →