Abstract—This paper describes two novel routing algorithms that take into account the effect of distance between nodes and network congestion level on energy consumption. We formulate the routing problem as the minimization of energy Cost functions which reflect the key features of the problem under consideration. For route maintenance, we applied the least-recently used (LRU) replacement policy in caches to maintain route table and to remove the time-to-live parameter in some on-demand protocols such as Ad hoc on-demand distance vector (AODV). An on-demand routing protocol for mobile Ad hoc network (MANET) is one that searches for and tries to discover a route to some destination node only when a sending node generates a data packet addressed to that node. In order to avoid the need for such a route discovery to be performed before each data packet is sent, such routing protocols must cache previously discovered routes. But the cache itself may contain stale information due to nodes mobility. To solve the problem, we propose a new route cache scheme to improve the performance of route cache for finding more accurate and faster route to the destination. We developed an efficient algorithm for route discovery and management, and mobility handling for on demand cache routing on wireless mobile Ad hoc networks (MANET). We applied L-1 and L-2 route caches in each node to manage this algorithm efficiently. For mobility handling, we developed a sub-algorithm to handle node addition, deletion and movement in the network efficiently.
Index Terms—Wireless MANET, on-demand routing, route cache, route discovery, mobility management.
Dhanashri D. Dhobale is with P. V. P. I. T. Budhgaon, Sangli, India
R. Ghorpade is with D. Y. P. C. O. E, Kolhapur, India
Cite: Dhanashri D. Dhobale and V. R. Ghorpade, "Wireless Ad-hoc Networks with On-dem and Cache Routing," International Journal of Computer Theory and Engineering vol. 3, no. 6, pp. 785-788, 2011.