A simple approximation to minimum-delay routing
Proceedings of the conference on Applications, technologies, architectures, and protocols for computer communication
Transmission-efficient routing in wireless networks using link-state information
Mobile Networks and Applications
On-demand multicast routing protocol in multihop wireless mobile networks
Mobile Networks and Applications
IEEE/ACM Transactions on Networking (TON)
Hybrid routing: the pursuit of an adaptable and scalable routing framework for ad hoc networks
The handbook of ad hoc wireless networks
The stability of paths in a dynamic network
CoNEXT '05 Proceedings of the 2005 ACM conference on Emerging network experiment and technology
NARD: Neighbor-assisted route discovery in MANETs
Wireless Networks
Parameter evolution for quality of service in multimedia networking
PRIMA'06 Proceedings of the 9th Pacific Rim international conference on Agent Computing and Multi-Agent Systems
| Hi-index | 0.00 |
We present and verify the Adaptive Link-State Protocol (ALP), a new link-state routing protocol that does not require the state of each link to be flooded to the entire internetwork, or to entire areas if hierarchical routing is used. A router in ALP disseminates link-state updates incrementally to its neighbors for only those links along paths used to reach destinations. Link-state updates are validated using time stamps and contain the same information used in other link-state protocols. For the case of neighbor routers connected through a broadcast medium, a designated router is distributedly elected for each link state reported over the medium, rather than requiring a designated router to report every topology change over the broadcast medium, like OSPF does. Simulation experiments illustrate that ALP is as efficient as the Distributed-Bellman Ford algorithm when distances to destinations do not increase and resources do not fail, and more efficient than traditional link-state protocols based on flooding after distances increase or resources fail. ALP also outperforms the link-vector algorithm (LVA), which is the only prior routing algorithm based on selective dissemination of link states.