Journal on Communications ›› 2024, Vol. 45 ›› Issue (2): 173-187.doi: 10.11959/j.issn.1000-436x.2024041

• Papers • Previous Articles    

Joint user association and dynamic resource allocation algorithm for LEO-RAN slicing scenarios

Geng CHEN1, Zhiwei XING1, Fei SHEN2, Qingtian ZENG1   

  1. 1 College of Electronic and Information Engineering, Shandong University of Science and Technology, Qingdao 266590, China
    2 Shanghai Institute of Microsystem and Information Technology, Chinese Academy of Sciences, Shanghai 200050, China
  • Revised:2023-12-26 Online:2024-02-01 Published:2024-02-01
  • Supported by:
    The National Natural Science Foundation of China(61701284);The Natural Science Foundation of Shan-dong Province(ZR2022MF226);The Talented Young Teachers Training Program of Shandong University of Science and Tech-nology(BJ20221101);The Innovative Research Foundation of Qingdao(19-6-2-1-cg);The Elite Plan Project of Shandong University of Science and Technology(skr21-3-B-048);The Hundred Talent Program of Chinese Academy of Sciences(E06BRA1001);The Taishan Scholar Program of Shandong Province(ts20190936)

Abstract:

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.

Key words: LEO satellite communication, network slicing, user association, MADDPG, system utility

CLC Number: 

No Suggested Reading articles found!