Efficient On-Demand Cache Routing for Mobile Ad Hoc Networks

被引：1

作者：

Lee, Fenglien ^{[1
]}

Swanson, Carl T. ^{[1
]}

Liu, Jigang ^{[2
]}

机构：

[1] Univ Guam, Math & Comp Sci, Mangilao, GU 96923 USA

[2] Kyoto Univ, ACCMS, Kyoto, Japan

来源：

2009 2ND IEEE INTERNATIONAL CONFERENCE ON COMPUTER SCIENCE AND INFORMATION TECHNOLOGY, VOL 4 | 2009年

关键词：

MANET; on-demand routing; route cache; route discovery; mobility management;

D O I：

10.1109/ICCSIT.2009.5234595

中图分类号：

TP [自动化技术、计算机技术];

学科分类号：

0812 ;

摘要：

In this paper, we developed an efficient algorithm for route discovery and management, and mobility handling for on-demand 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 content-addressable 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.

引用

页码：167 / +

页数：2