Passive cached clustering routing for MANETs

This paper presents a passive caching mechanism used on clustering routing protocols for mobile ad hoc networks (MANETs). It utilizes the backbone U. Kozat et al., (2001) of the network to gather and reuse the discovered routing information more efficiently and effectively. In this paper we propose a caching mechanism based on existing clustering algorithms, we build databases of routing information on nodes along the network backbone organized by clustering algorithms. Thus, instead of generating routing packets to discover routes, ondemand routes can be found by accessing databases of routing information distributed on the backbone. Therefore, routing overhead caused by route discovery is reduced.

[1]  Mahesh K. Marina,et al.  Virtual dynamic backbone for mobile ad hoc networks , 2001, ICC 2001. IEEE International Conference on Communications. Conference Record (Cat. No.01CH37240).

[2]  David A. Maltz,et al.  Dynamic Source Routing in Ad Hoc Wireless Networks , 1994, Mobidata.

[3]  C C. Chiang,et al.  Routing in Clustered Multihop, Mobile Wireless Networks With Fading Channel , 1997 .

[4]  Charles E. Perkins,et al.  Ad hoc On-Demand Distance Vector (AODV) Routing , 2001, RFC.

[5]  Kin Choong Yow,et al.  A hierarchical routing protocol providing stability and distribution for MANET , 2003, Fourth International Conference on Information, Communications and Signal Processing, 2003 and the Fourth Pacific Rim Conference on Multimedia. Proceedings of the 2003 Joint.