A partial-range-aware localization algorithm for ad-hoc wireless sensor networks

被引：0

作者：

Li, XL ^{[1
]}

Shi, HC ^{[1
]}

Shang, Y ^{[1
]}

机构：

[1] Univ Missouri, Dept Comp Sci, Columbia, MO 65211 USA

来源：

LCN 2004: 29TH ANNUAL IEEE INTERNATIONAL CONFERENCE ON LOCAL COMPUTER NETWORKS, PROCEEDINGS | 2004年

关键词：

D O I：

暂无

中图分类号：

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

学科分类号：

0812 ;

摘要：

Current wireless sensor network localization algorithms are categorized either as range-free or range-aware algorithms based on whether they use the range (i.e., distance) information. Although wireless sensor systems usually have available received signal strength (RSS) readings, this useful information has not been effectively used in the existing localization algorithms. The existing range-free algorithms do not use this information, and the range-aware algorithms require sophisticated range techniques to estimate ranges. In this paper, we introduce and develop a partial-range-aware localization scheme utilizing RSS readings. The scheme can be implemented in a distributed way and can be used in any hop-based range-free algorithms to improve their localization accuracy. Through extensive simulation, the results show that the partial-range-aware algorithm can improve the localization accuracy by reducing position errors up to 50% of the previous range-free localization results.

引用

页码：77 / 83

页数：7

共 19 条

[1]

CAPKUN S, 2001, P HAW INT C SYST SCI

[2]

DOHERTY L, 2001, P INF

[3]

HE T, 2003, ACM IEEE INT C MOB C

[4] Location systems for ubiquitous [J].

Hightower, J ;

Borriello, G .

COMPUTER, 2001, 34 (08) :57-+

[5]

Howard A, 2001, IROS 2001: PROCEEDINGS OF THE 2001 IEEE/RJS INTERNATIONAL CONFERENCE ON INTELLIGENT ROBOTS AND SYSTEMS, VOLS 1-4, P1055, DOI 10.1109/IROS.2001.976308

[6]

LANGENDOEN K, 2003, COMPUTE NETWORKS ELS

[7]

*LMSC IEEE COMP SO, 1999, 802111999 LMSC IEEE

[8]

NASIPURI A, 2002, 1 ACM INT WORKSH WIR, P105

[9]

Niculescu D., 2001, GLOBECOM

[10]

PATWARI N, 2003, P 2 INT ACM WORKSH W

← 1 2 →