Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers
SIGCOMM '94 Proceedings of the conference on Communications architectures, protocols and applications
An efficient routing protocol for wireless networks
Mobile Networks and Applications - Special issue: routing in mobile communications networks
The performance of query control schemes for the zone routing protocol
Proceedings of the ACM SIGCOMM '98 conference on Applications, technologies, architectures, and protocols for computer communication
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
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
| Hi-index | 0.00 |
Low resource availability in Mobile Ad hoc NETworks (MANETs) requires efficient utilization of resources and imposes severe demands on routing protocols, motivating their study, since the existing (for wired networks) routing protocols perform poorly, due to the unique characteristics of MANETs. The Dynamic Source Routing (DSR) protocol is one of the most important, simple, and efficient reactive source routing protocols designed specifically for use in multi-hop mobile ad-hoc wireless networks. Source nodes use route caches to maintain previously discovered routes, leading to significantly smaller routing latency for later route requests, and to the reduction of the control traffic required for route discovery. However, prolonged storage of route caches may render them obsolete and when an invalid route is used, extra traffic overhead and routing delay is incurred to discover the broken links. In this work we assume a mobile ad hoc network that uses DSR to route packets. We study the management of routing data stored in the nodes' route caches by optimizing the cached route lifetime using a Time-To-Live (TTL) interval. The idea is to purge cache entries after some Time-To-Live (TTL) interval. Firstly we study the route lifetime for different route lengths in an ad-hoc wireless network. Secondly we compare our result with those obtained from a mathematical analysis and conclude that the use of this technique enables the protocol to avoid using routes that lead to routing errors and especially to time consuming errors. Finally we develop an algorithm that estimates the lifetime of aU routes in the network, and optimizes TTL settings in real time for every new discovered cached route, using OPNET modeler as the simulation environment.