Adaptive deployment for pervasive data gathering in connectivity-challenged environments

Some current and future pervasive data driven applications must operate in “extreme” environments where end-to-end connectivity cannot be guaranteed at all times. In fact, it is likely that in these environments partitions are, rather than exceptions, part of the normal network operation. In this paper, we introduce Cover, a suite of adaptive strategies to control the trajectory of “infrastructure” nodes, which are deployed to bridge network partitions and thus play a critical role in data delivery. In particular, we focus on applications where end (or target) nodes are mobile and their mobility is unknown. Our goal is then to deploy and manage infrastructure nodes so that application-level requirements such as reliable data delivery and latency are met while still limiting deployment cost and balancing the load among infrastructure nodes. Cover achieves these goals using a localized and adaptive approach to infrastructure management based on the observed mobility of target nodes. To this end, Cover takes advantage of contact opportunities between infrastructure nodes to exchange information about their covered zones, and thus, help monitor targets in a more efficient fashion. Through extensive simulations, we show how Cover's adaptive features yield a fair distribution of targets per infrastructure node based only on limited network knowledge.

[1]  Gaurav S. Sukhatme,et al.  Using Local Geometry for Tunable Topology Control in Sensor Networks , 2009, IEEE Transactions on Mobile Computing.

[2]  Wei Wang,et al.  Trade-offs between mobility and density for coverage in wireless sensor networks , 2007, MobiCom '07.

[3]  Mads Haahr,et al.  Social network analysis for routing in disconnected delay-tolerant MANETs , 2007, MobiHoc '07.

[4]  Ellen W. Zegura,et al.  A message ferrying approach for data delivery in sparse mobile ad hoc networks , 2004, MobiHoc '04.

[5]  Gaurav S. Sukhatme,et al.  Coverage, Exploration and Deployment by a Mobile Robot and Communication Network , 2004, Telecommun. Syst..

[6]  C. Guestrin,et al.  Near-optimal sensor placements: maximizing information while minimizing communication cost , 2006, 2006 5th International Conference on Information Processing in Sensor Networks.

[7]  Jie Wu,et al.  Energy-Efficient Backbone Construction, Broadcasting, and Area Coverage in Sensor Networks , 2005, Handbook of Sensor Networks.

[8]  Jean-Yves Le Boudec,et al.  Perfect simulation and stationarity of a class of mobility models , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[9]  Anne-Marie Kermarrec,et al.  Connectivity-Guaranteed and Obstacle-Adaptive Deployment Schemes for Mobile Sensor Networks , 2008, IEEE Transactions on Mobile Computing.

[10]  Linda Robinson,et al.  Fall , 1996, Autumn Rhythm.

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

[12]  Kevin R. Fall,et al.  A delay-tolerant network architecture for challenged internets , 2003, SIGCOMM '03.

[13]  Anne-Marie Kermarrec,et al.  Route in Mobile WSN and Get Self-deployment for Free , 2009, DCOSS.

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

[15]  Mohamed F. Younis,et al.  Strategies and techniques for node placement in wireless sensor networks: A survey , 2008, Ad Hoc Networks.

[16]  Yunhao Liu,et al.  Sweep coverage with mobile sensors , 2008, 2008 IEEE International Symposium on Parallel and Distributed Processing.

[17]  Dario Pompili,et al.  Deployment analysis in underwater acoustic wireless sensor networks , 2006, Underwater Networks.

[18]  David Simplot-Ryl,et al.  Energy-efficient area monitoring for sensor networks , 2004, Computer.

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

[20]  Anish Arora,et al.  Barrier coverage with wireless sensors , 2005, MobiCom '05.

[21]  Ioannis Chatzigiannakis,et al.  Sink mobility protocols for data collection in wireless sensor networks , 2006, MobiWac '06.

[22]  Mingyan Liu,et al.  Random waypoint considered harmful , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[23]  Pan Hui,et al.  BUBBLE Rap: Social-Based Forwarding in Delay-Tolerant Networks , 2008, IEEE Transactions on Mobile Computing.

[24]  Dong Xuan,et al.  On Deploying Wireless Sensors to Achieve Both Coverage and Connectivity , 2006, 2009 5th International Conference on Wireless Communications, Networking and Mobile Computing.

[25]  Xiangke Liao,et al.  Barrier Coverage with Mobile Sensors , 2008, 2008 International Symposium on Parallel Architectures, Algorithms, and Networks (i-span 2008).

[26]  Vijay Erramilli,et al.  Delegation forwarding , 2008, MobiHoc '08.

[27]  K. Psounis,et al.  Efficient Routing in Intermittently Connected Mobile Networks: The Single-Copy Case , 2008, IEEE/ACM Transactions on Networking.

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

[29]  T. Spyropoulos,et al.  Efficient Routing in Intermittently Connected Mobile Networks: The Multiple-Copy Case , 2008, IEEE/ACM Transactions on Networking.