Randomized dynamic route maintenance for adaptive routing in multihop mobile ad hoc networks
Journal of Parallel and Distributed Computing
| Hi-index | 0.00 |
Many novel ideas have been proposed for designing multihoprouting protocols in MANET (Mobile Ad-hoc Networks).Many of them adopt a method, called flooding,to discover a routing path. In order to increase the overallrouting performance and make optimum use of the limitedresources, discovered routing paths need to be dynamicallymaintained to be continuously optimal in the highlydynamic network topology. However, the flooding is inappropriatefor the dynamic route maintenance due to itssignificant inherent overhead. In this paper, we propose anomadic control packet (NCP)-based dynamic route maintenancescheme for adaptive routing in MANET. The NCPtravels through the network based on a random walk, andcollects its stopovers as a traversal record for the purposeof dynamic route maintenance and efficient route discovery.The NCP probabilistically provides nodes with cluesto routing path updates by using its traversal record. Thenodes can find up-to-date and optimal (less-loaded andshorter) routing path information from the clues, therebyadapting to the dynamic network topology and traffic loadconditions. The NCP-based dynamic route maintenancescheme can be easily applied to ad hoc on-demand routingprotocols such as AODV and DSR with minimum modifications.In our simulation study we modified the AODVprotocol to maintain routing paths using NCPs' traversalrecord. The simulation results show that the utilization ofNCPs helps the routing protocol to notably reduce averageend-to-end packet delay with the help of the increased routeoptimality and traffic congestion control.