International Journal of Reconfigurable and Embedded Systems (IJRES)

Vol. 13, No. 2, July 2024, pp. 323~331

ISSN: 2089-4864, DOI: 10.11591/ijres.v13.i2.pp323-331  323

Dual step hybrid routing protocol for network lifetime

enhancement in WSN-IoT environment

Kalpavi C. Yankanaik, Sujatha B. Munivenkatappa

Department of Electronics and Communication Engineering, Acharya Institute of Technology, Bangalore, India

Article Info ABSTRACT

Article history: Recent development in internet of things (IoT) has been generating huge
data due to the large number of nodes deployed and utilized for different
Received Jan 12, 2023 applications. In addition, these applications utilize big data and require a
Revised Dec 2, 2023 more efficient mechanism for data sensing and data transmission. This
Accepted Dec 22, 2023 research work proposes dual step hybrid routing (DSHR) protocol for
efficient cluster-based routing. It comprises a two-phase algorithm, which
aims at finding the optimal path considering clustering. It further comprises
Keywords: several processes such as cluster head selection, optimal path construction,
integrating of nodes to cluster head and sensing range optimization. DSHR is
Dual step hybrid routing evaluated considering the network lifetime; thereafter model is compared
Internet of things with the existing low energy adaptive clustering hierarchy (LEACH)
Network lifetime protocol to prove the efficiency.
Routing
Wireless sensor network This is an open access article under the CC BY-SA license.

Corresponding Author:
Kalpavi C. Yankanaik
Department of Electronics and Communication Engineering, Acharya Institute of Technology
Bangalore, Karnataka, India
Email: [email protected]

1. INTRODUCTION
In the internet of things (IoT) environment, data load has been increasing enormously due to its
heterogeneous nature. Furthermore, big data is utilized for various applications such as smart agriculture,
smart homes, smart city, and smart healthcare. In all these applications, wireless sensor network (WSN) has
been one of the key components of IoT as it helps in data propagation in the network [1]–[3]. In IoT, WSN
are used for processing, storage, mining and data analysis, which is helpful in monitoring application of IoT.
Hence, WSN has been widely researched at industry level and academia level.
In a typical WSN scenario, the sensor nodes are widely distributed across where data collection or
observation of data and transferred to the sink. The information gathered from the multi-hop transmission is
crucial for transmission to the base station (BS), which is situated behind the transmission that supplies the
sensor node and determines the best path to the sink [4]. The essential application for WSN’s nodes consists
of minimal energy that is not efficiently charged upon further deployment. The energy dissipation for
routing, in addition to maintaining the remaining energy residual. Depending on the number of intermediary
nodes, the energy dissipation concentrates on the distance between these nodes. The WSN routing path with
the fewest hops over the shortest distance. The remaining energy is associated with each node to avoid the
drain capacity for network segmentation. These procedures enhance network lifetime because the energy is
transferred amongst all the nodes [4], [5]. Figure 1 shows the typical WSN-IoT architecture that comprises
sensing layer, transport layer and application layer. In sensing layer, data are sensed and sent to transport
layer, which is integrated with IoT platform and further connected to application layer where the data are
stored and available for end user.

Journal homepage: http://ijres.iaescore.com

324  ISSN: 2089-4864

Application

Figure 1. Typical WSN-IoT architecture

In a limited area, the node is responsible to transmit the packets to the BS, and over a wide area, the
packet transmission with several intermediate nodes. In a wide WSN area, there exist three major challenges:
i) area division; and ii) splitting into sub-divisions through the whole region, effective routing, and
intermediate energy nodes.
In the sub-division, the entire region is split into smaller areas termed clusters. In these clusters, one
node is picked as the cluster head for data reception from the remaining sensor nodes of the cluster and
transfers it to the parallel node or BS. In the WSN environment, various protocols for clustering purposes
were previously used for low energy adaptive clustering hierarchy (LEACH), multi-hop LEACH protocol
(M-LEACH), and stable election protocol (SEP) [3]–[6]. Through these protocols, the network lifetime is
prolonged for efficient energy dissipation is accomplished upon selecting the cluster head node. For routing
there are two types of tasks; one is flat routing and the other is hierarchical routing. Flat routing involves the
routing from the sensor to the BS is traversed; whereas in hierarchical routing, the sensor nodes are
responsible for the transmission of data toward the cluster head, and this further transfers it to the adjacent
node [7]–[9].
The route becomes vacant when the intermediate nodes consist of high energy for packets received
and parallel transmission to the subsequent node; relaying and intermediate nodes for multi-hop transmission
communication. The nodes consist of minimal energy for relaying purposes, as the transmission descends.
The nodes adjacent to the sink node or BS are simultaneously used for relaying and the outcome of these
results in energy dissipation. Accordingly, the nodes are dead, and this region is deployed adjacent to the BS,
termed a warm hole region [8], [10]. Choosing an optimized route is essential for selecting a prime aspect for
WSN design. The motivation behind deploying the WSN is as: i) to find an optimal energy consumption
routing for packet transmission via multi-hop WSN; ii) to enhance the packet delivery to the BS; iii) to
increase the network lifetime to minimize the energy consumed by the node; iv) to make use of the maximum
available network capacity; and v) to reduce the warm hole problem for multi-hop WSN.
Further, the research contribution is given as: i) this research work develops a dual step hybrid
routing (DSHR) protocol, which aims at finding the optimal path for data packet transmission; ii) at first, the
model develops a novel cluster head selection concerning large sensor nodes and later designs the optimal
path construction concerning the same; iii) further, connecting nodes to clusters with respect and sensing
range is optimized and iv) DSHR is evaluated for network lifetime enhancement; model efficiency is proved
by comparing it with the existing LEACH protocol.
This research is organized as follows: the first section starts with background IoT and WSN, along
with the importance of the development of a routing mechanism. Furthermore, in second section, few
existing routing protocols are discussed along with their shortcoming, section ends with motivation and

Int J Reconfigurable & Embedded Syst, Vol. 13, No. 2, July 2024: 323-331
Int J Reconfigurable & Embedded Syst ISSN: 2089-4864  325

contribution of research work. The third section presents the mathematical modelling of the DSHR protocol
and the same is evaluated in the fourth section.

2. RELATED WORK
According to Alami and Najid [11], an enhanced clustering hierarchy approach (ECH) uses a
sleeping-waking mechanism for overlapping and nearby nodes to achieve energy efficiency in WSNs.
Reduced data redundancy and maximum network longevity are both achieved. The efficiency of rule-based
fuzzy routing is improved in Sert and Yazici [12] by applying a modified clonal selection method called
CLONALG-M to choose the proper functional form for the output membership function. The fuzzy
technique is effective and well formed with a variety of methodologies and distinct borders between poorly
defined clusters. A successful conclusion to the iterative experiment using the membership function.
An effective energy-efficient network for the deep belief network (DBN) based on routing protocol
is implemented, this establishes efficient data transmission via the path selected thereby enhancing the packet
delivery ratio (PDR) is enhanced [13]–[15]. In the framework initially, the nodes in the entire network are
clustered by using a reinforcement algorithm, which allocates a reward for the nodes assigned to a specific
cluster. The cluster head is required for efficient data transmission by selecting a mantaray foraging
optimization (MRFO) algorithm. In several studies [16]–[18], this is an energy clustering protocol based on
Voronoi dividing known as the energy-saving cluster for Voronoi adaptive routing (ESCVAD) protocol [19].
The procedure built on ESCVAD protocol resulted in an adaptive clustering algorithm for Voronoi dividing
as well as cluster head election optimization algorithm resulting in energy comprehensive weighting [20]–
[22]. The energy efficiency and network quality-of-service by incorporating reward function including the
required metrics. The agent gets the reward for action-based reward, while the software-defined wireless
sensor network (SDWSN) improvises the routing path on the experience. In Gamal et al. [23], a technique
that uses less energy to improve the performance of a SDWSN. A mixed integer linear programming (MILP)
issue is combined with an energy-optimized multi-constrained sustainable routing (EOMCSR) model to
improve the SDWSN's network resource-based energy consumption [24].

3. PROPOSED METHOD
In WSN based IoT environment, clustering and routing has one of the important roles to play for
efficient data transmission, the main objective of this research is to enhance the network lifetime. Thus, this
research utilizes the clustering and routing to develop a novel hybrid protocol for improvisation in network
lifetime. The proposed approach consists of two phases: consists of clustering and routing. The main task of
clustering is to choose the cluster head nodes by utilizing the local information for the sensor nodes with
relevant parameters to build a routing mechanism for data collection. Figure 2 shows the proposed workflow,
at first optimal cluster head selection concerning a large number of sensor nodes. Furthermore, optimal path
construction for the data transmission module is designed. Sensor nodes are connected to the 𝑐𝑙𝑢𝑠_ℎ𝑒𝑎𝑑; at
last sensing, range optimization is designed for the data sensing.

Figure 2. DSHR workflow

Dual step hybrid routing protocol for network lifetime enhancement in WSN-IoT … (Kalpavi C. Yankanaik)
326  ISSN: 2089-4864

3.1. Cluster head selection

The distance estimated from the BS to the initial point of the neglected region where the BS is
presumed to be adjacent to the monitored area, a BS is assumed adjacent to the monitored area. Initially, the
BS at the breaking point transmits BS_Init_msg while the competition range 𝐷 that initializes clustering. The
top layer nodes receive 𝐵𝑆_𝐼𝑛𝑖𝑡_𝑚𝑠𝑔 to know the distance to a BS and are involved in the cluster head
competition. Here each node in the top level broadcasts the 𝑠𝑡𝑎𝑟𝑡_𝑚𝑠𝑔(𝑥, 𝑑𝑖𝑠𝑥−𝐵𝑆, 𝑅𝑥𝑜𝑢𝑡 , 𝑅𝑥𝐸𝑃 (𝑢 + 1) to
𝑤
accommodate the distance that swap the information along with cluster head selection, where x indicates
2
the reference id of the node, 𝑑𝑖𝑠𝑥−𝐵𝑆, fx is the distance between the node 𝑓𝑥 and BS, 𝑅𝑥𝑜𝑢𝑡 is the remaining
energy for the node 𝑓𝑥 during the prediction given by (𝑢 + 1). Once the local information is gathered from
the adjacent nodes, each node evaluates its weight election for cluster head selection using (1).

𝑅𝑥𝑜𝑢𝑡 𝑑𝑖𝑠𝑥−𝐵𝑆, −𝑚𝑖𝑛(𝑑𝑖𝑠𝑥−𝐵𝑆 ) 𝑅𝑥𝐸𝑃 (𝑢+1)

𝑅𝐺𝑥 = ϒ1 × + ϒ2 × [1 − ] + ϒ3 × (1)
𝑅𝑥𝑟𝑐 𝑚𝑎𝑥(𝑑𝑖𝑠𝑥−𝐵𝑆, )−𝑚𝑖𝑛(𝑑𝑖𝑠𝑥−𝐵𝑆 ) 𝑚𝑎𝑥 (𝑅𝑥𝐸𝑃 )

Here ϒ1 ,ϒ2 , ϒ3 is the constant value between o and 1 whereas ϒ1 +ϒ2 + ϒ3 =1. Various solutions
handle the dimensions of min-max normalization, where the largest value is normalized. The maximum value
is utilized in the min-max normalization process. An improved choice for the cluster head with a higher
weight is a node with greater energy, a shorter distance for BS, and high prediction energy. When a cluster
head is chosen for each level of the entire network area, the cluster head updates the distance from the BS to
each level when the cluster head is chosen for each level of the entire network area 𝑑𝑖𝑠𝐶𝐻−𝐵𝑆 . Here 𝑑𝑖𝑠𝐶𝐻−𝐵𝑆
is the first-level cluster head nodes the Euclidean distance is the distance to BS for low-level cluster head
𝑎𝑑𝑗
nodes. By exchanging local information with nearby nodes, each of which has an adjacency degree 𝑧𝑥 and
signal-to-noise ratio assnrx . The degree of the node is the number of neighbors evaluated by the recipient
𝑠𝑡𝑎𝑟𝑡_𝑚𝑠𝑔() messages. 𝑠𝑛𝑟𝑥 is evaluated as (2).
𝑠𝑖𝑔
𝐼𝑥
𝑠𝑛𝑟𝑥 = 10 𝑙𝑜𝑔10 ( 𝑛𝑜𝑖𝑠𝑒 ) (2)
𝐼𝑥

𝑠𝑖𝑔
Here 𝐼𝑥 and 𝐼𝑥𝑛𝑜𝑖𝑠𝑒 depicts effective signal power and effective noise. A node is picked as the
cluster head continues to broadcast the 𝑐𝑙𝑢𝑠ℎ𝑒𝑎𝑑_𝑚𝑠𝑔(∑𝐽𝐶𝐻𝑈, ∑𝑟𝑒𝑙𝑎𝑦−𝑣𝑐 ) whereas 𝑃 indicates lower-level
competition, where ∑𝐽𝐶𝐻𝑈 indicates the information of present and top-level cluster head nodes and
∑𝑟𝑒𝑙𝑎𝑦−𝑣𝑐 indicates the information of the top and present level relay 𝑣𝑐 nodes. A relay node consists of the
high-energy consumption of the vc nodes in the adjacent cluster group consisting of the cluster head node.
The parameters involved are clushead_msg that contains the reference of the node, distance transmitted
to 𝐵𝑆, the remaining energy, adjacency value, the energy predicted and 𝑆𝑁𝑅 value. For example, the
𝑎𝑑𝑗
𝑐𝑙𝑢𝑠ℎ𝑒𝑎𝑑_𝑚𝑠𝑔 is stated as the 𝑐𝑙𝑢𝑠ℎ𝑒𝑎𝑑_𝑚𝑠𝑔(𝑗𝐶𝐻𝑈, 𝑑𝑖𝑠𝑐𝑙𝑢𝑠ℎ𝑒𝑎𝑑𝐵𝑆 , 𝑅𝑜𝑢𝑡 𝐸𝑃
𝑐𝑙𝑢𝑠ℎ𝑒𝑎𝑑 , 𝑧𝑐𝑙𝑢𝑠ℎ𝑒𝑎𝑑 , 𝑅𝑐𝑙𝑢𝑠ℎ𝑒𝑎𝑑 (𝑢 +
1), 𝑠𝑛𝑟𝑐𝑙𝑢𝑠ℎ𝑒𝑎𝑑 ) for the present level clushead node, the clushead and 𝑣𝑐 node at each level cluster holds the
routing table for top-level clushead node and 𝑣𝑐 node is responsible for transmitting data by incorporating
adaptive transmission power modification. The broadcasting of the 𝑐𝑙𝑢𝑠ℎ𝑒𝑎𝑑_𝑚𝑠𝑔() where each clushead
node determines the information series for top-level 𝑐𝑙𝑢𝑠ℎ𝑒𝑎𝑑s, the 𝑣𝑐 node determines the information of
the relay nodes for data transmission. The relevant information of all the nodes clushead node and 𝑣𝑐 node
of the top level is forwarded in a systematic manner to the clushead node and 𝑣𝑐 node selected for low-level
transmission. All nodes in 𝑞𝑥, that participate in the 𝑐𝑙𝑢𝑠ℎ𝑒𝑎𝑑 incorporate the following features. It consists
of 𝑐𝑙𝑢𝑠ℎ𝑒𝑎𝑑𝑥 as the top-level 𝑐𝑙𝑢𝑠ℎ𝑒𝑎𝑑, the distance 𝑐𝑙𝑢𝑠ℎ𝑒𝑎𝑑𝑥 is minimal in terms of the radius and the
remaining energy is higher than the 𝑒𝑛𝑒𝑟𝑔𝑦 − 𝑝𝑒𝑎𝑘.

𝑞
𝑞𝑙𝑙, = { 𝑦,⁄𝑐𝑙𝑢𝑠ℎ𝑒𝑎𝑑 ∈𝑐𝑙𝑢𝑠ℎ𝑒𝑎𝑑𝑞ℎ𝑙𝑦, 𝑞𝑦, ∈𝑎𝑑𝑗 𝑐𝑙𝑢𝑠ℎ𝑒𝑎𝑑𝑖𝑛 𝑃, 𝑅𝑦𝑜𝑢𝑡 (3)
𝑥

𝑅𝑙−𝑝𝑒𝑎𝑘, 𝑞𝑦.𝑠𝑡𝑎𝑡𝑒 𝑛𝑜𝑡 𝑒𝑞𝑢𝑎𝑙 𝑡𝑜 𝑡ℎ𝑒 𝑉𝐶 𝑜𝑓 𝑐𝑙𝑢𝑠ℎ𝑒𝑎𝑑𝑥 ,

𝑑𝑖𝑠𝑐𝑙𝑢𝑠ℎ𝑒𝑎𝑑𝑥 −𝐵𝑆, < 𝑑𝑖𝑠𝑦−𝐵𝑆 }

All the nodes that compete may receive an acknowledgement as 𝑐𝑙𝑢𝑠ℎ𝑒𝑎𝑑𝑥 from the top-level 𝑐𝑙𝑢𝑠ℎ𝑒𝑎𝑑
nodes. Here BS is defined as (4).

𝑑𝑖𝑠𝑦−𝐵𝑆 = 𝑚𝑖𝑛 {𝑑𝑖𝑠𝑐𝑙𝑢𝑠ℎ𝑒𝑎𝑑𝑥 −𝐵𝑆, + 𝑑𝑖𝑠𝑐𝑙𝑢𝑠ℎ𝑒𝑎𝑑𝑥 −𝑦 } (4)

Int J Reconfigurable & Embedded Syst, Vol. 13, No. 2, July 2024: 323-331
Int J Reconfigurable & Embedded Syst ISSN: 2089-4864  327

That is the Euclidean distance from the node 𝑞𝑦, to BS. Consequently, every node 𝑞𝑦, broadcasts the
𝑠𝑡𝑎𝑟𝑡_𝑚𝑠𝑔(𝑥, 𝑑𝑖𝑠𝑦−𝐵𝑆, 𝑅𝑦𝑜𝑢𝑡 , 𝑅𝑦𝐸𝑃 (𝑢 + 1)) in the range to swap the information with the neighbours for
𝑐𝑙𝑢𝑠ℎ𝑒𝑎𝑑 selection. This 𝑐𝑙𝑢𝑠ℎ𝑒𝑎𝑑 is repeated for the entire area.

3.2. Optimal path selection

In the routing phase, the routing-table necessary for data transmission is built consecutively for the
clushead selection. Each present level in clushead chooses the next task to be performed according to
𝑐𝑙𝑢𝑠ℎ𝑒𝑎𝑑_𝑚𝑠𝑔 from the top-level 𝑐𝑙𝑢𝑠ℎ𝑒𝑎𝑑𝑠, however, the top-level clushead having the lowest cost is
estimated by a formula which is subsequently selected as the next hop.

𝑅 𝑜𝑢𝑡
𝑐𝑙𝑢𝑠ℎ𝑒𝑎𝑑 𝑚𝑎𝑥 (𝑅 𝐸𝑃 𝐸𝑃
𝑐𝑙𝑢𝑠ℎ𝑒𝑎𝑑 −𝑅 𝑐𝑙𝑢𝑠ℎ𝑒𝑎𝑑 (𝑢+1) 𝑑𝑖𝑠𝑐𝑙𝑢𝑠ℎ𝑒𝑎𝑑−𝐵𝑆
𝑈𝐿𝑥 = 𝛽1 × + 𝛽2 × +𝛽3 × + (5)
𝑅 𝑟𝑐
𝑐𝑙𝑢𝑠ℎ𝑒𝑎𝑑 𝑚𝑎𝑥 (𝑅 𝐸𝑃
𝑐𝑙𝑢𝑠ℎ𝑒𝑎𝑑 ) 𝑚𝑎𝑥 (𝑑𝑖𝑠𝑐𝑙𝑢𝑠ℎ𝑒𝑎𝑑−𝐵𝑆 )

𝑎𝑑𝑗
𝛼𝑐𝑙𝑢𝑠ℎ𝑒𝑎𝑑 (𝑠𝑛𝑟𝑐𝑙𝑢𝑠ℎ𝑒𝑎𝑑 )−𝑠𝑛𝑟𝑐𝑙𝑢𝑠ℎ𝑒𝑎𝑑
𝛽4 𝑎𝑑𝑗 + 𝛽5
𝛼𝑐𝑙𝑢𝑠ℎ𝑒𝑎𝑑 (𝑠𝑛𝑟𝑐𝑙𝑢𝑠ℎ𝑒𝑎𝑑 )

This equation transforms into a clushead node with more remaining energy, energy prediction rate,
and minimal distance to BS, low adjacency degree, and high signal-to-noise ratio of chances to be selected as
the nextclushead. A 𝑐𝑙𝑢𝑠ℎ𝑒𝑎𝑑 takes less energy for transmission amid the clusters which are why a
clushead with low value has high priority amongst several other 𝑐𝑙𝑢𝑠ℎ𝑒𝑎𝑑𝑠. Accordingly, a 𝑐𝑙𝑢𝑠ℎ𝑒𝑎𝑑 is
positioned in a sparse area with remaining energy, minimal distance to BS, low adjacency degree, and high
signal-to-noise ratio of chances to be selected as the next 𝑐𝑙𝑢𝑠ℎ𝑒𝑎𝑑. The routing table is built from top-level
minimal distance to BS, low adjacency degree, the high signal-to-noise ratio of likelihood to be a selection of
as the next 𝑐𝑙𝑢𝑠ℎ𝑒𝑎𝑑 to low-level minimal distance to BS, low adjacency degree, high signal to noise ratio of
chances to be selected as the next 𝑐𝑙𝑢𝑠ℎ𝑒𝑎𝑑, each 𝑐𝑙𝑢𝑠ℎ𝑒𝑎𝑑 has its routing tree from itself to BS.

3.3. Network lifetime enhancement transmission

Once the cluster head selection and routing process are done, in the first phase the nodes do not
receive any message and elect themselves as the cluster head, whereas 𝑣𝑐 picks a cluster head along the
smallest join shown by the formula as its cluster head and joins it.

𝑅 𝑟𝑐 𝑜𝑢𝑡
𝑐𝑙𝑢𝑠ℎ𝑒𝑎𝑑 −𝑅 𝑐𝑙𝑢𝑠ℎ𝑒𝑎𝑑 max(𝑅 𝐸𝑃 𝐸𝑃
𝑐𝑙𝑢𝑠ℎ𝑒𝑎𝑑 −𝑅 𝑐𝑙𝑢𝑠ℎ𝑒𝑎𝑑 (𝑢+1)
𝑁𝐶 = 𝛿1 × + 𝛿2 × (6)
𝑅 𝑚𝑎𝑥
𝑐𝑙𝑢𝑠ℎ𝑒𝑎𝑑 max(𝑅 𝐸𝑃
𝑐𝑙𝑢𝑠ℎ𝑒𝑎𝑑 )

𝑑𝑖𝑠𝑐𝑙𝑢𝑠ℎ𝑒𝑎𝑑−𝑥
+𝛿3 × (ƿ ×
𝑚𝑎𝑥 (𝑑𝑖𝑠𝑐𝑙𝑢𝑠ℎ𝑒𝑎𝑑−𝑥 )

𝑚𝑎𝑥(𝑑𝑖𝑠𝑐𝑙𝑢𝑠ℎ𝑒𝑎𝑑−𝐵𝑆 )−𝑑𝑖𝑠𝑐𝑙𝑢𝑠ℎ𝑒𝑎𝑑−𝐵𝑆
+ϒ ×
𝑚𝑎𝑥 (𝑑𝑖𝑠𝑐𝑙𝑢𝑠ℎ𝑒𝑎𝑑−𝐵𝑆 )

𝑎𝑑𝑗
𝛼𝑐𝑙𝑢𝑠ℎ𝑒𝑎𝑑 𝑚𝑎𝑥 (𝑠𝑛𝑟𝑐𝑙𝑢𝑠ℎ𝑒𝑎𝑑 )−𝑠𝑛𝑟𝑐𝑙𝑢𝑠ℎ𝑒𝑎𝑑
+ 𝛿4 × 𝑎𝑑𝑗 + 𝛿5 ×
𝑚𝑎𝑥 (𝛼𝑐𝑙𝑢𝑠ℎ𝑒𝑎𝑑 ) 𝑚𝑎𝑥 (𝑠𝑛𝑟𝑐𝑙𝑢𝑠ℎ𝑒𝑎𝑑 )

Here ƿ, ϒ, 𝛿1 , 𝛿2 , 𝛿3 , 𝛿4 , 𝛿5 are the constants in the range 0 to 1 and ƿ + ϒ = 1, 𝛿1 + 𝛿2 + 𝛿3 +

𝛿4 + 𝛿5 = 1. In (6), the 𝑣𝑐 joins the clushead node with more remaining energy, energy prediction rate,
minimal distance to BS, low adjacency degree, and high signal-to-noise ratio. The nearest the BS to
𝑐𝑙𝑢𝑠ℎ𝑒𝑎𝑑𝑠 the more data is transmitted. Henceforth they have a heavy relay load in between the clusters.
This problem is handled by making the 𝑣𝑐 closer to the 𝑐𝑙𝑢𝑠ℎ𝑒𝑎𝑑 if the distance is less than 𝑣𝑐 should join it.
This results in a high chance of 𝑣𝑐 to being able to join 𝑐𝑙𝑢𝑠ℎ𝑒𝑎𝑑 from the BS. The overhead is
balanced in between the 𝑐𝑙𝑢𝑠ℎ𝑒𝑎𝑑 in inter-cluster and intra-cluster communication. Here one 𝑣𝑐 picks the
clushead along, then it transmits the 𝑐𝑙𝑜𝑠𝑢𝑟𝑒_𝑚𝑠𝑔(𝑥, 𝑥𝑐𝑙𝑢𝑠ℎ𝑒𝑎𝑑 , 𝑑𝑖𝑠𝑥−𝑐𝑙𝑢𝑠ℎ𝑒𝑎𝑑𝑥 ,𝑅𝑥 , 𝑠𝑎𝑟𝑥 ) for the 𝑐𝑙𝑢𝑠ℎ𝑒𝑎𝑑
and completes the cluster, where 𝑥𝑐𝑙𝑢𝑠ℎ𝑒𝑎𝑑 is the reference of the cluster head and 𝑠𝑎𝑟𝑥 denotes the sampling
rate.
Algorithm 1 and Algorithm 2 present two-step DSHR developed. Algorithm 1 is first step of DSHR.
Moreover, sensing range optimization is carried out with respect to big data sensing for large deployment of
sensor nodes and data gathering through above two-phase hybrid model.

Dual step hybrid routing protocol for network lifetime enhancement in WSN-IoT … (Kalpavi C. Yankanaik)
328  ISSN: 2089-4864

Algorithm 1. First step cluster-based routing (phase 1)

Step 1: BS communicates the 𝐵𝑆_𝐼𝑛𝑖𝑡_𝑚𝑠𝑔 in the radius R
Step 2: for(every node 𝑞𝑥 ) do
Step 3: If(node 𝑞𝑥 received 𝐵𝑆_𝐼𝑛𝑖𝑡_𝑚𝑠𝑔 then
Step 4: Compute disx−BS according to the standard
Step 5: Communicate 𝑠𝑡𝑎𝑟𝑡_𝑚𝑠𝑔 in R/2 to swap the information;
Step 6: Fetch the nodes adjacency degree
Step 7: Compute the signal-to-noise ratio 𝑠𝑛𝑟𝑥
Step 8: Evaluate its 𝑈𝐿𝑥
Step 9: Comparison with the adjacent nodes
Step 10: If 𝑈𝐿𝑥 is largest then
Step 11: Change its state to 𝑐𝑙𝑢𝑠ℎ𝑒𝑎𝑑;
Step 12: Choose BS as the parent node;
Step 13: Communicate 𝑐𝑙𝑢𝑠ℎ𝑒𝑎𝑑 − 𝑚𝑠𝑔() in R;
Step 14: else
Step 15: Change its state to 𝑣𝑐;
Step 16: end if
Step 17: end if
Step 18: end for

Algorithm 2. Second step cluster-based routing (phase 2)

Step 1: Initialize 𝑙 = 2; 𝑙 𝑖𝑠 𝑡ℎ𝑒 𝑙𝑒𝑣𝑒𝑙
Step 2: While(node which is not clustered)
Step 3: for(every node 𝑞𝑥 ) do
Step 4: if (node 𝑞𝑦 received 𝑐𝑙𝑢𝑠ℎ𝑒𝑎𝑑 − 𝑚𝑠𝑔 from 𝑐𝑙𝑢𝑠ℎ𝑒𝑎𝑑𝑥 and 𝑅𝑦𝑜𝑢𝑡 >𝑅𝑙𝑜𝑤−𝑝𝑒𝑎𝑘, 𝑞𝑦 . 𝑠𝑡𝑎𝑡𝑒 ≠ 𝑣𝑐 of
𝑐𝑙𝑢𝑠ℎ𝑒𝑎𝑑𝑥, 𝑑𝑖𝑠𝑐𝑙𝑢𝑠ℎ𝑒𝑎𝑑−𝐵𝑆 then
Step 5: Evaluate 𝑑𝑖𝑠𝑦−𝐵𝑆 = 𝑚𝑖𝑛{𝑑𝑖𝑠𝑐𝑙𝑢𝑠ℎ𝑒𝑎𝑑 𝑥−𝐵𝑆 +𝑑𝑖𝑠𝑐𝑙𝑢𝑠ℎ𝑒𝑎𝑑 𝑥−𝑦 };
Step 6: Communicate 𝑠𝑡𝑎𝑟𝑡 − 𝑚𝑠𝑔() in R/2 to swap local information;
Step 7: Fetch the nodes adjacency degree
Step 8: Compute the signal-to-noise ratio 𝑠𝑛𝑟𝑥
Step 9: Evaluate its 𝑈𝐿𝑥
Step 10: Comparison with the adjacent nodes
Step 11: If 𝑈𝐿𝑥 is largest then
Step 12: Change its state to 𝑐𝑙𝑢𝑠ℎ𝑒𝑎𝑑;
Step 13: for (each 𝑙 − 1 level 𝑐𝑙𝑢𝑠ℎ𝑒𝑎𝑑)do;
Step 14: estimate the forwarding cost;
Step 15: end for
Step 16: Choose clushead with the lowest forwarding cost as the clushead
Step 17: Update the distance to BS;
Step 18: Communicate 𝑐𝑙𝑢𝑠ℎ𝑒𝑎𝑑 − 𝑚𝑠𝑔;
Step 19: else
Step 20: Change its state to 𝑣𝑐;
Step 21: end if
Step 22: 𝑙 = 𝑙 + 1;
Step 23: end for
Step 24: end while
Step 25: for(each 𝑣𝑐𝑦 ) do
Step 26: for(each 𝑐𝑙𝑢𝑠ℎ𝑒𝑎𝑑|𝑑𝑖𝑠𝑐𝑙𝑢𝑠ℎ𝑒𝑎𝑑−𝑦 < 𝑅 )𝑑𝑜
Step 27: evaluate joining cost
Step 28: end for
Step 29: Choose clushead with the lowest joining cost as its parent node;
Step 30: end for
Step 31: for(each node 𝑞𝑥 ) do
Step 32: If 𝑅𝑥𝑜𝑢𝑡 <𝑅𝑙𝑜𝑤−𝑝𝑒𝑎𝑘, then node 𝑞𝑥 switches to an idle state
Step 34: else
Step 35: end if
Step 36: end for

Int J Reconfigurable & Embedded Syst, Vol. 13, No. 2, July 2024: 323-331
Int J Reconfigurable & Embedded Syst ISSN: 2089-4864  329

4. PERFORMANCE EVALUATION
WSN has various range of application, which produces enormous amount of data; hence, this
research work adopts the sensoria simulator [25] for large WSN scenario that allows the deployment of any
number of sensor nodes. Furthermore, in this section, our proposed algorithm DSHR is evaluated by
considering the parameters like network lifetime, communication overhead and the number of active nodes
for 1,000 nodes, 1,500 nodes and 2,000 nodes. The system configuration used in developing our proposed
model is the research carried out through the Windows 11 operating system (OS) with the quad-core
processor, 2 GB NVIDIA graphics packed with 16 GB of RAM. The framework used is the .NET simulator
known as the sensoria simulator, which functions in the C # programming language. Moreover, comparison
is carried out with existing LEACH protocol. Table 1 shows the parameter selected to carry out the
simulation.

Table 1. Parameter details

Network parameter Value
Network size selected 50m𝑥50m
Nodes considered for simulation 1,000, 1,500, and 2,000
Nodes initial energy 0.2J
Number of base station 1
Nodes initial energy 0.2J
Simulator Sensoria

4.1. Network lifetime

Generally, a network depicts the time duration during which the network is functional. This is an
essential parameter for performing the task. The more the network lifetime the better the performance of the
model. Figure 3 shows the network lifetime for 1,000 nodes. The comparative analysis of the existing system
with the proposed system is carried out; a graph is plotted by comparing the network lifetime for 1,000 nodes
we can see that in the existing system it lasts for a short period whereas in the proposed system we can see
the network lifetime is increased and lasts longer for 1,000 nodes. ES represents the existing approach as well
as PS represents the proposed approach.

Network Lifetime_1000
1200
Number of Nodes

1000
800
600
400
200
0
1

1171
131
261
391
521
651
781
911
1041

1301
1431
1561
1691
1821

Number of Rounds
ES PS

Figure 3. Network lifetime for 1,000 nodes

Figure 4 shows the network lifetime for 1,500 nodes. The comparative analysis of the existing
system with the proposed system is carried out. A graph is plotted by comparing the network lifetime for
1,500 nodes we can see that in the existing system it lasts for a short period whereas in the proposed system
we can see the network lifetime is increased and lasts longer for 1,500 nodes.
Figure 5 shows the network lifetime for 2,000 nodes. The comparative analysis of the existing
system with the proposed system is carried out. A graph is plotted by comparing the network lifetime for
2,000 nodes we can see that in the existing system it lasts for short period whereas in the proposed system we
can see the network lifetime is increased and lasts longer for 2,000 nodes.

Dual step hybrid routing protocol for network lifetime enhancement in WSN-IoT … (Kalpavi C. Yankanaik)
330  ISSN: 2089-4864

Network Lifetime_1500 Network Lifetime_2000

Number of Nodes 2000 3000

Number of Nodes
1500
2000
1000
500 1000

0 0

1541
1
141
281
421
561
701
841
981
1121
1261
1401

1681
1821

701

1681
1
141
281
421
561

841
981
1121
1261
1401
1541

1821
Number of Rounds Number of Rounds
ES PS ES PS

Figure 4. Network lifetime for 1,500 nodes Figure 5. Network lifetime for 2,000 nodes

4.2. Comparative analysis

Table 2 shows the comparative analysis over the LEACH protocol over various nodes i.e. 1,000,
1,500 and 2,000. Here we see the improvisation % for different number of nodes. At 2,000 node we get the
maximum improvisation.

Table 2. Improvisation over the existing model

Parameters Network lifetime
No. of sensor nodes 1,000 1,500 2,000
Improvisation 2.7224% 16.421% 19.056%

5. CONCLUSION
The lifespan of a WSN might be impacted by the routing protocol's energy consumption because
tiny sensor nodes are sometimes challenging to recharge after deployment. This research work develops a
novel DSHR protocol, which helps in routing with respect to clustering. DSHR is evaluated considering the
large number of nodes with 100, 1,500 and 2,000 in terms of network lifetime and model is proved to be
marginally efficient than the existing LEACH protocol. DSHR solves the optimal routing mechanism;
however, considering the scenario of big data in WSN, model would be evaluated further considering
different parameter.

REFERENCES
[1] S. Rani, S. H. Ahmed, R. Talwar, and J. Malhotra, “Can sensors collect big data? An energy-efficient big data gathering algorithm
for a WSN,” IEEE Transactions on Industrial Informatics, vol. 13, no. 4, pp. 1961–1968, Aug. 2017, doi:
10.1109/TII.2017.2656899.
[2] K. L.-M. Ang, J. K. P. Seng, and A. M. Zungeru, “Optimizing energy consumption for big data collection in large-scale wireless
sensor networks with mobile collectors,” IEEE Systems Journal, vol. 12, no. 1, pp. 616–626, Mar. 2018, doi:
10.1109/JSYST.2016.2630691.
[3] T.-K. Dao, J. Yu, T.-T. Nguyen, and T.-G. Ngo, “A hybrid improved MVO and FNN for identifying collected data failure in
cluster heads in WSN,” IEEE Access, vol. 8, pp. 124311–124322, 2020, doi: 10.1109/ACCESS.2020.3005247.
[4] K. Wang, C.-M. Yu, and L.-C. Wang, “DORA: A destination-oriented routing algorithm for energy-balanced wireless sensor
networks,” IEEE Internet of Things Journal, vol. 8, no. 3, pp. 2080–2081, Feb. 2021, doi: 10.1109/JIOT.2020.3025039.
[5] I. Tomić and J. A. McCann, “A survey of potential security issues in existing wireless sensor network protocols,” in IEEE Internet
of Things Journal, vol. 4, no. 6, pp. 1910-1923, Dec. 2017, doi: 10.1109/JIOT.2017.2749883.
[6] C. Xu, Z. Xiong, G. Zhao, and S. Yu, “An energy-efficient region source routing protocol for lifetime maximization in WSN,”
IEEE Access, vol. 7, pp. 135277–135289, 2019, doi: 10.1109/ACCESS.2019.2942321.
[7] S. Al-Otaibi, A. Al-Rasheed, R. F. Mansour, E. Yang, G. P. Joshi, and W. Cho, “Hybridization of metaheuristic algorithm for
dynamic cluster-based routing protocol in wireless sensor networksx,” IEEE Access, vol. 9, pp. 83751–83761, 2021, doi:
10.1109/ACCESS.2021.3087602.
[8] T. Kaur and D. Kumar, “MACO-QCR: multi-objective ACO-based QOS-aware cross-layer routing protocols in WSN,” IEEE
Sensors Journal, vol. 21, no. 5, pp. 6775–6783, Mar. 2021, doi: 10.1109/JSEN.2020.3038241.
[9] E. F. A. Elsmany, M. A. Omar, T.-C. Wan, and A. A. Altahir, “EESRA: energy efficient scalable routing algorithm for wireless
sensor networks,” IEEE Access, vol. 7, pp. 96974–96983, 2019, doi: 10.1109/ACCESS.2019.2929578.
[10] Y. Xu, W. Jiao, and M. Tian, “An energy-efficient routing protocol for 3D wireless sensor networks,” IEEE Sensors Journal,
vol. 21, no. 17, pp. 19550–19559, Sep. 2021, doi: 10.1109/JSEN.2021.3086806.
[11] H. E. Alami and A. Najid, “ECH: An enhanced clustering hierarchy approach to maximize lifetime of wireless sensor networks,”
IEEE Access, vol. 7, pp. 107142–107153, 2019, doi: 10.1109/ACCESS.2019.2933052.

Int J Reconfigurable & Embedded Syst, Vol. 13, No. 2, July 2024: 323-331
Int J Reconfigurable & Embedded Syst ISSN: 2089-4864  331

[12] S. A. Sert and A. Yazici, “Optimizing the performance of rule-based fuzzy routing algorithms in wireless sensor networks,” in
2019 IEEE International Conference on Fuzzy Systems (FUZZ-IEEE), New Orleans, LA, USA: IEEE, Jun. 2019, pp. 1–6. doi:
10.1109/FUZZ-IEEE.2019.8858920.
[13] G. Arya, A. Bagwari, and D. S. Chauhan, “Performance analysis of deep learning-based routing protocol for an efficient data
transmission in 5G WSN communication,” IEEE Access, vol. 10, pp. 9340–9356, 2022, doi: 10.1109/ACCESS.2022.3142082.
[14] N. Ma, H. Zhang, H. Hu, and Y. Qin, “ESCVAD: An energy-saving routing protocol based on Voronoi adaptive clustering for
wireless sensor networks,” IEEE Internet of Things Journal, vol. 9, no. 11, pp. 9071–9085, Jun. 2022, doi:
10.1109/JIOT.2021.3120744.
[15] M. U. Younus, M. K. Khan, and A. R. Bhatti, “Improving the software-defined wireless sensor networks routing performance
using reinforcement learning,” IEEE Internet of Things Journal, vol. 9, no. 5, pp. 3495–3508, Mar. 2022, doi:
10.1109/JIOT.2021.3102130.
[16] R. Kumar, U. Venkanna, and V. Tiwari, “EOMCSR: An energy optimized multi-constrained sustainable routing model for
SDWSN,” IEEE Transactions on Network and Service Management, vol. 19, no. 2, pp. 1650–1661, Jun. 2022, doi:
10.1109/TNSM.2021.3130661.
[17] A. F. Raslan, A. F. Ali, A. Darwish, and H. M. El-Sherbiny, “An improved sunflower optimization algorithm for cluster head
selection in the internet of things,” IEEE Access, vol. 9, pp. 156171–156186, 2021, doi: 10.1109/ACCESS.2021.3126537.
[18] S. Lata, S. Mehfuz, S. Urooj, and F. Alrowais, “Fuzzy clustering algorithm for enhancing reliability and network lifetime of
wireless sensor networks,” IEEE Access, vol. 8, pp. 66013–66024, 2020, doi: 10.1109/ACCESS.2020.2985495.
[19] H. Ali, U. U. Tariq, M. Hussain, L. Lu, J. Panneerselvam, and X. Zhai, “ARSH-FATI: A novel metaheuristic for cluster head
selection in wireless sensor networks,” IEEE Systems Journal, vol. 15, no. 2, pp. 2386–2397, Jun. 2021, doi:
10.1109/JSYST.2020.2986811.
[20] A. A.-H. Hassan, W. M. Shah, A.-H. H. Habeb, M. F. I. Othman, and M. N. Al-Mhiqani, “An improved energy-efficient
clustering protocol to prolong the lifetime of the WSN-based IoT,” IEEE Access, vol. 8, pp. 200500–200517, 2020, doi:
10.1109/ACCESS.2020.3035624.
[21] V. Vimal et al., “Clustering isolated nodes to enhance network’s life time of WSNs for IoT applications,” IEEE Systems Journal,
vol. 15, no. 4, pp. 5654–5663, Dec. 2021, doi: 10.1109/JSYST.2021.3103696.
[22] D. Lin, L. Gao, and W. Min, “A social welfare theory-based energy-efficient cluster head election scheme for WSNs,” IEEE
Systems Journal, vol. 15, no. 3, pp. 4492–4502, Sep. 2021, doi: 10.1109/JSYST.2020.3010868.
[23] M. Gamal, N. E. Mekky, H. H. Soliman, and N. A. Hikal, “Enhancing the lifetime of wireless sensor networks using fuzzy logic
leach technique-based particle swarm optimization,” IEEE Access, vol. 10, pp. 36935–36948, 2022, doi:
10.1109/ACCESS.2022.3163254.
[24] Y. Han, G. Li, R. Xu, J. Su, J. Li, and G. Wen, “Clustering the wireless sensor networks: a meta-heuristic approach,” IEEE
Access, vol. 8, pp. 214551–214564, 2020, doi: 10.1109/ACCESS.2020.3041118.
[25] J. N. Al-Karaki and G. A. Al-Mashaqbeh, “SENSORIA: A new simulation platform for wireless sensor networks,” in 2007
International Conference on Sensor Technologies and Applications (SENSORCOMM 2007), Valencia, Spain: IEEE, Oct. 2007,
pp. 424–429. doi: 10.1109/SENSORCOMM.2007.4394958.

BIOGRAPHIES OF AUTHORS

Kalpavi C. Yankanaik presently working as an assistant professor at Dayananda

Sagar Academy of Technology and Management, Bangalore with an experience of 15+ years
in teaching. Completed B.E. in electronics and communication engineering, in 2006 from
GMIT, Davangere. Obtained her M.Tech. in DECS stream from MCE, Hassan, under VTU
University. She has published 7 papers in international journals, participated in 8
international/national conferences. She attended 50+ workshops, seminars, webinars and FDPs.
Her area of interest are sensor networks, computer networking, IoT, and wireless sensor
networks. She can be contacted at email: [email protected].

Dr. Sujatha B. Munivenkatappa is a professor in the Department of Electronics

and Communication Engineering, Acharya Institute of Technology, Bangalore. She obtained
her B.E. degree in electronics from Sri Siddhartha Institute of Technology, Bangalore
University and M.E. degree in electronics and communication from University Visvesvaraya
College of Engineering, Bangalore University and Ph.D. from University Visvesvaraya
College of Engineering, Bangalore University, in the area of image processing. She can be
contacted at email: [email protected].

Dual step hybrid routing protocol for network lifetime enhancement in WSN-IoT … (Kalpavi C. Yankanaik)