Content uploaded by P Chandrashaker Reddy
Author content
All content in this area was uploaded by P Chandrashaker Reddy on Sep 22, 2022
Content may be subject to copyright.
Send Orders for Reprints to reprints@benthamscience.net
Int. J. Sens. Wirel. Commun. Control, xxxx, xx, x-x 1
RESEARCH ARTICLE
2210-3279/xx $65.00+.00 © xxxx Bentham Science Publishers
IoT-Enabled Energy-Efficient Multipath Power Control for Underwater
Sensor Networks
Pundru Chandra Shaker Reddy1,* and Yadala Sucharitha2
1School of Computing and Information Technology, REVA University, Bengaluru, Karnataka, India; 2Computer Science
and Engineering, CMR Institute of Technology, Hyderabad, India
Abstract: Aims & Background: Energy saving or accurate information transmission within resource
limits are the major challenges for IoT Underwater Sensing Networks (IoT-UWSNs) on the Internet.
Conventional transfer methods increase the cost of communications, leading to bottlenecks or com-
promising the reliability of information supply. Several routing techniques were suggested using
UWSN to ensure uniform transmission of information or reduce communication latency while pre-
serving a data battery (to avoid an empty hole in the network).
Objectives and Methodology: In this article, adaptable power networking methods based on the Fast-
est Route Fist (FRF) method and a smaller amount of the business unit method are presented to solve
the problems mentioned above. Both Back Laminated Inter Energy Management One (FLMPC-One)
networking method, that employs 2-hop neighborhood knowledge, with the Laminated Inter Energy
Management Two (FLMPC-Two) networking procedure, which employs 3-hop neighborhood data,
were combined to create such innovative technologies (to shortest path selection). Variable Session
Portion (SP) and Information Speed (IS) were also considered to ensure that the suggested method is
flexible.
Results and Conclusion: These findings show that the suggested methods Shortest Path First without
3-hop Relatives Data (SPF-Three) or Broadness Initial Searching for Shortest Route and Breadth First
Search to 3-hop Relatives Data (BFS-Three) successfully developed (BFS-SPF-Three). These sug-
gested methods are successful in respect of minimal Electric Cost (EC) and Reduced Transmission
Drop Rates (RTDR) given a small number of operational sites at a reasonable latency, according to
the simulated findings.
A R T I C L E H I S T O R Y
Received: March 28, 2022
Revised: April 13, 2022
Accepted: April 25, 2022
DOI:
10.2174/2210327912666220615103257
Keywords: Underwater Sensor network, electric cost, reduced transmission drop rates, information speed, laminated inter en-
ergy management, maritime information.
1. INTRODUCTION
Water plays a vital role in human existence additionally
as other natural life, which covers the earth in various de-
signs as lakes, seas, rivers, and ponds. Scientific advance-
ments or permitted sensors should be utilized for the exami-
nation of nature's lakes, forests, and waterway conditions.
The sensors are epitomized by savvy registering and shrewd
detecting which can speak with one another. The UWSNs
comprise a large number of autonomous sensor hubs with
indistinguishable hubs and limited energy [1].
UWSN has gotten sufficient interest from scientists in
previous decades to encompass a wide variety of uses, such
*Address correspondence to this author at the School of Computing and
Information Technology, REVA University, Bengaluru, Karnataka, India;
E-mail: chandu.pundru@gmail.com
as maritime species surveillance, maritime information col-
lecting, catastrophe mitigation, tracking, and so on. UWSNs
are made up of a variety of networks, streams, sounds, and
other components. Those networks receive information
packages from each parent network while dealing with vari-
ous disturbances or send those onto their closest sinks on the
surfaces through various pathways. Microwave frequencies
employed in the earthly context are generally suitable for
usage in UWSNs due to their rapid absorption and limited
transmission range [2]. Like the result of its lower absorptiv-
ity, audio transmissions appear as a viable option for com-
municating in liquid.
There will be numerous most recent developments
UWSNs that are gone over quick development in various
fields. Cutting edge developments in correspondence control
hubs of sensors that are submerged additionally its ways to
deal with imparting each other likewise to give administra-
2 Int. J. Sens. Wirel. Commun. Control, xxxx, Vol. xx, No. x Reddy and Sucharitha
tion for clients additionally conform to changing necessities
and needs [3]. This development has become the driving
energy in Industry 4.0 which upholds the execution of the
Industry Internet of Things (I-IoT). I-IoT permits the infor-
mation sent cautiously to the cloud to conspire from the few
sensor hubs additionally, it will be refreshed on occasion [4].
Industry IoT is the blend of business remote frameworks and
innovations of IoT similar to an exceptional framework that
contains machines, networks that have cloud, terminals, and
gear. Hence, momentum advancements in the IoT field and
UWSNs lead to a resuscitated interest in the Internet of Un-
derwater Things (IoUT). IoUT licenses the hubs that are
submerged for speaking with each other by procuring and
imparting data at the rapid web to surface stations [5].
Sound propagation in shallow water is affected by the
surface reflections, though sound multiplication in deep wa-
ter is impacted by the base reflections, bringing about a sig-
nificant and temperamental transmission break in the acous-
tic correspondence, which requires more power [6]. The
multipath impact, which causes inter-symbol impediment
and yields auditory transmission of information that becomes
troublesome and incorrect, is the fundamental driver of pow-
erless acoustic signs. When contrasted with a level acoustic
channel, the upward acoustic sign is lower affected by the
multipath impact [7].
While sending pockets to the quick hubs, most present
routing techniques utilize the sensor hubs' greatest exchange
power. The fast retention of energy by the sensor hubs wraps
this cycle up. The usage of a high communication capacity,
then again, as often as possible outcomes in expanded chan-
nel obstruction [8]. The unbalanced moved information load
division causes a fast drop in the energy hubs, bringing about
network energy division. Because of the energy opening,
some sensor hubs terminate before others. This energy hole
issue makes the organization consume a ton of energy and
abbreviates its life expectancy [9]. Existing methodologies
can be utilized to eliminate additional heaps on hubs near the
sink hub. Because of the substantial interest, the hubs nearest
to the sink ingest assets rapidly, while hubs are further away
from channel assets gradually [10]. For information assem-
bling, most existing UWSNs propose utilizing at least one
static sink at the water's surface. Different steering proce-
dures are utilized for getting information from the hubs of
the sensor to the nearby sinks. While the organization's size
expands, this arrangement has huge adaptability issues.
Moreover, the UWSNs placed near the sink quickly consume
its energy and produce energy openings, constraining the
excess hubs to convey over significant distances and bring-
ing about fast energy misfortune. Accordingly, the network's
general lifetime is brought down [11, 12].
Auditory impulses were intense near the transmitter
source yet were reduced by disturbance, as stated by its re-
searchers in the study [13]. Furthermore, the level of sound
is lowest in sea depths and highest in the intertidal zone. As a
consequence, low route durations reduce package duplication
and significant power wastage, resulting in fewer accidents
and carton drops. The battery lifetime of a sensing cluster
was a significant element in UWSN networking. To reduce
cost EC, increase information gathering, or improve infor-
mation dependability without a reasonable latency, the elec-
tricity transport method is needed [14].
SPF-Three or BFS-SPF-Three were the 2 forwardings in-
ter voltage regulation algorithms presented in this paper.
Those systems seek to eliminate parcel forwarding by for-
warding information bits. This additionally avoids empty
gaps by decreasing the EC and RTDR at a reasonable laten-
cy. Data transfers enhance the edge latency. Such data trans-
fers have an impact on the underground program's efficiency
concerning minimal Pitch Receiving Rate (PRR). The sys-
tem is split into several levels to contain the EC issue by
taking its quickest way to its target. Channel networks
broadcast connectionless datagrams, whereas crossover net-
works broadcast multiplex datagrams [15]. When sending
information to its target, this concept uses a selfish method.
Suggested methods pick the following step neighborhood for
its present shipper following confirming 3-hop friends for
information transfer. Such following step choice aids in min-
imizing empty gap locations, therefore extending the system
lifespan and ensuring dependable information transmission
[16].
2. MATERIALS AND METHODS
All the present methods, which were power, economical,
and ensure information dependability with optimum speed,
are evaluated many all results. Inter through a straight route
or inter through several pathways were the 2 kinds of com-
plex navigation techniques now in use. Because prevent
empty gap zones, the solitary route idea is employed for min-
imal EC. Inter sequencing, on the other hand, ensures that
information is delivered to its intended location reliably. Fig.
(1) shows all the above material in a graphical format.
A Geographical and Devious Forwarding using Height
Correction (GEDAR) for UWSNs was suggested by the au-
thors [17]. Multicast geographical adaptive forwarding was
used by this technology. As a result, anycast was used to
choose the following probable neighborhood. This suggested
technique uses restoration modes to control the blank hole
area and transfer the vertices to a different position following
the thickness adjustment restoration technique. GEDAR suc-
cessfully addressed the blank holes area issue [18]. Its PDR
was additionally enhanced thanks to the profundity adjusting
system. Its location-relevant indicators, on the other hand,
used a lot of power and exacerbated the overall final latency
in information package transmission [19].
The authors propose a hydro-cast networking system en-
abling delivering communications packages to their destina-
tions based on water level statistics [20]. These information
streams could always be routed vertically using these mul-
ticast methods. A selfish technique is used to advance infor-
mation from a given origin to a selection of shippers. The
information packages are not sent by the recipient unless all
routing stations have failed [21]. Whenever there is a chance
that the information will reach empty gap areas, it is moved
to greater-level networks. In such a scenario, information is
IoT-Enabled Energy-Efficient Multipath Power Int. J. Sens. Wirel. Commun. Control, xxxx, Vol. xx, No. x 3
routed down the sink via multiple routes. The system's de-
pendability is improved by delivering DR to shippers via
several routes [22]. That technique assisted with its channel's
avoidance of empty gap areas. A HYDROCAST method, on
the other hand, should pay the expense of combining fuel or
final latency at the same time.
Owing it appears to their wide scope of utilizations,
UWSNs stand out from scientists in the new age. Different
exploration investigations of route procedures for UWSNs
were at that point given [23], with the directing conventions
being arranged by the routing strategy. There are two sorts of
route procedures for UWSNs: conventions that depend on
confinement and conventions that are liberated from re-
striction. The presence of endpoints is expected by the re-
striction-based directing convention to compute the route
course from the group to the source. Taking into account
this, the conventions that are liberated from confinement lays
out the pathways to the source because of the significant
worth of the identifier group. The strain locators on the find-
er hubs are utilized to decide the significance of the group.
With respect to perseverance, the restriction-free convention
beats the others. On the off chance that the framework, and
differ the courses can be made using significance because of
the adaptability of the endpoints.
Sivakumar proposed a new Layer Inter Router Manage-
ment (LMPC) interface. LMPC transmits multiple duplicates
of digital information to a target via several pathways. The
suggested method introduces a ternary branch generating an
idea to ensure information dependability [24]. The ECS was
improved by creating a digital forest between the origin clus-
ters of the target component. Sparsity region formation with
arbitrarily placed units, on the other hand, results in trans-
mission loss and the creation of un-sensed zones in its net-
works [25].
FLMPC-One and FLMPC-Two were 2 insight network-
ing systems that were introduced by Pavan et al. [26]. All
suggested procedures were based on LMPC's beneficial fea-
tures. FLMPC differs from LMPC because it creates a tree
structure using sensors rather than its supply network it uses
with crossing network idea to solve empty hole areas issue.
There were less bravery and strength with the suggested
methods. The use of 3-hop friends and the construction of a
leaf node, on the other hand, resulted in a large EC.
Khan et al. [27] inspected the organization toughness,
inertness cost, request coordinating, and powerful nature of
various UWSN network strategies. Due to the extended
spread distance and incredible bunch movement, the frame-
work requires 100% assurance. The bunch of CEOs and pio-
neers in UWSNs are picked in light of the area of terminals,
such as made bundles, the significance of groups, power use,
and data slack. A group’s strategy ought to have a quick unit
transport rate, low dormancy, and a drawn-out interface
lifecycle to get extraordinary web speed. This article goes
over some gathering procedures from top to bottom.
Suresh et al. [28] presented a cluster dependent method,
which empowers finders to create, bunches given their tall-
ness and strength. The Energy Efficient directing convention
is supplied to layers and inconsistent bunches (EERBLC), a
restriction-free steering framework, picks the voyaging
course and relies upon association execution and excess
power. It is accepted that the singular locator part doesn't
need its actual location to shape a gathering. A hub's expense
is determined in view of its overflow power and moving ex-
tent. The length of the bunched neck and the place of end-
points as indicated by the source are not considered in this
convention's underlying group decision component. If end-
points go about as a cluster sets out toward a lengthy period,
they might shape a problem area, bringing about a perished
site.
Hemalatha et al. [29] isolated framework establishment
into sections. The MLCEE (multi-facet group-based energy-
productive) directing convention expands association span
while limiting transmission point slack. The MLCEE con-
vention assists the server with deciding its layer prior to be-
ginning to appropriate data to fabricate a group. Because of
the link organization's different intricacy planes, every hub
assumes the liability of the transporter in light of its overflow
power and possibility.
Some other gathering technique approach for multi-jump
transportation in UWSNs was proposed by Thangamani et
al. [30]. The framework empowers hubs to change their
power usage notwithstanding keeping a high web network. A
hub should contact neighbors inside the proficient associa-
tion district to utilize the energy-ideal clustering model. Each
unit appraises the general correspondence slack among it and
the source however at that point picks if to shape a gathering
chief in view of that number. The hubs convey data streams
Fig. (1). Depth-based protocols are in a visual format. (A higher resolution / colour version of this figure is available in the electronic copy of
the article).
4 Int. J. Sens. Wirel. Commun. Control, xxxx, Vol. xx, No. x Reddy and Sucharitha
to the bunch expert or directly to the sink, adjusting the hub's
power use.
Chen et al. [31] suggested to UWSNs a method based
upon weighted depth and forwarded region divide (WDFAD-
DBR). This is performed to improve information dependabil-
ity by lowering the likelihood of information packages enter-
ing empty gap areas. To prevent empty hole areas, these re-
searchers calculated the total height variations between the
origin nodes to the following predicted hop site [32].
Throughout this post, circuit conflict is used to do conceptual
research. Our suggested methodology effectively achieves
fuel efficiency on information dependability. In sparsity are-
as, on the other hand, the network has an impact on the over-
all Protocol Delivering Rate (PDR), which is affected by the
propagating and execution latency at each trip point.
In the UWSN, Ye et al. [33] presented the Rectangular
Holes Correction Technology (SHORT) methodology. A
circular restoration method is proposed. The technique pre-
vents power and service gaps. If a node is going to expire, it
sends a management signal to all companions in the method.
As a result, competitors no longer relay messages to that
station. To address this service gap, a sensing node from a
busy zone is inserted in that area while guaranteeing that
there are no services gaps elsewhere in the system. Those
vertices having concealed crossing polygons are more likely
to migrate to a different place, therefore closing the coverage
gap [34]. That technique improves the show's capacity and
lifespan at the expense of a significant final latency.
The system RE-PBR (Dependable Power Pneumatically
Forwarding) is suggested by Fuada et al. [35]. RE-PBR is
pneumatically a networking system that is both dependable
and power economical. Again, during choice, routing hubs
approaching their endpoint, connection prominence, profun-
dity, and lasting power restrictions are taken into considera-
tion. Owing to its absence of irreversible routing for neigh-
boring, our method was enabled to establish a balancing EC.
Shi et al. [36] proposed a procedure for empty hole area
abatements. Rather than using its existing empty network
retrieving approach, the height modification approach is ex-
ploited to modify the location of networks in a horizontal
plane in this routing protocol. For each location, a pair-wise
network of neighborhood sites was kept so order that it de-
termines prospective sites for the target. By employing di-
rected networking across all directions, the method may
avoid empty sites. High EC correction, on the other hand, is
still presented by Lei et al. [37].
Khasawneh et al. [38] developed an enviro router (GOR)
method, which uses an irreversible sender node choice to
equalize the EC or empty hole areas in UWSNs. To decrease
the invasion issue and create well-informed judgments for
efficient power usage, the channel's whole area is divided
into cubes. Furthermore, by providing movable drains to
decrease network flow, information packages are retrieved
through empty zones. Sparsity areas, on the other side of the
network, affect the overall transmission duration of the sug-
gested methods.
Saliency Power Clusters (SEEC), Circle Saliency Elec-
tricity Clusters (CSEEC), or Notice Insight Saliency Elec-
tricity self-organizing maps (CDSEEC) are 3 effective trans-
portation algorithms described by Reddy et al. [39]. Sug-
gested procedure aided in our monitoring of UWSN areas
with rectangular and round geometry. Our suggested ap-
proach aims to reduce power consumption in sparse areas
and eliminate duplicate communications. The result is that
the power and transmission cost grows along with the scare
zone, because heat depreciation is proportional to the length,
as the scarce zone grows, so does the power gets wasted.
Draz et al. [40] proposed the Power Mega Router
(EAMR) technology. This suggested technique employs stat-
ic grouping. As a result of EAMR's effectiveness in reducing
communications latency, the show's lifespan has been ex-
tended. The show's flexibility is improved via cross-
communication. Clustering crowns, on the other hand, could
sustain weight in scarce areas [41].
Sucharitha et al. [42] accomplished specified criteria for
UWSNs, such as minimal EC, duplicated signal creation, and
empty gap prevention. In LMPC [43], the binary trees were
formed by each origin node, but with [44], a binary tree was
created by each crossing device. That network arrangement
led to redundant traffic creation & session transfer delays for
significant EC. Owing to excessive EC and PRR, as well as
frequent creation, and identical transmissions, such technol-
ogies cannot present a workable alternative [45]. To address
the above-mentioned issues, favorable aspects of either
FLMPC-one or FLMPC-two are explored, and 2 new compe-
tent procedures are presented by taking true efficiency fac-
tors, such as latency, EC, PRR, and RTDR, into account. To
obtain the lowest EC and RTDR with the least amount of
time, effective path choosing was considered under the ac-
count, while the recommended procedures were used to ob-
tain the lowest EC and RTDR without the least amount of
postponement. When contrasted with the connectionist, our
suggested procedure excelled in terms of empty gap preven-
tion by providing the overall lowest RTDR.
3. EXPERIMENTAL DESIGN
The optimum architecture for the quickest route choice
and the operation of the 'Protocol' method are addressed in
the chapter. After that, all current or suggested systems' net-
work designs are presented. To extend the paradigm of cur-
rent procedures, FLMPC-One and FLMPC-Two were com-
bined as FLMPC. This subsurface sensor transmitter trans-
mission was next explored. Subsequently, 2 methods, SPF-
Three and BFS-SPF-Three, were suggested for making rout-
ing selections using the 'Shortest Broadness initial minimal
route' method using 3-hop friend’s knowledge. The depend-
ability of information stream propagation or entry into an
empty gap area is minimized. Furthermore, through adopting
routing tables, all suggested methods effectively lessen the
EC (based on a greedy approach). Its optimum architecture
for quickest route choice, the ‘Routing Algorithms,' and the
system architecture of all current and new procedures are
addressed in the overall following subcategories.
IoT-Enabled Energy-Efficient Multipath Power Int. J. Sens. Wirel. Commun. Control, xxxx, Vol. xx, No. x 5
3.1. Dijkstra Algorithm
When that smallest route between node i to node k is
(Vi, Vk, Vj), where Vi is one vertex immediately ahead Vk,
therefore (Vi,…,Vk ) should represent its smallest route
between I to k. ’ Dijkstra's method selects the greatest lo-
calized route from surrounding edges to obtain that world-
wide lowest route. Some certain essential concepts were
given below to describe the system topologies of current
and planned procedures: Crossing vertices are vertices that
lie close to or at two levels. Ordinary networks are net-
works that feel network original information while sending
the datagrams to greater layer networks.
This system is made up of exterior gates or channel
routes, as well as crossing, ordinary, origin, and sinking
(son buoy) components. This hydrophone functions as an
aquatic integrated computer. Transport stations are arbitrar-
ily placed, enabling information transport in the deeper
oceans in our suggested procedure, with a minimal EC
goal. These relaying units were originally in a resting state
with very low EC. This becomes operational, therefore,
when connections receive information packages at the
origin and crossing networks. Once those relay networks
have finished participating in communications, they go
back to sleep. All suggested systems include recursive crea-
tion as their major characteristic, while SPF-Three has sev-
eral extra qualities. This method (derived from this “Dijks-
tra or BFS-SPF-Three” algorithm) identifies its unique
lowest route for the target by searching all the potential
quickest pathways and doing adaptive filtering to reduce
the EC duration.
FLMPC program's framework uses non-homogeneously
dispersed tiers to mitigate noisy impediments. Each crosso-
ver node in the present system stores multiple versions of
information and passes them via Internet broadcast. Its
basic goal is to counteract the impact until the package
reaches the intended son buoy. Its dispersion of strata was
determined by various sorts of sounds in the ocean depths,
i.e., ship sound was higher in shallower waters than in
deeper oceans. As a result, the levels in deep waters will be
nearer together. Figs. (2 and 3) depict the subsystem de-
signs for all suggested systems. Descriptions of the above-
mentioned, suggested, or current procedures are shown in
Fig. (4). Under our suggested procedure, it is necessary to
determine the quickest route having the lowest EC and
length. SPF-Three or BFS-SPF-Three becomes less effec-
tive as a result of their capacity to pick the quickest route.
The BFS-SPF three step-by-step is shown in Algorithm 1.
In this case, the network transmission area is split into sev-
eral uneven levels and narrows as it approaches the ocean
level in Fig. (5). This quadtree generating notion was bor-
rowed from previous techniques using 3-hop neighboring
knowledge to address the network impacts of packet colli-
sions and material losses. Several effective transport tech-
niques were presented in light of all the above mentioned
problems. These networking methods are described in full
further down.
Fig. (2). FLMPC-two system model. (A higher resolution / colour
version of this figure is available in the electronic copy of the arti-
cle).
Fig. (3). SPF-three system mode. (A higher resolution / colour ver-
sion of this figure is available in the electronic copy of the article).
Fig. (4). BFS-SPF-three system model. (A higher resolution / col-
our version of this figure is available in the electronic copy of the
article).
6 Int. J. Sens. Wirel. Commun. Control, xxxx, Vol. xx, No. x Reddy and Sucharitha
Algorithm 1: BFS-SPF-Three Pseudo code
Input: (Nodes, Initial Energy, Layers, Sinks, PS, DR,
Transmission and Receiving Power, Area)
1
for node i.e., Nodes do
2
Deploy simple nodes, cross and sink nodes in the
network
3
Track the IDs of nodes
4
Initiate the energies of nodes
5
Declare the type of nodes
6
end for
7
for layer i.e. Layers do
8
Identify the nodes regarding each layer
9
end for
10
for node i.e. Nodes do
11
Identify that how many cross nodes and simple nodes
exists in the neighbor of current nodes
12
if Node type == ’Cross’ && Neighbors exists > 0
then
13
calculate the depth from sea surface
14
Note the ID of the sensor node
15
Mark the node as cross node
16
Compute the distance using Equation (13)
17
else
18
for node i.e., Nodes do
19
Check for 3-hop neighbors
20
if 3-hop neighbors exist then
21
Calculate the depth from sea surface
22
Note the ID of the sensor node
23
Mark the node as normal node
24
end if
25
end for
26
end if
27
end for
28
for node i.e., Nodes do
29
Find void nodes to eliminate void hole regions
30
end for
31
Call the procedure to find potential-forwarder
32
for node i.e. Nodes do
33
for node n e Neighbor-table do
34
if | Neighbor (n) | ≥ 1 then
35
if | Neighbor (Neighbor (n)) | ≥1 then
36
if n == Cross node then
37
Potential node forwarder = n
38
Go to step 32
39
end if
40
end if
41
if | Cross node == 0 | then
42
for node i.e. Not void nodes do
43
if | Neighbor (Neighbor (n)) | ≥1 then
44
[Distance, Path]= BFS − SPF (Adjacency matrix,
Start ID, Final ID);
45
Save the complete shortest path
46
if | Neighbor (Neighbor (n)) | ≥ 1 then
47
Potential node forwarder = Path (2)
48
end if
49
end if
50
end for
51
end if
52
end if
53
end for
54
end for
55
Now data transmission starts from here
56
Node i starts receiving data packets
57
if i is a cross node then
58
Multi-cast the data packets
59
else
60
Unicast the data packets
61
end if
62
Output: (Minimum EC, A f f ordable PRR, A f f ord-
able delay, Minimum active nodes)
Fig. (5). Legends of the protocols. (A higher resolution / colour
version of this figure is available in the electronic copy of the arti-
cle).
IoT-Enabled Energy-Efficient Multipath Power Int. J. Sens. Wirel. Commun. Control, xxxx, Vol. xx, No. x 7
All suggested methods' transmission ideas, as well as au-
ditory waves and associated absorbing restrictions in the
UWSN context, are addressed here.
Eq. (1) was used to determine the abrupt increase in
transmission intensity across a distance ‘C’ and the frequen-
cy ‘E' [46].
𝑋𝐶,𝐸= 𝐶!×𝛼𝐸! (1)
Its absorptivity is ‘(E),' and the transmission length is the
geometrical dispersion of the information, which can be a
cylinder, practical, or spherical. These researchers use Equa-
tions to describe in [13]. Eq. (2).
𝛼𝐸!= !.!"!
!!!+!"!
!""!!+ 3.75 ×10!!𝐸+0.02 (2)
In this case, ‘E’ is recorded at KHz and ‘(𝛼𝐸!)' is rec-
orded in dB/Km. Various sound components (ship sound,
electric noise, and turbulent loudness) depart saltwater and
are designated by the letter ‘NR.' Eq. (3) was used to com-
pute the total noisy output indicated as ‘NP' and the spectrum
distribution for a specified frequency ‘E'. Applying Thorp's
theory, the connection between (E) 0 and (E). Based on
Thorp's theory, the audio wave attenuation increases as ‘F'
increases.
𝑀𝑄 𝐸= 𝑀𝑄!𝐸
!"
!!! (3)
‘MQ(E))' is evaluated in decibels and must be some-
where near the middle (1-NR). This reduction is proportional
to the length between the origin and the receiver. Eq. (4) was
used to compute the over ‘D'. Fig. (6) depicts the relationship
between absorption and frequency ratios.
𝑄!𝐸=
!!!!
!!!!!
!"
!!! (4)
The number of bytes without mistake employing broad-
band ‘B' is known as channel capability (abbreviated as ‘C').
Eqs. (5 and 6) are used to compute the signal to the quiet
ratio (SNR) and the real capability. The package failure ratio,
on the other hand, is represented by the letter ‘PER.'
𝐷=𝑏𝑎𝑛𝑑.𝑙𝑜𝑔!1+𝑆𝑖𝑔𝑛𝑎𝑙 𝑁𝑜𝑖𝑠𝑒 𝑅𝑎𝑡𝑖𝑜 5
𝑃𝑎𝑐𝑘𝑒𝑡 𝐸𝑟𝑟𝑜𝑟 = !
!!!(!"#$%& !""#")
(6)
H2 is a bi sensitivity measure based on PER, with the
formula H2 = (PER 1) 𝑙𝑜𝑔!(1 PER) (PER𝑙𝑜𝑔!Packet Error).
3.1.1. Cost Analysis using Dijkstra’s Algorithm
Dijkstra's Algorithm (DA) tracks down a most minimal
cost way between two hubs. The cost of a way between hub
n1 and hub n2 is the addition of the costs of the edges on that
path. It really processes the insignificant cost ways of all
hubs of the diagram which can be reached from a source hub
n1. The thought is to consider a set containing just hubs of
which the most minimal cost path to n1 is now known. This
set is expanded progressively, considering hubs which can be
gotten directly by an edge from one of the hubs previously
contained in the set. From these competitors, the one with
the best cost way to the source hub is added to the set.
The principle thought is to break the way between source
to objective into the source to any vertex u i.e., path (1 to u)
and from objective to any vertex v i.e., path (n to v) for all u
and v. The following are the means:
1. Perform a DA to track down the single source most
limited way for all the vertex from source hub 1 and store it
in a cluster as dist_from_source [ ].
2. Perform a DA to track down the single source
most limited way for all the vertex from source hub N and
store it in a cluster as dist_from_dest [ ].
3. Initialize the base cost (say minCost) as most ex-
treme worth.
4. Traverse the given edges and for each edges de-
crease the ongoing expense for half and update the base
expense as:
𝑚𝑖𝑛𝐶𝑜𝑠𝑡 =min (𝑚𝑖𝑛𝐶𝑜𝑠𝑡,𝑑𝑖𝑠𝑡_𝑓𝑟𝑜𝑚_𝑠𝑜𝑢𝑟𝑐𝑒[𝑢]+!
!
+
𝑑𝑖𝑠𝑡_𝑓𝑟𝑜𝑚_𝑑𝑒𝑠𝑡[𝑣]
Where,
c is the cost of current edge, dist_from_source[u] is cost
of path from node 1 to u and dist_from_source[v] is cost of
path from node v to N.
The time complexity of Depth based algorithm, if the en-
tire tree is traversed is O ( V ) O(V) O(V) where V is the
Fig. (6). The relationship between absorption and frequency. (A higher resolution / colour version of this figure is available in the electronic
copy of the article).
8 Int. J. Sens. Wirel. Commun. Control, xxxx, Vol. xx, No. x Reddy and Sucharitha
number of nodes. In the case of a graph, the time complexity
is O ( V + E ) O(V + E) O(V+E) where V is the number of
vertexes and E is the number of edges.
3.2. Transmission and Receiving Energy
The letters ‘𝐸!"#$%&'%%'($' stand for transmitting power,
whereas ‘𝐸!"!"#$#%&' stands for reception electricity.
‘𝐸!"#$%&'%%'($ ' is calculated using Eq. (7), while ‘𝐸!"#"$%$&' '
is calculated using Eq. (8). Transmit energy was indicated by
‘𝑃!"#$%&'%%'($' receiving energy is represented by
‘𝑃
!"#"$%$&',' length between n1 to nth nodes is indicated by
‘𝐷!"#$,' while information rates are indicated by ‘𝐷!"#$ ,'
accordingly. While ‘Node' indicates the entire number of
information packages, ‘𝐷!"#$ ' indicates the overall trip tallies
and ‘𝑇𝑜𝑡𝑎𝑙!"# !"#$%&s' indicates all overall trip qualifies.
Furthermore, the package duration is indicated in
‘𝑃
!"#$%!' entire residual power for networking networks is
indicated at ‘𝐸!!!"#"$%$&'' while entire incoming power by
networking stations following collecting information pack-
ages is represented by ‘𝐸!!!"#"$%$&'. Eqs. (9 and 10) were
used to determine the 𝐸!!!"#"$%$&'or 𝐸!!!"#"$%$&' (10).
𝐸!"#$%&'%%!"# = !!"#$%&'%%'($×!!"#$%!
!!"#$
×𝑁𝑜𝑑𝑒 (7)
𝐸!"#"$%$&' =
!!"#$%!
!!"#$
×𝑁𝑜𝑑𝑒 8
𝐸!!!"#"$%$&' = 𝑛𝑜𝑑𝑒 −
!"#$%!"# !"#$%&
!"!!
!"#$
!"#"!"#$%&'
𝐸!"#$%&'%%'($ (9)
𝐸!!!"#"$%$&' = 𝑛𝑜𝑑𝑒 −
!"#$%!"# !"#$%&
!"!!
!"#$
!"#"!"#$%&'
𝐸!"#$%&'%%'($ (10)
The starting power is denoted by ‘𝐼𝑛𝑖𝑡𝑖𝑎𝑙!"#$%&’ also
well is its channel's overall power ‘𝑇𝑜𝑡𝑎𝑙!"#$%& ’. Equation
11 is used to get the overall power.
𝑇𝑜𝑡𝑎𝑙!"#$%& = 𝐼𝑛𝑖𝑡𝑖𝑎𝑙!!"#$% −𝐸!!!"#"$%$&' +
𝐸!!!"#"$%$&' (11)
Because of the sound exposure frequency on the ocean
level relative to ocean depth, the suggested methods split the
system across uneven levels. When the incoming infor-
mation approaches, the top, the levels become nearer to one
another, as shown in Fig. (7). It occurs to reduce the impact
of sound in the UWSN setting. The main goal of the sug-
gested method is to improve the information from transmis-
sion dependability while lowering the transmission loss rate.
The equation gives the formula for an uneven length of lev-
els dispersion (Eq. 12).
𝐷𝑎,𝑏= !!!!!!!!!
!!!!!
,!!!!!!!!!
!!!!!
(12)
a1, b1, a2 and b2 were its terminal positions in this case.
As illustrated by Fig. (8), D(a, b) is a site for dividing. In this
diagram, position D splits the line into L1:L2, which de-
pends on the disturbance level. Because the crossing net-
works are evenly spaced, each transmission flows across
these with zero gaps.
Fig. (8). Division of layer.
Each node in the broadcast area maintains a neighboring
database using the suggested procedure. It disseminated the
information across the system. The origin cluster, target end-
point, position, and altitude 'yd' from its origin module are
all included in this statement. Each reception node uses the
Euclidean length, which is represented in Eq. (13), and com-
putes the spacing from the origin to the target node.
𝐷𝑖𝑠𝑡 !,!= 𝑎!− 𝑎!
!+𝑏!− 𝑏!
! 13
The dimensions of the origin and recipient nodes are (a1,
a2) and (b1, b2). Every detector keeps track of its origin ID,
position, thickness, and range from its companions in a data-
Fig. (7). SPF-three and BFS-SPF-three layered multi-path routing protocol forwarder node selection. (A higher resolution / colour version of
this figure is available in the electronic copy of the article).
IoT-Enabled Energy-Efficient Multipath Power Int. J. Sens. Wirel. Commun. Control, xxxx, Vol. xx, No. x 9
base. Its Coordinates (a, b) are derived from the controlled
signal, while a length is computed via Eq. (13) & its depth
'yd' was computed simply by subtracting the data type depth
of the ocean level. Several restrictions aid the suggested
methods in determining the best neighbors as shippers once
they have needed data.
𝐷𝑖𝑠𝑡 !,!≤ Transmission Range(Transmissionrange)Depthi>
Depthj
Those sensor cluster levels aid in locating the flow router
that is closest to the ocean's bottom. To avoid additional EC
and communication complexity, these suggested methods
only need knowledge about greater level nodes.
SPF-Three identifies prospective friends using an adja-
cent table using the quickest route during the stage. BFS-
SPF-Three uses proactive networking to locate the lowest
route with the least amount of power waste. The following
were the designs and associated techniques in specific:
Because they prevent empty areas, BFS-SPF-Three like-
wise similarly transmits communication packages as SPF-
Three following, guaranteeing knowledge of future 3-hop
friends at its present station. BFS-SPF finds its quickest
route amongst any accessible pathways, and then BFS-SPF-
Three does proactive networking. It chooses the quickest
route with the lowest EC and at the lowest length above the
water level. Algorithm 2 describes the choosing and propa-
gation of BFS-SPF-Three.
3.3. Binary Tree
During information package transfer by one node, the
preceding 2 requirements must be met.
• Straight communication requires the usage of a detector
or relay node.
• A ternary tree should have a crossing branch.
When a node is a basic sensing node, the entire message
is broadcast. Alternatively, the construction of a ternary tree
begins with a parent network serving as the roots and neigh-
boring networks serving as its branches. There are approxi-
mately 2 kid connections for every parental component. The
major features employed in the construction of the forest
under its suggested method are crossing nodes.
4. RESULTS AND DISCUSSION
The effectiveness of the suggested procedures, namely,
SPF-Three and BFS-SPF-Three, is examined in this chapter.
In addition, a comparison of the current and suggested pro-
cedures is given. All messages were sent between network
origin nodes to the network drain in all planned or current
technologies (son buoys in the surface of the ocean in greed-
iness manner). The key distinction is because the present
methods simply detect the nearest 2-hop or 3-hop neighbor-
hood to choose the optimal perspective (has a lower proba-
bility, avoid full void place). The suggested methods, on the
other hand, detect its following three-hop neighborhood to
select the greatest possible router. Furthermore, one can find
the quickest way between those shippers to the designated
buoy by bypassing the blank gap area entirely. The route
option leads to the least amount of time and the least amount
of EC. The methods presented reduce the possibility of bit
errors in empty gaps. An empirical configuration of the de-
veloped procedures is detailed in the following stage.
4.1. Simulations Setup
Several distinct FLMPC method situations are explored
in simulation. In all cases, 150 terminals are placed in the
space of (2000 2000) m2. To ensure that all suggested pro-
cedures were compatible, comprehensive exercises were
carried out. Column four lists both effectiveness variables,
including system sizes for all experiments shown in Table 1.
Table 1. Simulator variables.
Simulator
Principles
Surface
In Meters
Shipping Noise
0.3 Decibels
Breeze
6 m /s
No. of Nodes
175
Sum of Cross Nodes
50
Outlets
7
Intensity
In Hertz
Net Energy
1000 J
Power Transmission
0.67mW
Power Receiving
0.027mW
4.2. Simulation Results
A comparison of suggested procedures with current
standards is covered in the chapter. Overall efficiency for the
overall suggested methods is verified using many operational
sites at each level, EC, delay, RTDR, and PRR. The follow-
ing provides a breakdown of every efficiency variable:
The number of operational connections is an essential
factor that influences the channel's lifespan. The amount of
operational connections is its greatest essential critical metric
for extending the show's lifespan. With all planned & current
technologies, Fig. (9) illustrates the amount of operational
connections between each level. The amount of network
operational sites rises as the amount of level grows in current
technologies. Since the origin network is close to the upper
portal, there are less passive networks, so networks are
awakened. Several paths emanate from each crossing node in
FLMPC-One and FLMPC-Two, forming a branching forest
for secure information transmission. A high number of verti-
ces are engaged as a result of such ternary graph construc-
tion. Busy networks were higher in FLMPC-One than in it
10 Int. J. Sens. Wirel. Commun. Control, xxxx, Vol. xx, No. x Reddy and Sucharitha
FLMPC-Two. As we go through the lowest to the top level
of an undersea network to transmit information messages,
the number of operational sites rises. Crossing networks
were the primary cause for the rise of busy networks. These
crossing networks build a branching forest to ensure con-
sistent information transmission by originating extra versions
of digital information. Since each sender in FLMPC-One
travels forwards down until 2-hop that sends an information
packet into the empty zone, and there the number of opera-
tional sites of FLMPC-Two is fewer than FLMPC-One.
FLMPC-Two, on the other hand, searches ahead up to three
hops and lowers the likelihood of package transmission in
the empty gap zone. The above is a list of some of the most
important factors to consider. The abovementioned concept
reduces the number of operational terminals and packet
drops.
The SPF-Three, on the other hand, determines its quick-
est route to its target by totally eliminating empty gap areas.
As a result, the overall number of operational sites in SPF-
Three is lower than in other methods. Conversely, the BFS-
SPF-Three searches for the quickest pathways in terms of
width and conducts serendipitous networking by choosing
the greatest prospective sites. The EC was effectively re-
duced according to the abovementioned path choice method.
It has the fewest operational connections and the shortest
length. Fig. (9) depicts the number of network operational
connections for every design. Fig. (9) plainly shows that
BFS-SPF-Three has fewer operational networks than SPF-
Three and the other current algorithms. All suggested meth-
ods topped the competition. This takes intelligent judgment
for a safe path choosing. As a result, appropriate sites are
chosen for communication in order to extend the show's
lifespan.
Since even tiny latencies in the network can occasionally
force the whole system to implode, latency is one of the es-
sential elements to address for UWSNs for communications.
Both the length between both origin & destinations, as well
as both routes employed in UWSNs, has a significant impact
on transmission latency. As a result, several transport meth-
ods were suggested to address this critical issue. Fig. (10)
depicts the latency of the above-described methods. Since
FLMPC-One 2-hop neighboring knowledge results in a large
number of operational sites, the latency is larger than
FLMPC-Two. However, SPF-Three has a longer latency
than all other procedures. SPF-Three takes the quickest way
between origin to the target, which causes the latency. As
FLMPC-Two, it gathers 3-hop data, resulting in distinct
route and unintended package collisions. Large accidents
prevent a large number of information packages from reach-
ing their destinations owing to the aforementioned cause (the
ratio of packet drop is high). As a result, SPF-Three resends
information packages along the quickest channel having the
Fig. (9). Comparison of layer and nodes. (A higher resolution / colour version of this figure is available in the electronic copy of the article).
Fig. (10). Delay of packet. (A higher resolution / colour version of this figure is available in the electronic copy of the article).
IoT-Enabled Energy-Efficient Multipath Power Int. J. Sens. Wirel. Commun. Control, xxxx, Vol. xx, No. x 11
lowest EC. These do, though, have latency, although they
give trustworthy information. Due to quadtree creation, the
latency in BFS-SPF-Three is less than SPF-Three but greater
over current methods. Furthermore, through leveraging its
binary treesequentially or conducting proactive networking,
BFS-SPF-Three delivers all the lowest feasible paths be-
tween origin to target. Under BFS-SPF-Three, adaptive rout-
ing picks the shortest path and ensures package transport
reliability. This choice of the furthest networks increases
message transport delay and increases propagating latency.
When the number of levels grows, so does the number of
operational connections, resulting in a final latency. For
BFS-SPF-Three, the effective maximum latency was 0.82
seconds above level 6, while 0.63 seconds at layer 6. The
overall edge latency in the current procedure is 240.6178
ms220.1483 ms, correspondingly, and yet the final latency
for the suggested method was 390.4561 ms and 351.0972ms.
Fig. (11) depicts the average EC of all suggested or cur-
rent methods for various PSs and DRs. The DRs of 10, 20,
and 30 Kbps are taken into account. PSs are 100, 200, 300,
400, and 500 bytes in size. Fig. (11) shows how, regardless
of matter transmission duration, EC is mostly dependent on
DRs. When the PS rises, so does the EC.
Since binary trees were generated using crossing net-
works, the overall number of more operational endpoints in
FLMPC-One and FLMPC-Two is larger than in the suggest-
ed methods. A thick atmosphere is created by a large number
of operational stationsleads to the creation of duplicated
messages. Package filtering squanders the most power due to
package accidents. As seen in Fig. (11), the EC rises as the
package length climbs. Because as we minimize the blank
gap areas, our router conducts computations up to 2–3 hops
in both current methods. The EC, on the other hand, is raised
while gathering data from 3-hop companions.
Its EC is lower in SPF-Three and BFS-SPF-Three com-
pared to the current procedures. SPF-Three, on the other
hand, determines the quickest path to a target with the fewest
operational connections. In the meantime, BFS-SPF-Three
uses proactive navigation to identify the cheapest path. Both
the construction of binary trees and the removal of empty
branches are fundamental features of all systems. The num-
ber of networks in the suggested methods is lower than for
the current methods, resulting in lower EC. When boards are
required in the suggested systems, SPF and BFS-SPF assist
in determining the quickest route having the least length and
EC. The suggested procedures are unusual in that they elimi-
nate this empty area of concern by using the optimal path
selection. Constant broadcast, receiving, weather and vessel
sound all have an impact on information packages and EC.
The suggested methods excel in terms of the lowest EC and
effectively address the problems to maintain constant com-
munication. Columns 2-6 exhibit significant EC estimates
across several Power systems or DRs (Fig. 12).
The article discusses the average EC of every transmis-
sion under a face and various network faults. When RTDR is
large, the information transfer efficiency and EC of package
transfer improve. This failure frequency was determined
when the messages arrived at the sinks. If the fault surpasses
any system's fault limit, then the message is discarded. As
the network loss increases, the dependability of information
packets diminishes as well (Tables 2-6).
Fig. (12). Protocol’s-PRR. (A higher resolution / colour version of this figure is available in the electronic copy of the article).
Fig. (11). Graph with different layers. (A higher resolution / colour version of this figure is available in the electronic copy of the article).
12 Int. J. Sens. Wirel. Commun. Control, xxxx, Vol. xx, No. x Reddy and Sucharitha
Table 2. Energy Consumption with Packet size of 50 bytes.
Energy Consumption
Packet Size = 50 Bytes
Data Rate
5Kbps
10Kbps
15Kbps
FLMPC -Ome
156.56
96.57
82.84
FLMPC - Two
107.03
76.03
69.02
SPF -Three
62.26
55.27
54.38
BFS-SPF-Three
40.42
37.59
31.42
Table 3. Energy Consumption with Packet size of 100 bytes.
Energy Consumption
Packet Size = 100 Bytes
Data Rate
5Kbps
10Kbps
15Kpbs
FLMPC -Ome
313.12
193.14
165.68
FLMPC - Two
214.06
152.06
138.04
SPF -Three
124.52
110.54
108.76
BFS-SPF-Three
80.84
75.18
62.84
Table 4: Energy Consumption with Packet size of 150 bytes.
Energy Consumption
Packet Size = 150 Bytes
Data Rate
5Kbps
10Kbps
15Kbps
FLMPC -Ome
469.68
289.71
248.52
FLMPC - Two
321.09
228.09
207.06
SPF -Three
186.78
165.81
163.14
BFS-SPF-Three
121.26
112.77
94.26
Table 5. Energy consumption with packet size of 200 bytes.
Energy Consumption
Packet Size = 200 Bytes
Data Rate
5Kbps
10Kbps
15Kbps
FLMPC -Ome
626.24
386.28
331.36
FLMPC - Two
428.12
304.12
276.08
SPF -Three
249.04
221.08
217.52
BFS-SPF-Three
161.68
150.36
125.68
IoT-Enabled Energy-Efficient Multipath Power Int. J. Sens. Wirel. Commun. Control, xxxx, Vol. xx, No. x 13
Table 6. Energy consumption with packet size of 250 bytes.
Energy Consumption
Packet Size = 250 Bytes
Data Rate
5Kbps
10Kbps
15Kbps
FLMPC -Ome
782.8
482.85
414.2
FLMPC - Two
535.15
380.15
345.1
SPF -Three
311.3
276.35
271.9
BFS-SPF-Three
202.1
187.95
157.1
Fig. (13). Required packet error ration vs. energy consumption. (A higher resolution / colour version of this figure is available in the electron-
ic copy of the article).
The average RTDR of all procedures is shown in Fig.
(13). The average EC of packages with varied PERs of con-
ventional methods is higher than the suggested methods, as
seen in the image. Despite the distinction is slight, most
methods that employ bilateral tree construction generate nu-
merous duplicates. All suggested methods choose the opti-
mal communication path and limit the impact of information
loss. The suggested methods vary from current methods in
that it handles incorrect data considerably more effectively
than previous methods. SPF-Three and BFS-SPF-Three both
aggregate information packages at the sinks to eliminate the
impact of incorrect values.
Current procedures waste a lot of power due to excessive
information interchange and empty loop creation. Neverthe-
less, in SPF-Three, one unique cheap route mitigates that
number yet allows most communications to transit. By fully
eradicating empty holes locations within your undersea con-
nection, this chosen approach lowers the EC. To accomplish
the goals, our suggested procedures cope with void whole
areas in an effective manner. Fig. (13) plainly shows that EC
is larger than 0.35 J at the 6th minute. As a result, the rec-
ommended procedures effectively increased EC reduction.
A quantitative optimizer was used to achieve the greatest
feasible outcomes. All questions in this chapter were formu-
lated using cubic restrictions. The suggested work's major
goal is to reduce the EC while increasing capacity. Continu-
ous monitoring for target functional restrictions was present-
ed as an effective technique.
14 Int. J. Sens. Wirel. Commun. Control, xxxx, Vol. xx, No. x Reddy and Sucharitha
These information packages are broadcasted by these
crossing networks in SPF-Three and BFS-SPF-Three em-
ploying the IP programming method. The information
streams are connectionless to all relays. As a result, a mini-
mal EC is necessary to extend the connection’s lifetime. The
writers of the transmitting and receiving phase, spend the
most power. Its busy mode consumes the most power, while
the rest option consumes the least. EC, on the other hand, is
smaller than the power loss between broadcast and receiving.
As a result, the EC of the inactive station is ignored.
𝑀𝑖𝑛𝑖𝑚𝑢𝑚 𝐹𝑡𝑖𝑚𝑒
!"#$%!"#$
!"#$!! (14)
• Sensing network power was lower than or equivalent to
a data type starting power (because of limitedly energy re-
sources)
• If DR is lower than that or equivalent to DR, causing
the bits to be incorrect for transfer. Instead, the PER would
rise, resulting in package loss and the requirement to resend
the payload.
• Its communication power was higher than or equivalent
to the communication power of the sensing nodes.
• For avoiding packet drops, the connection performance
must be high for dependable information transfer without
errors.
• Total ‘𝐸!"#"$%$&'’ and ‘𝐸!"#$%&'%%'($ ’ is calculated us-
ing Eqs. (15 and 16)
𝑀𝑖𝑛𝑖𝑚𝑢𝑚 𝐸!"#$%&'%%'($
!
!"#" !"#$%&'!! (15)
𝑀𝑖𝑛𝑖𝑚𝑢𝑚 𝐸!"#"$%$&'
!
!"#" !"#$%&'!! 16
Considering the following situation: all the terminals
starting capacity is 6 J, and the transfer capacity is 0.66 mW,
𝑃
!"#$%! of 500 bytes, DR of 10 kbps with a distance range of
100–300 m and the receiving power of 0.395 mW. There-
fore,
3.3 mJ≤ Et≤ 9.9 mJ
1.98 mJ≤Er≤ 5.93 mJ
The viable area for the suggested procedure is depicted in
Fig. (14). Each pixel in the viable area denotes the feasibility
of the suggested system's resolution. Pieces P1, P2, P3, or P4
in that vertex of a viable answer include the corner pieces
that are inside the starting power spectrum. As a result, all
options are viable. During the transmission and reception of
information packages, each amount of power is collected
using that viable option.
These essential goals for these suggested methods, name-
ly, optimum performance, is theoretically expressed in this
part using linear planning. The number of distinct messages
properly accepted at the designated sink is referred to as ca-
pacity in the suggested standards. Eq. (17) is used to convey
this goal. In Eq. (18), 𝑄(𝑡𝑖𝑚𝑒 )is any package kind contain-
ing counter D:
𝑀𝑎𝑥𝑖𝑚𝑢𝑚 𝑄(𝑡𝑖𝑚𝑒)
!"#!"!"#$
!"#$ !! (17)
𝑀𝑎𝑥𝑖𝑚𝑢𝑚 𝑄𝑡𝑖𝑚𝑒 ∗𝐷
!"#$%!"#$
!"#$ !! (18)
𝑄𝑡𝑖𝑚𝑒 is equivalent to 1 if the package is distinct, and
𝑄(𝑡𝑖𝑚𝑒)was equivalent to 0 if the pay-load is identical. Eqs.
(19 and 20) are used to calculate the lowest temperature and
transportation sound (20).
Eqs. (19 and 20) are used to compute the temperature and
transportation noise, accordingly. 𝑆𝑜𝑢𝑟𝑐𝑒!"#$ =𝐷on the
other hand, is from the origin to the outer gateway.
𝑀𝑖𝑛𝑖𝑚𝑢𝑚 𝑇ℎ𝑒𝑟𝑚𝑎𝑙!"#$%
!"#$%&!"#$
!"#$%&!"#$!! (19)
𝑀𝑖𝑛𝑖𝑚𝑢𝑚 𝑆ℎ𝑖𝑝𝑝𝑖𝑛𝑔!"#$%
!"#$%&!"#$
!"#$%&!"#$!! (20)
As a result, the interference must be kept minimal to
achieve optimum performance. In the meantime, its overall
sound will be a combination of temperature and transporta-
tion sound.
Fig. (14). Energy consumption for proposed protocols.
IoT-Enabled Energy-Efficient Multipath Power Int. J. Sens. Wirel. Commun. Control, xxxx, Vol. xx, No. x 15
4.3. Comparative Study
In this subsection, the exhibition of the existing and the
proposed protocols are contrasted. To keep away from repli-
cation, parameters are discussed as simple due to compara-
tive ways of behavior in the proposed protocols. To accom-
plish the information dependability in information transmis-
sion, different duplicates of information parcels are pro-
duced. Existing protocols experience minimal postponement
with high EC, countless dynamic hubs and high PRR. In the
meantime, the proposed calculations accomplished solid
information conveyance with the least EC and a base number
of dynamic hubs and reasonable PRR. In the proposed con-
ventions, the deferral is compromised over EC. Also, execu-
tion compromise and accomplishments with compromised
boundaries of existing and proposed conventions are dis-
played in Table 7. In the proposed conventions, a proactive
methodology is utilized to look through the briefest way, yet
a compromise happens between the EC and the deferral. If
the presented protocols disseminate the least EC to drag out
the network life-span, the network should compromise on
delay, i.e., it should pay the cost of deferral. The BFS-SPF-
Three and SPF-Three choose the single shortest way with the
least EC which brings about a crash of information bundles
and deferral. Retransmissions convey the information pack-
ets ASAP with outcomes in the minimum number of active
hubs with the least EC. Accordingly, the lifetime of the net-
work rises. In any case, the network should conciliate on
delay to decrease the EC.
CONCLUSION AND FUTURE WORK
Due to the very restricted capabilities of UWSNs, mini-
mal EC is one of the most important criteria when building
transport algorithms. The channel's lifetime is reduced by its
randomized dispersion of terminals, empty gaps, and a re-
duction in transmission loss ratio. Dual routes, SPF-Three
and BFS-SPF-Three, are presented in this work to achieve
information transfer dependability and power economy em-
ploying the ‘Dijkstra' method (the greedy approach of SPF).
The graph-based construction in all suggested methods be-
gins on a messy level to reduce the influence of preexisting
sounds in information packages being reduced. Given a low
EC, this branching branch construction improves information
dependability. To accomplish power economy, RTDR, and
lessening the number of active nodes to extend the system
lifetime, the suggested techniques employ a proactive strate-
gy for serendipitous navigation. The simulation outcomes
demonstrate that the provided techniques are efficient in re-
spect of minimal EC. RTDR and the number of operational
connections are similarly reduced.
LIST OF ABBREVIATIONS
FRF = Fastest Route Fist
IoT-UWSNs = Underwater Sensing Networks
RTDR = Reduced Transmission Drop Rates
EC = Electric Cost
FRF = Fastest Route Fist
CSEEC = Circle Saliency Electricity Clusters
PRR = Pitch Receiving Rate
SP = Session Portion
IS = Information Speed
CONSENT FOR PUBLICATION
Not applicable.
AVAILABILITY OF DATA AND MATERIALS
The data supporting the findings of the article is available
within the article.
FUNDING
None.
CONFLICT OF INTEREST
The authors declare no conflict of interest, financial or
otherwise.
ACKNOWLEDGEMENTS
The authors would like to thank Mr. A Vivekanand, As-
sociate Professor of CSE Dept. & Rosy Matilda P, Professor
of H&S in CMRCET, Hyderabad, TS, and INDIA for their
great support and special thanks to Dr. A Suresh Babu and
Dr. G Surya Narayana for their great support in my entire
research work.
Table 7. Performance Trade-offs between existing and proposed protocols.
Protocols
Parameters
Achievements
Compromised Parameters
FLMPC-One
Less delay
High EC, active nodes and PRR
FLMPC-Two
Less reliability and delay
High EC, active nodes and PRR
SPF-Three
High reliability, less EC, less active nodes, and affordable PRR
delay
BFS-SPF-Three
High reliability, less EC, high active nodes, and affordable PRR
delay
16 Int. J. Sens. Wirel. Commun. Control, xxxx, Vol. xx, No. x Reddy and Sucharitha
REFERENCES
[1] Narla VL, Kachhoria R, Arun M, Haldorai A, Vijendra Babu D, Jos
BM. IoT based energy efficient multipath power control for under-
water sensor network. Inter J Syst Assur Eng Manag 2022; 1-10.
http://dx.doi.org/10.1007/s13198-021-01560-7
[2] Butt SA, Bakar KA, Javaid N, et al. Exploiting layered multi-path
routing protocols to avoid void hole regions for reliable data deliv-
ery and efficient energy management for IoT-enabled underwater
WSNs. Sensors (Basel) 2019; 19(3): 510.
http://dx.doi.org/10.3390/s19030510 PMID: 30691141
[3] Awan KM, Shah PA, Iqbal K, Gillani S, Ahmad W, Nam Y. Un-
derwater wireless sensor networks: A review of recent issues and
challenges. Wirel Commun Mob Comput 2019; 2019: 2019.
http://dx.doi.org/10.1155/2019/6470359
[4] Fattah S, Gani A, Ahmedy I, Idris MYI, Targio Hashem IA. A
survey on underwater wireless sensor networks: Requirements,
taxonomy, recent Advances, and open research challenges. Sensors
(Basel) 2020; 20(18): 5393.
http://dx.doi.org/10.3390/s20185393 PMID: 32967124
[5] Abbasian Dehkordi S, Farajzadeh K, Rezazadeh J, Farahbakhsh R,
Sandrasegaran K, Abbasian Dehkordi M. A survey on data aggre-
gation techniques in IoT sensor networks. Wirel Netw 2020; 26(2):
1243-63.
http://dx.doi.org/10.1007/s11276-019-02142-z
[6] Gupta O, Goyal N, Anand D, Kadry S, Nam Y, Singh A. Underwa-
ter networked wireless sensor data collection for computational in-
telligence techniques: Issues, challenges, and approaches. IEEE
Access 2020; 8: 122959-74.
http://dx.doi.org/10.1109/ACCESS.2020.3007502
PMID: 34192112
[7] Jan S, Yafi E, Hafeez A, et al. Investigating master-slave architec-
ture for underwater wireless sensor network. Sensors (Basel) 2021;
21(9): 3000.
http://dx.doi.org/10.3390/s21093000 PMID: 33922886
[8] Khan ZA, Karim OA, Abbas S, Javaid N, Zikria YB, Tariq U. Q-
learning based energy-efficient and void avoidance routing proto-
col for underwater acoustic sensor networks. Comput Netw 2021;
197: 108309.
http://dx.doi.org/10.1016/j.comnet.2021.108309
[9] Kapileswar N, Phani Kumar P. Energy efficient routing in IOT
based UWSN using bald eagle search algorithm. Trans Emerg Tel-
ecommun Technol 2022; 33(1): e4399.
http://dx.doi.org/10.1002/ett.4399
[10] Ismail AS, Wang X, Hawbani A, Alsamhi S, Abdel Aziz S. Rout-
ing protocols classification for underwater wireless sensor net-
works based on localization and mobility. Wirel Netw 2022; 28(2):
1-30.
http://dx.doi.org/10.1007/s11276-021-02880-z
[11] Rizvi HH, Khan SA, Enam RN. Clustering base energy efficient
mechanism for an underwater wireless sensor network. Wirel Pers
Commun 2022.
http://dx.doi.org/10.1007/s11277-022-09536-x
[12] Goyal N, Dave M, Verma AK. SAPDA: Secure authentication with
protected data aggregation scheme for improving QoS in scalable
and survivable UWSNs. Wirel Pers Commun 2020; 113(1): 1-5.
http://dx.doi.org/10.1007/s11277-020-07175-8
[13] Shaker Reddy PC, Sureshbabu A. An enhanced multiple linear
regression model for seasonal rainfall prediction. Int J Sensors
Wirel Commun Control 2020; 10(4): 473-83.
http://dx.doi.org/10.2174/2210327910666191218124350
[14] Courville SW, Sava PC. Speckle noise attenuation in orbital laser
vibrometer seismology. Acta Astronaut 2020; 172: 16-32.
http://dx.doi.org/10.1016/j.actaastro.2020.03.016
[15] Khisa S, Moh S. Survey on recent advancements in energy-
efficient routing protocols for underwater wireless sensor networks.
IEEE Access 2021; 9: 55045-62.
http://dx.doi.org/10.1109/ACCESS.2021.3071490
[16] Reddy PCS, Yadala S, Goddumarri SN. Development of rainfall
forecasting model using machine learning with singular spectrum
analysis. IIUM Eng J 2022; 23(1): 172-86.
http://dx.doi.org/10.31436/iiumej.v23i1.1822
[17] Awais M, Ali I, Alghamdi TA, et al. Towards void hole alleviation:
Enhanced geographic and opportunistic routing protocols in harsh
underwater WSNS. IEEE Access 2020; 8: 96592-605.
http://dx.doi.org/10.1109/ACCESS.2020.2996367
[18] Mhemed R, Comeau F, Phillips W, Aslam N. Void avoidance
opportunistic routing protocol for underwater wireless sensor net-
works. Sensors (Basel) 2021; 21(6): 1942.
http://dx.doi.org/10.3390/s21061942 PMID: 33801951
[19] John S, Menon VG, Nayyar A. Simulation-based performance
analysis of location-based opportunistic routing protocols in un-
derwater sensor networks having communication voids. In: Data
Management, Analytics and Innovation. Singapore: Springer 2020;
pp. 697-711.
[20] Phung A. A comparison of biogeochemical argo sensors, remote
sensing systems, and shipborne field fluorometers to measure chlo-
rophyll a concentrations in the pacific ocean off the northern coast
of New Zealand. In: Global Oceans. Singapore–US Gulf Coast
2020; pp. 1-7.
[21] Reddy PC, Pradeepa M, Venkatakiran S, Walia R, Saravanan M.
Image and signal processing in the underwater environment. J Nu-
clEneSci Power Generat Technol 2021; 10.
[22] Anand JV, Sundeep K, Rao ND. Underwater sensor protocol for
time synchronization and data transmissions using the prediction
model. 2020 International Conference on Inventive Computation
Technologies (ICICT). pp. 762-6.
http://dx.doi.org/10.1109/ICICT48043.2020.9112388
[23] Bhandari KS, Cho GH. Resource oriented topology construction to
ensure high reliability in IoT based smart city networks. Inter J
SystAssur Eng Manag 2020; 11(4): 798-805.
http://dx.doi.org/10.1007/s13198-019-00861-2
[24] Buvana M, Loheswaran K, Karanam M, Sivakumar P, Aradhana B,
Jayavadivel R. Improved Resource management and utilization
based on a fog-cloud computing system with IoT incorporated with
Classifier systems. Microprocess Microsyst 2021.
Available from: sciencedi-
rect.com/science/article/abs/pii/S0141933120309601
[25] Khan RA, Xin Q, Roshan N. RK-energy efficient routing protocol
for wireless body area sensor networks. Wirel Pers Commun 2021;
116(1): 709-21.
http://dx.doi.org/10.1007/s11277-020-07734-z
[26] Venkata PM, Karnan B, Latchoumi TP. PLA-Cu reinforced com-
posite filament: Preparation and flexural property printed at differ-
ent machining conditions. Adv Composite Mater 2021. Available
from: DOI:10.1080/09243046.2021.1918608
[27] Khan A, Ali I, Ghani A, et al. Routing protocols for underwater
wireless sensor networks: Taxonomy, research challenges, routing
strategies and future directions. Sensors (Basel) 2018; 18(5): 1619.
http://dx.doi.org/10.3390/s18051619 PMID: 29783686
[28] Suresh P, Saravanakumar U, Iwendi C, Mohan S, Srivastava G.
Field-programmable gate arrays in a low power vision system.
Comput Electr Eng 2021; 90: 106996.
http://dx.doi.org/10.1016/j.compeleceng.2021.106996
[29] Hemalatha P, Dhanalakshmi K. Cellular automata based energy
efficient approach for improving security in IOT. Intell Autom Soft
Comput 2022; 32(2): 811-25.
http://dx.doi.org/10.32604/iasc.2022.020973
[30] Thangamani M, Ganthimathi M, Sridhar SR, Akila M, Keerthana
R, Ramesh PS. Detecting coronavirus contact using internet of
things. Int J Pervas Comput Commun 2020; 16(5): 447-56.
[31] Chen Z, Zhou W, Wu S, Cheng L. An on demand load balancing
multi-path routing protocol for differentiated services in MWSN.
Comput Commun 2021; 179: 296-306.
http://dx.doi.org/10.1016/j.comcom.2021.08.020
[32] An H, Na Y, Lee H, Perrig A. Resilience evaluation of multi-path
routing against network attacks and failures. Electronics (Basel)
2021; 10(11): 1240.
http://dx.doi.org/10.3390/electronics10111240
[33] Yu CM, Ku ML, Wang LC. BMRHTA: Balanced multi-path rout-
ing and hybrid transmission approach for lifecycle maximization in
WSNs. IEEE Internet Things J 2021; 9(1): 728-42.
[34] Luo J, Chen Y, Wu M, Yang Y. A survey of routing protocols for
underwater wireless sensor networks. IEEE Comm Surv Tutor
2021; 23(1): 137-60.
http://dx.doi.org/10.1109/COMST.2020.3048190
IoT-Enabled Energy-Efficient Multipath Power Int. J. Sens. Wirel. Commun. Control, xxxx, Vol. xx, No. x 17
[35] Fuada N, Purwoko S. Children under-five health transition infor-
mation system. International Proceedings The 2nd ISMoHIM 2020.
Available from: file:///C:/Users/IT-ITS-047/Downloads/194-383-1-
SM.pdf
[36] Shi G, Liu K, Zeng J. Cooperative depth rotation to avoid energy
hole for 3D underwater sensor networks. 2021 IEEE 24th Interna-
tional Conference on Computer Supported Cooperative Work in
Design (CSCWD). pp. 825-30.
[37] Lei L, Hao Z, Xu W. Research on scattered point cloud coordinate
reduction and hole repair technology based on big data model. In:
International Conference on Big Data and Security. Singapore:
Springer 2020; pp. 420-32.
[38] Khasawneh AM, Kaiwartya O, Abualigah LM, Lloret J. Green
computing in underwater wireless sensor networks pressure centric
energy modeling. IEEE Syst J 2020; 14(4): 4735-45.
http://dx.doi.org/10.1109/JSYST.2020.2996421
[39] Reddy PC, Nachiyappan S, Ramakrishna V, Senthil R. Hybrid
model using scrum methodology for software development system.
J NuclEneSci Power Generat Techno 2021.
[40] Draz U, Ali A, Bilal M, et al. Energy efficient proactive routing
scheme for enabling reliable communication in underwater internet
of things. IEEE Trans Netw Sci Eng 2021; 8(4): 2934-45.
http://dx.doi.org/10.1109/TNSE.2021.3109421
[41] Baranidharan V, Moulieshwaran B, Karthik V, Sanjay R,
Thangabalaji V. Enhanced goodput and energy-efficient geo-
opportunistic routing protocol for underwater wireless sensor net-
works. In: Smart Computing Techniques and Applications. Singa-
pore: Springer 2021; pp. 585-93.
[42] Sucharitha Y, Vijayalata Y, Prasad VK. Predicting election results
from twitter using machine learning algorithms. Recent Adv Com-
put Sci Commun 2021; 14(1): 246-56.
http://dx.doi.org/10.2174/2666255813999200729164142
[43] Mittal N. ZEEHC: Zone-based energy efficient hierarchal cluster-
ing hierarchy for wireless sensor networks. Turkish J Comput Math
Educ 2021; 12(2): 3003-17. [TURCOMAT].
http://dx.doi.org/10.17762/turcomat.v12i2.2340
[44] Bai G, Meng Y, Gu Q, Gan X, Li K. Influence of preview distance
on lmpc-based path tracking. 2020 39th Chinese Control Confer-
ence (CCC). pp. 2363-7.
[45] Yin X, Zhao X. Data driven learning model predictive control of
offshore wind farms. Int J Electr Power Energy Syst 2021; 127:
106639.
http://dx.doi.org/10.1016/j.ijepes.2020.106639
[46] Baydoun S, Fouvry S. An experimental investigation of adhesive
wear extension in fretting interface: application of the contact oxy-
genation concept. Tribol Int 2020; 147: 106266.
http://dx.doi.org/10.1016/j.triboint.2020.106266
DISCLAIMER: The above article has been published, as is, ahead-of-print, to provide early visibility but is not the final version. Major pub-
lication processes like copyediting, proofing, typesetting and further review are still to be done and may lead to changes in the final published
version, if it is eventually published. All legal disclaimers that apply to the final published article also apply to this ahead-of-print version.
