HAODV Routing Protocol for Clustering using Efficiency Division Factor

Conference: Sixth International Conference on Recent Trends in Information, Telecommunication and Computing
Author(s): Anzar Ahmad, Joshi R C, Gupta S C Year: 2015
Grenze ID: 02.ITC.2015.6.539 Page: 106-113

Abstract

Infrastructure less Mobile Ad-hoc Network (MANET) networks is dynamics in nature and hence offer many challenge to routing protocol. MANETs have two different network topologies: flat and hierarchical architecture. In a flat network design, each node has essentially the same job and is adequate for small networks and is easy to design, implement and maintain as long as the network stays the same. When the network grows, a flat network becomes undesirable because it provides delay and put a burden on network management. So hierarchical network becomes a better choice. In a hierarchical network, the nodes are divided into group or clusters. Each cluster could have a cluster head (CH) which is mainly responsible for the route calculation and communication wit in the cluster and outside the cluster. This work proposes a novel routing protocol for clustering in the network called Hierarchical Ad-Hoc on demand distance vector (HAODV) routing protocol that divides the larger network into small clusters. Unlike other scheme ,in the proposed algorithm ,criteria used to choose the cluster head (CH) is based on efficiency division factor (EDF).

<< BACK

ITC - 2015