Algorithms for Message Ferrying on Mobile ad hoc Networks

Message Ferrying is a mobility assisted technique for working around the disconnectedness and sparsity of Mobile ad hoc networks. One of the importantquestions which arise in this context is to determine the routing of the ferry,so as to minimize the buffers used to store data at the nodes in thenetwork. We introduce a simple model to capture the ferry routingproblem. We characterize {\em stable} solutions of the system andprovide efficient approximation algorithms for the {\sc Min-Max Buffer Problem} for the case when the nodes are onhierarchically separated metric spaces.

[1]  Adam Meyerson,et al.  Approximation algorithms for deadline-TSP and vehicle routing with time-windows , 2004, STOC '04.

[2]  Mostafa H. Ammar,et al.  Ferry replacement protocols in sparse MANET message ferrying systems , 2005, IEEE Wireless Communications and Networking Conference, 2005.

[3]  Rajendra V. Boppana,et al.  A comparison of TCP performance over three routing protocols for mobile ad hoc networks , 2001, MobiHoc.

[4]  R. Ravi,et al.  Minimum Vehicle Routing with a Common Deadline , 2006, APPROX-RANDOM.

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

[6]  Satish Rao,et al.  A tight bound on approximating arbitrary metrics by tree metrics , 2003, STOC '03.

[7]  Louis E. Rosier,et al.  Pinwheel Scheduling with Two Distinct Numbers , 1992, Theor. Comput. Sci..

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

[9]  Jeffrey C. Lagarias,et al.  Pinwheel Scheduling: Achievable Densities , 2002, Algorithmica.

[10]  Louis E. Rosier,et al.  Pinwheel Scheduling With Tow Distinct Numbers , 1989, MFCS.

[11]  Mihalis Yannakakis,et al.  The Traveling Salesman Problem with Distances One and Two , 1993, Math. Oper. Res..

[12]  Mostafa H. Ammar,et al.  Protocols for roadside-to-roadside data relaying over vehicular networks , 2006, IEEE Wireless Communications and Networking Conference, 2006. WCNC 2006..

[13]  Yair Bartal,et al.  Probabilistic approximation of metric spaces and its algorithmic applications , 1996, Proceedings of 37th Conference on Foundations of Computer Science.

[14]  Louis E. Rosier,et al.  The pinwheel: a real-time scheduling problem , 1989, [1989] Proceedings of the Twenty-Second Annual Hawaii International Conference on System Sciences. Volume II: Software Track.

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

[16]  Sudipto Guha,et al.  Approximating a finite metric by a small number of tree metrics , 1998, Proceedings 39th Annual Symposium on Foundations of Computer Science (Cat. No.98CB36280).

[17]  Francis Y. L. Chin,et al.  General Schedulers for the Pinwheel Problem Based on Double-Integer Reduction , 1992, IEEE Trans. Computers.

[18]  Shun-Shii Lin,et al.  A Pinwheel Scheduler for Three Distinct Numbers with a Tight Schedulability Bound , 1997, Algorithmica.

[19]  Francis Y. L. Chin,et al.  Schedulers for larger classes of pinwheel instances , 1993, Algorithmica.