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).展开更多
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.展开更多
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.展开更多
An algorithm of traffic distribution called active multi\|path routing (AMR) in active network is proposed. AMR adopts multi\|path routing and applies nonlinear optimize approximate method to distribute network traffi...An algorithm of traffic distribution called active multi\|path routing (AMR) in active network is proposed. AMR adopts multi\|path routing and applies nonlinear optimize approximate method to distribute network traffic among multiple paths. It is combined to bandwidth resource 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 traffic allocation model, the conception of supply bandwidth and its’ allocation model, the principle of congestion restraint and its’ model, and the implement of AMR based on multi\|agents system in active network. Through simulations, AMR has distinct effects on network performance. The results show AMR is a valid traffic regulation algorithm.展开更多
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.展开更多
Many "rich-connected" topologies with multiple parallel paths between servers have been proposed for data center networks recently to provide high bisection bandwidth, but it remains challenging to fully uti...Many "rich-connected" topologies with multiple parallel paths between servers have been proposed for data center networks recently to provide high bisection bandwidth, but it remains challenging to fully utilize the high network capacity by appropriate multi-path routing algorithms. As flow-level path splitting may lead to traffic 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 leverages Open Flow to perform packet-level path splitting in a roundrobin 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 by53.65%, 343.31% and 348.25% respectively under production workload.展开更多
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 o...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.展开更多
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 an...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.展开更多
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 stringentQu...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.展开更多
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 Netw...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.展开更多
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 s...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.展开更多
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 techno...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.展开更多
Wireless technology is transforming the future of transportation through the development of the Internet of Vehicles(IoV).However,intricate security challenges are intertwinedwith technological progress:Vehicular ad h...Wireless technology is transforming the future of transportation through the development of the Internet of Vehicles(IoV).However,intricate security challenges are intertwinedwith technological progress:Vehicular ad hoc Networks(VANETs),a core component of IoV,face security issues,particularly the Black Hole Attack(BHA).This malicious attack disrupts the seamless flow of data and threatens the network’s overall reliability;also,BHA strategically disrupts communication pathways by dropping data packets from legitimate nodes altogether.Recognizing the importance of this challenge,we have introduced a new solution called ad hoc On-Demand Distance Vector-Reputation-based mechanism Local Outlier Factor(AODV-RL).The significance of AODVRL lies in its unique approach:it verifies and confirms the trustworthiness of network components,providing robust protection against BHA.An additional safety layer is established by implementing the Local Outlier Factor(LOF),which detects and addresses abnormal network behaviors.Rigorous testing of our solution has revealed its remarkable ability to enhance communication in VANETs.Specifically,Our experimental results achieve message delivery ratios of up to 94.25%andminimal packet loss ratios of just 0.297%.Based on our experimental results,the proposedmechanismsignificantly improves VANET communication reliability and security.These results promise a more secure and dependable future for IoV,capable of transforming transportation safety and efficiency.展开更多
Quantum key distribution(QKD)is a technology that can resist the threat of quantum computers to existing conventional cryptographic protocols.However,due to the stringent requirements of the quantum key generation env...Quantum key distribution(QKD)is a technology that can resist the threat of quantum computers to existing conventional cryptographic protocols.However,due to the stringent requirements of the quantum key generation environment,the generated quantum keys are considered valuable,and the slow key generation rate conflicts with the high-speed data transmission in traditional optical networks.In this paper,for the QKD network with a trusted relay,which is mainly based on point-to-point quantum keys and has complex changes in network resources,we aim to allocate resources reasonably for data packet distribution.Firstly,we formulate a linear programming constraint model for the key resource allocation(KRA)problem based on the time-slot scheduling.Secondly,we propose a new scheduling scheme based on the graded key security requirements(GKSR)and a new micro-log key storage algorithm for effective storage and management of key resources.Finally,we propose a key resource consumption(KRC)routing optimization algorithm to properly allocate time slots,routes,and key resources.Simulation results show that the proposed scheme significantly improves the key distribution success rate and key resource utilization rate,among others.展开更多
We have suggested a novel multiport quantum router of single photons with reflection feedback, which is formed by three waveguides coupled with four single-mode microresonators. The single-photon routing probabilities...We have suggested a novel multiport quantum router of single photons with reflection feedback, which is formed by three waveguides coupled with four single-mode microresonators. The single-photon routing probabilities of four channels in the coupled system are studied theoretically by applying the real-space approach. Numerical results indicate that unidirectional routing in these output channels can be effectively implemented, and the router is tunable to route desired frequencies into the output ports, by varying the inter-resonator detunings via spinning resonator technology. Therefore, the proposed multichannel system can provide potential applications in optical quantum communication.展开更多
Flexible adaptation to differentiated quality of service(QoS)is quite important for future 6G network with a variety of services.Mobile ad hoc networks(MANETs)are able to provide flexible communication services to use...Flexible adaptation to differentiated quality of service(QoS)is quite important for future 6G network with a variety of services.Mobile ad hoc networks(MANETs)are able to provide flexible communication services to users through self-configuration and rapid deployment.However,the dynamic wireless environment,the limited resources,and complex QoS requirements have presented great challenges for network routing problems.Motivated by the development of artificial intelligence,a deep reinforcement learning-based collaborative routing(DRLCR)algorithm is proposed.Both routing policy and subchannel allocation are considered jointly,aiming at minimizing the end-to-end(E2E)delay and improving the network capacity.After sufficient training by the cluster head node,the Q-network can be synchronized to each member node to select the next hop based on local observation.Moreover,we improve the performance of training by considering historical observations,which can improve the adaptability of routing policies to dynamic environments.Simulation results show that the proposed DRLCR algorithm outperforms other algorithms in terms of resource utilization and E2E delay by optimizing network load to avoid congestion.In addition,the effectiveness of the routing policy in a dynamic environment is verified.展开更多
With the flexible deployment and high mobility of Unmanned Aerial Vehicles(UAVs)in an open environment,they have generated con-siderable attention in military and civil applications intending to enable ubiquitous conn...With the flexible deployment and high mobility of Unmanned Aerial Vehicles(UAVs)in an open environment,they have generated con-siderable attention in military and civil applications intending to enable ubiquitous connectivity and foster agile communications.The difficulty stems from features other than mobile ad-hoc network(MANET),namely aerial mobility in three-dimensional space and often changing topology.In the UAV network,a single node serves as a forwarding,transmitting,and receiving node at the same time.Typically,the communication path is multi-hop,and routing significantly affects the network’s performance.A lot of effort should be invested in performance analysis for selecting the optimum routing system.With this motivation,this study modelled a new Coati Optimization Algorithm-based Energy-Efficient Routing Process for Unmanned Aerial Vehicle Communication(COAER-UAVC)technique.The presented COAER-UAVC technique establishes effective routes for communication between the UAVs.It is primarily based on the coati characteristics in nature:if attacking and hunting iguanas and escaping from predators.Besides,the presented COAER-UAVC technique concentrates on the design of fitness functions to minimize energy utilization and communication delay.A varied group of simulations was performed to depict the optimum performance of the COAER-UAVC system.The experimental results verified that the COAER-UAVC technique had assured improved performance over other approaches.展开更多
Recently,vehicular ad hoc networks(VANETs)finds applicability in different domains such as security,rescue operations,intelligent transportation systems(ITS),etc.VANET has unique features like high mobility,limited mo...Recently,vehicular ad hoc networks(VANETs)finds applicability in different domains such as security,rescue operations,intelligent transportation systems(ITS),etc.VANET has unique features like high mobility,limited mobility patterns,adequate topologymodifications,and wireless communication.Despite the benefits of VANET,scalability is a challenging issue which could be addressed by the use of cluster-based routing techniques.It enables the vehicles to perform intercluster communication via chosen CHs and optimal routes.The main drawback of VANET network is the network unsteadiness that results in minimum lifetime.In order to avoid reduced network lifetime in VANET,this paper presents an enhanced metaheuristics based clustering with multihop routing technique for lifetime maximization(EMCMHR-LM)in VANET.The presented EMCMHR-LM model involves the procedure of arranging clusters,cluster head(CH)selection,and route selection appropriate for VANETs.The presentedEMCMHR-LMmodel uses slime mold optimization based clustering(SMO-C)technique to group the vehicles into clusters.Besides,an enhanced wild horse optimization based multihop routing(EWHO-MHR)protocol by the optimization of network parameters.The presented EMCMHR-LMmodel is simulated usingNetwork Simulator(NS3)tool and the simulation outcomes reported the enhanced performance of the proposed EMCMHR-LM technique over the other models.展开更多
The rise of automation with Machine-Type Communication(MTC)holds great potential in developing Industrial Internet of Things(IIoT)-based applications such as smart cities,Intelligent Transportation Systems(ITS),supply...The rise of automation with Machine-Type Communication(MTC)holds great potential in developing Industrial Internet of Things(IIoT)-based applications such as smart cities,Intelligent Transportation Systems(ITS),supply chains,and smart industries without any human intervention.However,MTC has to cope with significant security challenges due to heterogeneous data,public network connectivity,and inadequate security mechanism.To overcome the aforementioned issues,we have proposed a blockchain and garlic-routing-based secure data exchange framework,i.e.,GRADE,which alleviates the security constraints and maintains the stable connection in MTC.First,the Long-Short-Term Memory(LSTM)-based Nadam optimizer efficiently predicts the class label,i.e.,malicious and non-malicious,and forwards the non-malicious data requests of MTC to the Garlic Routing(GR)network.The GR network assigns a unique ElGamal encrypted session tag to each machine partaking in MTC.Then,an Advanced Encryption Standard(AES)is applied to encrypt the MTC data requests.Further,the InterPlanetary File System(IPFS)-based blockchain is employed to store the machine's session tags,which increases the scalability of the proposed GRADE framework.Additionally,the proposed framework has utilized the indispensable benefits of the 6G network to enhance the network performance of MTC.Lastly,the proposed GRADE framework is evaluated against different performance metrics such as scalability,packet loss,accuracy,and compromised rate of the MTC data request.The results show that the GRADE framework outperforms the baseline methods in terms of accuracy,i.e.,98.9%,compromised rate,i.e.,18.5%,scalability,i.e.,47.2%,and packet loss ratio,i.e.,24.3%.展开更多
基金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).
文摘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.
基金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.
基金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 optimize approximate method to distribute network traffic among multiple paths. It is combined to bandwidth resource 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 traffic allocation model, the conception of supply bandwidth and its’ allocation model, the principle of congestion restraint and its’ model, and the implement of AMR based on multi\|agents system in active network. Through simulations, AMR has distinct effects on network performance. The results show AMR is a valid traffic regulation algorithm.
基金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.
基金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 servers have been proposed for data center networks recently to provide high bisection bandwidth, but it remains challenging to fully utilize the high network capacity by appropriate multi-path routing algorithms. As flow-level path splitting may lead to traffic 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 leverages Open Flow to perform packet-level path splitting in a roundrobin 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 by53.65%, 343.31% and 348.25% respectively under production workload.
基金supported by the National Key Research and Development Program of China(No.2020YFB1806000)。
文摘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.
文摘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.
基金State Grid Corporation of China Science and Technology Project“Research andApplication of Key Technologies for Trusted Issuance and Security Control of Electronic Licenses for Power Business”(5700-202353318A-1-1-ZN).
文摘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.
文摘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.
基金the National Natural Science Foundation of China,GrantNumbers(62272007,62001007)the Natural Science Foundation of Beijing,GrantNumbers(4234083,4212018)The authors also acknowledge the support from King Khalid University for funding this research through the Large Group Project under Grant Number RGP.2/373/45.
文摘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.
文摘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.
文摘Wireless technology is transforming the future of transportation through the development of the Internet of Vehicles(IoV).However,intricate security challenges are intertwinedwith technological progress:Vehicular ad hoc Networks(VANETs),a core component of IoV,face security issues,particularly the Black Hole Attack(BHA).This malicious attack disrupts the seamless flow of data and threatens the network’s overall reliability;also,BHA strategically disrupts communication pathways by dropping data packets from legitimate nodes altogether.Recognizing the importance of this challenge,we have introduced a new solution called ad hoc On-Demand Distance Vector-Reputation-based mechanism Local Outlier Factor(AODV-RL).The significance of AODVRL lies in its unique approach:it verifies and confirms the trustworthiness of network components,providing robust protection against BHA.An additional safety layer is established by implementing the Local Outlier Factor(LOF),which detects and addresses abnormal network behaviors.Rigorous testing of our solution has revealed its remarkable ability to enhance communication in VANETs.Specifically,Our experimental results achieve message delivery ratios of up to 94.25%andminimal packet loss ratios of just 0.297%.Based on our experimental results,the proposedmechanismsignificantly improves VANET communication reliability and security.These results promise a more secure and dependable future for IoV,capable of transforming transportation safety and efficiency.
基金Project supported by the Natural Science Foundation of Jilin Province of China(Grant No.20210101417JC).
文摘Quantum key distribution(QKD)is a technology that can resist the threat of quantum computers to existing conventional cryptographic protocols.However,due to the stringent requirements of the quantum key generation environment,the generated quantum keys are considered valuable,and the slow key generation rate conflicts with the high-speed data transmission in traditional optical networks.In this paper,for the QKD network with a trusted relay,which is mainly based on point-to-point quantum keys and has complex changes in network resources,we aim to allocate resources reasonably for data packet distribution.Firstly,we formulate a linear programming constraint model for the key resource allocation(KRA)problem based on the time-slot scheduling.Secondly,we propose a new scheduling scheme based on the graded key security requirements(GKSR)and a new micro-log key storage algorithm for effective storage and management of key resources.Finally,we propose a key resource consumption(KRC)routing optimization algorithm to properly allocate time slots,routes,and key resources.Simulation results show that the proposed scheme significantly improves the key distribution success rate and key resource utilization rate,among others.
文摘We have suggested a novel multiport quantum router of single photons with reflection feedback, which is formed by three waveguides coupled with four single-mode microresonators. The single-photon routing probabilities of four channels in the coupled system are studied theoretically by applying the real-space approach. Numerical results indicate that unidirectional routing in these output channels can be effectively implemented, and the router is tunable to route desired frequencies into the output ports, by varying the inter-resonator detunings via spinning resonator technology. Therefore, the proposed multichannel system can provide potential applications in optical quantum communication.
基金supported by the 2020 National Key R&D Program"Broadband Communication and New Network"special"6G Network Architecture and Key Technologies"(2020YFB1806700)。
文摘Flexible adaptation to differentiated quality of service(QoS)is quite important for future 6G network with a variety of services.Mobile ad hoc networks(MANETs)are able to provide flexible communication services to users through self-configuration and rapid deployment.However,the dynamic wireless environment,the limited resources,and complex QoS requirements have presented great challenges for network routing problems.Motivated by the development of artificial intelligence,a deep reinforcement learning-based collaborative routing(DRLCR)algorithm is proposed.Both routing policy and subchannel allocation are considered jointly,aiming at minimizing the end-to-end(E2E)delay and improving the network capacity.After sufficient training by the cluster head node,the Q-network can be synchronized to each member node to select the next hop based on local observation.Moreover,we improve the performance of training by considering historical observations,which can improve the adaptability of routing policies to dynamic environments.Simulation results show that the proposed DRLCR algorithm outperforms other algorithms in terms of resource utilization and E2E delay by optimizing network load to avoid congestion.In addition,the effectiveness of the routing policy in a dynamic environment is verified.
基金The authors extend their appreciation to the Deanship of Scientific Research at King Khalid University for funding this work through Large Groups Project under grant number(235/44)Princess Nourah bint Abdulrahman University Researchers Supporting Project number(PNURSP2023R114)+1 种基金Princess Nourah bint Abdulrahman University,Riyadh,Saudi Arabia.The authors would like to thank the Deanship of Scientific Research at Umm Al-Qura University for supporting this work by Grant Code:(22UQU4310373DSR71)This study is supported via funding from Prince Sattam bin Abdulaziz University project number(PSAU/2023/R/1444).
文摘With the flexible deployment and high mobility of Unmanned Aerial Vehicles(UAVs)in an open environment,they have generated con-siderable attention in military and civil applications intending to enable ubiquitous connectivity and foster agile communications.The difficulty stems from features other than mobile ad-hoc network(MANET),namely aerial mobility in three-dimensional space and often changing topology.In the UAV network,a single node serves as a forwarding,transmitting,and receiving node at the same time.Typically,the communication path is multi-hop,and routing significantly affects the network’s performance.A lot of effort should be invested in performance analysis for selecting the optimum routing system.With this motivation,this study modelled a new Coati Optimization Algorithm-based Energy-Efficient Routing Process for Unmanned Aerial Vehicle Communication(COAER-UAVC)technique.The presented COAER-UAVC technique establishes effective routes for communication between the UAVs.It is primarily based on the coati characteristics in nature:if attacking and hunting iguanas and escaping from predators.Besides,the presented COAER-UAVC technique concentrates on the design of fitness functions to minimize energy utilization and communication delay.A varied group of simulations was performed to depict the optimum performance of the COAER-UAVC system.The experimental results verified that the COAER-UAVC technique had assured improved performance over other approaches.
文摘Recently,vehicular ad hoc networks(VANETs)finds applicability in different domains such as security,rescue operations,intelligent transportation systems(ITS),etc.VANET has unique features like high mobility,limited mobility patterns,adequate topologymodifications,and wireless communication.Despite the benefits of VANET,scalability is a challenging issue which could be addressed by the use of cluster-based routing techniques.It enables the vehicles to perform intercluster communication via chosen CHs and optimal routes.The main drawback of VANET network is the network unsteadiness that results in minimum lifetime.In order to avoid reduced network lifetime in VANET,this paper presents an enhanced metaheuristics based clustering with multihop routing technique for lifetime maximization(EMCMHR-LM)in VANET.The presented EMCMHR-LM model involves the procedure of arranging clusters,cluster head(CH)selection,and route selection appropriate for VANETs.The presentedEMCMHR-LMmodel uses slime mold optimization based clustering(SMO-C)technique to group the vehicles into clusters.Besides,an enhanced wild horse optimization based multihop routing(EWHO-MHR)protocol by the optimization of network parameters.The presented EMCMHR-LMmodel is simulated usingNetwork Simulator(NS3)tool and the simulation outcomes reported the enhanced performance of the proposed EMCMHR-LM technique over the other models.
文摘The rise of automation with Machine-Type Communication(MTC)holds great potential in developing Industrial Internet of Things(IIoT)-based applications such as smart cities,Intelligent Transportation Systems(ITS),supply chains,and smart industries without any human intervention.However,MTC has to cope with significant security challenges due to heterogeneous data,public network connectivity,and inadequate security mechanism.To overcome the aforementioned issues,we have proposed a blockchain and garlic-routing-based secure data exchange framework,i.e.,GRADE,which alleviates the security constraints and maintains the stable connection in MTC.First,the Long-Short-Term Memory(LSTM)-based Nadam optimizer efficiently predicts the class label,i.e.,malicious and non-malicious,and forwards the non-malicious data requests of MTC to the Garlic Routing(GR)network.The GR network assigns a unique ElGamal encrypted session tag to each machine partaking in MTC.Then,an Advanced Encryption Standard(AES)is applied to encrypt the MTC data requests.Further,the InterPlanetary File System(IPFS)-based blockchain is employed to store the machine's session tags,which increases the scalability of the proposed GRADE framework.Additionally,the proposed framework has utilized the indispensable benefits of the 6G network to enhance the network performance of MTC.Lastly,the proposed GRADE framework is evaluated against different performance metrics such as scalability,packet loss,accuracy,and compromised rate of the MTC data request.The results show that the GRADE framework outperforms the baseline methods in terms of accuracy,i.e.,98.9%,compromised rate,i.e.,18.5%,scalability,i.e.,47.2%,and packet loss ratio,i.e.,24.3%.