163

CHAPTER 5

NOVEL ADAPTIVE INTEGRATED BIO INSPIRED

CLUSTER BASED MULTIPATH ROUTING
5.1

INTRODUCTION

The wide spread usage of laptops, sensor devices, PDAs and other
mobile electronic devices leads to the increasing popularity of Ad-hoc wireless
networks. These devices will eventually need to communicate with each other,
in some cases, without an adequate infrastructure to rely on. This arise the
need of routing protocols that can work without any central gateway to
connect with.

The node mobility and constrained resources make routing in

MANETs a taunting task. Mobility instigates frequent topology changes and
may break existing paths. More importantly, resource constraints in MANETs
require a routing protocol to fairly distribute routing tasks among the mobile
hosts.

As network size increases, communication costs tend to consume a

larger proportion of the bandwidth. Furthermore, as the rate of the network
topology change increases, the exchange of routing tables between
neighbouring nodes must be more frequent to keep the routing information up
to date. Other network parameters, such as network node density and traffic
load, can also impair network scalability.

Print to PDF without this message by purchasing novaPDF (http://www.novapdf.com/)

164

In order to allow ad hoc networks to achieve commercial success,

the scalability problem has to be solved. One promising approach is to build
hierarchies among the nodes, such that the network topology can be
abstracted. This process is commonly referred to as clustering and the
substructures that are collapsed in higher levels are called clusters. Clustering
is an effective method that builds and maintains hierarchical addresses in ad
hoc networks. In addition, building clustered hierarchies is affordable and
enhances network quality of service [4]. Clustering provides scaling and eases
in routing with efficient resource management in mobile ad hoc networks
(MANET)s [12, 32, 59].

Routing can be viewed as an optimization problem where swarm

intelligence can be applied for effective routing.

Most of the existing routing protocols for MANETs [45, 46] are not
considering the fairness into account. They tend to have a heavy burden on the
hosts along the shortest path from a source to a destination. This paves the way
for the heavily loaded hosts to deplete power energy quickly, which in turn
will lead to networks partitions and failure of application sessions. The
multipath routing is proposed as an alternative to single shortest path routing
to distribute load and assuage congestion in the network. In multipath routing,
traffic bound to a destination is split across multiple paths to that destination.
Multipath routing aims to establish multiple paths between source-destination
pairs and thus requires more hosts to be responsible for the routing tasks. Even
though multi-path analysis have been covered fairly [3, 33,62], research on
multi-path routing for MANET is still in the early age.

Print to PDF without this message by purchasing novaPDF (http://www.novapdf.com/)

165

The main aim of this proposed framework is to construct a clustered

network using Artificial Bee Colony Optimization and the implementation of
AODV routing protocol with the incorporation of BAT algorithm to establish
multiple paths between source-destination pairs and distribute traffic through
them, decrease congestion and maintains load balancing. Therefore,
combining the multipath of the MANET with cluster hierarchical topology and
the implementation of artificial bees and bats, a new algorithm is proposed
named Clustered ABC and BAT Algorithm based Multipath AODV Routing
(CABM-AODV).

In section 5.2 Clustering techniques have been articulated. In

section 5.3 the framework of Integrated Bio Inspired Cluster based Multipath
routing (CABM-AODV) has been proposed and the simulation results and the
efficiency of the new proposed routing method have been discussed in section
5.4.The summary of this chapter is presented in section 5.5.

5.2

CLUSTERING TECHNIQUES - AN OVERVIEW

A cluster is a group of linked nodes, working together closely so

that in many respects they form a single network, in which, all nodes works
together for same purpose and belongs to same topological structure.

An ad hoc network is a multihop wireless communication network

supporting mobile users without any built-in infrastructure. Addressing and
routing and is a major impediment in ad hoc networks that does not scale up as
easily as in the Internet [8, 38].

Print to PDF without this message by purchasing novaPDF (http://www.novapdf.com/)

166

In a distance-vector routing protocol of ad-hoc network, each node

participating in the route calculation stores a routing table and shares it with all
neighbouring nodes. If the network has flat topology (that is, all nodes are
treated equally), the size of the routing table is proportional to the number of
nodes in the entire network.

The movements of mobile nodes in the network may cause local

topology changes but do not drastically alter the overall structure of the
network. Since many of these changes are concerned to a relatively small
region, the network can be abstracted to obtain a simpler topology and avoid
the need to inform the entire network of these topology changes. Local
portions of the network are represented by super-vertices in the abstracted
topology and connections between them are super-edges. Clustering is a
process of defining such an abstracted structure of a network. It can be applied
recursively to obtain a multi-level hierarchy. After clustering, each node in the
hierarchy can be assigned a hierarchical address that indicates its position in
each level of the hierarchy. Routing can easily be carried out using such
addresses [11, 12, 13].

In cluster structure, a Cluster head is allocated to each cluster for

performing various task of inter and intra cluster maintenance. The
performance of a cluster also depends upon the number of cluster member
nodes in the cluster.

Print to PDF without this message by purchasing novaPDF (http://www.novapdf.com/)

167

Gateway Node
Intra-Cluster routing

Inter-cluster routing
Ordinary Node
Cluster Head

Figure.5.1 Cluster Structure of a Network

Basic terminology:

Cluster: It refers to a collection of nodes, grouped for the functioning for same
purpose.

Cluster Head (CH): Cluster head is a special node which has certain extra
responsibilities. All the information is passed through this node only.

Cluster Gateway (CG): A node which is common member of more than one
cluster is called as Cluster Gateway.

Cluster Member Node (CMN): The nodes which are the member of a cluster.

Print to PDF without this message by purchasing novaPDF (http://www.novapdf.com/)

168

Benefits of Clustering:

The size of routing table in each and every node in the network is
reduced by clustering method

Routing overhead is minimized

Network management is made ease
Provides QoS guarantees
Provides localized route discovery/recovery to minimize route and
QoS re-establishment delay.

End-to end delay is reduced

5.2.1
(i)

REVIEW OF CLUSTERING ALGORITHMS

Lowest-ID Clustering

The Lowest-ID is considered as a simplest clustering scheme

algorithm [12]. In this scheme unique identifier (ID) is assigned to each node.
All nodes recognize its neighbours ID and CH is chosen according to
minimum ID. Thus, the nodes Ids of the neighbors of the CH will be higher
than that CH.
The main drawback with this scheme is;
There is no limitation to the number of nodes attached to the same CH.

CHs are prone to power drainage due to serving as cluster heads longer
period of time.

Print to PDF without this message by purchasing novaPDF (http://www.novapdf.com/)

169

(ii)

Highest Degree Clustering

In comparison with Lowest-ID scheme, the degree of nodes is

computed based on its distance from each others [12].

All nodes flood its connectivity value within their transmission

range. Thus, a node decides to become a CH or remain as CN by comparing
the connectivity value of its neighbours with its own value. Node with highest
connectivity value in its vicinity will become CH. Connectivity-based
clustering follows the same circumstances of ID-based regarding to cluster
size and performance degradation.

(iii)

K-hop Connectivity ID (K-CONID)

This technique appeared by combining the lowest ID clustering

algorithm with the Highest Degree heuristics technique [59]. With a view to
select both CHs connectivity and lowest ID, as a first and second criterion
respectively, K-CONID will minimize both of circumstances of using only
node connectivity that causing numerous ties between nodes and using only
lower ID which generate more clusters than necessary. The algorithms begin
by allow nodes to start a flooding process for clustering request to all other
nodes. The algorithm generalizes connectivity for a k-hop neighbourhood. In
this clustering algorithm the node connectivity D is paired with node ID
providing DID = (D, ID). Anode is elected to be CH if and only if it has
highest connectivity and lowest ID.

Print to PDF without this message by purchasing novaPDF (http://www.novapdf.com/)

170

(iv)

Threshold Power Consumption (TPL) Clustering

According to the concepts applied by TPL scheme, clustering is

performed as a shared process between all MANET members. Since TPL
algorithm gave the ability to every node in the cluster to be elected as CH if it
satisfies the scheme conditions. This provides long lifetime by share power
consumption between all nodes and not to be conserved for only one or set of
nodes [13]. Since TPL uses Threshold total Energy Average TTEA as a level
of measurement to define the time of cluster maintenance and CH election
phase. Since the CH must be changed if its current power level is reach to
TTEA and election of new CH can done only if its current power level is
higher than TTEA with knowledge review of past elected CHs. According to
that, TPL gives the ability to all nodes to be as CH and minimizes the power
drainage of CHs and also, shares CH responsibility between all CN members.

(v)

Mobility Based D-Hop Clustering Algorithm

Another approach can be used with clustering in MANETs. It

applies partitioning on wireless ad hoc network into D-Hop clusters. This
process based on mobility metric as it follows the objectives of forming
clusters with more flexible cluster diameter according to D-Hop. This
technique is adaptable with respect to node mobility, as it assumes that each
node has the ability to measure its received signal strength. Regarding to this,
a node can estimate its distance from its surrounding neighbors. Consequently,
the node can indicate closeness according to signal strength [8]. Five
calculated terms are required with this algorithm:

Print to PDF without this message by purchasing novaPDF (http://www.novapdf.com/)

171

1. The estimated distance between nodes.

2. The relative mobility between nodes.
3. The variation of estimated distance over time.
4. The local stability.
5. The estimated mean distance.

Accordingly, the relative mobility corresponds to the difference of

the estimated distances between nodes at two successive moments of time.
This parameter indicates the variation of distances between nodes. The
divergence of estimated distances between two nodes is computed rather than
calculating physical distance between two nodes. Since the physical distance
between two nodes is not an accurate measure of closeness. This can be
illustrated as if a node runs out of its energy. So, the transmitted packet will be
at lower power rate. This shows that the node acting as a distanced node from
its actual physical location with respect to its neighbors. Both of variation of
estimated distance and relative mobility between nodes are used to calculate
the local stability. A node may be elected as a CH if it is found to be the most
stable node among its neighborhood. Consequently, the node with the lowest
value of local stability among its neighbors will be the CH.

(vi)

Least Clustering Change Algorithm (LLC)

LLC has an important improvement over Lowest-ID and HighestDegree Clustering Algorithms [12]. Since most of algorithms require
performing

procedure

of clustering

periodically to

satisfy

specific

characteristics of CHs, the cost of cluster maintenance must be taken into

account. In Highest-Degree Clustering, the algorithm is performed to check

Print to PDF without this message by purchasing novaPDF (http://www.novapdf.com/)

172

the local highest node degree periodically as it specifies the aspect of CH

election. Thus, current CH will force to hand over its roles if it finds any
member node with higher degree. Frequent re-clustering involved by this
mechanism.

In contrast, LLC clustering algorithm is divided into two phases:

1.
2.

Cluster formation.
Cluster maintenance.

The first phase simply applied as Lowest-ID algorithm by choosing

mobile nodes with Lowest-ID in their neighborhoods as CHs . But, cluster
maintenance is performed as event-Driven and called only under two
circumstances; first, when a node cant access any CH. Thus, it call cluster
formation phase to rebuilds the cluster structure according to Lowest-ID
techniques. Second, when more than one node reaches the transmission range
of each other, this requires giving up CH roles except only one which become
a CH. Hence, LLC significantly enhances clustering and increase its stability
in mobile ad hoc network by releasing the requirement that a CH should
reserve some special features and characteristics within its local area.

(vii) Adaptive Cluster Load Balance Method (ACLBM)

According to Highest-Degree clustering scheme, CHs can be

exhausted specially at the time they serves too many mobile hosts. This
situation is not recommended since CHs becomes a bottleneck. Consequently,
ACLBM includes an Option field inside the hello message format [59].

Print to PDF without this message by purchasing novaPDF (http://www.novapdf.com/)

173

According to that, if a sender is CH, then the number of its dominated

member nodes will be set as an Option value. Otherwise, Option value
will be reset to 0. Therefore, when a CHs hello messages shows CH
dominated set exceeds the maximum number it can manage; new node will not
try to participate in this cluster. Thus, ACLBM can optimize the cluster
structure and eliminate the CH bottleneck situations. In this case, information
transmission and resource management is distributed to all clusters instead of
few of them.

(viii) Load Balancing Clustering (LBC)

LBC includes the concept of applying a user defined restriction to

be placed on the clustering maintenance [59]. This can be done by setting up
the maximum amount of time or budget the node can serve as CH. This budget
can be modified to meet the system characteristics. According to this scheme,
each node has virtual ID (VID) identifier which normally initialized by node
ID.As contrary with Lowest-ID, LBC initially chooses the CHs with the basis
of the highest IDs. It limits the maximum unit of time that a node can serve as
CH continuously. Thus, when a CH exhausts its duration budget, then its VID
must be reset to 0 and the CH become an ordinary node (CN). In case of
reaching more than one CHs to the range of each other, CH with higher VID
wins the CH role. In a cluster head resign case, a non-CH with the largest VID
value n the neighborhood can resume the CH functions. The newly elected
node as CH is the one whose previous total CH serving time is the shortest in
its neighborhood. This should guarantee good energy level for being a new
CH.

Print to PDF without this message by purchasing novaPDF (http://www.novapdf.com/)

174

(ix)

Max-Min D-Cluster

In contrast to those algorithms that defined CH election in the way

that prevents nodes to be far away from its CH by more than 1-hop. The MaxMin heuristic clusters are formed by those nodes that can be far away at most
by d-hops from its CHs [59]. A d-neighborhood design consists of all nodes
located within d-hops away from the node as well as the node itself.
Accordingly, d value is defined as the maximum number of hops the node is
away from the nearest CH (q 1). Consequently, Max-min d-cluster scheme
allow control on the number of CH that can be selected. Thus, the algorithm
guarantees a good controlled message complexity. Furthermore, there is
control over the density of CHs in the network. In this algorithm nodes are
candidates to be CHs based on their Ids [4] rather than their degree of
connectivity [8]. To do this, special data structure are required; each node has
two arrays called WINNER and SENDER. The first one implements the
winner node IDs of a particular round. Where the later is corresponds to the
nodes that send the winning node ID for particular round. At the moment that
the CH selected, SENDER helps to determine the minimum number of hops
back to the CH. Initially, every node set its WINNER value to equal to its own
ID. The algorithm maintains nodes information over 2drounds of flooding. In
this way all node exchange their nodes IDs. Although, all of nodes are
candidates to be CH based on their node ID rather than their degree of
st

connectivity. In the 1 d-round, each node broadcast its WINNER value to all
nodes in its 1-hop neighbors. This followed by cascaded occurrences of the
same process for every d-round, so nodes will determine their new WINNER
values as the highest value. Therefore, all nodes in the 2
st

nd

d-round will begin

with the value that exists at each node after 1 d-round. In this procedure,

Print to PDF without this message by purchasing novaPDF (http://www.novapdf.com/)

175

within each d-round, a node chooses for its new WINNER value the lowest
value among its received WINNER values and its own. The selection of CH is
based on registered entries of each node after 2d-round of flooding. A node
can declare itself as a CH if it has received its original ID after 2d rounds of
floods. Otherwise, each node should look for node pairs, this pair is defined as
st

any node ID that result as a WINNER at least once in the 1 d-round as well
as in the second 2

nd

d-rounds for an individual node. After detecting all pairs,

the node will choose the minimum node pair as CH. Therefore, the lowest
node ID appearing in booth stages of flooding is chosen as CH. The SENDER
array is used to give the CH the ability to obtain information of every node in
its cluster.

5.3

FRAMEWORK OF INTEGRATED BIO INSPIRED

CLUSTER BASED MULTIPATH ROUTING (CABMAODV)

5.3.1

Overview

In MANET all the nodes are equity, and functions as terminal as

well as router. MANET with the plane structure leads to increase in routing
control overhead and the scalability problems. Clustering provides scaling and
eases in routing with efficient resource management in mobile ad hoc
networks (MANET)s.

The purpose of Clustering is to construct a scalable network with

quality repairable routing path for maintenance. For scalability purpose, the
network is divided into several clusters. When two mobile nodes communicate

Print to PDF without this message by purchasing novaPDF (http://www.novapdf.com/)

176

with each other, the connecting path between source and destination may be
from one cluster or through several intermediate clusters. Therefore, the
maintenance and management efforts can be distributed into several
intermediate clusters.

To sustain the multihop and mobile characteristics of wireless ad

hoc network, the rapid deployment of network and dynamic reconstruction
after topology changes are effectively implemented by clustering management.

5.3.2

Formation of Clusters

The nodes in the network will be in any of the four states:

SECLUDED (not member of any cluster), CMN (Cluster Member Node), CH
(Cluster Head) and CG (Cluster Gateway).

Data Structures:

The following are some of the important data structures used by the
nodes in the network.
a) NEIGHB-TAB: This table is maintained by all nodes in the network
that contains the information about its other neighbor nodes.
b) CH-NEIGHB-TAB: This table is used by all the cluster heads of the
network to keep track of the information about its neighboring cluster
heads.

A clustered network is formed, when the mobile nodes start

discovering each other. Initially, all the nodes in the network are in state
SECLUDED. During initial setup, each starts discovering other nodes by

Print to PDF without this message by purchasing novaPDF (http://www.novapdf.com/)

177

broadcasting HELLO-BEE packets in the network. All of the receiving nodes

start the discovery process and broadcast HELLO-BEE packets. All nodes in
the network become aware of other nodes information by this way.

The Node Eminence (NE) value is calculated for each and every
node in the network in the following manner:
(1)

where NN is the number of neighbor nodes and R is the node residual

energy(battery power). This calculated value using the Eq.1 is collected during
the bees navigation process to elect the cluster head. The node with highest
NE value is elected as cluster head and its status is updated as CH and this
information is distributed to all other members of the cluster whose status are
set as CMN and the NEIGHB-TAB is updated with this information. The NE
value of each node is updated periodically.

The Neighbor Table (NEIGHB-TAB) entry is associated with a

timer. A table entry will be removed if a HELLO-BEE packet from the entry's
node is not received for a period of time interval T i.

The cluster head node periodically sends the LIVE-BEE packets to

all other members of the cluster for cluster updation. Nodes can initiate the
cluster head election process at particular predetermined period of time (T che).
If a SECLUDED node before the end of T che period receives LIVE-BEE
packets from any cluster head(CH), sets IDch with the recent CH address and
sets its state to CMN. If no LIVE-BEE packets are received from any cluster
head at the time period Tche the SECLUDED searches its NEIGHB-TAB table

Print to PDF without this message by purchasing novaPDF (http://www.novapdf.com/)

178

for nodes with higher NE value than its NE value. If no such node is found it
elects itself as cluster head and sets its state to CH and set IDch with its own
ID.

The Cluster Gateway (CG) nodes are selected in the following

manner:

If the cluster member node (CMN) receives a LIVE-BEE packet

from another cluster head CH(i) whose entry is not in its NEIGHB-TAB,
sends a CGW-REQ message including the details of new CH (i) to its current
cluster head. Upon receiving the CGW-REQ message from the CMN node, the
current CH node searches for the entry of CH(i) in its CH-NEIGHB-TAB and
insert into it, if no match is found. Then a CGW-ACK message which is the
conformation to the CMN to act as cluster gateway will be sent. The status of
the CMN node is set to CG (Cluster Gateway) after the receipt of CGW-ACK
message from its current cluster head. The IDch is also changed with the
highest NE cluster head.

The very high mobility of nodes will change the network topology
drastically. Therefore, in clustering a node may join or leave at any time. Two
Cluster heads may come within one hop, which may leads to trigger a cluster
head change event. When two CHs receive LIVE-BEE packet from each other,
their NE value is compared. The CH with the higher NE value is elected as CH
and the other one give up its role of CH and changes its status from CH to
CMN and this information is disseminated within the corresponding clusters
for updation. This might trigger reorganization of other clusters.

Print to PDF without this message by purchasing novaPDF (http://www.novapdf.com/)

179

5.3.3

Clustered ABC & BAT algorithms Based AODV

Routing Mechanism

In clustering approach, the entire network is divided into groups

known as clusters and each cluster has a cluster head which is elected by the
members of that group and is responsible for the entire cluster. Within each
cluster the information is disseminated by employee bees. This employee bee
is capable of navigating through the underlying cluster head and performs
various tasks at each node independently. Application of artificial bees is a
good way for topology discovery within cluster rather than disseminating
beacon packet within the entire network for updated information. The bats are
used to establish multiple paths between source and destination nodes.

A computer network is modeled as a graph G=(V,E),where V is the

set of vertices which represents the mobile nodes and E is the set of edges
which represents the links between the mobile nodes. Let S be the source node
and D be the destination node. A cluster is denoted by C i={Nij},where Nijis
the member of cluster i. Let CHi be the cluster head of Ci.

5.3.3.1

Route Establishment Phase

The steps involved in the new CABM-AODV routing algorithm to

establish paths between source and destination node are as follows.

1) When a source node S (S Ci) wants to transmit data to destination D,

S sends route request bats (RREQ) to its cluster head CHi.

Print to PDF without this message by purchasing novaPDF (http://www.novapdf.com/)

180

2) If D is a member of cluster Ci and also if it receives the route request

message, then

2.1 It sends Reverse Route Request-Bats(R-RREQ) through all

available paths to Source S.

2.2 Upon receiving multiple route replies from the destination D, the
source node S selects the completely node disjoint paths
represented by the bats.

2.3 The selected node-disjoint paths are arranged based on the

maximum average residual energy and minimum time delay.

2.4 The

numbers of paths with maximum residual energy and

minimum

delay values

which

also

satisfies

the

QoS

requirements of the application are selected as best paths and

data transmission is distributed through them.

3) If destination node D is not in the same cluster as source node S, then

3.1 Source node S sends route request bats (RREQ) to its cluster
head CHi. CHi looks for which cluster the destination node D
belongs to, then searches for a stable route to it.

3.2

Cluster head CHi sends the RREQ bats to its neighbouring

cluster heads. Upon receiving this RREQ bats, the cluster head
CHj for the cluster Cj checks if it has seen this RREQ before

Print to PDF without this message by purchasing novaPDF (http://www.novapdf.com/)

181

and then discard it if it is so; otherwise, it checks its cluster

members list for the availability of the destination node D

3.2.1

If D is not present in the list, CHj broadcasts the RREQ bat to

its neighbouring cluster heads.

3.2.2

If D is present in the cluster Cj, the cluster head CHj where

the destination node resides receives the route request
message and passes to the destination node D.

a) After receiving the route request message, the destination

D sends the Reverse Route request (R-RREQ) Bats to the
Source S.

b) Upon receiving multiple route reply bats from the

destination D, the source node S selects the completely
node disjoint paths and discards the remaining paths.

c) The selected node-disjoint paths are arranged based on the

maximum average residual energy and minimum time
delay.

d) The numbers of required paths with maximum residual

energy and minimum delay values which also satisfies the
QoS requirements of the application are selected as best
paths and data transmission is distributed through them.

Print to PDF without this message by purchasing novaPDF (http://www.novapdf.com/)

182

5.3.3.2

Route Maintenance

If an error message is received from any of the path, the invalid

path is discarded and removed from the path list and the data transmission is
rerouted in the remaining available paths thus avoids the re-route discovery
and in turn improves the network performance.

5.4

PERFORMANCE EVALUATION

5.4.1

Performance Comparison of AODV & CABM-AODV

The Network simulator (NS-2) is used to evaluate the performance

of the proposed algorithm [63]. In the simulation, the Distributed Coordination
Function (DCF) of IEEE 802.11 for wireless LANs is used as the MAC layer
protocol. It has the functionality to notify the network layer about link
breakage. The simulation is carried out for 50 mobile nodes which move in a
1000 meter x 1000 meter rectangular region for 300 seconds simulation time.
It is assumed that each node in the network moves independently with the
same average speed. All nodes have the same transmission range of 250
meters. The simulated traffic is Constant Bit Rate (CBR).

The random waypoint model is used to simulate nodes movement.

The motion is characterized by two factors: the maximum speed and the pause
time. The pause time is defined as the period of time a node stays stationary
before heading for a new random location. Each node starts moving from its
initial position to a random target position selected inside the simulation area.

Print to PDF without this message by purchasing novaPDF (http://www.novapdf.com/)

183

The node speed is uniformly distributed between zero and the maximum
speed. Table 5.1 lists the simulation parameters and environments used.

Table 5.1 Simulation Parameters

Simulation Terrain Dimension

1000 X 1000 meters

Transmission Range

250 m

Mobility model

Random way point

Number of Nodes

50

Node Speed

0-30 m/s

Routing protocols

AODV, CABM-AODV

MAC

IEEE 802.11 DCF

Traffic Source Model

Constant Bit Rate

Channel Data Rate

2 Mbps

Initial energy

20 Joules

Performance Metrics
The following metrics are used to evaluate the performance of the
protocols:

Packet Delivery Ratio: It represents the ratio of the number of data packets
delivered to the destination and the number of data packets sent by the source.

Print to PDF without this message by purchasing novaPDF (http://www.novapdf.com/)

184

End-to-End delay: It depicts the delay experienced by packets from source to

destination. This delay also includes processing and queuing delays in each
intermediate node.

Remaining Energy: It is measured as the total amount (in Joules) of remaining

battery energy at the end of the simulation period.

Normalized Routing Load: The number of routing control packets transmitted

per data packet delivered at the destination. The efficiency of the protocol can
be measured using normalized routing load.

Throughput: Throughput or network throughput is the average rate of

successful message delivery over a communication channel. This data may be
delivered over a physical or logical link, or pass through a certain network
node. The throughput is usually measured in bits per second (bit/s or bps), and
sometimes in data packets per second or data packets per time slot.
The system throughput or aggregate throughput is the sum of the
data rates that are delivered to all terminals in a network.
Network Life Time: The lifetime of a network is defined as the duration
of time until the first node failure due to battery depletion.

Print to PDF without this message by purchasing novaPDF (http://www.novapdf.com/)

185

5.4.1.1

Packet Delivery Ratio

a)

Varying Velocity

Table 5.2 shows the effect of Varying Velocity over Packet

Delivery Ratio (PDR) of two protocols AODV and CABM-AODV. CABMAODV shows 11% to 24% improvement in Packet Delivery Ratio.

Table 5.2 Effect of Node Velocity on Packet Delivery Ratio

Maximum
Velocity(m/s)

Packet Delivery Ratio (%)

AODV

CABM-AODV

78.03

98.31

72.36

96.62

10

76.64

95.2

15

82.07

93.45

20

76.41

92.27

25

70.16

91.22

30

70.27

90.15

Print to PDF without this message by purchasing novaPDF (http://www.novapdf.com/)

186

The results of the above table clearly depicts that the performance
of the proposed algorithm CABM-AODV in terms of Packet Delivery Ratio
Over velocity of nodes. The probability of link breaks increases with the
increase of velocity of the nodes which leads to the heavy packet loss. Since
CABM-AODV establishes and maintains multiple paths with nodedisjointness in a clustered environment and when an active path is broken due
to the node mobility, the source node selects another valid node-disjoint path
among the available path lists from its routing table to keep continue the
communication between source and destination without interruption. This
mechanism of CABM-AODV delivers the better packet delivery ratio than that
of the traditional AODV.

b)

Varying Number of Nodes

Figure 5.2 divulges the performance of the proposed algorithm

CABM-AODV in terms of Packet Delivery Ratio over Varying Number of
Nodes. The Packet Delivery Ratio is higher when compared to the traditional
AODV. CABM-AODV shows 11.8% to 23.6% improvement in Packet
Delivery Ratio.

Print to PDF without this message by purchasing novaPDF (http://www.novapdf.com/)

187

PACKET DELIVERY RATIO

PACKET DELIVERY RATIO (%)

100
90
80
70

AODV

60

CABM-AODV

50
40
5

10

15

20 25 30 35
Number of Nodes

40

45 50

Figure 5.2 Effect of Number of Nodes on Packet Delivery Ratio

5.4.1.2

End-to-End Delay

a)

Varying Velocity
Figure 5.3 shows the effect of node velocity over End-to-End Delay

of two protocols AODV and CABM-AODV. The proposed algorithm CABMAODV shows minimum delay when compared to that of AODV.

Print to PDF without this message by purchasing novaPDF (http://www.novapdf.com/)

188

END-TO-END DELAY
AVERAGE DELAY (ms)

600
500
400
300

AODV

200

CABM-AODV

100
0
0

10
15
20
MAXIMUM VELOCITY (m/s)

25

30

Figure 5.3 Effect of Node Velocity on End-to-End Delay

Figure 5.3 depicts the effect of varying node velocity on End-toEnd delay for AODV and CABM-AODV. The end-to-end delay increases as
the mobility speed increases. Higher mobility causes more broken links and
frequent re-routing and thus causes more packet loss and larger end-to-end
delay. For CABM-AODV the end-to-end delay is 60% to 74% lesser than
AODV.

b)

Varying Number of Nodes

Table5.3 portrays the performance of the proposed algorithm

CABM-AODV in terms of End to End Delay over Number of Nodes.

Print to PDF without this message by purchasing novaPDF (http://www.novapdf.com/)

189

Table 5.3 Effect of Number of Nodes on End-to-End Delay

Number of
Nodes

End-to-End Delay (ms)

AODV

CABM-AODV

113

101

10

204

112

15

213

119

20

262

121

25

318

125

30

323

131

35

328

135

40

336

139

45

343

141

50

347

148

The end to end delay of CABM-AODV is 11% to 61% less

when compared to the traditional AODV because of the clustering and
energy and delay aware techniques in routing.

5.4.1.3

Average Remaining Energy

Figure 5.4 expounds the effect of number of nodes on Average

Remaining Energy under two protocols. The average remaining energy by the
nodes at the end of simulation is much higher for CABM-AODV than AODV.
In CABM-AODV, the average remaining energy is about 51% to 63% high

Print to PDF without this message by purchasing novaPDF (http://www.novapdf.com/)

190

than the traditional AODV. This is because the nodes which have higher
energy are considered for routing.

AVERAGE REMAINNG ENERGY (J)

REMAINING ENERGY
14
12
10
8
6

AODV

CABM-AODV

2
0
5

10

15

20 25 30 35
NUMBER OF NODES

40

45 50

Figure 5.4 Effect of Number of Nodes on Average Remaining Energy

5.4.1.4

Normalized Routing Load

The figure 5.5 shows the effect of number of nodes on normalized

routing load. The normalized routing load increases when the number of nodes
increases.

Print to PDF without this message by purchasing novaPDF (http://www.novapdf.com/)

191

NORMALIZED ROUTING LOAD

NORMALIZED ROUTING LOAD

14
12
10
8
6

AODV

CABM-AODV

2
0
5

10

15

20 25 30 35
NUMBER OF NODES

40

45 50

Figure 5.5 Effect of Number of Nodes on Normalized Routing Load

The establishment and maintenance of multiple paths in the

clustering environment avoids the re-route discoveries and drastically reduces
the normalized routing load for the algorithm CABM-AODV up to 93% than
the traditional AODV.

5.4.1.5

Throughput

The figure 5.6 shows the effect of number of nodes on throughput.

The throughput increases when the number of nodes increases.

Print to PDF without this message by purchasing novaPDF (http://www.novapdf.com/)

192

THROUGHPUT

THROUGHPUT (bits/sec)

4800
4600
4400
4200
4000
AODV
CABM-AODV

3800
3600
3400
3200
5

10

15

20 25 30 35
NUMBER OF NODES

40

45 50

Figure 5.6 Effect of Number of Nodes on Throughput

The establishment and maintenance of multiple paths in the

clustering environment avoids the re-route discoveries and drastically
improves the throughput for the algorithm CABM-AODV up to 26.56% when
compared to the traditional AODV.

5.4.1.6

Network Life Time

The figure 5.7 shows that the network life time is improved in the
marginal of 9% to 15% for CABM-AODV when compared to the traditional
AODV.

Print to PDF without this message by purchasing novaPDF (http://www.novapdf.com/)

193

SIMULATION TIME (SEC)

NETWORK LIFETIME
1000
900
800
700
600
500
400
300
200
100
0

AODV
CABM-AODV

4 5 6 7 8 9 10 11 12
NUMBER OF DEAD NODES

Figure 5.7 Total Number of Dead Nodes Vs. Simulation Time

5.4.2

Performance

Comparison

of

CABM-AODV

&

CBMMRP

The performance of the proposed algorithm CABM-AODV is

compared with the clustered multipath routing protocol CBMMRP based on
the simulation environment mentioned in [47]and the results are depicted in
the following graphs.

5.4.2.1

Control Overhead
a) Control Overhead Vs Pause Time

Figure 5.8 clearly depicts that the control overhead of the protocol
CBMMRP is slightly high (7% to 14%) than CABM-AODV.

Print to PDF without this message by purchasing novaPDF (http://www.novapdf.com/)

194

CONTROL OVERHEAD Vs PAUSE TIME

CONTROL OVERHEAD

6
5
4
3

CBMMRP

CABM-AODV

1
0
0

100 200 300 400 500 600 700 800 900

PAUSE TIME

Figure 5.8 Effect of Pause time on Control Overhead

b) Control Overhead Vs Number of Nodes

From the figure 5.9, it is shown that the control overhead of the
protocol CBMMRP is slightly high (5% to 7%) than CABM-AODV.
CONTROL OVERHEAD

CONTROL OVERHEAD

6
5
4
3

CBMMRP

CABM-AODV

1
0
50 100 150 200 250 300 350 400 450 500
NUMBER OF NODES

Figure 5.9 Effect of Number of Nodes on Control Overhead

Print to PDF without this message by purchasing novaPDF (http://www.novapdf.com/)

195

5.4.2.2

End To End Delay

Figure 5.10 shows that the end to end delay of CABM-AODV over
pause time is 5% to 28% less than that of the protocol CBMMRP.
END TO END DELAY

END TO END DELAY

2500
2000
1500
CBMMRP

1000

CABM-AODV

500
0
0 100 200 300 400 500 600 700 800 900
PAUSE TIME

Figure 5.10 Effect of Pause time on End to End Delay

5.5

SUMMARY

Clustering provides scaling and eases in routing with efficient

resource management in mobile ad hoc networks (MANET)s .The usage of
artificial bees for forming and maintaining clusters and the artificial bats for
effective routing in CABM-AODV improves the packet delivery ratio,
network lifetime and reduces the overhead, energy consumption and delay
drastically than the traditional AODV. The performance of CABM-AODV is
also compared with the existing multipath protocol CBMMRP and it is proved
that CABM-AODV outperforms CBMMRP in terms of control overhead and
end-to-end delay.

Print to PDF without this message by purchasing novaPDF (http://www.novapdf.com/)