Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
A distributed routing algorithm for mobile wireless networks
Wireless Networks
An engineering approach to computer networking: ATM networks, the Internet, and the telephone network
An efficient routing protocol for wireless networks
Mobile Networks and Applications - Special issue: routing in mobile communications networks
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
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
Performance of multipath routing for on-demand protocols in mobile ad hoc networks
Mobile Networks and Applications
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 analysis of fault-tolerant beacon vector routing for wireless sensor networks
MSWiM '05 Proceedings of the 8th ACM international symposium on Modeling, analysis and simulation of wireless and mobile systems
A local repair scheme with adaptive promiscuous mode in mobile ad hoc networks
MSN'05 Proceedings of the First international conference on Mobile Ad-hoc and Sensor Networks
AODV based multi-path local repairing scheme for mobile ad hoc networks
WORLD-EDU'12/CIT'12 Proceedings of the 6th international conference on Communications and Information Technology, and Proceedings of the 3rd World conference on Education and Educational Technologies
Hi-index | 14.98 |
In ad hoc networks, information transfer is achieved in multihop mode using peer-to-peer routing. A route consisting of multihops breaks primarily because of the failure of single or adjacent links, caused by relative movement of one or more nodes. To address this inherent characteristic of ad hoc networks, we propose and analyze an on-the-fly strategy that locally repairs the broken route, thereby minimizing the routing overhead. The main motivation behind our Localized Route Repair (LRR) work is to decrease the reaction time of routing protocols, which totally avoids retransmissions. A detailed simulation with MAC layer and Physical layer model is used to understand the impact of this mechanism on the performance of routing protocol. An analytical model for the LRR technique is also presented and the results observed to match well with the simulation results. Our technique clearly achieves substantial improvement in terms of communication delay, routing overhead, and, hence, provides enhanced reliability.