Professional Documents
Culture Documents
Load-Balanced Distributed Intra-Clustering Algorithm: December 2015
Load-Balanced Distributed Intra-Clustering Algorithm: December 2015
net/publication/304230763
CITATIONS READS
0 5
2 authors:
Some of the authors of this publication are also working on these related projects:
All content following this page was uploaded by Pankaj Kashyap on 08 June 2020.
Abstract--Wireless sensor networks (WSNs) consist of multiple proposed the algorithm for our work and in the following
number of power constrained sensors, which have the capability section 5 we have presented the performance evaluation with
to sense the physical parameters and process them into useful the results. Finally, in section 6 conclusion and future scope
information. Clustering is widely used approach information of
have been given.
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
IT. RELATED WORK
networks. In this paper, we proposed an energy efficient load
balanced distributed intra clustering algorithm (LBDlCA). This Load balancing using the clustering method is well known
algorithm uses the cluster head selection process based on approach to prolong the Network Lifetime. There are several
residual energy and the number of times a node is being selected works related to load balancing using cluster algorithm [2-6]
as cluster head. We have proposed intra cluster communication
with different assumptions, objectives and properties. LEACH
greedy approach which provides an energy efficient way for
(Low-Energy Adaptive Clustering Hierarchy) is the one of the
selection of next forwarding nodes. Finally, we evaluated the
performance using MATLAB as a simulation tool to compare the
earliest and most popular load balance clustering algorithm. It
LBDlCA algorithm with respect to protocols such as LEACH is distributed in nature that it forms the cluster in manner that
and DSBCA.Comparison of protocols is based on the metrics every node is reachable in a single hop and that load
such as average energy consumption in the various rounds, distribution is uniform among all nodes. LEACH assigns a
percentage of dead nodes over rounds, and life cycle of network fixed probability to every node so as to elect itself as a Cluster
over number of nodes. head (CH) [7]. But LEACH is following drawbacks. In
LEACH selection of the cluster head is probabilistic in nature
Keywords--clustering, greedy approach, load balancing, maximum without taking the residual energy of a node, thus there may
edge weight tree, wireless sensor networks be chance to select a node as cluster head having low- energy.
Also, LEACH is the single-hop transmission protocol, as a
I. INTRODUCTION
results multiple number of clusters are formed causes more
Wireless sensor networks (WSNs) contain a large amount of communication overheadand it uses relay node for data
tiny nodes with sensing, computation and wireless transfer without data aggregation which is undesirable in
communication capabilities [1]. As sensor nodes are small, wireless sensor networks.
battery-powered (non-rechargeable) device that are used to Lindsey et al. Proposed PEGASIS (Power Efficient GAthering
sense the physical environment. Once nodes are deployed in in Sensor Information Systems) in 2003 [8]. In PEGASIS,
the sensor field, it is inaccessible to user.These device runs for nodes are organized into a chain using a greedy algorithm so
several months or year depend on the application. So, optimal that each node transmits to and receives from only one of its
use of energy is the most important factor to develop a system neighbors. All nodes are spatially dispersed in sensor field. In
based on WSNs. Therefore, the prominent question is: "how difference with the LEACH protocol, PEGASIS protocol uses
to maximize the network lifetime to such a long time?" So, data aggregation among neighbors' nodes but it does not
that network is working as a fully functional unit. So energy perform clustering and hence only a single node in the chain
conservation is the prominent factor to maximize the lifetime will transfer to the base station, which plays the role of leader
of the network. In WSNs, existing routing protocols have in the chain for a while. But In PEGASIS also does not
some drawback as not share the load (transmission of the consider the residual energy of node to become leader of chain
packet to the base station) among the sensor nodes that causes so it also does not provide much enhancement of Network
some of the nodes looses their energy earlier than other nodes Lifetime.
so network connectivity is lost, so Lifetime of the network Where as HEED(Hybrid Energy Efficient distributed
decreases. Since all nodes have limited resources, an efficient Clustering Approach) resolve the problem of LEACH of
algorithm is needed to forward the packets where much energy unevenly distributed cluster problem and selection of
and reduce the number of transmissions by a load balancing c1usterheads based on residual energy of node as well as
approach that enhances the Network Lifetime. communication cost both. Also it eliminates single hop
The remainder of the paper is organized as follows. In section communication. HEED apply multi-hop communication (Intra
2 we discuss about the related work. After that in section 3 we cluster routing) when base station are far away from the
present the system model for our algorithm. In section 4 we
-
---='------
8. Radius [
of Tu is calculated R(Tu)=floor P
D CTu)
DR CTu)
] Algorithm 2- Cluster Binding Phase
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
B. Intra-Cluster Routing
Initially, the trigger node Tustarts the clustering process and
sends Hello messages to its R-hop neighbors. The neighbors of The greedy approach (Maximum edge weight tree) is used to
Tuin R-hop transmission range using equation written in finding the maximum edge weight for intra-cluster routing. As
algorithm1 of statement9 to calculate their respective weight node can use power control to vary their transmission range to
and the node which having the highest weight will become the reduce energy wastage, Some of the node member have not
cluster head. After this, the cluster head node broadcasts much power to transmit data directly to cluster head so it
Cluster Head Message (CHM) in its R-hop neighbors to finding the minimum cost path by the use of greedy approach
declare itself as cluster head and asks them to join the cluster. to pass the data to next forwarded node which is lies in their
Head message includes the ID of cluster head node (CHID), transmission range. Then next selected node forward the data
the ID of the sending node (SID) and the number of hops from to cluster head if it has as much enough energy, otherwise it
the cluster head (RHD). When a node receives Head message, also finds a next forwarded node.
SID can be used to maintain a path to reach the cluster head. 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.
PARAMETER VALUE
Initial energy 2J
REFERENCES