2021 IEEE International Conference on Communications Workshops (ICC Workshops) 2021
DOI: 10.1109/iccworkshops50388.2021.9473664
|View full text |Cite
|
Sign up to set email alerts
|

Conflict-Aware Multi-Numerology Radio Resource Allocation for Heterogeneous Services

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
3
1
1

Citation Types

0
5
0

Year Published

2022
2022
2023
2023

Publication Types

Select...
2

Relationship

0
2

Authors

Journals

citations
Cited by 2 publications
(5 citation statements)
references
References 15 publications
0
5
0
Order By: Relevance
“…The greedy approach is based on calculating the proportional fairness weight that depends on the previously achieved eMBB data rate and the priority is given to the RBs requested by the uRLLC user. In [29], the authors reformulated the problem of maximizing eMBB throughput into a conflict minimization problem between eMBB and uRLLC services. The solution leverages the free selection of multi-numerology offered in 5 G NR and the conflict minimization is considered a case of bin packing optimization.…”
Section: Related Workmentioning
confidence: 99%
“…The greedy approach is based on calculating the proportional fairness weight that depends on the previously achieved eMBB data rate and the priority is given to the RBs requested by the uRLLC user. In [29], the authors reformulated the problem of maximizing eMBB throughput into a conflict minimization problem between eMBB and uRLLC services. The solution leverages the free selection of multi-numerology offered in 5 G NR and the conflict minimization is considered a case of bin packing optimization.…”
Section: Related Workmentioning
confidence: 99%
“…The additional constraint (23) ensures that at most two overlapping blocks are allowed per mini-slot. Furthermore (24) forbids the overlapping URLLC resource blocks in order to avoid induced overheads in decoding. Finally, (25) ensures that if URLLC is overlapping with an eMBB resource block, the throughput of the eMBB resource block is higher.…”
Section: Noma For Downlink Schedulingmentioning
confidence: 99%
“…The problem of identifying the resource allocation that maximizes the eMBB sum-rate is studied under the constraint of serving all URLLC throughput demands under different latency constraints ranging from 0.5 to 2 milliseconds (msec). In our previous work [24] we introduced a bin packing approach that minimizes the placements of the resource blocks for the URLLC services in order to minimize the infeasible placements for the eMBB services. In this work, additionally, we extend the above framework by proposing a second approach based on low complexity algorithms, that manage the infeasible placements.…”
Section: Introductionmentioning
confidence: 99%
See 2 more Smart Citations