A highly adaptive distributed routing algorithm for mobile wireless networks

We present a new distributed routing protocol for mobile, multihop, wireless networks. The protocol is one of a family of protocols which we term "link reversal" algorithms. The protocol's reaction is structured as a temporally-ordered sequence of diffusing computations; each computation consisting of a sequence of directed link reversals. The protocol is highly adaptive, efficient and scalable; being best-suited for use in large, dense, mobile networks. In these networks, the protocol's reaction to link failures typically involves only a localized "single pass" of the distributed algorithm. This capability is unique among protocols which are stable in the face of network partitions, and results in the protocol's high degree of adaptivity. This desirable behavior is achieved through the novel use of a "physical or logical clock" to establish the "temporal order" of topological change events which is used to structure (or order) the algorithm's reaction to topological changes. We refer to the protocol as the temporally-ordered routing algorithm (TORA).

[1]  M. S. Corson,et al.  Architectural considerations for mobile mesh networking , 1996, Proceedings of MILCOM '96 IEEE Military Communications Conference.

[2]  J. J. Garcia-Luna-Aceves,et al.  Distributed, Scalable Routing Based on Vectors of Link States , 1995, IEEE J. Sel. Areas Commun..

[3]  Anthony Ephremides,et al.  A distributed routing algorithm for mobile wireless networks , 1995, Wirel. Networks.

[4]  J. J. Garcia-Luna-Aceves,et al.  An efficient routing protocol for wireless networks , 1996, Mob. Networks Appl..

[5]  J. Broch,et al.  Dynamic source routing in ad hoc wireless networks , 1998 .

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

[7]  Leslie Lamport,et al.  Time, clocks, and the ordering of events in a distributed system , 1978, CACM.

[8]  LamportLeslie.  Time, clocks, and the ordering of events in a distributed system , 1978 .

[9]  Anthony Ephremides,et al.  A distributed routing algorithm for mobile radio networks , 1989, IEEE Military Communications Conference, 'Bridging the Gap. Interoperability, Survivability, Security'.

[10]  Pierre A. Humblet,et al.  Another adaptive distributed shortest path algorithm , 1991, IEEE Trans. Commun..

[11]  J. J. Garcia-Luna-Aceves,et al.  A loop-free path-finding algorithm: specification, verification and complexity , 1995, Proceedings of INFOCOM'95.

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

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

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

[15]  Adrian Segall,et al.  A Failsafe Distributed Routing Protocol , 1979, IEEE Trans. Commun..

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

[17]  Charles E. Perkins,et al.  Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers , 1994, SIGCOMM.

[18]  Dimitri P. Bertsekas,et al.  Data Networks , 1986 .

[19]  Jeffrey M. Jaffe,et al.  A Responsive Distributed Routing Algorithm for Computer Networks , 1982, ICDCS.

[20]  J. J. Garcia-Luna-Aceves,et al.  Distributed routing with labeled distances , 1992, [Proceedings] IEEE INFOCOM '92: The Conference on Computer Communications.