With the development of science, economy and society, the needs for research and exploration of deep space have entered a rapid and stable development stage. Deep Space Optical Network(DSON) is expected to become an i...With the development of science, economy and society, the needs for research and exploration of deep space have entered a rapid and stable development stage. Deep Space Optical Network(DSON) is expected to become an important foundation and inevitable development trend of future deepspace communication. In this paper, we design a deep space node model which is capable of combining the space division multiplexing with frequency division multiplexing. Furthermore, we propose the directional flooding routing algorithm(DFRA) for DSON based on our node model. This scheme selectively forwards the data packets in the routing, so that the energy consumption can be reduced effectively because only a portion of nodes will participate the flooding routing. Simulation results show that, compared with traditional flooding routing algorithm(TFRA), the DFRA can avoid the non-directional and blind transmission. Therefore, the energy consumption in message routing will be reduced and the lifespan of DSON can also be prolonged effectively. Although the complexity of routing implementation is slightly increased compared with TFRA, the energy of nodes can be saved and the transmission rate is obviously improved in DFRA. Thus the overall performance of DSON can be significantly improved.展开更多
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.展开更多
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.展开更多
In recent years,Delay Tolerant Networks(DTN)have received more and more attention.At the same time,several existing DTN routing algorithms generally have disadvantages such as poor scalability and inability to perceiv...In recent years,Delay Tolerant Networks(DTN)have received more and more attention.At the same time,several existing DTN routing algorithms generally have disadvantages such as poor scalability and inability to perceive changes in the network environment.This paper proposes an AdaptiveSpray routing algorithm.The algorithm can dynamically control the initial maximum message copy number according to the cache occupancy rate of the node itself,and the cache occupancy rate is added as an impact factor to the calculation of the probability of each node meeting the destination node.In the forwarding phase,the node will first compare the meeting probability of itself and the meeting node to the destination node,and then choose different forwarding strategies.The simulation shows that the AdaptiveSpray algorithm proposed in this paper has obvious advantages compared with the existing routing algorithms in terms of message delivery rate and average delay.展开更多
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.展开更多
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.展开更多
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.展开更多
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.展开更多
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.展开更多
The addressing and routing algorithm on hexagonal networks is still an open problem so far.Although many related works have been done to resolve this problem to some extent,the properties of hexagonal networks are sti...The addressing and routing algorithm on hexagonal networks is still an open problem so far.Although many related works have been done to resolve this problem to some extent,the properties of hexagonal networks are still not explored adequately.In this paper,we first create an oblique coordinate system and redefine the Euclidean space to address the hexagonal nodes.Then an optimal routing algorithm using vectors and angles of the redefined Euclidean space is developed.Compared with the traditional 3-directions scheme and the Cayley graph method,the proposed routing algorithm is more efficient and totally independent of the scale of networks with two-tuples addresses.We also prove that the path(s) obtained by this algorithm is always the shortest one(s).展开更多
A 3-D topology architeeture based on Spidergon and its generation method are proposed. Aiming at establishing relationships between the topology architecture and the latency, the 3-D topology latency model based on pr...A 3-D topology architeeture based on Spidergon and its generation method are proposed. Aiming at establishing relationships between the topology architecture and the latency, the 3-D topology latency model based on prototype is proposed, and then the optimization topology structure with minimum latency is determined based on it. Meanwhile, in accordance with the structure, the adaptive routing algorithm is designed. The algorithm sets longitudinal direction priority to adaptively searching the equivalent minimum path between the source nodes and the destination nodes in order to increase network throughput. Simulation shows that in case of approximate saturation network, compared with the same scale 3-D mesh structure, 3-D Spidergon has 17% less latency and 16.7% more network throughput.展开更多
In urban Vehicular Ad hoc Networks(VANETs),high mobility of vehicular environment and frequently changed network topology call for a low delay end-to-end routing algorithm.In this paper,we propose a Multi-Agent Reinfo...In urban Vehicular Ad hoc Networks(VANETs),high mobility of vehicular environment and frequently changed network topology call for a low delay end-to-end routing algorithm.In this paper,we propose a Multi-Agent Reinforcement Learning(MARL)based decentralized routing scheme,where the inherent similarity between the routing problem in VANET and the MARL problem is exploited.The proposed routing scheme models the interaction between vehicles and the environment as a multi-agent problem in which each vehicle autonomously establishes the communication channel with a neighbor device regardless of the global information.Simulation performed in the 3GPP Manhattan mobility model demonstrates that our proposed decentralized routing algorithm achieves less than 45.8 ms average latency and high stability of 0.05%averaging failure rate with varying vehicle capacities.展开更多
The minimum energy per bit(EPB)as the energy efficiency(EE)metric in an automatic retransmission request(ARQ)based multi-hop system is analyzed under power and throughput constraints.Two ARQ protocols including type-I...The minimum energy per bit(EPB)as the energy efficiency(EE)metric in an automatic retransmission request(ARQ)based multi-hop system is analyzed under power and throughput constraints.Two ARQ protocols including type-I(ARQ-I)and repetition redundancy(ARQ-RR)are considered and expressions for the optimal power allocation(PA)are obtained.Using the obtained optimal powers,the EE-throughput tradeoff(EETT)is analyzed and the EETT closed-form expressions for both ARQ protocols and in arbitrary average channel gain values are obtained.It is shown that how different throughput requirements,especially the high levels,affect the EE performance.Additionally,asymptotic analysis is made in the feasible high throughput values and lower and upper EETT bounds are derived for ARQ-I protocol.To evaluate the EE a distributed PA scenario,as a benchmark,is presented and the energy savinggain obtained from the optimal PA in comparison with the distributed PA for ARQ-I and ARQ-RR protocols is discussed in different throughput values and node locations.展开更多
With the explosive increasing number of connecting devices such as smart phones, vehicles,drones, and satellites in the wireless networks, how to manage and control such a huge number of networking nodes has become a ...With the explosive increasing number of connecting devices such as smart phones, vehicles,drones, and satellites in the wireless networks, how to manage and control such a huge number of networking nodes has become a great challenge. In this paper, we combine the advantages of centralized networks and distributed networks approaches for vehicular networks with the aid of Unmanned Aerial Vehicle(UAV), and propose a Center-controlled Multihop Wireless(CMW) networking scheme consisting of data transmission plane performed by vehicles and the network control plane implemented by the UAV.Besides, we jointly explore the advantages of Medium Access Control(MAC) protocols in the link layer and routing schemes in the network layer to facilitate the multi-hop data transmission for the ground vehicles.Particularly, the network control plane in the UAV can manage the whole network effectively via fully exploiting the acquired network topology information and traffic requests from each vehicle, and implements various kinds of control based on different traffic demands, which can enhance the networking flexibility and scalability significantly in vehicular networks.Simulation results validate the advantages of the proposed scheme compared with existing methods.展开更多
Taking advantage of spontaneous and infrastructure-less behavior, a mobile ad hoc network （MANET） can be integrated with various networks to extend communication for different types of network services. In the integ...Taking advantage of spontaneous and infrastructure-less behavior, a mobile ad hoc network （MANET） can be integrated with various networks to extend communication for different types of network services. In the integrated system, to provide inter-connection between different networks and prnvide data aggregation, the design of the-gateway is vital. In some integrated networks with muhiple gateways, proper gateway selection guarantees desirable QoS and optimization of network resource utilization. However, how to select gateway efficiently is still challenging in the integrated MANET systems with distributed behavior terminals and limited network resources. In this paper, we examine gateway selection problem from different aspects including information discovery behavior, selection criteria and decision-making entity. The benefits and drawbacks for each method are illustrated and compared. Based on the discussion, points of considerations are highlighted for future studies.展开更多
基金supported by National Natural Science Foundation of China (61471109, 61501104 and 91438110)Fundamental Research Funds for the Central Universities ( N140405005 , N150401002 and N150404002)Open Fund of IPOC (BUPT, IPOC2015B006)
文摘With the development of science, economy and society, the needs for research and exploration of deep space have entered a rapid and stable development stage. Deep Space Optical Network(DSON) is expected to become an important foundation and inevitable development trend of future deepspace communication. In this paper, we design a deep space node model which is capable of combining the space division multiplexing with frequency division multiplexing. Furthermore, we propose the directional flooding routing algorithm(DFRA) for DSON based on our node model. This scheme selectively forwards the data packets in the routing, so that the energy consumption can be reduced effectively because only a portion of nodes will participate the flooding routing. Simulation results show that, compared with traditional flooding routing algorithm(TFRA), the DFRA can avoid the non-directional and blind transmission. Therefore, the energy consumption in message routing will be reduced and the lifespan of DSON can also be prolonged effectively. Although the complexity of routing implementation is slightly increased compared with TFRA, the energy of nodes can be saved and the transmission rate is obviously improved in DFRA. Thus the overall performance of DSON can be significantly improved.
基金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.
基金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.
基金National Key R&D Program of China(2020YFB1807805,2020YFB1807800)CERNET Innovation Project(NGII20190806).
文摘In recent years,Delay Tolerant Networks(DTN)have received more and more attention.At the same time,several existing DTN routing algorithms generally have disadvantages such as poor scalability and inability to perceive changes in the network environment.This paper proposes an AdaptiveSpray routing algorithm.The algorithm can dynamically control the initial maximum message copy number according to the cache occupancy rate of the node itself,and the cache occupancy rate is added as an impact factor to the calculation of the probability of each node meeting the destination node.In the forwarding phase,the node will first compare the meeting probability of itself and the meeting node to the destination node,and then choose different forwarding strategies.The simulation shows that the AdaptiveSpray algorithm proposed in this paper has obvious advantages compared with the existing routing algorithms in terms of message delivery rate and average delay.
文摘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.
文摘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.
基金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.
基金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.
文摘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.
基金supported in part by International Researcher Exchange Project of National Science Foundation of China and Centre national de la recherche scientifique de France(NSFC-CNRS)under Grant No.61211130104national information security project 242 under Grant No.2014A104National Science Foundation of China under Grants No.60932003,61271220,61202266,61172053
文摘The addressing and routing algorithm on hexagonal networks is still an open problem so far.Although many related works have been done to resolve this problem to some extent,the properties of hexagonal networks are still not explored adequately.In this paper,we first create an oblique coordinate system and redefine the Euclidean space to address the hexagonal nodes.Then an optimal routing algorithm using vectors and angles of the redefined Euclidean space is developed.Compared with the traditional 3-directions scheme and the Cayley graph method,the proposed routing algorithm is more efficient and totally independent of the scale of networks with two-tuples addresses.We also prove that the path(s) obtained by this algorithm is always the shortest one(s).
基金Supported by the National Nature Science Foundation of China(61076019)the Aviation Science Foundation(20115552031)the Science and Technology Support Program of Jiangsu Province(BE2010003)~~
文摘A 3-D topology architeeture based on Spidergon and its generation method are proposed. Aiming at establishing relationships between the topology architecture and the latency, the 3-D topology latency model based on prototype is proposed, and then the optimization topology structure with minimum latency is determined based on it. Meanwhile, in accordance with the structure, the adaptive routing algorithm is designed. The algorithm sets longitudinal direction priority to adaptively searching the equivalent minimum path between the source nodes and the destination nodes in order to increase network throughput. Simulation shows that in case of approximate saturation network, compared with the same scale 3-D mesh structure, 3-D Spidergon has 17% less latency and 16.7% more network throughput.
基金This work is supported by the National Science Foundation of China under grant No.61901403,61790551,and 61925106,Youth Innovation Fund of Xiamen No.3502Z20206039 and Tsinghua-Foshan Innovation Special Fund(TFISF)No.2020THFS0109.
文摘In urban Vehicular Ad hoc Networks(VANETs),high mobility of vehicular environment and frequently changed network topology call for a low delay end-to-end routing algorithm.In this paper,we propose a Multi-Agent Reinforcement Learning(MARL)based decentralized routing scheme,where the inherent similarity between the routing problem in VANET and the MARL problem is exploited.The proposed routing scheme models the interaction between vehicles and the environment as a multi-agent problem in which each vehicle autonomously establishes the communication channel with a neighbor device regardless of the global information.Simulation performed in the 3GPP Manhattan mobility model demonstrates that our proposed decentralized routing algorithm achieves less than 45.8 ms average latency and high stability of 0.05%averaging failure rate with varying vehicle capacities.
文摘The minimum energy per bit(EPB)as the energy efficiency(EE)metric in an automatic retransmission request(ARQ)based multi-hop system is analyzed under power and throughput constraints.Two ARQ protocols including type-I(ARQ-I)and repetition redundancy(ARQ-RR)are considered and expressions for the optimal power allocation(PA)are obtained.Using the obtained optimal powers,the EE-throughput tradeoff(EETT)is analyzed and the EETT closed-form expressions for both ARQ protocols and in arbitrary average channel gain values are obtained.It is shown that how different throughput requirements,especially the high levels,affect the EE performance.Additionally,asymptotic analysis is made in the feasible high throughput values and lower and upper EETT bounds are derived for ARQ-I protocol.To evaluate the EE a distributed PA scenario,as a benchmark,is presented and the energy savinggain obtained from the optimal PA in comparison with the distributed PA for ARQ-I and ARQ-RR protocols is discussed in different throughput values and node locations.
基金supported in part by the National Natural Science Foundation of China under Grant 62071283,Grant 61771296,Grant 61872228 and Grant 62271513in part by the Natural Science Basic Research Plan in Shaanxi Province of China under Grant 2018JQ6048 and Grant 2018JZ6006+3 种基金in part by Shaanxi Key Industrial Innovation Chain Project in Industrial Domain under Grant 2020ZDLGY15-09in part by Guang Dong Basic and Applied Basic Research Foundation under Grant 2021A1515012631in part by China Postdoctoral Science Foundation under Grant 2016M600761in part by the Fundamental Research Funds for the Central Universities under Grant GK202003075 and Grant GK202103016。
文摘With the explosive increasing number of connecting devices such as smart phones, vehicles,drones, and satellites in the wireless networks, how to manage and control such a huge number of networking nodes has become a great challenge. In this paper, we combine the advantages of centralized networks and distributed networks approaches for vehicular networks with the aid of Unmanned Aerial Vehicle(UAV), and propose a Center-controlled Multihop Wireless(CMW) networking scheme consisting of data transmission plane performed by vehicles and the network control plane implemented by the UAV.Besides, we jointly explore the advantages of Medium Access Control(MAC) protocols in the link layer and routing schemes in the network layer to facilitate the multi-hop data transmission for the ground vehicles.Particularly, the network control plane in the UAV can manage the whole network effectively via fully exploiting the acquired network topology information and traffic requests from each vehicle, and implements various kinds of control based on different traffic demands, which can enhance the networking flexibility and scalability significantly in vehicular networks.Simulation results validate the advantages of the proposed scheme compared with existing methods.
文摘Taking advantage of spontaneous and infrastructure-less behavior, a mobile ad hoc network （MANET） can be integrated with various networks to extend communication for different types of network services. In the integrated system, to provide inter-connection between different networks and prnvide data aggregation, the design of the-gateway is vital. In some integrated networks with muhiple gateways, proper gateway selection guarantees desirable QoS and optimization of network resource utilization. However, how to select gateway efficiently is still challenging in the integrated MANET systems with distributed behavior terminals and limited network resources. In this paper, we examine gateway selection problem from different aspects including information discovery behavior, selection criteria and decision-making entity. The benefits and drawbacks for each method are illustrated and compared. Based on the discussion, points of considerations are highlighted for future studies.
