Search

A joint user association and dynamic resource allocation algorithm was proposed for the slicing scenario of ultra dense low earth orbit-radio access network (LEO-RAN) in order to address the efficient utilization of resources of the integrated terrestrial-satellite network for 6G .Considering the constraints of the minimum rate, maximum delay and resource proportion of different slices, a joint optimization problem of user association and resource allocation was established to maximize the weighted sum of the SE and the differentiated SLA of different slices as the optimization objective.A network slicing algorithm based on multi-agent deep deterministic policy gradient (MADDPG) was proposed to determine the proportion of slicing resources, a Lagrange dual based user association algorithm was proposed to determine the optimal user association policy and the resources were allocated to users by using the round-robin scheduling mechanism.The simulation results show that the proposed algorithm can effectively improve SE while satisfying the differentiated SLA of different slices.Compared with MADDPG-RA, MATD3-LG, MATD3-RA, MASAC-LG and MASAC-RA algorithms, the system utility of the proposed algorithm is improved by 2.0%, 2.3%, 5.7%, 8.7% and 9.4%, respectively.

A joint user association and dynamic resource allocation algorithm was proposed for the slicing scenario of ultra dense low earth orbit-radio access network (LEO-RAN) in order to address the efficient utilization of resources of the integrated terrestrial-satellite network for 6G .Considering the constraints of the minimum rate, maximum delay and resource proportion of different slices, a joint optimization problem of user association and resource allocation was established to maximize the weighted sum of the SE and the differentiated SLA of different slices as the optimization objective.A network slicing algorithm based on multi-agent deep deterministic policy gradient (MADDPG) was proposed to determine the proportion of slicing resources, a Lagrange dual based user association algorithm was proposed to determine the optimal user association policy and the resources were allocated to users by using the round-robin scheduling mechanism.The simulation results show that the proposed algorithm can effectively improve SE while satisfying the differentiated SLA of different slices.Compared with MADDPG-RA, MATD3-LG, MATD3-RA, MASAC-LG and MASAC-RA algorithms, the system utility of the proposed algorithm is improved by 2.0%, 2.3%, 5.7%, 8.7% and 9.4%, respectively.

Based on the idea of crowdsourcing,mobile crowdsensing(MCS) collects mobile sensing devices to sense the surroun-ding environment,which can make environment sensing and information collection more flexible,convenient and efficient.Whe-ther the task allocation strategy is reasonable or not directly affects the success of the sensing task.Therefore,formulating a reasonable task allocation strategy is a hotspot and focus in the research of MCS.At present,most of the task allocation methods in MCS systems are offline and targeted at single type tasks.However,in practice,online multi-type task allocation is more common.Therefore,this paper studies the task allocation method in MCS for multiple types of tasks,and proposes an online task allocation strategy oriented to system benefits combined with the characteristics of MCS technology in the military field.In this paper,a long-term,dynamic online task allocation system model is established,and the problem is solved based on Lyapunov optimization theory with the system benefit as the optimization goal,so that the online dynamic control of task admission strategy and task allocation scheme is realized.Experiment shows that the online task allocation algorithm proposed in this paper is effective and feasible.It can reasonably allocate the tasks arriving at the MCS system online,ensure the stability of the task queue,and increase the system utility by adjusting the parameter value.

To effectively meet the differentiated quality of service (QoS) requirements of different slices, a dual time scale network slicing resource allocation algorithm based on dueling double DQN (D3QN) was proposed for B5G multi-service scenarios.The joint resource slicing and scheduling problem was formulated, with the weighted sum of the normalized spectral efficiency (SE) and the QoS of users indices of different slices as the optimization objective.On large time scale, the SDN controller used the D3QN algorithm to pre-allocate resources to different slices based on the resource requirements of each service, and then performed BS-level resource updating based on the load status of BS.On small time scale, the BS scheduled resources to end-users by using the round-robin scheduling algorithm.The simulation results show that the proposed algorithm has excellent performance in ensuring the QoS requirements of slice users, SE and system utility.Compared with the other 4 baseline algorithms, the system utility is improved by 3.22%, 3.81%, 7.48% and 21.14%, respectively.

To effectively meet the differentiated quality of service (QoS) requirements of different slices, a dual time scale network slicing resource allocation algorithm based on dueling double DQN (D3QN) was proposed for B5G multi-service scenarios.The joint resource slicing and scheduling problem was formulated, with the weighted sum of the normalized spectral efficiency (SE) and the QoS of users indices of different slices as the optimization objective.On large time scale, the SDN controller used the D3QN algorithm to pre-allocate resources to different slices based on the resource requirements of each service, and then performed BS-level resource updating based on the load status of BS.On small time scale, the BS scheduled resources to end-users by using the round-robin scheduling algorithm.The simulation results show that the proposed algorithm has excellent performance in ensuring the QoS requirements of slice users, SE and system utility.Compared with the other 4 baseline algorithms, the system utility is improved by 3.22%, 3.81%, 7.48% and 21.14%, respectively.

In the fifth-generation (5G) cellular network, the Mobile Network Operator (MNO), and the Mobile Edge Computing (MEC) platform will play an important role in providing services to an increasing number of vehicles. Due to vehicle mobility and the rise of computation-intensive and delay-sensitive vehicular applications, it is challenging to achieve the rigorous latency and reliability requirements of vehicular communication. The MNO, with the MEC server mounted on an unmanned aerial vehicle (UAV), should make a profit by providing its computing services and capabilities to moving vehicles. This paper proposes the use of dynamic pricing for computation offloading in UAV-MEC for vehicles. The novelty of this paper is in how the price influences offloading demand and decides how to reduce network costs (delay and energy) while maximizing UAV operator revenue, but not the offloading benefits with the mobility of vehicles and UAV. The optimization problem is formulated as a Markov Decision Process (MDP). The MDP can be solved by the Deep Reinforcement Learning (DRL) algorithm, especially the Deep Deterministic Policy Gradient (DDPG). Extensive simulation results demonstrate that the proposed pricing model outperforms greedy by 26%and random by 51% in terms of delay. In terms of system utility, the proposed pricing model outperforms greedy only by 17%. In terms of server congestion, the proposed pricing model outperforms random by 19% and is almost the same as greedy.

Cognitive radio is a promising technology for improving spectrum utilization, which allows cognitive users access to the licensed spectrum while primary users are absent. In this paper, we design a resource allocation framework based on graph theory for spectrum assignment in cognitive radio networks. The framework takes into account the constraints that interference for primary users and possible collision among cognitive users. Based on the proposed model, we formulate a system utility function to maximize the system benefit. Based on the proposed model and objective problem, we design an improved ant colony optimization algorithm (IACO) from two aspects: first, we introduce differential evolution (DE) process to accelerate convergence speed by monitoring mechanism; then we design a variable neighborhood search (VNS) process to avoid the algorithm falling into the local optimal. Simulation results demonstrate that the improved algorithm achieves better performance.