Purposeful mobility for relaying and surveillance in mobile ad hoc sensor networks

We consider a mobile ad hoc sensor network. The mobility of the sensor nodes is designed with the cost of communication and mobility in mind along with consideration of the possible scanning tasks of the nodes. Our mobility algorithm is developed in the context of a distributed system where, for any single mobile node, only local information about associated energy costs is known. We use a distributed simulated annealing framework to govern the motion of the nodes and prove that, in a limiting sense, a global objective function comprising mobility and communication energy costs are minimized. This paper concludes with a simulation study focusing on mobile sensors with dual roles of scanning and relaying higher priority tracking traffic from tracking nodes.

[1]  S. V. Rao,et al.  Mobility-enhanced positioning in ad hoc networks , 2003, 2003 IEEE Wireless Communications and Networking, 2003. WCNC 2003..

[2]  Qun Li,et al.  Distributed algorithms for guiding navigation across a sensor network , 2003, MobiCom '03.

[3]  A. Borodin,et al.  Handbook of Brownian Motion - Facts and Formulae , 1996 .

[4]  Krishnendu Chakrabarty,et al.  Sensor deployment and target localization based on virtual forces , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[5]  Pramod K. Varshney,et al.  A distributed self spreading algorithm for mobile wireless sensor networks , 2003, 2003 IEEE Wireless Communications and Networking, 2003. WCNC 2003..

[6]  William Feller,et al.  An Introduction to Probability Theory and Its Applications , 1967 .

[7]  Shashi Phoha,et al.  Surveillance coverage of sensor networks under a random mobility strategy , 2003, Proceedings of IEEE Sensors 2003 (IEEE Cat. No.03CH37498).

[8]  George Kesidis,et al.  Optimal acceptance probability for simulated annealing , 1990 .

[9]  Thomas F. La Porta,et al.  Movement-assisted sensor deployment , 2004, IEEE INFOCOM 2004.

[10]  Ramez Elmasri,et al.  Optimizing clustering algorithm in mobile ad hoc networks using simulated annealing , 2003, 2003 IEEE Wireless Communications and Networking, 2003. WCNC 2003..

[11]  Martin Mauve,et al.  A survey on position-based routing in mobile ad hoc networks , 2001, IEEE Netw..

[12]  David Tse,et al.  Mobility increases the capacity of ad-hoc wireless networks , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[13]  Piyush Gupta,et al.  Critical Power for Asymptotic Connectivity in Wireless Networks , 1999 .

[14]  P. R. Kumar,et al.  Critical power for asymptotic connectivity , 1998, Proceedings of the 37th IEEE Conference on Decision and Control (Cat. No.98CH36171).

[15]  R. Srikant,et al.  Unreliable sensor grids: coverage, connectivity and diameter , 2005, Ad Hoc Networks.

[16]  Feller William,et al.  An Introduction To Probability Theory And Its Applications , 1950 .

[17]  R. K. Shyamasundar,et al.  Introduction to algorithms , 1996 .