Two-Sided Delay Constrained Scheduling: Managing Fresh and Stale Data

• Published in: IEEE transactions on wireless communications Vol. 23; no. 4; pp. 3238 - 3251
• Main Authors: Gursoy, Mustafa Can, Mitra, Urbashi
• Format: Journal Article
• Language: English
• Published: New York IEEE 01.04.2024; The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
• Subjects: completion time minimization; Constraints; Delay; Delays; Energy efficiency; energy minimization; Freshness; Minimization; Network design; Packet transmission; post-transmission delay constraints; Scheduling; Scheduling algorithms; Security; Staling; Time factors; two-sided delay constraints; Upper bounds; Wireless communication; Wireless communications
• ISSN: 1536-1276; 1558-2248
• DOI: 10.1109/TWC.2023.3306790

Energy or time-efficient scheduling is of particular interest in wireless communications, with applications in sensor network design, cellular communications, and more. In many cases, wireless packets to be transmitted have deadlines that upper bound the times before their transmissions, to avoid staleness of transmitted data. In this paper, motivated by emerging applications in security-critical communications, age of information, and molecular communications, we expand the wireless packet scheduling framework to scenarios which involve strict limits on the time after transmission, in addition to the conventional pre-transmission delay constraints. As a result, we introduce the scheduling problem under two-sided individual deadlines, which captures systems wherein transmitting too late (stale) and too early (fresh) are both undesired. Subject to said two-sided deadlines, we provably solve the optimal (energy-minimizing) offline packet scheduling problem. Leveraging this result and the inherent duality between rate and energy, we propose and solve the completion-time-optimal offline packet scheduling problem under the introduced two-sided framework. Overall, the developed theoretical framework can be utilized in applications wherein packets have finite lifetimes both before and after their transmission ( e.g., security-critical applications), or applications with joint strict constraints on packet delay and information freshness.