Opportunistic Mobile Social Networks(OMSNs)are kind of Delay Tolerant Networks(DTNs)that leverage characteristics of Mobile Ad Hoc Networks(MANETs)and Social Networks,particularly the social features,to boost performa...Opportunistic Mobile Social Networks(OMSNs)are kind of Delay Tolerant Networks(DTNs)that leverage characteristics of Mobile Ad Hoc Networks(MANETs)and Social Networks,particularly the social features,to boost performance of routing algorithms.Users in OMSNs communicate to share and disseminate data to meet needs for variety of applications.Such networks have attracted tremendous attention lately due to the data transmission requirement from emerging applications such as IoT and smart city initiatives.Devices carried by human is the carrier of message transmission,so the social features of human can be used to improve the ability of data transmission.In this paper,we conduct a comparative survey on routing algorithms in OMSNs.We first analyze routing algorithms based on three social features.Since node selfishness is not really considered previously in aforementioned routing algorithms,but has significant impact on network performance,we treat node selfishness as another social feature,classify and elaborate routing algorithms based on incentive mechanism.To assess the impact of social features on routing algorithms,we conducted simulation for six routing algorithms and analyzed the simulation result.Finally,we conclude the paper with challenges on design of routing in OMSNs and point out some future research directions.展开更多
Routing algorithms based on geographical location is an important research subject in the Wireless Sensor Network(WSN).They use location information to guide routing discovery and maintenance as well as packet forward...Routing algorithms based on geographical location is an important research subject in the Wireless Sensor Network(WSN).They use location information to guide routing discovery and maintenance as well as packet forwarding,thus enabling the best routing to be selected,reducing energy consumption and optimizing the whole network.Through three aspects involving the flooding restriction scheme,the virtual area partition scheme and the best routing choice scheme,the importance of location information is seen in the routing algorithm.展开更多
Quantum transmission experiments have shown that the success-ful transmission rate of entangled quanta in optical fibers decreases expo-nentially.Although current quantum networks deploy quantum relays to establish lo...Quantum transmission experiments have shown that the success-ful transmission rate of entangled quanta in optical fibers decreases expo-nentially.Although current quantum networks deploy quantum relays to establish long-distance connections,the increase in transmission distance and entanglement switching costs still need to be considered when selecting the next hop.However,most of the existing quantum network models prefer to consider the parameters of the physical layer,which ignore the influence factors of the network layer.In this paper,we propose a meshy quantum network model based on quantum teleportation,which considers both net-work layer and physical layer parameters.The proposed model can reflect the realistic transmission characteristics and morphological characteristics of the quantum relay network.Then,we study the network throughput of different routing algorithms with the same given parameters when multiple source-destination pairs are interconnected simultaneously.To solve the chal-lenges of routing competition caused by the simultaneous transmission,we present greedy memory-occupied algorithm Q-GMOA and random memory-occupied algorithm Q-RMOA.The proposed meshy quantum network model and the memory-occupied routing algorithms can improve the utilization rate of resources and the transmission performance of the quantum network.And the evaluation results indicate that the proposed methods embrace a higher transmission rate than the previous methods with repeater occupation.展开更多
Nowadays the number of cores that are integrated into NoC (Network on Chip) systems is steadily increasing, and real application traffic, running in such multi-core environments requires more and more bandwidth. In th...Nowadays the number of cores that are integrated into NoC (Network on Chip) systems is steadily increasing, and real application traffic, running in such multi-core environments requires more and more bandwidth. In that sense, NoC architectures should be properly designed so as to provide efficient traffic engineering, as well as QoS support. Routing algorithm choice in conjunction with other parameters, such as network size and topology, traffic features (time and spatial distribution), as well as packet injection rate, packet size, and buffering capability, are all equivalently critical for designing a robust NoC architecture, on the grounds of traffic engineering and QoS provision. In this paper, a thorough numerical investigation is achieved by taking into consideration the criticality of selecting the proper routing algorithm, in conjunction with all the other aforementioned parameters. This is done via implementation of four routing evaluation traffic scenarios varying each parameter either individually, or as a set, thus exhausting all possible combinations, and making compact decisions on proper routing algorithm selection in NoC architectures. It has been shown that the simplicity of a deterministic routing algorithm such as XY, seems to be a reasonable choice, not only for random traffic patterns but also for non-uniform distributed traffic patterns, in terms of delay and throughput for 2D mesh NoC systems.展开更多
Low Earth orbit(LEO)satellite networks exhibit distinct characteristics,e.g.,limited resources of individual satellite nodes and dynamic network topology,which have brought many challenges for routing algorithms.To sa...Low Earth orbit(LEO)satellite networks exhibit distinct characteristics,e.g.,limited resources of individual satellite nodes and dynamic network topology,which have brought many challenges for routing algorithms.To satisfy quality of service(QoS)requirements of various users,it is critical to research efficient routing strategies to fully utilize satellite resources.This paper proposes a multi-QoS information optimized routing algorithm based on reinforcement learning for LEO satellite networks,which guarantees high level assurance demand services to be prioritized under limited satellite resources while considering the load balancing performance of the satellite networks for low level assurance demand services to ensure the full and effective utilization of satellite resources.An auxiliary path search algorithm is proposed to accelerate the convergence of satellite routing algorithm.Simulation results show that the generated routing strategy can timely process and fully meet the QoS demands of high assurance services while effectively improving the load balancing performance of the link.展开更多
Based on Petersen graph, a new interconnection network, the RP(k) network, is devel-oped and the properties of the RP(k) network are investigated. The diameter of the RP(k) network is [ k/2] + 2 and its degree is 5. W...Based on Petersen graph, a new interconnection network, the RP(k) network, is devel-oped and the properties of the RP(k) network are investigated. The diameter of the RP(k) network is [ k/2] + 2 and its degree is 5. We prove that the diameter of the RP(k) network is much smaller than that of the 2-D Torus network when the number of nodes in interconnection networks is less than or equal to 300. In order to analyze the communication performance in a group of nodes, we propose the concepts of the optimal node groups and the diameter of the optimal node groups. We also show that the diameter of the optimal node groups in the RP(k) network is less than that in the 2-D Torus net-work. Especially when the number of nodes in an optimal node group is between 6 and 100, the diam-eter of the optimal node groups in the RP(k) network is half of that in the 2-D Torus network. Further-more based on the RP(k) network we design a set of routing algorithms which are point-to-point rout-ing, permutation routing, one-to-all routing and all-to-all routing. Their communication efficiencies are [ k/2] +2, k + 5, [k/2] + 2, and k + 5 respectively. The RP(k) network and the routing algorithms can provide efficient communication means for parallel and distributed computer system.展开更多
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.展开更多
Internet of things networks often suffer from early node failures and short lifespan due to energy limits.Traditional routing methods are not enough.This work proposes a new hybrid algorithm called ACOGA.It combines A...Internet of things networks often suffer from early node failures and short lifespan due to energy limits.Traditional routing methods are not enough.This work proposes a new hybrid algorithm called ACOGA.It combines Ant Colony Optimization(ACO)and the Greedy Algorithm(GA).ACO finds smart paths while Greedy makes quick decisions.This improves energy use and performance.ACOGA outperforms Hybrid Energy-Efficient(HEE)and Adaptive Lossless Data Compression(ALDC)algorithms.After 500 rounds,only 5%of ACOGA’s nodes are dead,compared to 15%for HEE and 20%for ALDC.The network using ACOGA runs for 1200 rounds before the first nodes fail.HEE lasts 900 rounds and ALDC only 850.ACOGA saves at least 15%more energy by better distributing the load.It also achieves a 98%packet delivery rate.The method works well in mixed IoT networks like Smart Water Management Systems(SWMS).These systems have different power levels and communication ranges.The simulation of proposed model has been done in MATLAB simulator.The results show that that the proposed model outperform then the existing models.展开更多
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.展开更多
[Objective] This study was to design an intelligent greenhouse real-time monitoring system based on the core technology of Internet of Things in order to meet the needs of agricultural informatization and intellectual...[Objective] This study was to design an intelligent greenhouse real-time monitoring system based on the core technology of Internet of Things in order to meet the needs of agricultural informatization and intellectualization. [Method] Based on the application characteristics of Wireless Sensor Network （WSN）, the intelligent greenhouse monitoring system was designed. And for the incompleteness strategy of load balancing in the Low-Energy Adaptive Clustering Hierarchy （LEACH）, a Real- time Threshold Routing Algorithm （RTRA） was proposed. [Result] The performance of network lifetime and network delay of RTRA were tested in MATLAB and found that, within the same testing environment, RTRA can save nodes energy consumption, prolong network lifetime, and had better real-time performance than LEACH. The al- gorithm satisfies the crops＇ requirements on real-time and energy efficiency in the greenhouse system. [Conclusion] For the good performance on real-time, the de- signed intelligent greenhouse real-time monitoring system laid the foundation for the research and development of agricultural informatization and intellectualization.展开更多
As an important part of satellite communication network,LEO satellite constellation network is one of the hot research directions.Since the nonuniform distribution of terrestrial services may cause inter-satellite lin...As an important part of satellite communication network,LEO satellite constellation network is one of the hot research directions.Since the nonuniform distribution of terrestrial services may cause inter-satellite link congestion,improving network load balancing performance has become one of the key issues that need to be solved for routing algorithms in LEO network.Therefore,by expanding the range of available paths and combining the congestion avoidance mechanism,a load balancing routing algorithm based on extended link states in LEO constellation network is proposed.Simulation results show that the algorithm achieves a balanced distribution of traffic load,reduces link congestion and packet loss rate,and improves throughput of LEO satellite network.展开更多
Recently,mega Low Earth Orbit(LEO)Satellite Network(LSN)systems have gained more and more attention due to low latency,broadband communications and global coverage for ground users.One of the primary challenges for LS...Recently,mega Low Earth Orbit(LEO)Satellite Network(LSN)systems have gained more and more attention due to low latency,broadband communications and global coverage for ground users.One of the primary challenges for LSN systems with inter-satellite links is the routing strategy calculation and maintenance,due to LSN constellation scale and dynamic network topology feature.In order to seek an efficient routing strategy,a Q-learning-based dynamic distributed Routing scheme for LSNs(QRLSN)is proposed in this paper.To achieve low end-toend delay and low network traffic overhead load in LSNs,QRLSN adopts a multi-objective optimization method to find the optimal next hop for forwarding data packets.Experimental results demonstrate that the proposed scheme can effectively discover the initial routing strategy and provide long-term Quality of Service(QoS)optimization during the routing maintenance process.In addition,comparison results demonstrate that QRLSN is superior to the virtual-topology-based shortest path routing algorithm.展开更多
There were many contradictory evaluation criteria to select next-hop in the delay-disruption tolerance networks(DTN).To solve this problem,an attribute hierarchical model was proposed,in which the predefined criteria ...There were many contradictory evaluation criteria to select next-hop in the delay-disruption tolerance networks(DTN).To solve this problem,an attribute hierarchical model was proposed,in which the predefined criteria were summarized as static identity attributes,forwarding desire attributes and delivery capability attributes(IDC).Based on this model,a novel multi-attributes congestion aware routing(MACAR) scheme with uncertain information for next-hop selection was presented,by adopting an decision theory to aggregate attributes with belief structure and computing partial ordering relations.The simulation results show that MACAR presents higher successful delivery rate,lower average delay and effectively alleviate congestion.展开更多
Loop free alternate(LFA)is a routing protection scheme that is currently deployed in commercial routers.However,LFA cannot handle all single network component failure scenarios in traditional networks.As Internet serv...Loop free alternate(LFA)is a routing protection scheme that is currently deployed in commercial routers.However,LFA cannot handle all single network component failure scenarios in traditional networks.As Internet service providers have begun to deploy software defined network(SDN)technology,the Internet will be in a hybrid SDN network where traditional and SDN devices coexist for a long time.Therefore,this study aims to deploy the LFA scheme in hybrid SDN network architecture to handle all possible single network component failure scenarios.First,the deployment of LFA scheme in a hybrid SDN network is described as a 0-1 integer linear programming(ILP)problem.Then,two greedy algorithms,namely,greedy algorithm for LFA based on hybrid SDN(GALFAHSDN)and improved greedy algorithm for LFA based on hybrid SDN(IGALFAHSDN),are proposed to solve the proposed problem.Finally,both algorithms are tested in the simulation environment and the real platform.Experiment results show that GALFAHSDN and IGALFAHSDN can cope with all single network component failure scenarios when only a small number of nodes are upgraded to SDN nodes.The path stretch of the two algorithms is less than 1.36.展开更多
The huge increase in the communication network rate has made the application fields and scenarios for vehicular ad hoc networks more abundant and diversified and proposed more requirements for the efficiency and quali...The huge increase in the communication network rate has made the application fields and scenarios for vehicular ad hoc networks more abundant and diversified and proposed more requirements for the efficiency and quality of data transmission.To improve the limited communication distance and poor communication quality of the Internet of Vehicles(IoV),an optimal intelligent routing algorithm is proposed in this paper.Combined multiweight decision algorithm with the greedy perimeter stateless routing protocol,designed and evaluated standardized function for link stability.Linear additive weighting is used to optimize link stability and distance to improve the packet delivery rate of the IoV.The blockchain system is used as the storage structure for relay data,and the smart contract incentive algorithm based on machine learning is used to encourage relay vehicles to provide more communication bandwidth for data packet transmission.The proposed scheme is simulated and analyzed under different scenarios and different parameters.The experimental results demonstrate that the proposed scheme can effectively reduce the packet loss rate and improve system performance.展开更多
In a large-scale wireless sensor network(WSN),densely distributed sensor nodes process a large amount of data.The aggregation of data in a network can consume a great amount of energy.To balance and reduce the energy ...In a large-scale wireless sensor network(WSN),densely distributed sensor nodes process a large amount of data.The aggregation of data in a network can consume a great amount of energy.To balance and reduce the energy consumption of nodes in a WSN and extend the network life,this paper proposes a nonuniform clustering routing algorithm based on the improved K-means algorithm.The algorithm uses a clustering method to form and optimize clusters,and it selects appropriate cluster heads to balance network energy consumption and extend the life cycle of the WSN.To ensure that the cluster head(CH)selection in the network is fair and that the location of the selected CH is not concentrated within a certain range,we chose the appropriate CH competition radius.Simulation results show that,compared with LEACH,LEACH-C,and the DEEC clustering algorithm,this algorithm can effectively balance the energy consumption of the CH and extend the network life.展开更多
Since the QKD network can overcome the distance limitation and expand the point-to-point QKD system to a multi-user key distribution system, some testing QKD networks have been built. However, all of this previous res...Since the QKD network can overcome the distance limitation and expand the point-to-point QKD system to a multi-user key distribution system, some testing QKD networks have been built. However, all of this previous research seldom focused on the routing mechanism of QKD network in detail. Therefore, this paper focuses on the routing issue in trust relaying QKD network, builds a model of the trust relaying QKD network and proposes a secret-key-aware routing method. In our method, a dynamic model for the residual local key is proposed to forecast the residual local key quantity of each QKD link more accurately, and the cost of QKD link and relaying path are defined by multiple affecting factors, e.g. the generation, consumption rate and the local key depletion index. The proposed method is implemented and evaluated in a simulation environment. The simulation results show that our routing method can increase the success rate of key exchange, make all the QKD links participate key exchange with almost equal opportunity to achieve load balance, and trade off the local key generation and consumption of each QKD link. Therefore, our proposed method can contribute to effectively improve the holistic performance of the trust relaying QKD network.展开更多
A novel reliable routing algorithm in mobile ad hoc networks using fuzzy Petri net with its reasoning mechanism was proposed to increase the reliability during the routing selection. The algorithm allows the structure...A novel reliable routing algorithm in mobile ad hoc networks using fuzzy Petri net with its reasoning mechanism was proposed to increase the reliability during the routing selection. The algorithm allows the structured representation of network topology, which has a fuzzy reasoning mechanism for finding the routing sprouting tree from the source node to the destination node in the mobile ad boc environment. Finally, by comparing the degree of reliability in the routing sprouting tree, the most reliable route can be computed. The algorithm not only offers the local reliability between each neighboring node, but also provides global reliability for the whole selected route. The algorithm can be applied to most existing on-demand routing protocols, and the simulation results show that the routing reliability is increased by more than 80% when applying the proposed algorithm to the ad hoc on demand distance vector routing protocol.展开更多
Opportunistic networks are random networks and do not communicate with each other among respective communication areas.This situation leads to great difficulty in message transfer.This paper proposes a reducing energy...Opportunistic networks are random networks and do not communicate with each other among respective communication areas.This situation leads to great difficulty in message transfer.This paper proposes a reducing energy consumption optimal selection of path transmission(OSPT) routing algorithm in opportunistic networks.This algorithm designs a dynamic random network topology,creates a dynamic link,and realizes an optimized selected path.This algorithm solves a problem that nodes are unable to deliver messages for a long time in opportunistic networks.According to the simulation experiment,OSPT improves deliver ratio,and reduces energy consumption,cache time and transmission delay compared with the Epidemic Algorithm and Spray and Wait Algorithm in opportunistic networks.展开更多
Software-defined network(SDN)is a new form of network architecture that has programmability,ease of use,centralized control,and protocol independence.It has received high attention since its birth.With SDN network arc...Software-defined network(SDN)is a new form of network architecture that has programmability,ease of use,centralized control,and protocol independence.It has received high attention since its birth.With SDN network architecture,network management becomes more efficient,and programmable interfaces make network operations more flexible and can meet the different needs of various users.The mainstream communication protocol of SDN is OpenFlow,which contains aMatch Field in the flow table structure of the protocol,which matches the content of the packet header of the data received by the switch,and completes the corresponding actions according to the matching results,getting rid of the dependence on the protocol to avoid designing a new protocol.In order to effectively optimize the routing forSDN,this paper proposes a novel algorithm based on reinforcement learning.The proposed technique canmaximize numerous objectives to dynamically update the routing strategy,and it has great generality and is not reliant on any specific network state.The control of routing strategy is more complicated than many Q-learning-based algorithms due to the employment of reinforcement learning.The performance of the method is tested by experiments using the OMNe++simulator.The experimental results reveal that our PPO-based SDN routing control method has superior performance and stability than existing algorithms.展开更多
基金This work was supported by National Natural Science Foundation of China(No.61672106)Natural Science Foundation of Beijing,China(L192023).
文摘Opportunistic Mobile Social Networks(OMSNs)are kind of Delay Tolerant Networks(DTNs)that leverage characteristics of Mobile Ad Hoc Networks(MANETs)and Social Networks,particularly the social features,to boost performance of routing algorithms.Users in OMSNs communicate to share and disseminate data to meet needs for variety of applications.Such networks have attracted tremendous attention lately due to the data transmission requirement from emerging applications such as IoT and smart city initiatives.Devices carried by human is the carrier of message transmission,so the social features of human can be used to improve the ability of data transmission.In this paper,we conduct a comparative survey on routing algorithms in OMSNs.We first analyze routing algorithms based on three social features.Since node selfishness is not really considered previously in aforementioned routing algorithms,but has significant impact on network performance,we treat node selfishness as another social feature,classify and elaborate routing algorithms based on incentive mechanism.To assess the impact of social features on routing algorithms,we conducted simulation for six routing algorithms and analyzed the simulation result.Finally,we conclude the paper with challenges on design of routing in OMSNs and point out some future research directions.
文摘Routing algorithms based on geographical location is an important research subject in the Wireless Sensor Network(WSN).They use location information to guide routing discovery and maintenance as well as packet forwarding,thus enabling the best routing to be selected,reducing energy consumption and optimizing the whole network.Through three aspects involving the flooding restriction scheme,the virtual area partition scheme and the best routing choice scheme,the importance of location information is seen in the routing algorithm.
基金supported by the Fundamental Research Funds for the Central Universities(2021RC239)the Postdoctoral Science Foundation of China(2021 M690338)+3 种基金the Hainan Provincial Natural Science Foundation of China(620RC562,2019RC096,620RC560)the Scientific Research Setup Fund of Hainan University(KYQD(ZR)1877)the Program of Hainan Association for Science and Technology Plans to Youth R&D Innovation(QCXM201910)the National Natural Science Foundation of China(61802092,62162021).
文摘Quantum transmission experiments have shown that the success-ful transmission rate of entangled quanta in optical fibers decreases expo-nentially.Although current quantum networks deploy quantum relays to establish long-distance connections,the increase in transmission distance and entanglement switching costs still need to be considered when selecting the next hop.However,most of the existing quantum network models prefer to consider the parameters of the physical layer,which ignore the influence factors of the network layer.In this paper,we propose a meshy quantum network model based on quantum teleportation,which considers both net-work layer and physical layer parameters.The proposed model can reflect the realistic transmission characteristics and morphological characteristics of the quantum relay network.Then,we study the network throughput of different routing algorithms with the same given parameters when multiple source-destination pairs are interconnected simultaneously.To solve the chal-lenges of routing competition caused by the simultaneous transmission,we present greedy memory-occupied algorithm Q-GMOA and random memory-occupied algorithm Q-RMOA.The proposed meshy quantum network model and the memory-occupied routing algorithms can improve the utilization rate of resources and the transmission performance of the quantum network.And the evaluation results indicate that the proposed methods embrace a higher transmission rate than the previous methods with repeater occupation.
文摘Nowadays the number of cores that are integrated into NoC (Network on Chip) systems is steadily increasing, and real application traffic, running in such multi-core environments requires more and more bandwidth. In that sense, NoC architectures should be properly designed so as to provide efficient traffic engineering, as well as QoS support. Routing algorithm choice in conjunction with other parameters, such as network size and topology, traffic features (time and spatial distribution), as well as packet injection rate, packet size, and buffering capability, are all equivalently critical for designing a robust NoC architecture, on the grounds of traffic engineering and QoS provision. In this paper, a thorough numerical investigation is achieved by taking into consideration the criticality of selecting the proper routing algorithm, in conjunction with all the other aforementioned parameters. This is done via implementation of four routing evaluation traffic scenarios varying each parameter either individually, or as a set, thus exhausting all possible combinations, and making compact decisions on proper routing algorithm selection in NoC architectures. It has been shown that the simplicity of a deterministic routing algorithm such as XY, seems to be a reasonable choice, not only for random traffic patterns but also for non-uniform distributed traffic patterns, in terms of delay and throughput for 2D mesh NoC systems.
基金National Key Research and Development Program(2021YFB2900604)。
文摘Low Earth orbit(LEO)satellite networks exhibit distinct characteristics,e.g.,limited resources of individual satellite nodes and dynamic network topology,which have brought many challenges for routing algorithms.To satisfy quality of service(QoS)requirements of various users,it is critical to research efficient routing strategies to fully utilize satellite resources.This paper proposes a multi-QoS information optimized routing algorithm based on reinforcement learning for LEO satellite networks,which guarantees high level assurance demand services to be prioritized under limited satellite resources while considering the load balancing performance of the satellite networks for low level assurance demand services to ensure the full and effective utilization of satellite resources.An auxiliary path search algorithm is proposed to accelerate the convergence of satellite routing algorithm.Simulation results show that the generated routing strategy can timely process and fully meet the QoS demands of high assurance services while effectively improving the load balancing performance of the link.
基金This work was supported by the National Natural Science Foundation of China (Grant No. 69933020) National High Performance Computing Fund.
文摘Based on Petersen graph, a new interconnection network, the RP(k) network, is devel-oped and the properties of the RP(k) network are investigated. The diameter of the RP(k) network is [ k/2] + 2 and its degree is 5. We prove that the diameter of the RP(k) network is much smaller than that of the 2-D Torus network when the number of nodes in interconnection networks is less than or equal to 300. In order to analyze the communication performance in a group of nodes, we propose the concepts of the optimal node groups and the diameter of the optimal node groups. We also show that the diameter of the optimal node groups in the RP(k) network is less than that in the 2-D Torus net-work. Especially when the number of nodes in an optimal node group is between 6 and 100, the diam-eter of the optimal node groups in the RP(k) network is half of that in the 2-D Torus network. Further-more based on the RP(k) network we design a set of routing algorithms which are point-to-point rout-ing, permutation routing, one-to-all routing and all-to-all routing. Their communication efficiencies are [ k/2] +2, k + 5, [k/2] + 2, and k + 5 respectively. The RP(k) network and the routing algorithms can provide efficient communication means for parallel and distributed computer system.
基金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.
文摘Internet of things networks often suffer from early node failures and short lifespan due to energy limits.Traditional routing methods are not enough.This work proposes a new hybrid algorithm called ACOGA.It combines Ant Colony Optimization(ACO)and the Greedy Algorithm(GA).ACO finds smart paths while Greedy makes quick decisions.This improves energy use and performance.ACOGA outperforms Hybrid Energy-Efficient(HEE)and Adaptive Lossless Data Compression(ALDC)algorithms.After 500 rounds,only 5%of ACOGA’s nodes are dead,compared to 15%for HEE and 20%for ALDC.The network using ACOGA runs for 1200 rounds before the first nodes fail.HEE lasts 900 rounds and ALDC only 850.ACOGA saves at least 15%more energy by better distributing the load.It also achieves a 98%packet delivery rate.The method works well in mixed IoT networks like Smart Water Management Systems(SWMS).These systems have different power levels and communication ranges.The simulation of proposed model has been done in MATLAB simulator.The results show that that the proposed model outperform then the existing models.
基金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 by the Science and Technology Surface Project of Yunnan Province(2010ZC142)the Doctoral Foundation of Dali University(KYBS201015),the Scientific Research Program for College Students of Dali University~~
文摘[Objective] This study was to design an intelligent greenhouse real-time monitoring system based on the core technology of Internet of Things in order to meet the needs of agricultural informatization and intellectualization. [Method] Based on the application characteristics of Wireless Sensor Network （WSN）, the intelligent greenhouse monitoring system was designed. And for the incompleteness strategy of load balancing in the Low-Energy Adaptive Clustering Hierarchy （LEACH）, a Real- time Threshold Routing Algorithm （RTRA） was proposed. [Result] The performance of network lifetime and network delay of RTRA were tested in MATLAB and found that, within the same testing environment, RTRA can save nodes energy consumption, prolong network lifetime, and had better real-time performance than LEACH. The al- gorithm satisfies the crops＇ requirements on real-time and energy efficiency in the greenhouse system. [Conclusion] For the good performance on real-time, the de- signed intelligent greenhouse real-time monitoring system laid the foundation for the research and development of agricultural informatization and intellectualization.
基金supported by the National Natural Science Foundation of China(No.6217011238 and No.61931011).
文摘As an important part of satellite communication network,LEO satellite constellation network is one of the hot research directions.Since the nonuniform distribution of terrestrial services may cause inter-satellite link congestion,improving network load balancing performance has become one of the key issues that need to be solved for routing algorithms in LEO network.Therefore,by expanding the range of available paths and combining the congestion avoidance mechanism,a load balancing routing algorithm based on extended link states in LEO constellation network is proposed.Simulation results show that the algorithm achieves a balanced distribution of traffic load,reduces link congestion and packet loss rate,and improves throughput of LEO satellite network.
基金co-supported by the National Natural Science Foundation of China(No.U20B2056)the office of Military and Civilian Integration Devel-opment Committee of Shanghai(No.2020-jmrh1-kj25)the X LAB Joint Innovation Foundation with the Second Academy of CASIC(No.21GFC-JJ02-322)。
文摘Recently,mega Low Earth Orbit(LEO)Satellite Network(LSN)systems have gained more and more attention due to low latency,broadband communications and global coverage for ground users.One of the primary challenges for LSN systems with inter-satellite links is the routing strategy calculation and maintenance,due to LSN constellation scale and dynamic network topology feature.In order to seek an efficient routing strategy,a Q-learning-based dynamic distributed Routing scheme for LSNs(QRLSN)is proposed in this paper.To achieve low end-toend delay and low network traffic overhead load in LSNs,QRLSN adopts a multi-objective optimization method to find the optimal next hop for forwarding data packets.Experimental results demonstrate that the proposed scheme can effectively discover the initial routing strategy and provide long-term Quality of Service(QoS)optimization during the routing maintenance process.In addition,comparison results demonstrate that QRLSN is superior to the virtual-topology-based shortest path routing algorithm.
基金Project(60973127) supported by the National Natural Science Foundation of ChinaProject(09JJ3123) supported by the Natural Science Foundation of Hunan Province,China
文摘There were many contradictory evaluation criteria to select next-hop in the delay-disruption tolerance networks(DTN).To solve this problem,an attribute hierarchical model was proposed,in which the predefined criteria were summarized as static identity attributes,forwarding desire attributes and delivery capability attributes(IDC).Based on this model,a novel multi-attributes congestion aware routing(MACAR) scheme with uncertain information for next-hop selection was presented,by adopting an decision theory to aggregate attributes with belief structure and computing partial ordering relations.The simulation results show that MACAR presents higher successful delivery rate,lower average delay and effectively alleviate congestion.
基金This work is supported by the Program of Hainan Association for Science and Technology Plans to Youth R&D Innovation(No.QCXM201910)the National Natural Science Foundation of China(No.61702315,No.61802092)+2 种基金the Scientific Research Setup Fund of Hainan University(No.KYQD(ZR)1837)the Key R&D program(international science and technology cooperation project)of Shanxi Province China(No.201903D421003)Scientific and Technological Innovation Programs of Higher Education Institutions in Shanxi(No.201802013).
文摘Loop free alternate(LFA)is a routing protection scheme that is currently deployed in commercial routers.However,LFA cannot handle all single network component failure scenarios in traditional networks.As Internet service providers have begun to deploy software defined network(SDN)technology,the Internet will be in a hybrid SDN network where traditional and SDN devices coexist for a long time.Therefore,this study aims to deploy the LFA scheme in hybrid SDN network architecture to handle all possible single network component failure scenarios.First,the deployment of LFA scheme in a hybrid SDN network is described as a 0-1 integer linear programming(ILP)problem.Then,two greedy algorithms,namely,greedy algorithm for LFA based on hybrid SDN(GALFAHSDN)and improved greedy algorithm for LFA based on hybrid SDN(IGALFAHSDN),are proposed to solve the proposed problem.Finally,both algorithms are tested in the simulation environment and the real platform.Experiment results show that GALFAHSDN and IGALFAHSDN can cope with all single network component failure scenarios when only a small number of nodes are upgraded to SDN nodes.The path stretch of the two algorithms is less than 1.36.
基金supported by the National Key R&D Program of China (2020YFB2008400)LAGEO of Chinese Academy of Sciences (LAGEO-2019-2)+11 种基金Program for Science&Technology Innovation Talents in the University of Henan Province (20HASTIT022)21th Project of the Xizang Cultural Inheritance and Development Collaborative Innovation Center in 2018 (21IRTSTHN015)Natural Science Foundation of Xizang Named“Research of Key Technology of Millimeter Wave MIMO Secure Transmission with Relay Enhancement”in 2018Xizang Autonomous Region Education Science“13th Five-year Plan”Major Project for 2018 (XZJKY201803)Natural Science Foundation of Henan under Grant 202300410126Young Backbone Teachers in Henan Province (2018GGJS049)Henan Province Young Talent Lift Project (2020HYTP009)Program for Innovative Research Team in University of Henan Province (21IRTSTHNO15)Equipment Pre-research Joint Research Program of Ministry of Education (8091B032129)Training Program for Young Scholar of Henan Province for Colleges and Universities under Grand (2020GGJS172)Program for Science&Technology Innovation Talents in Universities of Henan Province under Grand (22HASTIT020)Henan Province Science Fund for Distinguished Young Scholars (222300420006).
文摘The huge increase in the communication network rate has made the application fields and scenarios for vehicular ad hoc networks more abundant and diversified and proposed more requirements for the efficiency and quality of data transmission.To improve the limited communication distance and poor communication quality of the Internet of Vehicles(IoV),an optimal intelligent routing algorithm is proposed in this paper.Combined multiweight decision algorithm with the greedy perimeter stateless routing protocol,designed and evaluated standardized function for link stability.Linear additive weighting is used to optimize link stability and distance to improve the packet delivery rate of the IoV.The blockchain system is used as the storage structure for relay data,and the smart contract incentive algorithm based on machine learning is used to encourage relay vehicles to provide more communication bandwidth for data packet transmission.The proposed scheme is simulated and analyzed under different scenarios and different parameters.The experimental results demonstrate that the proposed scheme can effectively reduce the packet loss rate and improve system performance.
基金This research was funded by the Science and Technology Support Plan Project of Hebei Province(grant numbers 17210803D and 19273703D)the Science and Technology Spark Project of the Hebei Seismological Bureau(grant number DZ20180402056)+1 种基金the Education Department of Hebei Province(grant number QN2018095)the Polytechnic College of Hebei University of Science and Technology.
文摘In a large-scale wireless sensor network(WSN),densely distributed sensor nodes process a large amount of data.The aggregation of data in a network can consume a great amount of energy.To balance and reduce the energy consumption of nodes in a WSN and extend the network life,this paper proposes a nonuniform clustering routing algorithm based on the improved K-means algorithm.The algorithm uses a clustering method to form and optimize clusters,and it selects appropriate cluster heads to balance network energy consumption and extend the life cycle of the WSN.To ensure that the cluster head(CH)selection in the network is fair and that the location of the selected CH is not concentrated within a certain range,we chose the appropriate CH competition radius.Simulation results show that,compared with LEACH,LEACH-C,and the DEEC clustering algorithm,this algorithm can effectively balance the energy consumption of the CH and extend the network life.
文摘Since the QKD network can overcome the distance limitation and expand the point-to-point QKD system to a multi-user key distribution system, some testing QKD networks have been built. However, all of this previous research seldom focused on the routing mechanism of QKD network in detail. Therefore, this paper focuses on the routing issue in trust relaying QKD network, builds a model of the trust relaying QKD network and proposes a secret-key-aware routing method. In our method, a dynamic model for the residual local key is proposed to forecast the residual local key quantity of each QKD link more accurately, and the cost of QKD link and relaying path are defined by multiple affecting factors, e.g. the generation, consumption rate and the local key depletion index. The proposed method is implemented and evaluated in a simulation environment. The simulation results show that our routing method can increase the success rate of key exchange, make all the QKD links participate key exchange with almost equal opportunity to achieve load balance, and trade off the local key generation and consumption of each QKD link. Therefore, our proposed method can contribute to effectively improve the holistic performance of the trust relaying QKD network.
文摘A novel reliable routing algorithm in mobile ad hoc networks using fuzzy Petri net with its reasoning mechanism was proposed to increase the reliability during the routing selection. The algorithm allows the structured representation of network topology, which has a fuzzy reasoning mechanism for finding the routing sprouting tree from the source node to the destination node in the mobile ad boc environment. Finally, by comparing the degree of reliability in the routing sprouting tree, the most reliable route can be computed. The algorithm not only offers the local reliability between each neighboring node, but also provides global reliability for the whole selected route. The algorithm can be applied to most existing on-demand routing protocols, and the simulation results show that the routing reliability is increased by more than 80% when applying the proposed algorithm to the ad hoc on demand distance vector routing protocol.
基金Supported by the National Natural Science Foundation of China(No.61379057,61073186,61309001,61379110,61103202)Doctoral Fund of Ministry of Education of China(No.20120162130008)the National Basic Research Program of China(973 Program)(No.2014CB046305)
文摘Opportunistic networks are random networks and do not communicate with each other among respective communication areas.This situation leads to great difficulty in message transfer.This paper proposes a reducing energy consumption optimal selection of path transmission(OSPT) routing algorithm in opportunistic networks.This algorithm designs a dynamic random network topology,creates a dynamic link,and realizes an optimized selected path.This algorithm solves a problem that nodes are unable to deliver messages for a long time in opportunistic networks.According to the simulation experiment,OSPT improves deliver ratio,and reduces energy consumption,cache time and transmission delay compared with the Epidemic Algorithm and Spray and Wait Algorithm in opportunistic networks.
基金The researchers would like to thank the Deanship of Scientific Research,Qassim University for funding the publication of this project.
文摘Software-defined network(SDN)is a new form of network architecture that has programmability,ease of use,centralized control,and protocol independence.It has received high attention since its birth.With SDN network architecture,network management becomes more efficient,and programmable interfaces make network operations more flexible and can meet the different needs of various users.The mainstream communication protocol of SDN is OpenFlow,which contains aMatch Field in the flow table structure of the protocol,which matches the content of the packet header of the data received by the switch,and completes the corresponding actions according to the matching results,getting rid of the dependence on the protocol to avoid designing a new protocol.In order to effectively optimize the routing forSDN,this paper proposes a novel algorithm based on reinforcement learning.The proposed technique canmaximize numerous objectives to dynamically update the routing strategy,and it has great generality and is not reliant on any specific network state.The control of routing strategy is more complicated than many Q-learning-based algorithms due to the employment of reinforcement learning.The performance of the method is tested by experiments using the OMNe++simulator.The experimental results reveal that our PPO-based SDN routing control method has superior performance and stability than existing algorithms.
