Joint user association and dynamic resource allocation algorithm for LEO-RAN slicing scenarios
Papers|更新时间:2024-05-31
|
Joint user association and dynamic resource allocation algorithm for LEO-RAN slicing scenarios
Journal on CommunicationsVol. 45, Issue 2, Pages: 173-187(2024)
作者机构:
1. 山东科技大学电子信息工程学院,山东 青岛 266590
2. 中国科学院上海微系统与信息技术研究所,上海 200050
作者简介:
基金信息:
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)
Geng CHEN, Zhiwei XING, Fei SHEN, et al. Joint user association and dynamic resource allocation algorithm for LEO-RAN slicing scenarios[J]. Journal on Communications, 2024, 45(2): 173-187.
DOI:
Geng CHEN, Zhiwei XING, Fei SHEN, et al. Joint user association and dynamic resource allocation algorithm for LEO-RAN slicing scenarios[J]. Journal on Communications, 2024, 45(2): 173-187. DOI: 10.11959/j.issn.1000-436x.2024041.
Joint user association and dynamic resource allocation algorithm for LEO-RAN slicing scenarios