The rapid growth of distributed data-centric applications and AI workloads increases demand for low-latency,high-throughput communication,necessitating frequent and flexible updates to network routing configurations.H...The rapid growth of distributed data-centric applications and AI workloads increases demand for low-latency,high-throughput communication,necessitating frequent and flexible updates to network routing configurations.However,maintaining consistent forwarding states during these updates is challenging,particularly when rerouting multiple flows simultaneously.Existing approaches pay little attention to multi-flow update,where improper update sequences across data plane nodes may construct deadlock dependencies.Moreover,these methods typically involve excessive control-data plane interactions,incurring significant resource overhead and performance degradation.This paper presents P4LoF,an efficient loop-free update approach that enables the controller to reroute multiple flows through minimal interactions.P4LoF first utilizes a greedy-based algorithm to generate the shortest update dependency chain for the single-flow update.These chains are then dynamically merged into a dependency graph and resolved as a Shortest Common Super-sequence(SCS)problem to produce the update sequence of multi-flow update.To address deadlock dependencies in multi-flow updates,P4LoF builds a deadlock-fix forwarding model that leverages the flexible packet processing capabilities of the programmable data plane.Experimental results show that P4LoF reduces control-data plane interactions by at least 32.6%with modest overhead,while effectively guaranteeing loop-free consistency.展开更多
Satellite edge computing has garnered significant attention from researchers;however,processing a large volume of tasks within multi-node satellite networks still poses considerable challenges.The sharp increase in us...Satellite edge computing has garnered significant attention from researchers;however,processing a large volume of tasks within multi-node satellite networks still poses considerable challenges.The sharp increase in user demand for latency-sensitive tasks has inevitably led to offloading bottlenecks and insufficient computational capacity on individual satellite edge servers,making it necessary to implement effective task offloading scheduling to enhance user experience.In this paper,we propose a priority-based task scheduling strategy based on a Software-Defined Network(SDN)framework for satellite-terrestrial integrated networks,which clarifies the execution order of tasks based on their priority.Subsequently,we apply a Dueling-Double Deep Q-Network(DDQN)algorithm enhanced with prioritized experience replay to derive a computation offloading strategy,improving the experience replay mechanism within the Dueling-DDQN framework.Next,we utilize the Deep Deterministic Policy Gradient(DDPG)algorithm to determine the optimal resource allocation strategy to reduce the processing latency of sub-tasks.Simulation results demonstrate that the proposed d3-DDPG algorithm outperforms other approaches,effectively reducing task processing latency and thus improving user experience and system efficiency.展开更多
Multi-band optical networks are a potential technology for increasing network capacity.However,the strong interference and non-uniformity between wavelengths in multi-band optical networks have become a bottleneck res...Multi-band optical networks are a potential technology for increasing network capacity.However,the strong interference and non-uniformity between wavelengths in multi-band optical networks have become a bottleneck restricting the transmission capacity of multi-band optical networks.To overcome these challenges,it is particularly important to implement optical power optimization targeting wavelength differences.Therefore,based on the generalized Gaussian noise model,we first formulate an optimization model for the problems of routing,modulation format,wavelength,and power allocation in C+L+S multi-band optical networks.Our objective function is to maximize the average link capacity of the network while ensuring that the Optical Signal-to-Noise(OSNR)threshold of the service request is not exceeded.Next,we propose a NonLinear Interferenceaware(NLI-aware)routing,modulation format,wavelength,and power allocation algorithm.Finally,we conduct simulations under different test conditions.The simulation results indicate that our algorithm can effectively reduce the blocking probability by 23.5%and improve the average link capacity by 3.78%in C+L+S multi-band optical networks.展开更多
Zero Trust Network(ZTN)enhances network security through strict authentication and access control.However,in the ZTN,optimizing flow control to improve the quality of service is still facing challenges.Software Define...Zero Trust Network(ZTN)enhances network security through strict authentication and access control.However,in the ZTN,optimizing flow control to improve the quality of service is still facing challenges.Software Defined Network(SDN)provides solutions through centralized control and dynamic resource allocation,but the existing scheduling methods based on Deep Reinforcement Learning(DRL)are insufficient in terms of convergence speed and dynamic optimization capability.To solve these problems,this paper proposes DRL-AMIR,which is an efficient flow scheduling method for software defined ZTN.This method constructs a flow scheduling optimization model that comprehensively considers service delay,bandwidth occupation,and path hops.Additionally,it balances the differentiated requirements of delay-critical K-flows,bandwidth-intensive D-flows,and background B-flows through adaptiveweighting.Theproposed framework employs a customized state space comprising node labels,link bandwidth,delaymetrics,and path length.It incorporates an action space derived fromnode weights and a hybrid reward function that integrates both single-step and multi-step excitation mechanisms.Based on these components,a hierarchical architecture is designed,effectively integrating the data plane,control plane,and knowledge plane.In particular,the adaptive expert mechanism is introduced,which triggers the shortest path algorithm in the training process to accelerate convergence,reduce trial and error costs,and maintain stability.Experiments across diverse real-world network topologies demonstrate that DRL-AMIR achieves a 15–20%reduction in K-flow transmission delays,a 10–15%improvement in link bandwidth utilization compared to SPR,QoSR,and DRSIR,and a 30%faster convergence speed via adaptive expert mechanisms.展开更多
A new cyclic prefix(CP)-based nonoverlapping FBMC-QAM(CP-NO-FBMC-QAM)system with two prototype filters is proposed in this paper,which satisfies complex orthogonality conditions and good frequency energy confinement a...A new cyclic prefix(CP)-based nonoverlapping FBMC-QAM(CP-NO-FBMC-QAM)system with two prototype filters is proposed in this paper,which satisfies complex orthogonality conditions and good frequency energy confinement at the same time.We analyze its inter-carrier interference/inter-symbol interference(ICI/ISI)over multipath channels.Owing to the additional CP,the ISI of received symbols over multipath channels is eliminated in the proposed system,and the resulting improvement in the signal-to-interference ratio(SIR)performance is evaluated by theoretical analysis.Moreover,for the ICI caused by multipath propagation in received symbols,we develop a method that eliminates the ICI by frequency-domain channel estimation and equalization before the receiver filtering process.The proposed CP-NO-FBMC-QAM system and ICI cancellation method(ICICM)are validated by comparisons of implementation complexity,power spectral density(PSD),bit error rate(BER)and channel estimation performance with conventional CP-based orthogonal frequency division multiplexing(CP-OFDM)and FBMC-QAM systems.展开更多
Non-Orthogonal Multiple Access(NOMA)assisted Unmanned Aerial Vehicle(UAV)communication is becoming a promising technique for future B5G/6G networks.However,the security of the NOMA-UAV networks remains critical challe...Non-Orthogonal Multiple Access(NOMA)assisted Unmanned Aerial Vehicle(UAV)communication is becoming a promising technique for future B5G/6G networks.However,the security of the NOMA-UAV networks remains critical challenges due to the shared wireless spectrum and Line-of-Sight(LoS)channel.This paper formulates a joint UAV trajectory design and power allocation problem with the aid of the ground jammer to maximize the sum secrecy rate.First,the joint optimization problem is modeled as a Markov Decision Process(MDP).Then,the Deep Reinforcement Learning(DRL)method is utilized to search the optimal policy from the continuous action space.In order to accelerate the sample accumulation,the Asynchronous Advantage Actor-Critic(A3C)scheme with multiple workers is proposed,which reformulates the action and reward to acquire complete update duration.Simulation results demonstrate that the A3C-based scheme outperforms the baseline schemes in term of the secrecy rate and stability.展开更多
As the economy grows, environmental issues are becoming increasingly severe, making the promotion of green behavior more urgent. Information dissemination and policy regulation play crucial roles in influencing and am...As the economy grows, environmental issues are becoming increasingly severe, making the promotion of green behavior more urgent. Information dissemination and policy regulation play crucial roles in influencing and amplifying the spread of green behavior across society. To this end, a novel three-layer model in multilayer networks is proposed. In the novel model, the information layer describes green information spreading, the physical contact layer depicts green behavior propagation, and policy regulation is symbolized by an isolated node beneath the two layers. Then, we deduce the green behavior threshold for the three-layer model using the microscopic Markov chain approach. Moreover, subject to some individuals who are more likely to influence others or become green nodes and the limitations of the capacity of policy regulation, an optimal scheme is given that could optimize policy interventions to most effectively prompt green behavior.Subsequently, simulations are performed to validate the preciseness and theoretical results of the new model. It reveals that policy regulation can prompt the prevalence and outbreak of green behavior. Then, the green behavior is more likely to spread and be prevalent in the SF network than in the ER network. Additionally, optimal allocation is highly successful in facilitating the dissemination of green behavior. In practice, the optimal allocation strategy could prioritize interventions at critical nodes or regions, such as highly connected urban areas, where the impact of green behavior promotion would be most significant.展开更多
Research on wide area ad hoc networks is of great significance due to its application prospect in long-range networks such as aeronautical and maritime networks,etc.The design of MAC protocols is one of the most impor...Research on wide area ad hoc networks is of great significance due to its application prospect in long-range networks such as aeronautical and maritime networks,etc.The design of MAC protocols is one of the most important parts impacting the whole network performance.In this paper,we propose a dis-tributed TDMA-based MAC protocol called Dynamic Self Organizing TDMA(DSO-TDMA)for wide area ad hoc networks.DSO-TDMA includes three main features:(1)In a distributed way,nodes in the network select transmitting slots according to the congestion situation of the local air interface.(2)In a selforganization way,nodes dynamically adjust the resource occupancy ratio according to the queue length of neighbouring nodes within two-hop range.(3)In a piggyback way,the control information is transmitted together with the payload to reduce the overhead.We design the whole mechanisms,implement them in NS-3 and evaluate the performance of DSO-TDMA compared with another dynamic TDMA MAC protocol,EHR-TDMA.Results show that the end-to-end throughput of DSO-TDMA is at most 51.4%higher than that of EHR-TDMA,and the average access delay of DSO-TDMA is at most 66.05%lower than that of EHR-TDMA.展开更多
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.展开更多
Benefit from the enhanced onboard processing capacities and high-speed satellite-terrestrial links,satellite edge computing has been regarded as a promising technique to facilitate the execution of the computation-int...Benefit from the enhanced onboard processing capacities and high-speed satellite-terrestrial links,satellite edge computing has been regarded as a promising technique to facilitate the execution of the computation-intensive applications for satellite communication networks(SCNs).By deploying edge computing servers in satellite and gateway stations,SCNs can achieve significant performance gains of the computing capacities at the expense of extending the dimensions and complexity of resource management.Therefore,in this paper,we investigate the joint computing and communication resource management problem for SCNs to minimize the execution latency of the computation-intensive applications,while two different satellite edge computing scenarios and local execution are considered.Furthermore,the joint computing and communication resource allocation problem for the computation-intensive services is formulated as a mixed-integer programming problem.A game-theoretic and many-to-one matching theorybased scheme(JCCRA-GM)is proposed to achieve an approximate optimal solution.Numerical results show that the proposed method with low complexity can achieve almost the same weight-sum latency as the Brute-force method.展开更多
In device-to-device(D2D) communications, device terminal relaying makes it possible for devices in a network to function as transmission relays for each other to enhance the spectral efficiency. In this paper we consi...In device-to-device(D2D) communications, device terminal relaying makes it possible for devices in a network to function as transmission relays for each other to enhance the spectral efficiency. In this paper we consider a cooperative D2D communication system with simultaneous wireless information and power transfer(SWIPT). The cooperative D2D communication scheme allows two nearby devices to communicate with each other in the licensed cellular bandwidth by assigning D2D transmitters as half-duplex(HD) relay to assists cellular downlink transmissions. In particular, we focus on secure information transmission for the cellular users when the idle D2D users are the potential eavesdroppers. We aim to design secure beamforming schemes to maximize the D2D users data rate while guaranteeing the secrecy rate requirements of the cellular users and the minimum required amounts of power transferred to the idle D2D users. To solve this non-convex problem, a semi-definite programming relaxation(SDR) approach is adopted to obtain the optimal solution. Furthermore, we propose two suboptimal secure beamforming schemes with low computational complexity for providing secure communication and efficient energy transfer. Simulation results demonstrate the superiority of our proposed scheme.展开更多
In Mobile Ad-hoc Networks (MANETs), routing protocols directly affect various indices of network Quality of Service (QoS), so they play an important role in network performance. To address the drawbacks associated wit...In Mobile Ad-hoc Networks (MANETs), routing protocols directly affect various indices of network Quality of Service (QoS), so they play an important role in network performance. To address the drawbacks associated with traditional routing protocols in MANETs, such as poor anti-fading performance and slow convergence rate, for basic Dynamic Source Routing (DSR), we propose a new routing model based on Grover's searching algorithm. With this new routing model, each node maintains a node vector function, and all the nodes can obtain a node probability vector using Grover's algorithm, and then select an optimal routing according to node probability. Simulation results show that compared with DSR, this new routing protocol can effectively extend the network lifetime, as well as reduce the network delay and the number of routing hops. It can also significantly improve the anti-jamming capability of the network.展开更多
In the future fifth generation(5G) systems,non-orthogonal multiple access(NOMA) is a promising technology that can greatly enhance the network capacity compared to orthogonal multiple access(OMA) .In this paper,we pro...In the future fifth generation(5G) systems,non-orthogonal multiple access(NOMA) is a promising technology that can greatly enhance the network capacity compared to orthogonal multiple access(OMA) .In this paper,we propose a novel random access(RA) and resource allocation scheme for the coexistence of NOMA-based and OMAbased machine-to-machine(M2M) communications,which aims at improving the number of successful data packet transmissions and guaranteeing the quality of service(Qo S) (e.g.,the minimum data rate requirement) for M2 M communications.The algorithm of joint user equipment(UE) paring and power allocation is proposed for the coexisting RA(i.e.,the coexistence of NOMA-based RA and OMA-based RA) .The resource allocation for the coexisting RA is investigated,thus improving the number of successful data packet transmissions by more efficiently using the radio resources.Simulation results demonstrate that the proposed RA and resource allocation scheme outperforms the conventional RA in terms of the number of successful data packet transmissions,thus is a promising technology in future M2 M communications.展开更多
In this article we propose to facilitate local peer-to-peer communication by a Device-to-Device (D2D) radio that operates as an underlay network to an IMT-Advanced cellular network. It is expected that local services ...In this article we propose to facilitate local peer-to-peer communication by a Device-to-Device (D2D) radio that operates as an underlay network to an IMT-Advanced cellular network. It is expected that local services may utilize mobile peer-to-peer communication instead of central server based communication for rich mul-timedia services. The main challenge of the underlay radio in a multi-cell environment is to limit the inter-ference to the cellular network while achieving a reasonable link budget for the D2D radio. We propose a novel power control mechanism for D2D connections that share cellular uplink resources. The mechanism limits the maximum D2D transmit power utilizing cellular power control information of the devices in D2D communication. Thereby it enables underlaying D2D communication even in interference-limited networks with full load and without degrading the performance of the cellular network. Secondly, we study a single cell scenario consisting of a device communicating with the base station and two devices that communicate with each other. The results demonstrate that the D2D radio, sharing the same resources as the cellular net-work, can provide higher capacity (sum rate) compared to pure cellular communication where all the data is transmitted through the base station.展开更多
Unmanned aerial vehicle(UAV)communications are subject to the severe spectrum scarcity problem.Cognitive UAV networks are promising to tackle this issue while the confidential information is susceptible to be eavesdro...Unmanned aerial vehicle(UAV)communications are subject to the severe spectrum scarcity problem.Cognitive UAV networks are promising to tackle this issue while the confidential information is susceptible to be eavesdropped.A UAV jamming assisted scheme is proposed.A joint resource allocation and trajectories optimization problem is formulated in a UAV-assisted jamming cognitive UAV network subject to diverse power and trajectory constraints.An alternative optimization algorithm is proposed to solve the challenging non-convex joint optimization problem.Extensive simulation results demonstrate the superiority of our proposed scheme and many meaningful insights are obtained for the practical design of cognitive UAV networks.展开更多
In this study, an improved random access(RA) scheme for Machine-to-Machine(M2M) communications is proposed. The improved RA scheme is realized by two steps. First, the improved RA scheme achieves a reasonable resource...In this study, an improved random access(RA) scheme for Machine-to-Machine(M2M) communications is proposed. The improved RA scheme is realized by two steps. First, the improved RA scheme achieves a reasonable resource tradeoff between physical random access channel(PRACH) and physical uplink shared channel(PUSCH). To realize a low-complexity resource allocation between PRACH and PUSCH, a boundary of traffic load is derived to divide the number of active M2 M users(UEs) into multiple intervals. The corresponding resource allocation for these intervals is determined by e NB. Then the resource allocation for other number of UEs can be obtained from the allocation of these intervals with less computation. Second, the access barring on arrival rate of new UEs is introduced in the improved RA scheme to reduce the expected delay. Numerical results show that the proposed improved RA scheme can realize a low-complexity resource allocation between PRACH and PUSCH. Meanwhile, the expected delay can be effectively reduced by access barring on arriving rate of new M2 M UEs.展开更多
Internet of things and network densification bring significant challenges to uplink management.Only depending on optimization algorithm enhancements is not enough for uplink transmission.To control intercell interfere...Internet of things and network densification bring significant challenges to uplink management.Only depending on optimization algorithm enhancements is not enough for uplink transmission.To control intercell interference,Fractional Uplink Power Control(FUPC)should be optimized from network-wide perspective,which has to find a better traffic distribution model.Conventionally,traffic distribution is geographic-based,and ineffective due to tricky locating efforts.This paper proposes a novel uplink power management framework for Self-Organizing Networks(SON),which firstly builds up pathloss-based traffic distribution model and then makes the decision of FUPC based on the model.PathLoss-based Traffic Distribution(PLTD)aggregates traffic based on the propagation condition of traffic that is defined as the pathloss between the position generating the traffic and surrounding cells.Simulations show that the improvement in optimization efficiency of FUPC with PLTD can be up to 40%compared to conventional GeoGraphic-based Traffic Distribution(GGTD).展开更多
With energy harvesting capability, the Internet of things(IoT) devices transmit data depending on their available energy, which leads to a more complicated coupling and brings new technical challenges to delay optimiz...With energy harvesting capability, the Internet of things(IoT) devices transmit data depending on their available energy, which leads to a more complicated coupling and brings new technical challenges to delay optimization. In this paper,we study the delay-optimal random access(RA) in large-scale energy harvesting IoT networks. We model a two-dimensional Markov decision process(MDP)to address the coupling between the data and energy queues, and adopt the mean field game(MFG) theory to reveal the coupling among the devices by utilizing the large-scale property. Specifically, to obtain the optimal access strategy for each device, we derive the Hamilton-Jacobi-Bellman(HJB) equation which requires the statistical information of other devices.Moreover, to model the evolution of the states distribution in the system, we derive the Fokker-PlanckKolmogorov(FPK) equation based on the access strategy of devices. By solving the two coupled equations,we obtain the delay-optimal random access solution in an iterative manner with Lax-Friedrichs method. Finally, the simulation results show that the proposed scheme achieves significant performance gain compared with the conventional schemes.展开更多
In this paper,we investigate on the problem of energy-efficient traffic grooming under sliding scheduled traffic model for IP over WDM optical networks,so as to minimize the total energy consumption of the core networ...In this paper,we investigate on the problem of energy-efficient traffic grooming under sliding scheduled traffic model for IP over WDM optical networks,so as to minimize the total energy consumption of the core network.We present a two-layer auxiliary graph model and propose a new energyefficient traffic grooming heuristic named Two-Dimension Green Traffic Grooming(TDGTG) algorithm,which takes both space and time factors into consideration for network energy efficiency.We compare our proposed TDGTG algorithm with the previous traffic grooming algorithms for scheduled traffic model in terms of total energy consumption and blocking probability.The simulation results in three typical carrier topologies show the efficiency of our proposed TDGTD algorithm.展开更多
Cooperative utilization of multidimensional resources including cache, power and spectrum in satellite-terrestrial integrated networks(STINs) can provide a feasible approach for massive streaming media content deliver...Cooperative utilization of multidimensional resources including cache, power and spectrum in satellite-terrestrial integrated networks(STINs) can provide a feasible approach for massive streaming media content delivery over the seamless global coverage area. However, the on-board supportable resources of a single satellite are extremely limited and lack of interaction with others. In this paper, we design a network model with two-layered cache deployment, i.e., satellite layer and ground base station layer, and two types of sharing links, i.e., terrestrial-satellite sharing(TSS) links and inter-satellite sharing(ISS) links, to enhance the capability of cooperative delivery over STINs. Thus, we use rateless codes for the content divided-packet transmission, and derive the total energy efficiency(EE) in the whole transmission procedure, which is defined as the ratio of traffic offloading and energy consumption. We formulate two optimization problems about maximizing EE in different sharing scenarios(only TSS and TSS-ISS),and propose two optimized algorithms to obtain the optimal content placement matrixes, respectively.Simulation results demonstrate that, enabling sharing links with optimized cache placement have more than 2 times improvement of EE performance than other traditional placement schemes. Particularly, TSS-ISS schemes have the higher EE performance than only TSS schemes under the conditions of enough number of satellites and smaller inter-satellite distances.展开更多
基金supported by the National Key Research and Development Program of China under Grant 2022YFB2901501in part by the Science and Technology Innovation leading Talents Subsidy Project of Central Plains under Grant 244200510038.
文摘The rapid growth of distributed data-centric applications and AI workloads increases demand for low-latency,high-throughput communication,necessitating frequent and flexible updates to network routing configurations.However,maintaining consistent forwarding states during these updates is challenging,particularly when rerouting multiple flows simultaneously.Existing approaches pay little attention to multi-flow update,where improper update sequences across data plane nodes may construct deadlock dependencies.Moreover,these methods typically involve excessive control-data plane interactions,incurring significant resource overhead and performance degradation.This paper presents P4LoF,an efficient loop-free update approach that enables the controller to reroute multiple flows through minimal interactions.P4LoF first utilizes a greedy-based algorithm to generate the shortest update dependency chain for the single-flow update.These chains are then dynamically merged into a dependency graph and resolved as a Shortest Common Super-sequence(SCS)problem to produce the update sequence of multi-flow update.To address deadlock dependencies in multi-flow updates,P4LoF builds a deadlock-fix forwarding model that leverages the flexible packet processing capabilities of the programmable data plane.Experimental results show that P4LoF reduces control-data plane interactions by at least 32.6%with modest overhead,while effectively guaranteeing loop-free consistency.
文摘Satellite edge computing has garnered significant attention from researchers;however,processing a large volume of tasks within multi-node satellite networks still poses considerable challenges.The sharp increase in user demand for latency-sensitive tasks has inevitably led to offloading bottlenecks and insufficient computational capacity on individual satellite edge servers,making it necessary to implement effective task offloading scheduling to enhance user experience.In this paper,we propose a priority-based task scheduling strategy based on a Software-Defined Network(SDN)framework for satellite-terrestrial integrated networks,which clarifies the execution order of tasks based on their priority.Subsequently,we apply a Dueling-Double Deep Q-Network(DDQN)algorithm enhanced with prioritized experience replay to derive a computation offloading strategy,improving the experience replay mechanism within the Dueling-DDQN framework.Next,we utilize the Deep Deterministic Policy Gradient(DDPG)algorithm to determine the optimal resource allocation strategy to reduce the processing latency of sub-tasks.Simulation results demonstrate that the proposed d3-DDPG algorithm outperforms other approaches,effectively reducing task processing latency and thus improving user experience and system efficiency.
基金supported in part by the National Natural Science Foundation of China under Grants U21B2005,62201105,62331017,U24B20134,62222103,and 62025105in part by the Chongqing Municipal Education Commission under Grants KJQN202400621,KJQN202100643,and KJZDK202400608+1 种基金in part by the China Postdoctoral Science Foundation under Grant 2021M700563in part by the Chongqing Postdoctoral Funding Project under Grant 2021XM3052。
文摘Multi-band optical networks are a potential technology for increasing network capacity.However,the strong interference and non-uniformity between wavelengths in multi-band optical networks have become a bottleneck restricting the transmission capacity of multi-band optical networks.To overcome these challenges,it is particularly important to implement optical power optimization targeting wavelength differences.Therefore,based on the generalized Gaussian noise model,we first formulate an optimization model for the problems of routing,modulation format,wavelength,and power allocation in C+L+S multi-band optical networks.Our objective function is to maximize the average link capacity of the network while ensuring that the Optical Signal-to-Noise(OSNR)threshold of the service request is not exceeded.Next,we propose a NonLinear Interferenceaware(NLI-aware)routing,modulation format,wavelength,and power allocation algorithm.Finally,we conduct simulations under different test conditions.The simulation results indicate that our algorithm can effectively reduce the blocking probability by 23.5%and improve the average link capacity by 3.78%in C+L+S multi-band optical networks.
基金supported in part by Scientific Research Fund of Zhejiang Provincial Education Department under Grant Y202351110in part by Huzhou Science and Technology Plan Project under Grant 2024YZ23+1 种基金in part by Research Fund of National Key Laboratory of Advanced Communication Networks under Grant SCX23641X004in part by Postgraduate Research and Innovation Project of Huzhou University under Grant 2024KYCX50.
文摘Zero Trust Network(ZTN)enhances network security through strict authentication and access control.However,in the ZTN,optimizing flow control to improve the quality of service is still facing challenges.Software Defined Network(SDN)provides solutions through centralized control and dynamic resource allocation,but the existing scheduling methods based on Deep Reinforcement Learning(DRL)are insufficient in terms of convergence speed and dynamic optimization capability.To solve these problems,this paper proposes DRL-AMIR,which is an efficient flow scheduling method for software defined ZTN.This method constructs a flow scheduling optimization model that comprehensively considers service delay,bandwidth occupation,and path hops.Additionally,it balances the differentiated requirements of delay-critical K-flows,bandwidth-intensive D-flows,and background B-flows through adaptiveweighting.Theproposed framework employs a customized state space comprising node labels,link bandwidth,delaymetrics,and path length.It incorporates an action space derived fromnode weights and a hybrid reward function that integrates both single-step and multi-step excitation mechanisms.Based on these components,a hierarchical architecture is designed,effectively integrating the data plane,control plane,and knowledge plane.In particular,the adaptive expert mechanism is introduced,which triggers the shortest path algorithm in the training process to accelerate convergence,reduce trial and error costs,and maintain stability.Experiments across diverse real-world network topologies demonstrate that DRL-AMIR achieves a 15–20%reduction in K-flow transmission delays,a 10–15%improvement in link bandwidth utilization compared to SPR,QoSR,and DRSIR,and a 30%faster convergence speed via adaptive expert mechanisms.
文摘A new cyclic prefix(CP)-based nonoverlapping FBMC-QAM(CP-NO-FBMC-QAM)system with two prototype filters is proposed in this paper,which satisfies complex orthogonality conditions and good frequency energy confinement at the same time.We analyze its inter-carrier interference/inter-symbol interference(ICI/ISI)over multipath channels.Owing to the additional CP,the ISI of received symbols over multipath channels is eliminated in the proposed system,and the resulting improvement in the signal-to-interference ratio(SIR)performance is evaluated by theoretical analysis.Moreover,for the ICI caused by multipath propagation in received symbols,we develop a method that eliminates the ICI by frequency-domain channel estimation and equalization before the receiver filtering process.The proposed CP-NO-FBMC-QAM system and ICI cancellation method(ICICM)are validated by comparisons of implementation complexity,power spectral density(PSD),bit error rate(BER)and channel estimation performance with conventional CP-based orthogonal frequency division multiplexing(CP-OFDM)and FBMC-QAM systems.
基金supported by the Fundamental Research Funds for the Central Universities,China(No.2024MS115).
文摘Non-Orthogonal Multiple Access(NOMA)assisted Unmanned Aerial Vehicle(UAV)communication is becoming a promising technique for future B5G/6G networks.However,the security of the NOMA-UAV networks remains critical challenges due to the shared wireless spectrum and Line-of-Sight(LoS)channel.This paper formulates a joint UAV trajectory design and power allocation problem with the aid of the ground jammer to maximize the sum secrecy rate.First,the joint optimization problem is modeled as a Markov Decision Process(MDP).Then,the Deep Reinforcement Learning(DRL)method is utilized to search the optimal policy from the continuous action space.In order to accelerate the sample accumulation,the Asynchronous Advantage Actor-Critic(A3C)scheme with multiple workers is proposed,which reformulates the action and reward to acquire complete update duration.Simulation results demonstrate that the A3C-based scheme outperforms the baseline schemes in term of the secrecy rate and stability.
基金Project supported by the National Natural Science Foundation of China (Grant No. 62371253)the Postgraduate Research and Practice Innovation Program of Jiangsu Province, China (Grant No. KYCX24_1179)。
文摘As the economy grows, environmental issues are becoming increasingly severe, making the promotion of green behavior more urgent. Information dissemination and policy regulation play crucial roles in influencing and amplifying the spread of green behavior across society. To this end, a novel three-layer model in multilayer networks is proposed. In the novel model, the information layer describes green information spreading, the physical contact layer depicts green behavior propagation, and policy regulation is symbolized by an isolated node beneath the two layers. Then, we deduce the green behavior threshold for the three-layer model using the microscopic Markov chain approach. Moreover, subject to some individuals who are more likely to influence others or become green nodes and the limitations of the capacity of policy regulation, an optimal scheme is given that could optimize policy interventions to most effectively prompt green behavior.Subsequently, simulations are performed to validate the preciseness and theoretical results of the new model. It reveals that policy regulation can prompt the prevalence and outbreak of green behavior. Then, the green behavior is more likely to spread and be prevalent in the SF network than in the ER network. Additionally, optimal allocation is highly successful in facilitating the dissemination of green behavior. In practice, the optimal allocation strategy could prioritize interventions at critical nodes or regions, such as highly connected urban areas, where the impact of green behavior promotion would be most significant.
文摘Research on wide area ad hoc networks is of great significance due to its application prospect in long-range networks such as aeronautical and maritime networks,etc.The design of MAC protocols is one of the most important parts impacting the whole network performance.In this paper,we propose a dis-tributed TDMA-based MAC protocol called Dynamic Self Organizing TDMA(DSO-TDMA)for wide area ad hoc networks.DSO-TDMA includes three main features:(1)In a distributed way,nodes in the network select transmitting slots according to the congestion situation of the local air interface.(2)In a selforganization way,nodes dynamically adjust the resource occupancy ratio according to the queue length of neighbouring nodes within two-hop range.(3)In a piggyback way,the control information is transmitted together with the payload to reduce the overhead.We design the whole mechanisms,implement them in NS-3 and evaluate the performance of DSO-TDMA compared with another dynamic TDMA MAC protocol,EHR-TDMA.Results show that the end-to-end throughput of DSO-TDMA is at most 51.4%higher than that of EHR-TDMA,and the average access delay of DSO-TDMA is at most 66.05%lower than that of EHR-TDMA.
基金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.
基金This work was supported by the National Natural Science Foundation of China(Grants 61971054 and 61601045)Science and Technology on Information Transmission and Dissemination in Communication Networks Laboratory Foundation(HHX21641X002 and HHX20641X003).
文摘Benefit from the enhanced onboard processing capacities and high-speed satellite-terrestrial links,satellite edge computing has been regarded as a promising technique to facilitate the execution of the computation-intensive applications for satellite communication networks(SCNs).By deploying edge computing servers in satellite and gateway stations,SCNs can achieve significant performance gains of the computing capacities at the expense of extending the dimensions and complexity of resource management.Therefore,in this paper,we investigate the joint computing and communication resource management problem for SCNs to minimize the execution latency of the computation-intensive applications,while two different satellite edge computing scenarios and local execution are considered.Furthermore,the joint computing and communication resource allocation problem for the computation-intensive services is formulated as a mixed-integer programming problem.A game-theoretic and many-to-one matching theorybased scheme(JCCRA-GM)is proposed to achieve an approximate optimal solution.Numerical results show that the proposed method with low complexity can achieve almost the same weight-sum latency as the Brute-force method.
基金supported in part by National Natural Science Foundation of China under Grants 61602048National Natural Science Foundation of China under Grants 61471060+1 种基金Creative Research Groups of China under Grants 61421061National Science and Technology Major Project of the Ministry of Science and Technology of China under Grants 2015ZX03001025-002
文摘In device-to-device(D2D) communications, device terminal relaying makes it possible for devices in a network to function as transmission relays for each other to enhance the spectral efficiency. In this paper we consider a cooperative D2D communication system with simultaneous wireless information and power transfer(SWIPT). The cooperative D2D communication scheme allows two nearby devices to communicate with each other in the licensed cellular bandwidth by assigning D2D transmitters as half-duplex(HD) relay to assists cellular downlink transmissions. In particular, we focus on secure information transmission for the cellular users when the idle D2D users are the potential eavesdroppers. We aim to design secure beamforming schemes to maximize the D2D users data rate while guaranteeing the secrecy rate requirements of the cellular users and the minimum required amounts of power transferred to the idle D2D users. To solve this non-convex problem, a semi-definite programming relaxation(SDR) approach is adopted to obtain the optimal solution. Furthermore, we propose two suboptimal secure beamforming schemes with low computational complexity for providing secure communication and efficient energy transfer. Simulation results demonstrate the superiority of our proposed scheme.
基金supported by Zhejiang Provincial Key Laboratory of Communication Networks and Applications and National Natural Science Foundation of China under Grant No.60872020
文摘In Mobile Ad-hoc Networks (MANETs), routing protocols directly affect various indices of network Quality of Service (QoS), so they play an important role in network performance. To address the drawbacks associated with traditional routing protocols in MANETs, such as poor anti-fading performance and slow convergence rate, for basic Dynamic Source Routing (DSR), we propose a new routing model based on Grover's searching algorithm. With this new routing model, each node maintains a node vector function, and all the nodes can obtain a node probability vector using Grover's algorithm, and then select an optimal routing according to node probability. Simulation results show that compared with DSR, this new routing protocol can effectively extend the network lifetime, as well as reduce the network delay and the number of routing hops. It can also significantly improve the anti-jamming capability of the network.
基金supported by the National Natural Science Foundation of China(61501056)National Science and Technology Major Project of China(No.2016ZX03001012)the Research Fund of ZTE Corporation
文摘In the future fifth generation(5G) systems,non-orthogonal multiple access(NOMA) is a promising technology that can greatly enhance the network capacity compared to orthogonal multiple access(OMA) .In this paper,we propose a novel random access(RA) and resource allocation scheme for the coexistence of NOMA-based and OMAbased machine-to-machine(M2M) communications,which aims at improving the number of successful data packet transmissions and guaranteeing the quality of service(Qo S) (e.g.,the minimum data rate requirement) for M2 M communications.The algorithm of joint user equipment(UE) paring and power allocation is proposed for the coexisting RA(i.e.,the coexistence of NOMA-based RA and OMA-based RA) .The resource allocation for the coexisting RA is investigated,thus improving the number of successful data packet transmissions by more efficiently using the radio resources.Simulation results demonstrate that the proposed RA and resource allocation scheme outperforms the conventional RA in terms of the number of successful data packet transmissions,thus is a promising technology in future M2 M communications.
文摘In this article we propose to facilitate local peer-to-peer communication by a Device-to-Device (D2D) radio that operates as an underlay network to an IMT-Advanced cellular network. It is expected that local services may utilize mobile peer-to-peer communication instead of central server based communication for rich mul-timedia services. The main challenge of the underlay radio in a multi-cell environment is to limit the inter-ference to the cellular network while achieving a reasonable link budget for the D2D radio. We propose a novel power control mechanism for D2D connections that share cellular uplink resources. The mechanism limits the maximum D2D transmit power utilizing cellular power control information of the devices in D2D communication. Thereby it enables underlaying D2D communication even in interference-limited networks with full load and without degrading the performance of the cellular network. Secondly, we study a single cell scenario consisting of a device communicating with the base station and two devices that communicate with each other. The results demonstrate that the D2D radio, sharing the same resources as the cellular net-work, can provide higher capacity (sum rate) compared to pure cellular communication where all the data is transmitted through the base station.
基金This work was supported in part by the National Natural Science Foundation of China(No.62031012,62071223,and 62061030)in part by the National Key Research and Development Project of China(2018YFB1404303,2018YFB14043033,and 2020YFB1807602)+2 种基金in part by the National Key Scientific Instrument and Equipment Development Project(61827801)in part by the Open Project of the Shaanxi Key Laboratory of Information Communication Network and Security(ICNS201701)by Young Elite Scientist Sponsorship Program by CAST,and by Graduate Innovation Foundation of Jiangxi Province(YC2019-S0350).
文摘Unmanned aerial vehicle(UAV)communications are subject to the severe spectrum scarcity problem.Cognitive UAV networks are promising to tackle this issue while the confidential information is susceptible to be eavesdropped.A UAV jamming assisted scheme is proposed.A joint resource allocation and trajectories optimization problem is formulated in a UAV-assisted jamming cognitive UAV network subject to diverse power and trajectory constraints.An alternative optimization algorithm is proposed to solve the challenging non-convex joint optimization problem.Extensive simulation results demonstrate the superiority of our proposed scheme and many meaningful insights are obtained for the practical design of cognitive UAV networks.
基金supported by Key Laboratory of Universal Wireless Communications(Beijing University of Posts and Telecommunications),Ministry of Education,P.R.China,KFKT-2014103)National Science and Technology Major Project of China(No.2013ZX03006001)National Natural Science Foundation of China(61501056)
文摘In this study, an improved random access(RA) scheme for Machine-to-Machine(M2M) communications is proposed. The improved RA scheme is realized by two steps. First, the improved RA scheme achieves a reasonable resource tradeoff between physical random access channel(PRACH) and physical uplink shared channel(PUSCH). To realize a low-complexity resource allocation between PRACH and PUSCH, a boundary of traffic load is derived to divide the number of active M2 M users(UEs) into multiple intervals. The corresponding resource allocation for these intervals is determined by e NB. Then the resource allocation for other number of UEs can be obtained from the allocation of these intervals with less computation. Second, the access barring on arrival rate of new UEs is introduced in the improved RA scheme to reduce the expected delay. Numerical results show that the proposed improved RA scheme can realize a low-complexity resource allocation between PRACH and PUSCH. Meanwhile, the expected delay can be effectively reduced by access barring on arriving rate of new M2 M UEs.
文摘Internet of things and network densification bring significant challenges to uplink management.Only depending on optimization algorithm enhancements is not enough for uplink transmission.To control intercell interference,Fractional Uplink Power Control(FUPC)should be optimized from network-wide perspective,which has to find a better traffic distribution model.Conventionally,traffic distribution is geographic-based,and ineffective due to tricky locating efforts.This paper proposes a novel uplink power management framework for Self-Organizing Networks(SON),which firstly builds up pathloss-based traffic distribution model and then makes the decision of FUPC based on the model.PathLoss-based Traffic Distribution(PLTD)aggregates traffic based on the propagation condition of traffic that is defined as the pathloss between the position generating the traffic and surrounding cells.Simulations show that the improvement in optimization efficiency of FUPC with PLTD can be up to 40%compared to conventional GeoGraphic-based Traffic Distribution(GGTD).
基金supported in part by Key R&D Program of Zhejiang (No. 2022C03078)National Natural Science Foundation of China (No. U20A20158)+1 种基金National Key R&D Program of China (No. 2018YFB1801104)Ningbo S&T Major Project (No. 2019B10079)。
文摘With energy harvesting capability, the Internet of things(IoT) devices transmit data depending on their available energy, which leads to a more complicated coupling and brings new technical challenges to delay optimization. In this paper,we study the delay-optimal random access(RA) in large-scale energy harvesting IoT networks. We model a two-dimensional Markov decision process(MDP)to address the coupling between the data and energy queues, and adopt the mean field game(MFG) theory to reveal the coupling among the devices by utilizing the large-scale property. Specifically, to obtain the optimal access strategy for each device, we derive the Hamilton-Jacobi-Bellman(HJB) equation which requires the statistical information of other devices.Moreover, to model the evolution of the states distribution in the system, we derive the Fokker-PlanckKolmogorov(FPK) equation based on the access strategy of devices. By solving the two coupled equations,we obtain the delay-optimal random access solution in an iterative manner with Lax-Friedrichs method. Finally, the simulation results show that the proposed scheme achieves significant performance gain compared with the conventional schemes.
基金This work is supported by the National Basic Research Program of China （＂973 Program＂） under Grant 2013CB329103, National Natural Science Foundation of China （NSFC） undergrant No. 61201129 and Program for Changji- ang Scholars and Innovative Research Team in University.
文摘In this paper,we investigate on the problem of energy-efficient traffic grooming under sliding scheduled traffic model for IP over WDM optical networks,so as to minimize the total energy consumption of the core network.We present a two-layer auxiliary graph model and propose a new energyefficient traffic grooming heuristic named Two-Dimension Green Traffic Grooming(TDGTG) algorithm,which takes both space and time factors into consideration for network energy efficiency.We compare our proposed TDGTG algorithm with the previous traffic grooming algorithms for scheduled traffic model in terms of total energy consumption and blocking probability.The simulation results in three typical carrier topologies show the efficiency of our proposed TDGTD algorithm.
基金supported by National Natural Sciences Foundation of China(No.62271165,62027802,61831008)the Guangdong Basic and Applied Basic Research Foundation(No.2023A1515030297,2021A1515011572)Shenzhen Science and Technology Program ZDSYS20210623091808025,Stable Support Plan Program GXWD20231129102638002.
文摘Cooperative utilization of multidimensional resources including cache, power and spectrum in satellite-terrestrial integrated networks(STINs) can provide a feasible approach for massive streaming media content delivery over the seamless global coverage area. However, the on-board supportable resources of a single satellite are extremely limited and lack of interaction with others. In this paper, we design a network model with two-layered cache deployment, i.e., satellite layer and ground base station layer, and two types of sharing links, i.e., terrestrial-satellite sharing(TSS) links and inter-satellite sharing(ISS) links, to enhance the capability of cooperative delivery over STINs. Thus, we use rateless codes for the content divided-packet transmission, and derive the total energy efficiency(EE) in the whole transmission procedure, which is defined as the ratio of traffic offloading and energy consumption. We formulate two optimization problems about maximizing EE in different sharing scenarios(only TSS and TSS-ISS),and propose two optimized algorithms to obtain the optimal content placement matrixes, respectively.Simulation results demonstrate that, enabling sharing links with optimized cache placement have more than 2 times improvement of EE performance than other traditional placement schemes. Particularly, TSS-ISS schemes have the higher EE performance than only TSS schemes under the conditions of enough number of satellites and smaller inter-satellite distances.
