An Improvement of DV-Hop Algorithm in Wireless Sensor Networks
Authors:
- Wei-Wei JiWJWei-Wei Ji
- Zhong LiuZLZhong Liu
- 1 September 2006
- conference paper
- Published by Institute of Electrical and Electronics Engineers (IEEE)
- No. 21619646,p. 1-4
Abstract
The node localization is an important problem for location-dependent applications of wireless sensor networks. The research has drawn wide attention in recent years. The localization can be categorized as range-free or range-based schemes based on whether the range information is used among the localization process. Because of the hardware limitations of the network devices, solutions in range-free localization are being pursued as a cost-effective alternative to more expensive range-based approaches. DV-Hop is one of the range-free localization algorithms using hop-distance estimate. In this paper, we develop a new estimation model and improve the DV-Hop algorithm by considering the relationships between the communication ranges and the hop-distances. This scheme needs no additional hardware support and can be implemented in a distributed way. Simulation results show the performance of the proposed algorithm is superior to that of the DV-Hop algorithmKeywords
This publication has 10 references indexed in Scilit:
- GPS-free positioning in mobile ad-hoc networks2005
- Range-free localization schemes for large scale sensor networks2003
- Localization from mere connectivity2003
- DV Based Positioning in Ad Hoc NetworksTelecommunication Systems, 2003
- Convex position estimation in wireless sensor networks2002
- Ad hoc positioning system (APS)2002
- The bits and flops of the n-hop multilateration primitive for node localization problems2002
- Wireless sensor networks: a surveyComputer Networks, 2002
- GPS-less low-cost outdoor localization for very small devicesIEEE Wireless Communications, 2000
- Lagrange programming neural networksIEEE Transactions on Circuits and Systems II: Analog and Digital Signal Processing, 1992