Mobile beacon node path scheme in arbitrary region for wireless sensor networks

Localization with mobile beacons is one of the most efficient ways to deploy sensor nodes and locate them. However, most of the current mobile beacon-assisted localization algorithms only discuss the application in rectangular sensor region. In order to achieve the localization in arbitrary sensor region, a novel mobile beacon-assisted localization algorithm based on virtual force and ant colony algorithm for wireless sensor networks is presented. Experimental results show that the proposed localization can achieve a proper balance between localization accuracy and energy consumption.

[1]  T.V. Srinath.  Localization in resource constrained sensor networks using a mobile beacon with in-ranging , 2006, 2006 IFIP International Conference on Wireless and Optical Communications Networks.

[2]  Dimitrios Koutsonikolas,et al.  Path planning of mobile landmarks for localization in wireless sensor networks , 2006, Comput. Commun..

[3]  Wei Guo,et al.  Comparison of distributed localization algorithms for sensor network with a mobile beacon , 2004, IEEE International Conference on Networking, Sensing and Control, 2004.

[4]  Gaurav S. Sukhatme,et al.  Mobile Sensor Network Deployment using Potential Fields : A Distributed , Scalable Solution to the Area Coverage Problem , 2002 .

[5]  Mihail L. Sichitiu,et al.  Localization of wireless sensor networks with a mobile beacon , 2004, 2004 IEEE International Conference on Mobile Ad-hoc and Sensor Systems (IEEE Cat. No.04EX975).

[6]  Marco Locatelli,et al.  Packing equal circles in a square: a deterministic global optimization approach , 2002, Discret. Appl. Math..

[7]  Marco Dorigo,et al.  Optimization, Learning and Natural Algorithms , 1992 .

[8]  Gergely V. Záruba,et al.  Static Path Planning for Mobile Beacons to Localize Sensor Networks , 2007, Fifth Annual IEEE International Conference on Pervasive Computing and Communications Workshops (PerComW'07).