Efficient On-Demand Cache Routing for Mobile Ad Hoc Networks
In this paper, we developed an efficient algorithm for route discovery and management, and mobility handling for ondemand cache routing on mobile ad hoc networks (MANET). We applied L-1 and L-2 route caches in each node to manage this algorithm efficiently. For route discovery, we developed a simpler and more efficient broadcast approach than in AODV (Ad-hoc On-demand Distance Vector Routing). We take the contentaddressable search feature in cache to access any entry in the route cache in only a few processor cycles. For route maintenance, we applied the LRU replacement policy in caches to maintain route table and to remove the time-to-live parameter in some on-demand protocols such as AODV and DSR (Dynamic Source Routing). For mobility handling, we developed a sub-algorithm to handle node addition, deletion and movement in the network efficiently. The NS-2 simulation results show that our algorithms outperform other on-demand protocols on packet delivery rate, end-to-end delay and average routing load.
MANET on-demand routing route cache route discovery mobility management
Fenglien Lee Carl T. Swanson Jigang Liu
Math & Computer Science University of Guam Mangilao, Guam, USA ACCMS Kyoto University Kyoto, Japan
国际会议
北京
英文
2115-2119
2009-08-08（万方平台首次上网日期，不代表论文的发表时间）