Scheduling on the Gaussian Broadcast Channel with Hard Deadlines

被引:0
|
作者
Tuninetti, Daniela [1 ]
Smida, Besma [1 ]
Devroye, Natasha [1 ]
Seferoglu, Hulya [1 ]
机构
[1] Univ Illinois, Elect & Comp Engn Dept, Chicago, IL 60607 USA
关键词
Low latency; finite-length information theory; hard deadline; Gaussian broadcast channels; DATA-TRANSMISSION; ENERGY; MULTIACCESS;
D O I
暂无
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
This paper, motivated by mission-critical and latency-constrained traffic, focuses on delivering different messages to various end-users within hard deadlines on the downlink of a wireless system. A novel deadline outage performance criterion is introduced, which accounts for both the violation of the hard deadline by any of the messages as well as for channel decoding errors due to finite block-length. This formulation allows for the study of scheduling policies under a more refined model of the physical layer channel than is usually assumed in the networking literature. Different scheduling polices under hard deadline constraints are proposed, and the corresponding deadline outage probabilities evaluated. The main result is that, to reduce the deadline outage probability, a scheduling policy should cleverly combine time-sharing and concatenate-and-code.
引用
收藏
页数:7
相关论文
共 50 条