DMCA
A Highly Adaptive Distributed Routing Algorithm for Mobile Wireless Networks
Cached
Download Links
- [www.comp.nus.edu.sg]
- [www.cs.utexas.edu]
- [www.cs.utexas.edu]
- [www.comp.nus.edu.sg]
- DBLP
Other Repositories/Bibliography
BibTeX
@MISC{_ahighly,
author = {},
title = {A Highly Adaptive Distributed Routing Algorithm for Mobile Wireless Networks},
year = {}
}
Share
 |
 |
 |
 |
||
OpenURL
Abstract
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
Keyphrases
highly adaptive distributed routing algorithm mobile wireless network protocol reaction distributed algorithm network partition reversal algorithm wireless network high degree directed link reversal routing protocol desirable behavior temporally-ordered sequence mobile network localized single pas
