To meet the communication services with diverse requirements,dynamic resource allocation has shown increasing importance.In this paper,we consider the multi-slot and multi-user resource allocation(MSMU-RA)in a downlin...To meet the communication services with diverse requirements,dynamic resource allocation has shown increasing importance.In this paper,we consider the multi-slot and multi-user resource allocation(MSMU-RA)in a downlink cellular scenario with the aim of maximizing system spectral efficiency while guaranteeing user fairness.We first model the MSMURA problem as a dual-sequence decision-making process,and then solve it by a novel Transformerbased deep reinforcement learning(TDRL)approach.Specifically,the proposed TDRL approach can be achieved based on two aspects:1)To adapt to the dynamic wireless environment,the proximal policy optimization(PPO)algorithm is used to optimize the multi-slot RA strategy.2)To avoid co-channel interference,the Transformer-based PPO algorithm is presented to obtain the optimal multi-user RA scheme by exploring the mapping between user sequence and resource sequence.Experimental results show that:i)the proposed approach outperforms both the traditional and DRL methods in spectral efficiency and user fairness,ii)the proposed algorithm is superior to DRL approaches in terms of convergence speed and generalization performance.展开更多
In this paper,we investigate a multi-UAV aided NOMA communication system,where multiple UAV-mounted aerial base stations are employed to serve ground users in the downlink NOMA communication,and each UAV serves its as...In this paper,we investigate a multi-UAV aided NOMA communication system,where multiple UAV-mounted aerial base stations are employed to serve ground users in the downlink NOMA communication,and each UAV serves its associated users on its own bandwidth.We aim at maximizing the overall common throughput in a finite time period.Such a problem is a typical mixed integer nonlinear problem,which involves both continuous-variable and combinatorial optimizations.To efficiently solve this problem,we propose a two-layer algorithm,which separately tackles continuous-variable and combinatorial optimization.Specifically,in the inner layer given one user association scheme,subproblems of bandwidth allocation,power allocation and trajectory design are solved based on alternating optimization.In the outer layer,a small number of candidate user association schemes are generated from an initial scheme and the best solution can be determined by comparing all the candidate schemes.In particular,a clustering algorithm based on K-means is applied to produce all candidate user association schemes,the successive convex optimization technique is adopted in the power allocation subproblem and a logistic function approximation approach is employed in the trajectory design subproblem.Simulation results show that the proposed NOMA scheme outperforms three baseline schemes in downlink common throughput,including one solution proposed in an existing literature.展开更多
Hidden champions play a critical role in China’s efforts to overcome technological and industrial“chokepoints”.These enterprises are pivotal for breaking free from Western technological embargoes,avoiding entrapmen...Hidden champions play a critical role in China’s efforts to overcome technological and industrial“chokepoints”.These enterprises are pivotal for breaking free from Western technological embargoes,avoiding entrapment in low-value-added production,and driving industrial upgrading.Given the distinct market environment in which China’s hidden champions have emerged,it is both timely and practically significant to examine their growth trajectories and underlying mechanisms.This study adopts a resource allocation perspective to investigate the development path of Chinese manufacturing enterprises into hidden champions,using a vertical case study of Hailiya Group.The findings reveal that such enterprises achieve hidden champion status by vertically concentrating on niche markets while harnessing technological potential and horizontally diversifying their technology application scenarios.Their growth follows a“T-shaped”strategy,combining vertical specialization in a focused market with horizontal expansion into new applications.Four critical mechanisms underpin the rise of manufacturing hidden champions:market niche positioning,innovation-driven focus,application scenario expansion,and ecosystem development.Specifically,these enterprises strategically target niche markets,establish a technology-oriented competitive edge,broaden technology applications to unlock new profit opportunities,and develop collaborative ecosystems to share resources and drive industrial advancement.This paper not only extends the interpretive boundaries of resource allocation theory but also offers fresh insights into the emergence of Chinese manufacturing enterprises as hidden champions,enriching our understanding of their unique growth dynamics.展开更多
With the advancement of the new medical reform,public hospitals face numerous challenges and opportunities,making the optimization of human resource allocation a critical priority.This paper analyzes the requirements ...With the advancement of the new medical reform,public hospitals face numerous challenges and opportunities,making the optimization of human resource allocation a critical priority.This paper analyzes the requirements imposed by the new medical reform on human resource allocation in public hospitals,examines existing issues such as an unbalanced personnel structure,unscientific job design,and an inadequate talent mobility mechanism,and proposes corresponding optimization strategies.These strategies include improving the recruitment and selection process,scientifically planning job structures,and establishing a flexible talent mobility mechanism.The goal is to enhance the quality of medical services,improve hospital operational efficiency,and promote the sustainable development of public hospitals.展开更多
In this paper,we propose a joint power and frequency allocation algorithm considering interference protection in the integrated satellite and terrestrial network(ISTN).We efficiently utilize spectrum resources by allo...In this paper,we propose a joint power and frequency allocation algorithm considering interference protection in the integrated satellite and terrestrial network(ISTN).We efficiently utilize spectrum resources by allowing user equipment(UE)of terrestrial networks to share frequencies with satellite networks.In order to protect the satellite terminal(ST),the base station(BS)needs to control the transmit power and frequency resources of the UE.The optimization problem involves maximizing the achievable throughput while satisfying the interference protection constraints of the ST and the quality of service(QoS)of the UE.However,this problem is highly nonconvex,and we decompose it into power allocation and frequency resource scheduling subproblems.In the power allocation subproblem,we propose a power allocation algorithm based on interference probability(PAIP)to address channel uncertainty.We obtain the suboptimal power allocation solution through iterative optimization.In the frequency resource scheduling subproblem,we develop a heuristic algorithm to handle the non-convexity of the problem.The simulation results show that the combination of power allocation and frequency resource scheduling algorithms can improve spectrum utilization.展开更多
With the rapid development of Intelligent Transportation Systems(ITS),many new applications for Intelligent Connected Vehicles(ICVs)have sprung up.In order to tackle the conflict between delay-sensitive applications a...With the rapid development of Intelligent Transportation Systems(ITS),many new applications for Intelligent Connected Vehicles(ICVs)have sprung up.In order to tackle the conflict between delay-sensitive applications and resource-constrained vehicles,computation offloading paradigm that transfers computation tasks from ICVs to edge computing nodes has received extensive attention.However,the dynamic network conditions caused by the mobility of vehicles and the unbalanced computing load of edge nodes make ITS face challenges.In this paper,we propose a heterogeneous Vehicular Edge Computing(VEC)architecture with Task Vehicles(TaVs),Service Vehicles(SeVs)and Roadside Units(RSUs),and propose a distributed algorithm,namely PG-MRL,which jointly optimizes offloading decision and resource allocation.In the first stage,the offloading decisions of TaVs are obtained through a potential game.In the second stage,a multi-agent Deep Deterministic Policy Gradient(DDPG),one of deep reinforcement learning algorithms,with centralized training and distributed execution is proposed to optimize the real-time transmission power and subchannel selection.The simulation results show that the proposed PG-MRL algorithm has significant improvements over baseline algorithms in terms of system delay.展开更多
Low earth orbit(LEO)satellites with wide coverage can carry the mobile edge computing(MEC)servers with powerful computing capabilities to form the LEO satellite edge computing system,providing computing services for t...Low earth orbit(LEO)satellites with wide coverage can carry the mobile edge computing(MEC)servers with powerful computing capabilities to form the LEO satellite edge computing system,providing computing services for the global ground users.In this paper,the computation offloading problem and resource allocation problem are formulated as a mixed integer nonlinear program(MINLP)problem.This paper proposes a computation offloading algorithm based on deep deterministic policy gradient(DDPG)to obtain the user offloading decisions and user uplink transmission power.This paper uses the convex optimization algorithm based on Lagrange multiplier method to obtain the optimal MEC server resource allocation scheme.In addition,the expression of suboptimal user local CPU cycles is derived by relaxation method.Simulation results show that the proposed algorithm can achieve excellent convergence effect,and the proposed algorithm significantly reduces the system utility values at considerable time cost compared with other algorithms.展开更多
The unmanned aerial vehicle(UAV)-assisted mobile edge computing(MEC)has been deemed a promising solution for energy-constrained devices to run smart applications with computationintensive and latency-sensitive require...The unmanned aerial vehicle(UAV)-assisted mobile edge computing(MEC)has been deemed a promising solution for energy-constrained devices to run smart applications with computationintensive and latency-sensitive requirements,especially in some infrastructure-limited areas or some emergency scenarios.However,the multi-UAVassisted MEC network remains largely unexplored.In this paper,the dynamic trajectory optimization and computation offloading are studied in a multi-UAVassisted MEC system where multiple UAVs fly over a target area with different trajectories to serve ground users.By considering the dynamic channel condition and random task arrival and jointly optimizing UAVs'trajectories,user association,and subchannel assignment,the average long-term sum of the user energy consumption minimization problem is formulated.To address the problem involving both discrete and continuous variables,a hybrid decision deep reinforcement learning(DRL)-based intelligent energyefficient resource allocation and trajectory optimization algorithm is proposed,named HDRT algorithm,where deep Q network(DQN)and deep deterministic policy gradient(DDPG)are invoked to process discrete and continuous variables,respectively.Simulation results show that the proposed HDRT algorithm converges fast and outperforms other benchmarks in the aspect of user energy consumption and latency.展开更多
The joint channel and power allocation in the downlink transmission of multi-user multi-carrier code division multiple access（MC-CDMA） systems are investigated and the throughput maximization problem is considered a...The joint channel and power allocation in the downlink transmission of multi-user multi-carrier code division multiple access（MC-CDMA） systems are investigated and the throughput maximization problem is considered as a mixed integer optimization problem. For simplicity of analysis, the problem is divided into two less complex sub-problems： power allocation and channel allocation, which can be solved by a suboptimal adaptive power allocation （APA）algorithm and an optimal adaptive channel allocation （ACA） algorithm, respectively. By combining APA and ACA algorithms, an adaptive channel and power allocation scheme is proposed. The numerical results show that the proposed APA algorithm is more suitable for MC-CDMA systems than the conventional equal power allocation algorithm, and that the proposed channel and power allocation scheme can significantly improve the system throughout performance.展开更多
Multi-user cognitive radio network resource allocation based on the adaptive niche immune genetic algorithm is proposed, and a fitness function is provided. Simulations are conducted using the adaptive niche immune ge...Multi-user cognitive radio network resource allocation based on the adaptive niche immune genetic algorithm is proposed, and a fitness function is provided. Simulations are conducted using the adaptive niche immune genetic algo- rithm, the simulated annealing algorithm, the quantum genetic algorithm and the simple genetic algorithm, respectively. The results show that the adaptive niche immune genetic algorithm performs better than the other three algorithms in terms of the multi-user cognitive radio network resource allocation, and has quick convergence speed and strong global searching capability, which effectively reduces the system power consumption and bit error rate.展开更多
Collaborative edge computing is a promising direction to handle the computation intensive tasks in B5G wireless networks.However,edge computing servers(ECSs)from different operators may not trust each other,and thus t...Collaborative edge computing is a promising direction to handle the computation intensive tasks in B5G wireless networks.However,edge computing servers(ECSs)from different operators may not trust each other,and thus the incentives for collaboration cannot be guaranteed.In this paper,we propose a consortium blockchain enabled collaborative edge computing framework,where users can offload computing tasks to ECSs from different operators.To minimize the total delay of users,we formulate a joint task offloading and resource optimization problem,under the constraint of the computing capability of each ECS.We apply the Tammer decomposition method and heuristic optimization algorithms to obtain the optimal solution.Finally,we propose a reputation based node selection approach to facilitate the consensus process,and also consider a completion time based primary node selection to avoid monopolization of certain edge node and enhance the security of the blockchain.Simulation results validate the effectiveness of the proposed algorithm,and the total delay can be reduced by up to 40%compared with the non-cooperative case.展开更多
The bits and power allocation model of adaptive power-rate mixture for multi-user multi-server power-line communication systems was analyzed with the restrictions of maximal total power,fixed rate for each real time (...The bits and power allocation model of adaptive power-rate mixture for multi-user multi-server power-line communication systems was analyzed with the restrictions of maximal total power,fixed rate for each real time (RT) user,minimal rate for each non-real time (NRT) user,maximal bits and power for each subcarrier in each orthogonal frequency division multiplexing (OFDM) symbol. An algorithm of resource dynamic allocation in the first OFDM symbol of each frame and resource optimal adjustment in the latter OFDM symbol of each frame was proposed. In the first OFDM symbol of every frame,resource is firstly assigned for RT users so as to minimize their total used power until satisfying their fixed rates; secondly the remainder resource of power and subcarriers are assigned for NRT users so as to minimize their total used power until satisfying their minimal rates also; lastly the remainder resource is again assigned for NRT users according to the proportional fairness strategy so as to maximize their total assigning rate. In the latter OFDM symbol of each frame,bits are swapped and power is adjusted for every user based on the resource allocation results of anterior OFDM symbol. The algorithm is tested in the typical power-line channel scenarios and the simulation results indicate that the proposed algorithm has better performances than the classical multi-user resource allocation algorithms and it realizes the multiple aims of multi-user multi-server resource allocation for power-line communication systems.展开更多
Sensing in wireless local area network(WLAN) gains great interests recently. In this paper we focus on the multi-user WLAN sensing problem under the existing 802.11 standards. Multiple stations perform sensing with th...Sensing in wireless local area network(WLAN) gains great interests recently. In this paper we focus on the multi-user WLAN sensing problem under the existing 802.11 standards. Multiple stations perform sensing with the access point and transmit channel state information(CSI)report simultaneously on the basis of uplink-orthogonal frequency division multiple access(OFDMA). Considering the transmission resource consumed in CSI report and the padding wastage in OFDMA based CSI report, we optimize the CSI simplification and uplink resource unit(RU)allocation jointly, aiming to balance the sensing accuracy and padding wastage performances in WLAN sensing. We propose the minimize padding maximize efficiency(MPME) algorithm to solve the problem and evaluate the performance of the proposed algorithm through extensive simulations.展开更多
Federated Edge Learning(FEL),an emerging distributed Machine Learning(ML)paradigm,enables model training in a distributed environment while ensuring user privacy by using physical separation for each user’s data.Howe...Federated Edge Learning(FEL),an emerging distributed Machine Learning(ML)paradigm,enables model training in a distributed environment while ensuring user privacy by using physical separation for each user’s data.However,with the development of complex application scenarios such as the Internet of Things(IoT)and Smart Earth,the conventional resource allocation schemes can no longer effectively support these growing computational and communication demands.Therefore,joint resource optimization may be the key solution to the scaling problem.This paper simultaneously addresses the multifaceted challenges of computation and communication,with the growing multiple resource demands.We systematically review the joint allocation strategies for different resources(computation,data,communication,and network topology)in FEL,and summarize the advantages in improving system efficiency,reducing latency,enhancing resource utilization,and enhancing robustness.In addition,we present the potential ability of joint optimization to enhance privacy preservation by reducing communication requirements,indirectly.This work not only provides theoretical support for resource management in federated learning(FL)systems,but also provides ideas for potential optimal deployment in multiple real-world scenarios.By thoroughly discussing the current challenges and future research directions,it also provides some important insights into multi-resource optimization in complex application environments.展开更多
The performance of massive MIMO systems relies heavily on the availability of Channel State Information at the Transmitter(CSIT).A large amount of work has been devoted to reducing the CSIT acquisition overhead at the...The performance of massive MIMO systems relies heavily on the availability of Channel State Information at the Transmitter(CSIT).A large amount of work has been devoted to reducing the CSIT acquisition overhead at the pilot training and/or CsI feedback stage.In fact,the downlink communication generally includes three stages,i.e.,pilot training,CsI feedback,and data transmission.These three stages are mutually related and jointly determine the overall system performance.Unfortunately,there exist few studies on the reduction of csIT acquisition overhead from the global point of view.In this paper,we integrate the Minimum Mean Square Error(MMSE)channel estimation,Random Vector Quantization(RVQ)based limited feedback and Maximal Ratio Combining(MRC)precoding into a unified framework for investigating the resource allocation problem.In particular,we first approximate the covariance matrix of the quantization error with a simple expression and derive an analytical expression of the received Signal-to-Noise Ratio(SNR)based on the deterministic equivalence theory.Then the three performance metrics(the spectral efficiency,energy efficiency,and total energy consumption)oriented problems are formulated analytically.With practical system requirements,these three metrics can be collaboratively optimized.Finally,we propose an optimization solver to derive the optimal partition of channel coherence time.Experiment results verify the benefits of the proposed resource allocation schemes under three different scenarios and illustrate the tradeoff of resource allocation between three stages.展开更多
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.展开更多
With the rapid development of Network Function Virtualization(NFV),the problem of low resource utilizationin traditional data centers is gradually being addressed.However,existing research does not optimize both local...With the rapid development of Network Function Virtualization(NFV),the problem of low resource utilizationin traditional data centers is gradually being addressed.However,existing research does not optimize both localand global allocation of resources in data centers.Hence,we propose an adaptive hybrid optimization strategy thatcombines dynamic programming and neural networks to improve resource utilization and service quality in datacenters.Our approach encompasses a service function chain simulation generator,a parallel architecture servicesystem,a dynamic programming strategy formaximizing the utilization of local server resources,a neural networkfor predicting the global utilization rate of resources and a global resource optimization strategy for bottleneck andredundant resources.With the implementation of our local and global resource allocation strategies,the systemperformance is significantly optimized through simulation.展开更多
Collaborative edge computing is a promising direction to handle the computation intensive tasks in B5G wireless networks.However,edge computing servers(ECSs)from different operators may not trust each other,and thus t...Collaborative edge computing is a promising direction to handle the computation intensive tasks in B5G wireless networks.However,edge computing servers(ECSs)from different operators may not trust each other,and thus the incentives for collaboration cannot be guaranteed.In this paper,we propose a consortium blockchain enabled collaborative edge computing framework,where users can offload computing tasks to ECSs from different operators.To minimize the total delay of users,we formulate a joint task offloading and resource optimization problem,under the constraint of the computing capability of each ECS.We apply the Tammer decomposition method and heuristic optimization algorithms to obtain the optimal solution.Finally,we propose a reputation based node selection approach to facilitate the consensus process,and also consider a completion time based primary node selection to avoid monopolization of certain edge node and enhance the security of the blockchain.Simulation results validate the effectiveness of the proposed algorithm,and the total delay can be reduced by up to 40%compared with the non-cooperative case.展开更多
Users and edge servers are not fullymutually trusted inmobile edge computing(MEC),and hence blockchain can be introduced to provide trustableMEC.In blockchain-basedMEC,each edge server functions as a node in bothMEC a...Users and edge servers are not fullymutually trusted inmobile edge computing(MEC),and hence blockchain can be introduced to provide trustableMEC.In blockchain-basedMEC,each edge server functions as a node in bothMEC and blockchain,processing users’tasks and then uploading the task related information to the blockchain.That is,each edge server runs both users’offloaded tasks and blockchain tasks simultaneously.Note that there is a trade-off between the resource allocation for MEC and blockchain tasks.Therefore,the allocation of the resources of edge servers to the blockchain and theMEC is crucial for the processing delay of blockchain-based MEC.Most of the existing research tackles the problem of resource allocation in either blockchain or MEC,which leads to unfavorable performance of the blockchain-based MEC system.In this paper,we study how to allocate the computing resources of edge servers to the MEC and blockchain tasks with the aimtominimize the total systemprocessing delay.For the problem,we propose a computing resource Allocation algorithmfor Blockchain-based MEC(ABM)which utilizes the Slater’s condition,Karush-Kuhn-Tucker(KKT)conditions,partial derivatives of the Lagrangian function and subgradient projection method to obtain the solution.Simulation results show that ABM converges and effectively reduces the processing delay of blockchain-based MEC.展开更多
Inter-datacenter elastic optical networks(EON)need to provide the service for the requests of cloud computing that require not only connectivity and computing resources but also network survivability.In this paper,to ...Inter-datacenter elastic optical networks(EON)need to provide the service for the requests of cloud computing that require not only connectivity and computing resources but also network survivability.In this paper,to realize joint allocation of computing and connectivity resources in survivable inter-datacenter EONs,a survivable routing,modulation level,spectrum,and computing resource allocation algorithm(SRMLSCRA)algorithm and three datacenter selection strategies,i.e.Computing Resource First(CRF),Shortest Path First(SPF)and Random Destination(RD),are proposed for different scenarios.Unicast and manycast are applied to the communication of computing requests,and the routing strategies are calculated respectively.Simulation results show that SRMLCRA-CRF can serve the largest amount of protected computing tasks,and the requested calculation blocking probability is reduced by 29.2%,28.3%and 30.5%compared with SRMLSCRA-SPF,SRMLSCRA-RD and the benchmark EPS-RMSA algorithms respectively.Therefore,it is more applicable to the networks with huge calculations.Besides,SRMLSCRA-SPF consumes the least spectrum,thereby exhibiting its suitability for scenarios where the amount of calculation is small and communication resources are scarce.The results demonstrate that the proposed methods realize the joint allocation of computing and connectivity resources,and could provide efficient protection for services under single-link failure and occupy less spectrum.展开更多
基金supported by the National Natural Science Foundation of China(No.62071354)the Key Research and Development Program of Shaanxi(No.2022ZDLGY05-08)supported by the ISN State Key Laboratory。
文摘To meet the communication services with diverse requirements,dynamic resource allocation has shown increasing importance.In this paper,we consider the multi-slot and multi-user resource allocation(MSMU-RA)in a downlink cellular scenario with the aim of maximizing system spectral efficiency while guaranteeing user fairness.We first model the MSMURA problem as a dual-sequence decision-making process,and then solve it by a novel Transformerbased deep reinforcement learning(TDRL)approach.Specifically,the proposed TDRL approach can be achieved based on two aspects:1)To adapt to the dynamic wireless environment,the proximal policy optimization(PPO)algorithm is used to optimize the multi-slot RA strategy.2)To avoid co-channel interference,the Transformer-based PPO algorithm is presented to obtain the optimal multi-user RA scheme by exploring the mapping between user sequence and resource sequence.Experimental results show that:i)the proposed approach outperforms both the traditional and DRL methods in spectral efficiency and user fairness,ii)the proposed algorithm is superior to DRL approaches in terms of convergence speed and generalization performance.
基金supported by Beijing Natural Science Fund–Haidian Original Innovation Joint Fund(L232040 and L232045).
文摘In this paper,we investigate a multi-UAV aided NOMA communication system,where multiple UAV-mounted aerial base stations are employed to serve ground users in the downlink NOMA communication,and each UAV serves its associated users on its own bandwidth.We aim at maximizing the overall common throughput in a finite time period.Such a problem is a typical mixed integer nonlinear problem,which involves both continuous-variable and combinatorial optimizations.To efficiently solve this problem,we propose a two-layer algorithm,which separately tackles continuous-variable and combinatorial optimization.Specifically,in the inner layer given one user association scheme,subproblems of bandwidth allocation,power allocation and trajectory design are solved based on alternating optimization.In the outer layer,a small number of candidate user association schemes are generated from an initial scheme and the best solution can be determined by comparing all the candidate schemes.In particular,a clustering algorithm based on K-means is applied to produce all candidate user association schemes,the successive convex optimization technique is adopted in the power allocation subproblem and a logistic function approximation approach is employed in the trajectory design subproblem.Simulation results show that the proposed NOMA scheme outperforms three baseline schemes in downlink common throughput,including one solution proposed in an existing literature.
基金supported by the following projects:The Youth Project of the National Natural Science Foundation of China(NSFC)“Research on Chinese Multinational Companies’Componovation under Resource Constraint:From a Dynamic Circulation Logic of Home and Host Countries”(Grant No.72102030)The Research Project of Humanities and Social Sciences of the Ministry of Education“Research on Chinese Multinational Companies’Learning by Doing Mechanism under Resource Constraint”(Grant No.21C10173022)The General Project of the China Postdoctoral Science Foundation“Research on the Realization Path and Motivations for the Domestic Replacement of Core Technologies for Chinese Manufacturing Enterprises”(Grant No.2022M720975).
文摘Hidden champions play a critical role in China’s efforts to overcome technological and industrial“chokepoints”.These enterprises are pivotal for breaking free from Western technological embargoes,avoiding entrapment in low-value-added production,and driving industrial upgrading.Given the distinct market environment in which China’s hidden champions have emerged,it is both timely and practically significant to examine their growth trajectories and underlying mechanisms.This study adopts a resource allocation perspective to investigate the development path of Chinese manufacturing enterprises into hidden champions,using a vertical case study of Hailiya Group.The findings reveal that such enterprises achieve hidden champion status by vertically concentrating on niche markets while harnessing technological potential and horizontally diversifying their technology application scenarios.Their growth follows a“T-shaped”strategy,combining vertical specialization in a focused market with horizontal expansion into new applications.Four critical mechanisms underpin the rise of manufacturing hidden champions:market niche positioning,innovation-driven focus,application scenario expansion,and ecosystem development.Specifically,these enterprises strategically target niche markets,establish a technology-oriented competitive edge,broaden technology applications to unlock new profit opportunities,and develop collaborative ecosystems to share resources and drive industrial advancement.This paper not only extends the interpretive boundaries of resource allocation theory but also offers fresh insights into the emergence of Chinese manufacturing enterprises as hidden champions,enriching our understanding of their unique growth dynamics.
文摘With the advancement of the new medical reform,public hospitals face numerous challenges and opportunities,making the optimization of human resource allocation a critical priority.This paper analyzes the requirements imposed by the new medical reform on human resource allocation in public hospitals,examines existing issues such as an unbalanced personnel structure,unscientific job design,and an inadequate talent mobility mechanism,and proposes corresponding optimization strategies.These strategies include improving the recruitment and selection process,scientifically planning job structures,and establishing a flexible talent mobility mechanism.The goal is to enhance the quality of medical services,improve hospital operational efficiency,and promote the sustainable development of public hospitals.
基金funded by State Key Laboratory of Micro-Spacecraft Rapid Design and Intelligent Cluster under Grant MS01240103the National Natural Science Foundation of China under Grant 62071146National 2011 Collaborative Innovation Center of Wireless Communication Technologies under Grant 2242022k60006.
文摘In this paper,we propose a joint power and frequency allocation algorithm considering interference protection in the integrated satellite and terrestrial network(ISTN).We efficiently utilize spectrum resources by allowing user equipment(UE)of terrestrial networks to share frequencies with satellite networks.In order to protect the satellite terminal(ST),the base station(BS)needs to control the transmit power and frequency resources of the UE.The optimization problem involves maximizing the achievable throughput while satisfying the interference protection constraints of the ST and the quality of service(QoS)of the UE.However,this problem is highly nonconvex,and we decompose it into power allocation and frequency resource scheduling subproblems.In the power allocation subproblem,we propose a power allocation algorithm based on interference probability(PAIP)to address channel uncertainty.We obtain the suboptimal power allocation solution through iterative optimization.In the frequency resource scheduling subproblem,we develop a heuristic algorithm to handle the non-convexity of the problem.The simulation results show that the combination of power allocation and frequency resource scheduling algorithms can improve spectrum utilization.
基金supported by Future Network Scientific Research Fund Project (FNSRFP-2021-ZD-4)National Natural Science Foundation of China (No.61991404,61902182)+1 种基金National Key Research and Development Program of China under Grant 2020YFB1600104Key Research and Development Plan of Jiangsu Province under Grant BE2020084-2。
文摘With the rapid development of Intelligent Transportation Systems(ITS),many new applications for Intelligent Connected Vehicles(ICVs)have sprung up.In order to tackle the conflict between delay-sensitive applications and resource-constrained vehicles,computation offloading paradigm that transfers computation tasks from ICVs to edge computing nodes has received extensive attention.However,the dynamic network conditions caused by the mobility of vehicles and the unbalanced computing load of edge nodes make ITS face challenges.In this paper,we propose a heterogeneous Vehicular Edge Computing(VEC)architecture with Task Vehicles(TaVs),Service Vehicles(SeVs)and Roadside Units(RSUs),and propose a distributed algorithm,namely PG-MRL,which jointly optimizes offloading decision and resource allocation.In the first stage,the offloading decisions of TaVs are obtained through a potential game.In the second stage,a multi-agent Deep Deterministic Policy Gradient(DDPG),one of deep reinforcement learning algorithms,with centralized training and distributed execution is proposed to optimize the real-time transmission power and subchannel selection.The simulation results show that the proposed PG-MRL algorithm has significant improvements over baseline algorithms in terms of system delay.
基金supported by National Natural Science Foundation of China No.62231012Natural Science Foundation for Outstanding Young Scholars of Heilongjiang Province under Grant YQ2020F001Heilongjiang Province Postdoctoral General Foundation under Grant AUGA4110004923.
文摘Low earth orbit(LEO)satellites with wide coverage can carry the mobile edge computing(MEC)servers with powerful computing capabilities to form the LEO satellite edge computing system,providing computing services for the global ground users.In this paper,the computation offloading problem and resource allocation problem are formulated as a mixed integer nonlinear program(MINLP)problem.This paper proposes a computation offloading algorithm based on deep deterministic policy gradient(DDPG)to obtain the user offloading decisions and user uplink transmission power.This paper uses the convex optimization algorithm based on Lagrange multiplier method to obtain the optimal MEC server resource allocation scheme.In addition,the expression of suboptimal user local CPU cycles is derived by relaxation method.Simulation results show that the proposed algorithm can achieve excellent convergence effect,and the proposed algorithm significantly reduces the system utility values at considerable time cost compared with other algorithms.
基金supported by National Natural Science Foundation of China(No.62471254)National Natural Science Foundation of China(No.92367302)。
文摘The unmanned aerial vehicle(UAV)-assisted mobile edge computing(MEC)has been deemed a promising solution for energy-constrained devices to run smart applications with computationintensive and latency-sensitive requirements,especially in some infrastructure-limited areas or some emergency scenarios.However,the multi-UAVassisted MEC network remains largely unexplored.In this paper,the dynamic trajectory optimization and computation offloading are studied in a multi-UAVassisted MEC system where multiple UAVs fly over a target area with different trajectories to serve ground users.By considering the dynamic channel condition and random task arrival and jointly optimizing UAVs'trajectories,user association,and subchannel assignment,the average long-term sum of the user energy consumption minimization problem is formulated.To address the problem involving both discrete and continuous variables,a hybrid decision deep reinforcement learning(DRL)-based intelligent energyefficient resource allocation and trajectory optimization algorithm is proposed,named HDRT algorithm,where deep Q network(DQN)and deep deterministic policy gradient(DDPG)are invoked to process discrete and continuous variables,respectively.Simulation results show that the proposed HDRT algorithm converges fast and outperforms other benchmarks in the aspect of user energy consumption and latency.
基金Major Project of the National Natural Science Founda-tion of China(No.60496311)the National High Technology Research and Development Program of China(863Program)(No.2007AA01Z207)the Program for New Century Excellent Talents in University
文摘The joint channel and power allocation in the downlink transmission of multi-user multi-carrier code division multiple access（MC-CDMA） systems are investigated and the throughput maximization problem is considered as a mixed integer optimization problem. For simplicity of analysis, the problem is divided into two less complex sub-problems： power allocation and channel allocation, which can be solved by a suboptimal adaptive power allocation （APA）algorithm and an optimal adaptive channel allocation （ACA） algorithm, respectively. By combining APA and ACA algorithms, an adaptive channel and power allocation scheme is proposed. The numerical results show that the proposed APA algorithm is more suitable for MC-CDMA systems than the conventional equal power allocation algorithm, and that the proposed channel and power allocation scheme can significantly improve the system throughout performance.
基金Project supported by the Research Fund for Joint China-Canada Research and Development Projects of the Ministry of Scienceand Technology,China(Grant No.2010DFA11320)
文摘Multi-user cognitive radio network resource allocation based on the adaptive niche immune genetic algorithm is proposed, and a fitness function is provided. Simulations are conducted using the adaptive niche immune genetic algo- rithm, the simulated annealing algorithm, the quantum genetic algorithm and the simple genetic algorithm, respectively. The results show that the adaptive niche immune genetic algorithm performs better than the other three algorithms in terms of the multi-user cognitive radio network resource allocation, and has quick convergence speed and strong global searching capability, which effectively reduces the system power consumption and bit error rate.
基金supported in part by the National Key R&D Program of China under Grant 2020YFB1005900the National Natural Science Foundation of China under Grant 62001220+3 种基金the Jiangsu Provincial Key Research and Development Program under Grants BE2022068the Natural Science Foundation of Jiangsu Province under Grants BK20200440the Future Network Scientific Research Fund Project FNSRFP-2021-YB-03the Young Elite Scientist Sponsorship Program,China Association for Science and Technology.
文摘Collaborative edge computing is a promising direction to handle the computation intensive tasks in B5G wireless networks.However,edge computing servers(ECSs)from different operators may not trust each other,and thus the incentives for collaboration cannot be guaranteed.In this paper,we propose a consortium blockchain enabled collaborative edge computing framework,where users can offload computing tasks to ECSs from different operators.To minimize the total delay of users,we formulate a joint task offloading and resource optimization problem,under the constraint of the computing capability of each ECS.We apply the Tammer decomposition method and heuristic optimization algorithms to obtain the optimal solution.Finally,we propose a reputation based node selection approach to facilitate the consensus process,and also consider a completion time based primary node selection to avoid monopolization of certain edge node and enhance the security of the blockchain.Simulation results validate the effectiveness of the proposed algorithm,and the total delay can be reduced by up to 40%compared with the non-cooperative case.
基金Projects(51007021, 60402004) supported by the National Natural Science Foundation of China
文摘The bits and power allocation model of adaptive power-rate mixture for multi-user multi-server power-line communication systems was analyzed with the restrictions of maximal total power,fixed rate for each real time (RT) user,minimal rate for each non-real time (NRT) user,maximal bits and power for each subcarrier in each orthogonal frequency division multiplexing (OFDM) symbol. An algorithm of resource dynamic allocation in the first OFDM symbol of each frame and resource optimal adjustment in the latter OFDM symbol of each frame was proposed. In the first OFDM symbol of every frame,resource is firstly assigned for RT users so as to minimize their total used power until satisfying their fixed rates; secondly the remainder resource of power and subcarriers are assigned for NRT users so as to minimize their total used power until satisfying their minimal rates also; lastly the remainder resource is again assigned for NRT users according to the proportional fairness strategy so as to maximize their total assigning rate. In the latter OFDM symbol of each frame,bits are swapped and power is adjusted for every user based on the resource allocation results of anterior OFDM symbol. The algorithm is tested in the typical power-line channel scenarios and the simulation results indicate that the proposed algorithm has better performances than the classical multi-user resource allocation algorithms and it realizes the multiple aims of multi-user multi-server resource allocation for power-line communication systems.
基金supported in part by Sichuan Science and Technology Program (Nos. 2022NSFSC0912, 2020YJ0218,2021YFQ056 and 2022YFG0170)Fundamental Research Funds for the Central Universities (Nos. 2682021ZTPY051and 2682021CF019)+2 种基金NSFC (No. 62071393)NSFC High-Speed Rail Joint Foundation (No. U1834210)111 Project 111-2-14。
文摘Sensing in wireless local area network(WLAN) gains great interests recently. In this paper we focus on the multi-user WLAN sensing problem under the existing 802.11 standards. Multiple stations perform sensing with the access point and transmit channel state information(CSI)report simultaneously on the basis of uplink-orthogonal frequency division multiple access(OFDMA). Considering the transmission resource consumed in CSI report and the padding wastage in OFDMA based CSI report, we optimize the CSI simplification and uplink resource unit(RU)allocation jointly, aiming to balance the sensing accuracy and padding wastage performances in WLAN sensing. We propose the minimize padding maximize efficiency(MPME) algorithm to solve the problem and evaluate the performance of the proposed algorithm through extensive simulations.
基金supported in part by the National Natural Science Foundation of China under Grant No.61701197in part by the National Key Research and Development Program of China under Grant No.2021YFA1000500(4)in part by the 111 Project under Grant No.B23008.
文摘Federated Edge Learning(FEL),an emerging distributed Machine Learning(ML)paradigm,enables model training in a distributed environment while ensuring user privacy by using physical separation for each user’s data.However,with the development of complex application scenarios such as the Internet of Things(IoT)and Smart Earth,the conventional resource allocation schemes can no longer effectively support these growing computational and communication demands.Therefore,joint resource optimization may be the key solution to the scaling problem.This paper simultaneously addresses the multifaceted challenges of computation and communication,with the growing multiple resource demands.We systematically review the joint allocation strategies for different resources(computation,data,communication,and network topology)in FEL,and summarize the advantages in improving system efficiency,reducing latency,enhancing resource utilization,and enhancing robustness.In addition,we present the potential ability of joint optimization to enhance privacy preservation by reducing communication requirements,indirectly.This work not only provides theoretical support for resource management in federated learning(FL)systems,but also provides ideas for potential optimal deployment in multiple real-world scenarios.By thoroughly discussing the current challenges and future research directions,it also provides some important insights into multi-resource optimization in complex application environments.
基金supported by the foundation of National Key Laboratory of Electromagnetic Environment(Grant No.JCKY2020210C 614240304)Natural Science Foundation of ZheJiang province(LQY20F010001)+1 种基金the National Natural Science Foundation of China under grant numbers 82004499State Key Laboratory of Millimeter Waves under grant numbers K202012.
文摘The performance of massive MIMO systems relies heavily on the availability of Channel State Information at the Transmitter(CSIT).A large amount of work has been devoted to reducing the CSIT acquisition overhead at the pilot training and/or CsI feedback stage.In fact,the downlink communication generally includes three stages,i.e.,pilot training,CsI feedback,and data transmission.These three stages are mutually related and jointly determine the overall system performance.Unfortunately,there exist few studies on the reduction of csIT acquisition overhead from the global point of view.In this paper,we integrate the Minimum Mean Square Error(MMSE)channel estimation,Random Vector Quantization(RVQ)based limited feedback and Maximal Ratio Combining(MRC)precoding into a unified framework for investigating the resource allocation problem.In particular,we first approximate the covariance matrix of the quantization error with a simple expression and derive an analytical expression of the received Signal-to-Noise Ratio(SNR)based on the deterministic equivalence theory.Then the three performance metrics(the spectral efficiency,energy efficiency,and total energy consumption)oriented problems are formulated analytically.With practical system requirements,these three metrics can be collaboratively optimized.Finally,we propose an optimization solver to derive the optimal partition of channel coherence time.Experiment results verify the benefits of the proposed resource allocation schemes under three different scenarios and illustrate the tradeoff of resource allocation between three stages.
基金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.
基金the Fundamental Research Program of Guangdong,China,under Grants 2020B1515310023 and 2023A1515011281in part by the National Natural Science Foundation of China under Grant 61571005.
文摘With the rapid development of Network Function Virtualization(NFV),the problem of low resource utilizationin traditional data centers is gradually being addressed.However,existing research does not optimize both localand global allocation of resources in data centers.Hence,we propose an adaptive hybrid optimization strategy thatcombines dynamic programming and neural networks to improve resource utilization and service quality in datacenters.Our approach encompasses a service function chain simulation generator,a parallel architecture servicesystem,a dynamic programming strategy formaximizing the utilization of local server resources,a neural networkfor predicting the global utilization rate of resources and a global resource optimization strategy for bottleneck andredundant resources.With the implementation of our local and global resource allocation strategies,the systemperformance is significantly optimized through simulation.
基金This work was supported in part by the National Key R&D Program of China under Grant 2020YFB1005900the National Natural Science Foundation of China under Grant 62001220+3 种基金the Jiangsu Provincial Key Research and Development Program under Grants BE2022068the Natural Science Foundation of Jiangsu Province under Grants BK20200440the Future Network Scientific Research Fund Project FNSRFP-2021-YB-03the Young Elite Scientist Sponsorship Program,China Association for Science and Technology.
文摘Collaborative edge computing is a promising direction to handle the computation intensive tasks in B5G wireless networks.However,edge computing servers(ECSs)from different operators may not trust each other,and thus the incentives for collaboration cannot be guaranteed.In this paper,we propose a consortium blockchain enabled collaborative edge computing framework,where users can offload computing tasks to ECSs from different operators.To minimize the total delay of users,we formulate a joint task offloading and resource optimization problem,under the constraint of the computing capability of each ECS.We apply the Tammer decomposition method and heuristic optimization algorithms to obtain the optimal solution.Finally,we propose a reputation based node selection approach to facilitate the consensus process,and also consider a completion time based primary node selection to avoid monopolization of certain edge node and enhance the security of the blockchain.Simulation results validate the effectiveness of the proposed algorithm,and the total delay can be reduced by up to 40%compared with the non-cooperative case.
基金supported by the Key Research and Development Project in Anhui Province of China(Grant No.202304a05020059)the Fundamental Research Funds for the Central Universities of China(Grant No.PA2023GDSK0055)the Project of Anhui Province Economic and Information Bureau(Grant No.JB20099).
文摘Users and edge servers are not fullymutually trusted inmobile edge computing(MEC),and hence blockchain can be introduced to provide trustableMEC.In blockchain-basedMEC,each edge server functions as a node in bothMEC and blockchain,processing users’tasks and then uploading the task related information to the blockchain.That is,each edge server runs both users’offloaded tasks and blockchain tasks simultaneously.Note that there is a trade-off between the resource allocation for MEC and blockchain tasks.Therefore,the allocation of the resources of edge servers to the blockchain and theMEC is crucial for the processing delay of blockchain-based MEC.Most of the existing research tackles the problem of resource allocation in either blockchain or MEC,which leads to unfavorable performance of the blockchain-based MEC system.In this paper,we study how to allocate the computing resources of edge servers to the MEC and blockchain tasks with the aimtominimize the total systemprocessing delay.For the problem,we propose a computing resource Allocation algorithmfor Blockchain-based MEC(ABM)which utilizes the Slater’s condition,Karush-Kuhn-Tucker(KKT)conditions,partial derivatives of the Lagrangian function and subgradient projection method to obtain the solution.Simulation results show that ABM converges and effectively reduces the processing delay of blockchain-based MEC.
基金supported by the National Natural Science Foundation of China(No.62001045)Beijing Municipal Natural Science Foundation(No.4214059)+1 种基金Fund of State Key Laboratory of IPOC(BUPT)(No.IPOC2021ZT17)Fundamental Research Funds for the Central Universities(No.2022RC09).
文摘Inter-datacenter elastic optical networks(EON)need to provide the service for the requests of cloud computing that require not only connectivity and computing resources but also network survivability.In this paper,to realize joint allocation of computing and connectivity resources in survivable inter-datacenter EONs,a survivable routing,modulation level,spectrum,and computing resource allocation algorithm(SRMLSCRA)algorithm and three datacenter selection strategies,i.e.Computing Resource First(CRF),Shortest Path First(SPF)and Random Destination(RD),are proposed for different scenarios.Unicast and manycast are applied to the communication of computing requests,and the routing strategies are calculated respectively.Simulation results show that SRMLCRA-CRF can serve the largest amount of protected computing tasks,and the requested calculation blocking probability is reduced by 29.2%,28.3%and 30.5%compared with SRMLSCRA-SPF,SRMLSCRA-RD and the benchmark EPS-RMSA algorithms respectively.Therefore,it is more applicable to the networks with huge calculations.Besides,SRMLSCRA-SPF consumes the least spectrum,thereby exhibiting its suitability for scenarios where the amount of calculation is small and communication resources are scarce.The results demonstrate that the proposed methods realize the joint allocation of computing and connectivity resources,and could provide efficient protection for services under single-link failure and occupy less spectrum.
