Scheduling Mobile Nodes for Cooperative Data Transport in Sensor Networks

Message ferrying has been shown to be an effective approach to support routing in sparse ad hoc or sensor networks. Considering a generic network model where each node in the network wishes to send data to some (or possibly all) other nodes with known (and possibly different) rates, we propose three schemes enabling multiple ferries to coordinate in collecting and delivering the data. We analyze the performance of each scheme and establish bounds on the average and worst-case delay. The latter bounds are useful in offering performance guarantees. We establish that under one of our schemes, constant per-node throughput is achievable within constant maximum (worst-case) delay as the network size grows. Using simulation, we compare our proposed schemes with an alternative, the Ferry Relaying algorithm proposed earlier in the literature. The results show that our schemes perform better and provide guidance on which scheme to use given performance preferences and the number of available ferries.

[1]  J. Michael Steele,et al.  Probabilistic and Worst Case Analyses of Classical Problems of Combinatorial Optimization in Euclidean Space , 1990, Math. Oper. Res..

[2]  Ellen W. Zegura,et al.  Controlling the mobility of multiple data transport ferries in a delay-tolerant network , 2005, Proceedings IEEE 24th Annual Joint Conference of the IEEE Computer and Communications Societies..

[3]  Philippe Bonnet,et al.  Smart-tag based data dissemination , 2002, WSNA '02.

[4]  Kirk Martinez,et al.  Environmental Sensor Networks: A revolution in the earth system science? , 2006 .

[5]  Ness B. Shroff,et al.  Degenerate delay-capacity tradeoffs in ad-hoc networks with Brownian mobility , 2006, IEEE Transactions on Information Theory.

[6]  ATSPDavid S. JohnsonAT.  Experimental Analysis of Heuristics for the Stsp , 2001 .

[7]  Panganamala Ramana Kumar,et al.  RHEINISCH-WESTFÄLISCHE TECHNISCHE HOCHSCHULE AACHEN , 2001 .

[8]  Gilbert Laporte,et al.  Computational Evaluation Of A Transformation Procedure For The Symmetric Generalized Traveling Salesman Problem , 1999 .

[9]  L. Few.  The shortest path and the shortest road through n points , 1955 .

[10]  Gilbert Laporte,et al.  Static pickup and delivery problems: a classification scheme and survey , 2007 .

[11]  A. Pandya,et al.  Goodput and Delay in Networks with Controlled Mobility , 2008, 2008 IEEE Aerospace Conference.

[12]  Waylon Brunette,et al.  Data MULEs: modeling and analysis of a three-tier architecture for sparse sensor networks , 2003, Ad Hoc Networks.

[13]  Charles R. Farrar,et al.  A different approach to sensor networking for shm: Remote powering and interrogation with unmanned aerial vehicles , 2007 .

[14]  J. C. Bean,et al.  An efficient transformation of the generalized traveling salesman problem , 1993 .

[15]  Gilbert Laporte,et al.  A Fast Composite Heuristic for the Symmetric Traveling Salesman Problem , 1996, INFORMS J. Comput..

[16]  Richard F. Hartl,et al.  A survey on pickup and delivery problems , 2008 .

[17]  Sophie N. Parragh,et al.  A survey on pickup and delivery problems Part I : Transportation between customers and depot , 2007 .

[18]  Ness B. Shroff,et al.  Delay and Capacity Trade-Offs in Mobile Ad Hoc Networks: A Global Perspective , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[19]  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..

[20]  Alex Pentland,et al.  DakNet: rethinking connectivity in developing nations , 2004, Computer.

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

[22]  Mostafa H. Ammar,et al.  Message ferrying: proactive routing in highly-partitioned wireless ad hoc networks , 2003, The Ninth IEEE Workshop on Future Trends of Distributed Computing Systems, 2003. FTDCS 2003. Proceedings..

[23]  Michael R. Lyu,et al.  Reliable Reporting of Delay-Sensitive Events in Wireless Sensor-Actuator Networks , 2006, 2006 IEEE International Conference on Mobile Ad Hoc and Sensor Systems.

[24]  M. R. Rao,et al.  Combinatorial Optimization , 1992, NATO ASI Series.

[25]  Ian F. Akyildiz,et al.  Wireless sensor and actor networks: research challenges , 2004, Ad Hoc Networks.

[26]  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.

[27]  Peter I. Corke,et al.  Data muling over underwater wireless sensor networks using an autonomous underwater vehicle , 2006, Proceedings 2006 IEEE International Conference on Robotics and Automation, 2006. ICRA 2006..

[28]  Benjamin W. Wah,et al.  Transformation of the generalized traveling-salesman problem into the standard traveling-salesman problem , 1993, Inf. Sci..

[29]  David Tse,et al.  Mobility increases the capacity of ad hoc wireless networks , 2002, TNET.

[30]  L. Fejes.  Über einen geometrischen Satz , 1940 .

[31]  David S. Johnson,et al.  Experimental Analysis of Heuristics for the STSP , 2007 .

[32]  Zoran Saric,et al.  An Efficient Transformation of the Generalized Traveling Salesman Problem into the Traveling Salesman Problem on Digraphs , 1997, Inf. Sci..

[33]  Ness B. Shroff,et al.  Delay and Capacity Trade-Offs in Mobile Ad Hoc Networks: A Global Perspective , 2006, Proceedings IEEE INFOCOM 2006. 25TH IEEE International Conference on Computer Communications.

[34]  Ellen W. Zegura,et al.  Multicasting in sparse MANETs using message ferrying , 2006, IEEE Wireless Communications and Networking Conference, 2006. WCNC 2006..

[35]  William J. Cook,et al.  Combinatorial optimization , 1997 .

[36]  Yong Wang,et al.  Energy-efficient computing for wildlife tracking: design tradeoffs and early experiences with ZebraNet , 2002, ASPLOS X.

[37]  Sophie N. Parragh,et al.  A survey on pickup and delivery models Part II : Transportation between pickup and delivery locations , 2007 .

[38]  Devavrat Shah,et al.  Throughput-delay trade-off in wireless networks , 2004, IEEE INFOCOM 2004.

[39]  Jon Jouis Bentley,et al.  Fast Algorithms for Geometric Traveling Salesman Problems , 1992, INFORMS J. Comput..

[40]  Walid Saad,et al.  Hedonic Coalition Formation for Distributed Task Allocation among Wireless Agents , 2010, IEEE Transactions on Mobile Computing.

[41]  Eytan Modiano,et al.  Capacity and delay tradeoffs for ad hoc mobile networks , 2004, IEEE Transactions on Information Theory.

[42]  Zhen Liu,et al.  Capacity, delay and mobility in wireless ad-hoc networks , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).