Bypass routing: An on-demand local recovery protocol for ad hoc networks
Submitted by crepric on Thu, 09/17/2009 - 18:06
Title | Bypass routing: An on-demand local recovery protocol for ad hoc networks |
Publication Type | Journal Articles |
Year of Publication | 2006 |
Authors | Sengul, C., and R. Kravets |
Journal | Ad Hoc Networks |
Volume | 4 |
Issue | 3 |
Pagination | 380 - 397 |
ISSN Number | 1570-8705 |
Keywords | Local recovery |
Abstract | On-demand routing protocols for ad hoc networks reduce the cost of routing in high mobility environments. However, route discovery in on-demand routing is typically performed via network-wide flooding, which consumes a substantial amount of bandwidth. In this paper, we present bypass routing, a local recovery protocol that aims to reduce the frequency of route request floods triggered by broken routes. Specifically, when a broken link is detected, a node patches the affected route using local information, which is acquired on-demand, and thereby bypasses the broken link. We implemented SLR (Source Routing with Local Recovery) as a prototype of our approach. Simulation studies show that SLR achieves efficient and effective local recovery while maintaining acceptable overhead. |
URL | http://www.sciencedirect.com/science/article/B7576-4DS417M-1/2/c5dc5faa6a1015ac07de04d5d712eb29 |
DOI | DOI: 10.1016/j.adhoc.2004.10.004 |
Full Text |
|
Attachment | Size |
---|---|
129.37 KB |
- Login to post comments
- Tagged
- XML
- BibTex
- Google Scholar