论文标题
双面延迟约束计划：管理新鲜和过时的数据
Two-sided Delay Constrained Scheduling: Managing Fresh and Stale Data
论文作者
论文摘要
能源或时间效率的调度在无线通信中特别感兴趣，并在传感器网络设计，蜂窝通信等中进行了应用。在许多情况下，要传输的无线数据包的截止日期是在传输之前的时间上限的时间，以避免传输数据的稳固性。在本文中，由在关键安全通信，信息时代和分子通信中的新兴应用中进行的启发，我们将无线数据包调度框架扩展到场景，这些方案除了传统的传输前延迟延迟约束外，还涉及传输后时间的严格限制。结果，我们在双面单独的截止日期下介绍了调度问题，该期限捕获了该系统，其中传输得太晚（陈旧）和太早（Fresh）的系统都是不希望的。在上述双线截止日期的前提下，我们可以解决最佳（能量最少）离线数据包调度问题。利用此结果以及速率和能源之间的固有二元性，我们建议并解决了在引入的双面框架下的完成时间 - 最佳离线数据包调度问题。总体而言，开发的理论框架可以用于在传输前后的数据包（例如，关键安全应用程序）或对数据包延迟和信息新鲜度具有严格约束的应用程序的应用程序中使用有限的应用程序。
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.
