User Scheduling in Wireless Networks for Deterministic Service: An Efficient Genetic Algorithm Method

To meet the stringent latency and reliability requirements of deterministic service in 5G and beyond networks, we investigate the user selection scheme jointly considering multiple transmission time intervals in a radio access network system with multiple access technology. The objective is to maxim...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:IEEE networking letters Ročník 6; číslo 1; s. 1 - 5
Hlavní autoři: Zhao, You, Zhu, Yuchao, Wang, Shaowei
Médium: Journal Article
Jazyk:angličtina
Vydáno: Piscataway IEEE 01.03.2024
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Témata:
Deterministic service
genetic algorithm
Genetic algorithms
Greedy algorithms
Interference
MIMO communication
Network latency
NP-hard problem
Optimization
Precoding
radio access network
Radio access networks
Scheduling
User satisfaction
Wireless networks
ISSN:2576-3156, 2576-3156
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:To meet the stringent latency and reliability requirements of deterministic service in 5G and beyond networks, we investigate the user selection scheme jointly considering multiple transmission time intervals in a radio access network system with multiple access technology. The objective is to maximize the number of users that satisfy both data volume and latency requirements. Due to the NP-hardness of the formulated optimization task, we propose an efficient genetic algorithm to find promising user subsets at low complexity. Numerical results demonstrate that our proposal outperforms the compared greedy algorithm and round-robin algorithm, which can provide a guideline for the design of systems with deterministic requirements in practice.
Bibliografie:ObjectType-Article-1
SourceType-Scholarly Journals-1
ObjectType-Feature-2
content type line 14
ISSN:2576-3156
2576-3156
DOI:10.1109/LNET.2023.3342424