AN AODV-Based Clustering and Routing Scheme for Mobile Ad Hoc Networks

Abstract

A mobile ad hoc network (MANET) is a collection of wireless mobile nodes forming a temporary network without the aid of any fixed communication infrastructure. Due to limited resources, frequent network partitions and unpredictable topological changes, proactive clustering schemes incur high overheads in this environment. In this paper, we propose an on-demand, distributed clustering algorithm for MANETs based on an Ad hoc On-demand Distance Vector (AODV) routing protocol. The use of on-demand routing protocol information for clustering reduces clustering overhead because no clusters are maintained unless they are needed. The clustering algorithm’s stability was assessed using clustering metrics such as cluster head and cluster members lifetime. Based on this clustering scheme, a cluster-based routing protocol was proposed to add scalability to the AODV routing protocol. Using simulation, a comparison was made with a pure AODV protocol. Simulation experiments show that the scheme results in stable and scalable clusters and Cluster-AODV routing introduces less overhead than the pure AODV protocol without clustering.KeywordsCluster HeadPacket Delivery RatioOptimize Link State RouteExpiration TimeNeighbor TableThese keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.