<?xml version="1.0" encoding="UTF-8"?>
<!DOCTYPE article PUBLIC "-//NLM//DTD JATS (Z39.96) Journal Publishing DTD v1.3 20210610//EN" "JATS-journalpublishing1-3-mathml3.dtd">
<article xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink" xmlns:ali="http://www.niso.org/schemas/ali/1.0/" xmlns:xsi="http://www.w3.org/2001/XMLSchema-instance" article-type="research-article" dtd-version="1.3" xml:lang="EN">
<front>
<journal-meta>
<journal-id journal-id-type="publisher-id">Front. Commun. Netw.</journal-id>
<journal-title-group>
<journal-title>Frontiers in Communications and Networks</journal-title>
<abbrev-journal-title abbrev-type="pubmed">Front. Commun. Netw.</abbrev-journal-title>
</journal-title-group>
<issn pub-type="epub">2673-530X</issn>
<publisher>
<publisher-name>Frontiers Media S.A.</publisher-name>
</publisher>
</journal-meta>
<article-meta>
<article-id pub-id-type="publisher-id">1783248</article-id>
<article-id pub-id-type="doi">10.3389/frcmn.2026.1783248</article-id>
<article-version article-version-type="Version of Record" vocab="NISO-RP-8-2008"/>
<article-categories>
<subj-group subj-group-type="heading">
<subject>Original Research</subject>
</subj-group>
</article-categories>
<title-group>
<article-title>A walrus optimization algorithm (WOA) for cluster head selection to optimize energy-efficiency in UWSNs-based IoT</article-title>
<alt-title alt-title-type="left-running-head">Somula et al.</alt-title>
<alt-title alt-title-type="right-running-head">
<ext-link ext-link-type="uri" xlink:href="https://doi.org/10.3389/frcmn.2026.1783248">10.3389/frcmn.2026.1783248</ext-link>
</alt-title>
</title-group>
<contrib-group>
<contrib contrib-type="author">
<name>
<surname>Somula</surname>
<given-names>Ramasubbareddy</given-names>
</name>
<xref ref-type="aff" rid="aff1">
<sup>1</sup>
</xref>
<uri xlink:href="https://loop.frontiersin.org/people/3261297"/>
<role vocab="credit" vocab-identifier="https://credit.niso.org/" vocab-term="Conceptualization" vocab-term-identifier="https://credit.niso.org/contributor-roles/conceptualization/">Conceptualization</role>
<role vocab="credit" vocab-identifier="https://credit.niso.org/" vocab-term="Formal analysis" vocab-term-identifier="https://credit.niso.org/contributor-roles/formal-analysis/">Formal Analysis</role>
<role vocab="credit" vocab-identifier="https://credit.niso.org/" vocab-term="Investigation" vocab-term-identifier="https://credit.niso.org/contributor-roles/investigation/">Investigation</role>
<role vocab="credit" vocab-identifier="https://credit.niso.org/" vocab-term="Methodology" vocab-term-identifier="https://credit.niso.org/contributor-roles/methodology/">Methodology</role>
<role vocab="credit" vocab-identifier="https://credit.niso.org/" vocab-term="Validation" vocab-term-identifier="https://credit.niso.org/contributor-roles/validation/">Validation</role>
<role vocab="credit" vocab-identifier="https://credit.niso.org/" vocab-term="Writing &#x2013; original draft" vocab-term-identifier="https://credit.niso.org/contributor-roles/writing-original-draft/">Writing &#x2013; original draft</role>
<role vocab="credit" vocab-identifier="https://credit.niso.org/" vocab-term="Writing &#x2013; review &#x26; editing" vocab-term-identifier="https://credit.niso.org/contributor-roles/Writing - review &#x26; editing/">Writing - review and editing</role>
</contrib>
<contrib contrib-type="author">
<name>
<surname>T</surname>
<given-names>Aditya Sai Srinivas</given-names>
</name>
<xref ref-type="aff" rid="aff2">
<sup>2</sup>
</xref>
<uri xlink:href="https://loop.frontiersin.org/people/3400368"/>
<role vocab="credit" vocab-identifier="https://credit.niso.org/" vocab-term="Investigation" vocab-term-identifier="https://credit.niso.org/contributor-roles/investigation/">Investigation</role>
<role vocab="credit" vocab-identifier="https://credit.niso.org/" vocab-term="Validation" vocab-term-identifier="https://credit.niso.org/contributor-roles/validation/">Validation</role>
<role vocab="credit" vocab-identifier="https://credit.niso.org/" vocab-term="Writing &#x2013; review &#x26; editing" vocab-term-identifier="https://credit.niso.org/contributor-roles/Writing - review &#x26; editing/">Writing - review and editing</role>
</contrib>
<contrib contrib-type="author">
<name>
<surname>Sambangi</surname>
<given-names>Swathi</given-names>
</name>
<xref ref-type="aff" rid="aff3">
<sup>3</sup>
</xref>
<uri xlink:href="https://loop.frontiersin.org/people/3370079"/>
<role vocab="credit" vocab-identifier="https://credit.niso.org/" vocab-term="Investigation" vocab-term-identifier="https://credit.niso.org/contributor-roles/investigation/">Investigation</role>
<role vocab="credit" vocab-identifier="https://credit.niso.org/" vocab-term="Validation" vocab-term-identifier="https://credit.niso.org/contributor-roles/validation/">Validation</role>
<role vocab="credit" vocab-identifier="https://credit.niso.org/" vocab-term="Writing &#x2013; review &#x26; editing" vocab-term-identifier="https://credit.niso.org/contributor-roles/Writing - review &#x26; editing/">Writing - review and editing</role>
</contrib>
<contrib contrib-type="author">
<name>
<surname>Gaddam</surname>
<given-names>A. Sanjeeva Reddy</given-names>
</name>
<xref ref-type="aff" rid="aff4">
<sup>4</sup>
</xref>
<uri xlink:href="https://loop.frontiersin.org/people/3400363"/>
<role vocab="credit" vocab-identifier="https://credit.niso.org/" vocab-term="Investigation" vocab-term-identifier="https://credit.niso.org/contributor-roles/investigation/">Investigation</role>
<role vocab="credit" vocab-identifier="https://credit.niso.org/" vocab-term="Validation" vocab-term-identifier="https://credit.niso.org/contributor-roles/validation/">Validation</role>
<role vocab="credit" vocab-identifier="https://credit.niso.org/" vocab-term="Writing &#x2013; review &#x26; editing" vocab-term-identifier="https://credit.niso.org/contributor-roles/Writing - review &#x26; editing/">Writing - review and editing</role>
</contrib>
<contrib contrib-type="author" corresp="yes">
<name>
<surname>Cho</surname>
<given-names>Yongyun</given-names>
</name>
<xref ref-type="aff" rid="aff5">
<sup>5</sup>
</xref>
<xref ref-type="corresp" rid="c001">&#x2a;</xref>
<uri xlink:href="https://loop.frontiersin.org/people/3212033"/>
<role vocab="credit" vocab-identifier="https://credit.niso.org/" vocab-term="Funding acquisition" vocab-term-identifier="https://credit.niso.org/contributor-roles/funding-acquisition/">Funding acquisition</role>
<role vocab="credit" vocab-identifier="https://credit.niso.org/" vocab-term="Investigation" vocab-term-identifier="https://credit.niso.org/contributor-roles/investigation/">Investigation</role>
<role vocab="credit" vocab-identifier="https://credit.niso.org/" vocab-term="Project administration" vocab-term-identifier="https://credit.niso.org/contributor-roles/project-administration/">Project administration</role>
<role vocab="credit" vocab-identifier="https://credit.niso.org/" vocab-term="Supervision" vocab-term-identifier="https://credit.niso.org/contributor-roles/supervision/">Supervision</role>
<role vocab="credit" vocab-identifier="https://credit.niso.org/" vocab-term="Validation" vocab-term-identifier="https://credit.niso.org/contributor-roles/validation/">Validation</role>
<role vocab="credit" vocab-identifier="https://credit.niso.org/" vocab-term="Writing &#x2013; review &#x26; editing" vocab-term-identifier="https://credit.niso.org/contributor-roles/Writing - review &#x26; editing/">Writing - review and editing</role>
</contrib>
<contrib contrib-type="author">
<name>
<surname>S</surname>
<given-names>Remya</given-names>
</name>
<xref ref-type="aff" rid="aff6">
<sup>6</sup>
</xref>
<uri xlink:href="https://loop.frontiersin.org/people/3400366"/>
<role vocab="credit" vocab-identifier="https://credit.niso.org/" vocab-term="Investigation" vocab-term-identifier="https://credit.niso.org/contributor-roles/investigation/">Investigation</role>
<role vocab="credit" vocab-identifier="https://credit.niso.org/" vocab-term="Validation" vocab-term-identifier="https://credit.niso.org/contributor-roles/validation/">Validation</role>
<role vocab="credit" vocab-identifier="https://credit.niso.org/" vocab-term="Writing &#x2013; review &#x26; editing" vocab-term-identifier="https://credit.niso.org/contributor-roles/Writing - review &#x26; editing/">Writing - review and editing</role>
</contrib>
</contrib-group>
<aff id="aff1">
<label>1</label>
<institution>Symbiosis Institute of Technology, Hyderabad Campus, Symbiosis International (Deemed University)</institution>, <city>Pune</city>, <country country="IN">India</country>
</aff>
<aff id="aff2">
<label>2</label>
<institution>Department of CSE, Ravindra College of Engineering for Women</institution>, <city>Kurnool</city>, <state>Andhra Pradesh</state>, <country country="IN">India</country>
</aff>
<aff id="aff3">
<label>3</label>
<institution>Department of CSE-(CyS,DS) and AI &#x26; DS VNR Vignana Jyothi Institute of Engineering and Technology</institution>, <city>Hyderabad</city>, <state>Telangana</state>, <country country="IN">India</country>
</aff>
<aff id="aff4">
<label>4</label>
<institution>Department of ECE, K.S.R.M COLLEGE OF ENGINEERING</institution>, <city>kadapa</city>, <state>Andhra Pradesh</state>, <country country="IN">India</country>
</aff>
<aff id="aff5">
<label>5</label>
<institution>Department of CSE, Department of Information and Communication Engineering, Sunchon National University</institution>, <city>Suncheon Si</city>, <country country="KR">Republic of Korea</country>
</aff>
<aff id="aff6">
<label>6</label>
<institution>Department of CSE, Amrita School of Computing, Amrita Vishwa Vidyapeetham</institution>, <city>Amritapuri</city>, <state>Kerala</state>, <country country="IN">India</country>
</aff>
<author-notes>
<corresp id="c001">
<label>&#x2a;</label>Correspondence: Yongyun Cho, <email xlink:href="mailto:yycho@scnu.ac.kr">yycho@scnu.ac.kr</email>
</corresp>
</author-notes>
<pub-date publication-format="electronic" date-type="pub" iso-8601-date="2026-02-26">
<day>26</day>
<month>02</month>
<year>2026</year>
</pub-date>
<pub-date publication-format="electronic" date-type="collection">
<year>2026</year>
</pub-date>
<volume>7</volume>
<elocation-id>1783248</elocation-id>
<history>
<date date-type="received">
<day>13</day>
<month>01</month>
<year>2026</year>
</date>
<date date-type="rev-recd">
<day>03</day>
<month>02</month>
<year>2026</year>
</date>
<date date-type="accepted">
<day>06</day>
<month>02</month>
<year>2026</year>
</date>
</history>
<permissions>
<copyright-statement>Copyright &#xa9; 2026 Somula, T, Sambangi, Gaddam, Cho and S.</copyright-statement>
<copyright-year>2026</copyright-year>
<copyright-holder>Somula, T, Sambangi, Gaddam, Cho and S</copyright-holder>
<license>
<ali:license_ref start_date="2026-02-26">https://creativecommons.org/licenses/by/4.0/</ali:license_ref>
<license-p>This is an open-access article distributed under the terms of the <ext-link ext-link-type="uri" xlink:href="https://creativecommons.org/licenses/by/4.0/">Creative Commons Attribution License (CC BY)</ext-link>. The use, distribution or reproduction in other forums is permitted, provided the original author(s) and the copyright owner(s) are credited and that the original publication in this journal is cited, in accordance with accepted academic practice. No use, distribution or reproduction is permitted which does not comply with these terms.</license-p>
</license>
</permissions>
<abstract>
<p>The Internet of Things (IoT), which is one of the emerging technologies, has the potential to revolutionize smart ocean monitoring. Underwater wireless sensor networks (UWSNs) equipped with sensors can facilitate the flow of intelligent data to various applications, including environmental monitoring, navigation, pollution surveillance, coastline protection, and military operations, among others. Energy becomes a critical resource in UWSNs because sensor batteries cannot be replaced. Due to battery limitations, sensors are typically resource-constrained. Energy conservation is critical in IoT to extend network lifetime. This is achieved by employing clustering techniques in UWSNs. In recent years, many studies have devised clustering protocols to conserve energy in networks. However, selecting a Cluster Head (CH) node takes considerable time. To address this, this research presents an effective method, a Walrus Optimization Algorithm (WOA)-based routing protocol, which enhances network lifetime and reduces energy consumption. The performance of the proposed algorithm (WOA) is evaluated in MATLAB 2024a and compared with ZFO-SHO, TIOCHR, and M-PSO, wellknown nature-inspired algorithms. The proposed WOA has demonstrated observed improvement in the packet delivery ratio by approximately 7%&#x2013;10% and network lifetime by 10%&#x2013;15%, respectively. The results confirm that the suggested WOA improved energy efficiency within IoT-based UWSNs.</p>
</abstract>
<kwd-group>
<kwd>cluster head selection</kwd>
<kwd>clustering</kwd>
<kwd>IoT</kwd>
<kwd>optimize energy consumption</kwd>
<kwd>underwater wireless sensor network</kwd>
<kwd>walrus optimization algorithm</kwd>
</kwd-group>
<funding-group>
<award-group id="gs1">
<funding-source id="sp1">
<institution-wrap>
<institution>Ministry of Science and ICT, South Korea</institution>
<institution-id institution-id-type="doi" vocab="open-funder-registry" vocab-identifier="10.13039/open_funder_registry">10.13039/501100014188</institution-id>
</institution-wrap>
</funding-source>
<award-id rid="sp1">IITP-2025-2020-0-01489</award-id>
<award-id rid="sp1">IITP-2025-RS-2023-00259703</award-id>
</award-group>
<funding-statement>The author(s) declared that financial support was received for this work and/or its publication. This research was supported by the Regional Innovation System &#x26; Education(RISE) program through the Jeollanamdo RISE center, funded by the Ministry of Education(MOE) and the Jeollanamdo, Republic of Korea.(2025-RISE-14-003).</funding-statement>
</funding-group>
<counts>
<fig-count count="11"/>
<table-count count="8"/>
<equation-count count="28"/>
<ref-count count="41"/>
<page-count count="16"/>
</counts>
<custom-meta-group>
<custom-meta>
<meta-name>section-at-acceptance</meta-name>
<meta-value>IoT and Sensor Networks</meta-value>
</custom-meta>
</custom-meta-group>
</article-meta>
</front>
<body>
<sec sec-type="intro" id="s1">
<label>1</label>
<title>Introduction</title>
<p>IoT has evolved into a central domain of research, transforming numerous other essential research areas by facilitating seamless interaction and the intelligent exchange of data among physical things (<xref ref-type="bibr" rid="B4">Alsuwat and Alsuwat, 2025</xref>; <xref ref-type="bibr" rid="B31">Sennan et al., 2021a</xref>; <xref ref-type="bibr" rid="B29">Sankar et al., 2020</xref>; <xref ref-type="bibr" rid="B19">Madireddy and Yarrabothu, 2025</xref>). IoT plays an indispensable role in the development of many fields, like smart homes, healthcare, agriculture, transportation, and smart cities, to broaden operational efficiency and user experience (<xref ref-type="bibr" rid="B21">Mohapatra, 2025</xref>). Underwater Wireless Sensor Networks (UWSNs), as a large-scale wireless network, consist of numerous distributed and autonomous small nodes that monitor pollution and environmental characteristics at the sink or base station for further processing and storage (<xref ref-type="bibr" rid="B3">Alshammri, 2025</xref>; <xref ref-type="bibr" rid="B32">Sennan et al., 2021b</xref>).</p>
<p>UWSNs are becoming popular in various fields. These include military, marine environments, disaster prevention, and offshore resource management (<xref ref-type="bibr" rid="B10">Gola and Gupta, 2020</xref>; <xref ref-type="bibr" rid="B20">Mamta et al., 2022</xref>). Sensor nodes can be deployed in 2D or 3D based on how deep the water is. Using the aquatic environment to deploy sensors in WSNS has always been a challenge (<xref ref-type="bibr" rid="B30">Sathish et al., 2022</xref>). Data transmission in UWSN is done via acoustic communication mode among nodes due to the fact that radio communication is limited in underwater environments. UWSNs are composed of sensors that monitor the physical environment and communicate their data to a central server for further processing (<xref ref-type="bibr" rid="B36">Srinivasan et al., 2019</xref>; <xref ref-type="bibr" rid="B26">Rajput and Kumaravelu, 2021</xref>). Usually, the data gathered from the environment is first converted into analog signals for pre-processing and then sent wirelessly using specialized transceiver modules which are a crucial part of a UWSN (<xref ref-type="bibr" rid="B41">Wang et al., 2019</xref>; <xref ref-type="bibr" rid="B33">Sheikh et al., 2012a</xref>; <xref ref-type="bibr" rid="B35">Sheikh et al., 2015</xref>). With the recent advancements in microelectronics, small-sized sensors with low power requirements have been developed, and the opportunities for real-time applications have become even more significant. UWSNs have been extensively used in battlefield surveillance, industrial automation, and ocean health monitoring (<xref ref-type="bibr" rid="B6">Asghari et al., 2019</xref>; <xref ref-type="bibr" rid="B40">Tran et al., 2019</xref>). In particular, in some cases multiple sensor nodes are necessary to fulfill the real-time process requirements. Furthermore, it is in the nature of UWSNs to be dynamic and therefore can change the network configuration in response to external factors such as node mobility, changes in the environmental context and the addition or removal of nodes, thus always ensuring the efficiency of the network.</p>
<p>When it comes to UWSN-based IoT, routing is the key component without which, communications of data among nodes is impossible. A lot of applications send the same data through the routing protocol, which results in a resource-constrained network. To fix this, a clustering method is used and it enhances the lifetime. Three principal steps are involved in this process. They are the cluster formation, selecting CH nodes, and selecting the best route for data transmission. Overall network performance will be massively improved by carrying out the steps mentioned above. Energy in the sensor nodes can be efficiently controlled, and network lifetime can be increased by simply forming clusters. Sensor nodes are resource-limited devices with very few resources (Storage, battery power, computation, and acoustic communication) (<xref ref-type="bibr" rid="B13">Hassija et al., 2019</xref>). It is extremely challenging to maintain a sustainable network when it relies entirely on sensor nodes in UWSN (<xref ref-type="bibr" rid="B17">Li et al., 2017</xref>). Various proposals have been made for energy-efficient technology in the network (<xref ref-type="bibr" rid="B24">Poluru and Naseera, 2017</xref>; <xref ref-type="bibr" rid="B14">Kharrufa et al., 2019</xref>). Sensor nodes are spread throughout the network region and formed into different clusters. A CH node is assigned to each cluster, which communicates with the sink node (<xref ref-type="bibr" rid="B39">Thangaramya et al., 2019</xref>).</p>
<p>Clustering is one of the conventional methods that have been extensively used in UWSNs to save energy by significantly reducing the volume of data transmission among sensor nodes (<xref ref-type="bibr" rid="B34">Sheikh et al., 2012b</xref>; <xref ref-type="bibr" rid="B15">Kotary and Nanda, 2020</xref>; <xref ref-type="bibr" rid="B12">Hase et al., 2017</xref>). Within this model, the group nodes are organized into different clusters. Each cluster is directed by a Cluster Head (CH), which aggregates data from all Cluster Members (CMs) and passes it to the sink node. Several studies have proposed various cluster head selection methods utilizing optimization algorithms, where an optimal solution is selected from the numerous possibilities. Furthermore, multiple cluster head selection algorithms have been proposed using a variety of optimization techniques in the recent past, such as Crested Porcupine Optimizer (CPO), GA, DE, Gannet Optimization Algorithm (GOA), ACO (<xref ref-type="bibr" rid="B38">Sumida et al., 1990</xref>; <xref ref-type="bibr" rid="B37">Storn and Price, 1997</xref>; <xref ref-type="bibr" rid="B1">Abdel-Basset et al., 2024</xref>; <xref ref-type="bibr" rid="B22">Pan et al., 2022</xref>; <xref ref-type="bibr" rid="B16">Landge et al., 2025</xref>), or Atomic Orbital Search (AOS) (<xref ref-type="bibr" rid="B7">Azizi, 2021</xref>). However, the standard optimization algorithms based on CH selection suffer from slow convergence, resulting in inefficient cluster formation and maximized communication overhead. Consequently, the overall energy balance in the network is affected. Hence, the Walrus Optimization Algorithm (WOA) is selected to determine the appropriate CHs within clusters, thereby extending the overall lifetime of the network. The WOA optimization algorithm seems generic; it can be employed in a network model by using an objective function formulation to observe energy consumption behavior and communication among nodes in a deployment scenario. The main contribution of this research is:<list list-type="bullet">
<list-item>
<p>Initially, the sensor nodes are grouped into clusters based on their spatial proximity in a structured clustering framework, after which the energy-aware CH Node in the cluster is determined, which is responsible for RER and communication distance.</p>
</list-item>
<list-item>
<p>The energy consumption and communication costs are balanced through the formulation of the objective function, improving network lifetime and Throughput under deployment conditions.</p>
</list-item>
<list-item>
<p>In WOA, the fitness function is determined by considering both the Residual energy (RER) and distance in selecting the best CH.</p>
</list-item>
<list-item>
<p>Performance of WOA formulation has been evaluated in MATLAB 2024a simulation environment and checked against the performance of existing CH selection approaches such as ZFO-SHO, TIOCHR, and M-PSO. The MOA enhances the efficiency of the entire network.</p>
</list-item>
</list>
</p>
<p>The remaining sections are detailed as follows: Section &#x201c;Related work&#x201d; discusses benchmark state-of-the-art works on cluster head selection in IoT. Section &#x201c;System Preliminaries&#x201d; presented an overview of the network model and an energy model. Section &#x201c;Proposed Walrus Optimization Algorithm protocol for CH Selection&#x201d; discusses the CH selection process. Section &#x201c;Performance Evaluation and Analysis&#x201d; presents the performance of the proposed approach, WOA, and comparison with existing works (ZFO-SHO, TIOCHR, and M-PSO). Finally, the summary of the proposed approach and future directions is discussed.</p>
</sec>
<sec id="s2">
<label>2</label>
<title>Related work</title>
<p>Energy remains a major restriction in UWSNs, although many ways for CH selection have been introduced. Lack of energy and CH selection challenges can be fixed if the right methods are used in UWSNs. Logically, a cluster is a set of nodes that are physically close to each other and hence the members of the set. One of the members of the group, the special node, which is the CH, will be in charge of collecting the data at the local level and sending it to the base station. Energy is saved and the communication load is decreased in this way.</p>
<p>
<xref ref-type="bibr" rid="B27">Roberts et al. (2024)</xref> introduced a hybrid technique inspired by ZFO-SHO in the WSNs. In this class of network, essential services such as cluster head (CH) selection and energy conservation become quite challenging; however, a hybrid approach is then used to address these aspects. In this approach, the main interests are concentrated on dynamic cluster formation and path selection. The best node of CH selection is achieved with the improved ZO Algorithm (ZFO), which relies on the fitness function. Then, the energy consumption was reduced by utilizing an adaptive technique, namely SHO (Sea Horse Optimization). The distinction of the two-phase approach having a trade-off solution in both phases versus the previous methods is that a number of QoS parameters (RER, lifetime, PDR, and throughput) were utilized to check the ZFO-SHO effectiveness. OMNET&#x2b;&#x2b; 6.0, linked with MATLAB R2022b, was used to evaluate the ZFO-SHO using a simulation environment. Dynamic cluster formation is simulated and managed through the ZFO algorithm, whereas energy optimization is performed by the SHO in the MATLAB simulation framework. A node-based implementation of both algorithms (ZFO-SHO) was developed using OMNET&#x2b;&#x2b; to validate their operations in a dynamic environment. The evaluation of ZFO-SHO was computed by comparing it with the benchmark techniques NCOGA, FFARF, GAEO, MMABC, and MRP-GTCO. The effectiveness of ZFO-SHO is improved in terms of critical parameters, PDR by 1.8%&#x2013;6.9%, throughput by 6.7%&#x2013;24%, network lifetime by 1.86%&#x2013;7.40%, and RER by 9.65%&#x2013;37.95%. However, it takes more simulation time for selecting CH.</p>
<p>
<xref ref-type="bibr" rid="B8">Babu and Geethanjali (2024)</xref> suggested a Trust Index Optimization driven CH selection method to extend the network lifetime in WSNs (TIOCHR). TIOCHR successfully identifies the best node in the network to communicate data to the sink node via the best transmitting path. Trust Index is used not only in the selection of a CH but also in finding the best path. The trust index is evaluated using three metrics: available energy, PDR, and packet consistency. Randomly, the CH node is selected in predetermined iterations. Afterward, the best path for sending packets in the network is chosen. Different performance metrics of TIOCHR are calculated, such as packet forwarding ratio (PFR), energy consumption (EC), routing overhead (RO), latency (L), and network longevity (NL). The TIOCHR method was executed in the NS3 simulation environment. TIOCHR&#x2019;s performance is analysed against the selected techniques, energy-efficient algorithm, ANT algorithm, FCEEC algorithm, and TIOCHR algorithm through a comparative study. The energy consumption and network longevity of TIOCHR have been raised by 10%, 15%, and 20% when compared to the benchmark energy-efficient algorithm, the ANT algorithm, and the FCEEC algorithm, respectively. Nevertheless, it is necessary to have a larger number of iterations for selecting an optimal CH, which causes an increase in communication overhead.</p>
<p>
<xref ref-type="bibr" rid="B25">Prakash et al. (2024)</xref> devised energy-efficient and CH selection in WSN through M-PSO and GA (DMPRP). In DMPRP, the CH node is chosen with M-PSO, and cluster members are picked through the GA algorithm. The DMPRP technique proposed in the paper first calculates the probability of a node in selecting the most optimal cluster head. The experiments for the DMPRP method were conducted using the NS2 simulation tool, and the obtained results were compared with the results of the state-of-the-art methods. Overall, the experimental results demonstrated that the performance of DMPRP was superior to the state of the art by 12%.</p>
<p>
<xref ref-type="bibr" rid="B18">Mabunga and Dela Cruz (2025)</xref> proposed an energy-efficient routing protocol for the CH selection using the chronological wild geese optimization (CWGO) in WSNs. The method consists of three stages: CH selection, node energy prediction, and path finding. During the CH selection process, the deep recurrent neural network (DRNN) technique finds the best CH that satisfies the key limitations, such as the LLT, delay, energy, intercluster distance, and intracluster distance. Moreover, the best way from the node to the base station (BS) is obtained by the CWGO for data transmission which takes into account the multiple constraints of trust, delay, distance, and energy. The simulation of CGWO is carried out in a Python environment. The performance of CGWO is evaluated in comparison with conventional models EECHIGWO, DUCISCA, DE_SEP, and E_CERP. The effectiveness of CGWO is improved in terms of critical parameters, specifically distance (19.468&#xa0;m), trust (0.252&#xa0;s), energy (0.963&#xa0;J), and delay (0.700). However, it takes more simulation rounds to choose the optimal CH.</p>
<p>
<xref ref-type="bibr" rid="B3">Alshammri (2025)</xref> recommended improved CH selection using a squirrel search algorithm for enhancing network lifespan and efficiency (ISSA-C). The basic squirrel search optimization algorithm has been modified for the optimal CH selection. In ISSA-C, the solution quality is improved by adapting a series of adjustments and accelerating the convergence speed of CH selection. The capabilities of SSA, namely exploration and exploitation, are enhanced by implementing the Local search algorithm, dynamic step size control, and Adaptive population initialization. As a result, the optimal solution is achieved with more efficient convergence. The fitness function is evaluated with key parameters such as sink distance, CH balance, intra-cluster distance, and RER. The proposed ISSA-C is computed in different scenarios to assess its effectiveness in the network. In order to simulate the operations of WSNs, the authors implemented the MATLAB 2021a simulation environment. To attest to ISSA-C&#x2019;s performance improvement, they employed GWO, CDO, SSA, SSO, MOCRAW, EEWC, and MAP-ACO methods as the benchmarks. The packet delivery ratio (PDR), energy consumption, cluster formation time, and CH selection time of ISSA-C are improved by 88%, 220&#xa0;mJ, 82&#xa0;s, and 67&#xa0;s, respectively. Also, the ISSA-C technique is tested without the assistance of the above said methods. Still, it is intended for certain scenarios.</p>
<p>
<xref ref-type="bibr" rid="B4">Alsuwat and Alsuwat (2025)</xref> proposed a hybrid Q-learning-based artificial bee colony optimization algorithm for CH selection and an optimum data transmission method in WSNs (IQ-ABC). This paper combined the strengths of the original ABC algorithm with a Q-learning mechanism for choosing the best CH in the network. IQ-ABC finds the energy-efficient path for data transmission from the sensor node (SN) to the base station. The selection of CH is enhanced by incorporating trust, energy-efficiency, and latency factors and balancing them via a multi-objective fuzzy logic function. The experiments of the IQ-ABC method were carried out in MATLAB 2021a as the simulation tool. The performance of the IQ-ABC framework was evaluated against the LEACH, HEED, PSO, GWO, ABC, and ACO. This method was exercised in three different scenarios by relocating the base station (BS). When the BS was located centrally, the energy consumption of IQ-ABC achieved 0.253 units over 1,200 rounds compared with other existing techniques, such as 0.38 units by LEACH, 0.361 units by HEED, and 0.6 units by ACO. Similarly, in other scenarios (edge and far), the proposed IQ-ABC approach outperformed with the lowest energy consumption of 0.30 and 0.33 units, respectively. Despite its effectiveness, it does not consider security threats for CH selection.</p>
<p>
<xref ref-type="bibr" rid="B5">Amshavalli et al. (2025)</xref> outlined a multi-objective-based CH selection protocol using boosted sooty tern optimization Algorithm in WSNs (BSHPFMOCS). This approach aimed to address the formation of quality clusters and CHs. The potential CH selection makes the network stable and achieves low energy consumption in various scenarios. In BSHPFMOCS, the CH selection is achieved through an accurate search process, which helps extend the network lifetime in WSNs. The fitness value is computed to select the optimal CH that enhances cluster aggregation. The proposed BSHPFMOCS model integrated the advanced cluster formation methods by selecting cluster members that had the nearest intra-cluster distance. To address the issue of the hot spot in the network, the sink node mobility is optimized by the Piranhav Foraging Optimization Algorithm (PFOA). The effectiveness of the BSHPFMOCS method was compared to the most recent techniques such as FRHBMEB, MOCRAW, F2SORP, and GEIGOA. The simulation experiments were conducted using MATLAB version 2021a. The BSHPFMOCS performance has been raised by 21.94% energy consumption saving, 20.86% packet delay reduction, 18.42% throughput increase, and 10.76% network lifetime extension as compared to the benchmarked methods. However, it takes more simulation rounds to choose the optimal CH. However, the coverage efficiency of the proposed approach is limited. As a result, the energy is drained quickly.</p>
<p>
<xref ref-type="bibr" rid="B9">Das and Dwivedi (2024)</xref> devised a scheme in which a CH is energy-aware and which detects a malicious node via a trust optimization algorithm in WSNs (LS-EATO). In LS-EATO the CH is selected by energy awareness through the harmonic search genetic algorithm (HSGA). Based on the trust value, the cluster member (CM) is not considered CH. Subsequently, with the use of the EAIICT (Energy-Aware Intra- and Inter-Cluster Trust) model, the node can be identified. The EAIICT estimation model is based mainly on two modules: direct trust (DT) and indirect trust (IT). The DT value is derived from the communication and data trust of the network. The IT value is derived from feedback trust. The CM is discovered based on trust value evaluation in central and distributed network scenarios. The residual energy (RER) is a key constraint considered when selecting potential CH with high energy in the EAIICT model. This article explores the capability of the newly introduced LS-EATO model besides a few essential parameters such as delay, detection rate of malicious nodes, and communication overhead. The clean LS-EATO method was run on the MATLAB simulation platform. The new approach, LS-EATO, was benchmarked against the existing baseline models, i.e., SQEER, EPO-TRM, FHTMS, and 2STM. Model performance evaluation results demonstrated that our model surpasses the existing ones.</p>
<p>Numerous optimization algorithms have been proposed for CH selection in WSNs. However, existing works demonstrated certain limitations, including communication overhead, poor PDR rate, and suboptimal CH selection. The key limitations of existing CH optimization techniques are listed in <xref ref-type="table" rid="T1">Table 1</xref>.</p>
<table-wrap id="T1" position="float">
<label>TABLE 1</label>
<caption>
<p>Summary of prior optimization approaches for cluster head election.</p>
</caption>
<table>
<thead valign="top">
<tr>
<th align="center">S.no</th>
<th align="center">Author</th>
<th align="center">Algorithm</th>
<th align="center">Advantage</th>
<th align="center">Limitations</th>
</tr>
</thead>
<tbody valign="top">
<tr>
<td align="center">1</td>
<td align="center">
<xref ref-type="bibr" rid="B27">Roberts et al. (2024)</xref>
</td>
<td align="center">Zebra Fish Optimization (ZFO)-Sea Horse Optimization (SHO) (ZFO-SHO)</td>
<td align="center">Enhanced PDR, Throughput, network lifetime, and RER by 1.8%&#x2013;6.9%, 6.7%&#x2013;24%, 1.86%&#x2013;7.40% and 9.65%&#x2013;37.95%</td>
<td align="center">The clustering process requires a longer convergence time</td>
</tr>
<tr>
<td align="center">2</td>
<td align="center">
<xref ref-type="bibr" rid="B8">Babu and Geethanjali (2024)</xref>
</td>
<td align="center">Trust Index Optimization Algorithm (TIOA)</td>
<td align="center">Improved Energy efficiency and network lifetime by 10%</td>
<td align="center">High energy consumption during the CH selection Process</td>
</tr>
<tr>
<td align="center">3</td>
<td align="center">
<xref ref-type="bibr" rid="B25">Prakash et al. (2024)</xref>
</td>
<td align="center">Modified Particle Swarm Optimization (M-PSO)</td>
<td align="center">The operational period of the network is extended, and energy efficiency is improved by 12%</td>
<td align="center">Require more iterations to reach stable CH selection</td>
</tr>
<tr>
<td align="center">4</td>
<td align="center">
<xref ref-type="bibr" rid="B18">Mabunga and Dela Cruz (2025)</xref>
</td>
<td align="center">Chronological Wild Geese Optimization (CWGO)</td>
<td align="center">The control messages are required to choose the CH, which minimizes and improves energy usage by 0.963&#xa0;J</td>
<td align="center">It does support a dynamic environment of WSN.</td>
</tr>
<tr>
<td align="center">5</td>
<td align="center">
<xref ref-type="bibr" rid="B3">Alshammri (2025)</xref>
</td>
<td align="center">Squirrel Search Algorithm (SSA)</td>
<td align="center">Large-scale networks with many sensor nodes are supported and extended PDR and energy consumption by88% and 220&#xa0;mJ, respectively</td>
<td align="center">High computational complexity</td>
</tr>
<tr>
<td align="center">6</td>
<td align="center">
<xref ref-type="bibr" rid="B4">Alsuwat and Alsuwat (2025)</xref>
</td>
<td align="center">Q-learning-based artificial bee colony</td>
<td align="center">Stabilizes CH selection process and improves energy consumption by 0.253 units</td>
<td align="center">It is applicable to a specific scenario</td>
</tr>
<tr>
<td align="center">7</td>
<td align="center">
<xref ref-type="bibr" rid="B5">Amshavalli et al. (2025)</xref>
</td>
<td align="center">Boosted Sooty Tern Optimization Algorithm (BSTOA)</td>
<td align="center">Optimize multiple goals and improved energy consumption of 21.94%</td>
<td align="center">The load among CH is not distributed properly</td>
</tr>
<tr>
<td align="center">8</td>
<td align="center">
<xref ref-type="bibr" rid="B9">Das and Dwivedi (2024)</xref>
</td>
<td align="center">Harmonic Search Genetic Algorithm (HSGA)</td>
<td align="center">Reduces transmission of redundant data to save energy</td>
<td align="center">Slow convergence to optimal solution</td>
</tr>
</tbody>
</table>
</table-wrap>
<p>There are several metaheuristic algorithms have been proposed to solve CH section problems by focusing on the substitution of algorithms. However, they have shown less attention to the objectives of energy awareness and system constraints.</p>
</sec>
<sec id="s3">
<label>3</label>
<title>System preliminaries</title>
<sec id="s3-1">
<label>3.1</label>
<title>Network model</title>
<p>Multiple sensor nodes &#x2018;n&#x2019; are present in WSN, where each sensor node is equipped with fixed resources. The sensor nodes can be placed randomly in the network. According to available resources, each node can be a CH or a CM. The sink node or the base station executes the proposed WOA CH selection algorithm, which has more processing power and storage capacity. Later, the cluster is formed with nearby nodes from CH using Euclidean distance. <xref ref-type="fig" rid="F1">Figure 1</xref> portrays the overall network model of WOA.</p>
<fig id="F1" position="float">
<label>FIGURE 1</label>
<caption>
<p>WOA network model.</p>
</caption>
<graphic xlink:href="frcmn-07-1783248-g001.tif">
<alt-text content-type="machine-generated">Illustration of an underwater wireless sensor network showing three underwater clusters, each with blue member nodes communicating inward to a central red cluster head, which then connects to a yellow on-water sink node. The sink node transmits data to an onshore control center, demonstrating intra-cluster and CH-to-sink communication paths with labeled arrows.</alt-text>
</graphic>
</fig>
<p>The following assumptions of WOA network model are presented below:<list list-type="bullet">
<list-item>
<p>The sensor nodes are distributed randomly in two-dimentional network area.</p>
</list-item>
<list-item>
<p>All sensor nodes are divided into equal groups and distributed randomly in each group.</p>
</list-item>
<list-item>
<p>The computation power and energy of all sensor nodes are equal.</p>
</list-item>
<list-item>
<p>The distance among sensor nodes are computed using Euclidean distance.</p>
</list-item>
<list-item>
<p>The sink node executes the CH selection algorithm and collects all aggregated data from CH for processing.</p>
</list-item>
<list-item>
<p>The sink node&#x2019;s location in the network area is placed in three distinct areas: the middle, the corner, and the outside.</p>
</list-item>
</list>
</p>
</sec>
<sec id="s3-2">
<label>3.2</label>
<title>Energy model</title>
<p>The acoustic communication can categorize UWSN from WSN. This work mainly focuses on a generalized energy consumption model, which is commonly adopted in WSNs. The proposed energy-aware cluster-head selection model is evaluated under controlled conditions to demonstrate the effectiveness of the proposed work. This work primarily aims to address energy consumption issues rather than to model the physical layer of acoustic in UWSN. Energy has been a big concern in WSN. The transmission of data demands that extra energy be sent to each node in the network space, and it is regulated by two different models: the free-space model and the multi-path model. In the case of single-hop transmission, a free space model is employed, whereas the multi-hop transmission utilizes the multi-path model, and this is derived from the radio energy model of the sensor node in the proposed WOA algorithm (<xref ref-type="bibr" rid="B2">Abu Salem and Shudifat, 2019</xref>). <xref ref-type="fig" rid="F2">Figure 2</xref> depicts the energy model of the proposed WOA.</p>
<fig id="F2" position="float">
<label>FIGURE 2</label>
<caption>
<p>WOA Energy model.</p>
</caption>
<graphic xlink:href="frcmn-07-1783248-g002.tif">
<alt-text content-type="machine-generated">Block diagram depicting wireless sensor network energy consumption model. The transmission unit and amplifier unit handle outgoing data packets, modeled by e times E_elec and e times &#x3B5; times d to the power of a. The receiving unit processes incoming data with d times E_elec. Distance d separates the transmitter and receiver, and antennas are shown at both ends.</alt-text>
</graphic>
</fig>
<p>The energy consumption for transmitting &#x2018;e&#x2019; bit packets of data from node &#x2018;s&#x2019; to &#x2018;r&#x2019; over distance &#x2018;d&#x2019; is computed using <xref ref-type="disp-formula" rid="e1">Equation 1</xref>. The energy consumption is calculated using free space attenuation model when distance among &#x2018;s&#x2019; and &#x2018;r&#x2019; nodes is shorter than <inline-formula id="inf1">
<mml:math id="m1">
<mml:mrow>
<mml:msub>
<mml:mi>d</mml:mi>
<mml:mn>0</mml:mn>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> or multi path attenuation model is used.<disp-formula id="e1">
<mml:math id="m2">
<mml:mrow>
<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:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mi>e</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>d</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mo>&#x3d;</mml:mo>
<mml:mi>e</mml:mi>
<mml:msub>
<mml:mi>E</mml:mi>
<mml:mrow>
<mml:mi>e</mml:mi>
<mml:mi>l</mml:mi>
<mml:mi>e</mml:mi>
<mml:mi>c</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x2b;</mml:mo>
<mml:mi>e</mml:mi>
<mml:mi>&#x25b;</mml:mi>
<mml:mi>d</mml:mi>
<mml:msup>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mi>s</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>r</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mrow>
<mml:mi>&#x3b1;</mml:mi>
<mml:mtext>&#x2009;</mml:mtext>
</mml:mrow>
</mml:msup>
<mml:mo>&#x3d;</mml:mo>
<mml:mrow>
<mml:mfenced open="{" close="" separators="|">
<mml:mrow>
<mml:mtable columnalign="center">
<mml:mtr>
<mml:mtd>
<mml:mrow>
<mml:mi>e</mml:mi>
<mml:mo>&#xd7;</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mi>E</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>e</mml:mi>
<mml:mi>l</mml:mi>
<mml:mi>e</mml:mi>
<mml:mi>c</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x2b;</mml:mo>
<mml:mi>e</mml:mi>
<mml:msub>
<mml:mi>&#x25b;</mml:mi>
<mml:mrow>
<mml:mi>f</mml:mi>
<mml:mi>s</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mi>d</mml:mi>
<mml:msup>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mi>s</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>r</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mrow>
<mml:mn>2</mml:mn>
<mml:mtext>&#x2009;</mml:mtext>
</mml:mrow>
</mml:msup>
<mml:mtext>&#x2003;</mml:mtext>
<mml:mi>w</mml:mi>
<mml:mi>h</mml:mi>
<mml:mi>e</mml:mi>
<mml:mi>r</mml:mi>
<mml:mi>e</mml:mi>
<mml:mtext>&#x2009;</mml:mtext>
<mml:mi>d</mml:mi>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mi>s</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>r</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mo>&#x3c;</mml:mo>
<mml:msub>
<mml:mi>d</mml:mi>
<mml:mn>0</mml:mn>
</mml:msub>
</mml:mrow>
</mml:mtd>
</mml:mtr>
<mml:mtr>
<mml:mtd>
<mml:mrow>
<mml:mi>e</mml:mi>
<mml:mo>&#xd7;</mml:mo>
<mml:msub>
<mml:mi>E</mml:mi>
<mml:mrow>
<mml:mi>e</mml:mi>
<mml:mi>l</mml:mi>
<mml:mi>e</mml:mi>
<mml:mi>c</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mo>&#x2b;</mml:mo>
<mml:mi>e</mml:mi>
<mml:msub>
<mml:mi>&#x25b;</mml:mi>
<mml:mrow>
<mml:mi>e</mml:mi>
<mml:mi>p</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mi>d</mml:mi>
<mml:msup>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mi>s</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>r</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mn>4</mml:mn>
</mml:msup>
<mml:mtext>&#x2002;</mml:mtext>
<mml:mi>w</mml:mi>
<mml:mi>h</mml:mi>
<mml:mi>e</mml:mi>
<mml:mi>r</mml:mi>
<mml:mi>e</mml:mi>
<mml:mtext>&#x2009;</mml:mtext>
<mml:mi>d</mml:mi>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mi>s</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>r</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mo>&#x2265;</mml:mo>
<mml:msub>
<mml:mi>d</mml:mi>
<mml:mn>0</mml:mn>
</mml:msub>
</mml:mrow>
</mml:mtd>
</mml:mtr>
</mml:mtable>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mrow>
</mml:math>
<label>(1)</label>
</disp-formula>
</p>
<p>Where <inline-formula id="inf2">
<mml:math id="m3">
<mml:mrow>
<mml:mi>e</mml:mi>
<mml:msub>
<mml:mi>&#x25b;</mml:mi>
<mml:mrow>
<mml:mi>f</mml:mi>
<mml:mi>s</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mi>d</mml:mi>
<mml:msup>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mi>s</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>r</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mrow>
<mml:mn>2</mml:mn>
<mml:mtext>&#x2009;</mml:mtext>
</mml:mrow>
</mml:msup>
</mml:mrow>
</mml:math>
</inline-formula> and <inline-formula id="inf3">
<mml:math id="m4">
<mml:mrow>
<mml:mi>e</mml:mi>
<mml:msub>
<mml:mi>&#x25b;</mml:mi>
<mml:mrow>
<mml:mi>e</mml:mi>
<mml:mi>p</mml:mi>
</mml:mrow>
</mml:msub>
<mml:mi>d</mml:mi>
<mml:msup>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mi>s</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>r</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mn>4</mml:mn>
</mml:msup>
</mml:mrow>
</mml:math>
</inline-formula> denotes the energy consumption coefficient.</p>
<p>The value of the distance threshold <inline-formula id="inf4">
<mml:math id="m5">
<mml:mrow>
<mml:msub>
<mml:mi mathvariant="normal">d</mml:mi>
<mml:mn>0</mml:mn>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> is computed using <xref ref-type="disp-formula" rid="e2">Equation 2</xref>.<disp-formula id="e2">
<mml:math id="m6">
<mml:mrow>
<mml:msub>
<mml:mi mathvariant="bold-italic">d</mml:mi>
<mml:mn mathvariant="bold">0</mml:mn>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:msqrt>
<mml:mfrac>
<mml:mrow>
<mml:msub>
<mml:mi mathvariant="bold-italic">&#x25b;</mml:mi>
<mml:mrow>
<mml:mi mathvariant="bold-italic">f</mml:mi>
<mml:mi mathvariant="bold-italic">s</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
<mml:mrow>
<mml:msub>
<mml:mi mathvariant="bold-italic">&#x25b;</mml:mi>
<mml:mrow>
<mml:mi mathvariant="bold-italic">e</mml:mi>
<mml:mi mathvariant="bold-italic">p</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:mfrac>
</mml:msqrt>
</mml:mrow>
</mml:math>
<label>(2)</label>
</disp-formula>
</p>
<p>The amount of energy consumed for receiving an e-bit data packet is computed and expressed in <xref ref-type="disp-formula" rid="e3">Equation 3</xref>.<disp-formula id="e3">
<mml:math id="m7">
<mml:mrow>
<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:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mi>d</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mo>&#x3d;</mml:mo>
<mml:mi>d</mml:mi>
<mml:mo>&#xd7;</mml:mo>
<mml:msub>
<mml:mi>E</mml:mi>
<mml:mrow>
<mml:mi>e</mml:mi>
<mml:mi>l</mml:mi>
<mml:mi>e</mml:mi>
<mml:mi>c</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:math>
<label>(3)</label>
</disp-formula>
</p>
</sec>
</sec>
<sec id="s4">
<label>4</label>
<title>The proposed walrus optimization algorithm protocol for CH selection</title>
<p>The proposed walrus optimization algorithm (WOA) focuses on optimal CH selection in wireless sensor network-based IoT using various network parameters. The proposed work seeks to achieve better network lifetime and throughput to manage energy consumption in the network. The CH selection is performed by utilizing a fitness function that is computed based on network factors such as RER and distance. The CH selection algorithm is executed in the sink node due to higher computing power than the sensor node. Then, the cluster is created by using Euclidian distance.</p>
<sec id="s4-1">
<label>4.1</label>
<title>CH selection process</title>
<p>The walrus optimization algorithm is structured into multiple phases, each with a specific role in addressing critical problem. In the initialization phase, a set of candidate solutions (population) is enabled to cover a broad range of the search space. In the migration phase, the large number of new positions is allowed to perform global exploration and stop early convergence by finding new regions. The roosting phase is enabled by an algorithm when an optimal solution is identified. The local exploitation is emphasized via interaction among walrus agents in a structured format and a candidate solution modified accordingly. Afterwards, the gathering phase is responsible for leading agents to first send the best candidate solution by accelerating convergence. The robustness of the system is improved by the fleeing phase through introducing controlled perturbations in different stages of the optimization process. The last phase of WOA is convergence stabilization, which ensures convergence towards an optimal solution and reduces randomness in the end. Thus, the optimal balance between exploration and exploitation is gained with the help of all phases of WOA, which sustains during the optimization process. The walrus optimization algorithm is a swarm intelligent metaheuristic approach that obtains a searching procedure using exploration and exploitation phases (<xref ref-type="bibr" rid="B11">Han et al., 2024</xref>). This WOA approach was developed, inspired by the nature of the walrus animals. The lifestyle of walrus leads to migrating, feeding, gathering, roosting, breeding, and escaping via signals (safety signals or danger signals). Walruses are flexible in water compared to other marine animals. They can stay up to 2&#xa0;h in a depth of 500&#xa0;m water and dive up to 20&#xa0;min, reaching the surface in 3&#xa0;min whenever they need fresh air. They can adapt social habits to defend themselves from killer whales in the water when they encounter them and other walruses that help injure their kind.</p>
<p>The phase transition process is depicted in <xref ref-type="fig" rid="F3">Figure 3</xref>. Various phases (such as migration, roosting, gathering, and fleeing behaviors) of the WOA approach are adapted based on the threshold value of the danger signal or the safe signal (&#x2265;1 and &#x2265;0.5).</p>
<fig id="F3" position="float">
<label>FIGURE 3</label>
<caption>
<p>Transition phases flowchart of WOA.</p>
</caption>
<graphic xlink:href="frcmn-07-1783248-g003.tif">
<alt-text content-type="machine-generated">Flowchart describing a walrus optimization algorithm. It starts with initializing a walrus population, evaluating fitness, and iterating through reproduction, migration, fleeing, roosting, and gathering behaviors based on safety and danger signals, updating positions until completion.</alt-text>
</graphic>
</fig>
<sec id="s4-1-1">
<label>4.1.1</label>
<title>Initialization</title>
<p>The walrus Optimization algorithm (WOA) finds the best solution in range search space. Decision variables in multidimensional spaces represent the problem, and solutions are represented by solution space. The position of the walrus is a solution in search space. Each walrus is considered a sensor node in the vector. A set of candidate solutions <inline-formula id="inf5">
<mml:math id="m8">
<mml:mrow>
<mml:mfenced open="(" close="" separators="|">
<mml:mrow>
<mml:mi>W</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:math>
</inline-formula>) is randomly generated to initiate the optimization process using <xref ref-type="disp-formula" rid="e4">Equation 4</xref>.<disp-formula id="e4">
<mml:math id="m9">
<mml:mrow>
<mml:mi>W</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mi>L</mml:mi>
<mml:mi>B</mml:mi>
<mml:mo>&#x2b;</mml:mo>
<mml:mi>r</mml:mi>
<mml:mi>a</mml:mi>
<mml:mi>n</mml:mi>
<mml:mi>d</mml:mi>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mi>U</mml:mi>
<mml:mi>B</mml:mi>
<mml:mo>&#x2212;</mml:mo>
<mml:mi>L</mml:mi>
<mml:mi>B</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mrow>
</mml:math>
<label>(4)</label>
</disp-formula>
</p>
<p>Where LB, UB and rand indicate the upper bound, lower bound of problem variable and random variable chooses between 0 to 1.</p>
<p>The position of walrus (Sensor node) is updated with every iteration in the optimization process. The walrus is represented using matrix in <xref ref-type="disp-formula" rid="e5">Equation 5</xref>.<disp-formula id="e5">
<mml:math id="m10">
<mml:mrow>
<mml:mi>W</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mfenced open="[" close="]" separators="|">
<mml:mrow>
<mml:mtable columnalign="center">
<mml:mtr>
<mml:mtd>
<mml:mrow>
<mml:msub>
<mml:mi>W</mml:mi>
<mml:mrow>
<mml:mn>1</mml:mn>
<mml:mo>,</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:msub>
<mml:msub>
<mml:mi>W</mml:mi>
<mml:mrow>
<mml:mn>1</mml:mn>
<mml:mo>,</mml:mo>
<mml:mn>2</mml:mn>
</mml:mrow>
</mml:msub>
<mml:mo>&#x22ef;</mml:mo>
<mml:msub>
<mml:mi>W</mml:mi>
<mml:mrow>
<mml:mn>1</mml:mn>
<mml:mo>,</mml:mo>
<mml:mi>d</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:mtd>
</mml:mtr>
<mml:mtr>
<mml:mtd>
<mml:mtable columnalign="center">
<mml:mtr>
<mml:mtd>
<mml:mrow>
<mml:msub>
<mml:mi>W</mml:mi>
<mml:mrow>
<mml:mn>2</mml:mn>
<mml:mo>,</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:msub>
<mml:msub>
<mml:mi>W</mml:mi>
<mml:mrow>
<mml:mn>2</mml:mn>
<mml:mo>,</mml:mo>
<mml:mn>2</mml:mn>
</mml:mrow>
</mml:msub>
<mml:mo>&#x22ef;</mml:mo>
<mml:msub>
<mml:mi>W</mml:mi>
<mml:mrow>
<mml:mn>2</mml:mn>
<mml:mo>,</mml:mo>
<mml:mi>d</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:mtd>
</mml:mtr>
<mml:mtr>
<mml:mtd>
<mml:mrow>
<mml:mo>&#x22ee;</mml:mo>
<mml:mo>&#x22ee;</mml:mo>
<mml:mo>&#x22ee;</mml:mo>
<mml:mo>&#x22ee;</mml:mo>
</mml:mrow>
</mml:mtd>
</mml:mtr>
<mml:mtr>
<mml:mtd>
<mml:mrow>
<mml:mo>&#x22ee;</mml:mo>
<mml:mo>&#x22ee;</mml:mo>
<mml:mo>&#x22ee;</mml:mo>
<mml:mo>&#x22ee;</mml:mo>
</mml:mrow>
</mml:mtd>
</mml:mtr>
</mml:mtable>
</mml:mtd>
</mml:mtr>
<mml:mtr>
<mml:mtd>
<mml:mrow>
<mml:msub>
<mml:mi>W</mml:mi>
<mml:mrow>
<mml:mi>n</mml:mi>
<mml:mo>,</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:msub>
<mml:msub>
<mml:mi>W</mml:mi>
<mml:mrow>
<mml:mi>n</mml:mi>
<mml:mo>,</mml:mo>
<mml:mn>2</mml:mn>
</mml:mrow>
</mml:msub>
<mml:mo>&#x22ef;</mml:mo>
<mml:msub>
<mml:mi>W</mml:mi>
<mml:mrow>
<mml:mi>n</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>d</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:mtd>
</mml:mtr>
</mml:mtable>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mrow>
<mml:mi>n</mml:mi>
<mml:mo>&#xd7;</mml:mo>
<mml:mi>d</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:math>
<label>(5)</label>
</disp-formula>
</p>
<p>Where &#x2018;n&#x2019; indicates the population size and &#x2018;d&#x2019; indicates the dimension of problem variables.</p>
<p>The objective function obtains a set of solutions associated with each walrus&#x2019;s position. The array of fitness values &#x2018;F&#x2019; is stored in a vector, as demonstrated in <xref ref-type="disp-formula" rid="e6">Equation 6</xref>. The walrus population is classified as 90% adults and 10% juveniles. The male-to-female ratio in the adult group is 1:1.<disp-formula id="e6">
<mml:math id="m11">
<mml:mrow>
<mml:mi>F</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mfenced open="[" close="]" separators="|">
<mml:mrow>
<mml:mtable columnalign="center">
<mml:mtr>
<mml:mtd>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:msub>
<mml:mrow>
<mml:mi>f</mml:mi>
<mml:mi>i</mml:mi>
<mml:mi>t</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mn>1</mml:mn>
<mml:mo>,</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:msub>
<mml:msub>
<mml:mrow>
<mml:mi>f</mml:mi>
<mml:mi>i</mml:mi>
<mml:mi>t</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mn>1</mml:mn>
<mml:mo>,</mml:mo>
<mml:mn>2</mml:mn>
</mml:mrow>
</mml:msub>
<mml:mo>&#x22ef;</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mi>f</mml:mi>
<mml:mi>i</mml:mi>
<mml:mi>t</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mn>1</mml:mn>
<mml:mo>,</mml:mo>
<mml:mi>d</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mtd>
</mml:mtr>
<mml:mtr>
<mml:mtd>
<mml:mtable columnalign="center">
<mml:mtr>
<mml:mtd>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:msub>
<mml:mrow>
<mml:mi>f</mml:mi>
<mml:mi>i</mml:mi>
<mml:mi>t</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mn>2</mml:mn>
<mml:mo>,</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:msub>
<mml:msub>
<mml:mrow>
<mml:mi>f</mml:mi>
<mml:mi>i</mml:mi>
<mml:mi>t</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mn>2</mml:mn>
<mml:mo>,</mml:mo>
<mml:mn>2</mml:mn>
</mml:mrow>
</mml:msub>
<mml:mo>&#x22ef;</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mi>f</mml:mi>
<mml:mi>i</mml:mi>
<mml:mi>t</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mn>2</mml:mn>
<mml:mo>,</mml:mo>
<mml:mi>d</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mtd>
</mml:mtr>
<mml:mtr>
<mml:mtd>
<mml:mrow>
<mml:mo>&#x22ee;</mml:mo>
<mml:mo>&#x22ee;</mml:mo>
<mml:mo>&#x22ee;</mml:mo>
<mml:mo>&#x22ee;</mml:mo>
</mml:mrow>
</mml:mtd>
</mml:mtr>
<mml:mtr>
<mml:mtd>
<mml:mrow>
<mml:mo>&#x22ee;</mml:mo>
<mml:mo>&#x22ee;</mml:mo>
<mml:mo>&#x22ee;</mml:mo>
<mml:mo>&#x22ee;</mml:mo>
</mml:mrow>
</mml:mtd>
</mml:mtr>
</mml:mtable>
</mml:mtd>
</mml:mtr>
<mml:mtr>
<mml:mtd>
<mml:mrow>
<mml:mfenced open="(" close="" separators="|">
<mml:mrow>
<mml:mrow>
<mml:msub>
<mml:mrow>
<mml:mi>f</mml:mi>
<mml:mi>i</mml:mi>
<mml:mi>t</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>n</mml:mi>
<mml:mo>,</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:msub>
<mml:msub>
<mml:mrow>
<mml:mi>f</mml:mi>
<mml:mi>i</mml:mi>
<mml:mi>t</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>n</mml:mi>
<mml:mo>,</mml:mo>
<mml:mn>2</mml:mn>
</mml:mrow>
</mml:msub>
<mml:mo>&#x22ef;</mml:mo>
<mml:msub>
<mml:mrow>
<mml:mi>f</mml:mi>
<mml:mi>i</mml:mi>
<mml:mi>t</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>n</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>d</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mtd>
</mml:mtr>
</mml:mtable>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mrow>
<mml:mi>n</mml:mi>
<mml:mo>&#xd7;</mml:mo>
<mml:mi>d</mml:mi>
</mml:mrow>
</mml:msub>
</mml:mrow>
</mml:math>
<label>(6)</label>
</disp-formula>
</p>
<p>The walrus is always careful during the foraging and roosting stages. Among walruses, two of them act as guards to avoid danger and send danger signals immediately after noticing unexpected situations. The danger signal (<inline-formula id="inf6">
<mml:math id="m12">
<mml:mrow>
<mml:msub>
<mml:mi>D</mml:mi>
<mml:mi>S</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula>) and safe signal (<inline-formula id="inf7">
<mml:math id="m13">
<mml:mrow>
<mml:msub>
<mml:mi>S</mml:mi>
<mml:mi>S</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula>) are defined in <xref ref-type="disp-formula" rid="e7">Equations 7</xref>&#x2013;<xref ref-type="disp-formula" rid="e10">10</xref>.<disp-formula id="e7">
<mml:math id="m14">
<mml:mrow>
<mml:msub>
<mml:mi>D</mml:mi>
<mml:mi>S</mml:mi>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:mi>X</mml:mi>
<mml:mo>&#x2a;</mml:mo>
<mml:mi>Y</mml:mi>
</mml:mrow>
</mml:math>
<label>(7)</label>
</disp-formula>
<disp-formula id="e8">
<mml:math id="m15">
<mml:mrow>
<mml:mi>&#x3b4;</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mn>1</mml:mn>
<mml:mo>&#x2212;</mml:mo>
<mml:mfrac bevelled="true">
<mml:mrow>
<mml:mi>t</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>T</mml:mi>
</mml:mrow>
</mml:mfrac>
</mml:mrow>
</mml:math>
<label>(8)</label>
</disp-formula>
<disp-formula id="e9">
<mml:math id="m16">
<mml:mrow>
<mml:mi>X</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mn>2</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:mi>&#x3b4;</mml:mi>
</mml:mrow>
</mml:math>
<label>(9)</label>
</disp-formula>
<disp-formula id="e10">
<mml:math id="m17">
<mml:mrow>
<mml:mi>Y</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mn>2</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:msub>
<mml:mi>s</mml:mi>
<mml:mn>1</mml:mn>
</mml:msub>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:math>
<label>(10)</label>
</disp-formula>
</p>
<p>Where, &#x2018;X&#x2019; and &#x2018;Y&#x2019; are Danger signal factors, <inline-formula id="inf8">
<mml:math id="m18">
<mml:mrow>
<mml:mo>&#x2032;</mml:mo>
<mml:msup>
<mml:mi>&#x3b4;</mml:mi>
<mml:mo>&#x2032;</mml:mo>
</mml:msup>
</mml:mrow>
</mml:math>
</inline-formula> referring values between 1 to 0 associated with several iteration &#x2018;t&#x2019;, and &#x2018;T&#x2019; indicates maximum iterations. The safety signal is defined in <xref ref-type="disp-formula" rid="e11">Equation 11</xref>.<disp-formula id="e11">
<mml:math id="m19">
<mml:mrow>
<mml:msub>
<mml:mi>S</mml:mi>
<mml:mi>S</mml:mi>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:msub>
<mml:mi>s</mml:mi>
<mml:mn>2</mml:mn>
</mml:msub>
</mml:mrow>
</mml:math>
<label>(11)</label>
</disp-formula>
</p>
<p>Where, <inline-formula id="inf9">
<mml:math id="m20">
<mml:mrow>
<mml:msub>
<mml:mi>s</mml:mi>
<mml:mn>1</mml:mn>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> and <inline-formula id="inf10">
<mml:math id="m21">
<mml:mrow>
<mml:msub>
<mml:mi>s</mml:mi>
<mml:mn>2</mml:mn>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> refers random value between 0 to 1.</p>
</sec>
<sec id="s4-1-2">
<label>4.1.2</label>
<title>Exploration phase</title>
<p>The walrus migrate to suitable place for population when unexpected risk of survival increases. In migration phase, the position of warlus is updated using <xref ref-type="disp-formula" rid="e12">Equation 12</xref>.<disp-formula id="e12">
<mml:math id="m22">
<mml:mrow>
<mml:msubsup>
<mml:mi>W</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>j</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>&#x2b;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:msubsup>
<mml:mo>&#x3d;</mml:mo>
<mml:msubsup>
<mml:mi>W</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>j</mml:mi>
</mml:mrow>
<mml:mi>t</mml:mi>
</mml:msubsup>
<mml:mo>&#x2b;</mml:mo>
<mml:msub>
<mml:mi>M</mml:mi>
<mml:mi>S</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
<label>(12)</label>
</disp-formula>
<disp-formula id="e13">
<mml:math id="m23">
<mml:mrow>
<mml:msub>
<mml:mi>M</mml:mi>
<mml:mi>S</mml:mi>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:msubsup>
<mml:mi>W</mml:mi>
<mml:mi>p</mml:mi>
<mml:mi>t</mml:mi>
</mml:msubsup>
<mml:mo>&#x2212;</mml:mo>
<mml:msubsup>
<mml:mi>W</mml:mi>
<mml:mi>q</mml:mi>
<mml:mi>t</mml:mi>
</mml:msubsup>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mo>.</mml:mo>
<mml:mi>&#x3b2;</mml:mi>
<mml:mo>.</mml:mo>
<mml:msubsup>
<mml:mi>s</mml:mi>
<mml:mn>3</mml:mn>
<mml:mn>2</mml:mn>
</mml:msubsup>
</mml:mrow>
</mml:math>
<label>(13)</label>
</disp-formula>
<disp-formula id="e14">
<mml:math id="m24">
<mml:mrow>
<mml:mi>&#x3b2;</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mn>1</mml:mn>
<mml:mo>&#x2212;</mml:mo>
<mml:mfrac>
<mml:mn>1</mml:mn>
<mml:mrow>
<mml:mn>1</mml:mn>
<mml:mo>&#x2b;</mml:mo>
<mml:mi mathvariant="italic">exp</mml:mi>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mfrac>
<mml:mrow>
<mml:mi>t</mml:mi>
<mml:mo>&#x2212;</mml:mo>
<mml:mfrac>
<mml:mrow>
<mml:mi>T</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mn>2</mml:mn>
</mml:mrow>
</mml:mfrac>
</mml:mrow>
<mml:mi>T</mml:mi>
</mml:mfrac>
<mml:mo>&#xd7;</mml:mo>
<mml:mn>10</mml:mn>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mrow>
</mml:mfrac>
</mml:mrow>
</mml:math>
<label>(14)</label>
</disp-formula>
</p>
<p>Where, <inline-formula id="inf11">
<mml:math id="m25">
<mml:mrow>
<mml:msubsup>
<mml:mi>W</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>j</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>&#x2b;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:msubsup>
</mml:mrow>
</mml:math>
</inline-formula> and <inline-formula id="inf12">
<mml:math id="m26">
<mml:mrow>
<mml:msubsup>
<mml:mi>W</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>j</mml:mi>
</mml:mrow>
<mml:mi>t</mml:mi>
</mml:msubsup>
</mml:mrow>
</mml:math>
</inline-formula> indicates the new position and current position of i th walrus on j th dimension, respectively, <inline-formula id="inf13">
<mml:math id="m27">
<mml:mrow>
<mml:msub>
<mml:mi>M</mml:mi>
<mml:mi>S</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> means migration_step that measures step size of walrus moment, two walrus (<inline-formula id="inf14">
<mml:math id="m28">
<mml:mrow>
<mml:msubsup>
<mml:mi>W</mml:mi>
<mml:mi>p</mml:mi>
<mml:mi>t</mml:mi>
</mml:msubsup>
<mml:mtext>&#x2009;</mml:mtext>
<mml:mi>a</mml:mi>
<mml:mi>n</mml:mi>
<mml:mi>d</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula> <inline-formula id="inf15">
<mml:math id="m29">
<mml:mrow>
<mml:msubsup>
<mml:mi>W</mml:mi>
<mml:mi>q</mml:mi>
<mml:mi>t</mml:mi>
</mml:msubsup>
</mml:mrow>
</mml:math>
</inline-formula>) are chosen randomly from population for vigilantes purpose, which is calculated using <xref ref-type="disp-formula" rid="e13">Equation 13</xref>, <inline-formula id="inf16">
<mml:math id="m30">
<mml:mrow>
<mml:mi>&#x3b2;</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula> refers controlling factor of <inline-formula id="inf17">
<mml:math id="m31">
<mml:mrow>
<mml:msub>
<mml:mi>M</mml:mi>
<mml:mi>S</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula>, which may vary with iteration and <inline-formula id="inf18">
<mml:math id="m32">
<mml:mrow>
<mml:msub>
<mml:mi>s</mml:mi>
<mml:mn>3</mml:mn>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> refres random interval in [0,1] using <xref ref-type="disp-formula" rid="e14">Equation 14</xref>.</p>
</sec>
<sec id="s4-1-3">
<label>4.1.3</label>
<title>Exploration phase</title>
<p>In the exploitation phase, walruses like to breed when the survival risk is low. During the reproductive phase, they exhibit two distinct behaviors (roosting and foraging).</p>
<sec id="s4-1-3-1">
<label>4.1.3.1</label>
<title>Roosting behaviour</title>
<p>The primary categorization of the walrus population separates them into males, females, and juveniles. Each category has its own way of redistributing changes in their location. Halton method is a low-discrepancy sequence, which can be used to generate randomly distributed sequences. Adjusting the male walrus location changing by the application of the Halton method, this method leads to the idea of separating the population with the search space. The whole search space is split into various parts to inculcate randomness and uniformity by selecting a random point from each part of the search space. The male walrus and lead walrus may affect the female walrus. During the iteration process, the female walrus is influenced more by the leader and less by the mate, which is calculated using <xref ref-type="disp-formula" rid="e15">Equation 15</xref>.<disp-formula id="e15">
<mml:math id="m33">
<mml:mrow>
<mml:msubsup>
<mml:mi>F</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>j</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>t</mml:mi>
<mml:mo>&#x2b;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:msubsup>
<mml:mo>&#x3d;</mml:mo>
<mml:msubsup>
<mml:mi>F</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>j</mml:mi>
</mml:mrow>
<mml:mi>t</mml:mi>
</mml:msubsup>
<mml:mo>&#x2b;</mml:mo>
<mml:mi>&#x3b4;</mml:mi>
<mml:mo>.</mml:mo>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:msubsup>
<mml:mi>M</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>j</mml:mi>
</mml:mrow>
<mml:mi>t</mml:mi>
</mml:msubsup>
<mml:mo>&#x2212;</mml:mo>
<mml:msubsup>
<mml:mi>F</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>j</mml:mi>
</mml:mrow>
<mml:mi>t</mml:mi>
</mml:msubsup>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mo>&#x2b;</mml:mo>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mn>1</mml:mn>
<mml:mo>&#x2212;</mml:mo>
<mml:mi>&#x3b4;</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mo>.</mml:mo>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:msubsup>
<mml:mi>W</mml:mi>
<mml:mrow>
<mml:mi>b</mml:mi>
<mml:mi>e</mml:mi>
<mml:mi>s</mml:mi>
<mml:mi>t</mml:mi>
</mml:mrow>
<mml:mi>t</mml:mi>
</mml:msubsup>
<mml:mo>&#x2212;</mml:mo>
<mml:msubsup>
<mml:mi>F</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>j</mml:mi>
</mml:mrow>
<mml:mi>t</mml:mi>
</mml:msubsup>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mrow>
</mml:math>
<label>(15)</label>
</disp-formula>
</p>
<p>Where <inline-formula id="inf19">
<mml:math id="m34">
<mml:mrow>
<mml:msubsup>
<mml:mi>F</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>j</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>t</mml:mi>
<mml:mo>&#x2b;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:msubsup>
</mml:mrow>
</mml:math>
</inline-formula>, <inline-formula id="inf20">
<mml:math id="m35">
<mml:mrow>
<mml:msubsup>
<mml:mi>M</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>j</mml:mi>
</mml:mrow>
<mml:mi>t</mml:mi>
</mml:msubsup>
</mml:mrow>
</mml:math>
</inline-formula> and <inline-formula id="inf21">
<mml:math id="m36">
<mml:mrow>
<mml:msubsup>
<mml:mi>F</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>j</mml:mi>
</mml:mrow>
<mml:mi>t</mml:mi>
</mml:msubsup>
</mml:mrow>
</mml:math>
</inline-formula> denotes the new position of the female walrus and the current position of the male and female walrus of the i th iteration on j th dimension.</p>
<p>The juvenile walrus <inline-formula id="inf22">
<mml:math id="m37">
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:msub>
<mml:mi>J</mml:mi>
<mml:mi>W</mml:mi>
</mml:msub>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:math>
</inline-formula> position is updated to avoid attacks from killer whales and polar bears, as proposed in <xref ref-type="disp-formula" rid="e16">Equation 16</xref> and <xref ref-type="disp-formula" rid="e17">Equation 17</xref>, respectively.<disp-formula id="e16">
<mml:math id="m38">
<mml:mrow>
<mml:msubsup>
<mml:msub>
<mml:mi>J</mml:mi>
<mml:mi>W</mml:mi>
</mml:msub>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>j</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>t</mml:mi>
<mml:mo>&#x2b;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:msubsup>
<mml:mo>&#x3d;</mml:mo>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mi>S</mml:mi>
<mml:mi>P</mml:mi>
<mml:mo>&#x2212;</mml:mo>
<mml:msubsup>
<mml:msub>
<mml:mi>J</mml:mi>
<mml:mi>W</mml:mi>
</mml:msub>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>j</mml:mi>
</mml:mrow>
<mml:mi>t</mml:mi>
</mml:msubsup>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mo>.</mml:mo>
<mml:mi>K</mml:mi>
</mml:mrow>
</mml:math>
<label>(16)</label>
</disp-formula>
<disp-formula id="e17">
<mml:math id="m39">
<mml:mrow>
<mml:mi>S</mml:mi>
<mml:mi>P</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:msubsup>
<mml:mi>W</mml:mi>
<mml:mrow>
<mml:mi>b</mml:mi>
<mml:mi>e</mml:mi>
<mml:mi>s</mml:mi>
<mml:mi>t</mml:mi>
</mml:mrow>
<mml:mi>t</mml:mi>
</mml:msubsup>
<mml:mo>&#x2b;</mml:mo>
<mml:msubsup>
<mml:msub>
<mml:mi>J</mml:mi>
<mml:mi>W</mml:mi>
</mml:msub>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>j</mml:mi>
</mml:mrow>
<mml:mi>t</mml:mi>
</mml:msubsup>
<mml:mo>.</mml:mo>
<mml:mi>V</mml:mi>
<mml:mi>F</mml:mi>
</mml:mrow>
</mml:math>
<label>(17)</label>
</disp-formula>
</p>
<p>Where <inline-formula id="inf23">
<mml:math id="m40">
<mml:mrow>
<mml:msubsup>
<mml:msub>
<mml:mi>J</mml:mi>
<mml:mi>W</mml:mi>
</mml:msub>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>j</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>t</mml:mi>
<mml:mo>&#x2b;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:msubsup>
</mml:mrow>
</mml:math>
</inline-formula> and <inline-formula id="inf24">
<mml:math id="m41">
<mml:mrow>
<mml:msubsup>
<mml:msub>
<mml:mi>J</mml:mi>
<mml:mi>W</mml:mi>
</mml:msub>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>j</mml:mi>
</mml:mrow>
<mml:mi>t</mml:mi>
</mml:msubsup>
</mml:mrow>
</mml:math>
</inline-formula> elucidates new position and current position of ith Juvenile walrus on jth dimention, <inline-formula id="inf25">
<mml:math id="m42">
<mml:mrow>
<mml:mi>K</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula> indicates random number in the interval [0,1] of distress cofficient of <inline-formula id="inf26">
<mml:math id="m43">
<mml:mrow>
<mml:msub>
<mml:mi>J</mml:mi>
<mml:mi>W</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula>, <inline-formula id="inf27">
<mml:math id="m44">
<mml:mrow>
<mml:mi>S</mml:mi>
<mml:mi>F</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula> refers safety position, <inline-formula id="inf28">
<mml:math id="m45">
<mml:mrow>
<mml:mi>V</mml:mi>
<mml:mi>F</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula> represents vector of random number with Levy movement, as proposed in <xref ref-type="disp-formula" rid="e18">Equation 18</xref>.<disp-formula id="e18">
<mml:math id="m46">
<mml:mrow>
<mml:mi>L</mml:mi>
<mml:mi>e</mml:mi>
<mml:mi>v</mml:mi>
<mml:mi>y</mml:mi>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mi>a</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mo>&#x3d;</mml:mo>
<mml:mn>0.05</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:mfrac>
<mml:mrow>
<mml:mi>u</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:msup>
<mml:mrow>
<mml:mfenced open="|" close="" separators="|">
<mml:mrow>
<mml:mrow>
<mml:mfenced open="" close="|" separators="|">
<mml:mrow>
<mml:mi>v</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mfrac>
<mml:mrow>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mrow>
<mml:mi>a</mml:mi>
</mml:mrow>
</mml:mfrac>
</mml:msup>
</mml:mrow>
</mml:mfrac>
</mml:mrow>
</mml:math>
<label>(18)</label>
</disp-formula>
</p>
<p>Where <inline-formula id="inf29">
<mml:math id="m47">
<mml:mrow>
<mml:mi>u</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula> and <inline-formula id="inf30">
<mml:math id="m48">
<mml:mrow>
<mml:mi>v</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula> elucidates nornal distributed variables, <inline-formula id="inf31">
<mml:math id="m49">
<mml:mrow>
<mml:mi>u</mml:mi>
<mml:mo>&#x223c;</mml:mo>
<mml:mi>N</mml:mi>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mn>0</mml:mn>
<mml:mo>,</mml:mo>
<mml:msubsup>
<mml:mi>&#x3c3;</mml:mi>
<mml:mi>u</mml:mi>
<mml:mn>2</mml:mn>
</mml:msubsup>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mrow>
</mml:math>
</inline-formula>, <inline-formula id="inf32">
<mml:math id="m50">
<mml:mrow>
<mml:mi>v</mml:mi>
<mml:mo>&#x223c;</mml:mo>
<mml:mi>N</mml:mi>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mn>0</mml:mn>
<mml:mo>,</mml:mo>
<mml:msubsup>
<mml:mi>&#x3c3;</mml:mi>
<mml:mi>v</mml:mi>
<mml:mn>2</mml:mn>
</mml:msubsup>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mrow>
</mml:math>
</inline-formula> as proposed in <xref ref-type="disp-formula" rid="e19">Equation 19</xref>.<disp-formula id="e19">
<mml:math id="m51">
<mml:mrow>
<mml:msub>
<mml:mi>&#x3c3;</mml:mi>
<mml:mi>u</mml:mi>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:msup>
<mml:mrow>
<mml:mfenced open="[" close="]" separators="|">
<mml:mrow>
<mml:mfrac>
<mml:mrow>
<mml:mo>&#xac;</mml:mo>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mn>1</mml:mn>
<mml:mo>&#x2b;</mml:mo>
<mml:mi>&#x3b4;</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mi mathvariant="italic">sin</mml:mi>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mfrac>
<mml:mrow>
<mml:mi>&#x3c0;</mml:mi>
<mml:mi>&#x3b4;</mml:mi>
</mml:mrow>
<mml:mn>2</mml:mn>
</mml:mfrac>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mrow>
<mml:mrow>
<mml:mo>&#xac;</mml:mo>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mfrac>
<mml:mrow>
<mml:mn>1</mml:mn>
<mml:mo>&#x2b;</mml:mo>
<mml:mi>&#x3b4;</mml:mi>
</mml:mrow>
<mml:mn>2</mml:mn>
</mml:mfrac>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mi>&#x3b4;</mml:mi>
<mml:msup>
<mml:mn>2</mml:mn>
<mml:mfrac>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mi>&#x3b4;</mml:mi>
<mml:mo>&#x2212;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mn>2</mml:mn>
</mml:mfrac>
</mml:msup>
</mml:mrow>
</mml:mfrac>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mrow>
<mml:mfrac>
<mml:mrow>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mrow>
<mml:mi>&#x3b4;</mml:mi>
</mml:mrow>
</mml:mfrac>
</mml:mrow>
</mml:msup>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mi>&#x3c3;</mml:mi>
<mml:mi>v</mml:mi>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:mn>1</mml:mn>
<mml:mo>,</mml:mo>
<mml:mi>&#x3b4;</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mn>1.5</mml:mn>
</mml:mrow>
</mml:math>
<label>(19)</label>
</disp-formula>
</p>
<p>Where <inline-formula id="inf33">
<mml:math id="m52">
<mml:mrow>
<mml:msub>
<mml:mi>&#x3c3;</mml:mi>
<mml:mi>u</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> and <inline-formula id="inf34">
<mml:math id="m53">
<mml:mrow>
<mml:msub>
<mml:mi>&#x3c3;</mml:mi>
<mml:mi>v</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> indicates standard deviation.</p>
</sec>
<sec id="s4-1-3-2">
<label>4.1.3.2</label>
<title>Foraging behaviour</title>
<p>The fleeing and gathering behaviors are classified as foraging behaviors. The natural predator attacks walruses during underwater foraging and flees from its current position when it receives a danger signal from its group members. The fleeing behavior will occur during the last iteration of WOA. Global exploration is conducted using <xref ref-type="disp-formula" rid="e20">Equation 20</xref>.<disp-formula id="e20">
<mml:math id="m54">
<mml:mrow>
<mml:msubsup>
<mml:mi>W</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>j</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>t</mml:mi>
<mml:mo>&#x2b;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:msubsup>
<mml:mo>&#x3d;</mml:mo>
<mml:msubsup>
<mml:mi>W</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>j</mml:mi>
</mml:mrow>
<mml:mi>t</mml:mi>
</mml:msubsup>
<mml:mo>.</mml:mo>
<mml:mi>R</mml:mi>
<mml:mo>&#x2212;</mml:mo>
<mml:mrow>
<mml:mfenced open="|" close="|" separators="|">
<mml:mrow>
<mml:msubsup>
<mml:mi>W</mml:mi>
<mml:mrow>
<mml:mi>b</mml:mi>
<mml:mi>e</mml:mi>
<mml:mi>s</mml:mi>
<mml:mi>t</mml:mi>
</mml:mrow>
<mml:mi>t</mml:mi>
</mml:msubsup>
<mml:mo>&#x2212;</mml:mo>
<mml:msubsup>
<mml:mi>W</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>j</mml:mi>
</mml:mrow>
<mml:mi>t</mml:mi>
</mml:msubsup>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mo>.</mml:mo>
<mml:msubsup>
<mml:mi>s</mml:mi>
<mml:mn>4</mml:mn>
<mml:mn>2</mml:mn>
</mml:msubsup>
</mml:mrow>
</mml:math>
<label>(20)</label>
</disp-formula>
</p>
<p>Where <inline-formula id="inf35">
<mml:math id="m55">
<mml:mrow>
<mml:mfenced open="|" close="|" separators="|">
<mml:mrow>
<mml:msubsup>
<mml:mi>W</mml:mi>
<mml:mrow>
<mml:mi>b</mml:mi>
<mml:mi>e</mml:mi>
<mml:mi>s</mml:mi>
<mml:mi>t</mml:mi>
</mml:mrow>
<mml:mi>t</mml:mi>
</mml:msubsup>
<mml:mo>&#x2212;</mml:mo>
<mml:msubsup>
<mml:mi>W</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>j</mml:mi>
</mml:mrow>
<mml:mi>t</mml:mi>
</mml:msubsup>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:math>
</inline-formula> represents distance between the current walrus and best walrus, <inline-formula id="inf36">
<mml:math id="m56">
<mml:mrow>
<mml:msub>
<mml:mi>s</mml:mi>
<mml:mn>4</mml:mn>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> indicates random number in the interval [0,1]. Walruses can collect information about other walruses in the population, which helps them find food in the sea area. They can cooperate with their peers for forage and migration in gathering behavior as proposed in <xref ref-type="disp-formula" rid="e21">Equations 21</xref>&#x2013;<xref ref-type="disp-formula" rid="e24">24</xref>, respectively.<disp-formula id="e21">
<mml:math id="m57">
<mml:mrow>
<mml:msubsup>
<mml:mi>W</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>j</mml:mi>
</mml:mrow>
<mml:mrow>
<mml:mi>t</mml:mi>
<mml:mo>&#x2b;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
</mml:msubsup>
<mml:mo>&#x3d;</mml:mo>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:msub>
<mml:mi>W</mml:mi>
<mml:mn>1</mml:mn>
</mml:msub>
<mml:mo>&#x2b;</mml:mo>
<mml:msub>
<mml:mi>W</mml:mi>
<mml:mn>2</mml:mn>
</mml:msub>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mo>/</mml:mo>
<mml:mn>2</mml:mn>
</mml:mrow>
</mml:math>
<label>(21)</label>
</disp-formula>
<disp-formula id="e22">
<mml:math id="m58">
<mml:mrow>
<mml:mfenced open="{" close="" separators="|">
<mml:mrow>
<mml:mtable columnalign="center">
<mml:mtr>
<mml:mtd>
<mml:mrow>
<mml:msub>
<mml:mi>W</mml:mi>
<mml:mn>1</mml:mn>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:msubsup>
<mml:mi>W</mml:mi>
<mml:mrow>
<mml:mi>b</mml:mi>
<mml:mi>e</mml:mi>
<mml:mi>s</mml:mi>
<mml:mi>t</mml:mi>
</mml:mrow>
<mml:mi>t</mml:mi>
</mml:msubsup>
<mml:mo>&#x2212;</mml:mo>
<mml:msub>
<mml:mi>a</mml:mi>
<mml:mn>1</mml:mn>
</mml:msub>
<mml:mo>&#xd7;</mml:mo>
<mml:msub>
<mml:mi>b</mml:mi>
<mml:mn>1</mml:mn>
</mml:msub>
<mml:mo>&#xd7;</mml:mo>
<mml:mrow>
<mml:mfenced open="|" close="|" separators="|">
<mml:mrow>
<mml:msubsup>
<mml:mi>W</mml:mi>
<mml:mrow>
<mml:mi>b</mml:mi>
<mml:mi>e</mml:mi>
<mml:mi>s</mml:mi>
<mml:mi>t</mml:mi>
</mml:mrow>
<mml:mi>t</mml:mi>
</mml:msubsup>
<mml:mo>&#x2212;</mml:mo>
<mml:msubsup>
<mml:mi>W</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>j</mml:mi>
</mml:mrow>
<mml:mi>t</mml:mi>
</mml:msubsup>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mrow>
</mml:mtd>
</mml:mtr>
<mml:mtr>
<mml:mtd>
<mml:mrow>
<mml:msub>
<mml:mi>W</mml:mi>
<mml:mn>2</mml:mn>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:msubsup>
<mml:mi>W</mml:mi>
<mml:mrow>
<mml:mi>s</mml:mi>
<mml:mi>e</mml:mi>
<mml:mi>c</mml:mi>
<mml:mi>o</mml:mi>
<mml:mi>n</mml:mi>
<mml:mi>d</mml:mi>
</mml:mrow>
<mml:mi>t</mml:mi>
</mml:msubsup>
<mml:mo>&#x2212;</mml:mo>
<mml:msub>
<mml:mi>a</mml:mi>
<mml:mn>1</mml:mn>
</mml:msub>
<mml:mo>&#xd7;</mml:mo>
<mml:msub>
<mml:mi>b</mml:mi>
<mml:mn>1</mml:mn>
</mml:msub>
<mml:mo>&#xd7;</mml:mo>
<mml:mrow>
<mml:mfenced open="|" close="|" separators="|">
<mml:mrow>
<mml:msubsup>
<mml:mi>W</mml:mi>
<mml:mrow>
<mml:mi>s</mml:mi>
<mml:mi>e</mml:mi>
<mml:mi>c</mml:mi>
<mml:mi>o</mml:mi>
<mml:mi>n</mml:mi>
<mml:mi>d</mml:mi>
</mml:mrow>
<mml:mi>t</mml:mi>
</mml:msubsup>
<mml:mo>&#x2212;</mml:mo>
<mml:msubsup>
<mml:mi>W</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>j</mml:mi>
</mml:mrow>
<mml:mi>t</mml:mi>
</mml:msubsup>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mrow>
</mml:mtd>
</mml:mtr>
</mml:mtable>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:math>
<label>(22)</label>
</disp-formula>
<disp-formula id="e23">
<mml:math id="m59">
<mml:mrow>
<mml:mi>a</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mi>&#x3b2;</mml:mi>
<mml:mo>&#xd7;</mml:mo>
<mml:msub>
<mml:mi>s</mml:mi>
<mml:mn>5</mml:mn>
</mml:msub>
<mml:mo>&#x2212;</mml:mo>
<mml:mi>&#x3b2;</mml:mi>
</mml:mrow>
</mml:math>
<label>(23)</label>
</disp-formula>
<disp-formula id="e24">
<mml:math id="m60">
<mml:mrow>
<mml:mi>b</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mi mathvariant="italic">tan</mml:mi>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mi>&#x3b8;</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mrow>
</mml:math>
<label>(24)</label>
</disp-formula>
</p>
<p>The gathering behaviour of walrus is effected using two weight factors <inline-formula id="inf37">
<mml:math id="m61">
<mml:mrow>
<mml:msub>
<mml:mi>W</mml:mi>
<mml:mn>1</mml:mn>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> and <inline-formula id="inf38">
<mml:math id="m62">
<mml:mrow>
<mml:msub>
<mml:mi>W</mml:mi>
<mml:mn>2</mml:mn>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula>, the second position of walrus during iteration is represented by <inline-formula id="inf39">
<mml:math id="m63">
<mml:mrow>
<mml:msubsup>
<mml:mi>W</mml:mi>
<mml:mrow>
<mml:mi>s</mml:mi>
<mml:mi>e</mml:mi>
<mml:mi>c</mml:mi>
<mml:mi>o</mml:mi>
<mml:mi>n</mml:mi>
<mml:mi>d</mml:mi>
</mml:mrow>
<mml:mi>t</mml:mi>
</mml:msubsup>
</mml:mrow>
</mml:math>
</inline-formula>, distance between current and second walrus is denoned by <inline-formula id="inf40">
<mml:math id="m64">
<mml:mrow>
<mml:mfenced open="|" close="|" separators="|">
<mml:mrow>
<mml:msubsup>
<mml:mi>W</mml:mi>
<mml:mrow>
<mml:mi>s</mml:mi>
<mml:mi>e</mml:mi>
<mml:mi>c</mml:mi>
<mml:mi>o</mml:mi>
<mml:mi>n</mml:mi>
<mml:mi>d</mml:mi>
</mml:mrow>
<mml:mi>t</mml:mi>
</mml:msubsup>
<mml:mo>&#x2212;</mml:mo>
<mml:msubsup>
<mml:mi>W</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>,</mml:mo>
<mml:mi>j</mml:mi>
</mml:mrow>
<mml:mi>t</mml:mi>
</mml:msubsup>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:math>
</inline-formula>, <inline-formula id="inf41">
<mml:math id="m65">
<mml:mrow>
<mml:mi>a</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula> and <inline-formula id="inf42">
<mml:math id="m66">
<mml:mrow>
<mml:mi>b</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula> are gathering cofficients, <inline-formula id="inf43">
<mml:math id="m67">
<mml:mrow>
<mml:msub>
<mml:mi>s</mml:mi>
<mml:mn>5</mml:mn>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> is random number in the interval [0,1], <inline-formula id="inf44">
<mml:math id="m68">
<mml:mrow>
<mml:mi>&#x3b8;</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula> indicates the value between <inline-formula id="inf45">
<mml:math id="m69">
<mml:mrow>
<mml:mn>0</mml:mn>
<mml:mtext>&#x2009;</mml:mtext>
<mml:mi>t</mml:mi>
<mml:mi>o</mml:mi>
<mml:mtext>&#x2009;</mml:mtext>
<mml:mi>&#x3c0;</mml:mi>
</mml:mrow>
</mml:math>
</inline-formula>.</p>
</sec>
</sec>
<sec id="s4-1-4">
<label>4.1.4</label>
<title>Fitness function</title>
<p>It is a specific, distinct mathematical measure used to find the sea area with ample food. In WOA, the fitness function is evaluated based on RER and Distance (dis) constraints to find optimal CH in the cluster and ensure comparision with baseline CH techniques. The parameters of UWSN (link quality, mobility, and delay) are not considered in this study and are left for future extension.<list list-type="bullet">
<list-item>
<p>Residual Energy (RER):</p>
</list-item>
</list>
</p>
<p>The amount of energy left in a node after certain network operations (such as data processing, sensing, and communication) is called residual energy <xref ref-type="disp-formula" rid="e25">Equation 25</xref> (<xref ref-type="bibr" rid="B29">Sankar et al., 2020</xref>). A node with higher energy extends the network&#x2019;s lifespan.<disp-formula id="e25">
<mml:math id="m70">
<mml:mrow>
<mml:mi>R</mml:mi>
<mml:mi>E</mml:mi>
<mml:mi>R</mml:mi>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:msub>
<mml:mi>N</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mo>&#x3d;</mml:mo>
<mml:mfrac>
<mml:mrow>
<mml:msub>
<mml:mi>E</mml:mi>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>&#x2212;</mml:mo>
</mml:mrow>
</mml:msub>
<mml:msub>
<mml:mi>E</mml:mi>
<mml:mi>d</mml:mi>
</mml:msub>
</mml:mrow>
<mml:msub>
<mml:mi>E</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:mfrac>
</mml:mrow>
</mml:math>
<label>(25)</label>
</disp-formula>
</p>
<p>Where <inline-formula id="inf46">
<mml:math id="m71">
<mml:mrow>
<mml:msub>
<mml:mi>E</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> and <inline-formula id="inf47">
<mml:math id="m72">
<mml:mrow>
<mml:msub>
<mml:mi>E</mml:mi>
<mml:mi>d</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> indicated initial energy and depleted energy.<list list-type="bullet">
<list-item>
<p>Distance:</p>
</list-item>
</list>
</p>
<p>The distance between sensor node and sinknode is detemined by using <xref ref-type="disp-formula" rid="e26">Equation 26</xref> (<xref ref-type="bibr" rid="B28">Sahoo et al., 2020</xref>).<disp-formula id="e26">
<mml:math id="m73">
<mml:mrow>
<mml:mi>d</mml:mi>
<mml:mi>i</mml:mi>
<mml:mi>s</mml:mi>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:msub>
<mml:mi>n</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:mi>s</mml:mi>
<mml:mi>i</mml:mi>
<mml:mi>n</mml:mi>
<mml:mi>k</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mo>&#x3d;</mml:mo>
<mml:msqrt>
<mml:mrow>
<mml:mstyle displaystyle="true">
<mml:munderover>
<mml:mo>&#x2211;</mml:mo>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mi>n</mml:mi>
</mml:munderover>
</mml:mstyle>
<mml:msup>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mi>s</mml:mi>
<mml:mi>i</mml:mi>
<mml:mi>n</mml:mi>
<mml:mi>k</mml:mi>
<mml:mo>&#x2212;</mml:mo>
<mml:msub>
<mml:mi>n</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mn>2</mml:mn>
</mml:msup>
</mml:mrow>
</mml:msqrt>
</mml:mrow>
</mml:math>
<label>(26)</label>
</disp-formula>
</p>
<p>The best position of walrus fitness function is evaluated using folling <xref ref-type="disp-formula" rid="e27">Equation 27</xref>.<disp-formula id="e27">
<mml:math id="m74">
<mml:mrow>
<mml:msub>
<mml:msub>
<mml:mi>W</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mi>f</mml:mi>
<mml:mi>i</mml:mi>
<mml:mi>t</mml:mi>
<mml:mi>n</mml:mi>
<mml:mi>e</mml:mi>
<mml:mi>s</mml:mi>
<mml:mi>s</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:msub>
<mml:mo>&#x3d;</mml:mo>
<mml:mn>0.5</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:mrow>
<mml:mo>(</mml:mo>
</mml:mrow>
<mml:mn>1</mml:mn>
<mml:mo>&#x2212;</mml:mo>
<mml:mi>R</mml:mi>
<mml:mi>E</mml:mi>
<mml:mi>R</mml:mi>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:msub>
<mml:mi>W</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mo>&#x2b;</mml:mo>
<mml:mn>0.5</mml:mn>
<mml:mo>&#xd7;</mml:mo>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mn>1</mml:mn>
<mml:mo>&#x2212;</mml:mo>
<mml:mi>d</mml:mi>
<mml:mi>i</mml:mi>
<mml:mi>s</mml:mi>
<mml:mi>t</mml:mi>
<mml:mi>a</mml:mi>
<mml:mi>n</mml:mi>
<mml:mi>c</mml:mi>
<mml:mi>e</mml:mi>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:msub>
<mml:mi>W</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mrow>
</mml:math>
<label>(27)</label>
</disp-formula>
</p>
<p>The WOA chooses either the exploration phase or the exploitation phase to perform based on the value of the danger signal (<inline-formula id="inf48">
<mml:math id="m75">
<mml:mrow>
<mml:msub>
<mml:mi>D</mml:mi>
<mml:mi>S</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula>). The walrus moves to a new domain in the search space when the value of <inline-formula id="inf49">
<mml:math id="m76">
<mml:mrow>
<mml:msub>
<mml:mi>D</mml:mi>
<mml:mi>S</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> is leass 1. Thus, the exploration phase is performed first in the algorithm. Later, the exploration phase is performed in the algorithm, which produces walrus herd. When wlarus reaches to safe position during iterations, that walrus is considered a CH node. The process of CH selection pseudocode is described in detail in Algorithm.1.</p>
<p>
<statement content-type="algorithm" id="Algorithm_1">
<label>Algorithm 1</label>
<title>Pseudo-code of WOA display of CH selction Algorithm.</title>
<p>
<list list-type="simple">
<list-item>
<p>Input: Initial population set to &#x2018;n&#x2019; nodes and maximum number of iterations set to &#x2018;T&#x2019;</p>
</list-item>
<list-item>
<p>Output: optimal position of walrus act as CH in the cluster</p>
</list-item>
<list-item>
<p>1:&#x2003;Network population is initialized and distributed randomly using <xref ref-type="disp-formula" rid="e4">Equation 4</xref> and <xref ref-type="disp-formula" rid="e5">Equation 5</xref>.</p>
</list-item>
<list-item>
<p>2:&#x2003;Calculate the objective function of optimal solution using <xref ref-type="disp-formula" rid="e6">Equation 6</xref>.</p>
</list-item>
<list-item>
<p>1:&#x2003;<bold>While</bold> t <inline-formula id="inf50">
<mml:math id="m77">
<mml:mrow>
<mml:mo>&#x2264;</mml:mo>
</mml:mrow>
</mml:math>
</inline-formula> T</p>
</list-item>
<list-item>
<p>//exploration phase</p>
</list-item>
<list-item>
<p>2:&#x2003;&#x2003;<bold>If</bold> &#x7c; <inline-formula id="inf51">
<mml:math id="m78">
<mml:mrow>
<mml:msub>
<mml:mi>D</mml:mi>
<mml:mi>S</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> &#x7c; <inline-formula id="inf52">
<mml:math id="m79">
<mml:mrow>
<mml:mo>&#x2265;</mml:mo>
</mml:mrow>
</mml:math>
</inline-formula> 1</p>
</list-item>
<list-item>
<p>3:&#x2003;&#x2003;&#x2003;Determine the new position of walrus using <xref ref-type="disp-formula" rid="e12">Equation 12</xref>
</p>
</list-item>
<list-item>
<p>//exploitation phase</p>
</list-item>
<list-item>
<p>4:&#x2003;<bold>Else</bold>
</p>
</list-item>
<list-item>
<p>5:&#x2003;&#x2003;<bold>If</bold> &#x7c; <inline-formula id="inf53">
<mml:math id="m80">
<mml:mrow>
<mml:msub>
<mml:mi>S</mml:mi>
<mml:mi>S</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> &#x7c; <inline-formula id="inf54">
<mml:math id="m81">
<mml:mrow>
<mml:mo>&#x2265;</mml:mo>
</mml:mrow>
</mml:math>
</inline-formula> 0.5 {Breeding behavior}</p>
</list-item>
<list-item>
<p>6:&#x2003;&#x2003;<bold>For</bold> each male_walrus</p>
</list-item>
<list-item>
<p>7:&#x2003;&#x2003;&#x2003;The new position of walrus is updated using Halton sequence.</p>
</list-item>
<list-item>
<p>8:&#x2003;&#x2003;<bold>End For</bold>
</p>
</list-item>
<list-item>
<p>9:&#x2003;&#x2003;<bold>For</bold> each female_walrus</p>
</list-item>
<list-item>
<p>10:&#x2003;&#x2003;The new position of walrus is updated using <xref ref-type="disp-formula" rid="e15">Equation 15</xref>
</p>
</list-item>
<list-item>
<p>11:&#x2003;&#x2003;<bold>End For</bold>
</p>
</list-item>
<list-item>
<p>12:&#x2003;&#x2003;<bold>For</bold> each Juvenil_walrus</p>
</list-item>
<list-item>
<p>13:&#x2003;&#x2003;&#x2003;The new position of walrus is updated using <xref ref-type="disp-formula" rid="e16">Equation 16</xref>
</p>
</list-item>
<list-item>
<p>14:&#x2003;&#x2003;<bold>End For</bold>
</p>
</list-item>
<list-item>
<p>15:&#x2003;<bold>Else</bold> {Foraging behavior}</p>
</list-item>
<list-item>
<p>16:&#x2003;&#x2003;<bold>If</bold> &#x7c; <inline-formula id="inf55">
<mml:math id="m82">
<mml:mrow>
<mml:msub>
<mml:mi>D</mml:mi>
<mml:mi>S</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> &#x7c; <inline-formula id="inf56">
<mml:math id="m83">
<mml:mrow>
<mml:mo>&#x2265;</mml:mo>
</mml:mrow>
</mml:math>
</inline-formula> 0.5 {Gathering behavior}</p>
</list-item>
<list-item>
<p>17:&#x2003;&#x2003;&#x2003;The new position of walrus is updated using <xref ref-type="disp-formula" rid="e20">Equation 20</xref>
</p>
</list-item>
<list-item>
<p>18:&#x2003;&#x2003;<bold>Else</bold> {Fleeing behavior}</p>
</list-item>
<list-item>
<p>19:&#x2003;&#x2003;&#x2003;The new position of walrus is updated using <xref ref-type="disp-formula" rid="e21">Equation 21</xref>
</p>
</list-item>
<list-item>
<p>20:&#x2003;&#x2003;<bold>End If</bold>
</p>
</list-item>
<list-item>
<p>21:&#x2003;&#x2003;<bold>End If</bold>
</p>
</list-item>
<list-item>
<p>22:&#x2003;<bold>End If</bold>
</p>
</list-item>
<list-item>
<p>23:&#x2003;Calculate Fitness function of candidate solution using <xref ref-type="disp-formula" rid="e27">Equation 27</xref>
</p>
</list-item>
<list-item>
<p>24:&#x2003;<bold>If</bold> walrus reaches to safe position, then</p>
</list-item>
<list-item>
<p>25:&#x2003;&#x2003;Corresponding walrus is considered as CH in network.</p>
</list-item>
<list-item>
<p>26:&#x2003;<bold>Else</bold>
</p>
</list-item>
<list-item>
<p>27:&#x2003;&#x2003;Go to step 1.</p>
</list-item>
<list-item>
<p>28:&#x2003;<bold>End If</bold>
</p>
</list-item>
<list-item>
<p>29:&#x2003;<bold>End While</bold>
</p>
</list-item>
</list>
</p>
</statement>
</p>
</sec>
</sec>
<sec id="s4-2">
<label>4.2</label>
<title>Cluster formation</title>
<p>Cluster formation refers to grouping a set of nearby nodes to CH in a network area. The distance between CH and a neighbor node is calculated using the Euclidean distance (<xref ref-type="bibr" rid="B23">Panchal and Singh, 2021</xref>), as proposed in <xref ref-type="disp-formula" rid="e28">Equation 28</xref>.<disp-formula id="e28">
<mml:math id="m84">
<mml:mrow>
<mml:mi>d</mml:mi>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:msub>
<mml:mi>W</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
<mml:mo>,</mml:mo>
<mml:msub>
<mml:mi>W</mml:mi>
<mml:mi>j</mml:mi>
</mml:msub>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mo>&#x3d;</mml:mo>
<mml:msqrt>
<mml:mrow>
<mml:mstyle displaystyle="true">
<mml:munderover>
<mml:mo>&#x2211;</mml:mo>
<mml:mrow>
<mml:mi>i</mml:mi>
<mml:mo>&#x3d;</mml:mo>
<mml:mn>1</mml:mn>
</mml:mrow>
<mml:mi>n</mml:mi>
</mml:munderover>
</mml:mstyle>
<mml:msup>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:msub>
<mml:mi>W</mml:mi>
<mml:mi>j</mml:mi>
</mml:msub>
<mml:mo>&#x2212;</mml:mo>
<mml:msub>
<mml:mi>W</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
<mml:mn>2</mml:mn>
</mml:msup>
</mml:mrow>
</mml:msqrt>
</mml:mrow>
</mml:math>
<label>(28)</label>
</disp-formula>
</p>
<p>Where <inline-formula id="inf57">
<mml:math id="m85">
<mml:mrow>
<mml:msub>
<mml:mi>W</mml:mi>
<mml:mi>j</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> and <inline-formula id="inf58">
<mml:math id="m86">
<mml:mrow>
<mml:msub>
<mml:mi>W</mml:mi>
<mml:mi>i</mml:mi>
</mml:msub>
</mml:mrow>
</mml:math>
</inline-formula> are two independent nodes in network.</p>
<p>The workflow of the proposed WOA algorithm is represented in <xref ref-type="fig" rid="F4">Figure 4</xref>.</p>
<fig id="F4" position="float">
<label>FIGURE 4</label>
<caption>
<p>WOA workflow.</p>
</caption>
<graphic xlink:href="frcmn-07-1783248-g004.tif">
<alt-text content-type="machine-generated">Flowchart illustrating an optimization process starting with population initialization, calculating fitness values, identifying the best position, checking if a condition is satisfied, updating node positions, and iterating until optimal values are achieved, then outputting results.</alt-text>
</graphic>
</fig>
</sec>
</sec>
<sec id="s5">
<label>5</label>
<title>Performance evaluation and analysis</title>
<p>A simulation network space of 500&#xa0;m &#xd7; 500&#xa0;m is considered, with 300 sensor nodes distributed randomly. The fixed Random number generator (RNG 2025) is designed to produce identical results.</p>
<p>Simulation rules:</p>
<p>All nodes maintain the same energy and abilities.</p>
<p>The position of the base station is fixed at (250&#xa0;m, 250&#xa0;m).</p>
<p>The Cluster Members (CM) position is fixed in the network area.</p>
<p>The proposed approach, WOA, creates a set of clusters with equal nodes and chooses the CH node. The CH node collects data to send to the BS for further processing.</p>
<p>The average result is calculated after 20 rounds in each simulation.</p>
<p>The experiment simulation is run up to 3,000 rounds, and one round includes data collection, CH selection, and sending data to the BS. The average result is considered over 30 runs to avoid randomness.</p>
<p>The proposed WOA algorithm is compared with baseline optimization algorithms (such as ZFO-SHO, TIOCHR, and M-PSO). All baseline algorithms were implemented under a similar simulation environment. We have considered the same topology, number of iterations, and population size are similar for every approach while running the simulation. The tuning bias is avoided by keeping all simulation parameters constant throughout execution.</p>
<sec id="s5-1">
<label>5.1</label>
<title>Algorithm parameters and runtime complexity</title>
<p>Each clustering round is completed with 30 walrus agents, which run up to 100 iterations. The fitness function is computed using various parameters, such as residual energy (RER), the distance between the CM and CH, and neighboring nodes. The computational complexity of the proposed WOA algorithm is evaluated as <inline-formula id="inf59">
<mml:math id="m87">
<mml:mrow>
<mml:mi>O</mml:mi>
<mml:mrow>
<mml:mfenced open="(" close=")" separators="|">
<mml:mrow>
<mml:mi>N</mml:mi>
<mml:mo>&#xd7;</mml:mo>
<mml:mi>P</mml:mi>
<mml:mo>&#xd7;</mml:mo>
<mml:mi>I</mml:mi>
</mml:mrow>
</mml:mfenced>
</mml:mrow>
</mml:mrow>
</mml:math>
</inline-formula>.</p>
<p>Where N &#x3d; Total Nodes (300 nodes)</p>
<p>P &#x3d; Population Size (30)</p>
<p>I &#x3d; Number of Iterations (100)</p>
<p>Due to an efficient balance between exploration and exploitation, the proposed approach achieves stable convergence to a near-optimal solution, outperforming baselines. It takes less time to choose CH in the MATLAB 2024a environment, making it feasible for deployment. The results presented in this study are obtained by averaging values over multiple simulation rounds to minimize randomness. The statistical study of WOA will be considered in future work.</p>
<p>The effectiveness of the WOA approach is evaluated using the MATLAB 2024a simulation tool. The WSN environment is simulated with varying numbers of nodes (100, 200, and 300) to evaluate the performance of WOA against existing clustering techniques, including ZFO-SHO, TIOCHR, and M-PSO. The proposed framework WOA compared with recent optimization algorithms based on CH selection to ensure consistency. The nodes are distributed randomly in the network area. All nodes are in the network area, initialized with equal energy (1&#xa0;J). The simulation was conducted over a 500&#xa0;m &#xd7; 500&#xa0;m network area, with the sink node strategically placed at the center of the network area (250&#xa0;m &#xd7; 250&#xa0;m). The WOA protocol performance was tested through its key parameters, and the results were deliberated in terms of lifetime of network, energy efficiency, throughput, and network stability. The CH node serves as an intermediate layer for uninterrupted communications. Each sensor node is located near at least one other sensor node. The simulation is conducted to evaluate the effectiveness of the proposed method and comparative algorithms under an identical environment. The effects of UWSN acoustic channels (such as bandwidth limitation, packet loss and delay) in the simulation are beyond the scope of this analysis and are considered in future work. <xref ref-type="table" rid="T2">Table 2</xref> illustrates the complete simulation parameters and configuration settings necessary for the WOA method.</p>
<table-wrap id="T2" position="float">
<label>TABLE 2</label>
<caption>
<p>Simulation parameters.</p>
</caption>
<table>
<thead valign="top">
<tr>
<th align="center">Parameter</th>
<th align="center">Value</th>
</tr>
</thead>
<tbody valign="top">
<tr>
<td align="center">Space</td>
<td align="center">500&#x2a;500&#xa0;m<sup>2</sup>
</td>
</tr>
<tr>
<td align="center">No. of sensor nodes</td>
<td align="center">100, 200, 300</td>
</tr>
<tr>
<td align="center">Initial Energy</td>
<td align="center">1&#xa0;J</td>
</tr>
<tr>
<td align="center">Sink location</td>
<td align="center">(250&#xa0;m, 250&#xa0;m)</td>
</tr>
<tr>
<td align="center">Percentage of CHs</td>
<td align="center">5%&#x2013;10%</td>
</tr>
<tr>
<td align="center">No. of rounds (Rmax)</td>
<td align="center">3,000</td>
</tr>
<tr>
<td align="center">Communication range</td>
<td align="center">50&#x2013;100&#xa0;m</td>
</tr>
<tr>
<td align="center">Amplifier energy (&#x3b5;fs, &#x3b5;mp)</td>
<td align="center">10&#xa0;pJ/bit/m<sup>2</sup>, 0.0013&#xa0;pJ/bit/m<sup>4</sup>
</td>
</tr>
<tr>
<td align="center">Etx</td>
<td align="center">50&#xa0;nJ/bit</td>
</tr>
<tr>
<td align="center">Erx</td>
<td align="center">50&#xa0;nJ/bit</td>
</tr>
<tr>
<td align="center">EDA</td>
<td align="center">5&#xa0;nJ/bit/signal</td>
</tr>
<tr>
<td align="center">Data packet size</td>
<td align="center">4,000 bits</td>
</tr>
</tbody>
</table>
</table-wrap>
</sec>
<sec id="s5-2">
<label>5.2</label>
<title>Network lifetime</title>
<p>
<xref ref-type="fig" rid="F5">Figure 5</xref> shows how the network lifetime varies with network size (100, 200, and 300 sensor nodes). For a network of 100, the ZFO-SHO, TIOCHR, M-PSO, and WOA algorithms&#x2019; dead nodes are at 1,400, 1,600, 1,750, and 1,900 rounds, respectively. In the case of 200 nodes, the dead nodes of the ZFO-SHO, TIOCHR, M-PSO, and WOA algorithms were found at 1,450, 1,650, 1,850, and 1,950 rounds, respectively. Also, in the 300 nodes case, the dead nodes of the ZFO-SHO, TIOCHR, M-PSO, and WOA algorithms were found at 1,550, 1,800, 1,900, and 2,000 rounds, respectively. The proposed WOA algorithm was tested in all three scenarios, and it could be seen that the network lifetime was always improved. WOA expedites the CH selection process, thereby lowering the convergence time.</p>
<fig id="F5" position="float">
<label>FIGURE 5</label>
<caption>
<p>Network lifetime vs. Network size.</p>
</caption>
<graphic xlink:href="frcmn-07-1783248-g005.tif">
<alt-text content-type="machine-generated">Bar chart comparing network lifetime in rounds for ZFO-SHO, TIOCHR, M-PSO, and WOA algorithms across one hundred, two hundred, and three hundred sensor nodes; WOA consistently achieves the highest network lifetime in all scenarios.</alt-text>
</graphic>
</fig>
<p>
<xref ref-type="table" rid="T3">Table 3</xref> illustrates the network lifetime for different network sizes of sensor nodes, specifically 100, 200, and 300 nodes, respectively. The performance of the WOA approach achieved superior network longevity compared to benchmark techniques. The improvement of network longevity is achieved due to the efficiency of WOA, which drives the CH selection process. In WOA, premature node failure is reduced by reducing convergence speed and extending the overall network lifespan.</p>
<table-wrap id="T3" position="float">
<label>TABLE 3</label>
<caption>
<p>Network lifetime vs. Number of nodes.</p>
</caption>
<table>
<thead valign="top">
<tr>
<th rowspan="2" align="center">Number of sensor nodes</th>
<th colspan="4" align="center">Network lifetime (rounds)</th>
</tr>
<tr>
<th align="left">ZFO-SHO</th>
<th align="left">TIOCHR</th>
<th align="left">M-PSO</th>
<th align="left">WOA</th>
</tr>
</thead>
<tbody valign="top">
<tr>
<td align="center">100</td>
<td align="center">1,400</td>
<td align="center">1,600</td>
<td align="center">1750</td>
<td align="center">1900</td>
</tr>
<tr>
<td align="center">200</td>
<td align="center">1,450</td>
<td align="center">1,650</td>
<td align="center">1850</td>
<td align="center">1950</td>
</tr>
<tr>
<td align="center">300</td>
<td align="center">1,550</td>
<td align="center">1800</td>
<td align="center">1900</td>
<td align="center">2000</td>
</tr>
</tbody>
</table>
</table-wrap>
</sec>
<sec id="s5-3">
<label>5.3</label>
<title>Throughput</title>
<p>The throughput calculated from the count of the packets correctly received by the sink node from CHs in the network. In <xref ref-type="fig" rid="F6">Figure 6</xref> the throughput performances of the ZFO-SHO, TIOCHR, M-PSO, and WOA algorithms are shown for different network sizes 100, 200, and 300. When the network size is 100 nodes, the throughputs of ZFO-SHO, TIOCHR, M-PSO, and WOA are 150,000, 160,000, 170,000, and 190,000, respectively. When the network size is 200, the corresponding throughputs of ZFO-SHO, TIOCHR, M-PSO, and WOA are 210,000,240,000,260,000, and 270,000. Similarly, in network size 300, the successful packet delivery reached 330,000 for ZFO-SHO, 370,000 for TIOCHR, 390,000 for M-PSO, and 410,000 for WOA. Above all network configuration scenarios, the proposed WOA approach outperformed other benchmark techniques, ZFO-SHO, TIOCHR, and M-PSO. In WOA, the convergence time is minimized during the CH rotation process. As a result, the network lifetime is extended, and throughput is substantially improved.</p>
<fig id="F6" position="float">
<label>FIGURE 6</label>
<caption>
<p>Throughput vs. Network size.</p>
</caption>
<graphic xlink:href="frcmn-07-1783248-g006.tif">
<alt-text content-type="machine-generated">Bar chart comparing throughput in packets for four algorithms&#x2014;ZFO-SHO, TIOCHR, M-PSO, and WOA&#x2014;across one hundred, two hundred, and three hundred sensor nodes. WOA achieves the highest throughput at each sensor node level.</alt-text>
</graphic>
</fig>
<p>
<xref ref-type="table" rid="T4">Table 4</xref> illustrates the throughput that the proposed algorithm, WOA, achieved in different network simulation settings. From the graph, it is evident that the proposed WOA algorithm significantly increased the packets&#x2019; delivery to the sink node compared to other benchmark algorithms, such as ZFO-SHO, TIOCHR, and M-PSO. The smart WOA approach was instrumental in attaining successful data transmission by facilitating quicker convergence in the CH selection rotation duration.</p>
<table-wrap id="T4" position="float">
<label>TABLE 4</label>
<caption>
<p>Network lifetime vs. Number of nodes.</p>
</caption>
<table>
<thead valign="top">
<tr>
<th rowspan="2" align="center">Number of sensor nodes</th>
<th colspan="4" align="center">Throughput (packets)</th>
</tr>
<tr>
<th align="center">ZFO-SHO</th>
<th align="center">TIOCHR</th>
<th align="center">M-PSO</th>
<th align="center">WOA</th>
</tr>
</thead>
<tbody valign="top">
<tr>
<td align="center">100</td>
<td align="center">150,000</td>
<td align="center">160,000</td>
<td align="center">170,000</td>
<td align="center">190,000</td>
</tr>
<tr>
<td align="center">200</td>
<td align="center">210,000</td>
<td align="center">240,000</td>
<td align="center">260,000</td>
<td align="center">270,000</td>
</tr>
<tr>
<td align="center">300</td>
<td align="center">330,000</td>
<td align="center">370,000</td>
<td align="center">390,000</td>
<td align="center">410,000</td>
</tr>
</tbody>
</table>
</table-wrap>
</sec>
<sec id="s5-4">
<label>5.4</label>
<title>Energy consumption</title>
<p>
<xref ref-type="fig" rid="F7">Figure 7</xref> presents the remaining energy concerning the network size of 100 sensor nodes. The remaining (residual) energy of the proposed approach, WOA, compared to benchmark techniques ZFO-SHO, TIOCHR, and M-PSO. After 1800 rounds, the proposed WOA approach records the highest remaining (residual) energy of approximately 13J against 1J for ZFO-SHO, 9J for TIOCHR, and 11J for M-PSO. The efficient remaining residual energy is attributed to the design of WOA, which achieves faster convergence time during CH rotation.</p>
<fig id="F7" position="float">
<label>FIGURE 7</label>
<caption>
<p>Remaining (Residual) Energy (network size is 100 nodes).</p>
</caption>
<graphic xlink:href="frcmn-07-1783248-g007.tif">
<alt-text content-type="machine-generated">Line graph comparing total energy in joules against number of rounds for four algorithms: ZFO-SHO, TIOCHR, M-PSO, and WOA. WOA preserves higher energy for more rounds than others.</alt-text>
</graphic>
</fig>
<p>As shown in <xref ref-type="table" rid="T5">Table 5</xref>, the total remaining energy depends on the network size of 100 nodes. The proposed method, WOA, demonstrates the lowest energy usage compared to existing approaches due to the faster convergence time of WOA.</p>
<table-wrap id="T5" position="float">
<label>TABLE 5</label>
<caption>
<p>Remaining (Residual) Energy (Network size is 100 nodes).</p>
</caption>
<table>
<thead valign="top">
<tr>
<th rowspan="2" align="center">Number of rounds</th>
<th colspan="4" align="center">Total energy (J)</th>
</tr>
<tr>
<th align="center">ZFO-SHO</th>
<th align="center">TIOCHR</th>
<th align="center">M-PSO</th>
<th align="center">WOA</th>
</tr>
</thead>
<tbody valign="top">
<tr>
<td align="center">0</td>
<td align="center">50</td>
<td align="center">50</td>
<td align="center">50</td>
<td align="center">50</td>
</tr>
<tr>
<td align="center">300</td>
<td align="center">44</td>
<td align="center">45</td>
<td align="center">44</td>
<td align="center">46</td>
</tr>
<tr>
<td align="center">600</td>
<td align="center">37</td>
<td align="center">39</td>
<td align="center">40</td>
<td align="center">41</td>
</tr>
<tr>
<td align="center">900</td>
<td align="center">32</td>
<td align="center">31</td>
<td align="center">33</td>
<td align="center">35</td>
</tr>
<tr>
<td align="center">1,200</td>
<td align="center">26</td>
<td align="center">28</td>
<td align="center">29</td>
<td align="center">30</td>
</tr>
<tr>
<td align="center">1,500</td>
<td align="center">19</td>
<td align="center">21</td>
<td align="center">22</td>
<td align="center">24</td>
</tr>
<tr>
<td align="center">1,800</td>
<td align="center">1</td>
<td align="center">9</td>
<td align="center">11</td>
<td align="center">13</td>
</tr>
<tr>
<td align="center">2,100</td>
<td align="center">0</td>
<td align="center">0</td>
<td align="center">3</td>
<td align="center">7</td>
</tr>
<tr>
<td align="center">2,400</td>
<td align="center">0</td>
<td align="center">0</td>
<td align="center">0</td>
<td align="center">7</td>
</tr>
<tr>
<td align="center">2,700</td>
<td align="center">0</td>
<td align="center">0</td>
<td align="center">0</td>
<td align="center">0</td>
</tr>
<tr>
<td align="center">3,000</td>
<td align="center">0</td>
<td align="center">0</td>
<td align="center">0</td>
<td align="center">0</td>
</tr>
</tbody>
</table>
</table-wrap>
<p>
<xref ref-type="fig" rid="F8">Figure 8</xref> illustrates the Remaining Energy concerning the network size of 200 sensor nodes. The remaining (residual) energy of the proposed approach, WOA, compared to benchmark techniques ZFO-SHO, TIOCHR, and M-PSO. After 1800 rounds, the proposed WOA approach records the lowest energy consumption of approximately 30J against 24J for ZFO-SHO, 25J for TIOCHR, and 28J for M-PSO. The efficient remaining energy is attributed to the design of WOA, which has a faster convergence time during CH rotation.</p>
<fig id="F8" position="float">
<label>FIGURE 8</label>
<caption>
<p>Remaining (Residual) Energy (network size is 200 nodes).</p>
</caption>
<graphic xlink:href="frcmn-07-1783248-g008.tif">
<alt-text content-type="machine-generated">Line graph comparing total energy in joules versus number of rounds for four algorithms: ZFO-SHO, TIOCHR, M-PSO, and WOA. All algorithms show a decreasing trend, with WOA retaining slightly higher energy longer and ZFO-SHO depleting fastest.</alt-text>
</graphic>
</fig>
<p>
<xref ref-type="table" rid="T6">Table 6</xref> represents overall energy consumption with respect to network size 200 nodes. The proposed method, WOA, demonstrates the lower usage of energy compared to other approaches due to the faster convergence time of WOA. It reduces unnecessary communication overhead.</p>
<table-wrap id="T6" position="float">
<label>TABLE 6</label>
<caption>
<p>Remaining (Residual) Energy (Network size is 200 nodes).</p>
</caption>
<table>
<thead valign="top">
<tr>
<th rowspan="2" align="center">Number of rounds</th>
<th colspan="4" align="center">Total energy (J)</th>
</tr>
<tr>
<th align="center">ZFO-SHO</th>
<th align="center">TIOCHR</th>
<th align="center">M-PSO</th>
<th align="center">WOA</th>
</tr>
</thead>
<tbody valign="top">
<tr>
<td align="center">0</td>
<td align="center">100</td>
<td align="center">100</td>
<td align="center">100</td>
<td align="center">100</td>
</tr>
<tr>
<td align="center">300</td>
<td align="center">85</td>
<td align="center">88</td>
<td align="center">92</td>
<td align="center">95</td>
</tr>
<tr>
<td align="center">600</td>
<td align="center">74</td>
<td align="center">76</td>
<td align="center">79</td>
<td align="center">82</td>
</tr>
<tr>
<td align="center">900</td>
<td align="center">63</td>
<td align="center">65</td>
<td align="center">68</td>
<td align="center">72</td>
</tr>
<tr>
<td align="center">1,200</td>
<td align="center">52</td>
<td align="center">54</td>
<td align="center">57</td>
<td align="center">60</td>
</tr>
<tr>
<td align="center">1,500</td>
<td align="center">40</td>
<td align="center">43</td>
<td align="center">46</td>
<td align="center">48</td>
</tr>
<tr>
<td align="center">1,800</td>
<td align="center">24</td>
<td align="center">25</td>
<td align="center">28</td>
<td align="center">30</td>
</tr>
<tr>
<td align="center">2,100</td>
<td align="center">4</td>
<td align="center">6</td>
<td align="center">12</td>
<td align="center">24</td>
</tr>
<tr>
<td align="center">2,400</td>
<td align="center">0</td>
<td align="center">0</td>
<td align="center">4</td>
<td align="center">8</td>
</tr>
<tr>
<td align="center">2,700</td>
<td align="center">0</td>
<td align="center">0</td>
<td align="center">0</td>
<td align="center">0</td>
</tr>
<tr>
<td align="center">3,000</td>
<td align="center">0</td>
<td align="center">0</td>
<td align="center">0</td>
<td align="center">0</td>
</tr>
</tbody>
</table>
</table-wrap>
<p>
<xref ref-type="fig" rid="F9">Figure 9</xref> shows the total reaming energy of a network of 300 sensor nodes. The remaining energy of WOA after 1,800 rounds is 73J whereas, the energy consumption performances of the benchmark methods ZFO-SHO is 60J, TIOCHR is 64J, and M-PSO is 69J. The advantage of WOA delays nodes death is also supported by the fact that the WOA is structured in a way that it converges faster during CH rotation.</p>
<fig id="F9" position="float">
<label>FIGURE 9</label>
<caption>
<p>Energy consumption (network size is 300 nodes).</p>
</caption>
<graphic xlink:href="frcmn-07-1783248-g009.tif">
<alt-text content-type="machine-generated">Line chart comparing total energy in joules versus number of rounds for four algorithms: ZFO-SHO, TIOCHR, M-PSO, and WOA. Energy for all algorithms decreases steadily as the number of rounds increases from zero to three thousand, with ZFO-SHO showing the fastest decline and WOA showing the slowest.</alt-text>
</graphic>
</fig>
<p>
<xref ref-type="table" rid="T7">Table 7</xref> indicates the total energy consumption for a network including 300 nodes. The proposed WOA demonstrated lower energy consumption compared to existing approaches. Enhanced outcomes are attained owing to the WOA algorithm&#x2019;s quickened convergence time in fewer iterations.</p>
<table-wrap id="T7" position="float">
<label>TABLE 7</label>
<caption>
<p>Energy consumption (Network size is 300 nodes).</p>
</caption>
<table>
<thead valign="top">
<tr>
<th rowspan="2" align="center">Number of rounds</th>
<th colspan="4" align="center">Total energy (J)</th>
</tr>
<tr>
<th align="center">ZFO-SHO</th>
<th align="center">TIOCHR</th>
<th align="center">M-PSO</th>
<th align="center">WOA</th>
</tr>
</thead>
<tbody valign="top">
<tr>
<td align="center">0</td>
<td align="center">150</td>
<td align="center">150</td>
<td align="center">150</td>
<td align="center">150</td>
</tr>
<tr>
<td align="center">300</td>
<td align="center">136</td>
<td align="center">138</td>
<td align="center">140</td>
<td align="center">145</td>
</tr>
<tr>
<td align="center">600</td>
<td align="center">125</td>
<td align="center">129</td>
<td align="center">131</td>
<td align="center">136</td>
</tr>
<tr>
<td align="center">900</td>
<td align="center">110</td>
<td align="center">115</td>
<td align="center">118</td>
<td align="center">123</td>
</tr>
<tr>
<td align="center">1,200</td>
<td align="center">90</td>
<td align="center">95</td>
<td align="center">98</td>
<td align="center">100</td>
</tr>
<tr>
<td align="center">1,500</td>
<td align="center">75</td>
<td align="center">77</td>
<td align="center">80</td>
<td align="center">82</td>
</tr>
<tr>
<td align="center">1,800</td>
<td align="center">60</td>
<td align="center">64</td>
<td align="center">69</td>
<td align="center">73</td>
</tr>
<tr>
<td align="center">2,100</td>
<td align="center">10</td>
<td align="center">13</td>
<td align="center">22</td>
<td align="center">25</td>
</tr>
<tr>
<td align="center">2,400</td>
<td align="center">0</td>
<td align="center">0</td>
<td align="center">6</td>
<td align="center">7</td>
</tr>
<tr>
<td align="center">2,700</td>
<td align="center">0</td>
<td align="center">0</td>
<td align="center">0</td>
<td align="center">1</td>
</tr>
<tr>
<td align="center">3,000</td>
<td align="center">0</td>
<td align="center">0</td>
<td align="center">0</td>
<td align="center">0</td>
</tr>
</tbody>
</table>
</table-wrap>
</sec>
<sec id="s5-5">
<label>5.5</label>
<title>Network stabilization time</title>
<p>
<xref ref-type="fig" rid="F10">Figure 10</xref> depicts the network stable time as a function of network size. The proposed WOA technique achieved the longest network stabilization time across various network sizes. The WOA approach outperformed ZFO-SHO, TIOCHR, and M-PSO. The energy consumption is reduced at the node level due to accelerated convergence dynamics of the WOA approach. This approach is most likely suitable for dense network scenarios.</p>
<fig id="F10" position="float">
<label>FIGURE 10</label>
<caption>
<p>Network stabilization Time VS Network nodes.</p>
</caption>
<graphic xlink:href="frcmn-07-1783248-g010.tif">
<alt-text content-type="machine-generated">Bar chart comparing network stabilization time in rounds for four algorithms&#x2014;ZFO-SHO, TIOCHR, M-PSO, and WOA&#x2014;across sensor node counts of 100, 200, and 300. WOA consistently shows the highest stabilization time, and ZFO-SHO the lowest, with all algorithms&#x2019; times increasing as sensor nodes increase.</alt-text>
</graphic>
</fig>
<p>
<xref ref-type="table" rid="T8">Table 8</xref> reveals the different network stabilization times for various network sizes. It is observed that the suggested WOA method shows the longest network stabilization time when compared to ZFO-SHO, TIOCHR, and M-PSO algorithms. For a network size of 300, WOA maintains stability for up to 1,200 rounds. Consequently, it conserves minimal energy and prolongs the network&#x2019;s operational lifespan.</p>
<table-wrap id="T8" position="float">
<label>TABLE 8</label>
<caption>
<p>Network stabilization time Vs. network nodes.</p>
</caption>
<table>
<thead valign="top">
<tr>
<th rowspan="2" align="center">Number of sensor nodes</th>
<th colspan="4" align="center">Network stabilization time (rounds)</th>
</tr>
<tr>
<th align="center">ZFO-SHO</th>
<th align="center">TIOCHR</th>
<th align="center">M-PSO</th>
<th align="center">WOA</th>
</tr>
</thead>
<tbody valign="top">
<tr>
<td align="center">100</td>
<td align="center">700</td>
<td align="center">775</td>
<td align="center">900</td>
<td align="center">1,150</td>
</tr>
<tr>
<td align="center">200</td>
<td align="center">800</td>
<td align="center">850</td>
<td align="center">950</td>
<td align="center">1,170</td>
</tr>
<tr>
<td align="center">300</td>
<td align="center">850</td>
<td align="center">900</td>
<td align="center">1,100</td>
<td align="center">1,200</td>
</tr>
</tbody>
</table>
</table-wrap>
</sec>
<sec id="s5-6">
<label>5.6</label>
<title>Node failure assessment</title>
<p>The network lifetime is evaluated based on energy depletion of node. It is measure with three indicators such as First Node Dead (FND), Half Node Dead (HND), Last Node dead (LND). The network lifetime of the WOA protocol has been presented in <xref ref-type="fig" rid="F9">Figure 9</xref>, where it is being compared with other existing methods (ZF-SHO, TIOCHR, and M-PSO) using three different metrics (FND, HND, and LND) and WOA is observed to give the best performance. The ZF-SHO method has a network lifetime of 2000, 2,200, and 2,600 rounds for FND, HND, and LND, respectively. The TIOCHR approach was able to get 2,100, 2,250, and 2,700 rounds for FND, HND, and LND, respectively. The M-PSO method lasted the longest with FND, HND, and LND rounds recorded at 2,200, 2,500, and 2,800, respectively. The proposed WOA method has outperformed other techniques for the network lifetime FND 2500, HND 2800, and LND 3000 rounds shown in <xref ref-type="fig" rid="F11">Figure 11</xref>. This means that the developed technique is the most suitable for energy saving and CH selection.</p>
<fig id="F11" position="float">
<label>FIGURE 11</label>
<caption>
<p>Rounds VS algorithms (FND, HND and LND).</p>
</caption>
<graphic xlink:href="frcmn-07-1783248-g011.tif">
<alt-text content-type="machine-generated">Line chart comparing four algorithms (ZFO-SHO, TIOCHR, M-PSO, WOA) by the number of rounds until first node dead, half nodes dead, and last node dead, showing WOA performs best across all metrics.</alt-text>
</graphic>
</fig>
</sec>
</sec>
<sec id="s6">
<label>6</label>
<title>Conclusion and future work</title>
<p>The Underwater Wireless Sensor Network (UWSN) consists of low-power devices, thus posing challenges for optimization methods. Extending the lifespan of networks through energy optimization is crucial. Sensor nodes communicate via a clustering protocol. A plethora of optimization algorithms use CH selection to propose optimal solutions to the problem. Nevertheless, many of these optimization approaches are slow in the CH selection process due to an unsteady exploration/exploitation trade-off. To address this, we proposed the Walrus Optimization Algorithm (WOA) to select the best CH in the network. In CH selection, the objective function is determined by the two main factors: maximum Residual Energy (RER) and distance. The WOA CH selection process comprises two stages: cluster formation based on Euclidean distance and CH selection using a WOA-optimized method. The WOA strategy was realized in the MATLAB 2024a simulation environment. The WOA method was benchmarked against popular optimization methods, including ZFO-SHO, TIOCHR, and M-PSO. The WOA is an average improvement of 7%&#x2013;10% in PDR, and the network lifetime is extended by 10%&#x2013;15% compared to ZFO-SHO, TIOCHR, and M-PSO. Hence, the WOA has enhanced the total network efficiency.</p>
<p>The proposed WOA method has many advantages, but it is still open to improvements to be made. Future work can be extended to real-time implementation by taking into account factors, fuzzy rules, latency, and RSSI as the main parameters and deployment conditions will be explored further. The traditional algorithms LEACH and HEED will be considered in future extension work. Additionally, CH selection in a hybrid approach can be achieved by integrating other optimization techniques.</p>
</sec>
</body>
<back>
<sec sec-type="data-availability" id="s7">
<title>Data availability statement</title>
<p>The data supporting the findings of this study were generated through MATLAB simulation and are not based on publicly available datasets. Simulation scripts and parameters used in this study are available from the corresponding author upon reasonable request.</p>
</sec>
<sec sec-type="author-contributions" id="s8">
<title>Author contributions</title>
<p>RaS: Conceptualization, Formal Analysis, Investigation, Methodology, Validation, Writing &#x2013; original draft, Writing &#x2013; review and editing. AT: Investigation, Validation, Writing &#x2013; review and editing. SS: Investigation, Validation, Writing &#x2013; review and editing. AG: Investigation, Validation, Writing &#x2013; review and editing. YC: Funding acquisition, Investigation, Project administration, Supervision, Validation, Writing &#x2013; review and editing. ReS: Investigation, Validation, Writing &#x2013; review and editing.</p>
</sec>
<sec sec-type="COI-statement" id="s10">
<title>Conflict of interest</title>
<p>The author(s) declared that this work was conducted in the absence of any commercial or financial relationships that could be construed as a potential conflict of interest.</p>
</sec>
<sec sec-type="ai-statement" id="s11">
<title>Generative AI statement</title>
<p>The author(s) declared that generative AI was not used in the creation of this manuscript.</p>
<p>Any alternative text (alt text) provided alongside figures in this article has been generated by Frontiers with the support of artificial intelligence and reasonable efforts have been made to ensure accuracy, including review by the authors wherever possible. If you identify any issues, please contact us.</p>
</sec>
<sec sec-type="disclaimer" id="s12">
<title>Publisher&#x2019;s note</title>
<p>All claims expressed in this article are solely those of the authors and do not necessarily represent those of their affiliated organizations, or those of the publisher, the editors and the reviewers. Any product that may be evaluated in this article, or claim that may be made by its manufacturer, is not guaranteed or endorsed by the publisher.</p>
</sec>
<ref-list>
<title>References</title>
<ref id="B1">
<mixed-citation publication-type="journal">
<person-group person-group-type="author">
<name>
<surname>Abdel-Basset</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Mohamed</surname>
<given-names>R.</given-names>
</name>
<name>
<surname>Abouhawwash</surname>
<given-names>M.</given-names>
</name>
</person-group> (<year>2024</year>). <article-title>Crested porcupine optimizer: a new nature-inspired metaheuristic</article-title>. <source>Knowledge-Based Syst.</source> <volume>284</volume>, <fpage>111257</fpage>. <pub-id pub-id-type="doi">10.1016/j.knosys.2023.111257</pub-id>
</mixed-citation>
</ref>
<ref id="B2">
<mixed-citation publication-type="journal">
<person-group person-group-type="author">
<name>
<surname>Abu Salem</surname>
<given-names>A. O.</given-names>
</name>
<name>
<surname>Shudifat</surname>
<given-names>N.</given-names>
</name>
</person-group> (<year>2019</year>). <article-title>Enhanced LEACH protocol for increasing a lifetime of WSNs</article-title>. <source>Personal Ubiquitous Comput.</source> <volume>23</volume>, <fpage>901</fpage>&#x2013;<lpage>907</lpage>. <pub-id pub-id-type="doi">10.1007/s00779-019-01205-4</pub-id>
</mixed-citation>
</ref>
<ref id="B3">
<mixed-citation publication-type="journal">
<person-group person-group-type="author">
<name>
<surname>Alshammri</surname>
<given-names>G. H.</given-names>
</name>
</person-group> (<year>2025</year>). <article-title>Enhancing wireless sensor network lifespan and efficiency through improved cluster head selection using improved squirrel search algorithm</article-title>. <source>Artif. Intell. Rev.</source> <volume>58</volume> (<issue>3</issue>), <fpage>79</fpage>. <pub-id pub-id-type="doi">10.1007/s10462-024-11088-4</pub-id>
</mixed-citation>
</ref>
<ref id="B4">
<mixed-citation publication-type="journal">
<person-group person-group-type="author">
<name>
<surname>Alsuwat</surname>
<given-names>H.</given-names>
</name>
<name>
<surname>Alsuwat</surname>
<given-names>E.</given-names>
</name>
</person-group> (<year>2025</year>). <article-title>Energy-aware and efficient cluster head selection and routing in wireless sensor networks using improved artificial bee colony algorithm</article-title>. <source>Peer-to-Peer Netw. Appl.</source> <volume>18</volume> (<issue>2</issue>), <fpage>1</fpage>&#x2013;<lpage>24</lpage>. <pub-id pub-id-type="doi">10.1007/s12083-024-01810-y</pub-id>
</mixed-citation>
</ref>
<ref id="B5">
<mixed-citation publication-type="journal">
<person-group person-group-type="author">
<name>
<surname>Amshavalli</surname>
<given-names>R. S.</given-names>
</name>
<name>
<surname>Devi</surname>
<given-names>D.</given-names>
</name>
<name>
<surname>Srinivasan</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>ShaliniRajan</surname>
<given-names>R.</given-names>
</name>
<name>
<surname>Jebamani</surname>
<given-names>S. A.</given-names>
</name>
</person-group> (<year>2025</year>). <article-title>Boosted sooty tern and piranhav foraging meta-heuristic optimized cluster head selection-based routing algorithm for extending network lifetime in WSNs</article-title>. <source>Peer-to-Peer Netw. Appl.</source> <volume>18</volume> (<issue>2</issue>), <fpage>66</fpage>. <pub-id pub-id-type="doi">10.1007/s12083-024-01880-y</pub-id>
</mixed-citation>
</ref>
<ref id="B6">
<mixed-citation publication-type="journal">
<person-group person-group-type="author">
<name>
<surname>Asghari</surname>
<given-names>P.</given-names>
</name>
<name>
<surname>Rahmani</surname>
<given-names>A. M.</given-names>
</name>
<name>
<surname>Javadi</surname>
<given-names>H. H.</given-names>
</name>
</person-group> (<year>2019</year>). <article-title>Internet of things applications: a systematic review</article-title>. <source>Comput. Netw.</source> <volume>148</volume>, <fpage>241</fpage>&#x2013;<lpage>261</lpage>. <pub-id pub-id-type="doi">10.1016/j.comnet.2018.12.008</pub-id>
</mixed-citation>
</ref>
<ref id="B7">
<mixed-citation publication-type="journal">
<person-group person-group-type="author">
<name>
<surname>Azizi</surname>
<given-names>M.</given-names>
</name>
</person-group> (<year>2021</year>). <article-title>Atomic orbital search: a novel metaheuristic algorithm</article-title>. <source>Appl. Math. Model.</source> <volume>93</volume>, <fpage>657</fpage>&#x2013;<lpage>683</lpage>. <pub-id pub-id-type="doi">10.1016/j.apm.2020.12.021</pub-id>
</mixed-citation>
</ref>
<ref id="B8">
<mixed-citation publication-type="journal">
<person-group person-group-type="author">
<name>
<surname>Babu</surname>
<given-names>S. S.</given-names>
</name>
<name>
<surname>Geethanjali</surname>
<given-names>N.</given-names>
</name>
</person-group> (<year>2024</year>). <article-title>Lifetime improvement of wireless sensor networks by employing trust index optimized cluster head routing (TIOCHR). Measurement</article-title>. <source>Sensors</source> <volume>32</volume>, <fpage>101068</fpage>. <pub-id pub-id-type="doi">10.1016/j.measen.2024.101068</pub-id>
</mixed-citation>
</ref>
<ref id="B9">
<mixed-citation publication-type="journal">
<person-group person-group-type="author">
<name>
<surname>Das</surname>
<given-names>R.</given-names>
</name>
<name>
<surname>Dwivedi</surname>
<given-names>M.</given-names>
</name>
</person-group> (<year>2024</year>). <article-title>Cluster head selection and malicious node detection using large-scale energy-aware trust optimization algorithm for HWSN</article-title>. <source>J. Reliab. Intelligent Environ.</source> <volume>10</volume> (<issue>1</issue>), <fpage>55</fpage>&#x2013;<lpage>71</lpage>. <pub-id pub-id-type="doi">10.1007/s40860-022-00200-6</pub-id>
</mixed-citation>
</ref>
<ref id="B10">
<mixed-citation publication-type="journal">
<person-group person-group-type="author">
<name>
<surname>Gola</surname>
<given-names>K. K.</given-names>
</name>
<name>
<surname>Gupta</surname>
<given-names>B.</given-names>
</name>
</person-group> (<year>2020</year>). <article-title>Underwater sensor networks:&#x2018;comparative analysis on applications, deployment and routing techniques</article-title>. <source>IET Commun.</source> <volume>14</volume> (<issue>17</issue>), <fpage>2859</fpage>&#x2013;<lpage>2870</lpage>. <pub-id pub-id-type="doi">10.1049/iet-com.2019.1171</pub-id>
</mixed-citation>
</ref>
<ref id="B11">
<mixed-citation publication-type="journal">
<person-group person-group-type="author">
<name>
<surname>Han</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Du</surname>
<given-names>Z.</given-names>
</name>
<name>
<surname>Yuen</surname>
<given-names>K. F.</given-names>
</name>
<name>
<surname>Zhu</surname>
<given-names>H.</given-names>
</name>
<name>
<surname>Li</surname>
<given-names>Y.</given-names>
</name>
<name>
<surname>Yuan</surname>
<given-names>Q.</given-names>
</name>
</person-group> (<year>2024</year>). <article-title>Walrus optimizer: a novel nature-inspired metaheuristic algorithm</article-title>. <source>Expert Syst. Appl.</source> <volume>239</volume>, <fpage>122413</fpage>. <pub-id pub-id-type="doi">10.1016/j.eswa.2023.122413</pub-id>
</mixed-citation>
</ref>
<ref id="B12">
<mixed-citation publication-type="journal">
<person-group person-group-type="author">
<name>
<surname>Haseeb</surname>
<given-names>K.</given-names>
</name>
<name>
<surname>Bakar</surname>
<given-names>K. A.</given-names>
</name>
<name>
<surname>Abdullah</surname>
<given-names>A. H.</given-names>
</name>
<name>
<surname>Darwish</surname>
<given-names>T.</given-names>
</name>
</person-group> (<year>2017</year>). <article-title>Adaptive energy aware cluster-based routing protocol for wireless sensor networks</article-title>. <source>Wirel. Netw.</source> <volume>23</volume>, <fpage>1953</fpage>&#x2013;<lpage>1966</lpage>. <pub-id pub-id-type="doi">10.1007/s11276-016-1269-0</pub-id>
</mixed-citation>
</ref>
<ref id="B13">
<mixed-citation publication-type="journal">
<person-group person-group-type="author">
<name>
<surname>Hassija</surname>
<given-names>V.</given-names>
</name>
<name>
<surname>Chamola</surname>
<given-names>V.</given-names>
</name>
<name>
<surname>Saxena</surname>
<given-names>V.</given-names>
</name>
<name>
<surname>Jain</surname>
<given-names>D.</given-names>
</name>
<name>
<surname>Goyal</surname>
<given-names>P.</given-names>
</name>
<name>
<surname>Sikdar</surname>
<given-names>B.</given-names>
</name>
</person-group> (<year>2019</year>). <article-title>A survey on IoT security: application areas, security threats, and solution architectures</article-title>. <source>IEEE Access</source> <volume>7</volume>, <fpage>82721</fpage>&#x2013;<lpage>82743</lpage>. <pub-id pub-id-type="doi">10.1109/access.2019.2924045</pub-id>
</mixed-citation>
</ref>
<ref id="B14">
<mixed-citation publication-type="journal">
<person-group person-group-type="author">
<name>
<surname>Kharrufa</surname>
<given-names>H.</given-names>
</name>
<name>
<surname>Al-Kashoash</surname>
<given-names>H. A.</given-names>
</name>
<name>
<surname>Kemp</surname>
<given-names>A. H.</given-names>
</name>
</person-group> (<year>2019</year>). <article-title>RPL-based routing protocols in IoT applications: a review</article-title>. <source>IEEE Sensors J.</source> <volume>19</volume> (<issue>15</issue>), <fpage>5952</fpage>&#x2013;<lpage>5967</lpage>. <pub-id pub-id-type="doi">10.1109/jsen.2019.2910881</pub-id>
</mixed-citation>
</ref>
<ref id="B15">
<mixed-citation publication-type="journal">
<person-group person-group-type="author">
<name>
<surname>Kotary</surname>
<given-names>D. K.</given-names>
</name>
<name>
<surname>Nanda</surname>
<given-names>S. J.</given-names>
</name>
</person-group> (<year>2020</year>). <article-title>Distributed robust data clustering in wireless sensor networks using diffusion moth flame optimization</article-title>. <source>Eng. Appl. Artif. Intell.</source> <volume>87</volume>, <fpage>103342</fpage>. <pub-id pub-id-type="doi">10.1016/j.engappai.2019.103342</pub-id>
</mixed-citation>
</ref>
<ref id="B16">
<mixed-citation publication-type="journal">
<person-group person-group-type="author">
<name>
<surname>Landge</surname>
<given-names>P.</given-names>
</name>
<name>
<surname>Singh</surname>
<given-names>Y.</given-names>
</name>
<name>
<surname>Mohapatra</surname>
<given-names>H.</given-names>
</name>
<name>
<surname>Edalatpanah</surname>
<given-names>S.</given-names>
</name>
</person-group> (<year>2025</year>). <article-title>Efficient resource management in IoT network through ACOGA algorithm</article-title>. <source>Comput. Modeling Engineering &#x26; Sciences</source> <volume>143</volume> (<issue>2</issue>), <fpage>1661</fpage>&#x2013;<lpage>1688</lpage>. <pub-id pub-id-type="doi">10.32604/cmes.2025.065599</pub-id>
</mixed-citation>
</ref>
<ref id="B17">
<mixed-citation publication-type="journal">
<person-group person-group-type="author">
<name>
<surname>Li</surname>
<given-names>Q.</given-names>
</name>
<name>
<surname>Gochhayat</surname>
<given-names>S. P.</given-names>
</name>
<name>
<surname>Conti</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Liu</surname>
<given-names>F.</given-names>
</name>
</person-group> (<year>2017</year>). <article-title>EnergIoT: a solution to improve network lifetime of IoT devices</article-title>. <source>Pervasive Mob. Comput.</source> <volume>42</volume>, <fpage>124</fpage>&#x2013;<lpage>133</lpage>. <pub-id pub-id-type="doi">10.1016/j.pmcj.2017.10.005</pub-id>
</mixed-citation>
</ref>
<ref id="B18">
<mixed-citation publication-type="journal">
<person-group person-group-type="author">
<name>
<surname>Mabunga</surname>
<given-names>Z. P.</given-names>
</name>
<name>
<surname>Dela Cruz</surname>
<given-names>J. C.</given-names>
</name>
</person-group> (<year>2025</year>). <article-title>Chronological wild geese optimization algorithm for cluster head selection and routing in wireless sensor network</article-title>. <source>Int. J. Commun. Syst.</source> <volume>38</volume> (<issue>2</issue>), <fpage>e5963</fpage>. <pub-id pub-id-type="doi">10.1002/dac.5963</pub-id>
</mixed-citation>
</ref>
<ref id="B19">
<mixed-citation publication-type="journal">
<person-group person-group-type="author">
<name>
<surname>Madireddy</surname>
<given-names>B.</given-names>
</name>
<name>
<surname>Yarrabothu</surname>
<given-names>R. S.</given-names>
</name>
</person-group> (<year>2025</year>). <article-title>A stable cluster head selection algorithm to minimize the frequent failure of the cluster head nodes in cognitive WSNs</article-title>. <source>Wirel. Personal. Commun.</source> <volume>140</volume> (<issue>1</issue>), <fpage>635</fpage>&#x2013;<lpage>657</lpage>. <pub-id pub-id-type="doi">10.1007/s11277-025-11743-1</pub-id>
</mixed-citation>
</ref>
<ref id="B20">
<mixed-citation publication-type="journal">
<person-group person-group-type="author">
<name>
<surname>Mamta</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Goyal</surname>
<given-names>N.</given-names>
</name>
<name>
<surname>Nain</surname>
<given-names>M.</given-names>
</name>
</person-group> (<year>2022</year>). <article-title>Optimization techniques analysis in underwater wireless sensor network</article-title>. <source>ECS Trans.</source> <volume>107</volume> (<issue>1</issue>), <fpage>5403</fpage>&#x2013;<lpage>5410</lpage>. <pub-id pub-id-type="doi">10.1149/10701.5403ecst</pub-id>
</mixed-citation>
</ref>
<ref id="B21">
<mixed-citation publication-type="journal">
<person-group person-group-type="author">
<name>
<surname>Mohapatra</surname>
<given-names>H.</given-names>
</name>
</person-group> (<year>2025</year>). <article-title>A comprehensive review on urban resilience <italic>via</italic> fault-tolerant IoT and sensor networks</article-title>. <source>Comput. Mater. &#x26; Continua</source> <volume>85</volume> (<issue>1</issue>), <fpage>221</fpage>&#x2013;<lpage>247</lpage>. <pub-id pub-id-type="doi">10.32604/cmc.2025.068338</pub-id>
</mixed-citation>
</ref>
<ref id="B22">
<mixed-citation publication-type="journal">
<person-group person-group-type="author">
<name>
<surname>Pan</surname>
<given-names>J. S.</given-names>
</name>
<name>
<surname>Zhang</surname>
<given-names>L. G.</given-names>
</name>
<name>
<surname>Wang</surname>
<given-names>R. B.</given-names>
</name>
<name>
<surname>Sn&#xe1;&#x161;el</surname>
<given-names>V.</given-names>
</name>
<name>
<surname>Chu</surname>
<given-names>S. C.</given-names>
</name>
</person-group> (<year>2022</year>). <article-title>Gannet optimization algorithm: a new metaheuristic algorithm for solving engineering optimization problems</article-title>. <source>Math. Comput. Simul.</source> <volume>202</volume>, <fpage>343</fpage>&#x2013;<lpage>373</lpage>. <pub-id pub-id-type="doi">10.1016/j.matcom.2022.06.007</pub-id>
</mixed-citation>
</ref>
<ref id="B23">
<mixed-citation publication-type="journal">
<person-group person-group-type="author">
<name>
<surname>Panchal</surname>
<given-names>A.</given-names>
</name>
<name>
<surname>Singh</surname>
<given-names>R. K.</given-names>
</name>
</person-group> (<year>2021</year>). <article-title>EHCR-FCM: energy efficient hierarchical clustering and routing using fuzzy C-Means for wireless sensor networks</article-title>. <source>Telecommun. Syst.</source> <volume>76</volume> (<issue>2</issue>), <fpage>251</fpage>&#x2013;<lpage>263</lpage>. <pub-id pub-id-type="doi">10.1007/s11235-020-00712-7</pub-id>
</mixed-citation>
</ref>
<ref id="B24">
<mixed-citation publication-type="journal">
<person-group person-group-type="author">
<name>
<surname>Poluru</surname>
<given-names>R. K.</given-names>
</name>
<name>
<surname>Naseera</surname>
<given-names>S.</given-names>
</name>
</person-group> (<year>2017</year>). <article-title>A literature review on routing strategy in the internet of things</article-title>. <source>J. Eng. Sci. &#x26; Technol. Rev.</source> <volume>10</volume> (<issue>5</issue>), <fpage>50</fpage>&#x2013;<lpage>60</lpage>. <pub-id pub-id-type="doi">10.25103/jestr.105.06</pub-id>
</mixed-citation>
</ref>
<ref id="B25">
<mixed-citation publication-type="journal">
<person-group person-group-type="author">
<name>
<surname>Prakash</surname>
<given-names>V.</given-names>
</name>
<name>
<surname>Singh</surname>
<given-names>D.</given-names>
</name>
<name>
<surname>Pandey</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>Singh</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>Singh</surname>
<given-names>P. K.</given-names>
</name>
</person-group> (<year>2024</year>). <article-title>Energy-optimization route and cluster head selection using m-pso and ga in wireless sensor networks</article-title>. <source>Wirel. Personal. Commun.</source>, <fpage>1</fpage>&#x2013;<lpage>26</lpage>. <pub-id pub-id-type="doi">10.1007/s11277-024-11096-1</pub-id>
</mixed-citation>
</ref>
<ref id="B26">
<mixed-citation publication-type="journal">
<person-group person-group-type="author">
<name>
<surname>Rajput</surname>
<given-names>A.</given-names>
</name>
<name>
<surname>Kumaravelu</surname>
<given-names>V. B.</given-names>
</name>
</person-group> (<year>2021</year>). <article-title>FCM clustering and FLS based CH selection to enhance sustainability of wireless sensor networks for environmental monitoring applications</article-title>. <source>J. Ambient Intell. Humaniz. Comput.</source> <volume>12</volume> (<issue>1</issue>), <fpage>1139</fpage>&#x2013;<lpage>1159</lpage>. <pub-id pub-id-type="doi">10.1007/s12652-020-02159-9</pub-id>
</mixed-citation>
</ref>
<ref id="B27">
<mixed-citation publication-type="journal">
<person-group person-group-type="author">
<name>
<surname>Roberts</surname>
<given-names>M. K.</given-names>
</name>
<name>
<surname>Ramasamy</surname>
<given-names>P.</given-names>
</name>
<name>
<surname>Dahan</surname>
<given-names>F.</given-names>
</name>
</person-group> (<year>2024</year>). <article-title>An innovative approach for cluster head selection and energy optimization in wireless sensor networks using zebra fish and sea horse optimization techniques</article-title>. <source>J. Industrial Inf. Integration</source> <volume>41</volume>, <fpage>100642</fpage>. <pub-id pub-id-type="doi">10.1016/j.jii.2024.100642</pub-id>
</mixed-citation>
</ref>
<ref id="B28">
<mixed-citation publication-type="journal">
<person-group person-group-type="author">
<name>
<surname>Sahoo</surname>
<given-names>B. M.</given-names>
</name>
<name>
<surname>Amgoth</surname>
<given-names>T.</given-names>
</name>
<name>
<surname>Pandey</surname>
<given-names>H. M.</given-names>
</name>
</person-group> (<year>2020</year>). <article-title>Particle swarm optimization based energy efficient clustering and sink mobility in heterogeneous wireless sensor network</article-title>. <source>Ad Hoc Netw.</source> <volume>106</volume>, <fpage>102237</fpage>. <pub-id pub-id-type="doi">10.1016/j.adhoc.2020.102237</pub-id>
</mixed-citation>
</ref>
<ref id="B29">
<mixed-citation publication-type="journal">
<person-group person-group-type="author">
<name>
<surname>Sankar</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>Srinivasan</surname>
<given-names>P.</given-names>
</name>
<name>
<surname>Luhach</surname>
<given-names>A. K.</given-names>
</name>
<name>
<surname>Somula</surname>
<given-names>R.</given-names>
</name>
<name>
<surname>Chilamkurti</surname>
<given-names>N.</given-names>
</name>
</person-group> (<year>2020</year>). <article-title>Energy-aware grid-based data aggregation scheme in routing protocol for agricultural internet of things</article-title>. <source>Sustain. Comput. Inf. Syst.</source> <volume>28</volume>, <fpage>100422</fpage>. <pub-id pub-id-type="doi">10.1016/j.suscom.2020.100422</pub-id>
</mixed-citation>
</ref>
<ref id="B30">
<mixed-citation publication-type="journal">
<person-group person-group-type="author">
<name>
<surname>Sathish</surname>
<given-names>K.</given-names>
</name>
<name>
<surname>Ravikumar</surname>
<given-names>C. V.</given-names>
</name>
<name>
<surname>Rajesh</surname>
<given-names>A.</given-names>
</name>
<name>
<surname>Pau</surname>
<given-names>G.</given-names>
</name>
</person-group> (<year>2022</year>). <article-title>Underwater wireless sensor network performance analysis using diverse routing protocols</article-title>. <source>J. Sens. Actuator Netw.</source> <volume>11</volume> (<issue>4</issue>), <fpage>64</fpage>. <pub-id pub-id-type="doi">10.3390/jsan11040064</pub-id>
</mixed-citation>
</ref>
<ref id="B31">
<mixed-citation publication-type="journal">
<person-group person-group-type="author">
<name>
<surname>Sennan</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>Ramasubbareddy</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>Balasubramaniyam</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>Nayyar</surname>
<given-names>A.</given-names>
</name>
<name>
<surname>Abouhawwash</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Hikal</surname>
<given-names>N. A.</given-names>
</name>
</person-group> (<year>2021a</year>). <article-title>T2FL-PSO: type-2 fuzzy logic-based particle swarm optimization algorithm used to maximize the lifetime of internet of things</article-title>. <source>IEEE Access</source> <volume>9</volume>, <fpage>63966</fpage>&#x2013;<lpage>63979</lpage>. <pub-id pub-id-type="doi">10.1109/access.2021.3069455</pub-id>
</mixed-citation>
</ref>
<ref id="B32">
<mixed-citation publication-type="journal">
<person-group person-group-type="author">
<name>
<surname>Sennan</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>Somula</surname>
<given-names>R.</given-names>
</name>
<name>
<surname>Luhach</surname>
<given-names>A. K.</given-names>
</name>
<name>
<surname>Deverajan</surname>
<given-names>G. G.</given-names>
</name>
<name>
<surname>Alnumay</surname>
<given-names>W.</given-names>
</name>
<name>
<surname>Jhanjhi</surname>
<given-names>N. Z.</given-names>
</name>
<etal/>
</person-group> (<year>2021b</year>). <article-title>Energy efficient optimal parent selection-based routing protocol for internet of things using firefly optimization algorithm</article-title>. <source>Trans. Emerg. Telecommun. Technol.</source> <volume>32</volume> (<issue>8</issue>), <fpage>e4171</fpage>. <pub-id pub-id-type="doi">10.1002/ett.4171</pub-id>
</mixed-citation>
</ref>
<ref id="B33">
<mixed-citation publication-type="journal">
<person-group person-group-type="author">
<name>
<surname>Sheikh</surname>
<given-names>H. F.</given-names>
</name>
<name>
<surname>Ahmad</surname>
<given-names>I.</given-names>
</name>
<name>
<surname>Wang</surname>
<given-names>Z.</given-names>
</name>
<name>
<surname>Ranka</surname>
<given-names>S.</given-names>
</name>
</person-group> (<year>2012a</year>). <article-title>An overview and classification of thermal-aware scheduling techniques for multi-core processing systems</article-title>. <source>Sustain. Comput. Inf. Syst.</source> <volume>2</volume> (<issue>3</issue>), <fpage>151</fpage>&#x2013;<lpage>169</lpage>. <pub-id pub-id-type="doi">10.1016/j.suscom.2011.06.005</pub-id>
</mixed-citation>
</ref>
<ref id="B34">
<mixed-citation publication-type="journal">
<person-group person-group-type="author">
<name>
<surname>Sheikh</surname>
<given-names>H. F.</given-names>
</name>
<name>
<surname>Tan</surname>
<given-names>H.</given-names>
</name>
<name>
<surname>Ahmad</surname>
<given-names>I.</given-names>
</name>
<name>
<surname>Ranka</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>Bv</surname>
<given-names>P.</given-names>
</name>
</person-group> (<year>2012b</year>). <article-title>Energy-and performance-aware scheduling of tasks on parallel and distributed systems</article-title>. <source>ACM J. Emerg. Technol. Comput. Syst. (JETC)</source> <volume>8</volume> (<issue>4</issue>), <fpage>1</fpage>&#x2013;<lpage>37</lpage>. <pub-id pub-id-type="doi">10.1145/2367736.2367743</pub-id>
</mixed-citation>
</ref>
<ref id="B35">
<mixed-citation publication-type="journal">
<person-group person-group-type="author">
<name>
<surname>Sheikh</surname>
<given-names>H. F.</given-names>
</name>
<name>
<surname>Ahmad</surname>
<given-names>I.</given-names>
</name>
<name>
<surname>Fan</surname>
<given-names>D.</given-names>
</name>
</person-group> (<year>2015</year>). <article-title>An evolutionary technique for performance-energy-temperature optimized scheduling of parallel tasks on multi-core processors</article-title>. <source>IEEE Trans. Parallel Distributed Syst.</source> <volume>27</volume> (<issue>3</issue>), <fpage>668</fpage>&#x2013;<lpage>681</lpage>. <pub-id pub-id-type="doi">10.1109/tpds.2015.2421352</pub-id>
</mixed-citation>
</ref>
<ref id="B36">
<mixed-citation publication-type="journal">
<person-group person-group-type="author">
<name>
<surname>Srinivasan</surname>
<given-names>C. R.</given-names>
</name>
<name>
<surname>Rajesh</surname>
<given-names>B.</given-names>
</name>
<name>
<surname>Saikalyan</surname>
<given-names>P.</given-names>
</name>
<name>
<surname>Premsagar</surname>
<given-names>K.</given-names>
</name>
<name>
<surname>Yadav</surname>
<given-names>E. S.</given-names>
</name>
</person-group> (<year>2019</year>). <article-title>A review on the different types of internet of things (IoT)</article-title>. <source>J. Adv. Res. Dyn. Control Syst.</source> <volume>11</volume> (<issue>1</issue>), <fpage>154</fpage>&#x2013;<lpage>158</lpage>.</mixed-citation>
</ref>
<ref id="B37">
<mixed-citation publication-type="journal">
<person-group person-group-type="author">
<name>
<surname>Storn</surname>
<given-names>R.</given-names>
</name>
<name>
<surname>Price</surname>
<given-names>K.</given-names>
</name>
</person-group> (<year>1997</year>). <article-title>Differential evolution&#x2013;a simple and efficient heuristic for global optimization over continuous spaces</article-title>. <source>J. Global Optimization</source> <volume>11</volume> (<issue>4</issue>), <fpage>341</fpage>&#x2013;<lpage>359</lpage>. <pub-id pub-id-type="doi">10.1023/a:1008202821328</pub-id>
</mixed-citation>
</ref>
<ref id="B38">
<mixed-citation publication-type="journal">
<person-group person-group-type="author">
<name>
<surname>Sumida</surname>
<given-names>B. H.</given-names>
</name>
<name>
<surname>Houston</surname>
<given-names>A. I.</given-names>
</name>
<name>
<surname>McNamara</surname>
<given-names>J. M.</given-names>
</name>
<name>
<surname>Hamilton</surname>
<given-names>W. D.</given-names>
</name>
</person-group> (<year>1990</year>). <article-title>Genetic algorithms and evolution</article-title>. <source>J. Theor. Biol.</source> <volume>147</volume> (<issue>1</issue>), <fpage>59</fpage>&#x2013;<lpage>84</lpage>. <pub-id pub-id-type="doi">10.1016/s0022-5193(05)80252-8</pub-id>
<pub-id pub-id-type="pmid">2277505</pub-id>
</mixed-citation>
</ref>
<ref id="B39">
<mixed-citation publication-type="journal">
<person-group person-group-type="author">
<name>
<surname>Thangaramya</surname>
<given-names>K.</given-names>
</name>
<name>
<surname>Kulothungan</surname>
<given-names>K.</given-names>
</name>
<name>
<surname>Logambigai</surname>
<given-names>R.</given-names>
</name>
<name>
<surname>Selvi</surname>
<given-names>M.</given-names>
</name>
<name>
<surname>Ganapathy</surname>
<given-names>S.</given-names>
</name>
<name>
<surname>Kannan</surname>
<given-names>A.</given-names>
</name>
</person-group> (<year>2019</year>). <article-title>Energy aware cluster and neuro-fuzzy based routing algorithm for wireless sensor networks in IoT</article-title>. <source>Comput. Networks</source> <volume>151</volume>, <fpage>211</fpage>&#x2013;<lpage>223</lpage>. <pub-id pub-id-type="doi">10.1016/j.comnet.2019.01.024</pub-id>
</mixed-citation>
</ref>
<ref id="B40">
<mixed-citation publication-type="journal">
<person-group person-group-type="author">
<name>
<surname>Tran</surname>
<given-names>M. Q.</given-names>
</name>
<name>
<surname>Nguyen</surname>
<given-names>D. T.</given-names>
</name>
<name>
<surname>Le</surname>
<given-names>V. A.</given-names>
</name>
<name>
<surname>Nguyen</surname>
<given-names>D. H.</given-names>
</name>
<name>
<surname>Pham</surname>
<given-names>T. V.</given-names>
</name>
</person-group> (<year>2019</year>). <article-title>Task placement on fog computing made efficient for IoT application provision</article-title>. <source>Wirel. Commun. Mob. Comput.</source> <volume>2019</volume> (<issue>1</issue>), <fpage>6215454</fpage>. <pub-id pub-id-type="doi">10.1155/2019/6215454</pub-id>
</mixed-citation>
</ref>
<ref id="B41">
<mixed-citation publication-type="journal">
<person-group person-group-type="author">
<name>
<surname>Wang</surname>
<given-names>J.</given-names>
</name>
<name>
<surname>Gao</surname>
<given-names>Y.</given-names>
</name>
<name>
<surname>Liu</surname>
<given-names>W.</given-names>
</name>
<name>
<surname>Sangaiah</surname>
<given-names>A. K.</given-names>
</name>
<name>
<surname>Kim</surname>
<given-names>H. J.</given-names>
</name>
</person-group> (<year>2019</year>). <article-title>Energy efficient routing algorithm with mobile sink support for wireless sensor networks</article-title>. <source>Sensors</source> <volume>19</volume> (<issue>7</issue>), <fpage>1494</fpage>. <pub-id pub-id-type="doi">10.3390/s19071494</pub-id>
<pub-id pub-id-type="pmid">30934790</pub-id>
</mixed-citation>
</ref>
</ref-list>
<fn-group>
<fn fn-type="custom" custom-type="edited-by">
<p>
<bold>Edited by:</bold> <ext-link ext-link-type="uri" xlink:href="https://loop.frontiersin.org/people/1697950/overview">Hitesh Mohapatra</ext-link>, KIIT University, India</p>
</fn>
<fn fn-type="custom" custom-type="reviewed-by">
<p>
<bold>Reviewed by:</bold> <ext-link ext-link-type="uri" xlink:href="https://loop.frontiersin.org/people/1586315/overview">Duraimurugan Samiayya</ext-link>, St. Joseph&#x2019;s College of Engineering, India</p>
<p>
<ext-link ext-link-type="uri" xlink:href="https://loop.frontiersin.org/people/3353845/overview">Krishna Reddy Maddikera</ext-link>, Rajeev Gandhi Memorial College of Engineering and Technology, India</p>
<p>
<ext-link ext-link-type="uri" xlink:href="https://loop.frontiersin.org/people/3369515/overview">Xuan Yang</ext-link>, China University of Mining and Technology, China</p>
</fn>
</fn-group>
</back>
</article>