Hindawi

International Journal of Digital Multimedia Broadcasting

Volume 2022, Article ID 5566365, 11 pages
https://doi.org/10.1155/2022/5566365

Research Article
An Energy-Efficient Clustering Routing for Wireless Sensor
Networks Based on Energy Consumption Optimization

1
Xu Huibin and Zeng Mengjia1,2
1
School of Information Engineering, Huzhou University, Huzhou, Zhejiang 313000, China
2
School of Science and Engineering, Huzhou College, Huzhou, Zhejiang 313000, China

Correspondence should be addressed to Xu Huibin; [email protected]

Received 18 January 2021; Revised 16 June 2021; Accepted 7 February 2022; Published 10 March 2022

Academic Editor: Floriano De Rango

Copyright © 2022 Xu Huibin and Zeng Mengjia. This is an open access article distributed under the Creative Commons
Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work
is properly cited.

In order to alleviate energy consumption of wireless sensor networks (WSNs), energy consumption optimization-based clustering
routing (ECOR) is proposed in this paper. In ECOR, network is gridding by hexagon. And there is only a cluster head (CH) in
each hexagon, which makes the distribution of CHs more even. Residual energy of nodes and distance from the centroid of
hexagon are used to elect CHs. For any a CH, dynamic time slot allocation strategy is adopted to allocate time slot for its
cluster members. According to status of cluster members, the duration of time slot is dynamically adjusted. In intercluster
communication, the Dijkstra algorithm is used to construct the shortest path between CHs in order to shorten the distance of
transmitting data. Simulation results show that the ECOR algorithm outperforms the improved-Low Energy Adaptive
Clustering Hierarchy (I-LEACH) algorithm in terms of distribution of CHs and energy consumption.

1. Introduction information, nearby nodes will select the nearest CH to join

[8]. Then, member nodes (MNs) send data toward its CHs.
In wireless sensor networks (WSNs), a sensor node (or sim- Though LEACH improves energy efficiency of network,
ply a node) is a device that can gather sensory information, some disadvantages are associated with it. One is the net-
perform some processing, and communicate with other work lifetime. In LEACH, a sensor node with least residual
nodes [1, 2]. However, limited energy capacity [3] and com- energy may be selected to be a CH, which may be reduce
putation limit the applications of these devices. the network lifetime. Another is distribution of CHs. Ran-
Therefore, energy efficiency is crucial performance of dom selection of CHs results in the uneven distribution of
WSNs. Many studies show that routing protocol plays an CHs [9–11].
important role in saving energy of nodes [4]. The clustering Therefore, energy consumption optimization-based clus-
routing protocol [5, 6] were applied in WSNs since that it tering routing (ECOR) is proposed in this paper. The mon-
has the advantages of scalability, resource sharing, and itoring area is gridding by hexagon, and the CH is selected in
energy saving. each hexagon to make CH distribution more even. The
One of the most popular and widely clustering protocols weight of nodes to be a CH is computed. Energy of nodes
is the low-energy adaptive clustering hierarchy (LEACH) and distance from the centroid of hexagon is taken into
[7], which is presented by Heinzelman et al. It is probabilis- account when the weight was computed. In each hexagon,
tic approach that randomly selects cluster heads (CHs) in node with the biggest weight is selected to be a CH.
each round. After the CH selection, CHs broadcast informa- Intracluster communication, the duration of time slot is
tion toward nearby nodes to form clustering. Receiving the adjusted to reduce consumption of energy. In Intercluster
2 International Journal of Digital Multimedia Broadcasting

m bit data ETx (m,d)

Transmitted data circuit Power amplifier
mEelec m𝜀fsd2,d ≤d0
m𝜀ampd4,d >d0
distance d

m bit data ERx (m,d)

Received data circuit
mEelec

Figure 1: Energy consumption model.

1stround istround
Initial phase Data transmission phase Initial phase Data transmission phase

Frame

CH selection
Time slot
At the end of each frame

Figure 2: Round structure.

Node mum value of CHs are used to elect the next round CHs.
Similar to work in reference [12], reference [13] also pro-
R posed a CH selection algorithm. CH election has done based
Centroid
on threshold energy, residual energy, and optimum numbers
of clusters.
In addition, both references [14, 15] have reduced the
consumption of energy in view of simplifying sensing data
la
of nodes. Namely, the aim of reference [14] is to reduce
lb the energy consumption by reducing the number of sensors
reporting information to the sink without worsening the
Figure 3: Hexagonal grid-based cluster model. reliability, while basic idea of reference [15] is to weight
the information detected by the sensors according to the dis-
communication, the Dijkstra algorithm is applied to con- tortion area to better estimate the event at the sink node.
struct the shortest path between CHs, and the consumption Reference [16] proposed the improved LEACH (I-
of CHs’ energy are reduced. LEACH) algorithm, which optimized the energy consump-
The rest of this paper is organized as follows: Section 2 tion of the whole network to determine the optimal number
presents related works. Section 3 describes the system model, of CHs. And the threshold of CH selection was set by the
including network model, energy consumption model, and idea of equalization. Reference [17] proposed a particle
round structure. Section 4 presents the proposed routing in swarm optimization-based cluster routing to make CH dis-
detail. Section 5 explains the analysis of simulation results. tribution more even. However, the single hop communica-
Finally, we conclude this paper in Section 6. tion mode is still adopted in data transmission, which
increases energy consumption of data transmission. In addi-
tion, reference [18] proposed wolf optimizer-based central-
2. Related Works ized cluster algorithm. The algorithm selects CHs using the
grey wolf optimizer.
Reference [12] proposed a residual energy-based cluster- Reference [19] proposed fuzzy comprehensive
head selection algorithm so that the network lifetime is evaluation-based energy-efficient cluster routing (FCCR).
improved. The algorithm focuses on an efficient CH selec- In FCCR, the improved K-means cluster is used to form
tion scheme. In CH selection process, energy and an opti- clustering. The CH selection is optimized by using fuzzy
International Journal of Digital Multimedia Broadcasting 3

Starting

Sensor node
deplovement
Eires > Eiavg !

BS broascast
hello message YES
Compute the
weight Wik
Node i have received hello
packet and extract relevant
information from the packet
Node with largest weight
is selected to be CH

Average residual energy of all

[I]

nodes in hexagon is
k Ending
computed through equation (5)

Node i compute its residual

energy Eires

Figure 4: Flowchart of selecting CH.

Initialization First frame Second frame mst frame (2) There is only a base station (BS) in the network, and
its energy is not limited
(3) Physical position of all nodes is fixed after the
Time slot allocation Time slot 1 Time slot 2 Time slot n
deployment
Figure 5: Initial time slot allocation. (4) Each node has its own ID. They can know their
remaining energy and position. In addition, each
working-node: Data transmission Send-over Sleep node is able to fuse with its received data
(5) The communication link is symmetrical. For each
busying-node: Data transmission Request-continue
node, the distance between transmitter and receiver
is estimated through received signal strength index
Figure 6: Working node and busying node.
(RSSI). The transmitting power and communication
comprehensive evaluation. Reference [20] proposed the radius of node can be adjusted by itself
improved-firefly-based clustering (IFFC) algorithm. It uses
Moreover, some important notations used in this paper
the improved firefly clustering algorithm to form clustering.
are summarized in Notation 1.
The algorithm has two main advantages. One is even distri-
bution of CHs, and another is that balance the energy con-
sumption between heterogeneous nodes. And frequency of Notation 1. Notations and their descriptions. Notation:
reclustering is dropped. However, the IFFC algorithm did Description,
not optimize the data transmission path of intercluster d:Distance between transmitter and receiver,
communication. ETx ðm, dÞ:Consumed energy that the transmitter trans-
mit m bits data toward receiver,
ERx ðm, dÞ:Consumed energy that the receiver received m
3. System Model bit data,
3.1. Network Model. N sensor nodes are randomly deployed Ξk :kst hexagon,
in ℓa × ℓb m2 area. The relevant constraints of network model N k :The set of nodes in Ξk ,
are as follows [10]: Si :i st sensor node,
Xi :Position vector of si ,
(1) Initial state of all nodes is same. That is, battery W i k :Weight of si that located in Ξk ,
capacity of each node is same. The energy consump- Ei res :Residual energy of si ,
tion of transferring unit data to unit distance is same Ek avg :Average residual energy of all nodes in Ξk ,
for all nodes F ðt, jÞ:State of si in frame t st ,
4 International Journal of Digital Multimedia Broadcasting

Starting G F
Base station
Initializing set: 110
DCBS,Sh_path(id),All(id) C
20
30
A E 60
Ch With the shortest path
from source is found 20
60
D
Average residual energy of all 30
B
CHs in All (id) by equation (6)
Single hop
Multihop
YES res avg ?
ECh > ECH
Figure 8: Improved Dijkstra algorithm.

Ch is add into Sh_path (id) NO composed of multiple frames. At the end of each frame,
Sh_path(id) Sh_path(id)U {Ch} CH transmits data toward BS.
All(id) All(id) / Ch
4. ECOR Routing
NO 4.1. Hexagonal Grid-Based Cluster. The interesting region is
All(id) == 𝜙? divided into hexagon. There is only a CH in each hexagon to
make the distribution of CH more even, as shown Figure 3. Cen-
YES troid is the same distance from any point on the edge of the hexa-
Ending gon. If the node close to the centroid is chosen as the CH, the
whole network can be covered with the smallest numbers of CH.
Figure 7: Flowchart of constructing the shortest path. We consider ℓa × ℓb area of the 2D plane. And the num-
λðt + 1, jÞ:Time slot adjustment factor of si in ðt + 1Þst ber of centroid is
frame,  
ðℓa × ℓb Þ
Ci :Represent the ist CH, M= , ð3Þ
Eci res :Residual energy of all nodes in C i . A
pffiffiffi
3.2. Energy Consumption Model. The energy consumption where b⋅c represents floor function. A = 3/2 3R2 is the area
model [21, 22] of the ECOR algorithm is as shown in of a hexagon. R represents the radius of inner tangential cir-
Figure 1. Let ETx ðm, dÞ refers to consumed energy that the cle of the hexagon. xck is the position vector of centroid the of
transmitter transmits m bits data toward receiver. And the kst hexagon Ξk , and k = 1, 2, ⋯, M.
distance between transmitter and receiver is d. If all CHs are located at the centroid of hexagons, the net-
8 work can be covered with the least numbers of CHs, which is
< mEelec + mε f s d2 , if d ≤ d0 , also the original intention of adopting hexagonal grid-based
ETx ðm, d Þ = ð1Þ cluster scheme. BS loads all position vectors into Hello packet
: mE + mεamp d4 , if d > d 0 ,
elec and broadcasts the Hello packet throughout the network.
Received from position vectors, each node computes the
where Eelec represents the consumed energy that transmitted distance from the centroids of all hexagons. The node is in kst
per bit data. ε f s and εamp represent energy-consuming factor hexagon Ξk , if the distance from xck is not more than R, k = 1,
underpfree space and double-path fading model, respectively, 2, ⋯, M, so that these nodes know in which hexagon they are.
ffiffiffiffiffiffiffiffiffiffiffiffiffiffiffi LetN k represents the set of nodes in kst hexagonΞk , k =
d 0 = ε f s /εamp .
Received node consumes energyERx ðmÞ to receive m bit 1, 2, ⋯, M, and its definition is given by
data:
N k = fsi jkxi − xck k < Rg, ð4Þ
ERx ðmÞ = mEelec : ð2Þ
Where xi represents the position vector of si , and i = 1, 2,
⋯, N:.
3.3. Round Structure. Each round consists of the initial phase
and data transmission phase. In the initial phase, the CH 4.2. Selection of CHs and Cluster Formation. In the initial
selection is completed, and cluster is formed. In data trans- phase, the tentative CHs are initially chosen using a back-
mission phase, time is divided into different equal time slots off timer [24]. Each tentative CH will collect average residual
[23]. The duration of the allocated time slot is adjusted energy of all nodes in its hexagon. The timer value is
through the node state. inversely proportional to the residual energy level of node.
Each node transmits its data toward its CH in its time For instance, the back-off timer value will be low if the
slot, as shown in Figure 2. The data transmission phase is energy level is high, and vice versa.
International Journal of Digital Multimedia Broadcasting 5

Table 1: Shortest path iteration.

Iteration Sh_path (id) A B C D

At first fBSg 20 ∞ 110 30

1 fBS, Ag 20 100 30

2 fBS, A, Dg 20 80 30

3 fBS, A, D, Bg 20 80 90 30
4 fBS, A, D, B, Cg 20 80 90 30

Therefore, back-off timer value will be expired soon for Table 2: Simulation parameters.
the nodes with higher energy level. Once the back-off timer
reaches zero, the respective node declares itself as tentative Parameters Value
CH and broadcast tentative CH advertisement message Simulation area 200 × 200m2
(Ten_CH) within its hexagon. When any of the nodes in Number of nodes 100
hexagon receives Ten_CH before its timer expires, it trans-
Initial energy of node 2J
mits its residual energy level toward the tentative CH. When
tentative CH has received residual energy level of all nodes Position of BS (100, 100)
in its hexagon, it calculates the average residual energy of Transmission range 45 m
all nodes in hexagon, which is given by Packet size 4000 bit
Eelec 50nJ/bit
jN j εfs 10pJ/bit/m2
avg 1 k res
Ek = 〠 E , s ∈ N k, ð5Þ
jN k j h=1 h h εamp 0:0013pJ/bit/m4

avg
Where Ek is the average residual energy of all nodes in
hexagon Ξk . Eres According to equation (6), when the residual energy of
h denotes the residual energy of node sh . j
N k j is the number of elements in the set Ξk . a node is lower than the average residual energy of all
It is worth explaining that the node with the largest nodes in the hexagon in which the node located, the
remaining energy is chosen as tentative CH because energy weight of the node is zero. The node with largest weight
is consumed to calculate the average energy consumption in each hexagon will be selected to be a CH of the hexa-
and broadcast this information. This helps balance the resid- gon. The entire process is depicted in a flowchart as
ual energy levels of nodes in the hexagon. shown in Figure 4.
Residual energy of node and distance of node from cen- After the selection of CHs, CHs broadcast Inv_CH mes-
troid of the hexagon are used to compute the weight. Then, sage to nearby nodes for clustering. Each node chooses the
the node with the largest weight will be selected to be a CH. closest CH to join using optimal distance communication.
Let W ki denote the weight of node si ∈ N i that is located in kst Therefore, MNs send Join_CH message toward the closest
hexagon Ξk , and its definition is given by CH. Eventually cluster formation is done.

8 res   4.3. Intracluster Communication. After CH was selected, CH

> d
< α Ei + β 1 − i,Ξk , Eres avg
i ≥ Ek
will allocate time slot to its MNs in the way of time division
W ki = Eint R , ð6Þ multiple access (TDMA) [25]. MNs would transmit data
>
: res avg
0, Ei < Ek toward CH during its allocated time slot.

4.3.1. Initial Time Slot Allocation. Initially, CH adopts equal

whereEres
i denotes the residual energy of node si ∈ N i . Eint time slot scheme to allocate time slot for MNs. In ECOR
denotes initial energy of node si ∈ N i . According to the routing, there are m frames, and there are n time slots in
abovementioned network model, the initial energy of all each frame, as shown in Figure 5.
nodes is equal. di,Ξk is the distance between the node si and After time slot have been allocated, CH broadcasts time
the centroid of the hexagon. Both α and β are the weight slot allocation table in the cluster. Once received the time
coefficients, which control the proportion of residual energy slot allocation table, MNs know its allocated time slot and
and distance in the weight value. transmit its data during its allocated time slot.
6 International Journal of Digital Multimedia Broadcasting

200

180

160

140

Y/m 120

100

80

60

40

20

0
0 20 40 60 80 100 120 140 160 180 200

X/m

Figure 9: Distribution of 100 nodes in 200 × 200m2 .

If the data is completely transmitted during its allocated power of the transmission distance. If d < d0 , transmitter
time slot, node would send a send-over control message at transmits data in single hop way. If d > d 0 , transmitter still
the completion of transmitting data. The send-over control adopts the single hop way, and the energy consumed in
message indicates the completion of the data transmission. transmitting data process is 4th power of d.
Afterward, the node will go to sleep and turn off the radio. In this case, consumed energy of node can be reduced by
For simplicity, the type of node is called working-node. transmitting in multihop way. Based on the above analysis,
If the data is not completely transmitted during its allo- the shortest path based on the improved-Dijkstra algorithm
cated time slot, node sends the request-continue control [26] is adopted to construct intercluster communication.
message at the end of the time slot. For simplicity, the node In the Dijkstra algorithm, the network topology is repre-
that sends the request-continue control message is called the sented by weighted graph G = ðV, EÞ, where V denotes the
busying node, as shown in Figure 6. vertex set that composed of CHs and BS. The E denotes set
of weights that is the distance between the vertices.
4.3.2. Time Slot Adjustment. CH will adjust the duration of Initially, the BS is considered to be a source node, short-
time slot according to the type of node in the previous est path vertex set Sh pathðidÞ, and all vertex sets AllðidÞ are
round. Therefore, time slot adjustment factorλ is intro- constructed. At first, there is only the BS in Sh pathðidÞ set,
duced. Let Fðt, jÞ represents the state of node s j in t st frame. namely, Sh pathðidÞ = fBSg.
If the state of node s j is working node, Fðt, jÞ = 0. Otherwise, AllðidÞ contains all vertices except the BS and CHs that
if the state of node s j is busying node,Fðt, jÞ = 1. are able to communicate directly with the source node. If
Let λðt + 1, jÞ represents time slot adjustment factor of the distance between a CH and BS is less than d0 , CH com-
node s j in ðt + 1Þst frame, andλðt + 1, jÞ = 1 + 0:5Fðt, jÞ. municates directly with BS in single hop way without multi-
Assume that there are n nodes in the cluster, CH adjusts hop communication. Let DC⟶BS represents CH set that
duration of time slot in next frame according to equation distance from BS is less than d0 , and its definition is shown
(7): in Equation (8).

 
nλðt + 1, jÞ DC⟶BS = Ci dCi ⟶BS < d 0 , ð8Þ
T s ðt + 1, jÞ = n T ðt, jÞ, ð7Þ
∑i=1 λðt + 1, iÞ s
where C i represents the ist CH, and i = 1, 2, ⋯, M. d Ci ⟶BS
where T s ðt, jÞ represents the duration of jst time slot in t st represents the distance Ci and BS.
frame.T s ðt + 1, jÞ represents the duration of jst time slot in Initially, AllðidÞ = fV/BS/DC⟶BS g. When Sh pathðidÞ
ðt + 1Þst frame. and AllðidÞ are initialized, for any a CH C h ∈ AllðidÞ, the
CH Ch with the shortest path from the source node and its
4.4. Intercluster Communication. According to equation (1), residual energy more than average residual energy of all
avg
the consumed energy of node is proportional to the 2 ~ 4th CHs is selected to join in Sh pathðidÞ. Let ECH denotes the
International Journal of Digital Multimedia Broadcasting 7

200 200

180 180
160 First row
160
140
140
120
120
100
Y/m

Y/m
100
80 Second row
80
60

40 60
Third row
20 40

0 20
0 20 40 60 80 100 120 140 160 180 200
0
X/m 0 20 40 60 80 100 120 140 160 180 200
BS
X/m
SN
CH BS
SN
CH

(a) (b)
200

180

160

140

120
Y/m

100

80

60

40

20

0
0 20 40 60 80 100 120 140 160 180 200

X/m
BS
SN
CH

(c)

Figure 10: Performance analysis in terms of distribution of CHs.

average residual energy of CHs in AllðidÞ: The process of constructing the shortest path is illus-
trated in detail with the help of Figure 8. In Figure 8, V =
1
jAllðidÞj fBS, A, B, C, D, E, F, Gg. Assume that the distance between
avg
ECH = 〠 Eres , ð9Þ vertex E, F, Gand BS are less than d0 , and DC⟶BS ðidÞ = fE,
jAllðidÞj i=1 Ci F, Gg, so that, at first, AllðidÞ = fA, B, C, Dg.
After, for any a vertex in AllðidÞ = fA, B, C, Dg, the ver-
C i denotes the residual energy of C i . jAllðidÞj is the
where Eres tex with the shortest path from BS is selected to join
number of CHs in AllðidÞ. inSh pathðidÞ. As shown Figure 8, it is the vertex A with
Afterward, the length of path between source node and the shortest path from BS, and its path is 20. Therefore, ver-
any CH located in AllðidÞ is updated. Repeat the above pro- tex A is joined inSh pathðidÞ, namely, Sh pathðidÞ = Sh
cess until that all vertices in AllðidÞ are join in Sh pathðidÞ. pathðidÞ ∪ A.
Finally, the shortest path from source node from each CH Subsequently, the length of shortest path between source
is constructed. The steps are depicted in the flowchart given node and any CH located in AllðidÞ is updated, as shown in
in Figure 7. Table 1. At first, the shortest path between BS and vertex B is
8 International Journal of Digital Multimedia Broadcasting

cannot be confirmed; so, the shortest path is denoted by“∞,” 100

as shown in Table 1. But when vertex A is joined in Sh 95
pathðidÞ, the shortest path between the BS and vertex B 90
can be constructed with the help of vertex A, and the short-

Number of alive nodes

85
est path between the BS and vertex B is updated to 80, as
shown in Table 1. 80
Repeating the above procedure until that the shortest 75
path from BS to all vertexes is completely constructed, as 70
shown in Table 1. As known from Table 1, the shortest path 65
from BS to vertex A is BS ⟶ A. The shortest path from BS
60
to vertex B is BS ⟶ A ⟶ B. The shortest path from BS to
vertex C is BS ⟶ D ⟶ C. The shortest path from BS to 55
vertex D is BS ⟶ D. 50
0 200 400 600 800 1000 12000

5. Performance Analysis Number of rounds

5.1. Simulation Parameters. In order to better analyze the I-LEACH

performance of the ECOR algorithm, the WSN-based simu- FCCR
ECOR
lation software NS-2.35 [27] is used to analyze the network
performance of the ECOR algorithm, I-LEACH, and FCCR Figure 11: Performance analysis in terms of number of alive nodes.
algorithm.
In simulation, the number of nodes is 100. The specific
simulation parameters are shown in Table 2. 100 nodes are
2500
randomly deployed in 200 × 200 m2 area, as shown in
2168
Figure 9. The circle in Figure 9 denotes BS. Other black solid
points represent the nodes. 2000
FND and HNA/rounds

1783
The number of network survival nodes and energy con- 1624
sumption were selected to evaluate the performance of 1500
ECOR algorithm. The evaluation criteria of network alive
nodes were adopted in the reference [28], namely, first node 1000
death (FND) and half of node alive (HNA).
500
5.2. Distribution of CHs. The distribution performance of
76 86 90
CHs of the ECOR algorithm, I-LEACH, and FCCR algo- 0
rithm is analyzed, as shown in Figure 10. The hollow triangle I-LEACH FCCR ECOR
denotes CH. Figure 10(a) shows the distribution of CHs of
FND
the ECOR algorithm. Figure 10(b) shows the distribution HND
of CHs of the I-LEACH algorithm. Figure 10(c) shows the
distribution of CHs of the FCCR algorithm. Figure 12: Performance analysis in terms of FND and HNA.
As shown in Figure 10, compared with the I-LEACH
algorithm and FCCR algorithm, the distribution of CHs of
the ECOR algorithm is more even. In the ECOR algorithm, 5.4. FND and HNA. Secondly, FND and HNA in each algo-
CHs are arranged in approximately three rows. Distribution rithm are analyzed, as shown in Figure 12.
of CHs in both the I-LEACH algorithm and FCCR algo- From Figure 12, it is clear that the ECOR algorithm
rithm is haphazard. It is because that the ECOR algorithm has achieved better performance than all other algorithm
has used hexagon-based grid to generate a CH in each grid, in terms of FND and HNA. Compared with I-LEACH,
making distribution of CHs more even. However, the I- FND of the FCCR algorithm is improved by nearly 13%.
LEACH algorithm selects CHs based on the energy of node, The reason is that the FCCR algorithm has used fuzzy
which do not consider the position of nodes. So, the distri- comprehensive evaluation to select CHs, which makes
bution of CHs is uneven in the I-LEACH algorithm. CHs more evenly distributed and balances energy con-
sumption between nodes.
5.3. Number of Alive Nodes. Firstly, the number of alive Compared with the I-LEACH algorithm and FCCR algo-
nodes in each algorithm is analyzed, as shown in Figure 11. rithm, the FND of the ECOR algorithm is increased by 18%
From Figure 11, it is clear that the performance of num- and 4%, respectively. This is mainly due to the following rea-
ber of alive nodes in ECOR is better than I-LEACH and sons: CH distribution of the ECOR algorithm is reasonable.
FCCR. The I-LEACH algorithm loses 35% of the nodes at The time slot of nodes is adjusted within the intracluster
800 rounds. And the FCCR algorithm loses 35% of the nodes communication in order to optimize the time slot allocation.
after more rounds approximately at 1200 rounds. The pro- When the nodes that do not need to transmit data go to
posed ECOR algorithm has a minimum lose rate. sleep, the energy consumption is reduced.
International Journal of Digital Multimedia Broadcasting 9

1.8

1.6

Average remaining energy of nodes/J

1.4

1.2

0.8

0.6

0.4

0.2

0
0 500 1000 1500 2000 2500 3000 3500 4000 4500 5000

Number of round
I-LEACH
FCCR
ECOR

Figure 13: Performance analysis in terms of average remaining energy.

Figure 12 also represents the HNA of the I-LEACH, 50

FCCR, and ECOR algorithm. The HNA of the I-LEACH
45
algorithm is the lowest. The HNA of the ECOR algorithm
is the highest. Compared with the I-LEACH and FCCR algo- 40
Energy consumption/J

rithm, the HNA of the ECOR algorithm is improved by

35
about 32% and 21%, respectively. These results show that
the ECOR algorithm effectively reduces energy consumption 30
and improves the energy efficiency by optimizing CH
selection. 25

20
5.5. Average Remaining Energy of Nodes. Figure 13 displays 15
the average remaining energy of the I-LEACH, FCCR, and
ECOR algorithm. From Figure 13, it is clear that the average 10
remaining energy of ECOR is higher than the I-LEACH 1 2 3 4 5 6 7 8 9 10
algorithm and FCCR algorithm. The reason is that the test/time
ECOR algorithm makes CH distribution more even, and
the transmission path between CHs is shorten. In conse- ECOR
ECOR without dijkstra
quence, energy consumption is reduced.
The proposed ECOR routing has capitalized on two ECOR without time slot allocation
complementary techniques for reducing energy consump- Figure 14: Consumed Energy of ECOR, ECOR without Dijkstra,
tion. More precisely, in intracluster communication, the and ECOR without time slot allocation.
duration of time slot is dynamically adjusted according to
the state of nodes. In intercluster communication, the Dijk-
stra algorithm is used to construct the shortest path between duration of time slot allocation, that is, ECOR without time
CHs. slot allocation.
In addition, in order to analyze the contribution of these Energy consumption of ECOR, ECOR without Dijkstra,
two complementary technologies to the proposed routing, and ECOR without time slot allocation is shown in
the performance of two technologies is analyzed separately. Figure 14 when they performed 1000 rounds. From
Therefore, let us think about two cases in the ECOR Figure 14, we can obviously see that energy consumption
algorithm. Case 1:the ECOR algorithm does not adopt the of ECOR routing is the lowest in line with expectations.
shortest path between CHs, that is, ECOR without the Dijk- ECOR has used the two complementary technologies to
stra algorithm. Case 2: the ECOR algorithm does not adopt reduce energy consumption of nodes.
10 International Journal of Digital Multimedia Broadcasting

As is clearly shown in Figure 14, compared with ECOR [4] X. Li, B. Keegan, F. Mtenzi, T. Weise, and M. Tan, “Energy-
without Dijkstra, ECOR without time slot allocation con- efficient load balancing ant based routing algorithm for wire-
sumes less energy. The result shows that the shortest path less sensor networks,” IEEE Access, vol. 7, pp. 113182–
strategy constructed by the Dijkstra algorithm is more effec- 113196, 2019.
tive in reducing energy consumption compared with time [5] A. E. Fawzy, A. Amer, M. Shokair, and W. Saad, “Proposed
slot allocation. The main reason is that power dissipation intermittent cluster head selection scheme for efficient energy
of transmission unit in sensors is much bigger than the consumption in WSNs,” in Radio Science Conference,
sum of other units, to shorten the path of data transmission pp. 275–283, Alexandria, Egypt, 2017.
can greatly reduce energy consumption of nodes. [6] M. Zareei, C. Vargas-Rosales, M. H. Anisi et al., “Enhancing
the performance of energy harvesting sensor networks for
environmental monitoring Applications,” Energies, vol. 12,
6. Conclusion no. 14, p. 2794, 2019.
In order to reduce energy consumption and optimize CH [7] W. R. Heinzelman, A. Chandrakasan, and H. Balakrishnan,
“Energy-efficient communication protocol for wireless micro-
selection, the ECOR algorithm was proposed in this paper.
sensor networks,” in 33rd Annual Hawaii International Con-
In ECOR, CHs are selected by using the centroid of hex- ference on System Sciences, pp. 1–10, Maui, HI, USA, 2000.
agonal network topology. The ECOR algorithm makes
[8] J. Wang, Y. Gao, W. Liu, W. Wu, and S. J. Lim, “An asynchro-
the distribution of CHs more even. In intracluster commu-
nous clustering and Mobile data gathering schema based on
nication, the duration of time slot is dynamically allocated timer mechanism in wireless sensor Networks,” Computers,
according to the state of node. In intercluster communica- Materials and Continua, vol. 58, no. 3, pp. 711–725, 2019.
tion, the Dijkstra algorithm is used to construct the short- [9] J. Wang, Y. Gao, X. Yin, F. Li, and H. J. Kim, “An enhanced
est path among CHs, in order to shorten the path of PEGASIS algorithm with mobile sink support for wireless sen-
transmitting data. sor networks,” Wireless Communications and Mobile Comput-
Simulation results show that the ECOR algorithm out- ing, vol. 2018, 9 pages, 2018.
performs the I-LEACH algorithm in terms of distribution [10] W. Osamy, A. Ahmed, and A. Salim, “CSOCA:Chicken Swarm
of CHs and energy consumption. The aim of the ECOR optimization based clustering algorithm for wireless sensor
algorithm is to reduce energy consumption of node and networks,” IEEE Access, vol. 8, pp. 60676–60688, 2020.
make CHs’ distribution even. In the future, other perfor- [11] P. Kuila and P. K. Jana, “A novel differential evolution based
mance of the ECOR algorithm will be analyzed, including clustering algorithm for wireless sensor networks,” Applied
transmission data delay and packet transmission success Soft Computing Journal, vol. 25, pp. 414–425, 2014.
rate. [12] T. M. Behera, S. K. Mohapatra, U. C. Samal, M. S. Khan,
M. Daneshmand, and A. H. Gandomi, “Residual energy-
Data Availability based cluster-head selection in WSNs for IoT application,”
IEEE Internet of Things Journal, vol. 6, no. 3, pp. 5132–5139,
The data used to support the findings of this study are avail- 2019.
able from the corresponding author upon request. [13] A. Panchal, L. Singh, and R. K. Singh, “RCH-LEACH: Residual
energy based cluster head selection in LEACH for wireless sen-
Conflicts of Interest sor networks,” in 2020 International Conference On Electrical
And Electronics Engineering (ICE3-2020), pp. 321–325,
The authors declare that they have no conflicts of interest. Gorakhpur, India, 2020.
[14] Y. Feng, H. E. Kang, H. Yang, Z. Qiu, and Y. Liu, “The research
Acknowledgments and optimization of data gathering protocol for wireless sensor
network,” Chinese Journal of Sensors and Actuators, vol. 27,
This work was partly supported by the Zhejiang Province no. 3, pp. 355–360, 2014.
Soft Science Foundation of China (2021C35129) and Huz- [15] P. S. Sreedharan and D. J. Pete, “Spatial correlation based clus-
hou Natural Science Foundation (2021YZ20). tering with node energy based multi-hop routing scheme for
wireless sensor networks,” Tehnički Glasnik, vol. 15, no. 1,
pp. 25–36, 2021.
References
[16] S. Zhang, Q. Yang, and Y. B. Feng, “LEACH improved method
[1] S. K. Yang, Y. M. Shiue, Z. Y. Su, I. H. Liu, and C. G. Liu, “An based on energy consumption balance,” Computer Applica-
authentication information exchange scheme in WSN for IoT tions and Software, vol. 37, no. 1, pp. 133–138, 2020.
applications,” IEEE Access, vol. 8, pp. 9728–9738, 2020. [17] B. F. Solaiman and A. F. Sheta, “Energy optimization in wire-
[2] A. Albakri, L. Harn, and S. Song, “Hierarchical key manage- less sensor networks using a hybrid K-means PSO clustering
ment scheme with probabilistic security in a wireless sensor algorithm,” Turkish Journal of Electrical Engineering and Com-
network (WSN),” Security and Communication Networks, puter Sciences, vol. 24, no. 4, pp. 2679–2695, 2015.
vol. 2019, Article ID 3950129, 11 pages, 2019. [18] S. M. M. H. Daneshvar, P. A. A. Mohajer, and S. M. Mazinani,
[3] B. Mohammed, R. Mehdi, A. Mokaddem et al., “LE-OLSR pro- “Energy-efficient routing in WSN: a centralized cluster-based
tocol performance evaluation in various energy conditionsof approach via grey wolf optimizer,” IEEE Access, vol. 7,
mobile ad-hoc and sensor wireless networks,” Indonesian pp. 170019–170031, 2019.
Journal of Electrical Engineering and Computer Science, [19] H. L. Jia, X. L. Fan, and Y. F. Lu, “Energy-efficient wireless sen-
vol. 19, no. 3, pp. 1391–1398, 2020. sor networks routing protocol based on clustering,”
International Journal of Digital Multimedia Broadcasting 11

Transducer and Microsystem Technologies, vol. 37, no. 8,

pp. 116–119, 2018.
[20] L. Jian, “Bi Xiao-dong. Optimized energy efficient routing
algorithm based on improved firefly clustering for heteroge-
neous WSNs,” Chinese Journal of Sensors and Actuators,
vol. 31, no. 10, pp. 1584–1591, 2018.
[21] L. Qing, Z. Jiang, Z. Jing, and W. Jian, “WSN energy optimiza-
tion on BIRCH based dual head clustering,” Computer Engi-
neering and Science, vol. 42, no. 6, pp. 974–985, 2020.
[22] X. Li-wen, Q. Li-juan, and C. Jie, “A K-means clustering rout-
ing algorithm based on modified VANETs,” Computer Tech-
nology and Development, vol. 28, no. 3, pp. 15–19, 2018.
[23] Z. Liang, L. Zhigao, and X. Zhili, “Modified cluster-head selec-
tion algorithm for WSNs based on LEACH,” Journal of Elec-
tronic Measurement and Instrumentation, vol. 33, no. 12,
pp. 86–94, 2019.
[24] S. Arjunan, S. Pothula, and D. Ponnurangam, “F5N-based
unequal clustering protocol (F5NUCP) for wireless sensor net-
works,” International Journal of Communication Systems,
vol. 31, no. 17, pp. 1–14, 2018.
[25] Z. Wei, “Dynamic time slot allocation MAC protocol for clus-
tered wireless sensor,” Networks, vol. 30, no. 9, pp. 126–129,
2017.
[26] G. P. Zhang, Z. Fen, M. Gang, and J. X. Dong, “An energy-
balanced WSNs routing optimization algorithm based on
AGNES clustering,” Computer Engineering and Science,
vol. 42, no. 4, pp. 620–628, 2020.
[27] J. Liu, Y. Li, and H. Qi, “The improvement and simulation of
LEACH routing protocol in wireless sensor network based
on NS2,” Application of Electronic Technique, vol. 38, no. 2,
pp. 21–23, 2012.
[28] R. Zhang and S. Qin, “LEACH-based clustering routing proto-
col for sensor networks,” Computer Engineering and Design,
vol. 33, no. 4, pp. 1333–1336, 2012.