ENERGY EFFICIENT LOAD BALANCING TECHNIQUES FOR

CLUSTER BASED ROUTING IN WSN

S V KRISHNA REDDY
Asst Prof., ECE Dept, Don Bosco Inst of Tech., Banglore-74
Krishnareddy.dbit@gmail.com

ANIL KUMAR
Asst Prof., CSE Dept, VEMANA Inst of Tech. , Banglore-34
anil.bmsce2@gmail.com

MAHESWARA REDDY
Engineer, Ericsson Global India Pvt Ltd, Bangalore
maheshreddy435@gmail.com

ABSTRACT: Wireless Sensor Networks (WSNs) consist of hundreds of tiny nodes having the
capability of sensing, computation, and wireless communications. While sensors are small devices
with limited power supply, a WSN should operate autonomously for long periods of time in most
applications. Many routing, power management, and data dissemination protocols have been
specifically designed for WSNs where energy consumption is an essential design issues. Since
wireless sensor network protocols are application specific, so the focus has been given to the
routing protocols that might differ depending on the application and network architecture. Some of
the conventional single path routing schemes may not be optimal to maximize the network lifetime
and connectivity. In this paper propose a distributed, scalable and localized multipath search
protocol to discover best Forward Node along the paths between the source nodes and sink node.
In this paper, Our proposed cluster based routing scheme has utilize threshold level based on
residual energy of the network along with multi-assistant cluster heads to cope with the energy
issues. Finally compare the proposed scheme with the T-LEACH. Simulation results show that the
proposed scheme has higher node energy efficiency, less energy variance and more network
lifetime.

KEYWORDS: WSN, Clustering, Routing, Load Balancing, T-LEACH

INTRODUCTION

Sensor nodes typically use irreplaceable power with the limited capacity, the nodes capacity of
computing, communicating, and storage is very limited, which requires WSN protocols need to
conserve less energy as the main objective of maximizing the network lifetime. In order to better
manage energy consumption, increase the whole network lifetime, and reduce the transmission and
reception energy of node we introduce a new concept of clustering[1]. Clustering in WSN can be
defined as the virtual partitioning of the dynamic nodes into various groups. Groups of the nodes
are made with respect to their nearness to other nodes [2]. Two nodes are said to be neighbor of
each other when both of them lie within their transmission range and set up a bidirectional link
between them. An energy-efficient communication protocol LEACH (Low Energy Adaptive
Clustering Hierarchy)[3], which employs a hierarchical clustering done based on information
received by the BS.
The rest of the paper is organized as follows. The related work is presented in section II,
Implementation of EELC has presented in section III, section IV describes the simulated results of
the proposed work and the section V concludes the paper.

RELATED WORK

From a routing perspective, clustering allows to split data transmission into intra-cluster (within a
cluster) and inter-cluster (between cluster heads and every cluster head and the sink)
communication. In fact, member nodes are only allowed to communicate with their respective
cluster head, which is responsible for relaying the data to the sink with possible aggregation and
fusion operations. Moreover, this separation allows reduce Routing tables at both member nodes
and cluster heads in addition to possible spatial reuse of Communication Bandwidth.

Intra-cluster communications:
All the members of clusters are communicate with that cluster head and other cluster members
only. It wont communicate with other cluster members and cluster head. Communication in an
Intra cluster mechanism is done by two hops from member node to base station .During first hop
member node communicate with cluster head and then during second hop from cluster head to
base station. This phenomena show in fig1 below.

Inter-cluster Routing
In an Inter-cluster routing members of cluster are communicate with cluster head by using either
single hop or multiple hop communication then cluster head is communicate with base station via
another cluster head. During Inter-cluster routing two or more cluster heads involve. Single hop
Inter-cluster communication is easy to communicate sink or base station. Although simple, this
approach is not only inefficient in terms of energy consumption, it is based on ir-realistic
assumption. The sink is usually located far away from the sensing area and is often not directly
reachable to all nodes due to signal propagation problems. A more realistic approach is multi hop
inter-cluster routing that had shown in fig 2 is to be more energy efficient.

Fig 1 : Intra Cluster Communication Fig 2 : Inter Cluster Routing

361
IMPLEMENTATION OF EELC

The proposed EELC (Energy Efficient Load balancing technique for Cluster based Routing) is an
Adaptive load balancing algorithm which is based on residual energy of the network. The
proposed scheme has been implemented through the below procedure.

Deployment Phase
Sensor nodes are deployed randomly in deterministic manner over a physical area. In proposed
algorithm 100 nodes are deployed in randomly over an area of 100x100 square units

Clustering Phase
After successful deployment of all sensor nodes over a physical area the next step is divide the
total area into group of clusters to make communication is easier and energy efficient. In the
proposed scheme by using K- means algorithm total area partition into three clusters.

The proposed EELC have new clustering strategy to balance load distribution. In this scheme each
cluster consists of one CH and two Assistant Cluster Head. During the first stage elect the first
node as cluster head in each cluster and second and third nodes are nominate as Assistant Cluster
Head1 (ACH1), Assistant Cluster Head2 (ACH2) respectively. EELC protocol is event based
protocol, if event is occur neighboring nodes are sensed that event and forward the data packet to
the Base Station.

Data Transmission
Once the clusters are created, data transmission can begin. If event occurs, nodes are ready to send
the data [4]. This transmission uses a minimal amount of energy (chosen based on minimum
distance). The radio of each non-cluster head node can be treated as an ideal state. During an ideal
state energy consumption is very less almost zero.

The cluster-head node must keep its receiver on to receive all the data from the nodes in the
cluster. When all the data has been received, the cluster head node performs signal processing
functions to compress the data into a single signal [4]. In this scheme assume a simple model
where the radio dissipates Eelec = 50 nJ/bit to run the transmitter or receiver circuitry and
mp=0.0013 pJ/bit/m4, fs= 10 pJ/bit/m2.
The transmission energy formula shown below equation

+ 2 < 0
TX(k, d) = + 4 0

In this work free space (d2 power loss) and the multi path fading (d4 power loss) channel models
were used. If the distance is less than a threshold, the free space (fs) model is used; otherwise, the
multi path (mp) model is used.
ERX=k Eele
where k = no of bits transmitted.
d= distance.
Etx(k,d)= Transmission energy based distance for k bits
Erx(k)=Receiving energy for k bits.
Optimization of routing

362
In proposed protocol route from source to destination is optimized by using Dijkstra's algorithm
based on minimum cost (minimum distance).
Algorithm: Let N is number of sensor nodes in sensing area, S is a source node where an event is
occurred, j is the destination node and i is a Vicinity Head.
Initialization: (Start with source node s)
N = {s}, Ds = 0, Ds is distance b/w source and itself
Dj=Csj for all j s, Dj= distances b/w source to destination directly
Step A: (Find Vicinity Head i)
Find i N such that
Di = min Dj for j N
Add i to N
If N contains all the nodes, stop
Step B: (Update minimum distance)
For each node j N
Dj = min (Dj, Di+Cij)
Go to Step A
From the above algorithm route is optimized from source to destination. During the first step
calculate distance from source node to destination node directly and denote it as Dj and then
calculate distance from the Vicinity Head(VH) denote it as Di then distance from VH to
destination denote it as Cij .Find out min (Di +Cij , Dj )assign to Dj .

Identification of Forward Node

Routing protocols in WSNs might differ depending on the application and network architecture. In
our application network model is Event driven. Sensors are generally equipped with data
processing and communication capabilities. If event is occur the sensing circuitry measures
parameters from the environment surrounding the sensor and transforms them into an electric
signal. Processing such a signal reveals some properties about objects located and/or events
happening in the vicinity of the sensor. This sensed data need to transmit from sensed node to base
station. Sensed node is choose the Vicinity Head (VH) based on minimum distance shown in
below flow chart and establishes communication between sensed nodes to VH. By using this
communication link forward the sensed data to the Vicinity Head. Now VH search for best
Transition Node (TN) based on minimum distance and transmit data to TN, similarly this process
is repeated until Base Station is reached.

Load Balancing
In WSN cluster head plays many roles compare to ordinary nodes, so energy consumption of
cluster head is more compare to other nodes[5]. The possibility of dyeing of cluster head is more
than member nodes. The proposed scheme has one CH and two ACHs in each cluster. The CH and
ACHs are participated in communication frequently and also roles of these nodes are more
compare to other nodes, so an energy consumption of CH and ACH more. To stop the early dyeing
of CH and ACHs it is necessary to exchange the role of heads. In an EELC Protocol role of CH
and ACHs is changed based on threshold value. This threshold value changes for every iteration
based on residual energy of total network. Threshold value is calculated from the mean value of
residual energy of the total network. If the energy of CH is less than threshold value, the role of
CH changes to highest energy node at that round. In case ACHs also the role should be changed
based on the threshold value. The energy of the node is less than zero than that node is treated as a
dead node. The dead node wont allow participating in communication. The transfer of CH and
ACHs roles gives network stability, so ultimately network life time is enhanced.

363
SIMULATION AND RESULTS

The network simulated consists of 100 nodes deployed randomly in 100x100 square units of
sensing area. Each node is having an initial energy of 2J uniformly with node communication
range of 20 m the base station is lies outside of the sensing area. The proposed EELC algorithm is
simulated and compare with the T-LEACH[5]. Simulation environment is MATLAB.

Simulation of EELC
The proposed EELC technique simulated in MATLAB, Procedure for simulation steps discussed
in chapter5.The simulation parameters are shown in below table. Network simulation parameters
are given in below table1.

Table1. Simulation Parameters

No Description No. of Item
Description

1 Simulation Area 100 x 100

2 No of Nodes 100

3 Sensor distribution Random

4 Initial Energy of Node 2J

5 Communication range 20m

6 Channel type Wireless channel

7 No of iterations 2000

In wireless sensor network each and every node having some amount of communication range.
Within this communication range node can have the capability to communicate the base station
directly. In this proposed scheme communication range is 20m. If communication range is less
than 20m, nodes can directly send their data to the base station.

If sensed node is far away from the base station, multi-hop communication necessary for less
energy consumption of path from source to base station. Fig 3 shows that multi-hop with inter
cluster communication. In first cluster event is occur, sensed node finds VH is ACH1 based on
minimum distance and then find the best FN is ACH2 of second cluster.

The residual energy comparative study of T-LEACH and proposed EELC protocols described in
Fig 4.The below Figure Shows that the proposed protocol EELC having more residual energy
compare with T-LEACH at all iterations. In EELC protocol residual energy is gradually
decreasing compare with T-LEACH, because in proposed EELC scheme route is optimized from
source to destination through identifying the best forward node and also loads distribution using
Assistant Cluster Heads. In the proposed scheme three head nodes in each cluster among them one

364
 Fig 3: Route Optimization using two ACHs for inter-clustering

is CH and remaining two are ACHs, during transmission phase source node identified the nearest
Vicinity Head based on minimum distance and send the sensed data to VH. The VH then identify
the suitable FN for shortest path to the destination. So the route optimization done in the proposed
EELC technique, so proposed scheme maintains better residual energy than T-LEACH.

Fig 4.Residual energy Vs Iterations Fig 5.Dead Nodes vs Iterations

365
 Fig 6 Variance vs iterations Fig 7. Alive Nodes vs Iterations

CONCLUSION

In proposed scheme a new concept of Assistant Cluster Head (ACH) is introduced. In EELC
scheme each cluster having one CH and two ACHs which are used to load distribution among the
routing nodes. The implemented EELC technique enhances the network life time by changing the
roles of CH and ACHs positions based on threshold value which dependent on residual energy
network to balance the load between all the nodes in the network. Simulation results shows that the
proposed scheme better energy variance between the rounds and less number of dead node
compare to T-LEACH which shows that network life time has been increased.

REFERENCES

M. Ye, C. Li, G. Chen, J. Wu, EECS: An Energy Efficient Cluster Scheme in Wireless Sensor
Networks, in IEEE International Workshop on Strategies for Energy Efficiency in Ad Hoc and
Sensor Networks (IEEE IWSEEASN2005), Phoenix, Arizona, April 79, 2005.
Sajid Husain, Abdul W. Martin, Hierarchical Cluster based Routing in Wireless Sensor
Networks, Journal of Networks, Academy Publisher, Vol. 2, No. 5, pp. 87-97, 2007.
W.R. Heinzelman, A.P. Chandrakasan, H. Balakrishnan, An application specific protocol
architecture for wireless microsensor networks, IEEE Transactions on Wireless
Communications, Vol. 1, No.4, pp. 660670, 2002.
Baranidharan, B.Santhi An Evolutionary Approach to Improve the Life Time of the Wireless
Sensor Networks Journal of Theoretical and Applied Information Technology, November
2011. Vol. 33, No.2,pp: 177-183.
G. Gupta and M. Younis, Load-balanced clustering of wireless sensor networks, in IEEE
International Conference on Communications, vol. 3, pp. 18481852,April- 2003.
Jiman Hong , Joongjin Kook , Sangjun Lee ,Dongseop Kwon , Sangho Yi T-LEACH: The
method of threshold-based cluster head replacement for wireless sensor networks Information
Systems Frontiers, Volume 11 Issue 5,Pages 513 521, , November 2009.

366