Message ferrying for constrained scenarios

Message ferrying (MF) (Wenrui Zhao and Ammar, M.H., Proc. IEEE Workshop on Future Trends in Distrib. Computing Syst., 2003), a viable solution for routing in highly partitioned ad-hoc networks, exploits message ferries to transfer packets between disconnected nodes. The paper studies the delivery quality of service (QoS) for certain urgent messages in the constrained and the relaxed constrained MF systems. Efficient algorithms to compute near-optimal ferry routes are proposed, delay analysis is conducted and the results are compared to the non-constrained scenario.

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

[2]  Keld Helsgaun,et al.  An effective implementation of the Lin-Kernighan traveling salesman heuristic , 2000, Eur. J. Oper. Res..

[3]  Qun Li,et al.  Sending messages to mobile users in disconnected ad-hoc wireless networks , 2000, MobiCom '00.

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

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