Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
Location-aided routing (LAR) in mobile ad hoc networks
MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
A performance comparison of multi-hop wireless ad hoc network routing protocols
MobiCom '98 Proceedings of the 4th annual ACM/IEEE international conference on Mobile computing and networking
Query localization techniques for on-demand routing protocols in ad hoc networks
MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
Analysis of TCP performance over mobile ad hoc networks
MobiCom '99 Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking
Caching strategies in on-demand routing protocols for wireless ad hoc networks
MobiCom '00 Proceedings of the 6th annual international conference on Mobile computing and networking
Proceedings of the 3rd ACM international workshop on Modeling, analysis and simulation of wireless and mobile systems
Neighborhood aware source routing
MobiHoc '01 Proceedings of the 2nd ACM international symposium on Mobile ad hoc networking & computing
Ensuring cache freshness in on-demand ad hoc network routing protocols
Proceedings of the second ACM international workshop on Principles of mobile computing
Associativity-Based Routing for Ad Hoc Mobile Networks
Wireless Personal Communications: An International Journal
SHARP: a hybrid adaptive routing protocol for mobile ad hoc networks
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & computing
On-Demand Multi Path Distance Vector Routing in Ad Hoc Networks
ICNP '01 Proceedings of the Ninth International Conference on Network Protocols
Multipath routing in the presence of frequent topological changes
IEEE Communications Magazine
Determining the optimal configuration for the zone routing protocol
IEEE Journal on Selected Areas in Communications
A secure ad-hoc routing approach using localized self-healing communities
Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing
Modeling Ad-hoc rushing attack in a negligibility-based security framework
WiSe '06 Proceedings of the 5th ACM workshop on Wireless security
Proceedings of the 1st international conference on Ambient media and systems
Two-Hops Neighbor-Aware Routing Protocol in Mobile Ad Hoc Networks
Information Networking. Towards Ubiquitous Networking and Services
Impact of mobility on bypass AODV protocol in mobile ad hoc network
The First International Workshop on Wireless Networking for Intelligent Transportation Systems
Adaptive channel width for MASNET routeless routing protocol
CCNC'10 Proceedings of the 7th IEEE conference on Consumer communications and networking conference
Whirlpool routing for mobility
Proceedings of the eleventh ACM international symposium on Mobile ad hoc networking and computing
Efficient geographic routeless routing protocols with enhanced location update mechanism
International Journal of Sensor Networks
Survivability strategies in multihop wireless networks
IEEE Wireless Communications
Survey Paper: Routing protocols in ad hoc networks: A survey
Computer Networks: The International Journal of Computer and Telecommunications Networking
A local recovery routing protocol with clustering coefficient
AIC'10/BEBI'10 Proceedings of the 10th WSEAS international conference on applied informatics and communications, and 3rd WSEAS international conference on Biomedical electronics and biomedical informatics
The Robustness of RM-DSR Multipath Routing Protocol with Different Network Size in MANET
International Journal of Mobile Computing and Multimedia Communications
Hi-index | 0.00 |
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.