Increasing packet delivery ratio in DSR by link prediction

Most existing on-demand mobile ad hoc network routing protocols continue using a route until a link breaks. During the route reconstruction, packets can be dropped, which will cause significant throughput degradation. In this paper, we add a link breakage prediction algorithm to the dynamic source routing (DSR) protocol. The mobile node uses signal power strength from the received packets to predict the link breakage time, and sends a warning to the source node of the packet if the link is soon-to-be-broken. The source node can perform a pro-active route rebuild to avoid disconnection. Experiments demonstrate that adding link breakage prediction to DSR can significantly reduce the total number of dropped data packets (by at least 20%). The tradeoff is an increase in the number of control messages by at most 33.5%. We also found that the proactive route maintenance does not cause significant increase in average packet latency and average route length. Enhanced route cache maintenance based on the link status can further reduce the number of dropped packets.

[1]  Chai-Keong Toh,et al.  Associativity-Based Routing for Ad Hoc Mobile Networks , 1997, Wirel. Pers. Commun..

[2]  Mario Gerla,et al.  IPv6 flow handoff in ad hoc wireless networks using mobility prediction , 1999, Seamless Interconnection for Universal Services. Global Telecommunications Conference. GLOBECOM'99. (Cat. No.99CH37042).

[3]  Shengming Jiang,et al.  A prediction-based link availability estimation for mobile ad hoc networks , 2001, Proceedings IEEE INFOCOM 2001. Conference on Computer Communications. Twentieth Annual Joint Conference of the IEEE Computer and Communications Society (Cat. No.01CH37213).

[4]  Prathima Agrawal,et al.  Minimizing cellular handover failures without channel utilization loss , 1994, 1994 IEEE GLOBECOM. Communications: The Global Bridge.

[5]  Shengming Jiang,et al.  A Link Availability Prediction Model for Wireless Ad Hoc Networks , 2000, ICDCS Workshop on Wireless Networks and Mobile Computing.

[6]  David A. Maltz,et al.  A performance comparison of multi-hop wireless ad hoc network routing protocols , 1998, MobiCom '98.

[7]  Charles E. Perkins,et al.  Ad-hoc on-demand distance vector routing , 1999, Proceedings WMCSA'99. Second IEEE Workshop on Mobile Computing Systems and Applications.

[8]  Dhananjay S. Phatak,et al.  Preemptive routing in ad hoc networks , 2003, J. Parallel Distributed Comput..

[9]  Nitin H. Vaidya,et al.  Analysis of TCP Performance over Mobile Ad Hoc Networks , 1999, Wirel. Networks.

[10]  Bruce Tuch,et al.  Development of WaveLAN®, an ISM band wireless LAN , 1993, AT&T Technical Journal.

[11]  Taieb Znati,et al.  A mobility-based framework for adaptive clustering in wireless ad hoc networks , 1999, IEEE J. Sel. Areas Commun..

[12]  Taieb Znati,et al.  A path availability model for wireless ad-hoc networks , 1999, WCNC. 1999 IEEE Wireless Communications and Networking Conference (Cat. No.99TH8466).

[13]  Charles E. Perkins,et al.  Performance comparison of two on-demand routing protocols for ad hoc networks , 2001, IEEE Wirel. Commun..

[14]  Elizabeth M. Belding-Royer,et al.  A review of current routing protocols for ad hoc mobile wireless networks , 1999, IEEE Wirel. Commun..

[15]  David A. Maltz,et al.  Dynamic Source Routing in Ad Hoc Wireless Networks , 1994, Mobidata.

[16]  Henk Sol,et al.  Proceedings of the 54th Hawaii International Conference on System Sciences , 1997, HICSS 2015.