A Weighted Centroid Localization Algorithm Based on DV-Hop for Wireless Sensor Network

Localization is an important problem in wireless sensor networks (WSNs), since an event information with little node location information is meaningless in practical application. The well known localization algorithms DV-hop and centroid location algorithm can be simply implemented in real WSNs. In this paper, we will analyze the drawbacks of these two algorithms and propose a new weighted centroid localization algorithm based on DV-Hop. The proposed algorithm uses weight of anchors to improve localization accuracy. The simulation results show that the localization error of the weighted centroid localization algorithm is smaller than DV-Hop and centroid localization algorithm.

[1]  Shi Long,et al.  Self-Localization Systems and Algorithms for Wireless Sensor Networks , 2005 .

[2]  B. R. Badrinath,et al.  Ad hoc positioning system (APS) using AOA , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[3]  R.L. Moses,et al.  Locating the nodes: cooperative localization in wireless sensor networks , 2005, IEEE Signal Processing Magazine.

[4]  Tarek F. Abdelzaher,et al.  Range-free localization schemes for large scale sensor networks , 2003, MobiCom '03.

[5]  Ian F. Akyildiz,et al.  Sensor Networks , 2002, Encyclopedia of GIS.

[6]  Alfred O. Hero,et al.  Relative location estimation in wireless sensor networks , 2003, IEEE Trans. Signal Process..

[7]  Y. Ye,et al.  A Distributed Method for Solving Semidefinite Programs Arising from Ad Hoc Wireless Sensor Network Localization , 2006 .

[8]  Dirk Timmermann,et al.  AWCL: Adaptive Weighted Centroid Localization as an efficient improvement of coarse grained localization , 2008, 2008 5th Workshop on Positioning, Navigation and Communication.