The delay-constrained information coverage problem in mobile sensor networks: single hop case

In this paper, we study the delay-constrained information coverage problem in mobile sensor networks. Motivated by real application needs, our formulation takes advantage of the sensor mobility for sensing information collection, which takes place when a sensor moves into the proximity (single hop) of stationary sink nodes. To the best of our knowledge, we present the first formulation for the delay-constrained information coverage problem, which targets at optimal sink nodes placement with the objective of maximizing sensing information collection within a constrained time. We prove that this problem is NP-hard even under finite search space approximation and we develop theoretical analysis to derive its upper and lower performance bounds. We then develop approximation techniques and use simulations to verify their effectiveness.

[1]  Amin Vahdat,et al.  Epidemic Routing for Partially-Connected Ad Hoc Networks , 2009 .

[2]  Yiwei Thomas Hou,et al.  Theoretical Results on Base Station Movement Problem for Sensor Network , 2008, IEEE INFOCOM 2008 - The 27th Conference on Computer Communications.

[3]  Bo Li,et al.  Message Delivery Capacity in Delay-Constrained Mobile Sensor Networks: Bounds and Realization , 2011, IEEE Transactions on Wireless Communications.

[4]  Tracy Camp,et al.  A survey of mobility models for ad hoc network research , 2002, Wirel. Commun. Mob. Comput..

[5]  Wolfgang Stadje,et al.  The exact probability distribution of a two-dimensional random walk , 1987 .

[6]  Yiwei Thomas Hou,et al.  Approximation Algorithm for Base Station Placement in Wireless Sensor Networks , 2007, 2007 4th Annual IEEE Communications Society Conference on Sensor, Mesh and Ad Hoc Communications and Networks.

[7]  Yang Zhang,et al.  CarTel: a distributed mobile sensor computing system , 2006, SenSys '06.

[8]  Zygmunt J. Haas,et al.  The shared wireless infostation model: a new ad hoc networking paradigm (or where there is a whale, there is a way) , 2003, MobiHoc '03.

[9]  João Barros,et al.  Random Walks on Sensor Networks , 2007, 2007 5th International Symposium on Modeling and Optimization in Mobile, Ad Hoc and Wireless Networks and Workshops.

[10]  Donald F. Towsley,et al.  Mobility improves coverage of sensor networks , 2005, MobiHoc '05.

[11]  Josef Kallrath,et al.  Simulated Annealing Based Algorithm for the 2D Bin Packing Problem with Impurities , 2005, OR.

[12]  David S. Johnson,et al.  Computers and Intractability: A Guide to the Theory of NP-Completeness , 1978 .

[13]  Timothy X. Brown,et al.  Ad Hoc UAV Ground Network (AUGNet) , 2004 .

[14]  Anders Lindgren,et al.  Probabilistic routing in intermittently connected networks , 2003, MOCO.

[15]  Waylon Brunette,et al.  Data MULEs: modeling a three-tier architecture for sparse sensor networks , 2003, Proceedings of the First IEEE International Workshop on Sensor Network Protocols and Applications, 2003..

[16]  Rafail Ostrovsky,et al.  Polynomial time approximation schemes for geometric k-clustering , 2000, Proceedings 41st Annual Symposium on Foundations of Computer Science.

[17]  Duc Truong Pham,et al.  Intelligent Optimisation Techniques: Genetic Algorithms, Tabu Search, Simulated Annealing and Neural Networks , 2011 .

[18]  Cecilia Mascolo,et al.  Opportunistic Mobile Sensor Data Collection with SCAR , 2007, 2007 IEEE Internatonal Conference on Mobile Adhoc and Sensor Systems.

[19]  Hongyi Wu,et al.  DFT-MSN: The Delay/Fault-Tolerant Mobile Sensor Network for Pervasive Information Gathering , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.