Share Email Print

Proceedings Paper

New distributed positioning algorithm for ad hoc positioning system
Author(s): Yun Wang; Qiping Hu; Ruimin Hu; Ce Wang; Hongbin Wang
Format Member Price Non-Member Price
PDF $17.00 $21.00

Paper Abstract

Position information of individual node is useful in implementing functions such as routing and querying in ad-hoc networks. But adding GPS receivers or other sophisticated sensors to every node can be expensive. In this paper, we present the distributed, hop by hop positioning algorithm for solving the problem of positioning nodes within an ad hoc, wireless network of low powered sensor nodes, low mobility and large size without the aid of GPS aid. It works as an extension of both DV-hop propagation and GPS positioning in order to provide absolute position estimate for all nodes in a network where only a limited fraction of nodes have self location capability we call anchors. The procedure is partitioned into three phases: global location, local refinement and Kalman filter optimization, each phase is described in detail. The simulation environment used to evaluate this algorithm is also explained, including details about the specific implementation of each phase and experimental results, which demonstrate that the algorithm is more robust to measurement error than previous proposals, and it needs much fewer anchor nodes than previous algorithms to get comparable results.

Paper Details

Date Published: 28 April 2004
PDF: 9 pages
Proc. SPIE 5284, Wireless Communications and Networks, (28 April 2004); doi: 10.1117/12.523392
Show Author Affiliations
Yun Wang, Wuhan Univ. (China)
Qiping Hu, Wuhan Univ. (China)
Ruimin Hu, Wuhan Univ. (China)
Ce Wang, Wuhan Univ. (China)
Hongbin Wang, Wuhan Univ. (China)

Published in SPIE Proceedings Vol. 5284:
Wireless Communications and Networks
Chih-Lin I; Jiann-An Tsai; Hequan Wu, Editor(s)

© SPIE. Terms of Use
Back to Top