Translator Disclaimer
Paper
28 April 2004 New distributed positioning algorithm for ad hoc positioning system
Author Affiliations +
Proceedings Volume 5284, Wireless Communications and Networks; (2004) https://doi.org/10.1117/12.523392
Event: Asia-Pacific Optical and Wireless Communications, 2003, Wuhan, China
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.
© (2004) COPYRIGHT Society of Photo-Optical Instrumentation Engineers (SPIE). Downloading of the abstract is permitted for personal use only.
Yun Wang, Qiping Hu, Ruimin Hu, Ce Wang, and Hongbin Wang "New distributed positioning algorithm for ad hoc positioning system", Proc. SPIE 5284, Wireless Communications and Networks, (28 April 2004); https://doi.org/10.1117/12.523392
PROCEEDINGS
9 PAGES


SHARE
Advertisement
Advertisement
Back to Top