Optimization of 2d virtual node coordinates in anchor-free localization algorithms for geographic routing in ad-hoc networks

Many localization algorithms require that at least some nodes in a network know their correct real position. Anchor-free localization algorithms manage to assign to all nodes virtual coordinates (VC) without knowledge of real location information. This is mostly done by node cooperation. These algorithms provide VCs for the usage of geographic routing in environments where real coordinate localization is impossible due to cost, time, energy, space or line of sight restrictions. This paper proposes improvements in generating VCs for wireless ad-hoc networks without location information. We present algorithms for improving the preparatory phase, which is used to obtain initial VCs as well as for the working phase, which adapts to network changes and node movement. Using simulations for different node densities and network sizes, we compare different approaches and show which algorithms outperform others.

[1]  David G. Kirkpatrick,et al.  On routing with guaranteed delivery in three-dimensional ad hoc wireless networks , 2008, Wirel. Networks.

[2]  Brad Karp,et al.  GPSR : Greedy Perimeter Stateless Routing for Wireless , 2000, MobiCom 2000.

[3]  Andreas Willig,et al.  Protocols and Architectures for Wireless Sensor Networks , 2005 .

[4]  David E. Culler,et al.  Beacon vector routing: scalable point-to-point routing in wireless sensornets , 2005, NSDI.

[5]  Mani B. Srivastava,et al.  Dynamic fine-grained localization in Ad-Hoc networks of sensors , 2001, MobiCom '01.

[6]  Charles J. Colbourn,et al.  Unit disk graphs , 1991, Discret. Math..

[7]  Mohamed F. Younis,et al.  Accurate anchor-free node localization in wireless sensor networks , 2005, PCCC 2005. 24th IEEE International Performance, Computing, and Communications Conference, 2005..

[8]  Erik D. Demaine,et al.  Anchor-Free Distributed Localization in Sensor Networks , 2003 .

[9]  Tarek F. Abdelzaher,et al.  A Scalable Logical Coordinates Framework for Routing in Wireless Sensor Networks , 2004, RTSS.

[10]  John J. Leonard,et al.  Minimizing Trilateration Errors in the Presence of Uncertain Landmark Positions , 2007, EMCR.

[11]  Nael B. Abu-Ghazaleh,et al.  Aligned Virtual Coordinates for Greedy Routing in WSNs , 2006, 2006 IEEE International Conference on Mobile Ad Hoc and Sensor Systems.

[12]  Rico Radeke,et al.  Node Degree based Improved Hop Count Weighted Centroid Localization Algorithm , 2011, KiVS.

[13]  Robert Tappan Morris,et al.  Greedy Virtual Coordinates for Geographic Routing , 2007, 2007 IEEE International Conference on Network Protocols.

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

[15]  Mani Srivastava,et al.  Dynamic Fine-Grained Localization in Ad-Hoc Wireless Sensor Networks , 2001 .

[16]  Erik D. Demaine,et al.  Mobile-assisted localization in wireless sensor networks , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[17]  Bang Wang,et al.  A novel approach towards source-to-destination distance estimation in wireless sensor networks , 2009, 2009 International Conference on Intelligent Sensors, Sensor Networks and Information Processing (ISSNIP).

[18]  Stefano Chessa,et al.  GPS free coordinate assignment and routing in wireless sensor networks , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

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

[20]  Nael B. Abu-Ghazaleh,et al.  Aligned virtual coordinates for greedy geometric routing in WSNs , 2008, Int. J. Sens. Networks.

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

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