Dynamic Multichannel Access for 5G and Beyond with Fast Time-Varying Channel

被引:0
|
作者
Wang, Shaoyang [1 ]
Lv, Tiejun [1 ]
机构
[1] Beijing Univ Posts & Telecommun, Sch Informat & Commun Engn, Minist Educ, Key Lab Trustworthy Distributed Comp & Serv, Beijing 100876, Peoples R China
基金
中国国家自然科学基金;
关键词
Dynamic multichannel access; recurrent neural network; high-mobility; deep reinforcement learning; prediction-based deep deterministic policy gradient;
D O I
10.1109/icc40277.2020.9149397
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
In 5G and beyond wireless communication systems, providing satisfactory service to users in high-mobility scenarios becomes very essential. Unstable service supply caused by frequent handover under high-mobility compromises the service experience of users. Moreover, the demanding requirements for processing delays and non-immediate information processing errors are particularly prominent. This paper proposes a novel learning-based approach to solving the dynamic multichannel access (DMCA) problem under fast time-varying channel arising from high-mobility. Specifically, we first propose the subjective experience-based quality of service, and formulate the corresponding optimization problem based on the designed access criterion. Invoking our proposed prediction-based deep deterministic policy gradient algorithm and incremental learning-based online channel prediction model, a novel DMCA scheme, which combines the recurrent neural network with deep reinforcement learning, is proposed. Corroborated by experiments built in real channel data, the performance of proposed learning-based DMCA scheme approaches that derived from the exhaustive search method when making a decision at each time-slot, and is superior to the exhaustive search method when making a decision for every few time-slots. Furthermore, our scheme significantly reduces processing delays and effectively alleviates errors caused by the non-immediacy of information acquisition and processing.
引用
收藏
页数:6
相关论文
共 50 条
  • [21] Optical Access and Transport Technologies for 5G and Beyond
    Doo, Kyeong-Hwan
    Kim, Kwangok
    Lee, Han Hyub
    Kim, Seung Hwan
    Park, Heuk
    Oh, Jung Yeol
    Chung, Hwan Seok
    2019 24TH OPTOELECTRONICS AND COMMUNICATIONS CONFERENCE (OECC) AND 2019 INTERNATIONAL CONFERENCE ON PHOTONICS IN SWITCHING AND COMPUTING (PSC), 2019,
  • [22] The feature extraction and matching of time-varying fast fading channel
    Zhang Yankui
    Wang Daming
    Ba Bin
    PROCEEDINGS OF THE 2015 3RD INTERNATIONAL CONFERENCE ON MACHINERY, MATERIALS AND INFORMATION TECHNOLOGY APPLICATIONS, 2015, 35 : 468 - 474
  • [23] On Channel Sounding With Switched Arrays in Fast Time-Varying Channels
    Wang, Rui
    Renaudin, Olivier
    Bas, C. Umit
    Sangodoyin, Seun
    Molisch, Andreas F.
    IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, 2019, 18 (08) : 3843 - 3855
  • [24] Spectrum sensing assisted by windowing for fast time-varying channel
    Bouallegue, Kais
    Crussiere, Matthieu
    PHYSICAL COMMUNICATION, 2020, 43
  • [25] Time-varying G
    Barrow, JD
    MONTHLY NOTICES OF THE ROYAL ASTRONOMICAL SOCIETY, 1996, 282 (04) : 1397 - 1406
  • [26] Time-varying G
    Mon Not Royal Astron Soc, 4 (1397):
  • [27] Antenna Switching Sequence Design for Channel Sounding in a Fast Time-varying Channel
    Wang, Rui
    Renaudin, Olivier
    Bas, C. Umit
    Sangodoyin, Seun
    Molisch, Andreas F.
    2018 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS (ICC), 2018,
  • [28] 5G and Beyond: On the Significance of Wireless Channel Estimation
    Kaur, Jasneet
    Khan, M. Arif
    SOUTHEASTCON 2024, 2024, : 28 - 33
  • [29] Sorted Channel Based User Search for Initial Access in 5G and Beyond Cellular Networks
    Ul Islam, Taimoor
    Khan, Fahd Ahmed
    2022 27TH IEEE SYMPOSIUM ON COMPUTERS AND COMMUNICATIONS (IEEE ISCC 2022), 2022,
  • [30] Analysis of 5G Channel Access for Collaboration with TSN Concluding at a 5G Scheduling Mechanism
    Krummacker, Dennis
    Veith, Benedikt
    Fischer, Christoph
    Schotten, Hans Dieter
    NETWORK, 2022, 2 (03): : 440 - 455