A highly adaptive distributed routing algorithm for mobile wireless networks
V.D. Park, M. Scott Corson · IEEE Conference on Computer Communications (INFOCOM) · 2002
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).
Cited by 2,234 works. doi:10.1109/infcom.1997.631180
Authors
References
- Dynamic Source Routing in Ad Hoc Wireless Networks
- Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers
- Time, clocks, and the ordering of events in a distributed system
- Data networks
- Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers
- A Failsafe Distributed Routing Protocol
- A distributed routing algorithm for mobile wireless networks
- Time, clocks, and the ordering of events in a distributed system
- A Responsive Distributed Routing Algorithm for Computer Networks
- An efficient routing protocol for wireless networks