A multi-path routing algorithm based on network coding is proposed for combating long propagation delay and high bit error rate of space information networks.On the basis of traditional multi-path routing,the algorith...A multi-path routing algorithm based on network coding is proposed for combating long propagation delay and high bit error rate of space information networks.On the basis of traditional multi-path routing,the algorithm uses a random linear network coding strategy to code data pack-ets.Code number is determined by the next hop link status and the number of current received packets sent by the upstream node together.The algorithm improves retransmission and cache mechanisms through using redundancy caused by network coding.Meanwhile,the algorithm also adopts the flow distribution strategy based on time delay to balance network load.Simulation results show that the proposed routing algorithm can effectively improve packet delivery rate,reduce packet delay,and enhance network performance.展开更多
An algorithm of traffic distribution called active multi-path routing(AMR)in active network is proposed.AMR adopts multi-path routing and applies nonlinear optimizeapproximate method to distribute network traffic amon...An algorithm of traffic distribution called active multi-path routing(AMR)in active network is proposed.AMR adopts multi-path routing and applies nonlinear optimizeapproximate method to distribute network traffic among multiple paths.It is combined to bandwidthresource allocation and the congestion restraint mechanism to avoid congestion happening and worsen.So network performance can be improved greatly.The frame of AMR includes adaptive trafficallocation model,the conception of supply bandwidth and its'allocation model,the principle ofcongestion restraint and its'model,and the implement of AMR based on multi-agents system in activenetwork.Through simulations,AMR has distinct effects on network performance.The results show AMRisa valid traffic regulation algorithm.展开更多
A Mobile Ad hoc NETwork(MANET)is a self-configuring network that is not reliant on infrastructure.This paper introduces a new multipath routing method based on the Multi-Hop Routing(MHR)technique.MHR is the consecutiv...A Mobile Ad hoc NETwork(MANET)is a self-configuring network that is not reliant on infrastructure.This paper introduces a new multipath routing method based on the Multi-Hop Routing(MHR)technique.MHR is the consecutive selection of suitable relay nodes to send information across nodes that are not within direct range of each other.Failing to ensure good MHR leads to several negative consequences,ultimately causing unsuccessful data transmission in a MANET.This research work consists of three portions.The first to attempt to propose an efficient MHR protocol is the design of Priority Based Dynamic Routing(PBDR)to adapt to the dynamic MANET environment by reducing Node Link Failures(NLF)in the network.This is achieved by dynamically considering a node’s mobility parameters like relative velocity and link duration,which enable the next-hop selection.This method works more efficiently than the traditional protocols.Then the second stage is the Improved Multi-Path Dynamic Routing(IMPDR).The enhancement is mainly focused on further improving the Quality of Service(QoS)in MANETs by introducing a QoS timer at every node to help in the QoS routing of MANETs.Since QoS is the most vital metric that assesses a protocol,its dynamic estimation has improved network performance considerably.This method uses distance,linkability,trust,and QoS as the four parameters for the next-hop selection.IMPDR is compared against traditional routing protocols.The Network Simulator-2(NS2)is used to conduct a simulation analysis of the protocols under consideration.The proposed tests are assessed for the Packet Delivery Ratio(PDR),Packet Loss Rate(PLR),End-to-End Delay(EED),and Network Throughput(NT).展开更多
Many ＂rich - connected＂ topologies with multiple parallel paths between smwers have been proposed for data center networks recently to provide high bisection bandwidth, but it re mains challenging to fully utilize t...Many ＂rich - connected＂ topologies with multiple parallel paths between smwers have been proposed for data center networks recently to provide high bisection bandwidth, but it re mains challenging to fully utilize the high network capacity by appropriate multi- path routing algorithms. As flow-level path splitting may lead to trafl＇ic imbalance between paths due to flow- size difference, packet-level path splitting attracts more attention lately, which spreads packets from flows into multiple available paths and significantly improves link utilizations. However, it may cause packet reordering, confusing the TCP congestion control algorithm and lowering the throughput of flows. In this paper, we design a novel packetlevel multi-path routing scheme called SOPA, which leverag- es OpenFlow to perform packet-level path splitting in a round- robin fashion, and hence significantly mitigates the packet reordering problem and improves the network throughput. Moreover, SOPA leverages the topological feature of data center networks to encode a very small number of switches along the path into the packet header, resulting in very light overhead. Compared with random packet spraying （RPS）, Hedera and equal-cost multi-path routing （ECMP）, our simulations demonstrate that SOPA achieves 29.87%, 50.41% and 77.74% higher network throughput respectively under permutation workload, and reduces average data transfer completion time by 53.65%, 343.31% and 348.25% respectively under production workload.展开更多
Wireless sensor networks are widely used for its flexibility, but they also suffer from problems like limited capacity, large node number and vulnerability to security threats. In this paper, we propose a multi-path r...Wireless sensor networks are widely used for its flexibility, but they also suffer from problems like limited capacity, large node number and vulnerability to security threats. In this paper, we propose a multi-path routing protocol based on the credible cluster heads. The protocol chooses nodes with more energy remained as cluster heads at the cluster head choosing phase, and then authenticates them by the neighbor cluster heads. Using trust mechanisms it creates the credit value, and based on the credit value the multi-path cluster head routing can finally be found. The credit value is created and exchanged among the cluster heads only. Theoretical analysis combined with simulation results demonstrate that this protocol can save the resource, prolong the lifetime, and ensure the security and performance of the network.展开更多
The layer 2 network technology is extending beyond its traditional local area implementation and finding wider acceptance in provider’s metropolitan area networks and large-scale cloud data center networks. This is m...The layer 2 network technology is extending beyond its traditional local area implementation and finding wider acceptance in provider’s metropolitan area networks and large-scale cloud data center networks. This is mainly due to its plug-and-play capability and native mobility support. Many efforts have been put to increase the bisection bandwidth in a layer 2 network, which has been constrained by the spanning tree protocol that a layer 2 network uses for preventing looping. The recent trend is to incorporate layer 3’s routing approach into a layer 2 network so that multiple paths can be used for forwarding traffic between any source-destination (S-D) node pair. ECMP (equal cost multipath) is one such example. However, ECMP may still be limited in generating multiple paths due to its shortest path (lowest cost) requirement. In this paper, we consider a non-shortest-path routing approach, called EPMP (Equal Preference Multi-Path) that can generate more paths than ECMP. The EPMP is based on the ordered semi-group algebra. In the EPMP routing, paths that differ in traditionally-defined costs, such as hops, bandwidth, etc., can be made equally preferred and thus become candidate paths. We found that, in comparison with ECMP, EPMP routing not only generates more paths, provides higher bisection bandwidth, but also allows bottleneck links in a hierarchical network to be identified when different traffic patterns are applied. EPMP is also versatile in that it can use various ways of path preference calculations to control the number and the length of paths, making it flexible (like policy-based routing) but also objective (like shortest path first routing) in calculating preferred paths.展开更多
Geography rectangle is used to reduce signaling overhead of the LEO satellite networks.Moreover,a multi-path routing algorithm based on an improved ant colony system(MPRA-AC) is proposed.Matrix indicating the importan...Geography rectangle is used to reduce signaling overhead of the LEO satellite networks.Moreover,a multi-path routing algorithm based on an improved ant colony system(MPRA-AC) is proposed.Matrix indicating the importance of the link between satellites is introduced into MPRA-AC in order to find the optimal path more quickly.Simulation results show that MPRA-AC reduces the number of iterations to achieve a satisfactory solution.At the same time,the packet delivery ratio of LEO satellite networks when running MPRA-AC and DSR-LSN(dynamic source routing algorithm for LEO satellite networks) is compared.The packet delivery ratio is about 7.9%lower when running DSR-LSN.Moreover,because of the mechanism of active load balancing of MPRA-AC,simulation results show that MPRA-AC outperforms DSR-LSN in link utilization when data packets are transmitted in the networks.展开更多
The routing protocols play an important role for ad hoc networks performance.As some problems with DSR,SMR,and AMR protocols were analyzed,a new routing protocol suitable for UWB Ad hoc networks was proposed in this p...The routing protocols play an important role for ad hoc networks performance.As some problems with DSR,SMR,and AMR protocols were analyzed,a new routing protocol suitable for UWB Ad hoc networks was proposed in this paper.The new routing protocol utilize an act of orientation of UWB and tries to get sufficient route information and decrease the network load caused by route discovery at the same time.Simulation results show that the routing load of the new protocol is lower and throughput is higher than that of DSR.While the node’s mobility increases,these advantages become more obvious.展开更多
Optimizing routing and resource allocation in decentralized unmanned aerial vehicle(UAV)networks remains challenging due to interference and rapidly changing topologies.The authors introduce a novel framework combinin...Optimizing routing and resource allocation in decentralized unmanned aerial vehicle(UAV)networks remains challenging due to interference and rapidly changing topologies.The authors introduce a novel framework combining double deep Q-networks(DDQNs)and graph neural networks(GNNs)for joint routing and resource allocation.The framework uses GNNs to model the network topology and DDQNs to adaptively control routing and resource allocation,addressing interference and improving network performance.Simulation results show that the proposed approach outperforms traditional methods such as Closest-to-Destination(c2Dst),Max-SINR(mSINR),and Multi-Layer Perceptron(MLP)-based models,achieving approximately 23.5% improvement in throughput,50% increase in connection probability,and 17.6% reduction in number of hops,demonstrating its effectiveness in dynamic UAV networks.展开更多
The Routing Protocol for Low-power and Lossy Networks(RPL)is widely used in Internet of Things(IoT)systems,where devices usually have very limited resources.However,RPL still faces several problems,such as high energy...The Routing Protocol for Low-power and Lossy Networks(RPL)is widely used in Internet of Things(IoT)systems,where devices usually have very limited resources.However,RPL still faces several problems,such as high energy usage,unstable links,and inefficient routing decisions,which reduce the overall network performance and lifetime.In this work,we introduce TABURPL,an improved routing method that applies Tabu Search(TS)to optimize the parent selection process.The method uses a combined cost function that considers Residual Energy,Transmission Energy,Distance to the Sink,Hop Count,Expected Transmission Count(ETX),and Link Stability Rate(LSR).Simulation results show that TABURPL improves link stability,lowers energy consumption,and increases the packet delivery ratio compared with standard RPL and other existing approaches.These results indicate that Tabu Search can handle the complex trade-offs in IoT routing and can provide a more reliable solution for extending the network lifetime.展开更多
With the increasing complexity of logistics operations,traditional static vehicle routing models are no longer sufficient.In practice,customer demands often arise dynamically,and multi-depot systems are commonly used ...With the increasing complexity of logistics operations,traditional static vehicle routing models are no longer sufficient.In practice,customer demands often arise dynamically,and multi-depot systems are commonly used to improve efficiency.This paper first introduces a vehicle routing problem with the goal of minimizing operating costs in a multi-depot environment with dynamic demand.New customers appear in the delivery process at any time and are periodically optimized according to time slices.Then,we propose a scheduling system TS-DPU based on an improved ant colony algorithm TS-ACO to solve this problem.The classical ant colony algorithm uses spatial distance to select nodes,while TS-ACO considers the impact of both temporal and spatial distance on node selection.Meanwhile,we adopt Cordeau’s Multi-Depot Vehicle Routing Problem with Time Windows(MDVRPTW)dataset to evaluate the performance of our system.According to the experimental results,TS-ACO,which considers spatial and temporal distance,is more effective than the classical ACO,which only considers spatial distance.展开更多
Wireless Sensor Networks(WSNs)have become foundational in numerous real-world applications,ranging from environmental monitoring and industrial automation to healthcare systems and smart city development.As these netw...Wireless Sensor Networks(WSNs)have become foundational in numerous real-world applications,ranging from environmental monitoring and industrial automation to healthcare systems and smart city development.As these networks continue to grow in scale and complexity,the need for energy-efficient,scalable,and robust communication protocols becomes more critical than ever.Metaheuristic algorithms have shown significant promise in addressing these challenges,offering flexible and effective solutions for optimizing WSN performance.Among them,the Grey Wolf Optimizer(GWO)algorithm has attracted growing attention due to its simplicity,fast convergence,and strong global search capabilities.Accordingly,this survey provides an in-depth review of the applications of GWO and its variants for clustering,multi-hop routing,and hybrid cluster-based routing in WSNs.We categorize and analyze the existing GWO-based approaches across these key network optimization tasks,discussing the different problem formulations,decision variables,objective functions,and performance metrics used.In doing so,we examine standard GWO,multi-objective GWO,and hybrid GWO models that incorporate other computational intelligence techniques.Each method is evaluated based on how effectively it addresses the core constraints of WSNs,including energy consumption,communication overhead,and network lifetime.Finally,this survey outlines existing gaps in the literature and proposes potential future research directions aimed at enhancing the effectiveness and real-world applicability of GWO-based techniques for WSN clustering and routing.Our goal is to provide researchers and practitioners with a clear,structured understanding of the current state of GWO in WSNs and inspire further innovation in this evolving field.展开更多
Mega low Earth orbit(LEO)satellite networks serve as effective complements to terrestrial networks.However,the dual mobility of users and LEO satellites makes inter-satellite handovers more frequent for users.Moreover...Mega low Earth orbit(LEO)satellite networks serve as effective complements to terrestrial networks.However,the dual mobility of users and LEO satellites makes inter-satellite handovers more frequent for users.Moreover,there are both ascending and descending segments in widely deployed walker-delta constellations.Even if the locations of users do not change,when the access satellites of the communicating parties are not in the same ascending or descending segment,the end-to-end latency between them will increase.To address this challenge,the self-decision handover(SDH)strategy and the joint decision handover(JDH)strategy are proposed,and they both incorporate the routing hops as a crucial handover criterion to minimize the end-to-end latency.In addition,the shortest route hop-count algorithm is designed to assist in the handover decision-making process.Simulations demonstrate that the proposed handover strategies outperform the traditional handover strategies in terms of the number of handovers and end-to-end latency.展开更多
Traditional multi-path routing mechanisms aim to establish complete node or link disjoint paths.However,under some circumstances if multiple paths cannot be established based on the current network topology,the tradit...Traditional multi-path routing mechanisms aim to establish complete node or link disjoint paths.However,under some circumstances if multiple paths cannot be established based on the current network topology,the traditional multi-path routing mechanism will degenerate into single path routing mechanism,thus the advantages of multi-path routing cannot be exhibited.To enhance the end-to-end path reliability,an adaptive multi-path routing mechanism with path segment is proposed,in which multi-path can be established at part of the end-to-end path.In this way the reliability of the path can be enhanced.This path segment mechanism can divide the end-to-end path into several short segments,and a parallel forwarding mechanism is proposed for guaranteeing the quality of service of multimedia services over the wireless network.Simulations show that the network performance metrics such as the packet delivery ratio,the end-to-end delay and the number of route discoveries are all improved by using the adaptive multi-path routing mechanism.展开更多
Quality of service （QoS） routing algorithms have been hardly discussed in the scientific community, most previous work on QoS routing concentrates on the performance of the single route. Cognitive packet network （...Quality of service （QoS） routing algorithms have been hardly discussed in the scientific community, most previous work on QoS routing concentrates on the performance of the single route. Cognitive packet network （CPN） has been designed for providing QoS routing. In this paper, to balance the loads among networks, we present a multi-path routing algorithm based on load-balance （MPRLB）, which is carried out in two steps. The algorithm with low computational complexity is firstly applied to establish multi path routing for each source and destination node pairs （SD-pair） nodes in the network. Then, we propose the hopfield neural network algorithm, which is applied to improve the efficiency of the flow deviation method for fast flow allocation among the links of the network based on load balance. Extensive simulation results demonstrate that the proposed scheme significantly improves the performance compared with the existing scheme that ignores load balancing.展开更多
This paper proposes a new on-demand multi-alternate-path algorithm, called quickly switching routing algorithm(QSRA). It switches failure routing to an alternate path as quickly as the network can. Like a nervure shap...This paper proposes a new on-demand multi-alternate-path algorithm, called quickly switching routing algorithm(QSRA). It switches failure routing to an alternate path as quickly as the network can. Like a nervure shape, algorithm QSRA shapes disjoint-alternate-path structure, but is not limited to. It also contains another structure that every primary node has several links to alternate paths. This structure has two advantages, the first one is that primary nodes can select one alternate path immediately when primary routing is failure without going back to source node to re-discover a new routing or choose an alternate path; the second is that it guarantees primary nodes can select another alternate path as quickly as possible once one of alternate paths fails. Strongpoint of algorithm QSRA is reducing frequency of routing re-discovering. Besides, the structure occupies fewer resources than other routing algorithms due to its distributed structure. Simulation shows that QSRA has higher packets received ratio and lower control packet overhead and lower end-to-end delay.展开更多
As an important secure routing mechanism, multi-path routing is one of the major ways to improve network efficiency and to guarantee the network security, which ensures the reliability of data transmission by using ba...As an important secure routing mechanism, multi-path routing is one of the major ways to improve network efficiency and to guarantee the network security, which ensures the reliability of data transmission by using backup paths when the primary one is unavailable due to local node or link failures. Most current studies on multi-path routing mechanism are based on experiments or simulations. The resulta are usually specific application scenarios oriented heuristic algorithms, lacking universal significance. In this paper, a theoretic analysis is performed on the relationship between the multi-path routing policy, the network efficiency and its survivability. Starting with point-to-point communication network, an impactoriented analysis is made on the network interference under multi-path routing mechanism. Based on the analysis, the upper-limit of network performance under interference impact is also discussed.展开更多
Wirreless sensor networks are being widely researched and are expected to be used in several scenarios. On the leading edge of treads, on-demand, high-reliability, and low-latency routing protocol is desirable for ind...Wirreless sensor networks are being widely researched and are expected to be used in several scenarios. On the leading edge of treads, on-demand, high-reliability, and low-latency routing protocol is desirable for indoor environment applications. This article proposes a routing scheme called robust multi-path routing that establishes and uses multiple node-disjoint routes. Providing multiple routes helps to reduce the route recovery process and control the message overhead. The performance comparison of this protocol with dynamic source routing （DSR） by OPNET simulations shows that this protocol is able to achieve a remarkable improvement in the packet delivery ratio and average end-to-end delay.展开更多
Underwater Wireless Sensor Networks(UWSNs)are gaining popularity because of their potential uses in oceanography,seismic activity monitoring,environmental preservation,and underwater mapping.Yet,these networks are fac...Underwater Wireless Sensor Networks(UWSNs)are gaining popularity because of their potential uses in oceanography,seismic activity monitoring,environmental preservation,and underwater mapping.Yet,these networks are faced with challenges such as self-interference,long propagation delays,limited bandwidth,and changing network topologies.These challenges are coped with by designing advanced routing protocols.In this work,we present Under Water Fuzzy-Routing Protocol for Low power and Lossy networks(UWF-RPL),an enhanced fuzzy-based protocol that improves decision-making during path selection and traffic distribution over different network nodes.Our method extends RPL with the aid of fuzzy logic to optimize depth,energy,Received Signal Strength Indicator(RSSI)to Expected Transmission Count(ETX)ratio,and latency.Theproposed protocol outperforms other techniques in that it offersmore energy efficiency,better packet delivery,lowdelay,and no queue overflow.It also exhibits better scalability and reliability in dynamic underwater networks,which is of very high importance in maintaining the network operations efficiency and the lifetime of UWSNs optimized.Compared to other recent methods,it offers improved network convergence time(10%–23%),energy efficiency(15%),packet delivery(17%),and delay(24%).展开更多
Low Earth orbit(LEO)satellite networks exhibit distinct characteristics,e.g.,limited resources of individual satellite nodes and dynamic network topology,which have brought many challenges for routing algorithms.To sa...Low Earth orbit(LEO)satellite networks exhibit distinct characteristics,e.g.,limited resources of individual satellite nodes and dynamic network topology,which have brought many challenges for routing algorithms.To satisfy quality of service(QoS)requirements of various users,it is critical to research efficient routing strategies to fully utilize satellite resources.This paper proposes a multi-QoS information optimized routing algorithm based on reinforcement learning for LEO satellite networks,which guarantees high level assurance demand services to be prioritized under limited satellite resources while considering the load balancing performance of the satellite networks for low level assurance demand services to ensure the full and effective utilization of satellite resources.An auxiliary path search algorithm is proposed to accelerate the convergence of satellite routing algorithm.Simulation results show that the generated routing strategy can timely process and fully meet the QoS demands of high assurance services while effectively improving the load balancing performance of the link.展开更多
基金supported by the National Natural Science Foundation of China(No.60929003)
文摘A multi-path routing algorithm based on network coding is proposed for combating long propagation delay and high bit error rate of space information networks.On the basis of traditional multi-path routing,the algorithm uses a random linear network coding strategy to code data pack-ets.Code number is determined by the next hop link status and the number of current received packets sent by the upstream node together.The algorithm improves retransmission and cache mechanisms through using redundancy caused by network coding.Meanwhile,the algorithm also adopts the flow distribution strategy based on time delay to balance network load.Simulation results show that the proposed routing algorithm can effectively improve packet delivery rate,reduce packet delay,and enhance network performance.
基金Supported by the National Natural Science Foun dation of China(90204008)
文摘An algorithm of traffic distribution called active multi-path routing(AMR)in active network is proposed.AMR adopts multi-path routing and applies nonlinear optimizeapproximate method to distribute network traffic among multiple paths.It is combined to bandwidthresource allocation and the congestion restraint mechanism to avoid congestion happening and worsen.So network performance can be improved greatly.The frame of AMR includes adaptive trafficallocation model,the conception of supply bandwidth and its'allocation model,the principle ofcongestion restraint and its'model,and the implement of AMR based on multi-agents system in activenetwork.Through simulations,AMR has distinct effects on network performance.The results show AMRisa valid traffic regulation algorithm.
基金supported by Princess Nourah bint Abdulrahman University Researchers Supporting Project number(PNURSP2022R195),Princess Nourah bint Abdulrahman University,Riyadh,Saudi Arabia.
文摘A Mobile Ad hoc NETwork(MANET)is a self-configuring network that is not reliant on infrastructure.This paper introduces a new multipath routing method based on the Multi-Hop Routing(MHR)technique.MHR is the consecutive selection of suitable relay nodes to send information across nodes that are not within direct range of each other.Failing to ensure good MHR leads to several negative consequences,ultimately causing unsuccessful data transmission in a MANET.This research work consists of three portions.The first to attempt to propose an efficient MHR protocol is the design of Priority Based Dynamic Routing(PBDR)to adapt to the dynamic MANET environment by reducing Node Link Failures(NLF)in the network.This is achieved by dynamically considering a node’s mobility parameters like relative velocity and link duration,which enable the next-hop selection.This method works more efficiently than the traditional protocols.Then the second stage is the Improved Multi-Path Dynamic Routing(IMPDR).The enhancement is mainly focused on further improving the Quality of Service(QoS)in MANETs by introducing a QoS timer at every node to help in the QoS routing of MANETs.Since QoS is the most vital metric that assesses a protocol,its dynamic estimation has improved network performance considerably.This method uses distance,linkability,trust,and QoS as the four parameters for the next-hop selection.IMPDR is compared against traditional routing protocols.The Network Simulator-2(NS2)is used to conduct a simulation analysis of the protocols under consideration.The proposed tests are assessed for the Packet Delivery Ratio(PDR),Packet Loss Rate(PLR),End-to-End Delay(EED),and Network Throughput(NT).
基金supported by the National Basic Research Program of China(973 program)under Grant No.2014CB347800 and No.2012CB315803the National High-Tech R&D Program of China(863 program)under Grant No.2013AA013303+1 种基金the Natural Science Foundation of China under Grant No.61170291,No.61133006,and No.61161140454ZTE IndustryAcademia-Research Cooperation Funds
文摘Many ＂rich - connected＂ topologies with multiple parallel paths between smwers have been proposed for data center networks recently to provide high bisection bandwidth, but it re mains challenging to fully utilize the high network capacity by appropriate multi- path routing algorithms. As flow-level path splitting may lead to trafl＇ic imbalance between paths due to flow- size difference, packet-level path splitting attracts more attention lately, which spreads packets from flows into multiple available paths and significantly improves link utilizations. However, it may cause packet reordering, confusing the TCP congestion control algorithm and lowering the throughput of flows. In this paper, we design a novel packetlevel multi-path routing scheme called SOPA, which leverag- es OpenFlow to perform packet-level path splitting in a round- robin fashion, and hence significantly mitigates the packet reordering problem and improves the network throughput. Moreover, SOPA leverages the topological feature of data center networks to encode a very small number of switches along the path into the packet header, resulting in very light overhead. Compared with random packet spraying （RPS）, Hedera and equal-cost multi-path routing （ECMP）, our simulations demonstrate that SOPA achieves 29.87%, 50.41% and 77.74% higher network throughput respectively under permutation workload, and reduces average data transfer completion time by 53.65%, 343.31% and 348.25% respectively under production workload.
文摘Wireless sensor networks are widely used for its flexibility, but they also suffer from problems like limited capacity, large node number and vulnerability to security threats. In this paper, we propose a multi-path routing protocol based on the credible cluster heads. The protocol chooses nodes with more energy remained as cluster heads at the cluster head choosing phase, and then authenticates them by the neighbor cluster heads. Using trust mechanisms it creates the credit value, and based on the credit value the multi-path cluster head routing can finally be found. The credit value is created and exchanged among the cluster heads only. Theoretical analysis combined with simulation results demonstrate that this protocol can save the resource, prolong the lifetime, and ensure the security and performance of the network.
文摘The layer 2 network technology is extending beyond its traditional local area implementation and finding wider acceptance in provider’s metropolitan area networks and large-scale cloud data center networks. This is mainly due to its plug-and-play capability and native mobility support. Many efforts have been put to increase the bisection bandwidth in a layer 2 network, which has been constrained by the spanning tree protocol that a layer 2 network uses for preventing looping. The recent trend is to incorporate layer 3’s routing approach into a layer 2 network so that multiple paths can be used for forwarding traffic between any source-destination (S-D) node pair. ECMP (equal cost multipath) is one such example. However, ECMP may still be limited in generating multiple paths due to its shortest path (lowest cost) requirement. In this paper, we consider a non-shortest-path routing approach, called EPMP (Equal Preference Multi-Path) that can generate more paths than ECMP. The EPMP is based on the ordered semi-group algebra. In the EPMP routing, paths that differ in traditionally-defined costs, such as hops, bandwidth, etc., can be made equally preferred and thus become candidate paths. We found that, in comparison with ECMP, EPMP routing not only generates more paths, provides higher bisection bandwidth, but also allows bottleneck links in a hierarchical network to be identified when different traffic patterns are applied. EPMP is also versatile in that it can use various ways of path preference calculations to control the number and the length of paths, making it flexible (like policy-based routing) but also objective (like shortest path first routing) in calculating preferred paths.
基金Supported by the National High Technology Research and Development Programme of China(No.SS2013AA010503)the National Natural Science Foundation of China(No.61271281,61201151,61275158)the Fundamental Research Funds for the Central Universities(No.2482012PTB0004)
文摘Geography rectangle is used to reduce signaling overhead of the LEO satellite networks.Moreover,a multi-path routing algorithm based on an improved ant colony system(MPRA-AC) is proposed.Matrix indicating the importance of the link between satellites is introduced into MPRA-AC in order to find the optimal path more quickly.Simulation results show that MPRA-AC reduces the number of iterations to achieve a satisfactory solution.At the same time,the packet delivery ratio of LEO satellite networks when running MPRA-AC and DSR-LSN(dynamic source routing algorithm for LEO satellite networks) is compared.The packet delivery ratio is about 7.9%lower when running DSR-LSN.Moreover,because of the mechanism of active load balancing of MPRA-AC,simulation results show that MPRA-AC outperforms DSR-LSN in link utilization when data packets are transmitted in the networks.
基金National Nature Science Foundation of China (No. 60496311)Nature Science Foundation of Jiangsu Province (No. BK2004067&BK2005409)Foundation of Huawei Technology (No. YJCB2004018NP).
文摘The routing protocols play an important role for ad hoc networks performance.As some problems with DSR,SMR,and AMR protocols were analyzed,a new routing protocol suitable for UWB Ad hoc networks was proposed in this paper.The new routing protocol utilize an act of orientation of UWB and tries to get sufficient route information and decrease the network load caused by route discovery at the same time.Simulation results show that the routing load of the new protocol is lower and throughput is higher than that of DSR.While the node’s mobility increases,these advantages become more obvious.
文摘Optimizing routing and resource allocation in decentralized unmanned aerial vehicle(UAV)networks remains challenging due to interference and rapidly changing topologies.The authors introduce a novel framework combining double deep Q-networks(DDQNs)and graph neural networks(GNNs)for joint routing and resource allocation.The framework uses GNNs to model the network topology and DDQNs to adaptively control routing and resource allocation,addressing interference and improving network performance.Simulation results show that the proposed approach outperforms traditional methods such as Closest-to-Destination(c2Dst),Max-SINR(mSINR),and Multi-Layer Perceptron(MLP)-based models,achieving approximately 23.5% improvement in throughput,50% increase in connection probability,and 17.6% reduction in number of hops,demonstrating its effectiveness in dynamic UAV networks.
文摘The Routing Protocol for Low-power and Lossy Networks(RPL)is widely used in Internet of Things(IoT)systems,where devices usually have very limited resources.However,RPL still faces several problems,such as high energy usage,unstable links,and inefficient routing decisions,which reduce the overall network performance and lifetime.In this work,we introduce TABURPL,an improved routing method that applies Tabu Search(TS)to optimize the parent selection process.The method uses a combined cost function that considers Residual Energy,Transmission Energy,Distance to the Sink,Hop Count,Expected Transmission Count(ETX),and Link Stability Rate(LSR).Simulation results show that TABURPL improves link stability,lowers energy consumption,and increases the packet delivery ratio compared with standard RPL and other existing approaches.These results indicate that Tabu Search can handle the complex trade-offs in IoT routing and can provide a more reliable solution for extending the network lifetime.
基金supported by the Startup Foundation for Introducing Talent of Nanjing University of Information Science and Technology.
文摘With the increasing complexity of logistics operations,traditional static vehicle routing models are no longer sufficient.In practice,customer demands often arise dynamically,and multi-depot systems are commonly used to improve efficiency.This paper first introduces a vehicle routing problem with the goal of minimizing operating costs in a multi-depot environment with dynamic demand.New customers appear in the delivery process at any time and are periodically optimized according to time slices.Then,we propose a scheduling system TS-DPU based on an improved ant colony algorithm TS-ACO to solve this problem.The classical ant colony algorithm uses spatial distance to select nodes,while TS-ACO considers the impact of both temporal and spatial distance on node selection.Meanwhile,we adopt Cordeau’s Multi-Depot Vehicle Routing Problem with Time Windows(MDVRPTW)dataset to evaluate the performance of our system.According to the experimental results,TS-ACO,which considers spatial and temporal distance,is more effective than the classical ACO,which only considers spatial distance.
文摘Wireless Sensor Networks(WSNs)have become foundational in numerous real-world applications,ranging from environmental monitoring and industrial automation to healthcare systems and smart city development.As these networks continue to grow in scale and complexity,the need for energy-efficient,scalable,and robust communication protocols becomes more critical than ever.Metaheuristic algorithms have shown significant promise in addressing these challenges,offering flexible and effective solutions for optimizing WSN performance.Among them,the Grey Wolf Optimizer(GWO)algorithm has attracted growing attention due to its simplicity,fast convergence,and strong global search capabilities.Accordingly,this survey provides an in-depth review of the applications of GWO and its variants for clustering,multi-hop routing,and hybrid cluster-based routing in WSNs.We categorize and analyze the existing GWO-based approaches across these key network optimization tasks,discussing the different problem formulations,decision variables,objective functions,and performance metrics used.In doing so,we examine standard GWO,multi-objective GWO,and hybrid GWO models that incorporate other computational intelligence techniques.Each method is evaluated based on how effectively it addresses the core constraints of WSNs,including energy consumption,communication overhead,and network lifetime.Finally,this survey outlines existing gaps in the literature and proposes potential future research directions aimed at enhancing the effectiveness and real-world applicability of GWO-based techniques for WSN clustering and routing.Our goal is to provide researchers and practitioners with a clear,structured understanding of the current state of GWO in WSNs and inspire further innovation in this evolving field.
基金supported by the State Key Laboratory of Micro-Spacecraft Rapid Design and Intelligent Cluster(MS01240103)the National Natural Science Foundation of China(62071146,62431009)+2 种基金the National 2011 Collaborative Innovation Center of Wireless Communication Technologies(2242022k60006)the Research Project Fund of Songjiang Laboratory(SL20230104)Heilongjiang Province Postdoctoral General Foundation(LBH-Z22133)。
文摘Mega low Earth orbit(LEO)satellite networks serve as effective complements to terrestrial networks.However,the dual mobility of users and LEO satellites makes inter-satellite handovers more frequent for users.Moreover,there are both ascending and descending segments in widely deployed walker-delta constellations.Even if the locations of users do not change,when the access satellites of the communicating parties are not in the same ascending or descending segment,the end-to-end latency between them will increase.To address this challenge,the self-decision handover(SDH)strategy and the joint decision handover(JDH)strategy are proposed,and they both incorporate the routing hops as a crucial handover criterion to minimize the end-to-end latency.In addition,the shortest route hop-count algorithm is designed to assist in the handover decision-making process.Simulations demonstrate that the proposed handover strategies outperform the traditional handover strategies in terms of the number of handovers and end-to-end latency.
基金supported by the Hi-Tech Research and Development Program of China(2008AA01A322)the National Natural Science Foundation of China(60772109)
文摘Traditional multi-path routing mechanisms aim to establish complete node or link disjoint paths.However,under some circumstances if multiple paths cannot be established based on the current network topology,the traditional multi-path routing mechanism will degenerate into single path routing mechanism,thus the advantages of multi-path routing cannot be exhibited.To enhance the end-to-end path reliability,an adaptive multi-path routing mechanism with path segment is proposed,in which multi-path can be established at part of the end-to-end path.In this way the reliability of the path can be enhanced.This path segment mechanism can divide the end-to-end path into several short segments,and a parallel forwarding mechanism is proposed for guaranteeing the quality of service of multimedia services over the wireless network.Simulations show that the network performance metrics such as the packet delivery ratio,the end-to-end delay and the number of route discoveries are all improved by using the adaptive multi-path routing mechanism.
基金supported by the Ministry of Industry and Information Technology of China (2011ZX03001-007-03)the Nature Science Foundation of Beijing (4102044)the National Science Foundation for Young Scientists of China (61001115)
文摘Quality of service （QoS） routing algorithms have been hardly discussed in the scientific community, most previous work on QoS routing concentrates on the performance of the single route. Cognitive packet network （CPN） has been designed for providing QoS routing. In this paper, to balance the loads among networks, we present a multi-path routing algorithm based on load-balance （MPRLB）, which is carried out in two steps. The algorithm with low computational complexity is firstly applied to establish multi path routing for each source and destination node pairs （SD-pair） nodes in the network. Then, we propose the hopfield neural network algorithm, which is applied to improve the efficiency of the flow deviation method for fast flow allocation among the links of the network based on load balance. Extensive simulation results demonstrate that the proposed scheme significantly improves the performance compared with the existing scheme that ignores load balancing.
文摘This paper proposes a new on-demand multi-alternate-path algorithm, called quickly switching routing algorithm(QSRA). It switches failure routing to an alternate path as quickly as the network can. Like a nervure shape, algorithm QSRA shapes disjoint-alternate-path structure, but is not limited to. It also contains another structure that every primary node has several links to alternate paths. This structure has two advantages, the first one is that primary nodes can select one alternate path immediately when primary routing is failure without going back to source node to re-discover a new routing or choose an alternate path; the second is that it guarantees primary nodes can select another alternate path as quickly as possible once one of alternate paths fails. Strongpoint of algorithm QSRA is reducing frequency of routing re-discovering. Besides, the structure occupies fewer resources than other routing algorithms due to its distributed structure. Simulation shows that QSRA has higher packets received ratio and lower control packet overhead and lower end-to-end delay.
基金the National Basic Research Development Program of China (Grant No. 2003CB314805)the National Nature Science Foundation of China (Grant No. 60603022)
文摘As an important secure routing mechanism, multi-path routing is one of the major ways to improve network efficiency and to guarantee the network security, which ensures the reliability of data transmission by using backup paths when the primary one is unavailable due to local node or link failures. Most current studies on multi-path routing mechanism are based on experiments or simulations. The resulta are usually specific application scenarios oriented heuristic algorithms, lacking universal significance. In this paper, a theoretic analysis is performed on the relationship between the multi-path routing policy, the network efficiency and its survivability. Starting with point-to-point communication network, an impactoriented analysis is made on the network interference under multi-path routing mechanism. Based on the analysis, the upper-limit of network performance under interference impact is also discussed.
文摘Wirreless sensor networks are being widely researched and are expected to be used in several scenarios. On the leading edge of treads, on-demand, high-reliability, and low-latency routing protocol is desirable for indoor environment applications. This article proposes a routing scheme called robust multi-path routing that establishes and uses multiple node-disjoint routes. Providing multiple routes helps to reduce the route recovery process and control the message overhead. The performance comparison of this protocol with dynamic source routing （DSR） by OPNET simulations shows that this protocol is able to achieve a remarkable improvement in the packet delivery ratio and average end-to-end delay.
文摘Underwater Wireless Sensor Networks(UWSNs)are gaining popularity because of their potential uses in oceanography,seismic activity monitoring,environmental preservation,and underwater mapping.Yet,these networks are faced with challenges such as self-interference,long propagation delays,limited bandwidth,and changing network topologies.These challenges are coped with by designing advanced routing protocols.In this work,we present Under Water Fuzzy-Routing Protocol for Low power and Lossy networks(UWF-RPL),an enhanced fuzzy-based protocol that improves decision-making during path selection and traffic distribution over different network nodes.Our method extends RPL with the aid of fuzzy logic to optimize depth,energy,Received Signal Strength Indicator(RSSI)to Expected Transmission Count(ETX)ratio,and latency.Theproposed protocol outperforms other techniques in that it offersmore energy efficiency,better packet delivery,lowdelay,and no queue overflow.It also exhibits better scalability and reliability in dynamic underwater networks,which is of very high importance in maintaining the network operations efficiency and the lifetime of UWSNs optimized.Compared to other recent methods,it offers improved network convergence time(10%–23%),energy efficiency(15%),packet delivery(17%),and delay(24%).
基金National Key Research and Development Program(2021YFB2900604)。
文摘Low Earth orbit(LEO)satellite networks exhibit distinct characteristics,e.g.,limited resources of individual satellite nodes and dynamic network topology,which have brought many challenges for routing algorithms.To satisfy quality of service(QoS)requirements of various users,it is critical to research efficient routing strategies to fully utilize satellite resources.This paper proposes a multi-QoS information optimized routing algorithm based on reinforcement learning for LEO satellite networks,which guarantees high level assurance demand services to be prioritized under limited satellite resources while considering the load balancing performance of the satellite networks for low level assurance demand services to ensure the full and effective utilization of satellite resources.An auxiliary path search algorithm is proposed to accelerate the convergence of satellite routing algorithm.Simulation results show that the generated routing strategy can timely process and fully meet the QoS demands of high assurance services while effectively improving the load balancing performance of the link.
