A Time-Domain Numerical Simulation for Free Motion Responses of Two Ships Advancing in Head Waves

The constant panel method within the framework of potential flow theory in the time domain is developed for solving the hydrodynamic interactions between two parallel ships with forward speed.When solving problems within a time domain framework,the free water surface needs to simultaneously satisfy both the kinematic and dynamic boundary conditions of the free water surface.This provides conditions for adding artificial damping layers.Using the Runge−Kutta method to solve equations related to time.An upwind differential scheme is used in the present method to deal with the convection terms on the free surface to prevent waves upstream.Through the comparison with the available experimental data and other numerical methods,the present method is proved to have good mesh convergence,and satisfactory results can be obtained.The constant panel method is applied to calculate the hydrodynamic interaction responses of two parallel ships advancing in head waves.Numerical simulations are conducted on the effects of forward speed,different longitudinal and lateral distances on the motion response of two modified Wigley ships in head waves.Then further investigations are conducted on the effects of different ship types on the motion response.

Ship Weather Routing Based on Hybrid Genetic Algorithm Under Complicated Sea Conditions

Considering the effects of increased economic globalization and global warming,developing methods for reducing shipping costs and greenhouse gas emissions in ocean transportation has become crucial.Owing to its key role in modern navigation technology,ship weather routing is the research focus of several scholars in this field.This study presents a hybrid genetic algorithm for the design of an optimal ship route for safe transoceanic navigation under complicated sea conditions.On the basis of the basic genetic algorithm,simulated annealing algorithm is introduced to enhance its local search ability and avoid premature convergence,with the ship’s voyage time and fuel consumption as optimization goals.Then,a mathematical model of ship weather routing is developed based on the grid system.A measure of fitness calibration is proposed,which can change the selection pressure of the algorithm as the population evolves.In addition,a hybrid crossover operator is proposed to enhance the ability to find the optimal solution and accelerate the convergence speed of the algorithm.Finally,a multi-population technique is applied to improve the robustness of the algorithm using different evolutionary strategies.

Multi-Objective Weather Routing Algorithm for Ships Based on Hybrid Particle Swarm Optimization

Maritime transportation has become an important part of the international trade system.To promote its sustainable de-velopment,it is necessary to reduce the fuel consumption of ships,decrease navigation risks,and shorten the navigation time.Ac-cordingly,planning a multi-objective route for ships is an effective way to achieve these goals.In this paper,we propose a multi-ob-jective optimal ship weather routing system framework.Based on this framework,a ship route model,ship fuel consumption model,and navigation risk model are established,and a non-dominated sorting and multi-objective ship weather routing algorithm based on particle swarm optimization is proposed.To fasten the convergence of the algorithm and improve the diversity of route solutions,a mutation operation and an elite selection operation are introduced in the algorithm.Based on the Pareto optimal front and Pareto optimal solution set obtained by the algorithm,a recommended route selection criterion is designed.Finally,two sets of simulated navigation simulation experiments on a container ship are conducted.The experimental results show that the proposed multi-objective optimal weather routing system can be used to plan a ship route with low navigation risk,short navigation time,and low fuel consumption,fulfilling the safety,efficiency,and economic goals.

Multipoint Heave Motion Prediction Method for Ships Based on the PSO-TGCN Model

During ship operations,frequent heave movements can pose significant challenges to the overall safety of the ship and completion of cargo loading.The existing heave compensation systems suffer from issues such as dead zones and control system time lags,which necessitate the development of reasonable prediction models for ship heave movements.In this paper,a novel model based on a time graph convolutional neural network algorithm and particle swarm optimization algorithm(PSO-TGCN)is proposed for the first time to predict the multipoint heave movements of ships under different sea conditions.To enhance the dataset's suitability for training and reduce interference,various filter algorithms are employed to optimize the dataset.The training process utilizes simulated heave data under different sea conditions and measured heave data from multiple points.The results show that the PSO-TGCN model predicts the ship swaying motion in different sea states after 2 s with 84.7%accuracy,while predicting the swaying motion in three different positions.By performing a comparative study,it was also found that the present method achieves better performance that other popular methods.This model can provide technical support for intelligent ship control,improve the control accuracy of intelligent ships,and promote the development of intelligent ships.

Review on the Progress and Issues in Liquid Tank Sloshing of Ships

With the development of large liquid cargo ships,liquid tank sloshing has gradually become a hot research topic in the area of shipping and ocean Engineering.Liquid tank sloshing,characterized by strong nonlinearity and randomness,not only affects the stability of the ship but also generates a huge impact force on the wall of the tank.To further investigate liquid tank sloshing,a comprehensive review is given on the research process of the most focused subjects of liquid sloshing.Summarizing the existing research will help to identify issues in the current field and provide useful references.The methods for investigating sloshing,the research progress and the situations worldwide are discussed.The advantages and defects of experiments and numerical simulations are also explored.The problems which need to be explored in the future are subsequently proposed.

Deep Neural Network Based Detection and Segmentation of Ships for Maritime Surveillance

In recent years,computer visionfinds wide applications in maritime surveillance with its sophisticated algorithms and advanced architecture.Auto-matic ship detection with computer vision techniques provide an efficient means to monitor as well as track ships in water bodies.Waterways being an important medium of transport require continuous monitoring for protection of national security.The remote sensing satellite images of ships in harbours and water bodies are the image data that aid the neural network models to localize ships and to facilitate early identification of possible threats at sea.This paper proposes a deep learning based model capable enough to classify between ships and no-ships as well as to localize ships in the original images using bounding box tech-nique.Furthermore,classified ships are again segmented with deep learning based auto-encoder model.The proposed model,in terms of classification,provides suc-cessful results generating 99.5%and 99.2%validation and training accuracy respectively.The auto-encoder model also produces 85.1%and 84.2%validation and training accuracies.Moreover the IoU metric of the segmented images is found to be of 0.77 value.The experimental results reveal that the model is accu-rate and can be implemented for automatic ship detection in water bodies consid-ering remote sensing satellite images as input to the computer vision system.

MTCR-CR Routing Strategy for Connection-Oriented Routing over Satellite Networks

The high-speed movement of satellites makes it not feasible to directly apply the mature routing scheme on the ground to the satellite network.DT-DVTR in the snapshot-based connectionoriented routing strategy is one of the representative solutions,but it still has room for improvement in terms of routing stability.In this paper,we propose an improved scheme for connection-oriented routing strategy named the Minimal Topology Change Routing based on Collaborative Rules(MTCR-CR).The MTCR-CR uses continuous time static topology snapshots based on satellite status to search for intersatellite link(ISL)construction solutions that meet the minimum number of topology changes to avoid route oscillations.The simulation results in Beidou-3 show that compared with DT-DVTR,MTCR-CR reduces the number of routing changes by about 92%,the number of path changes caused by routing changes is about38%,and the rerouting time is reduced by approximately 47%.At the same time,in order to show our algorithm more comprehensively,the same experimental index test was also carried out on the Globalstar satellite constellation.

Efficient Route Planning for Real-Time Demand-Responsive Transit

Demand Responsive Transit (DRT) responds to the dynamic users’ requests without any fixed routes and timetablesand determines the stop and the start according to the demands. This study explores the optimization of dynamicvehicle scheduling and real-time route planning in urban public transportation systems, with a focus on busservices. It addresses the limitations of current shared mobility routing algorithms, which are primarily designedfor simpler, single origin/destination scenarios, and do not meet the complex demands of bus transit systems. Theresearch introduces an route planning algorithm designed to dynamically accommodate passenger travel needsand enable real-time route modifications. Unlike traditional methods, this algorithm leverages a queue-based,multi-objective heuristic A∗ approach, offering a solution to the inflexibility and limited coverage of suburbanbus routes. Also, this study conducts a comparative analysis of the proposed algorithm with solutions based onGenetic Algorithm (GA) and Ant Colony Optimization Algorithm (ACO), focusing on calculation time, routelength, passenger waiting time, boarding time, and detour rate. The findings demonstrate that the proposedalgorithmsignificantly enhances route planning speed, achieving an 80–100-fold increase in efficiency over existingmodels, thereby supporting the real-time demands of Demand-Responsive Transportation (DRT) systems. Thestudy concludes that this algorithm not only optimizes route planning in bus transit but also presents a scalablesolution for improving urban mobility.

CoopAI-Route: DRL Empowered Multi-Agent Cooperative System for Efficient QoS-Aware Routing for Network Slicing in Multi-Domain SDN

The emergence of beyond 5G networks has the potential for seamless and intelligent connectivity on a global scale.Network slicing is crucial in delivering services for different,demanding vertical applications in this context.Next-generation applications have time-sensitive requirements and depend on the most efficient routing path to ensure packets reach their intended destinations.However,the existing IP(Internet Protocol)over a multi-domain network faces challenges in enforcing network slicing due to minimal collaboration and information sharing among network operators.Conventional inter-domain routing methods,like Border Gateway Protocol(BGP),cannot make routing decisions based on performance,which frequently results in traffic flowing across congested paths that are never optimal.To address these issues,we propose CoopAI-Route,a multi-agent cooperative deep reinforcement learning(DRL)system utilizing hierarchical software-defined networks(SDN).This framework enforces network slicing in multi-domain networks and cooperative communication with various administrators to find performance-based routes in intra-and inter-domain.CoopAI-Route employs the Distributed Global Topology(DGT)algorithm to define inter-domain Quality of Service(QoS)paths.CoopAI-Route uses a DRL agent with a message-passing multi-agent Twin-Delayed Deep Deterministic Policy Gradient method to ensure optimal end-to-end routes adapted to the specific requirements of network slicing applications.Our evaluation demonstrates CoopAI-Route’s commendable performance in scalability,link failure handling,and adaptability to evolving topologies compared to state-of-the-art methods.

Dynamic Routing of Multiple QoS-Required Flows in Cloud-Edge Autonomous Multi-Domain Data Center Networks

The 6th generation mobile networks(6G)network is a kind of multi-network interconnection and multi-scenario coexistence network,where multiple network domains break the original fixed boundaries to form connections and convergence.In this paper,with the optimization objective of maximizing network utility while ensuring flows performance-centric weighted fairness,this paper designs a reinforcement learning-based cloud-edge autonomous multi-domain data center network architecture that achieves single-domain autonomy and multi-domain collaboration.Due to the conflict between the utility of different flows,the bandwidth fairness allocation problem for various types of flows is formulated by considering different defined reward functions.Regarding the tradeoff between fairness and utility,this paper deals with the corresponding reward functions for the cases where the flows undergo abrupt changes and smooth changes in the flows.In addition,to accommodate the Quality of Service(QoS)requirements for multiple types of flows,this paper proposes a multi-domain autonomous routing algorithm called LSTM+MADDPG.Introducing a Long Short-Term Memory(LSTM)layer in the actor and critic networks,more information about temporal continuity is added,further enhancing the adaptive ability changes in the dynamic network environment.The LSTM+MADDPG algorithm is compared with the latest reinforcement learning algorithm by conducting experiments on real network topology and traffic traces,and the experimental results show that LSTM+MADDPG improves the delay convergence speed by 14.6%and delays the start moment of packet loss by 18.2%compared with other algorithms.

Enhancing Network Design through Statistical Evaluation of MANET Routing Protocols

This paper contributes a sophisticated statistical method for the assessment of performance in routing protocols salient Mobile Ad Hoc Network(MANET)routing protocols:Destination Sequenced Distance Vector(DSDV),Ad hoc On-Demand Distance Vector(AODV),Dynamic Source Routing(DSR),and Zone Routing Protocol(ZRP).In this paper,the evaluation will be carried out using complete sets of statistical tests such as Kruskal-Wallis,Mann-Whitney,and Friedman.It articulates a systematic evaluation of how the performance of the previous protocols varies with the number of nodes and the mobility patterns.The study is premised upon the Quality of Service(QoS)metrics of throughput,packet delivery ratio,and end-to-end delay to gain an adequate understanding of the operational efficiency of each protocol under different network scenarios.The findings explained significant differences in the performance of different routing protocols;as a result,decisions for the selection and optimization of routing protocols can be taken effectively according to different network requirements.This paper is a step forward in the general understanding of the routing dynamics of MANETs and contributes significantly to the strategic deployment of robust and efficient network infrastructures.

Frequency-tunable single-photon router based on a microresonator containing a driven three-level emitter

We propose a frequency-tunable router of single photons with high routing efficiency, which is constructed by two waveguides mediately linked by a single-mode whispering gallery resonator with a driven three-level emitter. Quantum routing probability in the output port is obtained via the real-space Hamiltonian. By adjusting the resonator–emitter coupling and the drive, the desired continuous central frequencies for the resonance peaks of routing photons can be manipulated nearly linearly, with the assistance of Rabi splitting effect and optical Stark shift. The proposed routing system may provide potential applications in designing other frequency-modulation quantum optical devices, such as multiplexers,filters, and so on.

Unmanned Ship Identification Based on Improved YOLOv8s Algorithm

Aiming at defects such as low contrast in infrared ship images,uneven distribution of ship size,and lack of texture details,which will lead to unmanned ship leakage misdetection and slow detection,this paper proposes an infrared ship detection model based on the improved YOLOv8 algorithm(R_YOLO).The algorithm incorporates the Efficient Multi-Scale Attention mechanism(EMA),the efficient Reparameterized Generalized-feature extraction module(CSPStage),the small target detection header,the Repulsion Loss function,and the context aggregation block(CABlock),which are designed to improve the model’s ability to detect targets at multiple scales and the speed of model inference.The algorithm is validated in detail on two vessel datasets.The comprehensive experimental results demonstrate that,in the infrared dataset,the YOLOv8s algorithm exhibits improvements in various performance metrics.Specifically,compared to the baseline algorithm,there is a 3.1%increase in mean average precision at a threshold of 0.5(mAP(0.5)),a 5.4%increase in recall rate,and a 2.2%increase in mAP(0.5:0.95).Simultaneously,while less than 5 times parameters,the mAP(0.5)and frames per second(FPS)exhibit an increase of 1.7%and more than 3 times,respectively,compared to the CAA_YOLO algorithm.Finally,the evaluation indexes on the visible light data set have shown an average improvement of 4.5%.

QoS Routing Optimization Based on Deep Reinforcement Learning in SDN

To enhance the efficiency and expediency of issuing e-licenses within the power sector, we must confront thechallenge of managing the surging demand for data traffic. Within this realm, the network imposes stringentQuality of Service (QoS) requirements, revealing the inadequacies of traditional routing allocation mechanismsin accommodating such extensive data flows. In response to the imperative of handling a substantial influx of datarequests promptly and alleviating the constraints of existing technologies and network congestion, we present anarchitecture forQoS routing optimizationwith in SoftwareDefinedNetwork (SDN), leveraging deep reinforcementlearning. This innovative approach entails the separation of SDN control and transmission functionalities, centralizingcontrol over data forwardingwhile integrating deep reinforcement learning for informed routing decisions. Byfactoring in considerations such as delay, bandwidth, jitter rate, and packet loss rate, we design a reward function toguide theDeepDeterministic PolicyGradient (DDPG) algorithmin learning the optimal routing strategy to furnishsuperior QoS provision. In our empirical investigations, we juxtapose the performance of Deep ReinforcementLearning (DRL) against that of Shortest Path (SP) algorithms in terms of data packet transmission delay. Theexperimental simulation results show that our proposed algorithm has significant efficacy in reducing networkdelay and improving the overall transmission efficiency, which is superior to the traditional methods.

An SDN-Based Algorithm for Caching,Routing,and Load Balancing in ICN

One of the challenges of Informationcentric Networking(ICN)is finding the optimal location for caching content and processing users’requests.In this paper,we address this challenge by leveraging Software-defined Networking(SDN)for efficient ICN management.To achieve this,we formulate the problem as a mixed-integer nonlinear programming(MINLP)model,incorporating caching,routing,and load balancing decisions.We explore two distinct scenarios to tackle the problem.Firstly,we solve the problem in an offline mode using the GAMS environment,assuming a stable network state to demonstrate the superior performance of the cacheenabled network compared to non-cache networks.Subsequently,we investigate the problem in an online mode where the network state dynamically changes over time.Given the computational complexity associated with MINLP,we propose the software-defined caching,routing,and load balancing(SDCRL)algorithm as an efficient and scalable solution.Our evaluation demonstrates that the SDCRL algorithm significantly reduces computational time while maintaining results that closely resemble those achieved by GAMS.

Efficient Ship:A Hybrid Deep Learning Framework for Ship Detection in the River

Optical image-based ship detection can ensure the safety of ships and promote the orderly management of ships in offshore waters.Current deep learning researches on optical image-based ship detection mainly focus on improving one-stage detectors for real-time ship detection but sacrifices the accuracy of detection.To solve this problem,we present a hybrid ship detection framework which is named EfficientShip in this paper.The core parts of the EfficientShip are DLA-backboned object location(DBOL)and CascadeRCNN-guided object classification(CROC).The DBOL is responsible for finding potential ship objects,and the CROC is used to categorize the potential ship objects.We also design a pixel-spatial-level data augmentation(PSDA)to reduce the risk of detection model overfitting.We compare the proposed EfficientShip with state-of-the-art(SOTA)literature on a ship detection dataset called Seaships.Experiments show our ship detection framework achieves a result of 99.63%(mAP)at 45 fps,which is much better than 8 SOTA approaches on detection accuracy and can also meet the requirements of real-time application scenarios.

Fine-Grained Ship Recognition Based on Visible and Near-Infrared Multimodal Remote Sensing Images: Dataset,Methodology and Evaluation

Fine-grained recognition of ships based on remote sensing images is crucial to safeguarding maritime rights and interests and maintaining national security.Currently,with the emergence of massive high-resolution multi-modality images,the use of multi-modality images for fine-grained recognition has become a promising technol-ogy.Fine-grained recognition of multi-modality images imposes higher requirements on the dataset samples.The key to the problem is how to extract and fuse the complementary features of multi-modality images to obtain more discriminative fusion features.The attention mechanism helps the model to pinpoint the key information in the image,resulting in a significant improvement in the model’s performance.In this paper,a dataset for fine-grained recognition of ships based on visible and near-infrared multi-modality remote sensing images has been proposed first,named Dataset for Multimodal Fine-grained Recognition of Ships(DMFGRS).It includes 1,635 pairs of visible and near-infrared remote sensing images divided into 20 categories,collated from digital orthophotos model provided by commercial remote sensing satellites.DMFGRS provides two types of annotation format files,as well as segmentation mask images corresponding to the ship targets.Then,a Multimodal Information Cross-Enhancement Network(MICE-Net)fusing features of visible and near-infrared remote sensing images,has been proposed.In the network,a dual-branch feature extraction and fusion module has been designed to obtain more expressive features.The Feature Cross Enhancement Module(FCEM)achieves the fusion enhancement of the two modal features by making the channel attention and spatial attention work cross-functionally on the feature map.A benchmark is established by evaluating state-of-the-art object recognition algorithms on DMFGRS.MICE-Net conducted experiments on DMFGRS,and the precision,recall,mAP0.5 and mAP0.5:0.95 reached 87%,77.1%,83.8%and 63.9%,respectively.Extensive experiments demonstrate that the proposed MICE-Net has more excellent performance on DMFGRS.Built on lightweight network YOLO,the model has excellent generalizability,and thus has good potential for application in real-life scenarios.

Towards Blockchain-Based Secure BGP Routing,Challenges and Future Research Directions

Border Gateway Protocol(BGP)is a standard inter-domain routing protocol for the Internet that conveys network layer reachability information and establishes routes to different destinations.The BGP protocol exhibits security design defects,such as an unconditional trust mechanism and the default acceptance of BGP route announcements from peers by BGP neighboring nodes,easily triggering prefix hijacking,path forgery,route leakage,and other BGP security threats.Meanwhile,the traditional BGP security mechanism,relying on a public key infrastructure,faces issues like a single point of failure and a single point of trust.The decentralization,anti-tampering,and traceability advantages of blockchain offer new solution ideas for constructing secure and trusted inter-domain routing mechanisms.In this paper,we summarize the characteristics of BGP protocol in detail,sort out the BGP security threats and their causes.Additionally,we analyze the shortcomings of the traditional BGP security mechanism and comprehensively evaluate existing blockchain-based solutions to address the above problems and validate the reliability and effectiveness of blockchain-based BGP security methods in mitigating BGP security threats.Finally,we discuss the challenges posed by BGP security problems and outline prospects for future research.

Improving Network Availability through Optimized Multipath Routing and Incremental Deployment Strategies

Currently,distributed routing protocols are constrained by offering a single path between any pair of nodes,thereby limiting the potential throughput and overall network performance.This approach not only restricts the flow of data but also makes the network susceptible to failures in case the primary path is disrupted.In contrast,routing protocols that leverage multiple paths within the network offer a more resilient and efficient solution.Multipath routing,as a fundamental concept,surpasses the limitations of traditional shortest path first protocols.It not only redirects traffic to unused resources,effectively mitigating network congestion,but also ensures load balancing across the network.This optimization significantly improves network utilization and boosts the overall performance,making it a widely recognized efficient method for enhancing network reliability.To further strengthen network resilience against failures,we introduce a routing scheme known as Multiple Nodes with at least Two Choices(MNTC).This innovative approach aims to significantly enhance network availability by providing each node with at least two routing choices.By doing so,it not only reduces the dependency on a single path but also creates redundant paths that can be utilized in case of failures,thereby enhancing the overall resilience of the network.To ensure the optimal placement of nodes,we propose three incremental deployment algorithms.These algorithms carefully select the most suitable set of nodes for deployment,taking into account various factors such as node connectivity,traffic patterns,and network topology.By deployingMNTCon a carefully chosen set of nodes,we can significantly enhance network reliability without the need for a complete overhaul of the existing infrastructure.We have conducted extensive evaluations of MNTC in diverse topological spaces,demonstrating its effectiveness in maintaining high network availability with minimal path stretch.The results are impressive,showing that even when implemented on just 60%of nodes,our incremental deployment method significantly boosts network availability.This underscores the potential of MNTC in enhancing network resilience and performance,making it a viable solution for modern networks facing increasing demands and complexities.The algorithms OSPF,TBFH,DC and LFC perform fast rerouting based on strict conditions,while MNTC is not restricted by these conditions.In five real network topologies,the average network availability ofMNTCis improved by 14.68%,6.28%,4.76%and 2.84%,respectively,compared with OSPF,TBFH,DC and LFC.

Mitigating Blackhole and Greyhole Routing Attacks in Vehicular Ad Hoc Networks Using Blockchain Based Smart Contracts

The rapid increase in vehicle traffic volume in modern societies has raised the need to develop innovative solutions to reduce traffic congestion and enhance traffic management efficiency.Revolutionary advanced technology,such as Intelligent Transportation Systems(ITS),enables improved traffic management,helps eliminate congestion,and supports a safer environment.ITS provides real-time information on vehicle traffic and transportation systems that can improve decision-making for road users.However,ITS suffers from routing issues at the network layer when utilising Vehicular Ad Hoc Networks(VANETs).This is because each vehicle plays the role of a router in this network,which leads to a complex vehicle communication network,causing issues such as repeated link breakages between vehicles resulting from the mobility of the network and rapid topological variation.This may lead to loss or delay in packet transmissions;this weakness can be exploited in routing attacks,such as black-hole and gray-hole attacks,that threaten the availability of ITS services.In this paper,a Blockchain-based smart contracts model is proposed to offer convenient and comprehensive security mechanisms,enhancing the trustworthiness between vehicles.Self-Classification Blockchain-Based Contracts(SCBC)and Voting-Classification Blockchain-Based Contracts(VCBC)are utilised in the proposed protocol.The results show that VCBC succeeds in attaining better results in PDR and TP performance even in the presence of Blackhole and Grayhole attacks.