Network Topology Changes Research Articles

An adaptive distance protection scheme considering fault resistance, injected current, and structural changes in the power system

AbstractFaults in power systems occur for various reasons, such as aging or natural disasters. Detecting, locating, and promptly clearing these faults is crucial for maintaining the safety and reliability of transmission lines (TLs). Distance relays (DRs), which protect TLs, detect faults, estimate their location, and send the required commands. However, these relays may experience mis‐detection due to manipulated impedance arising from both internal and external factors. These factors include measurement device errors, network topology changes, the presence of fault resistance (FR), and injected currents from remote line terminals. To address this challenge, an innovative adaptive protection scheme that considers FR, changes in network topology, and injected current from the opposite end of the line is proposed. By estimating the equivalent circuit impedances (ECIs) of the network connected to the terminal of the TL, this protection scheme utilizes impedance estimation techniques at the line terminals and offline network information. Simulation studies (tested on the IEEE 39‐bus standard network) show that the proposed scheme accurately estimates fault location (FL) and FR with high precision. The simulation results demonstrate its effectiveness in improving the performance of conventional distance protection relays in both the first and second protection zones ( and ).

An Energy-efficient Routing Protocol Based on Elephant Herding Optimization in MANET

Background: A mobile ad hoc network (MANET) is a collection of self-organizing mobile nodes creating an ad hoc network without fixed infrastructure. Routing is a major issue in mobile networks that may reduce network performance due to frequent network topology changes. Routing protocols are so important in dynamic multi-hop networks that many studies have focused on the routing problem in MANETs. Methods: In this research work, a proposed ad hoc on-demand distance vector (AODV) with an elephant herding optimization (EHO) called AODVEHO is used as an optimal path selection method that creates a set of best paths between destination and source. Results: To validate the performance of proposed AODVEHO, AntHocNet, AODV, and designation sequence distance vector (DSDV). Various performance measures are considered to validate our proposed research work, such as packet delivery ratio (PDR), end-to-end delay (E2ED), and average energy consumption (AEC). Conclusion: Experimental results are indicated that the AODVEHO achieved a higher routing overhead (73 %), PDR (89.87 %), low E2ED rate (95.22 %), AEC (75.60 %), and dead nodes (75%) when compared to other routing schemes.

A New SDM-Based Approach for Assessing Climate Change Effects on Plant–Pollinator Networks

Current methods for studying the effects of climate change on plants and pollinators can be grouped into two main categories. The first category involves using species distribution models (SDMs) to generate habitat suitability maps, followed by applying climate change scenarios to predict the future distribution of plants and pollinators separately. The second category involves constructing interaction matrices between plants and pollinators and then either randomly removing species or selectively removing generalist or specialist species, as a way to estimate how climate change might affect the plant–pollinator network. The primary limitation of the first approach is that it examines plant and pollinator distributions separately, without considering their interactions within the context of a pollination network. The main weakness of the second approach is that it does not accurately predict climate change impacts, as it arbitrarily selects species to remove without knowing which species will truly shift, decline, or increase in distribution due to climate change. Therefore, a new approach is needed to bridge the gap between these two methods while avoiding their specific limitations. In this context, we introduced an innovative approach that first requires the creation of binary climate suitability maps for plants and pollinators, based on SDMs, for both the current and future periods. This step aligns with the first category of methods mentioned earlier. To assess the effects of climate change within a network framework, we consider species co-overlapping in a geographic matrix. For this purpose, we developed a Python program that overlays the binary distribution maps of plants and pollinators, generating interaction matrices. These matrices represent potential plant–pollinator interactions, with a ‘0’ indicating no overlap and a ‘1’ where both species coincide in the same cell. As a result, for each cell within the study area, we can construct interaction matrices for both the present and future periods. This means that for each cell, we can analyze at least two pollination networks based on species co-overlap. By comparing the topology of these matrices over time, we can infer how climate change might affect plant–pollinator interactions at a fine spatial scale. We applied our methodology to Chile as a case study, generating climate suitability maps for 187 plant species and 171 pollinator species, resulting in 2906 pollination networks. We then evaluated how climate change could affect the network topology across Chile on a cell-by-cell basis. Our findings indicated that the primary effect of climate change on pollination networks is likely to manifest more significantly through network extinctions, rather than major changes in network topology.

EDRP-GTDQN: An adaptive routing protocol for energy and delay optimization in wireless sensor networks using game theory and deep reinforcement learning

Routing protocols, as a crucial component of the internet of things (IoT), play a significant role in data collection and environmental monitoring tasks. However, existing clustering routing protocols suffer from issues such as uneven network energy consumption, high communication delays, and inadequate adaptation to topology changes. To address these issues, this study proposes an adaptive routing algorithm to balance energy consumption and delay using game theory and deep Q-network (DQN) algorithms (EDRP-GTDQN). Specifically, EDRP-GTDQN evaluates the importance of node positions using node centrality and integrates a game-theoretic-based approach to select optimal cluster heads in terms of node centrality and residual energy. Moreover, graph convolutional networks (GCN) and DQN are incorporated to construct transmission paths for cluster heads, adapt to network topology changes, and balance energy consumption and performance. Furthermore, a cluster rotation mechanism is employed to optimize overall network energy consumption and prevent the formation of hotspots. Experimental results demonstrate that EDRP-GTDQN achieves average performance improvements of 19.76%, 30.04%, 44.2%, and 61.42% in average energy consumption, network lifetime, and average end-to-end delay compared to conventional routing protocols such as EECRAIFA, MRP-GTCO, DEEC, and MH-LEACH. Therefore, EDRP-GTDQN is undoubtedly an effective solution to reduce energy consumption and enhance service quality in wireless sensor networks.

Denial-of-service attack (BH and PDA) effect analysis on AODV Routing Protocol with Random Mobility

Mobile ad hoc networks (MANETs) has received significant attention in the research domain of routing protocol as they provide security to transmit the data at the destination node. Mobile ad hoc networks do not have a fixed infrastructure, and nodes have random mobility due to this network topology changing dynamically and it vulnerable to external threats. Block hole and packet dropping are well-known network layer Denial of service attacks. during the route, discovery phase malicious nodes work normally and it became the shortest path to route the data and after that, it will drop all the data instead of transferring the data to the destination and in case of the packet dropping attack node drop the packet due to the elfishness of a node, Lack of energy resources, Bandwidth consumed by the attacker node, Overflow of the transmission queue, Misbehavior of a malicious node, it will drop the packet in the network. In this paper, we analyze the impact of both attacks on the AODV routing protocol in the random mobility environments with the different simulation parameters. DOI: https://doi.org/10.52783/pst.922

Aberrant individual large-scale functional network connectivity and topology in chronic insomnia disorder with and without depression

Insomnia is increasingly prevalent with significant associations with depression. Delineating specific neural circuits for chronic insomnia disorder (CID) with and without depressive symptoms is fundamental to develop precision diagnosis and treatment. In this study, we examine static, dynamic and network topology changes of individual large-scale functional network for CID with (CID-D) and without depression to reveal their specific neural underpinnings. Seventeen individual-specific functional brain networks are obtained using a regularized nonnegative matrix factorization technique. Disorders-shared and -specific differences in static and dynamic large-scale functional network connectivities within or between the cognitive control network, dorsal attention network, visual network, limbic network, and default mode network are found for CID and CID-D. Additionally, CID and CID-D groups showed compromised network topological architecture including reduced small-world properties, clustering coefficients and modularity indicating decreased network efficiency and impaired functional segregation. Moreover, the altered neuroimaging indices show significant associations with clinical manifestations and could serve as effective neuromarkers to distinguish among healthy controls, CID and CID-D. Taken together, these findings provide novel insights into the neural basis of CID and CID-D, which may facilitate developing new diagnostic and therapeutic approaches.

Structure matters: Assessing the statistical significance of network topologies.

Network analysis has found widespread utility in many research areas. However, assessing the statistical significance of observed relationships within networks remains a complex challenge. Traditional node permutation tests are often insufficient in capturing the effect of changing network topology by creating reliable null distributions. We propose two randomization alternatives to address this gap: random rewiring and controlled rewiring. These methods incorporate changes in the network topology through edge swaps. However, controlled rewiring allows for more nuanced alterations of the original network than random rewiring. In this sense, this paper introduces a novel evaluation tool, the Expanded Quadratic Assignment Procedure (EQAP), designed to calculate a specific p-value and interpret statistical tests with enhanced precision. The combination of EQAP and controlled rewiring provides a robust network comparison and statistical analysis framework. The methodology is exemplified through two real-world examples: the analysis of an organizational network structure, illustrated by the Enron-Email dataset, and a social network case, represented by the UK Faculty friendship network. The utility of these statistical tests is underscored by their capacity to safeguard researchers against Type I errors when exploring network metrics dependent on intricate topologies.

Performance Study of Collection Tree Protocol in Mobile Wireless Sensor Network

The Mobile Wireless Sensor Networks (MWSN) are defined as the successor of Wireless Sensor Networks (WSN); geographically distributed autonomous mobile sensors for physical and environmental conditions monitoring. Mobile sensor networks are more flexible than static sensor networks as they can cope with rapid topology changes. Sensor networks are deployed by having their sensors collect information reliably and then relay the sensor readings to a central base station using wireless multi-hop transmission. Multi-hop routes within a rapid-changed topology requires a routing protocol that can adapt to network changes with an efficient communication mechanism among the nodes; to comply with the energy-constraint nature of the wireless sensor networks. Through significant simulation on this study using the AVRora simulator, the Collection Tree Protocol’s (CTP) capacity to respond to MWSN’s changing network topology was assessed by analysing the performance indicators; specifically, the average of packet loss and energy use of mobile nodes with different circumstances considering varied quantities of mobile nodes in the simulation region, with different velocities and network density. In several circumstances, the implementation of CTP in MWSN indicates a rise in energy usage because of broken linkages along with regular tree regeneration brought on by node mobility.

Impact of network topology changes on information source localization

Well-established methods of locating the source of information in a complex network are usually derived with the assumption of complete and exact knowledge of network topology. We study the performance of three such algorithms (Limited Pinto–Thiran–Vetterli Algorithm — LPTVA, Gradient Maximum Likelihood Algorithm — GMLA and Pearson Correlation Algorithm — PCA) in scenarios that do not fulfill this assumption by modifying the network before localization. This is done by adding superfluous new links, hiding existing ones, or reattaching links following the network’s structural Hamiltonian. Our results show that GMLA is highly resilient to adding superfluous edges, as its precision falls by more than statistical uncertainty only when the number of links is approximately doubled. On the other hand, if the edge set is underestimated or reattachment has taken place, the performance of GMLA drops significantly. In such a scenario, PCA is preferable, retaining most of its performance when other simulation parameters favor successful localization (high density of observers, highly deterministic propagation). It is also generally more accurate than LPTVA and orders of magnitude faster. The differences between localization algorithms can be intuitively explained, although further theoretical research is needed.

Hybrid optimization-based secured routing in mobile ad-hoc network

Mobile Ad hoc Networks (MANETs) pose significant routing challenges due to their decentralized and dynamic nature. Node mobility results in frequent changes in network topology, leading to unsFIG connectivity and link quality. Traditional RPs designed for static networks are inadequate for MANETs. To deal with these issues, a secure routing approach is proposed using the Red Panda-Lyrebrid Optimization (RePLO) algorithm, which combines the advantages of the Red Panda Optimization (RPO) and Lyrebird Optimization Algorithm (LOA) algorithms. The proposed approach consists of five steps: (i) configuring the system model, (ii) developing the energy model, (iii) creating the mobility model, (iv) selecting cluster heads using the RePLO algorithm, and (v) routing using the RePLO algorithm. The RePLO algorithm optimizes cluster head selection and routing while considering specific constraints such as delay, distance, energy, & security for Cluster Head (CH) selection, and link quality and enhanced trust for routing optimization. The effectiveness of the proposed approach is evaluated using various metrics to demonstrate its efficiency in MANET routing. By integrating multiple optimization techniques and considering critical constraints, the RePLO algorithm offers a systematic and secure solution for MANET routing. The evaluation results confirm the efficacy of the proposed approach in improving network performance, reliability, and security. Overall, the RePLO algorithm presents a promising approach to tackle the routing issues inherent in MANETs, paving the way for more robust and efficient communication in mobile ad hoc networks.

Hub disruption in HIV disease and cocaine use: A connectomics analysis of brain function

BackgroundCocaine use (CU) is prevalent in people with HIV (PWH). Both conditions are linked to changes in cognitive functioning and neural network topology. The current study utilizes graph theory to investigate functional connectomics associated with HIV and CU, focusing on disruption of densely connected nodes called hubs. MethodsResting state functional magnetic resonance imaging (fMRI) from 206 adults (ages 22–55 years) were analyzed. A HIV x CU factorial design was implemented with participants in four groups: HIV+CU (n= 41), HIV only (n= 88), CU only (n= 36), and controls (n= 41). Functional connectomes were constructed, and thresholded graph metrics were calculated. Network centrality metrics – betweenness centrality (BC), participation coefficient (PC), and within module degree (WD) – were quantified into hub disruption indices (HDI). For each index, a 2×2 ANCOVA was performed controlling for education. ResultsParticipants were 68 % male and 74 % African-American with a mean age of 44.4 years. HIV and CU were associated with hub disruption in all three indices. Interactions were significant for HDI-PC and HDI-WD, such that HIV disease was associated with greater hub disruption among participants without CU, but not among participants with CU. Overall, lower global cognitive functioning was associated with greater hub disruption on all three indices. ConclusionsWidespread hub disruption was evident in HIV disease and CU, highlighting topological reorganization in both diseases with neurocognitive effects. Hub-related measures inform functional connectivity disruptions in HIV disease and CU, particularly with respect to changes in network topology throughout the connectome.

Optimal allocation of distributed generation on DC Networks

A consistent increase in the installation of distributed generation (DG) in response to rising energy cost and demand throughout the world, especially for the last two decades, primarily aims to obviate upgrading investments for transmission and distribution lines on the existing power grid while ensuring sustainable, resilient, and reliable service to end users. Random installation of DG, on the other hand, can invalidate the existing grid’s designated objectives, and operational boundaries due to the changes in network topology resulting in unforeseen load flow. Appropriate integration of DG units on DC networks should be remedy to high transmission/distribution losses in lines, instabilities in voltage profiles, issues in power quality parameters, and derogation in the protection schemes. Based on the behavior of load profiles, e.g., 24 h or longer period, operational and technical constraints, this study proposes a framework that minimizes transmission/distribution losses on a DC network, in which discrete variables stand for the location of DGs. Optimal power flow (OPF) problem formulation underpins the proposed optimization framework. Overall, this computationally challenging planning problem refers to a mixed-integer nonlinear program (MINLP) including discrete variables with non-convex power balance/flow representations. To deal with the non-convexities and discrete form of the formulation, a mixed-integer second-order cone programming (MISOCP) relaxation, and branch-and-bound search are assigned. The validation of the introduced approach is carried out on the IEEE modified benchmark systems. With the help of proposed method, optimal allocation of DG units on 9-bus, 14-bus, and 30-bus systems, respectively, lead up to 99.93%, 94.38%, and 79.09% total power losses reduction.

Adaptive and low-cost resource synchronization based on data distribution service in high dynamic networks

In disaster-stricken areas monitoring, management, search, and rescue operations, unmanned aerial vehicles (UAVs) play a crucial role in disaster management and emergency communication due to their high mobility. To efficiently coordinate and plan UAVs and their carried sensor and base station resources, synchronization is essential to establish consistency, laying the foundation for high-level demands. In such scenarios, synchronization relies on request–response (RR) or publish–subscribe (PS) forms of information exchange. Existing research in the field typically focuses on higher-level applications and selects either RR or PS synchronization, thereby overlooking the potential advantages that could be gained from combining both methods to meet synchronization requirements. We propose a resource synchronization method based on the Data Distribution Service (DDS) and a linear time complexity subscription mechanism tailored to specific query demands, which considers the pros and cons of the above two information exchange forms and the bottom-layer network topology. Experimental results using open-source simulation tools demonstrate that the proposed method adapts to scene requirements and decreases bandwidth by at least 21.2% and packet rate by at least 3.7% compared to different baseline methods across three topologies, while satisfying delay and query success rate requirements. Furthermore, the method maintains robust performance in the face of dynamic changes in network topology, showcasing its robustness.

Grand canonically optimized grain boundary phases in hexagonal close-packed titanium

Grain boundaries (GBs) profoundly influence the properties and performance of materials, emphasizing the importance of understanding the GB structure and phase behavior. As recent computational studies have demonstrated the existence of multiple GB phases associated with varying the atomic density at the interface, we introduce a validated, open-source GRand canonical Interface Predictor (GRIP) tool that automates high-throughput, grand canonical optimization of GB structures. While previous studies of GB phases have almost exclusively focused on cubic systems, we demonstrate the utility of GRIP in an application to hexagonal close-packed titanium. We perform a systematic high-throughput exploration of tilt GBs in titanium and discover previously unreported structures and phase transitions. In low-angle boundaries, we demonstrate a coupling between point defect absorption and the change in the GB dislocation network topology due to GB phase transformations, which has important implications for the accommodation of radiation-induced defects.

Microvascular plasticity in mouse stroke model recovery: Anatomy statistics, dynamics measured by longitudinal in vivo two-photon angiography, network vectorization.

This manuscript quantitatively investigates remodeling dynamics of the cortical microvascular network (thousands of connected capillaries) following photothrombotic ischemia (cubic millimeter volume, imaged weekly) using a novel in vivo two-photon angiography and high throughput vascular vectorization method. The results suggest distinct temporal patterns of cerebrovascular plasticity, with acute remodeling peaking at one week post-stroke. The network architecture then gradually stabilizes, returning to a new steady state after four weeks. These findings align with previous literature on neuronal plasticity, highlighting the correlation between neuronal and neurovascular remodeling. Quantitative analysis of neurovascular networks using length- and strand-based statistical measures reveals intricate changes in network anatomy and topology. The distance and strand-length statistics show significant alterations, with a peak of plasticity observed at one week post-stroke, followed by a gradual return to baseline. The orientation statistic plasticity peaks at two weeks, gradually approaching the (conserved across subjects) stroke signature. The underlying mechanism of the vascular response (angiogenesis vs. tissue deformation), however, is yet unexplored. Overall, the combination of chronic two-photon angiography, vascular vectorization, reconstruction/visualization, and statistical analysis enables both qualitative and quantitative assessments of neurovascular remodeling dynamics, demonstrating a method for investigating cortical microvascular network disorders and the therapeutic modes of action thereof.

A deep reinforcement learning-based intelligent QoS optimization algorithm for efficient routing in vehicular networks

With the rapid development of Telematics, Vehicle Self-Organizing Networks (VANETs) play an increasingly critical role in Intelligent Transportation Systems (ITS). Especially in the environment without roadside assistance units (RSUs), how to effectively manage inter-vehicle communication and improve the stability and communication efficiency of the network has become a hot topic of current research. In this paper, a Deep Reinforcement Learning-based Intelligent QoS-optimized efficient routing algorithm for vehicular networks (DRLIQ) is proposed for VANETs with/without RSU environments, and routing methods are proposed respectively. Among them, in RSU-free environment, the DRLIQ algorithm utilizes the powerful processing capability of deep reinforcement learning to intelligently select the optimal data transmission path by dynamically learning and adapting to the changes in the vehicular network, thus effectively reducing communication interruptions and delays, and improving the accuracy of data transmission. The performance of the DRLIQ algorithm under different vehicle densities is evaluated in simulation experiments and compared with current popular algorithms. The experimental results show that the DRLIQ algorithm outperforms the comparison algorithms in reducing the number of communication interruptions, BER and network delay, especially in vehicle-dense environments. In addition, the DRLIQ algorithm shows higher adaptability and stability in coping with network topology changes and vehicle dynamics.

Training a Graph Neural Network to solve URLLC and eMBB coexisting in 5G networks

Coexistence of enhanced mobile broadband and ultra-reliable low latency communication in 5G networks is a challenging problem due to the conflicting requirements. In this paper, we decompose the problem into eMBB and URLLC resource allocation phases. For the first phase we propose a heuristic algorithm with O(n) runtime and prove its efficiency and optimality under min–max fairness paradigm. For the URLLC resource allocation, the puncturing framework is adopted and a novel approach using the Graph Neural Networks is proposed to maximize eMBB data rates and fairness while minimizing URLLC outage probability. We show that the runtime of this GNN-based algorithm is also O(n). To train the GNN, an application-specific loss function is designed and empirically shown to be convergent. Our simulation results show that our proposed approach performs very well in terms of eMBB data rates, fairness, and URLLC outage probability in comparison to a number of thoughtfully chosen baselines. We also demonstrate that the proposed GNN is robust to changes in network topology and traffic volume. As we show our algorithm has O(n) runtime, it is fully practical for solving the resource allocation problem in the very short time spans that are required by 5G and future generation networks.

Interaction Effects of Vegetation and Soil Factors on Microbial Communities in Alpine Steppe Under Degradation

To clarify the regulating effect of vegetation and soil factors on microbial communities in the alpine steppe under degradation on the Qinghai-Xizang Plateau, the alpine steppe in the Sanjiangyuan area of the Qinghai-Tibet Plateau was chosen. We analyzed the differences in vegetation and soil factors in different stages of degradation （non-degradation, moderate degradation, and severe degradation） and detected the variations in microbial community characteristics in the alpine steppe under different degradation stages using high-throughput sequencing technology. Eventually, redundancy analysis （RDA） and multiple regression matrixes （MRM） based on the similarity or dissimilarity matrix were used to identify key environmental factors regulating microbial （bacterial and fungal） community changes under degradation. The results showed that the degradation of the alpine steppe significantly changed the community coverage, height, biomass, and important value of graminae； significantly reduced the contents of soil organic matter, total nitrogen, total phosphorus, and silt； and increased the soil bulk density and sand content. Degradation did not change the composition of bacteria and fungi, but their composition proportions changed and also resulted in the loss of microbial richness （Chao1 index and Richness index） but did not significantly change the microbial diversity （Shannon index）. With the occurrence of degradation, the vegetation characteristics, soil physicochemical properties, and microbial diversity showed a consistent change trend. Combined with the characteristics of the network topology changes （the number of nodes and clustering coefficient significantly decreased）, it was found that degradation of the alpine steppe led to the decline of interspecies interactions, decentralization of network, and homogenization of microorganisms, but the cooperation relations among the species were maintained （positive correlation connections accounted for more than 90% in all degradation stages）. Under the alpine steppe degradation, the vegetation-soil interaction had the greatest effect on soil bacterial community, whereas soil physicochemical properties had the greatest influence on soil fungal community. Specifically, vegetation community height, biomass, and soil bulk density were the mutual factors regulating soil microorganisms, whereas the vegetation Simpson index, important value of graminae, soil total phosphorus, total potassium, and silt content were the unique factors affecting the soil bacterial community, and soil pH and total nitrogen content were the particular factors affecting the soil fungal community.

A Secure Data Aggregation Algorithm Based on a Trust Mechanism.

Due to the uniqueness of the underwater environment, traditional data aggregation schemes face many challenges. Most existing data aggregation solutions do not fully consider node trustworthiness, which may result in the inclusion of falsified data sent by malicious nodes during the aggregation process, thereby affecting the accuracy of the aggregated results. Additionally, because of the dynamically changing nature of the underwater environment, current solutions often lack sufficient flexibility to handle situations such as node movement and network topology changes, significantly impacting the stability and reliability of data transmission. To address the aforementioned issues, this paper proposes a secure data aggregation algorithm based on a trust mechanism. By dynamically adjusting the number and size of node slices based on node trust values and transmission distances, the proposed algorithm effectively reduces network communication overhead and improves the accuracy of data aggregation. Due to the variability in the number of node slices, even if attackers intercept some slices, it is difficult for them to reconstruct the complete data, thereby ensuring data security.

A reliable cluster-based opportunistic routing protocol for underwater wireless sensor networks

Underwater Acoustic Sensor Networks (UASNs) have gained significant popularity and application in various marine engineering exploration scenarios, driven by the global evolution of the ocean ecosystem. However, UASNs face numerous challenges arising from the unique characteristics of the underwater environment and acoustic channels, such as limited energy resources, unreliable communication, and dynamic network topology in uncertain environments, all of which impact the network lifetime and transmission reliability. To address these challenges and enable efficient underwater data packet transmissions, this paper proposes a reliable cluster-based routing method called RCRP. The RCRP organizes sensor nodes into clusters, where cluster heads transmit the fused data to the sink node through multi-hop forwarding. To overcome routing voids caused by node failures during packet transmission, a prediction model based on the Markov chain is introduced to identify void nodes and inform neighboring nodes about the routing holes. Furthermore, a connection prediction mechanism is developed to tackle changes in the uncertain network topology, taking into account node mobility and the received SNR. For packet transmissions, a waiting mechanism inspired by the opportunistic routing (OR) paradigm is proposed, which determines the optimal forwarding route based on the calculated probability of successful connection between nodes. Simulation results demonstrate that RCRP outperforms existing routing protocols in terms of packet delivery ratio, surviving time, and energy consumption, highlighting its effectiveness in enhancing the performance of UASNs.