| | This Article | |
| |
| |
| | Share | |
| |
| |
| | Bibliographic References | |
| |
| |
| | Add to: | |
| |
 Digg
 Furl
 Spurl
 Blink
 Simpy
 Google
 Del.icio.us
 Y!MyWeb
| |
| | Search | |
| |
| |
| | |
Purposeful Mobility for Relaying and Surveillance in Mobile Ad Hoc Sensor Networks
July 2004 (vol. 3 no. 3)
pp. 225-232
In this paper, 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 will be 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] 225 A.N. Borodin and P. Salminen, Handbook of Brownian Motion Facts and Formulae. Boston: Birkhauser, 1996.[2] T. Cormen, C. Leiserson, and R. Rivest, Introduction to Algorithms. MIT Press, 1990.[3] W. Feller, An Introduction to Probability Theory and Its Applications. New York: Wiley, 1968.[4] M. Grossglauser and D. Tse, Mobility Increases Capacity in Ad-Hoc Wireless Networks Proc. IEEE INFOCOM, 2001.[5] P. Gupta and P.R. Kumar, Critical Power for Asymptotic Connectivity in Wireless Networks Stochastic Analysis, Control, Optimization and Applications: A Volume in Honor of W.H. Fleming, W.M. McEneany, G. Yin, and Q. Zhang, eds., pp. 547-556, Boston: Birkhauser, 1998.[6] N. Heo and P.K. Varshney, A Distributed Self Spreading Algorithm for Mobile Wireless Sensor Networks IEEE Wireless Comm. and Networking, pp. 1597-1602, Mar. 2003.[7] P. Jeon, R. Rao, and G. Kesidis, Two-Priority Routing in Sensor MANETs Using Both Energy and Delay Metrics in preparation, 2004.[8] G. Kesidis, T. Konstantopoulos, and S. Phoha, Surveillance Coverage of Ad Hoc Sensor Networks under a Random Mobility Strategy Proc. IEEE Sensors Conf., Oct. 2003.[9] G. Kesidis and E. Wong, Optimal Acceptance Probability for Simulated Annealing Stochastics and Stochastics Reports, vol. 29, pp. 221-226, 1990.[10] Q. Li, M. De Rosa, and D. Rus, Distributed Algorithms for Guiding Navigation across a Sensor Network Proc. MOBICOM, pp. 313-325, Sept. 2003.[11] J.G. Lim and S.V. Rao, Mobility Enhanced Position in Ad-Hoc Networks IEEE Wireless Comm. and Networking, pp. 1832-1837, Mar. 2003.[12] M. Mauve, J. Widmer, and H. Hartenstein, A Survey on Position-Based Routing in Mobile Ad-Hoc Networks IEEE Network Magazine, vol. 15, no. 6, pp. 30-39, Nov. 2001.[13] S. Shakkottai, R. Srikant, and N. Shroff, Unreliable Sensor Grids: Coverage, Connectivity and Diameter Ad Hoc Networks, to appear in 2004, also published in Proc. IEEE Infocom, 2003.[14] H. Tanner, A. Jadbabaie, and G.J. Pappas, Flocking in Fixed and Switching Networks Automatica, July 2003.[15] D. Turgut, B. Turgut, R. Elmasri, and T.V. Le, Optimizing Clustering Algorithm in Mobile Ad Hoc Networks Using Simulated Annealing IEEE Wireless Comm. and Networking, pp. 1492-1497, Mar. 2003.[16] G. Wang, G. Cao, and T. La Porta, Movement-Assisted Sensor Deployment Proc. IEEE INFOCOM, Mar. 2004.[17] Y. Zou and K. Chakrabarty, Sensor Deployment and Target Localization Based on Virtual Forces Proc. IEEE INFOCOM, Mar. 2003.
Index Terms:
Sensor networks, MANET, mobility strategy, communication, energy-aware systems.
Citation:
Rajesh Rao, George Kesidis, "Purposeful Mobility for Relaying and Surveillance in Mobile Ad Hoc Sensor Networks," IEEE Transactions on Mobile Computing, vol. 3, no. 3, pp. 225-232, July 2004, doi:10.1109/TMC.2004.26
