2018 30th International Conference on Microelectronics (ICM)
Clustering Algorithm in wireless sensor networks
based on shortest path
Salim EL KHEDIRI A d el THALJAOUI
College o f Computer Department o f Computer
IT department Sciences o f Faculty o f
Q assim University, Kingdom sciences o f Gafsa
Saudia Arabia U niversity o f Gafsa
Salim .el.khediri@ gm ail.com adel.thaljaoui@ gm ail.com
Abstract—The clustering technique is a kind of key method
used to balance energy consumption in wireless sensor networks.
It can increase the lifetime of the network and scalability.
Energy-efficient clustering algorithms should be designed for the
characteristic of homogeneous WSN. We propose and evaluate a
new centralized energy-efficient clustering protocol for
homogenous WSNs, which is called Distance energy evaluated
DEE. In DEE, the cluster-heads (CHs), are elected by a
probability based on the ratio between distance and residual
energy of each node. The probability of being CH according to
their initial and residual energy. Finally, the simulation results
seemed that DEE achieves more effective messages and longer
lifetime than current important clustering protocols in
homogeneous environments.
Keywords—energy-efficient; clustering; Wireless sensor
networks;
I. In t r o d u c t io n
Wireless Sensors networks contain small size, self-
configured, distributed and autonomous Sensor Nodes (SNs),
that monitor physical or environmental activities like, pressure,
temperature or sound in specific area of deployment [1]. A
sensor characterized with limited computation capabilities and
storage receives the data through analogue to digital converter
(ADC). Then, transmit it further for transmission to a central
point, known as Base Station (BS) via a wireless connectivity
[2].
Routing in WSNs is a serious of processes of forwarding
information collected by sensors to the BS. In literature three
categories of routing protocols are designed: location-based
routing protocols, flat routing protocols and hierarchical
routing protocols [3], Clustering protocols can perform better
than others in term of balancing energy consumption and
lifetime prolongation. Generally, with clustering method, the
network area is divided into small groups termed as clusters,
with a predefined number of leaders known as Cluster Head
(CH). All the SNs gathering data and transmit it to their
corresponding CH, which finally aggregates it to the BS for
additional processing. Clustering has various significant
advantages over classical techniques [4].
978-1-5386-8167-1/18/$31.00 ©2018 IEEE
Authorized licensed use limited to: National Taiwan Univ of Science and Technology. Downloaded on May 28,2023 at 12:55:04 UTC from IEEE Xplore. Restrictions apply.
A d el Dallali Abdermaceur K ACH O URI
Department o f Computer Laboratory o f electronics and
Sciences o f Faculty o f information Technology
sciences o f Gafsa National Engineering School o f
U niversity o f Gafsa Sfax, TU N ISIA
adel.dallali@ gm ail.com Abdennaceur.Kachouri@enis.mu.tn
First, clustering ensure to balance the energy consumption
within the network by periodically rotate the role of CH among
all nodes. Secondly, data aggregation is applied on data,
received from various nodes members within a cluster, to
decrease the quantity of data to be transmitted to the BS thus
energy requirements decline sharply.
In this paper, we present a new clustering routing
algorithm to address the problem o f lifetime maximization of
WSN. The routing algorithm balances the energy consumption
of individual sensor by using a new optimal K-means
algorithm for selecting the different sets o f sensors for packets
transmission in the network. The concept o f forwarding search
space is introduced to reduce the unnecessary transmissions
and inapt CHs. By prohibiting the unsuitable CHs sensors
from participating in the path finding process, unnecessary
transmissions are reduced, and network lifetime is maximized.
The proposed routing algorithm demonstrate their proficiency
in term o f delivery of data packets and network lifetime
compared with LEACH, BeeCluster and O-LEACH.
The remainder of this paper is organized as follows. Section
2 presents related work on energy conservation and clustering
protocols. Section 3 provides the network model on WSNs.
Section 4 describes proposed clustering method. In section 4,
simulations and results obtained using DEE algorithm are
presented. Section 5 presents the concluding remarks.
II. M odel a n d a ss u m p t io n
In this section, the network model, energy usage model and
other assumption are considered. We have tried to develop our
clustering model on a realistic scenario.
A. Network Model
We modeled the proposition scheme by a Euclidean graph
G=(V, E), where V is the set of sensors and E={(u,v) C
V/D(u,v)<=R} represents the wireless connections between
nodes. R is the transmission range and D(u,v) denotes the
Euclidian distance between the node u and the node v.
335
 2018 30th International Conference on Microelectronics (ICM)

B. Proposed Distance Energy Evaluated Approch : DEE

• Step 1: Let's fix a network surface close to the base

station as favored area
• Step 2: Set a threshold energy value lower than the
value of the initial energy of the sensors.
• Step 3: Let us fix a zone near base station which will
be favored, any node of this surface whose energy is
greater than a threshold value to be specified is
strongly favored to be CH.
• Step 4: In the case where a node o f this surface loses
its energy so that it is lower than the threshold, its
participation in the election of CHs is even the
election of the CHs in LEACH. Fig 3. Coverage zone of simulation
• Step 5: For nodes too far from the base station that is
to say existing outside the fixed area, the to choose the cluster head in this group o f points you
participation in elections o f CHs is proportional to have to choose the point closest to centroid, to do this it is
the amount o f residual energy. If his energy is below necessary to calculate the distances between the centroid and
the threshold, his participation in the election of CHs the points and to choose the minimum distance. One can
will be disadvantaged by his distance to the base create a "nearer" function that will calculate the minimum
station and in the other case his participation in the distance.
election of CHs is even the election o f CHs in
LEACH.
The detail C luster H ead (CH) Selection A lgorithm is
discussed as below .

Algorithm: DEE Algorithm-Cluster Formation

Initialization of simulation parameters and the preferred zone

(dmax) and the threshold energy value (Eseuii)
Node randomly distributed
Initialize the number o f CH to 0
For Ei <>0 do
Choose a random number between 0 and 1
If distance to BS <= dmax then
If Ei >= Eseuii then
p=0 .1 *(1+Ei/Eseuil)
Else
p=0.1
End if
Else
IfEi>= Eseuii Then
p=0.1
Fig 2. Flowchart for operation of DEE
else
P=0 .1* (di-dma*)/ (di+dmax)
The DEE approach is based on the following formula : End if
End if
T(i)=p /mod(l-p*(nbround *1 /p))
p D m a x ~ D j to BS
r (n ) = t + (1 - p) ifnbrandom <= T(i) then
1-P (rm odjj)
Dmax~Dmin
Selected nodes as CH
else
The simulation area and the favored area, in this work xl = 25 Nodes are not CH
x2 = 75 y l = 25 y2 = 75, as well as the base station that is End if
selected at the center of the simulation area are shown in the End
figure below. These choices are taken experimentally from the Create clusters
simulation. For each CH, Create TDMA table and send it to their
members
Aggregation of data to CH that corresponds
Sending data to the Base Station

336
Authorized licensed use limited to: National Taiwan Univ of Science and Technology. Downloaded on May 28,2023 at 12:55:04 UTC from IEEE Xplore. Restrictions apply.
 2018 30th International Conference on Microelectronics (ICM)

III. s im u l a t io n R esu lts a n d d i s c u s s io n 120

In this section, we perform simulations to check the
performance of DEE clustering algorithm. We use the Matlab-
2014a as a simulator. To analyse the performance o f DEE in
comparison with Multihop-LEACH, LEACH-O, LEACH-C ■ Leach
and LEACH. We select this protocols because these later are
relative to our proposed DEE and most recent in the literature ■ Leach-c
ofWSNs. ■ Multihop

■ 0-Leach
A. Simulation Environment DEE
In order to validate the analytic m odel described
in the previous sections a sim ulation scenario is
0 780 932 1000 1050 1200 1600
provided here. A ll sim ulation was perform ed using
N u m b e r o f sensors
Matlab software. We consider N nodes number varies
between 50 and 100 nodes randomly deployed in a Fig.4. The number of alive nodes as a function o f time
topological area of dimension 100 x 100 m2. We assume
that the base station is located at the center of the sensing Network stability period: From the network beginning till
region. To compare the performance of Optimal K-Means the first node drain out its energy is known as stability period.
with other protocols, we ignore the effect caused by signal As well as the overall lifetime in DEE is greater than
collision and interference in the wireless channel. All the Multihop-LEACH, LEACH and O-LEACH respectively as
sensors have the same initial energy (0.5 joules). The shown in fig.4.
network is organized into a clustering hierarchy, and the
cluster-heads execute fusion function to reduce correlated
data produced by the sensor node within the clusters.
Parameters settings for DEE can be summarized in Table
II. To avoid the frequent change o f topology, we assume
that the nodes are in static mode; the protocol compared
with Multihop-LEACH , O-LEACH and LEACH.

TA BLE II. Sim ulation Parameters

Parameter Value
Sensor field 100*100
Probability o f a node to 0.05
become CH N u m b e r o f sen sors

Initial energy 0.5j

BS Location 50*50m
Data packet size 500 byres Fig.5. Energy consumption o f DEE over time
Transmitter/Receiver
50 nj/bit
Electronics Figure 5 represents the energy consumption and depicts that
Number o f nodes 50 & 100 DEE is more effective in saving energy than O-LEACH and
£ fs 10pJ/bit/m2 LEACH reduce between 0% and 35% of energy consumption.
Emp 0.0013 pJ/bit/m4
2500

Fig.5 shows the results of the simulation with density of 100

nodes. The performance o f DEE is lower than Multihop- 2000
LEACH, O-LEACH and LEACH so that, the first dead
happens after 2500 and 200 rounds. Hence, it can be
concluded that DEE is better than other three methods under 1500
all definition o f network lifetime. ■ Leach
: 1000 ■ Q-Leach

500
L T l ■ DEE

m m
0.5 1 1.5 2 2,5 3
Number of packets sent to BS x 104

Fig.6. Packet delivery ratio (100 nodes)

337
Authorized licensed use limited to: National Taiwan Univ of Science and Technology. Downloaded on May 28,2023 at 12:55:04 UTC from IEEE Xplore. Restrictions apply.
 2018 30th International Conference on Microelectronics (ICM)
We are also interested in the impact of the number of
packet delivery. Fig. 6 illustrates that the proposed model
delivers highest number of packet among its all peers, even at
highest density of nodes. This is due that, each time a packet is
sent, LEACH, BeeCluster, and O-LEACH always select node
with less energy for each packet transmission that results in an
early dead situation of the nodes. But in our case, proposed
algorithm selects a strong node in term of energy to transmit
the packets. Thus, the load is distributed among the maximum
number of sensor nodes in the network. Consequently,
network lifetimes maximized.
IV. C o n c l u s io n
Energy saving is a challenging issue in wireless
sensor networks. To reduce the energy consumption and
extend the lifetime of the sensor nodes, new efficient energy
saving schemes must be developed. In this paper, we have
proposed an energy-efficient clustering algorithm was
designed for the network with stationary sensor nodes in order
to minimize energy consumption between nodes and balance
energy consumption between clusters. Simulation results
showed that the proposed algorithm was effective in balancing
energy consumption and extending the network lifetime.
Thereafter, we compared our proposed scheme with LEACH,
the most well-known clustering algorithm, and with other
recent clustering algorithms like O-LEACH and Multihop-
LEACH.
Nevertheless, there remains a great need for further
research related to the impact o f the deployment of
heterogeneous nodes having high energy capacity in the
energy consumption and to the possible existence of other
factors to select CHs.
Authorized licensed use limited to: National Taiwan Univ of Science and Technology. Downloaded on May 28,2023 at 12:55:04 UTC from IEEE Xplore. Restrictions apply.
References
[1] Mann, P. S., & Singh, S. (2017). Improved metaheuristic based energy-
efficient clustering protocol for wireless sensor networks. Engineering
Applications o f Artificial Intelligence, 57, 142-152.
[2] Arghavani, M., Esmaeili, M., Esmaeili, M., Mohseni, F., & Arghavani,
A. (2017). Optimal energy aware clustering in circular wireless sensor
networks. Ad Hoc Networks, 65, 91-98.
[3] Akkaya, K., & Younis, M. (2005). A survey on routing protocols for
wireless sensor networks. A d hoc networks, 3(3), 325-349.
[4] Shin, H., Moh, S., Chung, I., & Kang, M. (2015). Equal-size clustering
for irregularly deployed wireless sensor networks. Wireless Personal
Communications, 82(2), 995-1012.
[5] Heinzelman, W.B. P. Chandrakasan, H. Balakrishnan, An application-
specific protocol architecture for wireless microsensor networks. IEEE
Transactions on Wireless Communications, 2002, 1 (4) 660-670.
[6] DENER, M. (2017). WiSeN: A new sensor node for smart applications
with wireless sensor networks. Computers & Electrical Engineering.
[7] Shokouhifar, M., & Jalali, A. (2017). Optimized sugeno fuzzy
clustering algorithm for wireless sensor networks. Engineering
Applications o f Artificial Intelligence, 60, 16-25
[8] Guiloufi, A. B., Nasri, N., & Kachouri, A. (2014, August). Energy-
efficient clustering algorithms for fixed and mobile Wireless Sensor
Networks. In Wireless Communications and Mobile Computing
Conference (IWCMC), 2014 International (pp. 735-738). IEEE.
[9] Abido, M. A. (2009). Multiobjective particle swarm optimization for
environmental/economic dispatch problem. Electric Power Systems
Research, 79(7), 1105-1113..
[10] Yong, Z., & Pei, Q. (2012). A energy-efficient clustering routing
algorithm based on distance and residual energy for wireless sensor
networks. Procedia Engineering, 29, 1882-1888.
[11] Aissa, M., Belghith, A., & Drira, K. (2013). New strategies and
extensions in weighted clustering algorithms for mobile ad hoc
networks. Procedia Computer Science, 19, 297-304.
[12] Nasri, N., Ben Fradj, A., & Kachouri, A. (2017). Optimised cross-layer
synchronisation schemes for wireless sensor networks. International
Journal o f Electronics, 104(7), 1178-1189.
[13] Khediri, S. E„ Nasri, N„ Wei, A., & Kachouri, A. (2014). A new
approach for clustering in wireless sensors networks based on
LEACH. Procedia Computer Science, 32, 1180-1185.
338