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...
Gespeichert in:
| Veröffentlicht in: | IEEE networking letters Jg. 6; H. 1; S. 1 - 5 |
|---|---|
| Hauptverfasser: | , , |
| Format: | Journal Article |
| Sprache: | Englisch |
| Veröffentlicht: |
Piscataway
IEEE
01.03.2024
The Institute of Electrical and Electronics Engineers, Inc. (IEEE) |
| Schlagworte: | |
| ISSN: | 2576-3156, 2576-3156 |
| Online-Zugang: | Volltext |
| Tags: |
Tag hinzufügen
Keine Tags, Fügen Sie den ersten Tag hinzu!
|
| Zusammenfassung: | 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. |
|---|---|
| Bibliographie: | 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 |