Available online at www.sciencedirect.

com
Available online at www.sciencedirect.com
ScienceDirect
ScienceDirect
Procediaonline
Available Computer
at Science 00 (2018) 000–000
www.sciencedirect.com
Procedia Computer Science 00 (2018) 000–000 www.elsevier.com/locate/procedia
www.elsevier.com/locate/procedia
ScienceDirect
Procedia Computer Science 151 (2019) 1140–1145

International Workshop on Web Search and Data Mining (WSDM)

InternationalApril
Workshop on Web
29 – May Search
2, 2019, and Data
Leuven, Mining (WSDM)
Belgium
April 29 – May 2, 2019, Leuven, Belgium
Load Balancing Protocol (EESAA) to improve Quality of Service in
Load Balancing Protocol (EESAA) to improve Quality of Service in
Wireless sensor network
Wireless sensor network
Ansam ENNACIRIaa*, Mohammed ERRITALIbb, Jamaa BENGOURRAMaa
Ansam ENNACIRI *, Mohammed ERRITALI , Jamaa BENGOURRAM
a
Department of Industrial Engineering, Faculty of Sciences and Techniques, Sultan Moulay Slimane University, BENI MELLAL, MOROCCO
a b
TIAD
Department loboratory,
of Industrial Department
Engineering, of Computer
Faculty Sciences,
of Sciences Sultan Moulay
and Techniques, Slimane
Sultan University,BENI
Moulay MELLAL,
Slimane University, BENI MOROCCO
MELLAL, MOROCCO
b
TIAD loboratory, Department of Computer Sciences, Sultan Moulay Slimane University,BENI MELLAL, MOROCCO

Abstract
Abstract
Wireless sensor networks (WSN) are considered as a special type of ad hoc networks, that represent an emerging technology that
is having sensor
Wireless an increasing
networks success
(WSN)inare theconsidered
scientific, as
logistical,
a specialand
typemilitary areas.
of ad hoc It not only
networks, that realizes
representbenefits for thetechnology
an emerging customer in
thata
technologically
is sophisticated
having an increasing way,
success in but
the in additionlogistical,
scientific, provides this
andwith highareas.
military flexibility.
It not only realizes benefits for the customer in a
However, the size
technologically of the sensors
sophisticated way,isbut
an important
in additionlimitation, mainly
provides this withinhigh
terms of energy autonomy and lifetime because the battery
flexibility.
must be very
However, the small.
size ofFor
thethis reason,
sensors many
is an studieslimitation,
important are currently focusing
mainly on managing
in terms the energy and
of energy autonomy consumed
lifetimebybecause
the sensors in the
the battery
network.
must Withsmall.
be very this inFor
mind,
this we havemany
reason, proposed an are
studies algorithm thatfocusing
currently improves onthe quality the
managing of service
energy based on a by
consumed clustering approach.
the sensors in the
In order With
network. to confirm the improvements
this in mind, we have proposed provided by our that
an algorithm algorithm,
improvesa simulation is service
the quality of done using
basedMATLAB, in which
on a clustering the
approach.
performance
In order to of our algorithm
confirm is evaluated provided
the improvements and compared withalgorithm,
by our available clustering
a simulationprotocols (LEACH
is done using and SEP). in which the
MATLAB,
performance of our algorithm is evaluated and compared with available clustering protocols (LEACH and SEP).
© 2019 The Authors. Published by Elsevier B.V.
©
© 2019
2019 The
The Authors.
Authors. Published by by Elsevier B.V.
This is an open accessPublished
article under Elsevier
the CC B.V.
BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)
This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)
This is an open
Peer-review underaccess article under
responsibility of theConference
the CC BY-NC-ND license
Program (http://creativecommons.org/licenses/by-nc-nd/4.0/)
Chairs.
Peer-review under responsibility of the Conference Program Chairs.
Peer-review under responsibility of the Conference Program Chairs.
Keywords: "Wireless sensor network (WSN); EESAA; Quality of service; LEACH; SEP; clustering algorithm"
Keywords: "Wireless sensor network (WSN); EESAA; Quality of service; LEACH; SEP; clustering algorithm"

1. INTRODUCTION
1. INTRODUCTION
Since their inception, wireless telecommunications networks have been increasingly successful in the industrial
andSince their communities.
scientific inception, wireless
Thankstelecommunications networks
to its many advantages, have been
wireless increasingly
technology successful
has become in the industrial
an essential tool in
and scientific communities. Thanks
today's network architectures. to its many advantages, wireless technology has become an essential tool in
today's network architectures.

* Corresponding author. Tel.: +0-000-000-0000 ; fax: +0-000-000-0000

E-mail address:author.
* Corresponding author@institute.xxx
Tel.: +0-000-000-0000 ; fax: +0-000-000-0000
E-mail address: author@institute.xxx
1877-0509 © 2019 The Authors. Published by Elsevier B.V.
This is an open
1877-0509 access
© 2019 Thearticle under
Authors. the CC BY-NC-ND
Published license (http://creativecommons.org/licenses/by-nc-nd/4.0/)
by Elsevier B.V.
Peer-review under
This is an open responsibility
access of the Conference
article under CC BY-NC-NDProgram Chairs.
license (http://creativecommons.org/licenses/by-nc-nd/4.0/)
Peer-review under responsibility of the Conference Program Chairs.

1877-0509 © 2019 The Authors. Published by Elsevier B.V.

This is an open access article under the CC BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)
Peer-review under responsibility of the Conference Program Chairs.
10.1016/j.procs.2019.04.162
 Ansam ENNACIRI et al. / Procedia Computer Science 151 (2019) 1140–1145 1141
2 A. ENNACIRI et al. / Procedia Computer Science 00 (2018) 000–000

Wireless sensor network technology (WSN) is an alternative to wired sensors, offering the unique advantages of
wireless media[1,2]. The latter can be summarized in three main points: the ease of deployment, the ubiquity of
information and the reduced cost of installation. Despite its similarity to other wireless networks, particularly Ad-hoc
networks[3], WSNs are distinguished by a set of specific restrictions. For example, the inherent constraints of sensor
nodes, such as lack of energy resources, limited memory capacity and low computing power[4,5,6]. Hence the
complexity of these systems. To overcome this issue, we propose a load balancing protocol using the sleep/wake
technique, which consists of combining data from different sensors and reducing redundant data, in order to improve
the lifetime of these sensors. Clustering algorithms such as LEACH, PEGASIS, HEED and SEP[7,8,9,10] for sensor
networks have achieved satisfactory results in terms of network performance. For this reason, we have proposed a
pairing concept based on distances between sensors that significantly improves the network's efficiency. Therefore,
the main objective is to improve the cluster head selection process. Under EESAA[11], CHs is selected on the basis
of the remaining power, the nodes switch alternately to sleep and active modes in order to minimize power
consumption.
In this article we evaluate and improve the performance of clustering algorithms in terms of stability period,
network lifetime and throughput for WSN networks. The data from the sensor nodes are transmitted to the cluster
heads (CHs) which are responsible for transmitting them to the base station (BS) located far from the field. The rest
of the article is organized as follows: Section II describes the related work, while Section III describes EESAA
protocol [5] and Section IV represents simulations of our protocol in comparison to two other protocols. At the end,
we concluded the document.

2. RELATED WORKS

The objective of load balancing is to make the best use of the possibilities of using resources. Many techniques
have been developed to make optimal use of the energy from sensor nodes. The clustering concept gives significant
results in optimizing energy costs for networks. Clustering has many advantages, such as saving communication
bandwidth, extending network life, reducing data packet redundancy and reducing energy consumption rates, etc.
Numerous clustering algorithms, for example, LEACH, PEGASIS, HEED, SEP[7,8,9,10], aim at the efficient use of
energy in sensor networks: Firstly, LEACH[7,4] developed by Heinzelman is a well-known as hierarchical routing
protocol applied in WSNs. LEACH divides the network into zones and clusters in a distributed way, the CH
(Cluster-Head) nodes are formed and then used as relays to reach the well. However, PEGASIS[8] (Power-Efficient
GAthering in Sensor Information Systems): is an improved version of the LEACH protocol. This protocol forms a
chain between the nodes so that they only receive and communicate data from neighboring nodes. Furthermore,
HEED[9] (Hybrid, Energy-Efficient, Distributed approach): is a routing protocol designed for WSNs. It is based on a
distributed clustering algorithm. HEED does not depend on the topology of the network or its size but it assumes that
the sensors are intelligent i.e. have the possibility to modify their transmission power. Moreover, SEP[10] (A Stable
Election Protocol for clustered heterogeneous wireless sensor networks) is a heterogeneous protocol to extend the
time interval before the death of the first node (referred to as the stability period. The SEP is based on weighted
electoral probabilities of each node to become a cluster head according to the remaining energy in each node. The
CHs of the LEACH protocol[7] are selected periodically and the energy flows uniformly through the role rotation. In
PEGASIS[8], the energy load is distributed uniformly or from the BS. Besides, in HEED[9] builds cluster-heads
according to a hybrid criterion combining the degree of nodes and their remaining energies. Finally, SEP[10] is
designed to handle heterogeneous networks that have introduced the concept of advanced and normal nodes for the
election cluster head.

3. Energy Efficient Sleep Awake Aware (EESAA) protocol:

In this part of the article, we present a load balancing protocol called EESAA, Which improves the CHs selection
technique, by choosing CHs according to the remaining energy of the nodes.
1142 Ansam ENNACIRI et al. / Procedia Computer Science 151 (2019) 1140–1145
"A. ENNACIRI et al." / Procedia Computer Science 00 (2018) 000–000 3

1.1. Coupling in the network

First, Nodes transmit their location information, which is the application type and node identifier, to the base
station (BS), after locating their positions by GPS, the base station calculates the mutual distance between the nodes.
Nodes of the same type of application and which have a minimum distance between them, are coupled by BS. Then,
the base station sends the matching information to all nodes in the network.
Nodes switch from "Sleep" mode to "Awake" or "Active" mode during a single communication interval. Power
consumption is then minimized because nodes in sleep mode do not communicate with the CHs, and do not occupy
the channel during sleep mode. Isolated nodes, on the other hand, remain in active mode every turn until their energy
resources are exhausted.

1.2. Network configuration

In this phase, the optimal number of CH is selected using a distributed algorithm. Initially, all nodes have the
same energy and the network is homogeneous in terms of energy. The selection of CHs [11] after the first round is
based on the remaining energy of each node. Nodes in active mode participate in the CH selection process. In the
first round, when all nodes have the same initial energy E o, the nodes in active mode elect themselves as CH based
on the probability of selecting CH using a distributed algorithm. Each node chooses a random number between 0 and
1 and compares it with a threshold Th, which is calculated as follows:

Th= Pd/ 1-Pd_(first round mod 1) if n Є A

0 otherwise (1)

Where A is the set of nodes in active mode on the first turn. If the random number selected by the node is less
than the threshold Th, the node will choose itself as a CH and will be called Parent-Cluster-Heads (CH-father).

1.3. Data Transmission:

All nodes in active mode transmit their detected data to CH during their TDMA assigned slots. Nodes in sleep
mode are not affected by the transmission phase. The CH aggregates receive data from each node and transmit it to
BS. Data aggregation is a signaling technique for compressing data. By using this technique, a considerable amount
of energy can be saved. So as to transmit data, a non-CH node dissipates the ETX in the transmitter circuits and Eamp
in transmission amplification to obtain an acceptable signal-to-noise ratio (SNR). Thus, for the transmission of an
LC bit message, a non-CH node is written:
E non-CH=(N/K -1)×ETX × LC × E amp × LC× d2 to CH (3)
To receive data from a non-CH node on the CH radio in each cluster, the energy is defined as follows:
E rec = (Erx ×Lc) (N/K -1) (4)
Where Erx is the energy dissipated by the receiver circuits for data reception. The energy dissipated by CH to
aggregate data received from its associated nodes.
EAGR = (EAD × Lc)(N/K) (5)
The transmission energy AND dissipated by CH to transmit aggregated data to the BS is:
ET = ETX × LA × E amp × LA × d2 to BS (6)
Where LA is an aggregate data and d² to BS is the distance between CH and BS. The total energy dissipated by
CH during a turn is:
ECH = E rec + EAGR + ET (7)
The total energy dissipated by CH is the energy dissipated when receiving data from its associated nodes,
aggregating the received data and transmitting this data to the BS.
The flow chart of EESAA algorithm is presented in Fig. 1.
 Ansam ENNACIRI et al. / Procedia Computer Science 151 (2019) 1140–1145 1143
4 A. ENNACIRI et al. / Procedia Computer Science 00 (2018) 000–000

Fig. 1. Flow chart of EESAA protocol.

4. Results & Simulation:

The performance of the EESAA protocol is measured by making comparative simulations with two other
protocols. Our protocol is implemented in Matlab, that gives the advantage of modeling process for a real system.
To analyze and compare the performance of the EESAA protocol[11] with the LEACH[7,4] and SEP[9] protocols,
we consider the following metrics:
-Stability period: This will measure the duration of network operation from the beginning until the death of the
first node.
-Network lifetime: is between the beginning and end of the last node.
- Instability period: duration of network operation from the first node to the death of the node.
- Number of cluster heads: Indicates the number of clusters generated per turn.
1144 Ansam ENNACIRI et al. / Procedia Computer Science 151 (2019) 1140–1145
"A. ENNACIRI et al." / Procedia Computer Science 00 (2018) 000–000 5

- Package to BS: This is the rate of successful delivery of data to BS from CHs.
In these simulations, we generate a sensor field of size 100m × 100m. In this field, we scatter a number (100)
sensor nodes with the initial energy Eo. The parameters of our simulation are given in the following table.

Table 1: Simulation Parameters Setting

Paramètres Valeur
Node Deployment Area 100m*100m
Initial Energy (E0) 5j
Pd. 1j
Data Aggregation Energy cost (EDA) 50pj / bit j
Number of nodes 100
Packet size 4000 bits
Transmitter Electronics (EelectTx) 50 nj/bit
Receiver Electronics (EelecRx) 50 nj/bit
Transmit amplifier (Eamp) 100 pj/bit/m2

We analyze network lifetime of LEACH, SEP, and our EESAA protocols; hence, the following figures show the
numbers of living and dead nodes:

Fig. 2. Number of living nodes for a network of 100m×100 m Fig. 3. Number of dead nodes for a network of 100m×100 m

Fig. 4. Number of cluster-head. Fig. 5. Packet to BS Nodes for 100m × 100m Network with 100 nodes
 Ansam ENNACIRI et al. / Procedia Computer Science 151 (2019) 1140–1145 1145
6 A. ENNACIRI et al. / Procedia Computer Science 00 (2018) 000–000

Fig. 2 shows the number of alive nodes per round. According to this figure, death time of first node in EESAA
protocol is later than SEP and LEACH protocol. In EESAA protocol first node dies around 1800 round, which
means that the stability period of the EESAA is longer than that of LEACH, and SEP respectively. Fig. 3 plots the
number of dead nodes per rounds. We notice that the number of dead nodes is smaller for EESAA than for LEACH
and SEP. It can be also mentioned that EESAA protocol has a longer network lifetime than LEACH and SEP
respectively. This is because of the "sleep-wake" technique of the nodes and the selection of the cluster head.

The total number of cluster-head per round is depicted in Fig. 4. In particular, the first node dies around 1771
and the last node dies after 4131 turns. This shows that in EESAA protocol, the region of instability starts later than
other protocols. From the Fig. 5, it can be seen that LEACH has more uncertainties in the selection of CHs. A
random number of CHs is selected in each round, however the ESSA protocol has a controlled selection of CHs.
The efficient CH selection algorithm of the EESAA ptotocole allows data to be transmitted in a better and consistent
way to the BS. Due to the nodes' sleep-wake strategy, EESAA transmits less data to the BS during the first rounds.
However, after 4300 rounds, EESAA has the highest data rate.

5. CONCLUSION

In this article, we have presented the load balancing protocols as well as LEACH, EESAA and SEP, which will
allow optimizing the lifetime of the network, the efficient management and the energy consumption.
To make a comparative study in terms of network lifetime, network stability, and cluster head selection process,
with the other algorithms, we have simulated the EESAA algorithm with the MATLAB simulator.
The simulation results clearly show that the EESAA protocol provides better performance than other protocols.

References

[1] A.Imene, K.Okba, K.Laid, S.Sylvie, ―A new Itinerary Planning Approach Among Multiple Mobile Agents in Wireless Sensor Networks
(WSN) to Reduce Energy Consumption‖, International Journal of Communication Networks and Information Security (IJCNIS), Vol. 7, No. 2,
pp.116-122 August 2015.
[2] N. Meghanathan, ―Grid Block Energy Based Data Gathering Algorithms for Wireless Sensor Networks‖, International Journal of
Communication Networks and Information Security (IJCNIS), Vol. 2, No. 3, 2010.
[3] ENNACIRI Ansam, ERRITALI, Mohammed, MABROUKI, Mustapha, et al. Performance analysis of Streaming Video over Vehicular ad-
hoc. In Computer Graphics, Imaging and Visualization (CGiV), 2016 13th International Conference on. IEEE, 2016. p. 375-380.
[4] L. Qian and H. Zhu, “An energy balanced clustering algorithm based on LEACH protocol,” in Proc. the 2nd International Conference on
Systems Engineering and Modeling, Paris, France, pp. 72-73, 2013.
[5] A. Depedri, A. Zanella et al., “An energy efficient protocol for wireless sensor networks,” in Proc. AINS, pp. 1-6, 2003.
[6]A. M. lal Parmar and A. Thakkar, “An improved modified LEACH-C algorithm for energy efficient routing in wireless sensor networks,”
Nirma University Journal of Engineering and Technology, vol. 4, no. 2, pp. 1-5, 2016.
[7] W. Heinzelman, A. Chandrakasan, and H. Balakrishnan, ”Energy-efficient routing protocols for wireless microsensor networks,” in Proc.
33rdHawaii Int. Conf. SystemSciences (HICSS), Maui, HI,Jan. 2000.
[8] S. Lindsey and C. S. Raghavendra. PEGASIS : ower-effecient gathering in sensor information systems. In Proceedings of the IEEE Aerospace
Conference, March 2002.
[9] Ossama Younis, Student Member, IEEE, and Sonia Fahmy, Member, IEEE,”HEED : A Hybrid, Energy-Efficient, Distributed Clustering
Approach for Ad Hoc Sensor Networks”,2004.
[10] G. Smaragdakis, I. Matta, A. Bestavros, SEP : A Stable Election Protocol for clustered heterogeneous wireless sensor networks, in : Second
International Workshop on Sensor and Actor Network Protocols and Applications (SANPA 2004), 2004.
[11] Energy Efficient Sleep Awake Aware (EESAA) Intelligent Sensor Network Routing Protocol T. Shah, N. Javaid, T. N. Qureshi COMSATS
Institute of Information Technology, 44000, Islamabad, Pakistan.