Title: Two-sided Delay Constrained Scheduling: Managing Fresh and Stale Data Show Chinese title

Title: 双向延迟约束调度：管理新鲜数据和过时数据

Abstract: 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. Show Chinese abstract

Abstract: 能量或时间高效的调度在无线通信中具有特别的重要性，应用于传感器网络设计、蜂窝通信等。 在许多情况下，待发送的无线数据包有截止时间，这上限规定了其传输之前的时间，以避免传输数据的过时。 在本文中，受安全关键通信、信息年龄和分子通信中新兴应用的启发，我们将无线数据包调度框架扩展到涉及传输后严格时间限制的场景，除了传统的传输前延迟约束之外。 因此，我们引入了在双侧单独截止时间下的调度问题，该问题捕捉了传输太晚（过时）和太早（新鲜）都不理想的情况。 在所述双侧截止时间的约束下，我们可证明地解决了最优（能量最小化）离线数据包调度问题。 利用这一结果以及速率和能量之间的固有对偶性，我们在引入的双侧框架下提出了并解决了完成时间最优的离线数据包调度问题。 总体而言，所开发的理论框架可以用于数据包在传输前后都有有限生命周期的应用（例如，安全关键应用），或者在数据包延迟和信息新鲜度上有联合严格约束的应用。