Next Article in Journal
A Comparative Study on Machine Learning Methods for EEG-Based Human Emotion Recognition
Next Article in Special Issue
Automated Generation of Test Scenarios for Autonomous Driving Using LLMs
Previous Article in Journal
An Efficient Malware Detection Method Using a Hybrid ResNet-Transformer Network and IGOA-Based Wrapper Feature Selection
Previous Article in Special Issue
Research on Autonomous Vehicle Lane-Keeping and Navigation System Based on Deep Reinforcement Learning: From Simulation to Real-World Application
 
 
Font Type:
Arial Georgia Verdana
Font Size:
Aa Aa Aa
Line Spacing:
Column Width:
Background:
Article

Estimation of Ship-to-Ship Link Persistence in Maritime Autonomous Surface Ship Communication Scenarios

School of Information Science and Technology, Dalian Maritime University, Dalian 116026, China
*
Author to whom correspondence should be addressed.
Electronics 2025, 14(14), 2742; https://doi.org/10.3390/electronics14142742
Submission received: 13 May 2025 / Revised: 4 July 2025 / Accepted: 7 July 2025 / Published: 8 July 2025
(This article belongs to the Special Issue Autonomous and Connected Vehicles)

Abstract

Maritime Autonomous Surface Ships (MASSs) are expected to become vital participants in future maritime commerce and ocean development activities. This paper investigates a channel capacity-based scheme for estimating the persistence of ship-to-ship communication links in MASS communication scenarios. Specifically, this study presents a relative motion model for nodes within the network and estimates link persistence based on the dynamic characteristics of the links. Additionally, transmission modes tailored to maritime communication scenarios are proposed to optimize link capacity and reduce interference. Simulation results demonstrate that the proposed method can accurately estimate the duration and capacity of the links, thereby achieving higher network capacity. When used as a metric for routing protocols, the proposed link-persistence measure outperforms traditional metrics in terms of packet loss ratio, end-to-end delay, and throughput. Comparisons with other mobility models show that the proposed mobility model offers greater accuracy and reliability in describing the relative mobility of nodes.

1. Introduction

The growth in Maritime Autonomous Surface Ship (MASS) technologies and their journey towards commercialization have drawn global attention, with both showing robust upward trends [1]. The plans of the International Maritime Organization (IMO) to roll out the non-mandatory MASS CODE in 2025, coupled with accelerated research, development, and onboard trials in major maritime nations, signals a bright future for MASS technologies in maritime applications [2]. Among the many enabling technologies, communication stands out. It underpins remote ship control and autonomous navigation, covers data transfer and ship monitoring, and enables interaction between ships and shore-based systems.
At present, MASS communication scenarios are fraught with many challenges. Node mobility, link persistence, and routing adaptability are the most prominent of these issues, which also interact with each other [3,4]. The dynamic nature of nodes in a mobile communication network determines the network’s topology and fluctuations, thereby directly affecting link persistence. Poor link persistence can directly lead to link disruption. When a link within a path fails, the network must repair the path by finding an alternative link or establishing a completely new path. These re-routing operations consume precious radio resources, and re-routing delays may affect service quality and overall network performance. Therefore, evaluating communication link persistence directly impacts the quality of ship-to-ship communication services and is crucial for ensuring the continuity, stability, and efficiency of maritime communication services. In the resource-constrained MASS communication scenario, link persistence is the key indicator for selecting the optimal communication path. An accurate node mobility model is an essential prerequisite for the estimation of link persistence.
In the field of mobility modeling, as early as 1926, Einstein proposed the concept of Random Walk Mobility (RWM) to simulate Brownian motion [5]. Subsequently, researchers developed a series of simple and easy-to-implement mobility models, including random waypoint models and random direction models, based on this concept [6,7]. These models have been widely used, and they have become the most commonly used default mobility models in various network simulation platforms due to their simplicity and ease of theoretical analysis. However, such models do not take relative motion between nodes into consideration. In mobile ad hoc networks, the relative speeds and directions of nodes significantly affect link persistence. When two nodes move in opposite directions or at a high relative speed, link persistence tends to be poor. Therefore, to achieve a more accurate estimation of link persistence, it is crucial to design a mobility model that incorporates the relative motion between nodes, thereby better capturing their relative movement trends.
Regarding communication link states, researchers have also conducted extensive and in-depth studies. In [8], the characteristics of wireless links at sea and the factors influencing communication are examined through data obtained from sea-testing experiments conducted on multiple fishing vessels. In [9], the authors define transmission reliability to measure the transmission performance of mobile ad hoc networks, considering the impact of interference and utilizing genetic algorithms for optimization. In [10], a Bayesian tracking algorithm is proposed to predict the duration of links by learning the environment and predicting node motion parameters. In [11], the authors present a link availability analysis of two cities in India under fog weather conditions, and propose a novel model to calculate the link availability. The authors of [12] present random graph analysis that allows for advanced link models in which the probability of link failure decreases with increasing distance between nodes, helping to determine the network availability of planned mesh networks as a function of the number of redundant nodes. Studies like the aforementioned have involved in-depth research on the characteristics of wireless links, but researchers have not adequately considered the dynamic changes in network topology caused by node mobility, especially in networks with continuous topology changes. Generally, for networks with continuously moving nodes, network topologies of more than two hops are not applicable. This is because longer and more-complex routing paths in such networks make them vulnerable to changes in topology. These changes impair link connectivity and validity, forcing routing protocols to perform route discoveries, updates, and maintenance operations. Consequently, this not only drastically increases routing overhead and communication latency but also significantly degrades overall network performance and efficiency. The authors of [13] propose a link persistence estimation method which can effectively quantify link reliability and provide a basis for path selection. In another study [14], the link quality metric is improved to better reflect the quality of links, and the contribution of the improved metric in enhancing network performance is discussed. The authors of [15] propose the Outlier Bounded Exponential Weighted Moving Average as a metric for reliability-constrained routing. Although the above studies all provide solutions for link state evaluation, the node mobility models they are based on are not accurate enough. The nodes’ speed and direction are fixed and unchanging, which limits the applicability of these methods.
In the field of routing research, the authors of [16] propose a routing metric based on evolution, generated automatically using genetic programming, which incorporates traffic-related features and mobility for adaptive routing in Mobile Ad Hoc Networks. The authors of [17] propose a path selection method based on the Hierarchical Manta Ray Foraging Optimization Algorithm, which employs a bio-inspired optimization mechanism to balance the Quality of Service (QoS) metrics and ultimately output the optimal routing path. The authors of [18] propose a hybrid optimization methodology that involves construction of a dual-constraint dynamic clustering model based on mobility metrics and hop count, which selects cluster heads by comprehensively considering fuzzy parameters such as node mobility speed and neighbor density, and finally executes routing through a hybrid cellular automaton approach. The authors of [19] propose an enhanced resilient routing protocol based on traditional routing mechanisms, leveraging blockchain to store node QoS information and employing a Deep Neural Network to select optimal routing nodes. However, the abovementioned studies primarily focus on procedural aspects of routing discovery and maintenance, typically prioritizing the shortest path with the fewest hops or links traversed. As yet, there has not been sufficient emphasis on adequately assessing link persistence as a routing metric to accurately reflect routing reliability. Addressing this challenge is crucial for enhancing the robustness and efficiency of routing in MASS communication scenarios. The authors of [20] propose a design for a routing metric suitable for Flying Ad Hoc Networks, which can effectively control overhead, improve network lifetime, and enhance search success rate. The authors of [21] propose a hybrid interpretable model for land traffic congestion estimation and prediction, which can assist in making rerouting decisions. Although the proposals in the abovementioned papers exhibit differences from maritime communication networks with respect to physical layers and link layers, the methodologies adopted can still provide insights for related work.
Motivated by the above discussions, in this paper we study link persistence estimation based on channel capacity, and propose routing metrics for MASS communication scenarios. This study focuses on MASS communication scenarios in civilian fields such as maritime search and rescue, emergency communications, and ocean environment monitoring. Figure 1 illustrates two typical application scenarios. In Scenario 1, the destination node and the source node cannot communicate directly; therefore, the MASS acts as a relay communication node. In Scenario 2, the MASS can assist Node A and Node B in expanding their dynamic search areas. The persistence of the communication links between the MASS and Nodes A and B directly affects the efficiency of the rescue.
Considering the high latency and resource overhead associated with multi-hop topologies (as analyzed previously), this paper examines communication links within two hops. To the best of the authors’ knowledge, this study represents the first comprehensive investigation into the integration of node mobility models, link persistence estimation, and routing metrics within the context of MASS communication scenarios. In the proposed architecture, the node mobility model serves as the foundation, and the link persistence is the result. Based on a quantified metric of link persistence, we develop a routing metric for path selection to enhance routing performance. The primary contributions of this work may be summarized as follows:
  • We propose a joint mobility model to address the limitations of existing mobility models which neglect the mutual movement of nodes within the network. The mobility model can characterize the mutual distance between two nodes within a given time period, thereby enabling more accurate descriptions of nodes’ movements in MASS communication scenarios.
  • Considering the characteristics of maritime communication and the mobility traits of nodes, we propose a link persistence estimation method as well as channel capacity-based objective functions for different transmission modes, which can better describe the dynamic properties of links.
  • We compare routing performance under link persistence, shortest path, and first found path. Simulation results demonstrate that routing based on the proposed link persistence metric demonstrates superior performance in packet loss ratio, end-to-end delay and throughput compared to routing based on the other two metrics.
The remaining parts of this paper are structured as follows: Section 2 provides an in-depth description of the node mobility model. Section 3 introduces the link persistence analysis model based on the mobility model. The objective function for link persistence based on channel capacity under different transmission modes is provided in Section 4. Section 5 presents and analyzes the simulation results. Section 6 concludes the article and discusses future research directions.

2. Node Mobility Model

Predicting the next-stage motion state of nodes based on historical data involves numerous challenges, such as instantaneous disturbances from ocean waves and abrupt shifts in long-term trends. Nevertheless, link estimation necessitates that node motion adheres to certain patterns rather than being entirely random. In the context of MASS communication scenarios, ships and vessels can acquire positions through various devices, such as the Global Navigation Satellite System, enabling effective prediction of network topology based on node movement patterns [22]. Because one of the most distinctive characteristics of wide-area maritime communication compared to terrestrial communication is sparsity, which means that the probability of a ship appearing per unit time and per unit area in the vast expanse of the ocean is relatively low, and because the traffic of ships at sea is relatively stable, this paper employs the Poisson Distribution to describe the distribution of maritime communication nodes [23,24]. Consequently, the breakdown of communication links also occurs independently.
The term R is used to denote the maximum radius of radio coverage for a mobile node. When one node falls within the transmission range of the other node, a two-way link is established between them. It should be noted that one-way communication is not taken into account. Within a given time interval, each node moves linearly at a constant speed and in a constant direction until the beginning of the next time interval. These time intervals are of equal length and are independently distributed, with a mean value of 1 / λ . At the start of each time interval, the speed and direction of the node’s movement are randomly and independently altered. As the speed is influenced by factors such as waves, winds, ship performance, and loading conditions, when there are numerous influencing factors and a sufficient number of ships, the speed distribution approximates a Gaussian distribution, according to the Central Limit Theorem. Gaussian distribution with a mean of μ and a variance of σ 2 is employed to describe the speed distribution of nodes over the entire time period. The direction distribution is uniformly distributed over 0 ,   2 π with a fluctuation range of less than π / 2 . On an abstracted two-dimensional plane, the starting positions and destinations of the mobile nodes are random. Let s I and s ( t ) denote the displacement vector of the node in epoch i and the total time t , respectively, s t = i = 1 N ( t ) s i . Here, N t denotes the number of epochs simulated within time t . The magnitude equals the distance from X t 0 ,   Y t 0 to X t 0 + t ,   Y t 0 + t which can be resolved into displacement components in the X and Y directions. As the direction is uniformly distributed, the displacement components in the X and Y directions are symmetric and independent. By the Central Limit Theorem, when the direction is random, the displacement components in the X and Y directions approximate zero-mean Gaussian distributions with identical variances. Consequently, the magnitude conforms to a Rayleigh distribution with parameters of α = 2 t λ × μ 2 + σ 2 . Therefore, the mobility characteristics of the node can be described by the parameter set λ ,   μ ,   σ 2 . Given that x ( t ) and y ( t ) are uncorrelated, the joint probability density of the node is as follows:
f x , y x , y = 1 π α exp x 2 + y 2 α .
Assume nodes M and N move according to mobility parameters λ M ,   μ M ,   σ M 2 and λ N ,   μ N ,   σ N 2 , respectively. As the movements of the two nodes are independent and uniform, the joint motion distribution is investigated by considering node N as stationary and the movement of node N as the opposite movement of node M. In Figure 2, after time t , nodes M and N reach positions M′ and N′, respectively, and the distance between them is denoted as D . Figure 3 is equivalent to Figure 2, where the random mobility vector of node M relative to node N is derived by fixing node N. This is represented as s M ,   N t = s M t s N t , and its amplitude approximately follows a Rayleigh distribution with parameter α M ,   N = α M + α N .
α M ,   N =   ( 2 t λ M ) ( μ M 2 + σ M 2 ) + ( 2 t λ N ) ( μ N 2 + σ N 2 ) .

3. Link Persistence Analysis

The failure of any link within a path results in the failure of the entire path. Hence, the stability of a path is contingent upon the stability of all the links that constitute it [25]. In periods of non-breakage, the optimal path is characterized by maximal capacity and minimal interference. Therefore, an analysis of link persistence and interference is essential for enhancing network reliability, and an objective function is necessary to quantify topology performance.
In this model, link persistence is defined as the probability that an active link exists between two mobile nodes at the time t 0 + t , provided that this link was available at the time t 0 [13]. To illustrate the link connectivity between two nodes over a given time span, it is essential to analyze the motion distribution of individual initially. Subsequently, the connection probability of a node is calculated by considering the magnitude and direction of one moving node relative to another, which represents the impact of motion on link persistence.
At time t , the relationship between the distance separating two nodes and link persistence is established. The distance D M ,   N t is the result of the sum of the random mobility vector s ( t ) and the constant vector c , as illustrated in Figure 4. The solution corresponds exactly to the general problem of determining the sum of a Rayleigh-distributed vector and a constant. By decomposing s ( t ) into its X and Y components from the Gaussian distribution and adding these to the x c and y c components of the initial distance, the link persistence distance probability distribution function is obtained:
f D M ,   N , θ D d , θ = f x , y x , y cos θ d sin θ sin θ d cos θ = d π α M ,   N exp ( d cos θ x c ) 2   + ( d sin θ y c ) 2 α M ,   N = d π α M ,   N exp d 2 + C 2 2 d ( x c cos θ + y c sin θ ) α M ,   N ,
where C 2 = x c 2 + y c 2 .
When node N reaches the edge of node M’s communication range, the angle between line M′N′ and the X-axis can be determined using the law of cosines, resulting in an angle of
θ D   =   θ Z   +   θ Z ,   D =   θ Z + arcsin C R sin θ Z   + 180 °   θ c .
The link persistence A M ,   N corresponds to the probability P M ,   N that D M ,   N t 0     R , and remains D M ,   N ( t 0 + t )     R , which can be calculated by integrating the probability distribution function of distance. The probability distribution function of distance is shown in Equation (3). Hence, the link persistence is expressed as follows:
A M ,   N   =   P M ,   N   D M ,   N ( t 0 + t )     R   |   D M ,   N t 0     R = 0 R 0 2 π f D M ,   N , θ D d , θ d θ dd = d π α M ,   N 0 R 0 2 π exp d 2 + C 2 + 2 d C cos θ C   +   cos θ   + C sin θ C sin θ α M ,   N d θ dd ,
where the distance D M ,   N ( t )     0 . The link persistence reaches its maximum value when R reaches to infinite.

4. Objective Function Under Different Transmission Modes

The transmission mode is one of the primary factors influencing outage capacity and interference. The objective function is designed to represent the network capacity during connection. During transmission, signals attenuate from one terminal to another, limiting direct communication between terminals to nearby ones. If terminals are distant from each other, intermediate terminals are needed to relay information until the message reaches the destination terminal. This paper considers two transmission modes: direct transmission and two-hop transmission.

4.1. Direct Transmission

According to the initial positions depicted in Figure 4, the initial positions of the nodes determine whether the source S and destination D are adjacent. Specifically, when the distance between S and D is less than the effective communication radius R, the nodes are deemed adjacent. Here, the source S is centrally located within the circle. For normal point-to-point direct transmission, the destination D must lie within the effective communication radius of the source S. In wireless communication, signal attenuation occurs during transmission. The received signal power P r can be denoted as P r =   P t   ×   d λ , where P t represents the transmitted power from the antenna, d represents the distance between nodes, and λ is the path loss exponent. The Signal-to-Noise Ratio (SNR) of the received signal is calculated as
γ S ,   D t = P t   ×   d S ,   D α t N 0 .
The outage capacity is employed to characterize the link rate, representing the achievable link capacity under a specified low outage probability ε . For direct transmission, the outage capacity is given by
C DT ε t = B log 2 1 + 1.5 ε   ×   γ S ,   D ( t ) 0.2 ε .
To guarantee the transmission quality, the interference along the transmission path should account for the cumulative effect of all nodes involved in the transmission process. Specifically, in the case of direct transmission between two nodes, the interfering nodes comprise those encompassed by both the source and destination nodes, so that
I DT   = I ( S )     I ( D ) .
Node mobility introduces variability into their motion states, impacting link connectivity and system stability, and thereby influencing network capacity. The relative motion speed between the source and terminal nodes, denoted as V S ,   D , can be represented as the effective value resulting from the sum of the randomly moving velocity vectors V S and V D . As the destination node D approaches the communication range boundary of the source node S, the relative motion distance between nodes, governed by the law of cosines, becomes
Z = R   ×   sin 180 °   θ Z 180 °   θ C θ Z ,   D sin θ Z + 180 °   θ C ,
and the theoretical communication time is T S ,   D = Z S ,   D V S ,   D . The link persistence can then be extrapolated along the path. Given the nonlinear nature of link connectivity in MASS communication scenarios, individual links operate independently. Therefore, when a route is on the verge of failure, alternative routes should be preemptively selected based on link persistence. The estimated communication time that takes into account the possibility of link disruption can then be denoted as follows:
T P = T S ,   D   ×   A S ,   D ( t ) .
As described above, link persistence, rate, and interference constitute the three primary factors determining network capacity. To optimize network capacity during communication, it is essential to enhance link persistence and rate while minimizing interference. The traffic exchanged between nodes during communication time can be derived by integrating the outage capacity. Consequently, the derived objective function is
g DT t = 0 T S ,   D × A DT ( t ) C DT ε ( t ) I DT dt .

4.2. Two-Hop Transmission

The two-hop transmission scheme improves link quality by replacing long-distance direct transmission with two sequential phases. This process requires two time slots. In the first time slot, the source transmits data to the relay. The relay then forwards the data to the destination in the second time slot. The received SNRs for the two time slots are denoted, respectively, as γ S ,   R t = P t   ×   d S ,   R α ( t ) N 0 and γ R ,   D t = P t   ×   d R ,   D α ( t ) N 0 . The maximum achievable instantaneous mutual information for the link is determined using the following equation:
C MT ε t = min C S ,   R ,   C R ,   D = min B log 2 1 + 1.5 ε   ×   γ S ,   R ( t ) 0.2 ε ,   B log 2 1.5 ε   ×   γ R ,   D ( t ) 0.2 ε .
The protocol interference model mandates that all nodes within the transmitter’s coverage area remain silent during ongoing transmissions. This defines the interference region of a communication link as the union of active nodes within the transmission range. Each transmission phase generates distinct interference patterns. Because the two hops operate in orthogonal time slots, their interference regions are defined as I S ,   R   = I ( S )     I ( R ) and I R ,   D = I ( R )     I ( D ) , respectively. As the two phases are temporally separated, the effective interference for the complete two-hop transmission is governed by the maximum interference region:
I MT = max ( I S ,   R ,   I R ,   D ) .
Figure 5 illustrates the mobility relationships. In the figure, V S ,   R represents the relative velocity between source and relay, and V R ,   D denotes the relay-destination relative velocity. The link lifetimes are T S ,   R = Z S ,   R V S ,   R and T R ,   D = Z R ,   D V R ,   D . The persistence of a link can be extrapolated to the path, as the persistence of the path is contingent upon the persistence of links from the source to the relay and from the relay to the destination. Communication can only occur when both links are simultaneously maintained. If either link is disconnected, the entire path fails. Therefore, the anticipated communication time along the path is limited by the shorter-lasting of the two links, denoted as
T p = min T S ,   R   ×   A S ,   R t ,   T R ,   D   ×   A R ,   D ( t ) .
Therefore, the objective function is
g MT t = 0 T P C MT ε t I MT dt .
The system selects the suitable transmission mode and relay node while minimizing interference to optimize link capacity. Therefore, the overall objective function for the path is as follows:
g i = max g DT ,   g MT i .
Given the relay candidate set r S ,   D = 1 ,   2 ,   ,   m residing within the coverage range of both source and destination, the objective function for each relay node can be computed. By selecting the relay node with the maximum value, the transmission mode and relay node that optimize network capacity can be determined. Because the objective function is divided into several independent sub-targets, parallel computing can expedite the computation process.
i = arg max i ν i g MT i ,   for   all   i r S ,   D .
The selection process of the transmission mode and the relay node is illustrated in Figure 6.

5. Simulation Results

This section presents simulations that evaluate dynamic topology characteristics and compare different routing metrics. Wireless channels adhere to the Rayleigh distribution of slow fading, with focus solely on the impact of network topology on capacity. In the simulation scenario, 30 nodes are randomly dispersed across a 1000 × 1000 area. It should be noted that the simulations in this section are intended to evaluate link quality, and no physically meaningful units, such as m or m/s, are set for distance or speed. Nodes follow the proposed mobility model, generating velocities for their subsequent movements randomly. Figure 7a illustrates the initial positions of each node, while Figure 7b illustrates the positions at time 100 s. The x-axis and y-axis represent the coordinate positions of the nodes within the two-dimensional area (units are not defined).
Figure 8 illustrates a comparison of the proposed method with conventional direct transmission in terms of topological performance under different coverage radii. The x-axis represents the size of the coverage radius, while the y-axis indicates the channel capacity performance. Statistical validation was carried out through 5000 Monte Carlo trials for each parameter configuration. The maximum speed is set to 1, and the path loss exponent is configured to 3.5. As can be seen from Figure 8, when the coverage radius is small, the opportunities for nodes in the network to establish communication links are limited, and the number of communicable adjacent nodes is restricted, resulting in poor network performance. As the coverage radius gradually increases, the channel capacity performance significantly improves. This is because more nodes can enter each other’s communication range, increasing the number of links and thereby enhancing overall network performance. However, as the coverage radius continues to increase further, the performance begins to deteriorate. This is because, as the number of links increases, interference also significantly rises. Under a large coverage radius, each node may experience signal interference from multiple other nodes, leading to a decline in network performance. Furthermore, it can be observed from the figure that the proposed method outperforms conventional direct transmission under almost all coverage radii. This optimization is attributed to the joint design of the transmission mode and link persistence estimation. In this experimental scenario, both methods achieve optimal performance when the coverage radius is 100, but the proposed method’s performance is improved by 17% compared to direct transmission. This result indicates that there may exist an optimal coverage radius for such communication scenarios, where the number of links and interference are balanced. At this radius, each node can establish communication links with a sufficient number of other nodes, ensuring the existence of multiple available paths in the network while keeping the interference within an acceptable range, thus guaranteeing high channel capacity.
Figure 9 shows the comparison curves between the estimated results and theoretical values of link persistence under simulation conditions of 30 nodes, communication radius R = 100, and path loss exponent α = 3.5. The horizontal axis represents the maximum node mobility speed Vmax, while the vertical axis indicates the channel capacity performance. The green line represents the estimated results, and the purple line represents the theoretical results. As can be seen from the figure, although there are deviations between the estimated and theoretical values due to the randomness of node mobility, their trends of change are highly consistent. This indicates that the proposed estimation method can capture the fundamental dynamic behavior of link persistence. Additionally, when the speed is relatively low, the deviation between the predicted and theoretical values is small. With increased speed, this deviation gradually increases. This is because, in the simulations, nodes are confined within a given space, and the higher the node speed, the more susceptible the link is to disruption. In addition, although a lower level of node activity results in greater accuracy in link estimation, the proposed method can fully reflect the dynamic characteristics of the network topology during rapid changes even when node activity is high.
Figure 10 further introduces different interruption probabilities for comparison based on Figure 8. It can be seen in the figure that when communication radii are the same, the channel capacity corresponding to a high interruption probability is always higher than that of a low interruption probability. This indicates that allowing a higher interruption probability can enhance the network performance. This is because under the scenario of interruption probability, the constraint on link reliability can be relaxed in exchange for higher capacity. For the high interruption probability, the channel capacity reaches its peak when the communication radius is around 110, and then decreases; the peak of the interruption probability occurs when the communication radius is around 80. This is because when the interruption probability is higher, the system can accept more link interruptions and thus chooses a longer transmission distance (increased radius). There is a positive correlation between interruption probability and the optimal radius. Table 1 lists the optimal coverage radii under different combinations of interruption probability and path loss exponent. It can be observed from the table that when the path loss exponent increases from 2.5 to 4, the optimal radius corresponding to the same interruption probability decreases significantly.
In the following section, we present simulations illustrating performance variations observed with the Dynamic Source Routing (DSR) protocol, utilizing the routing metric described above alongside classic routing metrics. In this setup, the source node transmits data packets at a fixed packet rate. The following routing metrics are employed:
  • Link persistence: as discussed above.
  • Shortest path: the path with the minimum number of hops is chosen.
  • First found path: the path carried by the initial routing reply packet received by the source node is chosen.
Table 2 compares the three routing metrics (link persistence, shortest path, and first found path) in terms of network performance. The performance metrics include packet loss ratio, end-to-end delay, and throughput. It can be seen that link persistence outperforms the other two metrics in packet loss ratio, end-to-end delay, and throughput. This indicates that link persistence can better balance link stability and efficiency during path selection, thereby enhancing overall network performance. However, it is crucial to note that the delay measurement only encompasses received packets, leading to shorter delays as the packet loss ratio reaches certain thresholds. This occurs because the routing protocol discards buffered packets that have surpassed a specific threshold. In instances where a path becomes unavailable, rerouting can significantly contribute to queuing delay, leading to the dropping of more packets and the experiencing of prolonged delays.
In general, the reliability of a path tends to decrease as the number of hops or links it traverses increases. Consequently, link persistence emerges as superior to other routing metrics in terms of path reliability. The demonstrated performance indicates that the proposed link persistence estimation can effectively assist routing protocols in selecting more reliable paths.
Finally, we present a comparison between the mobility model proposed in this paper, the mobility model outlined in [7], and a mobility model derived from actual vessel trajectories. Because of disparities in simulation experiment configurations, we were unable to directly correlate our findings with those of [7]. Therefore, we replicated their methodologies and assessed them within the same simulation environment. Employing the DSR protocol and adopting the routing metric proposed in this paper—link persistence—we were able to synthesize the results which are shown in Table 3.
The results in Table 3 clearly demonstrate that the proposed mobility model more closely aligns with the performance of the mobility model derived from actual vessel trajectories than with the mobility model presented in [7]. This highlights the accuracy and reliability of the proposed mobility model in characterizing node mobility. An accurate mobility model is fundamental to the effectiveness of routing metrics. The proposed mobility model shows superior performance to the model in [7] in terms of packet loss ratio, end-to-end delay, and throughput. This indicates that the proposed model has a higher degree of accuracy and reliability in describing node mobility and predicting link persistence.

6. Conclusions

In MASS communication scenarios, the mobility of nodes results in dynamic changes in network topology. This paper proposes an outage capacity-based link persistence estimation scheme tailored for dynamic maritime environments. The scheme initially accounts for mutual node movement and predicts link persistence based on relative node distances. Subsequently, an objective function is formulated for maritime transmission modes to optimize channel capacity. Simulation results demonstrate the efficacy of the proposed method in accurately predicting link duration and capacity, thereby enabling higher network capacity compared to direct transmission. Moreover, an increase in interruption probability leads to further enhancements in topological performance. Using the proposed link persistence as a metric for routing protocol can result in better performance in terms of packet loss ratio, end-to-end delay and throughput, compared to traditional metrics. The proposed mobility model exhibits better accuracy and reliability in describing the mobility of nodes, compared with other mobility models. However, there are limitations arising from the scene assumptions and simulation settings used in this paper. Due to the absence of global information, we resorted to initial path interference. Future research endeavors could explore the utilization of machine learning algorithms for interference prediction, or create distributed cooperation mechanisms between network nodes. This would enable nodes to share local interference information, resulting in a more accurate estimation of link persistence. Future research should also focus on combining environmental perception technologies or probabilistic models to supplement the description of environmental factors and quantify the impact of environmental factors on link persistence. Finally, in our own future work, we will incorporate more parameters and constraints related to actual maritime communication, to better reflect real-world application scenarios.
This study strictly focuses on civilian MASS communication technologies, with all proposed models and algorithms designed solely to enhance public service capabilities. The research explicitly excludes any military applications, and fully complies with civilian standards, including the International Convention for the Safety of Life at Sea and the MASS Code.

Author Contributions

S.H.: Conceptualization, methodology, software, and writing—original draft preparation. X.D.: Software, writing—review and editing, validation, and investigation. Q.H.: Investigation and supervision. All authors have read and agreed to the published version of the manuscript.

Funding

This work was supported by the China Postdoctoral Science Foundation under Grant 2021M690504.

Data Availability Statement

The data can be shared up on request.

Conflicts of Interest

The authors declare no conflicts of interest.

References

  1. Kim, J.; Han, S.; Lee, H.; Koo, B.; Nam, M.; Jang, K.; Lee, J.; Chung, M. Trend Research on Maritime Autonomous Surface Ships (MASSs) Based on Shipboard Electronics: Focusing on Text Mining and Network Analysis. Electronics 2024, 13, 1902. [Google Scholar] [CrossRef]
  2. Roadmap for the development of a Code for Maritime Autonomous Surface Ships (MASS). In MSC 109; IMO: London, UK, 2024.
  3. Huai, S.; Liu, T.; Jiang, Y.; Dai, Y.; Xue, F.; Hu, Q. Link Availability-Aware Routing Metric Design for Maritime Mobile Ad Hoc Network. J. Mar. Sci. Eng. 2025, 13, 1184. [Google Scholar] [CrossRef]
  4. Hu, X.; Hu, K.; Tao, D.; Zhong, Y.; Han, Y. GIS-Data-Driven Efficient and Safe Path Planning for Autonomous Ships in Maritime Transportation. Electronics 2023, 12, 2206. [Google Scholar] [CrossRef]
  5. Al-Rahayfeh, A.; Razaque, A.; Jararweh, Y.; Almiani, M. Location-Based Lattice Mobility Model for Wireless Sensor Networks. Sensors 2018, 18, 4096. [Google Scholar] [CrossRef]
  6. Vijayalakshmi, P.; Selvi, K.; Gowsic, K. A Random Waypoint Model for Route Avoidance with Zone Routing Protocol in Wireless Sensor Network. Wirel. Pers. Commun. 2023, 128, 2619–2636. [Google Scholar] [CrossRef]
  7. Vijay, U.; Shyamrao, V. Role of Routing Protocol in Mobile Ad-Hoc Network for Performance of Mobility Models. In Proceedings of the 2023 IEEE 8th International Conference for Convergence in Technology, Lonavla, India, 7–9 April 2023; pp. 1–6. [Google Scholar]
  8. Surendran, S.; Ramesh, M.V.; Montresor, A.; Montag, M.J. Link Characterization and Edge-Centric Predictive Modeling in an Ocean Network. IEEE Access 2023, 11, 5031–5046. [Google Scholar] [CrossRef]
  9. Xiang, S.; Yang, J. Performance reliability evaluation for mobile ad hoc networks. Reliab. Eng. Syst. Saf. 2018, 169, 32–39. [Google Scholar] [CrossRef]
  10. Rahmani, P.; Haj Seyyed Javadi, H. Topology Control in MANETs Using the Bayesian Pursuit Algorithm. Wirel. Pers. Commun. 2019, 106, 1089–1116. [Google Scholar] [CrossRef]
  11. Ghalot, R.; Madhu, C.; Kaur, G.; Singh, P. Link Estimation of Different Indian Cities Under Fog Weather Conditions. Wirel. Pers. Commun. 2019, 105, 1215–1234. [Google Scholar] [CrossRef]
  12. Egeland, G.; Engelstad, P.E. The availability and reliability of wireless multi-hop networks with stochastic link failures. IEEE J. Sel. Areas Commun. 2009, 27, 1132–1146. [Google Scholar] [CrossRef]
  13. Shengming, J.; Dajiang, H.; Jianqiang, R. A prediction-based link availability estimation for routing metrics in MANETs. IEEE/ACM Trans. Netw. 2005, 13, 1302–1312. [Google Scholar] [CrossRef]
  14. Kim, S.; Lee, O.; Choi, S.; Lee, S. Comparative analysis of link quality metrics and routing protocols for optimal route construction in wireless mesh networks. Ad Hoc Netw. 2011, 9, 1343–1358. [Google Scholar] [CrossRef]
  15. Mathews, K.; Gotzhein, G. OB-EWMA: A Link Metric for Reliability-constrained Routing in Wireless Networks. In Proceedings of the 2021 IEEE Wireless Communications and Networking Conference (WCNC), Nanjing, China, 29 March–1 April 2021; pp. 1–7. [Google Scholar]
  16. Hasdemir, S.; Yilmaz, S.; Sen, S. A novel multi-featured metric for adaptive routing in mobile ad hoc networks. Appl. Intell. 2019, 49, 2823–2841. [Google Scholar] [CrossRef]
  17. Jeganathan, S.; Kulandaivelu, G.; Muthusamy, D.; Samraj, K.V. Trust-Aware Routing Protocol Using Hierarchical Manta Ray Foraging Optimization Algorithm with Selfish Node Detection in MANET. Int. J. Commun. Syst. 2025, 58, e70011. [Google Scholar] [CrossRef]
  18. Rajaram, A.; Baskar, A. Hybrid Optimization-Based Multi-Path Routing for Dynamic Cluster-Based MANET. Cybern. Syst. 2025, 56, 46–68. [Google Scholar]
  19. Baumgartner, M.; Papaj, J.; Kurkina, N.; Dobos, L.; Cizmar, A. Resilient enhancements of routing protocols in MANET. Peer—Peer Netw. Appl. 2024, 17, 3200–3221. [Google Scholar] [CrossRef]
  20. Usman, Q.; Chughtai, O.; Nawaz, N.; Kaleem, Z.; Khaliq, K.A.; Nguyen, L.D. A Reliable Link-Adaptive Position-Based Routing Protocol for Flying ad hoc Network. Mob. Netw. Appl. 2021, 26, 1801–1820. [Google Scholar] [CrossRef]
  21. Pan, Y.; Guo, J.; Chen, Y.; Cheng, Q.; Li, W.; Liu, Y. A fundamental diagram based hybrid framework for traffic flow estimation and prediction by combining a Markovian model with deep learning. Expert Syst. Appl. 2024, 238, 122219. [Google Scholar] [CrossRef]
  22. Zhang, H.; Zhang, H.; Liu, H.; Xu, G. Distributed Motion State Estimation of Mobile Target with Switching Topologies. Circuits Syst. Signal Process. 2020, 39, 2648–2672. [Google Scholar] [CrossRef]
  23. Wang, Y.; Zhou, Y.; Wang, J.; Huang, Y.; Yang, J. Wireless Channel Models for Maritime Communications. IEEE Access 2018, 6, 68070–68088. [Google Scholar] [CrossRef]
  24. Yi, X.; Lin, J.; Sun, J.; Jiang, P.; Jiang, D.; Jiang, G. Ship Distribution in Open Sea and Its Impact on Ocean Ambient Noise. Oceanol. Limnol. Sin. 2015, 46, 1270–1278. [Google Scholar]
  25. Dai, Y.; Lyu, L.; Cheng, N.; Sheng, M.; Liu, J.; Wang, X.; Cui, S.; Cai, L.; Shen, X. A Survey of Graph-Based Resource Management in Wireless Networks-Part I: Optimization Approaches. IEEE Trans. Cogn. Commun. Netw. 2024, 1. [Google Scholar] [CrossRef]
Figure 1. Application scenarios.
Figure 1. Application scenarios.
Electronics 14 02742 g001
Figure 2. Joint mobility transformation.
Figure 2. Joint mobility transformation.
Electronics 14 02742 g002
Figure 3. Single-node joint mobility transformation.
Figure 3. Single-node joint mobility transformation.
Electronics 14 02742 g003
Figure 4. Relationships among variables.
Figure 4. Relationships among variables.
Electronics 14 02742 g004
Figure 5. Two-hop transmission mode.
Figure 5. Two-hop transmission mode.
Electronics 14 02742 g005
Figure 6. Flowchart of selection.
Figure 6. Flowchart of selection.
Electronics 14 02742 g006
Figure 7. (a) Initial distribution of 30 nodes at t = 0 s; (b) distribution of 30 nodes after movement at t = 100 s.
Figure 7. (a) Initial distribution of 30 nodes at t = 0 s; (b) distribution of 30 nodes after movement at t = 100 s.
Electronics 14 02742 g007
Figure 8. Channel capacity performance.
Figure 8. Channel capacity performance.
Electronics 14 02742 g008
Figure 9. Comparison between predicted and theoretical values.
Figure 9. Comparison between predicted and theoretical values.
Electronics 14 02742 g009
Figure 10. Objective function versus interrupt probability.
Figure 10. Objective function versus interrupt probability.
Electronics 14 02742 g010
Table 1. Coverage radii for given (ɛ, α) pairs.
Table 1. Coverage radii for given (ɛ, α) pairs.
α = 2.5α = 3α = 3.5α = 4
ɛ = 10−41601337978
ɛ = 10−3199160113101
Table 2. Comparison of different metrics.
Table 2. Comparison of different metrics.
Packet Loss RatioEnd-to-End DelayThroughput
Link persistence0.645612.3818.98
Shortest path0.710525.6215.78
First found path0.656242.0316.47
Table 3. Comparison of different mobility models.
Table 3. Comparison of different mobility models.
Packet Loss RatioEnd-to-End DelayThroughput
Proposed model0.645612.3818.98
Model in [7]0.896445.3415.62
Actual vessel trajectories0.611616.8617.23
Disclaimer/Publisher’s Note: The statements, opinions and data contained in all publications are solely those of the individual author(s) and contributor(s) and not of MDPI and/or the editor(s). MDPI and/or the editor(s) disclaim responsibility for any injury to people or property resulting from any ideas, methods, instructions or products referred to in the content.

Share and Cite

MDPI and ACS Style

Huai, S.; Du, X.; Hu, Q. Estimation of Ship-to-Ship Link Persistence in Maritime Autonomous Surface Ship Communication Scenarios. Electronics 2025, 14, 2742. https://doi.org/10.3390/electronics14142742

AMA Style

Huai S, Du X, Hu Q. Estimation of Ship-to-Ship Link Persistence in Maritime Autonomous Surface Ship Communication Scenarios. Electronics. 2025; 14(14):2742. https://doi.org/10.3390/electronics14142742

Chicago/Turabian Style

Huai, Shuaiheng, Xiaoyu Du, and Qing Hu. 2025. "Estimation of Ship-to-Ship Link Persistence in Maritime Autonomous Surface Ship Communication Scenarios" Electronics 14, no. 14: 2742. https://doi.org/10.3390/electronics14142742

APA Style

Huai, S., Du, X., & Hu, Q. (2025). Estimation of Ship-to-Ship Link Persistence in Maritime Autonomous Surface Ship Communication Scenarios. Electronics, 14(14), 2742. https://doi.org/10.3390/electronics14142742

Note that from the first issue of 2016, this journal uses article numbers instead of page numbers. See further details here.

Article Metrics

Back to TopTop