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
Scenario-based performance analysis of routing protocols for 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
Routing performance in the presence of unidirectional links in multihop wireless networks
Proceedings of the 3rd ACM international symposium on Mobile ad hoc networking & computing
SHORT: self-healing and optimizing routing techniques for mobile ad hoc networks
Proceedings of the 4th ACM international symposium on Mobile ad hoc networking & 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
Performance of Route Caching Strategies in Dynamic Source Routing
ICDCSW '01 Proceedings of the 21st International Conference on Distributed Computing Systems
Revisiting the TTL-based controlled flooding search: optimality and randomization
Proceedings of the 10th annual international conference on Mobile computing and networking
BRD: bilateral route discovery in mobile ad hoc networks
NETWORKING'07 Proceedings of the 6th international IFIP-TC6 conference on Ad Hoc and sensor networks, wireless networks, next generation internet
ETUS: enhanced triple umpiring system for security and robustness of wireless mobile ad hoc networks
International Journal of Communication Networks and Distributed Systems
A reverse AODV routing protocol in ad hoc mobile networks
EUC'06 Proceedings of the 2006 international conference on Emerging Directions in Embedded and Ubiquitous Computing
International Journal of Network Management
Hi-index | 0.00 |
On-demand routing protocols are preferred in mobile ad hoc networks where resources such as energy and bandwidth are constrained. In these protocols, a source discovers a route to a destination typically by flooding the entire or a part of the network with a route request (RREQ) message. The destination sends a route reply (RREP) message to the source after receiving the RREQ. The RREP travels hop by hop on the discovered route in reverse direction or on another route to the source. Sometimes the RREP can not be sent to the intended next hop by an intermediate node due to the dynamic network topology or network congestion. Existing on-demand routing protocols handle the undeliverable RREP as a normal data packet - discard the packet and send a route error message to the destination (initiator of the RREP). This is highly unacceptable because a RREP message has a lot at stake - it is obtained by a large number of RREQ transmissions, which is an expensive and time-consuming process. Furthermore, the source may have to start another round of route discovery to establish the route because of the loss of the RREP. This will exacerbate the situation. In this paper, we propose the idea of salvaging route reply (SRR) to improve the performance of on-demand routing protocols. SRR attempts to salvage an undeliverable RREP in two possible ways: looking up the route cache for an alternate path and conducting a one-hop SRR route discovery. We present an implementation of SRR in AODV routing protocol. The results of an extensive simulation study confirm the performance improvement in all critical metrics, namely, packet delivery ratio, control overhead and end-to-end delay.