Route information piggybacking in multihop wireless networks

Loop-free routing is one of the most desirable qualities for multihop wireless networks. In this paper, we propose a new loop-free mechanism, Route Information Piggybacking (RIP), which emphasizes the utilization of data packets to facilitate route maintenance and loop detection. RIP is a lightweight mechanism and it can be easily integrated into any on-demand distance-vector routing protocol. We have applied RIP to a native but flawed on-demand distance-vector routing algorithm in mobile ad hoc networks, and we call the new routing protocol Simple Mobile Ad hoc RouTing (SMART). Extensive simulation results reveal that SMART achieves loop-freedom effectively, and it outperforms AODV significantly in terms of scalability, routing overhead and delivery ratio.

[1]  J. J. Garcia-Luna-Aceves,et al.  Loop-free routing using diffusing computations , 1993, TNET.

[2]  J. J. Garcia-Lunes-Aceves.  Loop-free routing using diffusing computations , 1993 .

[3]  Suhua Tang,et al.  A robust AODV protocol with local update , 2004, APCC/MDMC '04. The 2004 Joint Conference of the 10th Asia-Pacific Conference on Communications and the 5th International Symposium on Multi-Dimensional Mobile Communications Proceeding.

[4]  J. J. Garcia-Luna-Aceves,et al.  A new approach to on-demand loop-free multipath routing , 1999, Proceedings Eight International Conference on Computer Communications and Networks (Cat. No.99EX370).

[5]  Wade Trappe,et al.  Integrating machine learning in ad hoc routing: A wireless adaptive routing protocol , 2011, Int. J. Commun. Syst..

[6]  Mattia D'Emidio,et al.  Engineering a New Loop-Free Shortest Paths Routing Algorithm , 2012, SEA.

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

[8]  Jean-Yves Le Boudec,et al.  The Random Trip Model: Stability, Stationary Regime, and Perfect Simulation , 2006, IEEE/ACM Transactions on Networking.

[9]  Louise E. Moser,et al.  An analysis of the optimum node density for ad hoc mobile networks , 2001, ICC 2001. IEEE International Conference on Communications. Conference Record (Cat. No.01CH37240).

[10]  J. J. Garcia-Luna-Aceves,et al.  A new framework for loop-free on-demand routing using destination sequence numbers , 2004, 2004 IEEE International Conference on Mobile Ad-hoc and Sensor Systems (IEEE Cat. No.04EX975).

[11]  Alice Chen,et al.  Link weight assignment and loop-free routing table update for link state routing protocols in energy-aware internet , 2012, Future Gener. Comput. Syst..

[12]  Charles E. Perkins,et al.  Scalability study of the ad hoc on‐demand distance vector routing protocol , 2003, Int. J. Netw. Manag..

[13]  Sukumar Nandi,et al.  Enhancing Route Recovery for QAODV Routing in Mobile Ad Hoc Networks , 2008, 2008 International Symposium on Parallel Architectures, Algorithms, and Networks (i-span 2008).

[14]  Zehua Wang,et al.  A New Loop-Free Proactive Source Routing Scheme for Opportunistic Data Forwarding in Wireless Networks , 2011, IEEE Communications Letters.

[15]  Winston Khoon Guan Seah,et al.  Survey Paper: Opportunistic routing - A review and the challenges ahead , 2011 .

[16]  Razali,et al.  Comparative review study of reactive and proactive routing protocols in MANETs , 2010 .