ISSN: 1693-6930
TELKOMNIKA Vol. 13, No. 2, June 2015 : 711 – 721
712 considers relative mobility, residual energy and connectivity degree of nodes. In addition, the
cluster stability is maintained by an algorithm that considers the aggregate energy metric of cluster heads.
The rest of the paper is organized as follows. Section 2 explains the CBRP briefly. Section 3 gives a brief summary of related works. Section 4 proposes an efficient cluster based
routing protocol AECBRP. Section 5 discusses simulation setup, and results. Finally, Section 6 presents the paper’s conclusions.
2. Overview of CBRP
The CBRP is a distributed, efficient and scalable protocol that uses clustering approach to decrease the traffic of route discovery messages in the network. CBRP has less overhead
and higher throughput compared to Ad hoc On-Demand Distance Vector AODV protocol. In this protocol the whole network is divided into overlapping or disjoint clusters. Each cluster
contains a cluster-head, gateways and members. A gateway is a node through which member nodes communicate with the adjacent cluster-head. The clustering algorithm of CBRP is a
variation of simple lowest-ID clustering algorithm. The node with the lowest-ID in its neighbours is elected as cluster-head. Each cluster-head considers all neighbours having bi-directional
links, as members. Each node maintains a neighbour table NT and a cluster adjacency table CAT. The neighbour table is used for receiving the link status for sensing and forming clusters.
The cluster adjacency table keeps the information of adjacent clusters and is used by CBRPs Adjacent Cluster Discovery Procedure. These tables are updated by periodic hello message.
The hello message includes the node ID, the node role cluster-head, member, undecided. If the hello message is not received from a specific node, that entry will be removed from the table
[5].
CBRP is based on source routing that using cluster structure to minimize the flooding traffic during the route discovery process. Furthermore, the use of uni-directional links increases
the network connectivity. In route discovery procedure cluster-heads searching for a source route are flooded with Route Request RREQ Packets. The cluster-head forwards RREQ
packet only once and never sends it to a node that has already recorded in the route [6].
The advantage of CBRP is that only cluster-heads exchange routing information. Thus, compared to the traditional flooding methods, the control overhead transmitted is far less.
However, CBRP is like other hierarchical routing protocols that has cluster formation and maintenance overhead.
For performance optimization, CBRP recommends a shortening route. Since CBRP uses a source routing scheme, a node gets all information about route when receiving a packet.
Nodes exploit route shortening as next hop to minimize the hop number and adapts to network topology changes to choose the most distant neighboring node in a route. Local repair is
another optimization method that is employed by CBRP. It checks the routing information contained in the packet whenever a node has a packet to forward and the next hop is not
reachable. In a route, if the next hop or the hop after the next hop is reachable through one of its neighbors, the packet is forwarded through the new route [7].
3. Related Works
