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 条
  • [31] The capacity region of the Gaussian MIMO broadcast channel
    Weingarten, H
    Steinberg, Y
    Shamai, S
    2004 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY, PROCEEDINGS, 2004, : 174 - 174
  • [32] On the capacity region of the vector Gaussian broadcast channel
    Tse, DNC
    Viswanath, P
    2003 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY - PROCEEDINGS, 2003, : 342 - 342
  • [33] Optimal Online Scheduling With Arbitrary Hard Deadlines in Multihop Communication Networks
    Mao, Zhoujia
    Koksal, Can Emre
    Shroff, Ness B.
    IEEE-ACM TRANSACTIONS ON NETWORKING, 2016, 24 (01) : 177 - 189
  • [34] A Game Theoretic Model for the Gaussian Broadcast Channel
    Yerramalli, Srinivas
    Jain, Rahul
    Mitra, Urbashi
    2012 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY PROCEEDINGS (ISIT), 2012,
  • [35] On the use of the gap approximation for the Gaussian broadcast channel
    Toumpakaris, Dimitris
    Lee, Jungwon
    2010 IEEE GLOBAL TELECOMMUNICATIONS CONFERENCE GLOBECOM 2010, 2010,
  • [36] Secrecy Capacity Region of Gaussian Broadcast Channel
    Bagherikaram, Ghadamali
    Motahari, Abolfazl S.
    Khandani, Amir K.
    2009 43RD ANNUAL CONFERENCE ON INFORMATION SCIENCES AND SYSTEMS, VOLS 1 AND 2, 2009, : 152 - 157
  • [37] Batch scheduling with deadlines on parallel machines: An NP-hard case
    Kovalyov, MY
    Shafransky, YM
    INFORMATION PROCESSING LETTERS, 1997, 64 (02) : 69 - 74
  • [38] ERROR PROBABILITIES FOR GAUSSIAN BROADCAST CHANNEL.
    Morii, Fujiki
    Nakanishi, Hikaru
    Tezuka, Yoshikazu
    1600, (59):
  • [39] On the achievable throughput of a multiantenna Gaussian broadcast channel
    Caire, G
    Shamai, S
    IEEE TRANSACTIONS ON INFORMATION THEORY, 2003, 49 (07) : 1691 - 1706
  • [40] Batch scheduling with deadlines on parallel machines: An NP-hard case
    Institute of Engineering Cybernetics, Natl. Academy of Sciences of Belarus, Surganova 6, 220012 Minsk, Belarus
    Inf. Process. Lett., 2 (69-74):