Delay Optimal Scheduling of Arbitrarily Bursty Traffic over Multi-State Time-Varying Channels

被引:0
|
作者
Wang, Meng [1 ]
Liu, Juan [2 ]
Chen, Wei [1 ]
机构
[1] Tsinghua Univ, Dept Elect Engn, Tsinghua Natl Lab Informat Sci & Technol TNList, Beijing, Peoples R China
[2] Ningbo Univ, Coll Elect Engn & Comp Sci, Ningbo 315211, Zhejiang, Peoples R China
关键词
The Internet of things; cross-layer design; Markov chain; scheduling; delay-power tradeoff; WIRELESS; TRANSMISSION;
D O I
暂无
中图分类号
TM [电工技术]; TN [电子技术、通信技术];
学科分类号
0808 ; 0809 ;
摘要
An important challenge in the Internet of Things (IoT) is to provide real-time services on low-energy-supply devices. In this paper, we study joint queue-aware and channel-aware scheduling of arbitrarily bursty traffic over multi-state time-varying channels, where the bursty packet arrival in the network layer, the backlogged queue in the data link layer, and the power adaptive transmission with fixed modulation in the physical layer are jointly considered from a cross-layer perspective. To achieve minimum queueing delay given a power constraint, a probabilistic cross-layer scheduling policy is proposed, and characterized by a Markov chain model. To describe the delay-power tradeoff, we formulate a non-linear optimization problem, which however is very challenging to solve. To handle with this issue, we convert the optimization problem into an equivalent Linear Programming (LP) problem, which allows us to obtain the optimal threshold-based scheduling policy with an optimal threshold imposed on the queue length in accordance with each channel state.
引用
收藏
页数:6
相关论文
共 50 条
  • [1] Joint Queue-Aware and Channel-Aware Delay Optimal Scheduling of Arbitrarily Bursty Traffic Over Multi-State Time-Varying Channels
    Wang, Meng
    Liu, Juan
    Chen, Wei
    Ephremides, Anthony
    [J]. IEEE TRANSACTIONS ON COMMUNICATIONS, 2019, 67 (01) : 503 - 517
  • [2] Conditionally Optimal Minimum-Delay Scheduling for Bursty Traffic Over Fading Channels
    Baccarelli, Enzo
    Cordeschi, Nicola
    Biagi, Mauro
    [J]. IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, 2010, 59 (07) : 3294 - 3310
  • [3] Throughput Optimal Scheduling Over Time-Varying Channels in the Presence of Heavy-Tailed Traffic
    Jagannathan, Krishna
    Markakis, Mihalis G.
    Modiano, Eytan
    Tsitsiklis, John N.
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2014, 60 (05) : 2896 - 2909
  • [4] Minimizing Age of Information With Power Constraints: Multi-User Opportunistic Scheduling in Multi-State Time-Varying Channels
    Tang, Haoyue
    Wang, Jintao
    Song, Linqi
    Song, Jian
    [J]. IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, 2020, 38 (05) : 854 - 868
  • [5] Delay-bounded packet scheduling of bursty traffic over wireless channels
    Rajan, D
    Sabharwal, A
    Aazhang, B
    [J]. IEEE TRANSACTIONS ON INFORMATION THEORY, 2004, 50 (01) : 125 - 144
  • [6] Scheduling in Networks With Time-Varying Channels and Reconfiguration Delay
    Celik, Guener D.
    Modiano, Eytan
    [J]. IEEE-ACM TRANSACTIONS ON NETWORKING, 2015, 23 (01) : 99 - 113
  • [7] Scheduling in Networks with Time-Varying Channels and Reconfiguration Delay
    Celik, Guener D.
    Modiano, Eytan
    [J]. 2012 PROCEEDINGS IEEE INFOCOM, 2012, : 990 - 998
  • [8] Optimal Scheduling over Time-Varying Channels with Traffic Admission Control: Structural Results and Online Learning Algorithms
    Phan, Khoa T.
    Tho Le-Ngoc
    van der Schaar, Mihaela
    Fu, Fangwen
    [J]. IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, 2013, 12 (09) : 4434 - 4444
  • [9] Scheduling to Minimize Age of Information in Multi-State Time-Varying Networks with Power Constraints
    Tang, Haoyue
    Wang, Jintao
    Song, Linqi
    Song, Jian
    [J]. 2019 57TH ANNUAL ALLERTON CONFERENCE ON COMMUNICATION, CONTROL, AND COMPUTING (ALLERTON), 2019, : 1198 - 1205
  • [10] Delay Optimal Scheduling for ARQ-Aided Power-Constrained Packet Transmission Over Multi-State Fading Channels
    Liu, Juan
    Chen, Wei
    Letaief, Khaled B.
    [J]. IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, 2017, 16 (11) : 7123 - 7137