Node Degree based Improved Hop Count Weighted Centroid Localization Algorithm

Hop-count based weighted centroid localization is a simple and straightforward localization algorithm, which uses anchors with known positions and the hop count to these anchors to estimate the real position of nodes. Especially in sensor networks, where energy restrictions prevent more complex algorithms, this fast and simple algorithm can be used. Unfortunately the localization error of the algorithm can hinder the practical usage. In this paper we will improve the weighted centroid algorithm for hop count based localization by adding the node degree on the paths to the referenced anchors into the weights. After an analysis to obtain theoretically optimal coefficients we will show by means of simulation that for longer hop counts to the anchors and areas with different node degrees the proposed ND-WCL algorithm outperforms the known hop count based weighted centroid localization algorithm.

[1]  Ivan Stojmenovic,et al.  Routing with Guaranteed Delivery in Ad Hoc Wireless Networks , 1999, DIALM '99.

[2]  Scott Shenker,et al.  Geographic routing without location information , 2003, MobiCom '03.

[3]  F. Golatowski,et al.  Weighted Centroid Localization in Zigbee-based Sensor Networks , 2007, 2007 IEEE International Symposium on Intelligent Signal Processing.

[4]  Dimitri Marandin,et al.  On reconfiguration in case of node mobility in clustered wireless sensor networks , 2008, IEEE Wireless Communications.

[5]  B. R. Badrinath,et al.  Ad hoc positioning system (APS) , 2001, GLOBECOM'01. IEEE Global Telecommunications Conference (Cat. No.01CH37270).

[6]  Brad Karp,et al.  GPSR: greedy perimeter stateless routing for wireless networks , 2000, MobiCom '00.

[7]  Deborah Estrin,et al.  GPS-less low-cost outdoor localization for very small devices , 2000, IEEE Wirel. Commun..