Answers are grounded in this paper and cite their sources.
In emerging Cyber-Physical Systems (CPS), the demand for higher communication performance and enhanced wireless connectivity is increasing fast. To address the issue, in our recent work, we proposed a dynamic programming algorithm with polynomial time complexity for effective cross-layer downlink Scheduling and Resource Allocation (SRA) considering the channel and queue state, while supporting fairness. In this paper, we extend the SRA algorithm to consider 5G use-cases, namely enhanced Machine Type Communication (eMTC), Ultra-Reliable Low Latency Communication (URLLC) and enhanced Mobile BroadBand (eMBB). In a simulation study, we evaluate the performance of our SRA algorithm in comparison to an advanced greedy cross-layer algorithm for eMTC, URLLC and LTE (long-term evolution). For eMTC and URLLC, our SRA method outperforms the greedy approach by up to 17.24%, 18.1%, 2.5% and 1.5% in terms of average goodput, correlation impact, goodput fairness and delay fairness, respectively. In the case of LTE, our approach outperforms the greedy method by 60%, 2.6% and 1.6% in terms of goodput, goodput fairness and delay fairness compared with tested baseline.
No takes yet. Share an insight, caveat, or question.
Vora et al. (2018) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: