The cloud platform has limited defense resources to fully protect the edge servers used to process crowd sensing data in Internet of Things.To guarantee the network's overall security,we present a network defense ...The cloud platform has limited defense resources to fully protect the edge servers used to process crowd sensing data in Internet of Things.To guarantee the network's overall security,we present a network defense resource allocation with multi-armed bandits to maximize the network's overall benefit.Firstly,we propose the method for dynamic setting of node defense resource thresholds to obtain the defender(attacker)benefit function of edge servers(nodes)and distribution.Secondly,we design a defense resource sharing mechanism for neighboring nodes to obtain the defense capability of nodes.Subsequently,we use the decomposability and Lipschitz conti-nuity of the defender's total expected utility to reduce the difference between the utility's discrete and continuous arms and analyze the difference theoretically.Finally,experimental results show that the method maximizes the defender's total expected utility and reduces the difference between the discrete and continuous arms of the utility.展开更多
Shared manufacturing is recognized as a new point-to-point manufac-turing mode in the digital era.Shared manufacturing is referred to as a new man-ufacturing mode to realize the dynamic allocation of manufacturing tas...Shared manufacturing is recognized as a new point-to-point manufac-turing mode in the digital era.Shared manufacturing is referred to as a new man-ufacturing mode to realize the dynamic allocation of manufacturing tasks and resources.Compared with the traditional mode,shared manufacturing offers more abundant manufacturing resources and flexible configuration options.This paper proposes a model based on the description of the dynamic allocation of tasks and resources in the shared manufacturing environment,and the characteristics of shared manufacturing resource allocation.The execution of manufacturing tasks,in which candidate manufacturing resources enter or exit at various time nodes,enables the dynamic allocation of manufacturing tasks and resources.Then non-dominated sorting genetic algorithm(NSGA-II)and multi-objective particle swarm optimization(MOPSO)algorithms are designed to solve the model.The optimal parameter settings for the NSGA-II and MOPSO algorithms have been obtained according to the experiments with various population sizes and iteration numbers.In addition,the proposed model’s efficiency,which considers the entries and exits of manufacturing resources in the shared manufacturing environment,is further demonstrated by the overlap between the outputs of the NSGA-II and MOPSO algorithms for optimal resource allocation.展开更多
Distributed radio access network (DRAN) is a novel wireless access architecture and can solve the problem of the available spectrum scarcity in wireless communications. In this paper, we investigate resource allocatio...Distributed radio access network (DRAN) is a novel wireless access architecture and can solve the problem of the available spectrum scarcity in wireless communications. In this paper, we investigate resource allocation for the downlink of OFDMA DRAN. Unlike previous exclusive criterion based algorithms that allocate each subcarrier to only one user in the system, the proposed algorithms are based on shared criterion that allow each subcarrier to be allocated to multiple users through different antennas and to only one user through same antenna. First, an adaptive resource allocation algorithm based on shared criterion is proposed to maximize total system rate under each user's minimal rate and each antenna's maximal power constraints. Then we improve the above algorithm by considering the influence of the resource allocation scheme on single user. The simulation results show that the shared criterion based algorithm provide much higher total system rate than that of the exclusive criterion based algorithm at the expense of the outage performance and the fairness, while the improved algorithm based on shared criterion can achieve a good tradeoff performance.展开更多
Network virtualization can effectively establish dedicated virtual networks to implement various network functions.However,the existing research works have some shortcomings,for example,although computing resource pro...Network virtualization can effectively establish dedicated virtual networks to implement various network functions.However,the existing research works have some shortcomings,for example,although computing resource properties of individual nodes are considered,node storage properties and the network topology properties are usually ignored in Virtual Network(VN)modelling,which leads to the inaccurate measurement of node availability and priority.In addition,most static virtual network mapping methods allocate fixed resources to users during the entire life cycle,and the users’actual resource requirements vary with the workload,which results in resource allocation redundancy.Based on the above analysis,in this paper,we propose a dynamic resource sharing virtual network mapping algorithm named NMA-PRS-VNE,first,we construct a new,more realistic network framework in which the properties of nodes include computing resources,storage resources and topology properties.In the node mapping process,three properties of the node are used to measure its mapping ability.Second,we consider the resources of adjacent nodes and links instead of the traditional method of measuring the availability and priority of nodes by considering only the resource properties,so as to more accurately select the physical mapping nodes that meet the constraints and conditions and improve the success rate of subsequent link mapping.Finally,we divide the resource requirements of Virtual Network Requests(VNRs)into basic subrequirements and variable sub-variable requirements to complete dynamic resource allocation.The former represents monopolizing resource requirements by the VNRs,while the latter represents shared resources by many VNRs with the probability of occupying resources,where we keep a balance between resource sharing and collision among users by calculating the collision probability.Simulation results show that the proposed NMAPRS-VNE can increase the average acceptance rate and network revenue by 15%and 38%,and reduce the network cost and link pressure by 25%and 17%.展开更多
In this paper,maximizing energy efficiency(EE)through radio resource allocation for renewable energy powered heterogeneous cellular networks(HetNet)with energy sharing,is investigated.Our goal is to maximize the netwo...In this paper,maximizing energy efficiency(EE)through radio resource allocation for renewable energy powered heterogeneous cellular networks(HetNet)with energy sharing,is investigated.Our goal is to maximize the network EE,conquer the instability of renewable energy sources and guarantee the fairness of users during allocating resources.We define the objective function as a sum weighted EE of all links in the HetNet.We formulate the resource allocation problem in terms of subcarrier assignment,power allocation and energy sharing,as a mixed combinatorial and non-convex optimization problem.We propose an energy efficient resource allocation scheme,including a centralized resource allocation algorithm for iterative subcarrier allocation and power allocation in which the power allocation problem is solved by analytically solving the Karush-Kuhn-Tucker(KKT)conditions of the problem and a water-filling problem thereafter and a low-complexity distributed resource allocation algorithm based on reinforcement learning(RL).Our numerical results show that both centralized and distributed algorithms converge with a few times of iterations.The numerical results also show that our proposed centralized and distributed resource allocation algorithms outperform the existing reference algorithms in terms of the network EE.展开更多
The combination of orthogonal frequency division multiple access(OFDMA) with relaying techniques provides plentiful opportunities for high-performance and cost-effective networks.It requires intelligent radio resource...The combination of orthogonal frequency division multiple access(OFDMA) with relaying techniques provides plentiful opportunities for high-performance and cost-effective networks.It requires intelligent radio resource management schemes to harness these opportunities.This paper investigates the utility-based resource allocation problem in a real-time and non-real-time traffics mixed OFDMA cellular relay network to exploit the potentiality of relay.In order to apply utility theory to obtain an efficient tradeoff between throughput and fairness as well as satisfy the delay requirements of real-time traffics,a joint routing and scheduling scheme is proposed to resolve the resource allocation problem.Additionally,a low-complexity iterative algorithm is introduced to realize the scheme.The numerical results indicate that besides meeting the delay requirements of real-time traffic,the scheme can achieve the tradeoff between throughput and fairness effectively.展开更多
High-efficiency and low-cost knowledge sharing can improve the decision-making ability of autonomous vehicles by mining knowledge from the Internet of Vehicles(IoVs).However,it is challenging to ensure high efficiency...High-efficiency and low-cost knowledge sharing can improve the decision-making ability of autonomous vehicles by mining knowledge from the Internet of Vehicles(IoVs).However,it is challenging to ensure high efficiency of local data learning models while preventing privacy leakage in a high mobility environment.In order to protect data privacy and improve data learning efficiency in knowledge sharing,we propose an asynchronous federated broad learning(FBL)framework that integrates broad learning(BL)into federated learning(FL).In FBL,we design a broad fully connected model(BFCM)as a local model for training client data.To enhance the wireless channel quality for knowledge sharing and reduce the communication and computation cost of participating clients,we construct a joint resource allocation and reconfigurable intelligent surface(RIS)configuration optimization framework for FBL.The problem is decoupled into two convex subproblems.Aiming to improve the resource scheduling efficiency in FBL,a double Davidon–Fletcher–Powell(DDFP)algorithm is presented to solve the time slot allocation and RIS configuration problem.Based on the results of resource scheduling,we design a reward-allocation algorithm based on federated incentive learning(FIL)in FBL to compensate clients for their costs.The simulation results show that the proposed FBL framework achieves better performance than the comparison models in terms of efficiency,accuracy,and cost for knowledge sharing in the IoV.展开更多
This paper presents an efficient dynamic spectrum allocation (DSA) scheme in a flexible spectrum licensing environment where multiple networks coexist and interfere with each other. In particular, an extension of vi...This paper presents an efficient dynamic spectrum allocation (DSA) scheme in a flexible spectrum licensing environment where multiple networks coexist and interfere with each other. In particular, an extension of virtual boundary concept in DSA is proposed, which is spectrally efficient than the previous virtual boundary concept applied to donor systems only. Here, the same technique is applied to both donor and rental systems so as to further reduce the occurrences where the insertion of guard bands is obligatory and as a result provides better spectral efficiency. The proposed extension improves the spectrum utilization without any compromise on interference and fairness issues.展开更多
Well-controlled resource allocation is crucial for promoting the performance of multiple input multiple output orthogonal frequency division multiplexing(MIMO-OFDM) systems. Recent studies have focused primarily on tr...Well-controlled resource allocation is crucial for promoting the performance of multiple input multiple output orthogonal frequency division multiplexing(MIMO-OFDM) systems. Recent studies have focused primarily on traditional centralized systems or distributed antenna systems(DASs), and usually assumed that one sub-carrier or sub-channel is exclusively occupied by one user. To promote system performance, we propose a sub-channel shared resource allocation algorithm for multiuser distributed MIMO-OFDM systems. Each sub-channel can be shared by multiple users in the algorithm, which is different from previous algorithms. The algorithm assumes that each user communicates with only two best ports in the system. On each sub-carrier, it allocates a sub-channel in descending order, which means one sub-channel that can minimize signal to leakage plus noise ratio(SLNR) loss is deleted until the number of remaining sub-channels is equal to that of receiving antennas. If there are still sub-channels after all users are processed, these sub-channels will be allocated to users who can maximize the SLNR gain. Simulations show that compared to other algorithms, our proposed algorithm has better capacity performance and enables the system to provide service to more users under the same capacity constraints.展开更多
共享单车调配是优化城市交通资源配置的重要手段,但目前的最优路径调配方法往往对单车系统规模敏感。为此,研究一种分时段、区域间调配的共享单车投放方法,提出了带约束的游牧算法(nomad algorithm with constraints,NCA)求解调配模型...共享单车调配是优化城市交通资源配置的重要手段,但目前的最优路径调配方法往往对单车系统规模敏感。为此,研究一种分时段、区域间调配的共享单车投放方法,提出了带约束的游牧算法(nomad algorithm with constraints,NCA)求解调配模型的最优解。将单车调配问题建模为以单车流量为约束、以最小化运营损耗为目标的优化问题;提出求解上述模型的NCA算法,预测投放区域单车存量和区域间转移量,相比无约束的原游牧算法,改进了局部搜索和全局寻优策略,优化了部落初定位方法;基于预测的存量和转移量得出分时段区域间单车的调配方案。在上海和纽约相关数据集上的对比实验结果表明,运行时长约为其他方法的15%,租赁需求响应率高于分支定界算法0.15%,单车总数和运营损耗比遗传算法降低了约10%,验证了该方法具有更高的优化效率和用户需求响应率。展开更多
The increasing integration of intermittent renewable energy sources(RESs)poses great challenges to active distribution networks(ADNs),such as frequent voltage fluctuations.This paper proposes a novel ADN strategy base...The increasing integration of intermittent renewable energy sources(RESs)poses great challenges to active distribution networks(ADNs),such as frequent voltage fluctuations.This paper proposes a novel ADN strategy based on multiagent deep reinforcement learning(MADRL),which harnesses the regulating function of switch state transitions for the realtime voltage regulation and loss minimization.After deploying the calculated optimal switch topologies,the distribution network operator will dynamically adjust the distributed energy resources(DERs)to enhance the operation performance of ADNs based on the policies trained by the MADRL algorithm.Owing to the model-free characteristics and the generalization of deep reinforcement learning,the proposed strategy can still achieve optimization objectives even when applied to similar but unseen environments.Additionally,integrating parameter sharing(PS)and prioritized experience replay(PER)mechanisms substantially improves the strategic performance and scalability.This framework has been tested on modified IEEE 33-bus,IEEE 118-bus,and three-phase unbalanced 123-bus systems.The results demonstrate the significant real-time regulation capabilities of the proposed strategy.展开更多
基金supported by the National Natural Science Foundation of China(NSFC)[grant numbers 62172377,61872205]the Shandong Provincial Natural Science Foundation[grant number ZR2019MF018]the Startup Research Foundation for Distinguished Scholars No.202112016.
文摘The cloud platform has limited defense resources to fully protect the edge servers used to process crowd sensing data in Internet of Things.To guarantee the network's overall security,we present a network defense resource allocation with multi-armed bandits to maximize the network's overall benefit.Firstly,we propose the method for dynamic setting of node defense resource thresholds to obtain the defender(attacker)benefit function of edge servers(nodes)and distribution.Secondly,we design a defense resource sharing mechanism for neighboring nodes to obtain the defense capability of nodes.Subsequently,we use the decomposability and Lipschitz conti-nuity of the defender's total expected utility to reduce the difference between the utility's discrete and continuous arms and analyze the difference theoretically.Finally,experimental results show that the method maximizes the defender's total expected utility and reduces the difference between the discrete and continuous arms of the utility.
基金This work was supported by the Key Program of Social Science Planning Foundation of Liaoning Province under Grant L21AGL017.
文摘Shared manufacturing is recognized as a new point-to-point manufac-turing mode in the digital era.Shared manufacturing is referred to as a new man-ufacturing mode to realize the dynamic allocation of manufacturing tasks and resources.Compared with the traditional mode,shared manufacturing offers more abundant manufacturing resources and flexible configuration options.This paper proposes a model based on the description of the dynamic allocation of tasks and resources in the shared manufacturing environment,and the characteristics of shared manufacturing resource allocation.The execution of manufacturing tasks,in which candidate manufacturing resources enter or exit at various time nodes,enables the dynamic allocation of manufacturing tasks and resources.Then non-dominated sorting genetic algorithm(NSGA-II)and multi-objective particle swarm optimization(MOPSO)algorithms are designed to solve the model.The optimal parameter settings for the NSGA-II and MOPSO algorithms have been obtained according to the experiments with various population sizes and iteration numbers.In addition,the proposed model’s efficiency,which considers the entries and exits of manufacturing resources in the shared manufacturing environment,is further demonstrated by the overlap between the outputs of the NSGA-II and MOPSO algorithms for optimal resource allocation.
文摘Distributed radio access network (DRAN) is a novel wireless access architecture and can solve the problem of the available spectrum scarcity in wireless communications. In this paper, we investigate resource allocation for the downlink of OFDMA DRAN. Unlike previous exclusive criterion based algorithms that allocate each subcarrier to only one user in the system, the proposed algorithms are based on shared criterion that allow each subcarrier to be allocated to multiple users through different antennas and to only one user through same antenna. First, an adaptive resource allocation algorithm based on shared criterion is proposed to maximize total system rate under each user's minimal rate and each antenna's maximal power constraints. Then we improve the above algorithm by considering the influence of the resource allocation scheme on single user. The simulation results show that the shared criterion based algorithm provide much higher total system rate than that of the exclusive criterion based algorithm at the expense of the outage performance and the fairness, while the improved algorithm based on shared criterion can achieve a good tradeoff performance.
基金We are grateful for the support of the Natural Science Foundation of Shandong Province(No.ZR2020LZH008,ZR2020QF112,ZR2019MF071)the National Natural Science Foundation of China(61373149).
文摘Network virtualization can effectively establish dedicated virtual networks to implement various network functions.However,the existing research works have some shortcomings,for example,although computing resource properties of individual nodes are considered,node storage properties and the network topology properties are usually ignored in Virtual Network(VN)modelling,which leads to the inaccurate measurement of node availability and priority.In addition,most static virtual network mapping methods allocate fixed resources to users during the entire life cycle,and the users’actual resource requirements vary with the workload,which results in resource allocation redundancy.Based on the above analysis,in this paper,we propose a dynamic resource sharing virtual network mapping algorithm named NMA-PRS-VNE,first,we construct a new,more realistic network framework in which the properties of nodes include computing resources,storage resources and topology properties.In the node mapping process,three properties of the node are used to measure its mapping ability.Second,we consider the resources of adjacent nodes and links instead of the traditional method of measuring the availability and priority of nodes by considering only the resource properties,so as to more accurately select the physical mapping nodes that meet the constraints and conditions and improve the success rate of subsequent link mapping.Finally,we divide the resource requirements of Virtual Network Requests(VNRs)into basic subrequirements and variable sub-variable requirements to complete dynamic resource allocation.The former represents monopolizing resource requirements by the VNRs,while the latter represents shared resources by many VNRs with the probability of occupying resources,where we keep a balance between resource sharing and collision among users by calculating the collision probability.Simulation results show that the proposed NMAPRS-VNE can increase the average acceptance rate and network revenue by 15%and 38%,and reduce the network cost and link pressure by 25%and 17%.
基金This work was supported by the National Natural Science Foundation of China(61871046 and 61871058).
文摘In this paper,maximizing energy efficiency(EE)through radio resource allocation for renewable energy powered heterogeneous cellular networks(HetNet)with energy sharing,is investigated.Our goal is to maximize the network EE,conquer the instability of renewable energy sources and guarantee the fairness of users during allocating resources.We define the objective function as a sum weighted EE of all links in the HetNet.We formulate the resource allocation problem in terms of subcarrier assignment,power allocation and energy sharing,as a mixed combinatorial and non-convex optimization problem.We propose an energy efficient resource allocation scheme,including a centralized resource allocation algorithm for iterative subcarrier allocation and power allocation in which the power allocation problem is solved by analytically solving the Karush-Kuhn-Tucker(KKT)conditions of the problem and a water-filling problem thereafter and a low-complexity distributed resource allocation algorithm based on reinforcement learning(RL).Our numerical results show that both centralized and distributed algorithms converge with a few times of iterations.The numerical results also show that our proposed centralized and distributed resource allocation algorithms outperform the existing reference algorithms in terms of the network EE.
基金Sponsored by the Self-Determined Research Funds of Huazhong Normal University from the Colleges’Basic Research and Operation of MOE
文摘The combination of orthogonal frequency division multiple access(OFDMA) with relaying techniques provides plentiful opportunities for high-performance and cost-effective networks.It requires intelligent radio resource management schemes to harness these opportunities.This paper investigates the utility-based resource allocation problem in a real-time and non-real-time traffics mixed OFDMA cellular relay network to exploit the potentiality of relay.In order to apply utility theory to obtain an efficient tradeoff between throughput and fairness as well as satisfy the delay requirements of real-time traffics,a joint routing and scheduling scheme is proposed to resolve the resource allocation problem.Additionally,a low-complexity iterative algorithm is introduced to realize the scheme.The numerical results indicate that besides meeting the delay requirements of real-time traffic,the scheme can achieve the tradeoff between throughput and fairness effectively.
基金supported in part by the National Natural Science Foundation of China(62371116 and 62231020)in part by the Science and Technology Project of Hebei Province Education Department(ZD2022164)+2 种基金in part by the Fundamental Research Funds for the Central Universities(N2223031)in part by the Open Research Project of Xidian University(ISN24-08)Key Laboratory of Cognitive Radio and Information Processing,Ministry of Education(Guilin University of Electronic Technology,China,CRKL210203)。
文摘High-efficiency and low-cost knowledge sharing can improve the decision-making ability of autonomous vehicles by mining knowledge from the Internet of Vehicles(IoVs).However,it is challenging to ensure high efficiency of local data learning models while preventing privacy leakage in a high mobility environment.In order to protect data privacy and improve data learning efficiency in knowledge sharing,we propose an asynchronous federated broad learning(FBL)framework that integrates broad learning(BL)into federated learning(FL).In FBL,we design a broad fully connected model(BFCM)as a local model for training client data.To enhance the wireless channel quality for knowledge sharing and reduce the communication and computation cost of participating clients,we construct a joint resource allocation and reconfigurable intelligent surface(RIS)configuration optimization framework for FBL.The problem is decoupled into two convex subproblems.Aiming to improve the resource scheduling efficiency in FBL,a double Davidon–Fletcher–Powell(DDFP)algorithm is presented to solve the time slot allocation and RIS configuration problem.Based on the results of resource scheduling,we design a reward-allocation algorithm based on federated incentive learning(FIL)in FBL to compensate clients for their costs.The simulation results show that the proposed FBL framework achieves better performance than the comparison models in terms of efficiency,accuracy,and cost for knowledge sharing in the IoV.
基金This work was supported in part by the National Nature Science Foundation of China (NSFC) under Grant No. 90604035the 863 high-tech R&D program of China under Grant No. 2005AA123950.
文摘This paper presents an efficient dynamic spectrum allocation (DSA) scheme in a flexible spectrum licensing environment where multiple networks coexist and interfere with each other. In particular, an extension of virtual boundary concept in DSA is proposed, which is spectrally efficient than the previous virtual boundary concept applied to donor systems only. Here, the same technique is applied to both donor and rental systems so as to further reduce the occurrences where the insertion of guard bands is obligatory and as a result provides better spectral efficiency. The proposed extension improves the spectrum utilization without any compromise on interference and fairness issues.
基金Project supported by the National High-Tech R&D Program(863) of China(Nos.2012AA01A502 and 2012AA01A505)
文摘Well-controlled resource allocation is crucial for promoting the performance of multiple input multiple output orthogonal frequency division multiplexing(MIMO-OFDM) systems. Recent studies have focused primarily on traditional centralized systems or distributed antenna systems(DASs), and usually assumed that one sub-carrier or sub-channel is exclusively occupied by one user. To promote system performance, we propose a sub-channel shared resource allocation algorithm for multiuser distributed MIMO-OFDM systems. Each sub-channel can be shared by multiple users in the algorithm, which is different from previous algorithms. The algorithm assumes that each user communicates with only two best ports in the system. On each sub-carrier, it allocates a sub-channel in descending order, which means one sub-channel that can minimize signal to leakage plus noise ratio(SLNR) loss is deleted until the number of remaining sub-channels is equal to that of receiving antennas. If there are still sub-channels after all users are processed, these sub-channels will be allocated to users who can maximize the SLNR gain. Simulations show that compared to other algorithms, our proposed algorithm has better capacity performance and enables the system to provide service to more users under the same capacity constraints.
文摘共享单车调配是优化城市交通资源配置的重要手段,但目前的最优路径调配方法往往对单车系统规模敏感。为此,研究一种分时段、区域间调配的共享单车投放方法,提出了带约束的游牧算法(nomad algorithm with constraints,NCA)求解调配模型的最优解。将单车调配问题建模为以单车流量为约束、以最小化运营损耗为目标的优化问题;提出求解上述模型的NCA算法,预测投放区域单车存量和区域间转移量,相比无约束的原游牧算法,改进了局部搜索和全局寻优策略,优化了部落初定位方法;基于预测的存量和转移量得出分时段区域间单车的调配方案。在上海和纽约相关数据集上的对比实验结果表明,运行时长约为其他方法的15%,租赁需求响应率高于分支定界算法0.15%,单车总数和运营损耗比遗传算法降低了约10%,验证了该方法具有更高的优化效率和用户需求响应率。
基金supported by the National Natural Science Foundation of China(No.52077146)Sichuan Science and Technology Program(No.2023NSFSC1945)。
文摘The increasing integration of intermittent renewable energy sources(RESs)poses great challenges to active distribution networks(ADNs),such as frequent voltage fluctuations.This paper proposes a novel ADN strategy based on multiagent deep reinforcement learning(MADRL),which harnesses the regulating function of switch state transitions for the realtime voltage regulation and loss minimization.After deploying the calculated optimal switch topologies,the distribution network operator will dynamically adjust the distributed energy resources(DERs)to enhance the operation performance of ADNs based on the policies trained by the MADRL algorithm.Owing to the model-free characteristics and the generalization of deep reinforcement learning,the proposed strategy can still achieve optimization objectives even when applied to similar but unseen environments.Additionally,integrating parameter sharing(PS)and prioritized experience replay(PER)mechanisms substantially improves the strategic performance and scalability.This framework has been tested on modified IEEE 33-bus,IEEE 118-bus,and three-phase unbalanced 123-bus systems.The results demonstrate the significant real-time regulation capabilities of the proposed strategy.