Robust loop-free on-demand routing in ad hoc networks

In this thesis, we explore new techniques for robust, efficient, loop-free on-demand routing in Mobile Ad hoc Networks (MANETs) using the same information (i.e., topology information, sequence numbers, etc.,) used in prior on-demand routing protocol proposals. We provide new insights into the robustness of protocols based on destination-sequence numbers when operating with node failures and loss of routing information, and present a new destination-sequence number framework that works correctly even with failure conditions. We also show how destination-sequence numbers can be manipulated as routing labels for improving performance, rather than being strictly treated as time-stamps. We present two different routing approaches that exploit the topology information that can be collected on-demand during the route request flood search. The first approach translates topology information into labels that are then stored at nodes in strict "lexicographic" ordering along any successor path to a destination. Loop-freedom is maintained by allowing nodes to only pick "smaller" labels. The second approach maintains a list of topology information that should not be trusted in-addition to the known path to a destination. Using the notion of trusted topology, nodes can always make routing decisions only with the correct topology information, which ensures loop-freedom. We conclude our research with a new on-demand routing technique that exploits the route request flood search process, which is an integral part of any on-demand routing protocol. Without requiring any additional mechanisms or information, we use the uniqueness of route requests to realize a on-demand routing framework. We, then, present extensions to the basic framework to improve performance using more information that can be collected during the flood search process. Through extensive simulations, we show that all our new proposed approaches perform better than the current state-of-the-art MANET protocols prescribed by the IETF working group.

[1]  Carl A. Gunter,et al.  Fault origin adjudication , 2000, FMSP '00.

[2]  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).

[3]  J. J. Garcia-Luna-Aceves,et al.  On-demand loop-free routing in ad hoc networks using source sequence numbers , 2005, IEEE International Conference on Mobile Adhoc and Sensor Systems Conference, 2005..

[4]  J. J. Garcia-Luna-Aceves,et al.  Using labeled paths for loop-free on-demand routing in ad hoc networks , 2004, MobiHoc '04.

[5]  J. J. Garcia-Luna-Aceves,et al.  Achieving loop-free incremental routing in ad hoc networks , 2004, Proceedings. ISCC 2004. Ninth International Symposium on Computers And Communications (IEEE Cat. No.04TH8769).

[6]  J. J. Garcia-Luna-Aceves,et al.  Making on-demand routing protocols based on destination sequence numbers robust , 2005, IEEE International Conference on Communications, 2005. ICC 2005. 2005.

[7]  Marcelo Spohn,et al.  Neighborhood aware source routing , 2001, MobiHoc '01.

[8]  J. J. Garcia-Luna-Aceves,et al.  A simple approximation to minimum-delay routing , 1999, SIGCOMM '99.

[9]  Charles E. Perkins,et al.  Ad hoc On-Demand Distance Vector (AODV) Routing , 2001, RFC.

[10]  Charles E. Perkins,et al.  Highly Dynamic Destination-Sequenced Distance-Vector Routing (DSDV) for mobile computers , 1994, SIGCOMM.

[11]  David B. Johnson,et al.  The Dynamic Source Routing Protocol for Mobile Ad Hoc Networks , 2003 .

[12]  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).

[13]  Fred L. Templin,et al.  Topology Dissemination Based on Reverse-Path Forwarding (TBRPF) , 2004, RFC.

[14]  Dimitri P. Bertsekas,et al.  Distributed Algorithms for Generating Loop-Free Routes in Networks with Frequently Changing Topology , 1981, IEEE Trans. Commun..

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

[16]  Charles E. Perkins,et al.  A new approach to on-demand loop-free routing in ad hoc networks , 2003, PODC '03.

[17]  J. J. Garcia-Luna-Aceves,et al.  Loop-free routing using a dense label set in wireless networks , 2004, 24th International Conference on Distributed Computing Systems, 2004. Proceedings..

[18]  J. J. Garcia-Luna-Aceves,et al.  Source-tree routing in wireless networks , 1999, Proceedings. Seventh International Conference on Network Protocols.

[19]  Charles E. Perkins,et al.  Multicast operation of the ad-hoc on-demand distance vector routing protocol , 1999, MobiCom.

[20]  J. J. Garcia-Luna-Aceves,et al.  Fast dissemination of link states using bounded sequence numbers with no periodic updates or age fields , 1997, Proceedings of 17th International Conference on Distributed Computing Systems.

[21]  Yih-Chun Hu,et al.  Ensuring cache freshness in on-demand ad hoc network routing protocols , 2002, POMC '02.

[22]  J. J. Garcia-Luna-Aceves,et al.  Using minimal source trees for on-demand routing in 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).

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

[24]  Rajendra V. Boppana,et al.  An adaptive distance vector routing algorithm 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).

[25]  M. S. Corson,et al.  A highly adaptive distributed routing algorithm for mobile wireless networks , 1997, Proceedings of INFOCOM '97.

[26]  Charles E. Perkins,et al.  AODV-PA: AODV with path accumulation , 2003, IEEE International Conference on Communications, 2003. ICC '03..

[27]  J. J. Garcia-Luna-Aceves,et al.  On-demand loop-free routing with link vectors , 2004, IEEE Journal on Selected Areas in Communications.

[28]  Philippe Jacquet,et al.  Optimized Link State Routing Protocol (OLSR) , 2003, RFC.