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 条
  • [1] Scheduling jobs with hard deadlines over Multiple Access and Degraded Broadcast Channels
    Vasudevan, Dinkar
    Subramanian, Vijay G.
    Leith, Douglas J.
    2010 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, 2010, : 490 - 494
  • [2] Scheduling Observers Over a Shared Channel With Hard Delivery Deadlines
    Jurdi, Rebal
    Andrews, Jeffrey G.
    Heath, Robert W., Jr.
    IEEE TRANSACTIONS ON COMMUNICATIONS, 2021, 69 (01) : 133 - 148
  • [3] On Erasure Broadcast Channels with Hard Deadlines
    Ovaisi, Zohreh
    Devroye, Natasha
    Seferoglu, Hulya
    Smida, Besma
    Tuninetti, Daniela
    2018 IEEE INTERNATIONAL CONFERENCE ON COMMUNICATIONS WORKSHOPS (ICC WORKSHOPS), 2018,
  • [4] Online scheduling with hard deadlines
    Goldman, SA
    Parwatikar, J
    Suri, S
    JOURNAL OF ALGORITHMS, 2000, 34 (02) : 370 - 389
  • [5] Power efficient broadcast scheduling with delay deadlines
    Rajan, D
    Sabharwal, A
    Aazhang, B
    FIRST INTERNATIONAL CONFERENCE ON BROADBAND NETWORKS, PROCEEDINGS, 2004, : 439 - 448
  • [6] A note on on-line broadcast scheduling with deadlines
    Han, Xin
    Guo, He
    Yin, Dawei
    Zhang, Yong
    INFORMATION PROCESSING LETTERS, 2009, 109 (03) : 204 - 207
  • [7] Improved on-line broadcast scheduling with deadlines
    Stanley P. Y. Fung
    Feifeng Zheng
    Wun-Tat Chan
    Francis Y. L. Chin
    Chung Keung Poon
    Prudence W. H. Wong
    Journal of Scheduling, 2008, 11 : 299 - 308
  • [8] Improved on-line broadcast scheduling with deadlines
    Fung, Stanley P. Y.
    Zheng, Feifeng
    Chan, Wun-Tat
    Chin, Francis Y. L.
    Poon, Chung Keung
    Wong, Prudence W. H.
    JOURNAL OF SCHEDULING, 2008, 11 (04) : 299 - 308
  • [9] Improved on-line broadcast scheduling with deadlines
    Zheng, Feifeng
    Fung, Stanley P. Y.
    Chan, Wun-Tat
    Chin, Francis Y. L.
    Poon, Chung Keung
    Wong, Prudence W. H.
    COMPUTING AND COMBINATORICS, PROCEEDINGS, 2006, 4112 : 320 - 329
  • [10] Optimal Scheduling of Caching in Gaussian Broadcast Channel with Common Information
    Lin, Zhiyuan
    Chen, Wei
    2018 IEEE GLOBAL COMMUNICATIONS CONFERENCE (GLOBECOM), 2018,