The low Earth orbit(LEO)satellite networks have outstanding advantages such as wide coverage area and not being limited by geographic environment,which can provide a broader range of communication services and has bec...The low Earth orbit(LEO)satellite networks have outstanding advantages such as wide coverage area and not being limited by geographic environment,which can provide a broader range of communication services and has become an essential supplement to the terrestrial network.However,the dynamic changes and uneven distribution of satellite network traffic inevitably bring challenges to multipath routing.Even worse,the harsh space environment often leads to incomplete collection of network state data for routing decision-making,which further complicates this challenge.To address this problem,this paper proposes a state-incomplete intelligent dynamic multipath routing algorithm(SIDMRA)to maximize network efficiency even with incomplete state data as input.Specifically,we model the multipath routing problem as a markov decision process(MDP)and then combine the deep deterministic policy gradient(DDPG)and the K shortest paths(KSP)algorithm to solve the optimal multipath routing policy.We use the temporal correlation of the satellite network state to fit the incomplete state data and then use the message passing neuron network(MPNN)for data enhancement.Simulation results show that the proposed algorithm outperforms baseline algorithms regarding average end-to-end delay and packet loss rate and performs stably under certain missing rates of state data.展开更多
In a post-disaster environment characterized by frequent interruptions in communication links,traditional wireless communication networks are ineffective.Although the“store-carry-forward”mechanism characteristic of ...In a post-disaster environment characterized by frequent interruptions in communication links,traditional wireless communication networks are ineffective.Although the“store-carry-forward”mechanism characteristic of Delay Tolerant Networks(DTNs)can transmit data from Internet of things devices to more reliable base stations or data centres,it also suffers from inefficient data transmission and excessive transmission delays.To address these challenges,we propose an intelligent routing strategy based on node sociability for post-disaster emergency network scenarios.First,we introduce an intelligent routing strategy based on node intimacy,which selects more suitable relay nodes and assigns the corresponding number of message copies based on comprehensive utility values.Second,we present an intelligent routing strategy based on geographical location of nodes to forward message replicas secondarily based on transmission utility values.Finally,experiments demonstrate the effectiveness of our proposed algorithm in terms of message delivery rate,network cost ratio and average transmission delay.展开更多
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.展开更多
Due to the diversified demands of quality of service（QoS） in volume multimedia application, QoS routings for multiservice are becoming a research hotspot in low earth orbit（LEO） satellite networks. A novel QoS sat...Due to the diversified demands of quality of service（QoS） in volume multimedia application, QoS routings for multiservice are becoming a research hotspot in low earth orbit（LEO） satellite networks. A novel QoS satellite routing algorithm for multi-class traffic is proposed. The goal of the routing algorithm is to provide the distinct QoS for different traffic classes and improve the utilization of network resources. Traffic is classified into three classes and allocated priorities based on their QoS requirements, respectively. A priority queuing mechanism guarantees the algorithm to work better for high-priority classes. In order to control the congestion, a blocking probability analysis model is built up based on the Markov process theory. Finally, according to the classification link-cost metrics, routings for different classes are calculated with the distinct QoS requirments and the status of network resource. Simulations verify the performance of the routing algorithm at different time and in different regions, and results demonstrate that the algorithm has great advantages in terms of the average delay and the blocking probability. Meanwhile, the robustness issue is also discussed.展开更多
The integrated information network is a large capacity information network that integrates various communication platforms on the ground, at sea, in the air and in the deep air through the inter-satellite and satellit...The integrated information network is a large capacity information network that integrates various communication platforms on the ground, at sea, in the air and in the deep air through the inter-satellite and satellite-ground links to acquire information accurately, process it quickly, and transmit it efficiently. The satellite communication, as an important part of integrated information networks, is one of main approaches to acquire, process and distribute communication information and resources. In this paper, based on current researches of the satellite communication network, we put forward a 3-layer satellite communication network model based on the Software Defined Network (SDN). Meanwhile, to improve current routing policies of the Low Earth Orbit (LEO) satellite communication network, we put forward an Adaptive Routing Algorithm (ARA) to sustain the shortest satellite communication link. Experiment results show that the proposed method can effectively reduce link distance and communication delay, and realize adaptive path planning.展开更多
In power communication networks, it is a challenge to decrease the risk of different services efficiently to improve operation reliability. One of the important factor in reflecting communication risk is service route...In power communication networks, it is a challenge to decrease the risk of different services efficiently to improve operation reliability. One of the important factor in reflecting communication risk is service route distribution. However, existing routing algorithms do not take into account the degree of importance of services, thereby leading to load unbalancing and increasing the risks of services and networks. A routing optimization mechanism based on load balancing for power communication networks is proposed to address the abovementioned problems. First, the mechanism constructs an evaluation model to evaluate the service and network risk degree using combination of devices, service load, and service characteristics. Second, service weights are determined with modified relative entropy TOPSIS method, and a balanced service routing determination algorithm is proposed. Results of simulations on practical network topology show that the mechanism can optimize the network risk degree and load balancing degree efficiently.展开更多
In this paper, we study transmission of packets with time constraints in cooperative 5G wireless networks. As we know, the packets which are transmitted with large delay become useless and have to be dropped. In order...In this paper, we study transmission of packets with time constraints in cooperative 5G wireless networks. As we know, the packets which are transmitted with large delay become useless and have to be dropped. In order to minimize packet dropping probability, we consider multiple transmission methods and integrate packet scheduling with adaptive network coding method selection. Firstly we introduce queue length to obtain the gain of network. Based on this, we present the dynamic coding-aware routing metric, which can increase potential coding opportunities. Moreover, we propose a distributed packet-aware transmission routing scheme based on the above routing metric, which can discover the available paths timely and efficiently. Simulation results show that the proposed method can reduce average packet dropping probability with lower computational complexity.展开更多
Software-Defined Networking(SDN)adapts logically-centralized control by decoupling control plane from data plane and provides the efficient use of network resources.However,due to the limitation of traditional routing...Software-Defined Networking(SDN)adapts logically-centralized control by decoupling control plane from data plane and provides the efficient use of network resources.However,due to the limitation of traditional routing strategies relying on manual configuration,SDN may suffer from link congestion and inefficient bandwidth allocation among flows,which could degrade network performance significantly.In this paper,we propose EARS,an intelligence-driven experiential network architecture for automatic routing.EARS adapts deep reinforcement learning(DRL)to simulate the human methods of learning experiential knowledge,employs the closed-loop network control mechanism incorporating with network monitoring technologies to realize the interaction with network environment.The proposed EARS can learn to make better control decision from its own experience by interacting with network environment and optimize the network intelligently by adjusting services and resources offered based on network requirements and environmental conditions.Under the network architecture,we design the network utility function with throughput and delay awareness,differentiate flows based on their size characteristics,and design a DDPGbased automatic routing algorithm as DRL decision brain to find the near-optimal paths for mice and elephant flows.To validate the network architecture,we implement it on a real network environment.Extensive simulation results show that EARS significantly improve the network throughput and reduces the average packet delay in comparison with baseline schemes(e.g.OSPF,ECMP).展开更多
Satellite networks have many inherent advantages over terrestrial networks and have become an important part of the global network infrastructure.Routing aimed at satellite networks has become a hot and challenging re...Satellite networks have many inherent advantages over terrestrial networks and have become an important part of the global network infrastructure.Routing aimed at satellite networks has become a hot and challenging research topic.Satellite networks,which are special kind of Delay Tolerant Networks(DTN),can also adopt the routing solutions of DTN.Among the many routing proposals,Contact Graph Routing(CGR) is an excellent candidate,since it is designed particularly for use in highly deterministic space networks.The applicability of CGR in satellite networks is evaluated by utilizing the space oriented DTN gateway model based on OPNET(Optimized Network Engineering Tool).Link failures are solved with neighbor discovery mechanism and route recomputation.Earth observation scenario is used in the simulations to investigate CGR's performance.The results show that the CGR performances are better in terms of effectively utilizing satellite networks resources to calculate continuous route path and alternative route can be successfully calculated under link failures by utilizing fault tolerance scheme.展开更多
Ship.to.ship, ship.to.shore radio links empowered by Wi Fi, Wi MAX etc have been recently exploited to build maritime multi.hop mesh networks to provide internet services to on.ship users. However, because of the mobi...Ship.to.ship, ship.to.shore radio links empowered by Wi Fi, Wi MAX etc have been recently exploited to build maritime multi.hop mesh networks to provide internet services to on.ship users. However, because of the mobility of the vessels/ships and the large inter.ship distances, nodes in the maritime network are frequently disconnected, forcing data communication in the maritime mesh networks to be opportunistic and delay.tolerant. In this paper, we present Lane Post, an optimization approach for maritime delay.tolerant routing protocol. We exploit the shipping lane information to predict the rendezvous opportunities of the ships to optimize the route selection in delay.tolerant routing. In particular, we show that when the shipping lane information is available, an opportunistic routing graph(ORG) for each ship can be constructed to predict its multi.hop data routing opportunities to the other ships or to the shore. Based on the ORG, we develop an optimal route protocol(i.e., Lane Post) for each ship to minimize its delay of multi.hop packet delivery via dynamic programming. We discussed the ways of collecting shipping lane information by centralized method or distributed method.The proposed Lane Post protocol was evaluated by ONE, an open.source delay.tolerant network simulator, which shows its dramatic performance improvement in terms of delay reduction compared to the state.of.the.art opportunistic routing protocols.展开更多
With the increasing deployment of wireless sensordevices and networks,security becomes a criticalchallenge for sensor networks.In this paper,a schemeusing data mining is proposed for routing anomalydetection in wirele...With the increasing deployment of wireless sensordevices and networks,security becomes a criticalchallenge for sensor networks.In this paper,a schemeusing data mining is proposed for routing anomalydetection in wireless sensor networks.The schemeuses the Apriori algorithm to extract traffic patternsfrom both routing table and network traffic packetsand subsequently the K-means cluster algorithmadaptively generates a detection model.Through thecombination of these two algorithms,routing attackscan be detected effectively and automatically.Themain advantage of the proposed approach is that it isable to detect new attacks that have not previouslybeen seen.Moreover,the proposed detection schemeis based on no priori knowledge and then can beapplied to a wide range of different sensor networksfor a variety of routing attacks.展开更多
Underground mining is a hazardous industrial activity. In order to provide a safe working environment for miners, a Wireless Sensor Network (WSN) technology has been used for security monitoring. It can provide a wide...Underground mining is a hazardous industrial activity. In order to provide a safe working environment for miners, a Wireless Sensor Network (WSN) technology has been used for security monitoring. It can provide a wide range of surveillance with a relatively low cost. In this study, an Energy-Based Multipath Routing (EBMR) protocol is proposed, which considers residual energy capacity and link quality in choosing hops and routing paths. Hops and paths with a high residual energy capacity and link quality will have the best chance to be selected to transmit data packages. Since the EBMR stores several routes in the routing table, when the current path fails, another path will be chosen to fulfill the task immediately. In this way, EBMR improves reliability and decrease time latency. Compared to AOMDV and REAR, EBMR decreases time latency by 51% and 12%.展开更多
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.展开更多
A multipath source self repair routing (MSSRR) algorithm for mobile ad hoc networks is proposed. By using multiple paths which can be repaired by themselves to transmit packets alternately, the network's load is b...A multipath source self repair routing (MSSRR) algorithm for mobile ad hoc networks is proposed. By using multiple paths which can be repaired by themselves to transmit packets alternately, the network's load is balanced, the link state in the network can be checked in time, the number of the times the route discovery mechanism starts is decreased. If only one route which will be broken can be used to transmit the packets, the route discovery mechanism is restarted.The algorithm is implemented on the basis of dynamic source routing (DSR). The effect of MSSRR on lifetime of the access from the source to the destination and the overhead is discussed. Compared with the performance of DSR,it can be seen that the algorithm can improve the performance of the network obviously and the overhead almost does not increase if the average hop count is larger.展开更多
A prediction-aided routing algorithm based on ant colony optimization mode （PRACO） to achieve energy-aware data-gathering routing structure in wireless sensor networks （WSN） is presented. We adopt autoregressive m...A prediction-aided routing algorithm based on ant colony optimization mode （PRACO） to achieve energy-aware data-gathering routing structure in wireless sensor networks （WSN） is presented. We adopt autoregressive moving average model （ARMA） to predict dynamic tendency in data traffic and deduce the construction of load factor, which can help to reveal the future energy status of sensor in WSN. By checking the load factor in heuristic factor and guided by novel pheromone updating rule, multi-agent, i. e. , artificial ants, can adaptively foresee the local energy state of networks and the corresponding actions could be taken to enhance the energy efficiency in routing construction. Compared with some classic energy-saving routing schemes, the simulation results show that the proposed routing building scheme can ① effectively reinforce the robustness of routing structure by mining the temporal associability and introducing multi-agent optimization to balance the total energy cost for data transmission, ② minimize the total communication consumption, and ③prolong the lifetime of networks.展开更多
Wireless Mesh Network （WMN） is seen as an effective Intemet access solution for dynamic wireless applications. For the low mobility of mesh routers in WMN, the backbone topography can be effectively maintained by pr...Wireless Mesh Network （WMN） is seen as an effective Intemet access solution for dynamic wireless applications. For the low mobility of mesh routers in WMN, the backbone topography can be effectively maintained by proactive routing protocol. Pre-proposals like Tree Based Routing （TBR） protocol and Root Driven Routing （RDR） protocol are so centralized that they make the gateway becorre a bottleneck which severely restricts the network performance. We proposed an Optimized Tree-based Routing （OTR） protocol that logically separated the proactive tree into pieces. Route is partly computed by the branches instead of root. We also discussed the operation of multipie Intemet gateways which is a main issue in WMN. The new proposal lightens the load in root, reduces the overhead and improves the throughput. Numerical analysis and simulation results confirm that the perforrmnce of WMN is improved and OTR is more suitable for large scale WMN.展开更多
Due to the increasing number of wireless mobile devices,the possibility of mobile communications without infrastructure becomes a reality.The Decentralized Mobile Social Network(DMSN) is a paradigm where nodes can mov...Due to the increasing number of wireless mobile devices,the possibility of mobile communications without infrastructure becomes a reality.The Decentralized Mobile Social Network(DMSN) is a paradigm where nodes can move freely and organize themselves arbitrarily.Routing in these environments is difficult for the reason of the rapid changes of the social relationship graph's topology.Meanwhile,the social ties among nodes change overtime.Therefore,an efficient data forwarding mechanism should be considered over the temporal weighted relationship graph.In this paper,an Advanced routing Protocol based on Parameters Optimization in the Weighted mobile social network(APPOW) is proposed to improve the delivery success ratio and reduce the cost of exchanging information.APPOW combines the normalized relative weights of three local social metrics,i.e.,LinkRank,similarity and contact strength,to select the next relay node.The weights of the three metrics are derived by pair-wise learning algorithm.The result shows that APPOW outperforms the state-ofthe-art SimBet Routing in delivering message and significantly reduces the average hops.Additionally,the delivery performance of APPOW is close to Epidemic Routing but without message duplications.展开更多
Energy efficiency is an important criterion for routing algorithms in the wireless sensor network. Cooperative routing can reduce energy consumption effectively stemming from its diversity gain advantage. To solve the...Energy efficiency is an important criterion for routing algorithms in the wireless sensor network. Cooperative routing can reduce energy consumption effectively stemming from its diversity gain advantage. To solve the energy consumption problem and maximize the network lifetime, this paper proposes a Virtual Multiple Input Multiple Output based Cooperative Routing algorithm(VMIMOCR). VMIMOCR chooses cooperative relay nodes based on Virtual Multiple Input Multiple Output Model, and balances energy consumption by reasonable power allocation among transmitters, and decides the forwarding path finally. The experimental results show that VMIMOCR can improve network lifetime from 37% to 348% in the medium node density, compared with existing routing algorithms.展开更多
Due to the heterogeneity of the structure on a scale-free network, making the betweennesses of all nodes become homogeneous by reassigning the weights of nodes or edges is very difficult. In order to take advantage of...Due to the heterogeneity of the structure on a scale-free network, making the betweennesses of all nodes become homogeneous by reassigning the weights of nodes or edges is very difficult. In order to take advantage of the important effect of high degree nodes on the shortest path communication and preferentially deliver packets by them to increase the probability to destination, an adaptive local routing strategy on a scale-free network is proposed, in which the node adjusts the forwarding probability with the dynamical traffic load （packet queue length） and the degree distribution of neighbouring nodes. The critical queue length of a node is set to be proportional to its degree, and the node with high degree has a larger critical queue length to store and forward more packets. When the queue length of a high degree node is shorter than its critical queue length, it has a higher probability to forward packets. After higher degree nodes are saturated （whose queue lengths are longer than their critical queue lengths）, more packets will be delivered by the lower degree nodes around them. The adaptive local routing strategy increases the probability of a packet finding its destination quickly, and improves the transmission capacity on the scale-free network by reducing routing hops. The simulation results show that the transmission capacity of the adaptive local routing strategy is larger than that of three previous local routing strategies.展开更多
The routing protocols are paramount to guarantee the Quality of Service(QoS)for Flying Ad Hoc Networks(FANETs).However,they still face several challenges owing to high mobility and dynamic topology.This paper mainly f...The routing protocols are paramount to guarantee the Quality of Service(QoS)for Flying Ad Hoc Networks(FANETs).However,they still face several challenges owing to high mobility and dynamic topology.This paper mainly focuses on the adaptive routing protocol and proposes a Three Dimensional Q-Learning(3DQ)based routing protocol to guarantee the packet delivery ratio and improve the QoS.In 3DQ routing,we propose a Q-Learning based routing decision scheme,which contains a link-state prediction module and routing decision module.The link-state prediction module allows each Unmanned Aerial Vehicle(UAV)to predict the link-state of Neighboring UAVs(NUs),considering their Three Dimensional mobility and packet arrival.Then,UAV can produce routing decisions with the help of the routing decision module considering the link-state.We evaluate the various performance of 3DQ routing,and simulation results demonstrate that 3DQ can improve packet delivery ratio,goodput and delay of baseline protocol at most 71.36%,89.32%and 83.54%in FANETs over a variety of communication scenarios.展开更多
文摘The low Earth orbit(LEO)satellite networks have outstanding advantages such as wide coverage area and not being limited by geographic environment,which can provide a broader range of communication services and has become an essential supplement to the terrestrial network.However,the dynamic changes and uneven distribution of satellite network traffic inevitably bring challenges to multipath routing.Even worse,the harsh space environment often leads to incomplete collection of network state data for routing decision-making,which further complicates this challenge.To address this problem,this paper proposes a state-incomplete intelligent dynamic multipath routing algorithm(SIDMRA)to maximize network efficiency even with incomplete state data as input.Specifically,we model the multipath routing problem as a markov decision process(MDP)and then combine the deep deterministic policy gradient(DDPG)and the K shortest paths(KSP)algorithm to solve the optimal multipath routing policy.We use the temporal correlation of the satellite network state to fit the incomplete state data and then use the message passing neuron network(MPNN)for data enhancement.Simulation results show that the proposed algorithm outperforms baseline algorithms regarding average end-to-end delay and packet loss rate and performs stably under certain missing rates of state data.
基金funded by the Researchers Supporting Project Number RSPD2024R681,King Saud University,Riyadh,Saudi Arabia.
文摘In a post-disaster environment characterized by frequent interruptions in communication links,traditional wireless communication networks are ineffective.Although the“store-carry-forward”mechanism characteristic of Delay Tolerant Networks(DTNs)can transmit data from Internet of things devices to more reliable base stations or data centres,it also suffers from inefficient data transmission and excessive transmission delays.To address these challenges,we propose an intelligent routing strategy based on node sociability for post-disaster emergency network scenarios.First,we introduce an intelligent routing strategy based on node intimacy,which selects more suitable relay nodes and assigns the corresponding number of message copies based on comprehensive utility values.Second,we present an intelligent routing strategy based on geographical location of nodes to forward message replicas secondarily based on transmission utility values.Finally,experiments demonstrate the effectiveness of our proposed algorithm in terms of message delivery rate,network cost ratio and average transmission delay.
基金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.
基金Supported by the National High Technology Research and Development Program of China(″863″Program)(2010AAxxx404)~~
文摘Due to the diversified demands of quality of service（QoS） in volume multimedia application, QoS routings for multiservice are becoming a research hotspot in low earth orbit（LEO） satellite networks. A novel QoS satellite routing algorithm for multi-class traffic is proposed. The goal of the routing algorithm is to provide the distinct QoS for different traffic classes and improve the utilization of network resources. Traffic is classified into three classes and allocated priorities based on their QoS requirements, respectively. A priority queuing mechanism guarantees the algorithm to work better for high-priority classes. In order to control the congestion, a blocking probability analysis model is built up based on the Markov process theory. Finally, according to the classification link-cost metrics, routings for different classes are calculated with the distinct QoS requirments and the status of network resource. Simulations verify the performance of the routing algorithm at different time and in different regions, and results demonstrate that the algorithm has great advantages in terms of the average delay and the blocking probability. Meanwhile, the robustness issue is also discussed.
基金supported in part by the National Natural Science Foundation of China (No. 61571104)the Sichuan Science and Technology Program (No. 2018JY0539)+2 种基金the Key projects of the Sichuan Provincial Education Department (No. 18ZA0219)the Fundamental Research Funds for the Central Universities (No. ZYGX2017KYQD170)the Innovation Funding (No. 2018510007000134)
文摘The integrated information network is a large capacity information network that integrates various communication platforms on the ground, at sea, in the air and in the deep air through the inter-satellite and satellite-ground links to acquire information accurately, process it quickly, and transmit it efficiently. The satellite communication, as an important part of integrated information networks, is one of main approaches to acquire, process and distribute communication information and resources. In this paper, based on current researches of the satellite communication network, we put forward a 3-layer satellite communication network model based on the Software Defined Network (SDN). Meanwhile, to improve current routing policies of the Low Earth Orbit (LEO) satellite communication network, we put forward an Adaptive Routing Algorithm (ARA) to sustain the shortest satellite communication link. Experiment results show that the proposed method can effectively reduce link distance and communication delay, and realize adaptive path planning.
基金supported by the State Grid project which names the simulation and service quality evaluation technology research of power communication network(No.XX71-14-046)
文摘In power communication networks, it is a challenge to decrease the risk of different services efficiently to improve operation reliability. One of the important factor in reflecting communication risk is service route distribution. However, existing routing algorithms do not take into account the degree of importance of services, thereby leading to load unbalancing and increasing the risks of services and networks. A routing optimization mechanism based on load balancing for power communication networks is proposed to address the abovementioned problems. First, the mechanism constructs an evaluation model to evaluate the service and network risk degree using combination of devices, service load, and service characteristics. Second, service weights are determined with modified relative entropy TOPSIS method, and a balanced service routing determination algorithm is proposed. Results of simulations on practical network topology show that the mechanism can optimize the network risk degree and load balancing degree efficiently.
基金supported by National Nature Science Foundation of China (61302071, 61501105, 91438110)the Fundamental Research Funds for the Central Universities (N150404015, N150404018)
文摘In this paper, we study transmission of packets with time constraints in cooperative 5G wireless networks. As we know, the packets which are transmitted with large delay become useless and have to be dropped. In order to minimize packet dropping probability, we consider multiple transmission methods and integrate packet scheduling with adaptive network coding method selection. Firstly we introduce queue length to obtain the gain of network. Based on this, we present the dynamic coding-aware routing metric, which can increase potential coding opportunities. Moreover, we propose a distributed packet-aware transmission routing scheme based on the above routing metric, which can discover the available paths timely and efficiently. Simulation results show that the proposed method can reduce average packet dropping probability with lower computational complexity.
基金supported by the National Natural Science Foundation of China for Innovative Research Groups (61521003)the National Natural Science Foundation of China (61872382)+1 种基金the National Key Research and Development Program of China (2017YFB0803204)the Research and Development Program in Key Areas of Guangdong Province (No.2018B010113001)
文摘Software-Defined Networking(SDN)adapts logically-centralized control by decoupling control plane from data plane and provides the efficient use of network resources.However,due to the limitation of traditional routing strategies relying on manual configuration,SDN may suffer from link congestion and inefficient bandwidth allocation among flows,which could degrade network performance significantly.In this paper,we propose EARS,an intelligence-driven experiential network architecture for automatic routing.EARS adapts deep reinforcement learning(DRL)to simulate the human methods of learning experiential knowledge,employs the closed-loop network control mechanism incorporating with network monitoring technologies to realize the interaction with network environment.The proposed EARS can learn to make better control decision from its own experience by interacting with network environment and optimize the network intelligently by adjusting services and resources offered based on network requirements and environmental conditions.Under the network architecture,we design the network utility function with throughput and delay awareness,differentiate flows based on their size characteristics,and design a DDPGbased automatic routing algorithm as DRL decision brain to find the near-optimal paths for mice and elephant flows.To validate the network architecture,we implement it on a real network environment.Extensive simulation results show that EARS significantly improve the network throughput and reduces the average packet delay in comparison with baseline schemes(e.g.OSPF,ECMP).
基金Supported by the open project of Communication network transmission and distribution technologies Key Laboratory(ITD-12005/K1260011)the National Natural Science Foundation of China(61371126) and the National Natural Science Foundation of China(60903195)
文摘Satellite networks have many inherent advantages over terrestrial networks and have become an important part of the global network infrastructure.Routing aimed at satellite networks has become a hot and challenging research topic.Satellite networks,which are special kind of Delay Tolerant Networks(DTN),can also adopt the routing solutions of DTN.Among the many routing proposals,Contact Graph Routing(CGR) is an excellent candidate,since it is designed particularly for use in highly deterministic space networks.The applicability of CGR in satellite networks is evaluated by utilizing the space oriented DTN gateway model based on OPNET(Optimized Network Engineering Tool).Link failures are solved with neighbor discovery mechanism and route recomputation.Earth observation scenario is used in the simulations to investigate CGR's performance.The results show that the CGR performances are better in terms of effectively utilizing satellite networks resources to calculate continuous route path and alternative route can be successfully calculated under link failures by utilizing fault tolerance scheme.
基金supported in part by National Natural Science Foundation of China Grant 61672524the Fundamental Research Funds for the Central University+1 种基金the Research Funds of Renmin University of China, 2015030273National Key Technology Support Program 2014BAK12B06
文摘Ship.to.ship, ship.to.shore radio links empowered by Wi Fi, Wi MAX etc have been recently exploited to build maritime multi.hop mesh networks to provide internet services to on.ship users. However, because of the mobility of the vessels/ships and the large inter.ship distances, nodes in the maritime network are frequently disconnected, forcing data communication in the maritime mesh networks to be opportunistic and delay.tolerant. In this paper, we present Lane Post, an optimization approach for maritime delay.tolerant routing protocol. We exploit the shipping lane information to predict the rendezvous opportunities of the ships to optimize the route selection in delay.tolerant routing. In particular, we show that when the shipping lane information is available, an opportunistic routing graph(ORG) for each ship can be constructed to predict its multi.hop data routing opportunities to the other ships or to the shore. Based on the ORG, we develop an optimal route protocol(i.e., Lane Post) for each ship to minimize its delay of multi.hop packet delivery via dynamic programming. We discussed the ways of collecting shipping lane information by centralized method or distributed method.The proposed Lane Post protocol was evaluated by ONE, an open.source delay.tolerant network simulator, which shows its dramatic performance improvement in terms of delay reduction compared to the state.of.the.art opportunistic routing protocols.
基金the supports of the National Natural Science Foundation of China (60403027) the projects of science and research plan of Hubei provincial department of education (2003A011)the Natural Science Foundation Of Hubei Province of China (2005ABA243).
文摘With the increasing deployment of wireless sensordevices and networks,security becomes a criticalchallenge for sensor networks.In this paper,a schemeusing data mining is proposed for routing anomalydetection in wireless sensor networks.The schemeuses the Apriori algorithm to extract traffic patternsfrom both routing table and network traffic packetsand subsequently the K-means cluster algorithmadaptively generates a detection model.Through thecombination of these two algorithms,routing attackscan be detected effectively and automatically.Themain advantage of the proposed approach is that it isable to detect new attacks that have not previouslybeen seen.Moreover,the proposed detection schemeis based on no priori knowledge and then can beapplied to a wide range of different sensor networksfor a variety of routing attacks.
基金Financial support for this study, provided by the National Natural Science Foundation of China (No.60674002) the Science and Technology Research of the Ministry of Railways of China (No. 2006x006-E), is gratefully acknowledged
文摘Underground mining is a hazardous industrial activity. In order to provide a safe working environment for miners, a Wireless Sensor Network (WSN) technology has been used for security monitoring. It can provide a wide range of surveillance with a relatively low cost. In this study, an Energy-Based Multipath Routing (EBMR) protocol is proposed, which considers residual energy capacity and link quality in choosing hops and routing paths. Hops and paths with a high residual energy capacity and link quality will have the best chance to be selected to transmit data packages. Since the EBMR stores several routes in the routing table, when the current path fails, another path will be chosen to fulfill the task immediately. In this way, EBMR improves reliability and decrease time latency. Compared to AOMDV and REAR, EBMR decreases time latency by 51% and 12%.
文摘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.
文摘A multipath source self repair routing (MSSRR) algorithm for mobile ad hoc networks is proposed. By using multiple paths which can be repaired by themselves to transmit packets alternately, the network's load is balanced, the link state in the network can be checked in time, the number of the times the route discovery mechanism starts is decreased. If only one route which will be broken can be used to transmit the packets, the route discovery mechanism is restarted.The algorithm is implemented on the basis of dynamic source routing (DSR). The effect of MSSRR on lifetime of the access from the source to the destination and the overhead is discussed. Compared with the performance of DSR,it can be seen that the algorithm can improve the performance of the network obviously and the overhead almost does not increase if the average hop count is larger.
基金Supported by the National Natural Science Foundation of China(60802005,60965002,50803016)Science Foundation forthe Excellent Youth Scholars at East China University of Science and Technology(YH0157127)Undergraduate Innovational Experimentation Program in ECUST(X1033)
文摘A prediction-aided routing algorithm based on ant colony optimization mode （PRACO） to achieve energy-aware data-gathering routing structure in wireless sensor networks （WSN） is presented. We adopt autoregressive moving average model （ARMA） to predict dynamic tendency in data traffic and deduce the construction of load factor, which can help to reveal the future energy status of sensor in WSN. By checking the load factor in heuristic factor and guided by novel pheromone updating rule, multi-agent, i. e. , artificial ants, can adaptively foresee the local energy state of networks and the corresponding actions could be taken to enhance the energy efficiency in routing construction. Compared with some classic energy-saving routing schemes, the simulation results show that the proposed routing building scheme can ① effectively reinforce the robustness of routing structure by mining the temporal associability and introducing multi-agent optimization to balance the total energy cost for data transmission, ② minimize the total communication consumption, and ③prolong the lifetime of networks.
基金Acknowledgements This paper was supported by the Major National Science and Technology program under Grant No. 2011ZX03005-002 the National Natural Science Foundation of China under Grant No. 61100233 the Fundamental Universities under Grant No Research Funds for the Central K50510030010.
文摘Wireless Mesh Network （WMN） is seen as an effective Intemet access solution for dynamic wireless applications. For the low mobility of mesh routers in WMN, the backbone topography can be effectively maintained by proactive routing protocol. Pre-proposals like Tree Based Routing （TBR） protocol and Root Driven Routing （RDR） protocol are so centralized that they make the gateway becorre a bottleneck which severely restricts the network performance. We proposed an Optimized Tree-based Routing （OTR） protocol that logically separated the proactive tree into pieces. Route is partly computed by the branches instead of root. We also discussed the operation of multipie Intemet gateways which is a main issue in WMN. The new proposal lightens the load in root, reduces the overhead and improves the throughput. Numerical analysis and simulation results confirm that the perforrmnce of WMN is improved and OTR is more suitable for large scale WMN.
基金supported by NSFC (Grant No. 61172074, 61471028, 61371069, and 61272505)Fundamental Research Funds for the Central Universities under Grant No. 2015JBM016+1 种基金the Research Fund for the Doctoral Program of Higher Education of China under Grant No.20130009110015the financial support from China Scholarship Council
文摘Due to the increasing number of wireless mobile devices,the possibility of mobile communications without infrastructure becomes a reality.The Decentralized Mobile Social Network(DMSN) is a paradigm where nodes can move freely and organize themselves arbitrarily.Routing in these environments is difficult for the reason of the rapid changes of the social relationship graph's topology.Meanwhile,the social ties among nodes change overtime.Therefore,an efficient data forwarding mechanism should be considered over the temporal weighted relationship graph.In this paper,an Advanced routing Protocol based on Parameters Optimization in the Weighted mobile social network(APPOW) is proposed to improve the delivery success ratio and reduce the cost of exchanging information.APPOW combines the normalized relative weights of three local social metrics,i.e.,LinkRank,similarity and contact strength,to select the next relay node.The weights of the three metrics are derived by pair-wise learning algorithm.The result shows that APPOW outperforms the state-ofthe-art SimBet Routing in delivering message and significantly reduces the average hops.Additionally,the delivery performance of APPOW is close to Epidemic Routing but without message duplications.
基金supported by the National Basic Research Program of China (973 program) (Grant No.2012CB315805)the National Natural Science Foundation of China (Grant No.61472130 and 61572184)
文摘Energy efficiency is an important criterion for routing algorithms in the wireless sensor network. Cooperative routing can reduce energy consumption effectively stemming from its diversity gain advantage. To solve the energy consumption problem and maximize the network lifetime, this paper proposes a Virtual Multiple Input Multiple Output based Cooperative Routing algorithm(VMIMOCR). VMIMOCR chooses cooperative relay nodes based on Virtual Multiple Input Multiple Output Model, and balances energy consumption by reasonable power allocation among transmitters, and decides the forwarding path finally. The experimental results show that VMIMOCR can improve network lifetime from 37% to 348% in the medium node density, compared with existing routing algorithms.
基金Project supported in part by the National Natural Science Foundation of China (Grant Nos. 60872011 and 60502017)the State Key Development Program for Basic Research of China (Grant Nos. 2009CB320504 and 2010CB731800)Program for New Century Excellent Talents in University
文摘Due to the heterogeneity of the structure on a scale-free network, making the betweennesses of all nodes become homogeneous by reassigning the weights of nodes or edges is very difficult. In order to take advantage of the important effect of high degree nodes on the shortest path communication and preferentially deliver packets by them to increase the probability to destination, an adaptive local routing strategy on a scale-free network is proposed, in which the node adjusts the forwarding probability with the dynamical traffic load （packet queue length） and the degree distribution of neighbouring nodes. The critical queue length of a node is set to be proportional to its degree, and the node with high degree has a larger critical queue length to store and forward more packets. When the queue length of a high degree node is shorter than its critical queue length, it has a higher probability to forward packets. After higher degree nodes are saturated （whose queue lengths are longer than their critical queue lengths）, more packets will be delivered by the lower degree nodes around them. The adaptive local routing strategy increases the probability of a packet finding its destination quickly, and improves the transmission capacity on the scale-free network by reducing routing hops. The simulation results show that the transmission capacity of the adaptive local routing strategy is larger than that of three previous local routing strategies.
基金This work is supported in part by the National Natural Science Foundation of China under Grant No.61931011in part by the National Key Research and Development Project of China under Grant No.2018YFB1800801+2 种基金in part by the Primary Research&Development plan of Jiangsu Province under Grant BE2021013-4in part by the National Natural Science Foundation of China under Grants No.61827801 and 61631020the China Scholarship Council(CSC)Grant 202006830072.
文摘The routing protocols are paramount to guarantee the Quality of Service(QoS)for Flying Ad Hoc Networks(FANETs).However,they still face several challenges owing to high mobility and dynamic topology.This paper mainly focuses on the adaptive routing protocol and proposes a Three Dimensional Q-Learning(3DQ)based routing protocol to guarantee the packet delivery ratio and improve the QoS.In 3DQ routing,we propose a Q-Learning based routing decision scheme,which contains a link-state prediction module and routing decision module.The link-state prediction module allows each Unmanned Aerial Vehicle(UAV)to predict the link-state of Neighboring UAVs(NUs),considering their Three Dimensional mobility and packet arrival.Then,UAV can produce routing decisions with the help of the routing decision module considering the link-state.We evaluate the various performance of 3DQ routing,and simulation results demonstrate that 3DQ can improve packet delivery ratio,goodput and delay of baseline protocol at most 71.36%,89.32%and 83.54%in FANETs over a variety of communication scenarios.
