Building shared trees using a one-to-many joining mechanism
ACM SIGCOMM Computer Communication Review
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
Location-aided routing (LAR) in mobile ad hoc networks
Wireless Networks
Reverse path forwarding of broadcast packets
Communications of the ACM
Flooding for reliable multicast in multi-hop ad hoc networks
Wireless Networks
The broadcast storm problem in a mobile ad hoc network
Wireless Networks - Selected Papers from Mobicom'99
On Reducing Broadcast Redundancy in Ad Hoc Wireless Networks
IEEE Transactions on Mobile Computing
Ad-hoc On-Demand Distance Vector Routing
WMCSA '99 Proceedings of the Second IEEE Workshop on Mobile Computer Systems and Applications
A Highly Adaptive Distributed Routing Algorithm for Mobile Wireless Networks
INFOCOM '97 Proceedings of the INFOCOM '97. Sixteenth Annual Joint Conference of the IEEE Computer and Communications Societies. Driving the Information Revolution
On-Demand Multi Path Distance Vector Routing in Ad Hoc Networks
ICNP '01 Proceedings of the Ninth International Conference on Network Protocols
Scalable routing strategies for ad hoc wireless networks
IEEE Journal on Selected Areas in Communications
Scalable routing protocols for mobile ad hoc networks
IEEE Network: The Magazine of Global Internetworking
Adaptive sharing of large resources in P2P networks
Proceedings of the fourth international joint conference on Autonomous agents and multiagent systems
Review: Survey of multipath routing protocols for mobile ad hoc networks
Journal of Network and Computer Applications
A routing protocol suitable for backhaul access in wireless mesh networks
Computer Networks: The International Journal of Computer and Telecommunications Networking
Hi-index | 0.00 |
Ad hoc routing protocols that use broadcast for route discovery may be inefficient if the path between any source-destination pair is frequently broken. We propose and evaluate a simple mechanism that allows fast route repair in on demand ad hoc routing protocols. We apply our proposal to the Ad hoc On-demand Distance Vector (AODV) routing protocol. The proposed system is based on the Controlled Flooding (CF) framework, where alternative routes are established around the main original path between source-destination pairs. With alternative routing, data packets are forwarded through a secondary path without requiring the source to re-flood the whole network, as may be the case in AODV. We are interested in one-level alternative routing. We show that our proposal reduces the connection disruption probability as well as the frequency of broadcasts.