<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.1 20151215//EN" "http://jats.nlm.nih.gov/publishing/1.1/JATS-journalpublishing1.dtd">
<article xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:mml="http://www.w3.org/1998/Math/MathML" xml:lang="en" article-type="research-article" dtd-version="1.1">
<front>
<journal-meta>
<journal-id journal-id-type="pmc">CMC</journal-id>
<journal-id journal-id-type="nlm-ta">CMC</journal-id>
<journal-id journal-id-type="publisher-id">CMC</journal-id>
<journal-title-group>
<journal-title>Computers, Materials &#x0026; Continua</journal-title>
</journal-title-group>
<issn pub-type="epub">1546-2226</issn>
<issn pub-type="ppub">1546-2218</issn>
<publisher>
<publisher-name>Tech Science Press</publisher-name>
<publisher-loc>USA</publisher-loc>
</publisher>
</journal-meta>
<article-meta>
<article-id pub-id-type="publisher-id">62608</article-id>
<article-id pub-id-type="doi">10.32604/cmc.2025.062608</article-id>
<article-categories>
<subj-group subj-group-type="heading">
<subject>Article</subject>
</subj-group>
</article-categories>
<title-group>
<article-title>Fuzzy Decision-Based Clustering for Efficient Data Aggregation in Mobile UWSNs</article-title>
<alt-title alt-title-type="left-running-head">Fuzzy Decision-Based Clustering for Efficient Data Aggregation in Mobile UWSNs</alt-title>
<alt-title alt-title-type="right-running-head">Fuzzy Decision-Based Clustering for Efficient Data Aggregation in Mobile UWSNs</alt-title>
</title-group>
<contrib-group>
<contrib id="author-1" contrib-type="author">
<name name-style="western"><surname>Pandith</surname><given-names>Aadil Mushtaq</given-names></name><xref ref-type="aff" rid="aff-1">1</xref></contrib>
<contrib id="author-2" contrib-type="author">
<name name-style="western"><surname>Kumar</surname><given-names>Manni</given-names></name><xref ref-type="aff" rid="aff-2">2</xref></contrib>
<contrib id="author-3" contrib-type="author">
<name name-style="western"><surname>Kumar</surname><given-names>Naveen</given-names></name><xref ref-type="aff" rid="aff-3">3</xref></contrib>
<contrib id="author-4" contrib-type="author" corresp="yes">
<name name-style="western"><surname>Goyal</surname><given-names>Nitin</given-names></name><xref ref-type="aff" rid="aff-4">4</xref>
<email>dr.nitin@cuh.ac.in</email></contrib>
<contrib id="author-5" contrib-type="author">
<name name-style="western"><surname>Ahuja</surname><given-names>Sachin</given-names></name><xref ref-type="aff" rid="aff-2">2</xref></contrib>
<contrib id="author-6" contrib-type="author">
<name name-style="western"><surname>Gulzar</surname><given-names>Yonis</given-names></name><xref ref-type="aff" rid="aff-5">5</xref></contrib>
<contrib id="author-7" contrib-type="author">
<name name-style="western"><surname>Rastogi</surname><given-names>Rashi</given-names></name><xref ref-type="aff" rid="aff-6">6</xref></contrib>
<contrib id="author-8" contrib-type="author">
<name name-style="western"><surname>Gupta</surname><given-names>Rupesh</given-names></name><xref ref-type="aff" rid="aff-7">7</xref></contrib>
<aff id="aff-1"><label>1</label><institution>Department of Computer Science and Engineering, Lovely Professional University</institution>, <addr-line>Jalandhar, 144402, Punjab</addr-line>, <country>India</country></aff>
<aff id="aff-2"><label>2</label><institution>Department of Computer Science and Engineering, Chandigarh University</institution>, <addr-line>Mohali, 140413, Punjab</addr-line>, <country>India</country></aff>
<aff id="aff-3"><label>3</label><institution>Salesforce Inc</institution>., <addr-line>Dallas, TX 75201</addr-line>, <country>USA</country></aff>
<aff id="aff-4"><label>4</label><institution>Department of Computer Science and Engineering, School of Engineering and Technology, Central University of Haryana</institution>, <break/><addr-line>Mahendragarh, 123031, Haryana</addr-line>, <country>India</country></aff>
<aff id="aff-5"><label>5</label><institution>Department of Management Information Systems, College of Business Administration, King Faisal University</institution>, <addr-line>Al-Ahsa, 31982</addr-line>, <country>Saudi Arabia</country></aff>
<aff id="aff-6"><label>6</label><institution>Department of Computer Application, Sir Chhotu Ram Institute of Engineering and Technology, Ch. Charan Singh University</institution>, <addr-line>Meerut, 250001, Uttar Pradesh</addr-line>, <country>India</country></aff>
<aff id="aff-7"><label>7</label><institution>Chitkara University Institute of Engineering and Technology, Chitkara University</institution>, <addr-line>Rajpura, 140401, Punjab</addr-line>, <country>India</country></aff>
</contrib-group>
<author-notes>
<corresp id="cor1"><label>&#x002A;</label>Corresponding Author: Nitin Goyal. Email: <email>dr.nitin@cuh.ac.in</email></corresp>
</author-notes>
<pub-date date-type="collection" publication-format="electronic">
<year>2025</year>
</pub-date>
<pub-date date-type="pub" publication-format="electronic">
<day>26</day><month>03</month><year>2025</year>
</pub-date>
<volume>83</volume>
<issue>1</issue>
<fpage>259</fpage>
<lpage>279</lpage>
<history>
<date date-type="received">
<day>23</day>
<month>12</month>
<year>2024</year>
</date>
<date date-type="accepted">
<day>19</day>
<month>2</month>
<year>2025</year>
</date>
</history>
<permissions>
<copyright-statement>&#x00A9; 2025 The Authors.</copyright-statement>
<copyright-year>2025</copyright-year>
<copyright-holder>Published by Tech Science Press.</copyright-holder>
<license xlink:href="https://creativecommons.org/licenses/by/4.0/">
<license-p>This work is licensed under a <ext-link ext-link-type="uri" xlink:type="simple" xlink:href="https://creativecommons.org/licenses/by/4.0/">Creative Commons Attribution 4.0 International License</ext-link>, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.</license-p>
</license>
</permissions>
<self-uri content-type="pdf" xlink:href="TSP_CMC_62608.pdf"></self-uri>
<abstract>
<p>Underwater wireless sensor networks (UWSNs) rely on data aggregation to streamline routing operations by merging information at intermediate nodes before transmitting it to the sink. However, many existing data aggregation techniques are designed exclusively for static networks and fail to reflect the dynamic nature of underwater environments. Additionally, conventional multi-hop data gathering techniques often lead to energy depletion problems near the sink, commonly known as the energy hole issue. Moreover, cluster-based aggregation methods face significant challenges such as cluster head (CH) failures and collisions within clusters that degrade overall network performance. To address these limitations, this paper introduces an innovative framework, the Cluster-based Data Aggregation using Fuzzy Decision Model (CDAFDM), tailored for mobile UWSNs. The proposed method has four main phases: clustering, CH selection, data aggregation, and re-clustering. During CH selection, a fuzzy decision model is utilized to ensure efficient cluster head selection based on parameters such as residual energy, distance to the sink, and data delivery likelihood, enhancing network stability and energy efficiency. In the aggregation phase, CHs transmit a single, consolidated set of non-redundant data to the base station (BS), thereby reducing data duplication and saving energy. To adapt to the changing network topology, the re-clustering phase periodically updates cluster formations and reselects CHs. Simulation results show that CDAFDM outperforms current protocols such as CAPTAIN (Collection Algorithm for underwater oPTical-AcoustIc sensor Networks), EDDG (Event-Driven Data Gathering), and DCBMEC (Data Collection Based on Mobile Edge Computing) with a packet delivery ratio increase of up to 4%, an energy consumption reduction of 18%, and a data collection latency reduction of 52%. These findings highlight the framework&#x2019;s potential for reliable and energy-efficient data aggregation mobile UWSNs.</p>
</abstract>
<kwd-group kwd-group-type="author">
<kwd>Clustering</kwd>
<kwd>data aggregation</kwd>
<kwd>data collection</kwd>
<kwd>fuzzy model</kwd>
<kwd>monitoring</kwd>
<kwd>UWSN</kwd>
</kwd-group>
<funding-group>
<award-group id="awg1">
<funding-source>Studies and Scientific Research, King Faisal University, Saudi Arabia</funding-source>
<award-id>KFU250420</award-id>
</award-group>
</funding-group>
</article-meta>
</front>
<body>
<sec id="s1">
<label>1</label>
<title>Introduction</title>
<p>UWSNs have a crucial role in offshore exploration in various applications of monitoring and surveillance. In terms of aural signal communication, the price of affluent sensors, larger storage space to store as much data as possible, extreme power for communication, and dense sensor distribution, UWSN contrasts with common sensor networks on the ground. UWSNs have both static and mobile nodes that communicate via an acoustic channel [<xref ref-type="bibr" rid="ref-1">1</xref>]. UWSN is used in a spectrum of uses involving the underwater environment, such as pollution monitoring, especially chemical waste, underwater plant life, and wildlife populations, examining the health of rare ocean beings, mining investigation, disaster avoidance, supporting tracking, nutrient yield, fuel leak detection, and scattered strategic oversight are some of the concerns that need to be acknowledged, and seafloor data collection, monitoring, and military surveillance in the water [<xref ref-type="bibr" rid="ref-2">2</xref>]. Sensor nodes are used to accumulate data and transmit it to a sink through a network [<xref ref-type="bibr" rid="ref-3">3</xref>].</p>
<p>UWSNs are used for a wide scope of utilizations, for example, observing the marine climate for logical exploration to business abuse and coastline assurance to submerged contamination checking, from water-based fiasco counteractions to water-based games help. UWSN offers a promising answer for truly requesting applications [<xref ref-type="bibr" rid="ref-4">4</xref>]. Nonetheless, UWSN applications are energizing yet testing at a very similar time. The explanation lies in eccentric states of water climate which makes genuine imperatives in the plan and arrangement of such organizations. UWSN-implemented models are being used for direct observation purposes in a variety of aquatic environments for Instance Rivers, lakes, and ponds [<xref ref-type="bibr" rid="ref-5">5</xref>].</p>
<p>However, in the case of oceans, seas, and other large bodies of water, these implemented models may not provide accurate data because they cover a larger area and there are several factors to consider, including the region that will be impacted, the depth of water, and pressure, all of that should be investigated in real-time. Furthermore, Radio Frequency (RF) is not suitable for UWSN communication as RF is conductive. Due to its conductive nature RF waves are highly attenuated in water. Thus, the acoustic signal is used for UWSN&#x2019;s communication but it has limited bandwidth and slow speed. So, underwater network suffers from latency [<xref ref-type="bibr" rid="ref-6">6</xref>].</p>
<p>In order to get over the condition, a data aggregation approach is used in addition to routing models where larger data is acquired and integrated at a node before to sinking of its transmission. The beneficial and efficient data buildup in the network has shortened information severance thus avoiding energy depletion, as well as securing data transmission with minimal delay, according to the result [<xref ref-type="bibr" rid="ref-7">7</xref>]. Data is aggregated from the deployed sensor, and the sensor near the surface sinks has a load in comparison to other nodes as they are continuously transmitting the data that requires high energy. As a result, more energy wastage has been seen normally on these nodes, Autonomous Underwater Vehicle (AUV) helps to reduce the transmission load in better power uses [<xref ref-type="bibr" rid="ref-8">8</xref>,<xref ref-type="bibr" rid="ref-9">9</xref>].</p>
<p>On the other hand, the achievement of a large amount of data faces tasks in designing data-collecting approaches. Besides, harsh underwater settings, comprising the low flow of information rates, the specified navigation rules and information collection protocols developed for land-based purposes are not suitable for UWSNs due to telecast delay and complexity of node recharging. As a consequence, planning an effective data collection method for UWSNs is critical [<xref ref-type="bibr" rid="ref-10">10</xref>,<xref ref-type="bibr" rid="ref-11">11</xref>]. The majority of data collection systems presume that sensor nodes are constant. Only a small number of studies have tried to remove data duplication during data collection. Multi-hop data gathering methods cause an energy hole at the sink. In most of the cluster-based data gathering schemes, the failure rate of CHs and Intra-cluster collision are not resolved. A cluster-based data aggregation is proposed in this scheme using a fuzzy decision model for mobile UWSN. The novelty of our proposed technique lies in its integration of fuzzy logic for CH selection and re-clustering, enabling real-time adaptation to dynamic network topology in underwater environments that ensures minimal energy consumption, lower packet loss, and enhanced data transmission reliability&#x2014;capabilities not adequately addressed by existing protocols. Furthermore, the main contributions of this scheme are listed below:
<list list-type="roman-lower">
<list-item>
<p><italic>Fuzzy Logic-based CH Selection:</italic> A novel fuzzy logic mechanism selects optimal cluster heads by considering factors like residual energy, distance, delivery probability, and coverage ratio, which minimizes energy use and improves network stability.</p></list-item>
<list-item>
<p><italic>Packet Delivery Reliability:</italic> The framework uses path loss and SINR (Signal to Interference plus Noise Ratio) metrics to assess Packet Delivery Probability (PDP), ensuring robust and reliable data transmission while preventing CH failures.</p></list-item>
<list-item>
<p><italic>Adaptive Re-Clustering:</italic> In order to maintain network performance in mobile scenarios, a dynamic re-clustering process is activated when the coverage ratio or distance between the CH and the sink is beyond a certain threshold.</p></list-item>
<list-item>
<p><italic>Data Redundancy Mitigation</italic>: A similarity function identifies and removes redundant data at the cluster head, reducing unnecessary transmissions and optimizing network efficiency.</p></list-item>
</list></p>
</sec>
<sec id="s2">
<label>2</label>
<title>Literature Survey</title>
<p>Researchers are now interested in Underwater Wireless Sensor Networks (UWSNs) as a novel field for the purpose of research. Data aggregation is the most prominent area of research because it is the backbone for fast and energy-efficient data transmission, collected from sensors towards the data collection point.</p>
<p>Considering sensor nodes with limited power, segmented networks with purely information gathering points at a range, and sporadic observing applications with interruption patience [<xref ref-type="bibr" rid="ref-6">6</xref>], a Mobile Sink (MS)-based data collection method would possibly prolong the life span of the network postponement is accomplished by justifying sink neighborhood problem as well as postponing data communication until the MS is basically in advantageous information transmission position. Apart from terrestrial WSN approaches, they account for the MS&#x2019;s non-zero transmit time among data gathering points, improving the model&#x2019;s accuracy for UWSNs, each related and isolated. But this is not mentioned how the sojourn locations for MS to visit are chosen. They have taken into consideration the routes that are aided by the mobility method for allowing sparse UWSNs to connect and improving their energy efficiency, contemplating It is referred to as a Delay/Disruption Tolerant Network (DTN) or an Intermittently Connected Network (ICN). They investigated the act of data collection using analytical models. At the cost of higher message latency, the DTN scheme enhances energy utilization and Packet Transmission Ratio (PTR), depending on the outcome. The impact of using a range of mobile aspects for information collection and exercise priority polling is studied. However, it is not made clear how the sojourn places for MS to visit are decided [<xref ref-type="bibr" rid="ref-9">9</xref>].</p>
<p>Wang et al. [<xref ref-type="bibr" rid="ref-10">10</xref>] have proposed the clustering of high-energy nodes as a top-priority procedure, where there would be a cluster head designated depending on the enduring geometry distance among sensor nodes and their energy. Additionally, to progress the ability of data aggregation, they deployed the Ant Colony Optimization (ACO) method for finding the briefest path for AUV. Major disadvantages are (i) CH selection merely takes only the enduring strength of the nodes, disregarding the delay of data collection, the failure rate, and the load (ii) It utilizes ACO to find the quickest way tour plan which is a stale optimization method. Blanc et al. [<xref ref-type="bibr" rid="ref-12">12</xref>] have exposed dissimilar models to make this sort of change, combining by way of replication in NS-3. Furthermore, since energy conservation is critical to information collection through submersible vehicles, at which nodes could operate for lengthy periods instead of being connected, this article focuses on multi-hop configurations. Whenever a vehicle shows up in three dimensions, it is anticipated to collect even more data as is conceivable in the shortest length of time. Vehicle presence is the point at which the procedure for collecting begins, not through nodes in the close surroundings, and yet from each node in the three-dimensional volume. However, as it utilizes a multi-hop data collection route, its outcome in the area of the sink, there is an energy gap.</p>
<p>J&#x00FA;nior et al. [<xref ref-type="bibr" rid="ref-13">13</xref>] suggested Collection Algorithm for underwater oPTical-AcoustIc sensor Networks (CAPTAIN), a procedure to do data gathering with information accumulation in Underwater Optical Acoustic Sensor Networks (UOASNs). CAPTAIN splits the network into sections, envelops a packet forwarding tree, and sends all of the data to the sink node using data gathering. By using fewer acoustic emissions in clustered networks, the sink node of CAPTAIN might attain reduced latencies and elevated data collection rates per hour. But the CHs are chosen depending on the energy levels only leaving the depth level or distance to the sink. Furthermore, it may outcome in intra-cluster data collisions, at the time of aggregation. Mortada et al. [<xref ref-type="bibr" rid="ref-14">14</xref>] have suggested an energy-productive data variation method on the premise of clustering design. The goal would be to recognize and investigate data similarity in those sensor and CH phases. Rather than sending raw data, so every sensor transmits a group of descriptive notes to the CH every time frame during the initial phase. When the CH obtains data points, before transmitting data to the sink, it uses Euclidean distance to segregate necessary data collected by the sink node in close proximity. To authenticate their method, they used their methods based on real data from underwater sensors they associated with each other prevailing data compression approaches. Although it removes data redundancy, it didn&#x2019;t take into account the CH failures and energy drain issues.</p>
<p>Huang et al. [<xref ref-type="bibr" rid="ref-15">15</xref>] have suggested a decision-making data-gathering method, considering the high likeness of the collected data and indeed the depletion of the highest accuracy data quantization. The energy depletion of the networks is competently supplemented by this decision-making method. The choice-creating method provides an energy-productive method for sensor nodes that minimizes energy depletion in a variety of network situations, by accessing data redundancy, network communication reputation, and uploading energy depletion. However, it considers all the sensor nodes to be constant. Akbar et al. [<xref ref-type="bibr" rid="ref-16">16</xref>] presented Mobile Sink (MS) as well as Courier Nodes (CNs) to reduce node energy depletion. MS and CNs come to a complete stop for data collection, after which the CNs send the data to the MS for further transmission. The complete energy depletion of nodes is reduced due to the flexibility of CNs and MS. But it considers sensor nodes as constant. <xref ref-type="table" rid="table-1">Table 1</xref> summarizes the key points of the literature review.</p>
<table-wrap id="table-1">
<label>Table 1</label>
<caption>
<title>Comparison of existing approaches</title>
</caption>
<table>
<colgroup>
<col align="center" width="36mm"/>
<col align="center" width="30mm"/>
<col align="center" width="36mm"/>
<col align="center" width="40mm"/>
</colgroup>
<thead>
<tr>
<th>Name of the approach</th>
<th>QoS metrics</th>
<th>Advantages</th>
<th>Drawbacks</th>
</tr>
</thead>
<tbody>
<tr>
<td>MS-based data collection method [<xref ref-type="bibr" rid="ref-6">6</xref>]</td>
<td>Travel time of the MS.</td>
<td>Prolonged network lifetime with delay-tolerance.</td>
<td>It is not stated the way for MS to travel the defined sojourn points.</td>
</tr>
<tr>
<td>Mission planning on-demand data collection [<xref ref-type="bibr" rid="ref-9">9</xref>]</td>
<td>Energy efficiency and packet delivery ratio.</td>
<td>Permits connectivity and refines the power consumption of scattered UWSN.</td>
<td>Not clarified the way stopover locations for MS to go are chosen.</td>
</tr>
<tr>
<td>High-energy node priority clustering procedure [<xref ref-type="bibr" rid="ref-10">10</xref>]</td>
<td>Remaining energy and distance.</td>
<td>Minimizes the energy consumption.</td>
<td>It uses ACO to find the best route, which is an obsolete optimization approach.</td>
</tr>
<tr>
<td>Event-Driven Data Gathering (EDDG) [<xref ref-type="bibr" rid="ref-12">12</xref>]</td>
<td>Hop count and residual energy.</td>
<td>Minimizes data gathering latency.</td>
<td>As it utilizes multi-hop routing for data collection, it causes energy hole issues at the sink.</td>
</tr>
<tr>
<td>CAPTAIN [<xref ref-type="bibr" rid="ref-13">13</xref>]</td>
<td>The energy level of CH and distance between the nodes.</td>
<td>Attains lower average latencies and increased data collection volumes per hour.</td>
<td>The CHs depend on the energy levels only leaving the distance or depth-level of sink. Furthermore, it may outcome in intra-cluster data collisions, at aggregation time.</td>
</tr>
<tr>
<td>Energy-efficient data reduction method based on clustering [<xref ref-type="bibr" rid="ref-14">14</xref>]</td>
<td>Data collection cost and data correctness.</td>
<td>Removes redundant data produced by adjacent sensor nodes.</td>
<td>It didn&#x2019;t take into account the CH failures and energy drain issues.</td>
</tr>
<tr>
<td>Data uploading decision-making method [<xref ref-type="bibr" rid="ref-15">15</xref>]</td>
<td>Compression ratio, power consumption, and energy efficiency.</td>
<td>Removes redundant data, and applies compression to reduce the energy depletion.</td>
<td>Consider every sensor node as stationary.</td>
</tr>
<tr>
<td>MS-based efficient data gathering with courier nodes [<xref ref-type="bibr" rid="ref-16">16</xref>]</td>
<td>MS travel time and buffer level.</td>
<td>Avoids transmission errors and energy depletion.</td>
<td>Nevertheless, it considers all the sensors to be static.</td>
</tr>
<tr>
<td>Data-Collection in Underwater-Sensor Networks based on Mobile Edge Computing [<xref ref-type="bibr" rid="ref-17">17</xref>]</td>
<td>Collection delay, power usage, and system reliability.</td>
<td>Enhances collecting data utilization, brings down node power usage, and enhances system reliability.</td>
<td>The effective mobile edge advanced analytics and the actual mobility system of AUV in the underwater acoustic ambiance aren&#x2019;t taken into account.</td>
</tr>
</tbody>
</table>
</table-wrap>
<p>Cai et al. [<xref ref-type="bibr" rid="ref-17">17</xref>] presented a data-gathering method for mobile edge components underwater based on a mobility pattern. This model completely considers motility orientation and acceleration, and they are very comparable to the vigor features of AUVs in a stable 3D environment. An evaluation and selection algorithm is developed to evaluate the mobility route of data gathering for AUVs using the coding, storage, and mobility functionality of AUVs. Analytical and empirical findings reveal that the suggested strategy improves information-gathering accuracy, lowers node energy usage, and enhances network life. The effectual edge processing and actual simulation environment of AUV in the underwater environment are not adequately considered.</p>
<p>Furthermore, <xref ref-type="table" rid="table-1">Table 1</xref> has a comparative analysis of these schemes.</p>

<p>From the observation of <xref ref-type="table" rid="table-1">Table 1</xref>, it has been carried out that an approach for data aggregation is still needed that improves the collection delay, packet loss, and energy consumption and should also have a better delivery ratio.</p>

</sec>
<sec id="s3">
<label>3</label>
<title>Cluster-Based Data Aggregation Using Fuzzy Decision Model (CDAFDM) Methodology</title>
<p>This method aims to reduce the time it takes to collect data, the packet drop, the delivery ratio, as well as energy consumption. Furthermore, when new data is received, the two vectors are analyzed using a similarity function to mitigate the redundant data. If two sets of data are similar, the CH sends only one set of non-duplicate data to the BS. To fulfill these requirements a cluster-based data aggregation for mobile UWSN using fuzzy logic is proposed.</p>
<sec id="s3_1">
<label>3.1</label>
<title>Overview</title>
<p>A cluster-based data aggregation scheme using a fuzzy decision model for mobile UWSN, comprising four key stages: clustering, CH selection, data aggregation, and re-clustering. In the clustering stage, the network is divided into clusters based on node proximity to optimize communication. During the CH selection stage, crucial parameters such as energy consumption, node location, and distance to the BS are considered. The selection process employs a Fuzzy Logic Decision (FLD) model, incorporating factors like residual energy, shortest distance to BS, delivery probability, and coverage ratio to ensure efficient CH selection. In the data aggregation stage, CHs collect and store sensor data as structured vectors. Upon receiving new data, a similarity function is applied to identify redundancies, ensuring that unique and relevant data is transmitted to the BS.</p>
<p>To maintain network stability, the re-clustering stage is initiated when a CH&#x2019;s performance metrics, such as distance to the BS or coverage ratio, exceed a predefined threshold. As illustrated in <xref ref-type="fig" rid="fig-1">Fig. 1</xref>, sensor nodes forward their data to CH, which then transmits the aggregated information. AUVs further assist in data collection by gathering information from CHs and forwarding it to the sink or BS. Additionally, CHs can directly relay the aggregated data to the sink when feasible, reducing transmission delays and enhancing network efficiency.</p>
<fig id="fig-1">
<label>Figure 1</label>
<caption>
<title>Proposed data aggregation method in mobile UWSN</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMC_62608-fig-1.tif"/>
</fig>
</sec>
<sec id="s3_2">
<label>3.2</label>
<title>Clustering of Nodes</title>
<p>Clustering is employed in the proposed CDAFDM framework to effectively group sensor nodes and control data transmission while preserving energy. The network is separated into several clusters once each node initially learns about its neighbors by exchanging control messages. Choosing the right CHs is essential to maximizing network performance. Three important criteria are used to pick CHs: packet delivery probability, distance to the BS, and residual energy. This ensures a selection procedure that is both dependable and energy-efficient. Nodes are more likely to become CHs if they have more available energy, are closer to the base station, and have a higher possibility of transmitting data successfully. Following the selection of CHs, sensor nodes pair up with the best CH based on connection and signal strength. The CHs then oversee cluster communication, compile gathered data, and send it directly or via intermediary relay nodes to the BS. This clustering technique increases network stability, decreases redundant transmissions, and extends sensor node operating lifetime. The subsequent sections provide a detailed discussion of the selection criteria, including residual energy, packet delivery probability, and distance to the base station.</p>
<p><bold>i. Residual Energy</bold></p>
<p>An overall energy expended by the sender for transferring <italic>q</italic> bit of data over finite distance d is expressed below [<xref ref-type="bibr" rid="ref-18">18</xref>]:
<disp-formula id="eqn-1"><label>(1)</label><mml:math id="mml-eqn-1" display="block"><mml:mtable columnalign="right left right left right left right left right left right left" rowspacing="3pt" columnspacing="0em 2em 0em 2em 0em 2em 0em 2em 0em 2em 0em" displaystyle="true"><mml:mtr><mml:mtd /><mml:mtd><mml:msub><mml:mi>E</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mi>x</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>q</mml:mi><mml:mo>,</mml:mo><mml:mi>d</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:msub><mml:mi>E</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mi>x</mml:mi><mml:mo>.</mml:mo><mml:mi>e</mml:mi></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:msub><mml:mi>E</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mi>x</mml:mi><mml:mo>.</mml:mo><mml:mi>a</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>q</mml:mi><mml:mo>,</mml:mo><mml:mi>d</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>
<disp-formula id="eqn-2"><label>(2)</label><mml:math id="mml-eqn-2" display="block"><mml:mtable columnalign="right left right left right left right left right left right left" rowspacing="3pt" columnspacing="0em 2em 0em 2em 0em 2em 0em 2em 0em 2em 0em" displaystyle="true"><mml:mtr><mml:mtd /><mml:mtd><mml:mi></mml:mi><mml:mo>=</mml:mo><mml:mrow><mml:mo>{</mml:mo><mml:mtable columnalign="left left" rowspacing=".2em" columnspacing="1em" displaystyle="false"><mml:mtr><mml:mtd><mml:mi>q</mml:mi><mml:mo>.</mml:mo><mml:msub><mml:mi>E</mml:mi><mml:mrow><mml:mi>e</mml:mi></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:mi>q</mml:mi><mml:msub><mml:mi>&#x03BB;</mml:mi><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:msup><mml:mi>d</mml:mi><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup><mml:mo>,</mml:mo><mml:mspace width="1em" /><mml:mi>d</mml:mi><mml:mo>&#x003C;</mml:mo><mml:msub><mml:mi>d</mml:mi><mml:mrow><mml:mn>0</mml:mn></mml:mrow></mml:msub></mml:mtd></mml:mtr><mml:mtr><mml:mtd><mml:mi>q</mml:mi><mml:mo>.</mml:mo><mml:msub><mml:mi>E</mml:mi><mml:mrow><mml:mi>e</mml:mi></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:mi>q</mml:mi><mml:msub><mml:mi>&#x03BB;</mml:mi><mml:mrow><mml:mi>a</mml:mi></mml:mrow></mml:msub><mml:msup><mml:mi>d</mml:mi><mml:mrow><mml:mn>4</mml:mn></mml:mrow></mml:msup><mml:mo>,</mml:mo><mml:mspace width="1em" /><mml:mi>d</mml:mi><mml:mo>&#x2265;</mml:mo><mml:msub><mml:mi>d</mml:mi><mml:mrow><mml:mn>0</mml:mn></mml:mrow></mml:msub></mml:mtd></mml:mtr></mml:mtable><mml:mo fence="true" stretchy="true" symmetric="true"></mml:mo></mml:mrow></mml:mtd></mml:mtr></mml:mtable></mml:math></disp-formula>where, <inline-formula id="ieqn-1"><mml:math id="mml-ieqn-1"><mml:msub><mml:mi>E</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mi>x</mml:mi><mml:mo>.</mml:mo><mml:mi>e</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> &#x003D; electronics energy</p>
<p><inline-formula id="ieqn-2"><mml:math id="mml-ieqn-2"><mml:msub><mml:mi>E</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mi>x</mml:mi><mml:mo>.</mml:mo><mml:mi>a</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> &#x003D; amplified energy</p>
<p><inline-formula id="ieqn-3"><mml:math id="mml-ieqn-3"><mml:msub><mml:mi>E</mml:mi><mml:mrow><mml:mi>e</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> &#x003D; energy used to operate the transmitter or receiver per bit.</p>
<p><inline-formula id="ieqn-4"><mml:math id="mml-ieqn-4"><mml:msub><mml:mi>&#x03BB;</mml:mi><mml:mrow><mml:mi>t</mml:mi></mml:mrow></mml:msub><mml:msup><mml:mi>d</mml:mi><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup></mml:math></inline-formula> and <inline-formula id="ieqn-5"><mml:math id="mml-ieqn-5"><mml:msub><mml:mi>&#x03BB;</mml:mi><mml:mrow><mml:mi>a</mml:mi></mml:mrow></mml:msub><mml:msup><mml:mi>d</mml:mi><mml:mrow><mml:mn>4</mml:mn></mml:mrow></mml:msup></mml:math></inline-formula> are amplified energy depending on the distance between the transmitter and receiver.</p>
<p><xref ref-type="disp-formula" rid="eqn-3">Eq. (3)</xref> gives the total power consumption by the receiver.
<disp-formula id="eqn-3"><label>(3)</label><mml:math id="mml-eqn-3" display="block"><mml:msub><mml:mi>E</mml:mi><mml:mrow><mml:mi>r</mml:mi><mml:mi>x</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>q</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:msub><mml:mi>E</mml:mi><mml:mrow><mml:mi>r</mml:mi><mml:mi>x</mml:mi><mml:mo>.</mml:mo><mml:mi>e</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>q</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>+</mml:mo><mml:mi>q</mml:mi><mml:msub><mml:mi>E</mml:mi><mml:mrow><mml:mi>e</mml:mi></mml:mrow></mml:msub></mml:math></disp-formula></p>
<p><xref ref-type="disp-formula" rid="eqn-4">Eq. (4)</xref> calculates the residual energy of each node after each communication [<xref ref-type="bibr" rid="ref-19">19</xref>].
<disp-formula id="eqn-4"><label>(4)</label><mml:math id="mml-eqn-4" display="block"><mml:msub><mml:mi>E</mml:mi><mml:mrow><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:mi>s</mml:mi></mml:mrow></mml:msub><mml:mo>=</mml:mo><mml:mrow><mml:mo>[</mml:mo><mml:msub><mml:mi>E</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>&#x2212;</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>E</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mi>x</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>q</mml:mi><mml:mo>,</mml:mo><mml:mi>d</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>+</mml:mo><mml:msub><mml:mi>E</mml:mi><mml:mrow><mml:mi>r</mml:mi><mml:mi>x</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>q</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>)</mml:mo></mml:mrow><mml:mo>]</mml:mo></mml:mrow></mml:math></disp-formula>where, <inline-formula id="ieqn-6"><mml:math id="mml-ieqn-6"><mml:msub><mml:mi>E</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> &#x003D; initial energy of the sensor</p>
<p><inline-formula id="ieqn-7"><mml:math id="mml-ieqn-7"><mml:msub><mml:mi>E</mml:mi><mml:mrow><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:mi>s</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> &#x003D; residual energy of each sensor.</p>
<p><bold>ii. Estimation of Packet Delivery Probability (PDP)</bold></p>
<p>In this section, the delivery of packets <inline-formula id="ieqn-8"><mml:math id="mml-ieqn-8"><mml:mi>p</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>n</mml:mi><mml:mo>,</mml:mo><mml:mi>e</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> Path loss, and SINR are used to evaluate the likelihood of bits for each pair of nodes with a distance. The path loss that depicts the amplification of a signal across a distance on a single, unobstructed propagation route, may be stated as follows:
<disp-formula id="eqn-5"><label>(5)</label><mml:math id="mml-eqn-5" display="block"><mml:mi>B</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>e</mml:mi><mml:mo>,</mml:mo><mml:mi>s</mml:mi><mml:mo stretchy="false">)</mml:mo><mml:mo>=</mml:mo><mml:msup><mml:mi>e</mml:mi><mml:mrow><mml:mi>f</mml:mi></mml:mrow></mml:msup><mml:mi>b</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>s</mml:mi><mml:msup><mml:mo stretchy="false">)</mml:mo><mml:mrow><mml:mi>e</mml:mi></mml:mrow></mml:msup></mml:math></disp-formula>where, <inline-formula id="ieqn-9"><mml:math id="mml-ieqn-9"><mml:mi>f</mml:mi></mml:math></inline-formula> denotes the spreading coefficient and <inline-formula id="ieqn-10"><mml:math id="mml-ieqn-10"><mml:mi>b</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>s</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> denotes the absorption factor. The spreading coefficient <inline-formula id="ieqn-11"><mml:math id="mml-ieqn-11"><mml:mi>f</mml:mi></mml:math></inline-formula> is mostly used to establish propagation geometry.</p>
<p>In the case of spherical spreading, <inline-formula id="ieqn-12"><mml:math id="mml-ieqn-12"><mml:mi>f</mml:mi><mml:mo>=</mml:mo><mml:mn>2</mml:mn><mml:mo>,</mml:mo></mml:math></inline-formula> and in the case of cylindrical spreading <inline-formula id="ieqn-13"><mml:math id="mml-ieqn-13"><mml:mi>f</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:math></inline-formula>. Whereas in the case of a practical scenario, <inline-formula id="ieqn-14"><mml:math id="mml-ieqn-14"><mml:mi>f</mml:mi></mml:math></inline-formula> is given as 1.5. The absorption factor b<inline-formula id="ieqn-15"><mml:math id="mml-ieqn-15"><mml:mrow><mml:mo>(</mml:mo><mml:mi>s</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:math></inline-formula> for <inline-formula id="ieqn-16"><mml:math id="mml-ieqn-16"><mml:mi>s</mml:mi></mml:math></inline-formula> (in kHz) is calculated from the following formula:
<disp-formula id="eqn-6"><label>(6)</label><mml:math id="mml-eqn-6" display="block"><mml:mn>10</mml:mn><mml:mi>l</mml:mi><mml:mi>o</mml:mi><mml:msub><mml:mi>g</mml:mi><mml:mrow><mml:mi>b</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>s</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mn>0.11</mml:mn><mml:mrow><mml:mo>(</mml:mo><mml:mfrac><mml:msup><mml:mi>s</mml:mi><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup><mml:mrow><mml:mn>1</mml:mn><mml:mo>+</mml:mo><mml:msup><mml:mi>s</mml:mi><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup></mml:mrow></mml:mfrac><mml:mo>)</mml:mo></mml:mrow><mml:mo>+</mml:mo><mml:mn>44</mml:mn><mml:mrow><mml:mo>(</mml:mo><mml:mfrac><mml:mi>s</mml:mi><mml:mrow><mml:mn>4100</mml:mn><mml:mo>+</mml:mo><mml:mi>s</mml:mi></mml:mrow></mml:mfrac><mml:mo>)</mml:mo></mml:mrow><mml:mo>+</mml:mo><mml:mn>2.75</mml:mn><mml:mo>&#x00D7;</mml:mo><mml:msup><mml:mn>10</mml:mn><mml:mrow><mml:mo>&#x2212;</mml:mo><mml:mn>4</mml:mn></mml:mrow></mml:msup><mml:msup><mml:mi>s</mml:mi><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup><mml:mo>+</mml:mo><mml:mn>0.003</mml:mn></mml:math></disp-formula></p>
<p>The average SINR over distance <inline-formula id="ieqn-17"><mml:math id="mml-ieqn-17"><mml:mi>e</mml:mi></mml:math></inline-formula> is given as below:
<disp-formula id="eqn-7"><label>(7)</label><mml:math id="mml-eqn-7" display="block"><mml:mi>n</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>d</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mfrac><mml:msub><mml:mi>F</mml:mi><mml:mrow><mml:mi>a</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:msub><mml:mi>M</mml:mi><mml:mrow><mml:mn>0</mml:mn></mml:mrow></mml:msub><mml:msup><mml:mi>e</mml:mi><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msup><mml:mi>b</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:mi>s</mml:mi><mml:msup><mml:mo stretchy="false">)</mml:mo><mml:mrow><mml:mi>e</mml:mi></mml:mrow></mml:msup></mml:mrow></mml:mfrac></mml:math></disp-formula>where, <inline-formula id="ieqn-18"><mml:math id="mml-ieqn-18"><mml:msub><mml:mi>F</mml:mi><mml:mrow><mml:mi>a</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> and <inline-formula id="ieqn-19"><mml:math id="mml-ieqn-19"><mml:msub><mml:mi>M</mml:mi><mml:mrow><mml:mn>0</mml:mn></mml:mrow></mml:msub></mml:math></inline-formula> denote the average throughput energy per bit and power density of noise in non-fading Additive White Gaussian Noise (AWGN) channel.</p>
<p>Binary Phase Shift Keying (BPSK) is considered here, commonly used in the UWSNs. Each word in BPSK typically contains a bit. As a result, the probability of a bit mistake over distance can be expressed as follows:
<disp-formula id="eqn-8"><label>(8)</label><mml:math id="mml-eqn-8" display="block"><mml:msub><mml:mi>p</mml:mi><mml:mrow><mml:mi>g</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>e</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mfrac><mml:mn>1</mml:mn><mml:mn>2</mml:mn></mml:mfrac><mml:mrow><mml:mo>(</mml:mo><mml:mn>1</mml:mn><mml:mo>&#x2212;</mml:mo><mml:msqrt><mml:mfrac><mml:mrow><mml:mi>n</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>e</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mrow><mml:mn>1</mml:mn><mml:mo>+</mml:mo><mml:mi>n</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:mi>e</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:mfrac></mml:msqrt><mml:mo>)</mml:mo></mml:mrow></mml:math></disp-formula></p>
<p>As a result, for each pair of nodes separated by a distance, the delivery probability (<inline-formula id="ieqn-20"><mml:math id="mml-ieqn-20"><mml:msub><mml:mi>d</mml:mi><mml:mrow><mml:mi>p</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula>) of a packet of size may be calculated as follows:
<disp-formula id="eqn-9"><label>(9)</label><mml:math id="mml-eqn-9" display="block"><mml:msub><mml:mi>d</mml:mi><mml:mrow><mml:mi>p</mml:mi></mml:mrow></mml:msub><mml:mrow><mml:mo>(</mml:mo><mml:mi>e</mml:mi><mml:mo>&#x00D7;</mml:mo><mml:mi>n</mml:mi><mml:mo>)</mml:mo></mml:mrow><mml:mo>=</mml:mo><mml:mrow><mml:mo>(</mml:mo><mml:mn>1</mml:mn><mml:mo>&#x2212;</mml:mo><mml:mi>p</mml:mi><mml:mrow><mml:mo>(</mml:mo><mml:msup><mml:mi>e</mml:mi><mml:mrow><mml:mi>n</mml:mi></mml:mrow></mml:msup><mml:mo>)</mml:mo></mml:mrow><mml:mo>)</mml:mo></mml:mrow></mml:math></disp-formula></p>
<p><bold>iii. Distance from BS</bold></p>
<p>Every node determines the distance towards BS depending on the Received Signals Strength (RSS). Friis Equation is used to calculate RSS [<xref ref-type="bibr" rid="ref-20">20</xref>].
<disp-formula id="eqn-10"><label>(10)</label><mml:math id="mml-eqn-10" display="block"><mml:mi>R</mml:mi><mml:mi>S</mml:mi><mml:mi>S</mml:mi><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:msub><mml:mi>p</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mi>x</mml:mi></mml:mrow></mml:msub><mml:mo>&#x00D7;</mml:mo><mml:mi>&#x03B1;</mml:mi><mml:mo>&#x00D7;</mml:mo><mml:mi>&#x03B2;</mml:mi><mml:mo>&#x00D7;</mml:mo><mml:mi>&#x03BC;</mml:mi><mml:mo>&#x00D7;</mml:mo><mml:msub><mml:mi>h</mml:mi><mml:mrow><mml:mi>r</mml:mi><mml:mi>x</mml:mi></mml:mrow></mml:msub><mml:mo>&#x00D7;</mml:mo><mml:msub><mml:mi>h</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mi>x</mml:mi></mml:mrow></mml:msub></mml:mrow><mml:mrow><mml:mo stretchy="false">(</mml:mo><mml:mn>4</mml:mn><mml:mo>&#x00D7;</mml:mo><mml:mi>&#x03BC;</mml:mi><mml:mo>&#x00D7;</mml:mo><mml:mi>d</mml:mi><mml:msup><mml:mo stretchy="false">)</mml:mo><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msup><mml:mo>&#x00D7;</mml:mo><mml:mi>x</mml:mi></mml:mrow></mml:mfrac></mml:math></disp-formula>where, <inline-formula id="ieqn-21"><mml:math id="mml-ieqn-21"><mml:msub><mml:mi>p</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mi>x</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> &#x003D; transmitter&#x2019;s power</p>
<p><inline-formula id="ieqn-22"><mml:math id="mml-ieqn-22"><mml:mi>&#x03B1;</mml:mi></mml:math></inline-formula> &#x003D; transmitter gain</p>
<p><inline-formula id="ieqn-23"><mml:math id="mml-ieqn-23"><mml:mi>&#x03B2;</mml:mi></mml:math></inline-formula> &#x003D; receiver gain</p>
<p><inline-formula id="ieqn-24"><mml:math id="mml-ieqn-24"><mml:mi>&#x03BC;</mml:mi></mml:math></inline-formula> &#x003D; wavelength</p>
<p><inline-formula id="ieqn-25"><mml:math id="mml-ieqn-25"><mml:msub><mml:mi>h</mml:mi><mml:mrow><mml:mi>r</mml:mi><mml:mi>x</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> &#x003D; power at receiver</p>
<p><inline-formula id="ieqn-26"><mml:math id="mml-ieqn-26"><mml:msub><mml:mi>h</mml:mi><mml:mrow><mml:mi>t</mml:mi><mml:mi>x</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> &#x003D; output power of transmitter</p>
<p><inline-formula id="ieqn-27"><mml:math id="mml-ieqn-27"><mml:mi>d</mml:mi></mml:math></inline-formula> &#x003D; distance between transmitter and sink</p>
<p><inline-formula id="ieqn-28"><mml:math id="mml-ieqn-28"><mml:mi>x</mml:mi></mml:math></inline-formula> &#x003D; system loss.</p>
<p>Hence, the distance is evaluated by <xref ref-type="disp-formula" rid="eqn-11">Eq. (11)</xref>:
<disp-formula id="eqn-11"><label>(11)</label><mml:math id="mml-eqn-11" display="block"><mml:mi>d</mml:mi><mml:mo>=</mml:mo><mml:munderover><mml:mo>&#x2211;</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:munderover><mml:mo stretchy="false">(</mml:mo><mml:msub><mml:mi>f</mml:mi><mml:mrow><mml:mn>1</mml:mn></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:msub><mml:mi>f</mml:mi><mml:mrow><mml:mn>2</mml:mn></mml:mrow></mml:msub><mml:mo>+</mml:mo><mml:mo>&#x2026;</mml:mo><mml:mo>+</mml:mo><mml:msub><mml:mi>f</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo stretchy="false">)</mml:mo></mml:math></disp-formula><disp-formula id="ueqn-12"><mml:math id="mml-ueqn-12" display="block"><mml:mrow><mml:mtext>i</mml:mtext></mml:mrow><mml:mo>.</mml:mo><mml:mrow><mml:mtext>e</mml:mtext></mml:mrow><mml:mo>.</mml:mo><mml:mo>,</mml:mo><mml:mi>d</mml:mi><mml:mo>=</mml:mo><mml:msubsup><mml:mo movablelimits="false">&#x2211;</mml:mo><mml:mrow><mml:mi>i</mml:mi><mml:mo>=</mml:mo><mml:mn>1</mml:mn></mml:mrow><mml:mrow><mml:mi>k</mml:mi></mml:mrow></mml:msubsup><mml:mrow><mml:mo>(</mml:mo><mml:msub><mml:mi>f</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>)</mml:mo></mml:mrow></mml:math></disp-formula></p>
<p>where, <inline-formula id="ieqn-29"><mml:math id="mml-ieqn-29"><mml:msub><mml:mi>f</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> &#x003D; cumulative distance from <inline-formula id="ieqn-30"><mml:math id="mml-ieqn-30"><mml:msub><mml:mi>N</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> to the base station.</p>
</sec>
<sec id="s3_3">
<label>3.3</label>
<title>CH Selection Based on Fuzzy Logic</title>
<p>FLD model is used to select CHs, fuzzy membership functions take the parameters residual energy, distance to BS, and delivery probability as inputs, and the probability for choosing CH is calculated using fuzzy rules. The following are the processes for determining fuzzy rule-based interference.
<list list-type="bullet">
<list-item>
<p><italic>Fuzzification</italic>: This entails extracting better product quality from the input data chosen and evaluating the degree corresponding to inputs of each appropriate fuzzy set.</p></list-item>
<list-item>
<p><italic>Rule Evaluation:</italic> The collected fuzzy inputs compared with fuzzy rules forebears. Thereafter implement to the membership function consequently.</p></list-item>
<list-item>
<p><italic>Aggregation of the rule outputs</italic>: It entails combining the results of entire rules.</p></list-item>
<list-item>
<p><italic>Defuzzification:</italic> The collected output fuzzy set merged output is utilized as the input for the defuzzification process, and the result is a single integer.</p></list-item>
</list></p>
<p>The rule base is shown in <xref ref-type="fig" rid="fig-2">Fig. 2</xref>.</p>
<fig id="fig-2">
<label>Figure 2</label>
<caption>
<title>CH selection using a fuzzy model</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMC_62608-fig-2.tif"/>
</fig>
<p><list list-type="simple">
<list-item><label>i.</label><p><bold>Fuzzification</bold></p></list-item>
</list></p>
<p>Fuzzification involves input variables like Residual Energy (<inline-formula id="ieqn-31"><mml:math id="mml-ieqn-31"><mml:msub><mml:mi mathvariant="bold-italic">E</mml:mi><mml:mrow><mml:mi mathvariant="bold-italic">r</mml:mi><mml:mi mathvariant="bold-italic">e</mml:mi><mml:mi mathvariant="bold-italic">s</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula>), Distances to sink (D), and Delivery Probability (DP). These variables are assigned a level to appropriate fuzzy value sets with two possibilities high and low. <xref ref-type="fig" rid="fig-3">Figs. 3</xref>&#x2013;<xref ref-type="fig" rid="fig-5">5</xref> depict the membership function of input variables, whereas <xref ref-type="fig" rid="fig-6">Fig. 6</xref> shows the membership function of output variable.</p>
<fig id="fig-3">
<label>Figure 3</label>
<caption>
<title>Membership function of residual energy</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMC_62608-fig-3.tif"/>
</fig><fig id="fig-4">
<label>Figure 4</label>
<caption>
<title>Membership function of distance</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMC_62608-fig-4.tif"/>
</fig><fig id="fig-5">
<label>Figure 5</label>
<caption>
<title>Membership function of DP</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMC_62608-fig-5.tif"/>
</fig><fig id="fig-6">
<label>Figure 6</label>
<caption>
<title>Membership function of selection probability</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMC_62608-fig-6.tif"/>
</fig>
<p><xref ref-type="table" rid="table-2">Table 2</xref> depicts the designed fuzzy inference model that evaluates the function of the inference system and technique through the outcome of all rules joined that make the fuzzy decision. For example, Rule 8th If, (E<sub>res</sub> &#x0026; DP &#x003D; H) and (D &#x003D; L), then CH selection probability is High.</p>
<table-wrap id="table-2">
<label>Table 2</label>
<caption>
<title>Fuzzy rules</title>
</caption>
<table>
<colgroup>
<col/>
<col/>
<col/>
<col/>
<col/>
</colgroup>
<thead>
<tr>
<th>S. no.</th>
<th><bold>E<sub><bold>res</bold></sub></bold></th>
<th>D</th>
<th>DP</th>
<th>SP</th>
</tr>
</thead>
<tbody>
<tr>
<td>1</td>
<td>L</td>
<td>H</td>
<td>L</td>
<td>L</td>
</tr>
<tr>
<td>2</td>
<td>L</td>
<td>H</td>
<td>H</td>
<td>L</td>
</tr>
<tr>
<td>3</td>
<td>L</td>
<td>L</td>
<td>L</td>
<td>L</td>
</tr>
<tr>
<td>4</td>
<td>L</td>
<td>L</td>
<td>H</td>
<td>M</td>
</tr>
<tr>
<td>5</td>
<td>H</td>
<td>H</td>
<td>L</td>
<td>L</td>
</tr>
<tr>
<td>6</td>
<td>H</td>
<td>H</td>
<td>H</td>
<td>M</td>
</tr>
<tr>
<td>7</td>
<td>H</td>
<td>L</td>
<td>L</td>
<td>M</td>
</tr>
<tr>
<td>8</td>
<td>H</td>
<td>L</td>
<td>H</td>
<td>H</td>
</tr>
</tbody>
</table>
</table-wrap>
<p><list list-type="simple">
<list-item><label>ii.</label><p><bold>Defuzzification</bold></p></list-item>
</list></p>
<p>Defuzzification is the process of extracting numerical output from a fuzzy set and using them as interpretation values. During the fuzzy choice-making process, the midpoint of the area method is examined for defuzzification.
<disp-formula id="eqn-12"><label>(12)</label><mml:math id="mml-eqn-12" display="block"><mml:mi>F</mml:mi><mml:mi>u</mml:mi><mml:mi>z</mml:mi><mml:mi>z</mml:mi><mml:msub><mml:mi>y</mml:mi><mml:mrow><mml:mo>&#x2212;</mml:mo></mml:mrow></mml:msub><mml:mi>c</mml:mi><mml:mi>o</mml:mi><mml:mi>s</mml:mi><mml:mi>t</mml:mi><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:mo stretchy="false">[</mml:mo><mml:munder><mml:mo>&#x2211;</mml:mo><mml:mrow><mml:mi>a</mml:mi><mml:mi>l</mml:mi><mml:mi>l</mml:mi><mml:mi>r</mml:mi><mml:mi>u</mml:mi><mml:mi>l</mml:mi><mml:mi>e</mml:mi><mml:mi>s</mml:mi></mml:mrow></mml:munder><mml:msub><mml:mi>f</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo>&#x00D7;</mml:mo><mml:mi>&#x03B1;</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:msub><mml:mi>f</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo stretchy="false">)</mml:mo><mml:mo stretchy="false">]</mml:mo></mml:mrow><mml:mrow><mml:mo stretchy="false">[</mml:mo><mml:munder><mml:mo>&#x2211;</mml:mo><mml:mrow><mml:mi>a</mml:mi><mml:mi>l</mml:mi><mml:mi>l</mml:mi><mml:mi>r</mml:mi><mml:mi>u</mml:mi><mml:mi>l</mml:mi><mml:mi>e</mml:mi><mml:mi>s</mml:mi></mml:mrow></mml:munder><mml:mi>&#x03B1;</mml:mi><mml:mo stretchy="false">(</mml:mo><mml:msub><mml:mi>f</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub><mml:mo stretchy="false">)</mml:mo><mml:mo stretchy="false">]</mml:mo></mml:mrow></mml:mfrac></mml:math></disp-formula></p>
<p>where, <inline-formula id="ieqn-32"><mml:math id="mml-ieqn-32"><mml:mi>F</mml:mi><mml:mi>u</mml:mi><mml:mi>z</mml:mi><mml:mi>z</mml:mi><mml:msub><mml:mi>y</mml:mi><mml:mrow><mml:mo>&#x2212;</mml:mo></mml:mrow></mml:msub><mml:mi>c</mml:mi><mml:mi>o</mml:mi><mml:mi>s</mml:mi><mml:mi>t</mml:mi></mml:math></inline-formula> denotes the degree of the outcome, <inline-formula id="ieqn-33"><mml:math id="mml-ieqn-33"><mml:msub><mml:mi>f</mml:mi><mml:mrow><mml:mi>i</mml:mi></mml:mrow></mml:msub></mml:math></inline-formula> denotes the fuzzy all rules, and the variable denotes the membership function. This de-fuzzification method converts the fuzzy cost function&#x2019;s output to a numerical set.</p>
</sec>
<sec id="s3_4">
<label>3.4</label>
<title>Cluster-Based Data Gathering</title>
<p>In the data aggregation phase, CH collects information from sensors and saves it as a vector to decrease data duplication. When new data is received, a similarity function is used to compare the two vectors. If the two sets of data are similar, the CH sends only one set of non-duplicated data to the BS. If the distance to BS/sink changes beyond a limit, then the re-clustering phase is initiated again. The following Algorithm 1 demonstrates the data-gathering procedure of CDAFDM.</p>
<fig id="fig-15">
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMC_62608-fig-15.tif"/>
</fig>
</sec>
<sec id="s3_5">
<label>3.5</label>
<title>Re-Clustering</title>
<p>Re-clustering, the last phase of the proposed method, implies that the network maintains its effectiveness and flexibility in a changing undersea environment. Re-clustering is necessary to provide dependable data transmission in mobile UWSNs since node movement and energy depletion cause constant topology changes. When a CH no longer satisfies the ideal communication circumstances, this procedure is initiated. To avoid communication failure and increase network longevity, a CH is replaced if its remaining energy falls below a certain level. Similarly, re-clustering is started to restructure the cluster structure and preserve stable connections if a CH travels too far from its assigned cluster or if its coverage efficiency decreases. PDP is another important consideration; a new CH is chosen to restore effective data aggregation and delivery when transmission reliability declines as a result of poor signal strength or excessive interference. The network may adapt dynamically to changing circumstances thanks to this adaptive mechanism, which guarantees steady performance, lower packet loss, and improved energy management. The selection procedure uses the FLD model to identify the best CH, adhering to the same methodology as covered in the earlier sections.</p>
</sec>
</sec>
<sec id="s4">
<label>4</label>
<title>Simulation Parameters and Result Analysis</title>
<p>NS2 with Aqua-Sim toolkit is used for the simulation of the proposed CDAFDM framework. It is chosen due to its dedicated support for underwater networks, customizable protocol implementation, and open-source flexibility. Unlike OPNET, which is proprietary, and GloMoSim, which lacks underwater modules, NS2 allows precise modeling of acoustic communication, mobility patterns, and energy consumption, making it the most suitable choice for evaluating UWSN performance [<xref ref-type="bibr" rid="ref-21">21</xref>]. The acoustic interference loss, travel model, and packet delays are all efficiently addressed by Aqua-Sim. It is an entity framework and can be deployed in three dimensions. <xref ref-type="table" rid="table-3">Table 3</xref> lists the system parameters and settings of our proposed framework.</p>
<table-wrap id="table-3">
<label>Table 3</label>
<caption>
<title>Simulation parameters</title>
</caption>
<table>
<colgroup>
<col/>
<col/>
</colgroup>
<thead>
<tr>
<th>Parameter Name</th>
<th>Values</th>
</tr>
</thead>
<tbody>
<tr>
<td>Number of nodes</td>
<td>100</td>
</tr>
<tr>
<td>Area size</td>
<td>1000 m &#x00D7; 1000 m &#x00D7; 100 m</td>
</tr>
<tr>
<td>MAC protocol</td>
<td>Underwater Mac</td>
</tr>
<tr>
<td>Simulation time</td>
<td>100 s</td>
</tr>
<tr>
<td>Channel</td>
<td>Underwater channel</td>
</tr>
<tr>
<td>Range</td>
<td>100 m</td>
</tr>
<tr>
<td>Initial eergy</td>
<td>10,000 J</td>
</tr>
<tr>
<td>Transmission power</td>
<td>2.0 W</td>
</tr>
<tr>
<td>Receiving power</td>
<td>0.75 W</td>
</tr>
<tr>
<td>Idle power</td>
<td>0.008 W</td>
</tr>
<tr>
<td>Frequency</td>
<td>25 KHz</td>
</tr>
<tr>
<td>Interval</td>
<td>100</td>
</tr>
<tr>
<td>Range</td>
<td>100, 150, 200, 250 and 300 m</td>
</tr>
<tr>
<td>Interval (milli second)</td>
<td>100, 200, 300, 400 and 500</td>
</tr>
</tbody>
</table>
</table-wrap>
<p>The proposed CDAFDM is compared with Event-Driven Data Gathering (EDDG), data Collection Algorithm for underwater Optical Acoustic Sensor Networks (CAPTAIN), and Data Collection Based on Mobile Edge Computing (DCBMEC) approaches. The execution is evaluated on the dimensions of data gathering delay, packet delivery ratio, packet drop, and energy usage. Simulation has been done on the basis of (i) Data generation interval and (ii) Transmission range.</p>
<sec id="s4_1">
<label>4.1</label>
<title>Based on Data Generation Interval</title>
<p>In this research, the data generation interval is altered as 100, 200, 300, 400, and 500 ms.
<list list-type="simple">
<list-item>
<label>i.</label><p><bold><italic>Packet delivery ratio</italic>:</bold> The ratio of received packets to total transmitted packets sent out by the source node to the primary node in the network.</p></list-item>
</list></p>
<p><disp-formula id="eqn-13"><label>(13)</label><mml:math id="mml-eqn-13" display="block"><mml:mi>P</mml:mi><mml:mi>R</mml:mi><mml:mi>D</mml:mi><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:mi>R</mml:mi><mml:mi>D</mml:mi></mml:mrow><mml:mrow><mml:mi>L</mml:mi><mml:mi>D</mml:mi></mml:mrow></mml:mfrac></mml:math></disp-formula>where, <inline-formula id="ieqn-60"><mml:math id="mml-ieqn-60"><mml:mi>R</mml:mi><mml:mi>D</mml:mi></mml:math></inline-formula> &#x003D; received data</p>
<p><inline-formula id="ieqn-61"><mml:math id="mml-ieqn-61"><mml:mi>L</mml:mi><mml:mi>D</mml:mi></mml:math></inline-formula> &#x003D; lost data.</p>
<p><xref ref-type="fig" rid="fig-7">Fig. 7</xref> shows the visual depiction of the packet delivery ratio with different data generation intervals. With the increase in data generation intervals, the values of CDAFDM, CAPTAIN, and EDDG decrease from 0.9434 to 0.9414, 0.9265 to 0.9207, 0.9143 to 0.9140, respectively, and for DCBMEC the value increases from 0.9 to 0.9045. Since CDAFDM avoids inter-cluster collisions and provides reliable transmission, the packet delivery ratio of CDAFDM is 2% higher when compared to CAPTAIN, 3% higher than EDDG, and 4% higher than DCBMEC.</p>
<fig id="fig-7">
<label>Figure 7</label>
<caption>
<title>Packet delivery ratio for data generation intervals</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMC_62608-fig-7.tif"/>
</fig>
<p><list list-type="simple">
<list-item><label>ii.</label><p><bold><italic>Packets dropped:</italic></bold> Defined as loss of packets during the transmission to the intended destination.</p></list-item>
</list></p>
<p><disp-formula id="eqn-14"><label>(14)</label><mml:math id="mml-eqn-14" display="block"><mml:mi>P</mml:mi><mml:mi>D</mml:mi><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:mi>t</mml:mi><mml:mi>o</mml:mi><mml:mi>t</mml:mi><mml:mi>a</mml:mi><mml:mi>l</mml:mi><mml:mspace width="thinmathspace" /><mml:mi>n</mml:mi><mml:mi>u</mml:mi><mml:mi>m</mml:mi><mml:mi>b</mml:mi><mml:mi>e</mml:mi><mml:mi>r</mml:mi><mml:mspace width="thinmathspace" /><mml:mi>o</mml:mi><mml:mi>f</mml:mi><mml:mspace width="thinmathspace" /><mml:mi>p</mml:mi><mml:mi>a</mml:mi><mml:mi>c</mml:mi><mml:mi>k</mml:mi><mml:mi>e</mml:mi><mml:mi>t</mml:mi><mml:mi>s</mml:mi><mml:mspace width="thinmathspace" /><mml:mrow><mml:mo>(</mml:mo><mml:mi>t</mml:mi><mml:mi>p</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mrow><mml:mi>n</mml:mi><mml:mi>u</mml:mi><mml:mi>m</mml:mi><mml:mi>b</mml:mi><mml:mi>e</mml:mi><mml:mi>r</mml:mi><mml:mspace width="thinmathspace" /><mml:mi>o</mml:mi><mml:mi>f</mml:mi><mml:mspace width="thinmathspace" /><mml:mi>p</mml:mi><mml:mi>a</mml:mi><mml:mi>c</mml:mi><mml:mi>k</mml:mi><mml:mi>e</mml:mi><mml:mi>t</mml:mi><mml:mi>s</mml:mi><mml:mspace width="thinmathspace" /><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:mi>c</mml:mi><mml:mi>e</mml:mi><mml:mi>i</mml:mi><mml:mi>v</mml:mi><mml:mi>e</mml:mi><mml:mi>d</mml:mi><mml:mspace width="thinmathspace" /><mml:mrow><mml:mo>(</mml:mo><mml:mi>r</mml:mi><mml:mi>p</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:mfrac></mml:math></disp-formula>where, <inline-formula id="ieqn-62"><mml:math id="mml-ieqn-62"><mml:mi>t</mml:mi><mml:mi>p</mml:mi></mml:math></inline-formula> &#x003D; total number of packets</p>
<p><inline-formula id="ieqn-63"><mml:math id="mml-ieqn-63"><mml:mi>r</mml:mi><mml:mi>p</mml:mi></mml:math></inline-formula> &#x003D; received packets.</p>
<p><xref ref-type="fig" rid="fig-8">Fig. 8</xref> shows the outcome of packet drop with different data generation intervals. With the increase in data generation interval, the values of CAPTIAN, EDDG, and DCBMEC increase from 277 to 285, 314 to 324, and 323 to 333 while for our proposed technique CDAFDM increases slightly from 266 to 270 means there is less packet loss. Since CDAFDM avoids inter-cluster collisions and provides reliable transmission, the packet drop of CDAFDM is 5% less than CAPTAIN, 13% less than EDDG, and 15% less than DCBMEC.</p>
<fig id="fig-8">
<label>Figure 8</label>
<caption>
<title>Packets dropped for data generation interval</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMC_62608-fig-8.tif"/>
</fig>
<p><list list-type="simple">
<list-item><label>iii.</label>
<p><bold><italic>Data Gathering Delay</italic>:</bold> <xref ref-type="fig" rid="fig-9">Fig. 9</xref> demonstrates data findings gathering delay for varying the data generation intervals. In this with an increase in data generation intervals, the value of the CAPTAIN decreases from 0.1726 to 0.1703, and for EDDG and DCBMEC it increases from 0.1813 to 0.1883 and 0.1885 to 0.1946 respectively while considering the proposed method CDAFDM the values decrease from 0.0883 to 0.0874. Since CDAFDM selects CHs with the shortest distance and avoids data collisions, the data-gathering delay of CDAFDM is 49% less than CAPTAIN, 52% less than EDDG, and 53% less than DCBMEC.</p>
</list-item>
</list></p>
<fig id="fig-9">
<label>Figure 9</label>
<caption>
<title>Data gathering delay for data generation intervals</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMC_62608-fig-9.tif"/>
</fig>
<p><list list-type="simple">
<list-item><label>iv.</label><p><bold><italic>Energy Consumption</italic>:</bold> Defined as the entire quantity of energy consumption for transferring, reception, and data aggregation. <xref ref-type="fig" rid="fig-10">Fig. 10</xref> shows the outcomes of maximum energy consumption with changing intervals between data creation. With the increase in data generation interval from 0 to 500 the value of CAPTAIN, EDDG, and DCBMEC increases from 680.42 to 701.85, 799.73 to 802.23, and 815 to 845 respectively while for the proposed method the value is slightly increases from 646.36 to 658.11. Since CDAFDM avoids the energy hole problem, the energy usage of CDAFDM is 5% less when contrasted to CAPTAIN, 18% less that of EDDG, and 21% less than DCBMEC.</p>
</list-item>
</list></p>
<fig id="fig-10">
<label>Figure 10</label>
<caption>
<title>Energy consumption for data generation intervals</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMC_62608-fig-10.tif"/>
</fig>
<p><bold><italic>Comparative Analysis</italic>:</bold> The performance comparison between CDAFDM, CAPTAIN, EDDG, and DCBMEC clearly demonstrates the efficiency of the proposed approach. CDAFDM consistently achieves higher packet delivery ratios across different data generation intervals (shown in <xref ref-type="fig" rid="fig-7">Fig. 7</xref>) due to its optimized CH selection and re-clustering mechanism, that ensures stable communication links. In contrast, CAPTAIN and EDDG suffer from intra-cluster collisions and inefficient CH replacement, leading to more packet loss (shown in <xref ref-type="fig" rid="fig-8">Fig. 8</xref>). The reduced packet drop rate in CDAFDM is attributed to its similarity-based data aggregation, which prevents redundant transmissions, and minimizes network congestion. Unlike DCBMEC, which relies on a mobile edge computing model with higher processing overhead, CDAFDM efficiently balances data transmission loads, reducing packet loss by 6&#x2013;18% compared to other methods. The data collection delay (<xref ref-type="fig" rid="fig-9">Fig. 9</xref>) is significantly lower in CDAFDM, with a 48&#x2013;52% reduction compared to CAPTAIN and EDDG. This improvement results from shorter communication paths, efficient CH selection, and optimized re-clustering, that adaptively reassigns CHs before network instability occurs. CAPTAIN and EDDG experience higher latency due to suboptimal CH selection, which leads to frequent retransmissions and delayed data aggregation.</p>

<p>Regarding energy consumption as shown in <xref ref-type="fig" rid="fig-10">Fig. 10</xref>, CDAFDM shows 7%&#x2013;18% lower energy usage compared to CAPTAIN, EDDG, and DCBMEC. This improvement is due to its intelligent CH selection based on residual energy and data similarity-based aggregation, it reduces redundant data transmissions. In contrast, CAPTAIN and EDDG experience higher energy depletion due to multi-hop relay inefficiencies, while DCBMEC suffers from higher computational overhead associated with edge processing.</p>
</sec>
<sec id="s4_2">
<label>4.2</label>
<title>Based on Transmission Range</title>
<p>In this study data transmission range alters to 100, 150, 200, 250, and 300 m.
<list list-type="simple">
<list-item><label>i.</label><p><bold><italic>Data gathering delay</italic>:</bold> <xref ref-type="fig" rid="fig-11">Fig. 11</xref> shows the outcomes of data gathering delay for varied transmission ranges. As the range varies the value of CAPTAIN, EDDG, and DCBMEC decreases from 0.1697 to 0.1676, 0.1787 to 0.1716, and 0.1835 to 0.1796, respectively, while CDAFDM shows a slight decrease from 0.0871 to 0.0862. Since CDAFDM selects CHs with the shortest distance and avoids data collisions, the data-gathering delay of CDAFDM is 48% less than CAPTAIN, 50% less than EDDG, and 52% less than DCBMEC.</p>
</list-item>
</list></p>
<fig id="fig-11">
<label>Figure 11</label>
<caption>
<title>Data gathering delay for ranges</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMC_62608-fig-11.tif"/>
</fig>
<p><list list-type="simple">
<list-item><label>ii.</label>
<p><bold><italic>Packet delivery ratio</italic>:</bold> The ratio of received packets to total packets sent out by the source node to the primary node in the network.</p></list-item>
</list></p>
<p><disp-formula id="eqn-15"><label>(15)</label><mml:math id="mml-eqn-15" display="block"><mml:mi>P</mml:mi><mml:mi>R</mml:mi><mml:mi>D</mml:mi><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:mi>R</mml:mi><mml:mi>D</mml:mi></mml:mrow><mml:mrow><mml:mi>L</mml:mi><mml:mi>D</mml:mi></mml:mrow></mml:mfrac></mml:math></disp-formula>where, <inline-formula id="ieqn-64"><mml:math id="mml-ieqn-64"><mml:mi>R</mml:mi><mml:mi>D</mml:mi></mml:math></inline-formula> &#x003D; received data</p>
<p><inline-formula id="ieqn-65"><mml:math id="mml-ieqn-65"><mml:mi>L</mml:mi><mml:mi>D</mml:mi></mml:math></inline-formula> &#x003D; lost data.</p>
<p><xref ref-type="fig" rid="fig-12">Fig. 12</xref> shows the outcome of packet drop with different data transmission ranges. With the increase in the range value, the value of CAPTAIN, EDDG, and DCBMEC increases from 0.81999 to 0.9212, 0.8199 to 0.9143, and 0.81999 to 0.9035 respectively while as the proposed method CDAFDM the value increases from 0.81999 to 0.9329. Since CDAFDM avoids inter-cluster collisions and provides reliable transmission, the delivery ratio of CDAFDM is 2% higher compared to CAPTAIN, 3%% higher than EDDG, and 4% higher than DCBMEC.</p>
<fig id="fig-12">
<label>Figure 12</label>
<caption>
<title>Packet delivery ratio for ranges</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMC_62608-fig-12.tif"/>
</fig>
<p><list list-type="simple">
<list-item><label>iii.</label>
<p><bold><italic>Packet dropped</italic>:</bold> It is defined as the loss of packets during the transmission to the intended destination.</p></list-item>
</list></p>
<p><disp-formula id="eqn-16"><label>(16)</label><mml:math id="mml-eqn-16" display="block"><mml:mi>P</mml:mi><mml:mi>D</mml:mi><mml:mo>=</mml:mo><mml:mfrac><mml:mrow><mml:mi>t</mml:mi><mml:mi>o</mml:mi><mml:mi>t</mml:mi><mml:mi>a</mml:mi><mml:mi>l</mml:mi><mml:mspace width="thinmathspace" /><mml:mi>n</mml:mi><mml:mi>u</mml:mi><mml:mi>m</mml:mi><mml:mi>b</mml:mi><mml:mi>e</mml:mi><mml:mi>r</mml:mi><mml:mspace width="thinmathspace" /><mml:mi>o</mml:mi><mml:mi>f</mml:mi><mml:mspace width="thinmathspace" /><mml:mi>p</mml:mi><mml:mi>a</mml:mi><mml:mi>c</mml:mi><mml:mi>k</mml:mi><mml:mi>e</mml:mi><mml:mi>t</mml:mi><mml:mi>s</mml:mi><mml:mspace width="thinmathspace" /><mml:mrow><mml:mo>(</mml:mo><mml:mi>t</mml:mi><mml:mi>p</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow><mml:mrow><mml:mi>n</mml:mi><mml:mi>u</mml:mi><mml:mi>m</mml:mi><mml:mi>b</mml:mi><mml:mi>e</mml:mi><mml:mi>r</mml:mi><mml:mspace width="thinmathspace" /><mml:mi>o</mml:mi><mml:mi>f</mml:mi><mml:mspace width="thinmathspace" /><mml:mi>p</mml:mi><mml:mi>a</mml:mi><mml:mi>c</mml:mi><mml:mi>k</mml:mi><mml:mi>e</mml:mi><mml:mi>t</mml:mi><mml:mi>s</mml:mi><mml:mspace width="thinmathspace" /><mml:mi>r</mml:mi><mml:mi>e</mml:mi><mml:mi>c</mml:mi><mml:mi>e</mml:mi><mml:mi>i</mml:mi><mml:mi>v</mml:mi><mml:mi>e</mml:mi><mml:mi>d</mml:mi><mml:mspace width="thinmathspace" /><mml:mrow><mml:mo>(</mml:mo><mml:mi>r</mml:mi><mml:mi>p</mml:mi><mml:mo>)</mml:mo></mml:mrow></mml:mrow></mml:mfrac></mml:math></disp-formula>where, <inline-formula id="ieqn-66"><mml:math id="mml-ieqn-66"><mml:mi>t</mml:mi><mml:mi>p</mml:mi></mml:math></inline-formula> &#x003D; total number of packets</p>
<p><inline-formula id="ieqn-67"><mml:math id="mml-ieqn-67"><mml:mi>r</mml:mi><mml:mi>p</mml:mi></mml:math></inline-formula> &#x003D; received packets.</p>
<p><xref ref-type="fig" rid="fig-13">Fig. 13</xref> shows the outcome of packet drop with different transmission ranges. While increasing the range value the values of CAPTAIN, EDDG, and DCBMEC increase from 287 to 295, 315 to 319, and 320 to 334 respectively while in the proposed method the value slightly increases from 271 to 275. Since CDAFDM avoids inter-cluster collisions and provides reliable transmission, the packet drop of CDAFDM is 6% less compared to CAPTAIN, 14% less than EDDG, and 18% less than DCBMEC.</p>
<fig id="fig-13">
<label>Figure 13</label>
<caption>
<title>Packets dropped for transmission range</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMC_62608-fig-13.tif"/>
</fig>
<p><list list-type="simple">
<list-item><label>iv.</label><p><bold><italic>Energy consumption</italic>:</bold> It is defined as the overall quantity of energy consumption in broadcasting, reception, and data aggregation. <xref ref-type="fig" rid="fig-14">Fig. 14</xref> depicts the results of maximum energy consumption for the transmission range. With the increase in range value, the value of CAPTAIN, EDDG, and DCBMEC increases from 707.08 to 727.45, 790.48 to 799.09, and 808.73 to 825.34 respectively while the proposed method shows a slight increase from 660.97 to 672.12. Since CDAFDM avoids the energy hole problem, the energy usage of CDAFDM is 7% less when contrasted to CAPTAIN, 16% less than that of EDDG, and 18% less than DCBMEC.</p>
</list-item>
</list></p>
<fig id="fig-14">
<label>Figure 14</label>
<caption>
<title>Energy consumption for ranges</title>
</caption>
<graphic mimetype="image" mime-subtype="tif" xlink:href="CMC_62608-fig-14.tif"/>
</fig>
<p><bold><italic>Comparative Analysis</italic>:</bold> Across varying transmission ranges (<xref ref-type="fig" rid="fig-11">Figs. 11</xref>&#x2013;<xref ref-type="fig" rid="fig-14">14</xref>), CDAFDM maintains its superior performance by adapting to network topology changes, ensuring reliable data aggregation, and minimizing packet drops. The combination of fuzzy logic-based CH selection and adaptive re-clustering allows CDAFDM to outperform existing protocols in both short-range and long-range communication scenarios. These results highlight the strength of CDAFDM&#x2019;s intelligent CH selection, adaptive re-clustering, and optimized data aggregation, making it a more energy-efficient, low-latency, and high-reliability solution compared to CAPTAIN, EDDG, and DCBMEC.</p>

</sec>
</sec>
<sec id="s5">
<label>5</label>
<title>Conclusion</title>
<p>This study presented the CDAFDM framework, a cluster-based data aggregation approach designed for mobile UWSNs, incorporating a fuzzy decision model to enhance network efficiency. This framework is evaluated against existing protocols such as CAPTAIN, EDDG, and DCBMEC across various data generation intervals and transmission ranges, focusing on key performance metrics, including packet delivery ratio, packet drop, data collection latency, and energy consumption. Simulation results demonstrated that CDAFDM consistently outperformed the traditional approaches in all scenarios. Specifically, CDAFDM achieved a 2%&#x2013;4% increase in packet delivery ratio, 6%&#x2013;18% fewer packet losses, 48%&#x2013;52% lower data collection latency, and 7%&#x2013;18% less energy consumption compared to CAPTAIN, EDDG, and DCBMEC. These improvements are attributed to its efficient cluster head selection based on residual energy, proximity to the sink, and delivery probability, along with an adaptive re-clustering mechanism that ensures stable performance in dynamic underwater environments. The results confirm that CDAFDM not only enhances energy efficiency but also ensures reliable and timely data transmission, making it a robust and scalable solution for real-world underwater applications. The proposed methodology provides a significant advancement for researchers and industry professionals striving to overcome mobility challenges, energy constraints, and network reliability issues in UWSNs, clearing the path for undersea communication systems that are more sustainable and effective.</p>
<p>In order to increase flexibility and efficiency, this system can be further enhanced in subsequent work by including machine learning approaches for dynamic cluster head selection and investigating real-time implementation in vast underwater environments.</p>
</sec>
</body>
<back>
<ack>
<p>This work was supported by the Deanship of Scientific Research, the Vice Presidency for Graduate Studies and Scientific Research, King Faisal University, Saudi Arabia under the project (KFU250420).</p>
</ack>
<sec>
<title>Funding Statement</title>
<p>This work was funded by the Deanship of Scientific Research, the Vice Presidency for Graduate Studies and Scientific Research, King Faisal University, Saudi Arabia under the project (KFU250420).</p>
</sec>
<sec>
<title>Author Contributions</title>
<p>Study conception and design: Aadil Mushtaq Pandit, Manni Kumar, Naveen Kumar; data collection: Sachin Ahuja, Yonis Gulzar; analysis and interpretation of results: Rashi Rastogi, Rupesh Gupta; draft manuscript preparation: Aadil Mushtaq Pandit, Manni Kumar; final review editing: Naveen Kumar, Sachin Ahuja; supervision: Yonis Gulzar, Rashi Rastogi; project administration: Rupesh Gupta, Nitin Goyal. All authors reviewed the results and approved the final version of the manuscript.</p>
</sec>
<sec sec-type="data-availability">
<title>Availability of Data and Materials</title>
<p>Data will be made available from the corresponding author upon reasonable request.</p>
</sec>
<sec>
<title>Ethics Approval</title>
<p>Not applicable.</p>
</sec>
<sec sec-type="COI-statement">
<title>Conflicts of Interest</title>
<p>The authors declare no conflicts of interest regarding the present study.</p>
</sec>
<ref-list content-type="authoryear">
<title>References</title>
<ref id="ref-1"><label>[1]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Khalid</surname> <given-names>M</given-names></string-name>, <string-name><surname>Cao</surname> <given-names>Y</given-names></string-name>, <string-name><surname>Ahmad</surname> <given-names>N</given-names></string-name>, <string-name><surname>Khalid</surname> <given-names>W</given-names></string-name>, <string-name><surname>Dhawankar</surname> <given-names>P</given-names></string-name></person-group>. <article-title>Radius-based multipath courier node routing protocol for acoustic communications</article-title>. <source>IET Wirel Sens Syst</source>. <year>2018</year>;<volume>8</volume>(<issue>4</issue>):<fpage>183</fpage>&#x2013;<lpage>9</lpage>. doi:<pub-id pub-id-type="doi">10.1049/iet-wss.2017.0165</pub-id>.</mixed-citation></ref>
<ref id="ref-2"><label>[2]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Goyal</surname> <given-names>N</given-names></string-name>, <string-name><surname>Dave</surname> <given-names>M</given-names></string-name>, <string-name><surname>Verma</surname> <given-names>AK</given-names></string-name></person-group>. <article-title>Data aggregation in underwater wireless sensor network: recent approaches and issues</article-title>. <source>J King Saud Univ Comput Inf Sci</source>. <year>2019</year>;<volume>31</volume>(<issue>3</issue>):<fpage>275</fpage>&#x2013;<lpage>86</lpage>. doi:<pub-id pub-id-type="doi">10.1016/j.jksuci.2017.04.007</pub-id>.</mixed-citation></ref>
<ref id="ref-3"><label>[3]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Sun</surname> <given-names>L</given-names></string-name>, <string-name><surname>Wang</surname> <given-names>Y</given-names></string-name>, <string-name><surname>Hui</surname> <given-names>X</given-names></string-name>, <string-name><surname>Ma</surname> <given-names>X</given-names></string-name>, <string-name><surname>Bai</surname> <given-names>X</given-names></string-name>, <string-name><surname>Tan</surname> <given-names>M</given-names></string-name></person-group>. <article-title>Underwater robots and key technologies for operation control</article-title>. <source>Cyborg Bionic Syst</source>. <year>2024</year>;<volume>5</volume>(<issue>48</issue>):<fpage>89</fpage>. doi:<pub-id pub-id-type="doi">10.34133/cbsystems.0089</pub-id>; <pub-id pub-id-type="pmid">38550252</pub-id></mixed-citation></ref>
<ref id="ref-4"><label>[4]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Chen</surname> <given-names>B</given-names></string-name>, <string-name><surname>Hu</surname> <given-names>J</given-names></string-name>, <string-name><surname>Zhao</surname> <given-names>Y</given-names></string-name>, <string-name><surname>Ghosh</surname> <given-names>BK</given-names></string-name></person-group>. <article-title>Finite-time observer based tracking control of uncertain heterogeneous underwater vehicles using adaptive sliding mode approach</article-title>. <source>Neurocomputing</source>. <year>2022</year>;<volume>481</volume>(<issue>5</issue>):<fpage>322</fpage>&#x2013;<lpage>32</lpage>. doi:<pub-id pub-id-type="doi">10.1016/j.neucom.2022.01.038</pub-id>.</mixed-citation></ref>
<ref id="ref-5"><label>[5]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Sathish</surname> <given-names>K</given-names></string-name>, <string-name><surname>Hamdi</surname> <given-names>M</given-names></string-name>, <string-name><surname>Chinthaginjala</surname> <given-names>R</given-names></string-name>, <string-name><surname>Pau</surname> <given-names>G</given-names></string-name>, <string-name><surname>Ksibi</surname> <given-names>A</given-names></string-name>, <string-name><surname>Anbazhagan</surname> <given-names>R</given-names></string-name>, <etal>et al</etal></person-group>. <article-title>Reliable data transmission in underwater wireless sensor networks using a cluster-based routing protocol endorsed by member nodes</article-title>. <source>Electronics</source>. <year>2023</year>;<volume>12</volume>(<issue>6</issue>):<fpage>1287</fpage>. doi:<pub-id pub-id-type="doi">10.3390/electronics12061287</pub-id>.</mixed-citation></ref>
<ref id="ref-6"><label>[6]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Kartha</surname> <given-names>JJ</given-names></string-name>, <string-name><surname>Jacob</surname> <given-names>L</given-names></string-name></person-group>. <article-title>Network lifetime-aware data collection in Underwater Sensor Networks for delay-tolerant applications</article-title>. <source>S&#x0101;dhan&#x0101;</source>. <year>2017</year>;<volume>42</volume>(<issue>10</issue>):<fpage>1645</fpage>&#x2013;<lpage>64</lpage>. doi:<pub-id pub-id-type="doi">10.1007/s12046-017-0713-x</pub-id>.</mixed-citation></ref>
<ref id="ref-7"><label>[7]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Wibisono</surname> <given-names>A</given-names></string-name>, <string-name><surname>Alsharif</surname> <given-names>MH</given-names></string-name>, <string-name><surname>Song</surname> <given-names>HK</given-names></string-name>, <string-name><surname>Lee</surname> <given-names>BM</given-names></string-name></person-group>. <article-title>A survey on underwater wireless power and data transfer system</article-title>. <source>IEEE Access</source>. <year>2024</year>;<volume>12</volume>:<fpage>34942</fpage>&#x2013;<lpage>57</lpage>. doi:<pub-id pub-id-type="doi">10.1109/ACCESS.2024.3373791</pub-id>.</mixed-citation></ref>
<ref id="ref-8"><label>[8]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Choudhary</surname> <given-names>M</given-names></string-name>, <string-name><surname>Goyal</surname> <given-names>N</given-names></string-name></person-group>. <article-title>A rendezvous point-based data gathering in underwater wireless sensor networks for monitoring applications</article-title>. <source>Int J Commun</source>. <year>2022</year>;<volume>35</volume>(<issue>6</issue>):<fpage>e5078</fpage>. doi:<pub-id pub-id-type="doi">10.1002/dac.5078</pub-id>.</mixed-citation></ref>
<ref id="ref-9"><label>[9]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Ferri</surname> <given-names>G</given-names></string-name>, <string-name><surname>Cococcioni</surname> <given-names>M</given-names></string-name>, <string-name><surname>Alvarez</surname> <given-names>A</given-names></string-name></person-group>. <article-title>Mission planning and decision support for underwater glider networks: a sampling on-demand approach</article-title>. <source>Sensors</source>. <year>2015</year>;<volume>16</volume>(<issue>1</issue>):<fpage>28</fpage>. doi:<pub-id pub-id-type="doi">10.3390/s16010028</pub-id>; <pub-id pub-id-type="pmid">26712763</pub-id></mixed-citation></ref>
<ref id="ref-10"><label>[10]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Wang</surname> <given-names>S</given-names></string-name>, <string-name><surname>Nguyen</surname> <given-names>TLN</given-names></string-name>, <string-name><surname>Shin</surname> <given-names>Y</given-names></string-name></person-group>. <article-title>Data collection strategy for magnetic induction based monitoring in underwater sensor networks</article-title>. <source>IEEE Access</source>. <year>2018</year>;<volume>6</volume>:<fpage>43644</fpage>&#x2013;<lpage>53</lpage>. doi:<pub-id pub-id-type="doi">10.1109/ACCESS.2018.2861946</pub-id>.</mixed-citation></ref>
<ref id="ref-11"><label>[11]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Han</surname> <given-names>G</given-names></string-name>, <string-name><surname>Long</surname> <given-names>X</given-names></string-name>, <string-name><surname>Zhu</surname> <given-names>C</given-names></string-name>, <string-name><surname>Guizani</surname> <given-names>M</given-names></string-name>, <string-name><surname>Bi</surname> <given-names>Y</given-names></string-name>, <string-name><surname>Zhang</surname> <given-names>W</given-names></string-name></person-group>. <article-title>An AUV location prediction-based data collection scheme for underwater wireless sensor networks</article-title>. <source>IEEE Trans Veh Technol</source>. <year>2019</year>;<volume>68</volume>(<issue>6</issue>):<fpage>6037</fpage>&#x2013;<lpage>49</lpage>. doi:<pub-id pub-id-type="doi">10.1109/TVT.2019.2911694</pub-id>.</mixed-citation></ref>
<ref id="ref-12"><label>[12]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Blanc</surname> <given-names>S</given-names></string-name></person-group>. <article-title>Event-driven data gathering in pure asynchronous multi-hop underwater acoustic sensor networks</article-title>. <source>Sensors</source>. <year>2020</year>;<volume>20</volume>(<issue>5</issue>):<fpage>1407</fpage>. doi:<pub-id pub-id-type="doi">10.3390/s20051407</pub-id>; <pub-id pub-id-type="pmid">32143460</pub-id></mixed-citation></ref>
<ref id="ref-13"><label>[13]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>C&#x00E2;mara</surname> <given-names>EPM</given-names>
<suffix>Jr</suffix></string-name>, <string-name><surname>Vieira</surname> <given-names>LFM</given-names></string-name>, <string-name><surname>Vieira</surname> <given-names>MAM</given-names></string-name></person-group>. <article-title>CAPTAIN: a data collection algorithm for underwater optical-acoustic sensor networks</article-title>. <source>Comput Netw</source>. <year>2020</year>;<volume>171</volume>(<issue>4</issue>):<fpage>107145</fpage>. doi:<pub-id pub-id-type="doi">10.1016/j.comnet.2020.107145</pub-id>.</mixed-citation></ref>
<ref id="ref-14"><label>[14]</label><mixed-citation publication-type="conf-proc"><person-group person-group-type="author"><string-name><surname>Mortada</surname> <given-names>M</given-names></string-name>, <string-name><surname>Makhoul</surname> <given-names>A</given-names></string-name>, <string-name><surname>Abou Jaoude</surname> <given-names>C</given-names></string-name>, <string-name><surname>Harb</surname> <given-names>H</given-names></string-name>, <string-name><surname>Laiymani</surname> <given-names>D</given-names></string-name></person-group>. <article-title>A distributed processing technique for sensor data applied to underwater sensor networks</article-title>. In: <conf-name>Proceedings of the 15th International Wireless Communications &#x0026; Mobile Computing Conference (IWCMC)</conf-name>; <year>2019 Jun 24&#x2013;28</year>; <publisher-loc>Tangier, Morocco</publisher-loc>. p. <fpage>979</fpage>&#x2013;<lpage>84</lpage>. doi:<pub-id pub-id-type="doi">10.1109/iwcmc.2019.8766742</pub-id>.</mixed-citation></ref>
<ref id="ref-15"><label>[15]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Huang</surname> <given-names>X</given-names></string-name>, <string-name><surname>Sun</surname> <given-names>S</given-names></string-name>, <string-name><surname>Yang</surname> <given-names>Q</given-names></string-name></person-group>. <article-title>Data uploading strategy for underwater wireless sensor networks</article-title>. <source>Sensors</source>. <year>2019</year>;<volume>19</volume>(<issue>23</issue>):<fpage>5265</fpage>. doi:<pub-id pub-id-type="doi">10.3390/s19235265</pub-id>; <pub-id pub-id-type="pmid">31795473</pub-id></mixed-citation></ref>
<ref id="ref-16"><label>[16]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Akbar</surname> <given-names>M</given-names></string-name>, <string-name><surname>Javaid</surname> <given-names>N</given-names></string-name>, <string-name><surname>Khan</surname> <given-names>AH</given-names></string-name>, <string-name><surname>Imran</surname> <given-names>M</given-names></string-name>, <string-name><surname>Shoaib</surname> <given-names>M</given-names></string-name>, <string-name><surname>Vasilakos</surname> <given-names>A</given-names></string-name></person-group>. <article-title>Efficient data gathering in 3D linear underwater wireless sensor networks using sink mobility</article-title>. <source>Sensors</source>. <year>2016</year>;<volume>16</volume>(<issue>3</issue>):<fpage>404</fpage>. doi:<pub-id pub-id-type="doi">10.3390/s16030404</pub-id>; <pub-id pub-id-type="pmid">27007373</pub-id></mixed-citation></ref>
<ref id="ref-17"><label>[17]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Cai</surname> <given-names>S</given-names></string-name>, <string-name><surname>Zhu</surname> <given-names>Y</given-names></string-name>, <string-name><surname>Wang</surname> <given-names>T</given-names></string-name>, <string-name><surname>Xu</surname> <given-names>G</given-names></string-name>, <string-name><surname>Liu</surname> <given-names>A</given-names></string-name>, <string-name><surname>Liu</surname> <given-names>X</given-names></string-name></person-group>. <article-title>Data collection in underwater sensor networks based on mobile edge computing</article-title>. <source>IEEE Access</source>. <year>2019</year>;<volume>7</volume>:<fpage>65357</fpage>&#x2013;<lpage>67</lpage>. doi:<pub-id pub-id-type="doi">10.1109/ACCESS.2019.2918213</pub-id>.</mixed-citation></ref>
<ref id="ref-18"><label>[18]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Kumar</surname> <given-names>M</given-names></string-name>, <string-name><surname>Goyal</surname> <given-names>N</given-names></string-name>, <string-name><surname>Singh</surname> <given-names>AK</given-names></string-name>, <string-name><surname>Kumar</surname> <given-names>R</given-names></string-name>, <string-name><surname>Rana</surname> <given-names>AK</given-names></string-name></person-group>. <article-title>Analysis and performance evaluation of computation models for node localization in deep sea using UWSN</article-title>. <source>Int J Commun Syst</source>. <year>2024</year>;<volume>37</volume>(<issue>11</issue>):<fpage>e5798</fpage>. doi:<pub-id pub-id-type="doi">10.1002/dac.5798</pub-id>.</mixed-citation></ref>
<ref id="ref-19"><label>[19]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Gupta</surname> <given-names>O</given-names></string-name>, <string-name><surname>Kumar</surname> <given-names>M</given-names></string-name>, <string-name><surname>Mushtaq</surname> <given-names>A</given-names></string-name>, <string-name><surname>Goyal</surname> <given-names>N</given-names></string-name></person-group>. <article-title>Localization schemes and its challenges in underwater wireless sensor networks</article-title>. <source>J Comput Theor Nanosci</source>. <year>2020</year>;<volume>17</volume>(<issue>6</issue>):<fpage>2750</fpage>&#x2013;<lpage>4</lpage>. doi:<pub-id pub-id-type="doi">10.1166/jctn.2020.9116</pub-id>.</mixed-citation></ref>
<ref id="ref-20"><label>[20]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Akila</surname> <given-names>IS</given-names></string-name>, <string-name><surname>Venkatesan</surname> <given-names>R</given-names></string-name></person-group>. <article-title>A fuzzy based energy-aware clustering architecture for cooperative communication in WSN</article-title>. <source>Comput J</source>. <year>2016</year>;<volume>59</volume>(<issue>10</issue>):<fpage>1551</fpage>&#x2013;<lpage>62</lpage>. doi:<pub-id pub-id-type="doi">10.1093/comjnl/bxw062</pub-id>; <pub-id pub-id-type="pmid">39650359</pub-id></mixed-citation></ref>
<ref id="ref-21"><label>[21]</label><mixed-citation publication-type="journal"><person-group person-group-type="author"><string-name><surname>Choudhary</surname> <given-names>M</given-names></string-name>, <string-name><surname>Goyal</surname> <given-names>N</given-names></string-name>, <string-name><surname>Gupta</surname> <given-names>D</given-names></string-name>, <string-name><surname>Sharma</surname> <given-names>B</given-names></string-name>, <string-name><surname>Sharma</surname> <given-names>N</given-names></string-name></person-group>. <article-title>An oceanographic data collection scheme using hybrid optimization for leakage detection during oil mining in mobility assisted UWSN</article-title>. <source>Multimed Tools Appl</source>. <year>2024</year>;<volume>83</volume>(<issue>42</issue>):<fpage>89723</fpage>&#x2013;<lpage>41</lpage>. doi:<pub-id pub-id-type="doi">10.1007/s11042-024-19023-z</pub-id>.</mixed-citation></ref>
</ref-list>
</back></article>