AODV compatible routing with extensive use of cache information in ad-hoc networks

  • Authors:

  • Wooi-Ghee Wang;Takahiro Hara;Masahiko Tsukamoto;Shojiro Nishio

  • Affiliations:

  • Osaka University, 2-1 Yamadaoka, Suita, Osaka 565-0871, Japan;Osaka University, 2-1 Yamadaoka, Suita, Osaka 565-0871, Japan;Osaka University, 2-1 Yamadaoka, Suita, Osaka 565-0871, Japan;Osaka University, 2-1 Yamadaoka, Suita, Osaka 565-0871, Japan

  • Venue:
  • Proceedings of the 2002 ACM symposium on Applied computing
  • Year:
  • 2002

Quantified Score

Hi-index 0.00

Visualization

Abstract

Recently, there has been an increasing interest in ad-hoc networks, which are dynamically constructed by collections of mobile hosts without using any existing network infrastructure or centralized administration. Each mobile host plays a role of a router and relays packets for multihop network communications. A recent trend in ad-hoc network routing is the reactive on-demand philosophy where routes are established only when required. Most of the protocols in this category, however, show a long latency in route discovery since the cached routing information will be invalidated even if it is still effective. In this paper, we propose a scheme which is compatible to the existing Ad-hoc On-Demand Distance Vector (AODV) protocol and prevents the cached routing information from becoming invalidated without using any extra control message. We also verify the effectiveness of the newly proposed scheme by simulation experiments.