See discussions, stats, and author profiles for this publication at: https://www.researchgate.

net/publication/304230763

Load-balanced distributed intra-clustering algorithm

Conference Paper · December 2015

DOI: 10.1109/INDICON.2015.7443704

CITATIONS READS

0 5

2 authors:

Pankaj Kashyap Sushil Kumar

Jawaharlal Nehru University Jawaharlal Nehru University
7 PUBLICATIONS   3 CITATIONS    89 PUBLICATIONS   819 CITATIONS   

SEE PROFILE SEE PROFILE

Some of the authors of this publication are also working on these related projects:

Vehicular Adhoc Networks (VANET) View project

Edge Computing View project

All content following this page was uploaded by Pankaj Kashyap on 08 June 2020.

The user has requested enhancement of the downloaded file.

 Load-balanced distributed intra-clustering algorithm
Pankaj Kumar Kashyap, Sushil Kumar
School of Computer and Systems Sciences
Jawaharlal Nehru University
New Delhi-l10067, India
Email: pankaj76_scs@jnu.ac.in.skdohare@mail.jnu.ac.in
Abstract--Wireless sensor networks (WSNs) consist of multiple
number of power constrained sensors, which have the capability
to sense the physical parameters and process them into useful
information. Clustering is widely used approach information of
hierarchical network to enhance the lifetime of wireless sensor
networks. Recently, load balancing in clustering emerged as
anapproach to efficiently utilize energy in wireless sensor
networks. In this paper, we proposed an energy efficient load
balanced distributed intra clustering algorithm (LBDlCA). This
algorithm uses the cluster head selection process based on
residual energy and the number of times a node is being selected
as cluster head. We have proposed intra cluster communication
greedy approach which provides an energy efficient way for
selection of next forwarding nodes. Finally, we evaluated the
performance using MATLAB as a simulation tool to compare the
LBDlCA algorithm with respect to protocols such as LEACH
and DSBCA.Comparison of protocols is based on the metrics
such as average energy consumption in the various rounds,
percentage of dead nodes over rounds, and life cycle of network
over number of nodes.
Keywords--clustering, greedy approach, load balancing, maximum
edge weight tree, wireless sensor networks
I. INTRODUCTION
Wireless sensor networks (WSNs) contain a large amount of
tiny nodes with sensing, computation and wireless
communication capabilities [1]. As sensor nodes are small,
battery-powered (non-rechargeable) device that are used to
sense the physical environment. Once nodes are deployed in
the sensor field, it is inaccessible to user.These device runs for
several months or year depend on the application. So, optimal
use of energy is the most important factor to develop a system
based on WSNs. Therefore, the prominent question is: "how
to maximize the network lifetime to such a long time?" So,
that network is working as a fully functional unit. So energy
conservation is the prominent factor to maximize the lifetime
of the network. In WSNs, existing routing protocols have
some drawback as not share the load (transmission of the
packet to the base station) among the sensor nodes that causes
some of the nodes looses their energy earlier than other nodes
so network connectivity is lost, so Lifetime of the network
decreases. Since all nodes have limited resources, an efficient
algorithm is needed to forward the packets where much energy
and reduce the number of transmissions by a load balancing
approach that enhances the Network Lifetime.
The remainder of the paper is organized as follows. In section
2 we discuss about the related work. After that in section 3 we
present the system model for our algorithm. In section 4 we
978-1-4673-6540-6/15/$31.00 ©2015 IEEE
proposed the algorithm for our work and in the following
section 5 we have presented the performance evaluation with
the results. Finally, in section 6 conclusion and future scope
have been given.
IT. RELATED WORK
Load balancing using the clustering method is well known
approach to prolong the Network Lifetime. There are several
works related to load balancing using cluster algorithm [2-6]
with different assumptions, objectives and properties. LEACH
(Low-Energy Adaptive Clustering Hierarchy) is the one of the
earliest and most popular load balance clustering algorithm. It
is distributed in nature that it forms the cluster in manner that
every node is reachable in a single hop and that load
distribution is uniform among all nodes. LEACH assigns a
fixed probability to every node so as to elect itself as a Cluster
head (CH) [7]. But LEACH is following drawbacks. In
LEACH selection of the cluster head is probabilistic in nature
without taking the residual energy of a node, thus there may
be chance to select a node as cluster head having low- energy.
Also, LEACH is the single-hop transmission protocol, as a
results multiple number of clusters are formed causes more
communication overheadand it uses relay node for data
transfer without data aggregation which is undesirable in
wireless sensor networks.
Lindsey et al. Proposed PEGASIS (Power Efficient GAthering
in Sensor Information Systems) in 2003 [8]. In PEGASIS,
nodes are organized into a chain using a greedy algorithm so
that each node transmits to and receives from only one of its
neighbors. All nodes are spatially dispersed in sensor field. In
difference with the LEACH protocol, PEGASIS protocol uses
data aggregation among neighbors' nodes but it does not
perform clustering and hence only a single node in the chain
will transfer to the base station, which plays the role of leader
in the chain for a while. But In PEGASIS also does not
consider the residual energy of node to become leader of chain
so it also does not provide much enhancement of Network
Lifetime.
Where as HEED(Hybrid Energy Efficient distributed
Clustering Approach) resolve the problem of LEACH of
unevenly distributed cluster problem and selection of
c1usterheads based on residual energy of node as well as
communication cost both. Also it eliminates single hop
communication. HEED apply multi-hop communication (Intra
cluster routing) when base station are far away from the
cluster heads[9].By HEED probability of node become cluster
head,
CHprOb =
max (Cprob * Eres
Emttal
,Cpmin ) (1)
HEED suffer from the problem of that, not all nodes compete
for the election of cluster heads (because of some of the nodes
are not able to find the cluster head) also cluster head selection
process does not include the number of times node already
perform the role of cluster head. Also in realistic WSNs some
of the nodes are overlapped into cluster so there is no
mechanism to fix those nodes. If these nodes become cluster
head uniquely than more number of transmissions takes place
so lifetime of network degraded.Weighted clustering
algorithm (WCA) [10] based on the weight of the nodes such
as node degree and the number of single-hop neighbors. The
selection of cluster head depends upon the three factors such
as residual energy, node degree and transmission cost. It
works better than the LEACH, HEED. But it does not consider
multi-hop communication and cluster size. If cluster size is too
large the more number of transmissions takes place because
extra overhead leads to earlier death of nodes that reduces the
network lifetime. Also all the information (such as weight)
needs to be saved before initialization of network that also
causes extra overhead of computation and communication. K­
clustering algorithm is developed to minimize the single hop
problem [II]. In this protocol nodes can communicate up to k­
hop neighbor with non-overlapping clustering. But it does not
consider the size of cluster. So there may be the case large
amount of nodes are occur in single cluster that cause intra
cluster communication cost is much high. So it reduces the
duration of lifetime of the network.
As DSBCA (Distributed Self-organizing Balanced Clustering
Algorithm) described by law and HuanQi [12] is multi-hop
routing protocol as it resolve the problem of
LEACH,HEED,WCAby considering the residual energy of a
node and the number of times it is becominga cluster head to
selecting cluster head and restric the size of clustres by using
thereshold value. The algorithmic work in three phases as
cluster head selecting phase, cluster binding phase and cycle
phase, they do not describe efficient inter cluster routing
mechanism also, In cluster binding phase DSBCA consider
only the distance parameter (metric as hop count) for
communication path between the cluster head and its member,
they do not consider the residual energy of node for selecting
minimum cost communication paths from node number of
clusters to cluster head.
TTT. SYSTEM MODEL
We have considered a network area of rectangular shape
N X Mconsisting Poisson distributed nodes assigned into unit
disk graph G= (V, E) V is the set of nodes and E� V2Is the
communication link which is symmetric (exists when they are
in their transmission range) in nature. These nodes constitute
network topology by self-organizing. All the sensor nodes
having equal capabilities in terms of sensing, processing and
communication. The base station is outside of the network
area. Our Algorithm LBDlCA uses the same radio model as
described by previous clustering algorithm such LEACH.
To transmit b-bit message over a distance d, power
consumption is
(2)
Power consumption to receive the message
ERJb) =
ERx-elec(b) =
bEe1ec (3)
Where Ee1ec depend on computation (such as analog to digital
modulation, etc.) ofthe signal.EfsOr depend on distance to the
receiver and acceptable bit-error rate and [2 is free space
power loss and [4is multi-path fading power loss considered in
this model.
IV. LBDTCA ALGORITHM
As previously defined algorithm DSBCA does not consider
the intra clustering routing. Our algorithm considers the both
residual energy and hop distance as metric to create the
maximum edge weight tree to balance the load between
members of same the clustersin order to prolong the network
lifetime.Our algorithm consists of three phases: Cluster
formation phase, Intra-cluster routing phase and Inter-cluster
routing with cycle phase.
A. Cluster Formation Phase
Initially base station broadcast the HELLO message to all the
nodes within network. All the nodes calculate their distance
based on the received signal strength. After this we select
some random node as temporary cluster head for triggering the
clustering process. These triggered nodes calculate its
connective density and distance from base station to calculate
its radius (R) as described in the paper [12].The formation of
cluster depends upon radius and connectivity density. If two
clusters have same connectivity density, the cluster which is
farthest from base station having larger cluster radius, If two
cluster having same distance from base station, the cluster
which have higher connectivity density having smaller cluster
radius and The cluster having larger radius set at the top of
the network and cluster having lower radius set close to the
base stationCluster formation phases consist of cluster head
selection and binding phases.
Algorithm 1- Cluster Head Selection
1. Begin
2. Input: Consider a simple graph G= (V, E) where V
is the set of nodes and E is the set of edges where
E� V2•
 3. Let us assume triggered node Tu=RANDOM (V) When a node receives the cluster head massage (CHM), even
if it is already in a cluster, it acknowledges with loin message
(1M) to the cluster head to request joining the new cluster as
4. Distance from base station to triggered node long as its weight is lower. The transmission range of head
IRSSI-AI message limited up to R-hop distance. It may be the case that
D (Tu) =10�
some of node could not receive cluster head massage (CHM)
Where RSSI-recevied signal strength indicator then it waits up to a certain tme period that they got the cluster
A-signal strength with 1 meter distance from base head message from the other cluster. If within waiting time
station. (Tw) the node does not get any cluster head message from
none of the clusters than it declares itself as cluster head. The
waiting time is less than the cycle time ((Tw) < (TR)).

NR (Tu)is the set of R -

hop neighbors of node Tu. The size of the cluster is restricted up to a threshold value. We
assume that threshold value is set up for cluster is tweleve
Where d(u, Tu) is the distance between u andTu. For
distance measure metric is hop count. nodes.That is if the clusters have less number of sensor nodes
than threshold value it accept the node as a cluster member
6. Node degree of Tu is calculated usmg Adjacency otherwise reject the join request by the other nodes. By using
matrix. the threshold value we avoid the large amount of transmission
7. Calculate connection density
cost among member nodes also which implicity balnce the
numbe of member nodes within each clusters as a result
node degree lifetime of network increases.
DR (Tu) =

-
---='------

number of R hop neighbors

------

8. Radius [
of Tu is calculated R(Tu)=floor P
D CTu)
DR CTu)
] Algorithm 2- Cluster Binding Phase

1. Input: Cluster head node broadcast the CHM

(CHID, SID,RHD)
9. Now weight of each node (V) is calculated by 2. Begin: The neighbor node acknowledge with the

W(v)=aXp[DR(Tu)]+Cprob*
( Eres. (Tu) ) Join message 1M after receiving CHM message and
EmtLaI (Tu) maintain a path to reach cluster head using RHD.
- p[H(Tu)] 3. If (Cluster Size -s: threshold value)
Then grant the permission to join the cluster;
Else
Where a is the effect factors are defined by Reject the request;
specific applications. Eres' Eintial, H(Tu) is End if.
the residual energy, initial energy 4. If rejected node have already a cluster head
and the number of times selected as cluster Then clustering process terminates
head of triggered node respectively. Else
Find another cluster to Jom as
rejected node having low weight
10. Now select the node which having maximum
End if
weight in R-hop neighbor.
5. Every nodes store about cluster in cluster
information table such as CHID, SID, RHD.
1 1. End.
6. End

Initially, the trigger node Tustarts the clustering process and
sends Hello messages to its R-hop neighbors. The neighbors of
Tuin R-hop transmission range using equation written in
algorithm1 of statement9 to calculate their respective weight
and the node which having the highest weight will become the
cluster head. After this, the cluster head node broadcasts
Cluster Head Message (CHM) in its R-hop neighbors to
declare itself as cluster head and asks them to join the cluster.
Head message includes the ID of cluster head node (CHID),
the ID of the sending node (SID) and the number of hops from
the cluster head (RHD). When a node receives Head message,
SID can be used to maintain a path to reach the cluster head.
B. Intra-Cluster Routing
The greedy approach (Maximum edge weight tree) is used to
finding the maximum edge weight for intra-cluster routing. As
node can use power control to vary their transmission range to
reduce energy wastage, Some of the node member have not
much power to transmit data directly to cluster head so it
finding the minimum cost path by the use of greedy approach
to pass the data to next forwarded node which is lies in their
transmission range. Then next selected node forward the data
to cluster head if it has as much enough energy, otherwise it
also finds a next forwarded node.
Edge weight selection is defined as
 Eweu' v) Eres
5. Forward the data to node v.
=

deu,v)
(4)Where Eres is residual energy of cluster member 6. Repeat the process until data reached to cluster
and d (u, v)is the distance (number of hop count) between two head.
nodes.we assume that cluster heads lies on the centre of cluster 7. End
approximately.When member node (N2) are not able to
transmit their data to cluster head directly (because of less
C. Inter Cluster Routing And Cycle Phase
power) then Node N2 uses greedy approach to select next
forwarded node on greedy about maximum edge weight from
the fig 1. Each neighbours nodes calculate their edge weight
by using equation (4), after this select the path having
maximum edge weight, thus Node N2 considered the path for
data transmission via N2-N3-N4-CH, and the remaining
member nodes sends their data directly to cluster head. By
creating maximum edge weight tree data are transmitted to the
cluster head by members nodes, and then cluster head sends
aggregated data to the base station via inter-cluster routing.
Members nodes that does not have power to send data directly
to cluster head finds their path using maximum edge tree
approach assume that cluster head as root.

Fig.2. (Multi-hop transmission between cluster heads)

The cluster heads directly send data to another cluster head as

Fig.l. Arrow pointed (-7) path taken by node to transfer the
data to CH.
cluster head has more energy than other nodes so it can use the
power control mechanism to increase the transmission level up
to next layer cluster head.Goal of inter cluster routing is to
provide data transmission to base station keeping energy load
balanced. Fig2. Shows the transmission of data between
cluster heads.
We estimate next layer cluster range as cluster with maximum
radius Rmax and transmission range of cluster head maximum
up to its radius Rmaxset on the top of thenetwork and cluster
with minimum radius Rmin and transmission range up Rminto
close to the base station [4]. By the above technique multi-hop
communication is done by the cluster heads to transmit
aggregated data to base station.
As cluster has been stationary for a while until reelecting is
done within an old cluster so overall communication cost
decreases. The refreshing time or cycle time (TR) is set up
minimum duration that each node able to find its CHs within
its waiting time (Tw) such that ((Tw)< (TR)), and the clustering
process restarts circularly over time (TR)'

Algorithm 3-Intra-cIuster routing

(Greedy approach) V. STMULAnON AND RESULTS
1. Begin
The simulation work of our algorithm is done by using
2. Input: Set a vertex set S and edge set SE,
MATLAB 2009b. We compare our algorithm with the
initially S having only one node u and set SE
classical algorithm LEACH as well as modern one DSBCA.
is empty.
The simulation works organized into two parts. First, the
3. Repeat the steps until select n-I edges, where
Lifetime of Network ends considered, when 80 % of the nodes
n is the number of nodes in their transmission
are dead in our simulation. Second, energy consumption by
range.
cluster heads during inter-cluster routing. Because if the
Calculate edge weight
energy consumption is low during inter cluster routing
Eweu, v) = Eres , where u E s and v (ts.
deu,v) Lifetime of Network increases proportionally and finally,
Add vertex v to set s. and edge (u, v) to set SE. howthe lifetime varies accordingly to the algorithm. As our

4. Choose the maximum edge weight, Eweu, v)

=max (SE).
algorithm is multi-hop routing so we fixed the value of K up
to 3 for intra cluster routing. Because if k=1 then limited
coverage area results low number of neighbors or if K>3 then
the size of cluster larger leads to more energy consumption in
communication that may reduce the network lifetime. We also
size of the cluster fixed up to threshold value 13. The
simulation parameters are given intable 1 for energy
consumption compared with LEACH and DSBCA.
Table l. (Simulation parameter)
ratioof dead nodes with respect to the high number of rounds
seems better. As the number of rounds increases that prolong
the lifetime ofthe network as well. LBDICA generates
harmonious cluster that participate into decreases the
communication cost between cluster head to cluster head.
B. Average Energy Consumption Over Number Of Cycles

PARAMETER VALUE

Network Field (O,O)x(I00,I00)

Base Station Location (150,50)

Initial energy 2J

Maximum depth 3 hops

Transmission rate 10 packets/s

Network setup time 30 seconds

Fig.4. Comparison of average energy consumption with the
Data packet size 2000bits
number of rounds
From the above fig 4 as the number of rounds increases
Cycle time 60 IlS
average energy dissipation increases. The algorithm which
having energy consumption is less as the number of rounds
increases seems to be better. For the above energy comparison
A. Comparison OfRounds Over Number OfNodes 300 nodes are taken which are distributed evenly in the
network. LBDICA consumes less energythan DSBCA,
because it consumes less energy in the intra cluster (greedy
approach for selection of path) routing as well as inter-cluster
routing. There is a 30 % reduction in the average energy
consumption obtained by LBDTCA over DSBCA.

C. Lifetime OfNetwork Over Number OfRounds

Fig.3. Comparison of rounds with the percentage of dead

nodes
From the above fig. 3 we see that our algorithm LBDICA
seems better than DSBCA as LBDTCA perform almost 2600
rounds until 80% of nodes are dead whereas DSBCA perform Fig.5. Comparison of life cycle (number of rounds) with the
only approx 2400 rounds. The algorithm which has lower number of nodes
From the fig. 5 LBDlCA achieve 2700 rounds in the best case
when the number of nodes are 180 and in worst case it achieve
2200 rounds when the number of nodes are 260, which is still
better than others algorithm. This is the because of our
algorithm balance the load of communication among cluster
heads as well as nodes to conserve the energy. Our simulation
works show that the lifetime of the network increases around
20% more than DSBCA.
VI. CONCLUSION AND FUTURE SCOPE
Our design and analysistheoretically proves that our algorithm
LBDICA is more balanced in terms of energy as it uses a
greedy approach to choosing the optimal path for intra cluster
routing based on residual energy and hop count distance that
increases the lifetime of the network. The simulation work
shows that the lifetime of the network increases by 15% to
20% as compared to well-known protocols. We can enhance
the load balance in inter-clustering routing as well by moving
towards "An Ant Colony Approach" which gives the optimal
path for transmission of packets from one cluster heads to
another cluster head which optimized the energy of nodes as
well.
[8] S. Lindsey, C. Raghavendra, and K. M. Sivalingam,
"Data gathering algorithms in sensor networks using
energy metrics," IEEE Transactionson Parallel and
Distributed Systems, vol. 13, no. 9, pp. 924-935, 2002.
[9] O. Younis, S. Fahmy, HEED: A Hybrid, Energy­
Efficient, Distributed clustering approach for Ad Hoc
sensor networks, IEEE Transaction on Mobile
Computing Vo1. 3, pp. 366-379 2004.
[10]M. Chatterjee, S. K. Das, and D. Turgut, "WCA: A
weighted clustering algorithms for mobile ad hoc
networks," Cluster Computation, vol. 5, no. 2, pp. 193-
204, 2002.
[11] Y. Fernandess and D. Malkhi, "K-clustering in wireless
ad-hoc networks," in Proc. 2nd ACM Workshop
Principles Mobile Computation. Conference, Oct. 2002,
pp. 31-37.
[12]Ying Liao, Huan Qi, and Weiqun Li "Load-Balanced
Clustering Algorithm with Distributed Self-Organization
for Wireless Sensor Networks" IEEE Sensors Journal,
Vol. 13, No. 5, May 2013.

REFERENCES

[I] Jennifer Yick, Biswanath Mukherjee, Dipak Ghosal:

"Wireless sensor network survey" Computer Networks
(Elsevier)Journal, Vo1.52, pp. 2292-2330,2008.
[2] I. F. Akyildiz, W. Su, Y. Sankarasubramaniam, and E.
Cayirci, "Wireless Sensor Networks: A Survey",
Computer Networks (Elsevier) Journal, Vol. 38, No. 4,
pp. 393-422, 2002.
[3] Farruh Ishmanov, Sung Won Kim " Distributed
Clustering Algorithm with Load Balancing in Wireless
Sensor Network" IEEE World Congress on Computer
Science and Information Engineering 9,sep 2009.
[4] Rahim Kacimi, Riadh Dhaou and Andr'e-Luc Beylot
"Load-Balancing Strategies for Lifetime Maximizing in
Wireless Sensor Networks" publication in the IEEE ICC
2010.
[5] D.G.Anandl, Dr.H.G.Chandrakanth2and Dr. M. N.
Giriprasad " Challenges in maximizing the life of
Wireless Sensor Network " Int. J Advanced Networking
and Applications, Volume: 03, Issue: 0I, Pages:999-1005,
2011.
[6] Cunqing Hua and Tak-Shing Peter Yum, Senior Member,
IEEE Optimal Routing and Data Aggregation for
Maximizing Lifetime of Wireless Sensor Networks:
IEEEIACM Transactions On Networking, Vol. 16, No. 4,
August 2008
[7] W. Heinzelman, A. Chandrakasan, H. Balakrishnan,
"Energy-Efficient Communication Protocol for Wireless
Microsensor Networks". Proceedings of the 33rd
International Conference on System Sciences (HTCSS'OO),
2000.

View publication stats