A highly adaptive distributed routing algorithm for mobile wirelessnetworks
Park, V.D.; Corson, M.S.
INFOCOM apos;97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Proceedings IEEE
Volume 3, Issue , 7-12 Apr 1997 Page(s):1405 - 1413 vol.3
Digital Object Identifier 10.1109/INFCOM.1997.631180
Summary: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)
View citation and abstract |
Cart
