Energy-Efficient Packet Scheduling under Two-Sided Delay Constraints
Energy-Efficient Packet Scheduling under Two-Sided Delay Constraints
复制标题
DOI：
10.1109/icc45041.2023.10278634
复制
发表时间：
2023-05
期刊：
影响因子：
--
通讯作者：
Mustafa Can Gursoy;Urbashi Mitra
中科院分区：
文献类型：
--
作者：
Mustafa Can Gursoy;Urbashi Mitra
实现能源效率是现代应用（多媒体通信，传感器网络等）的标志。其利用无线通信。经典的方法，以能源效率的数据包调度假设，无线数据包是受截止日期之前，他们需要被发送。新兴的应用，如安全关键通信，信息新鲜度，分子通信等，要求扩展延迟约束，也包括传输后的时间限制。因此，目前的工作强烈推广的能源效率的调度问题，双边延迟约束，严格的上限和下限出发时间。本文提供了新的双边延迟问题的公式以及可证明的最优离线算法。双边约束调度的理论框架是一般的，可以利用在任何调度应用程序，涉及数据包的有限生命周期之前和之后，他们的传输。
Achieving energy-efficiency is a hallmark of modern applications (multimedia communication, sensor networks, etc.) which exploit wireless communications. The classical approach to energy-efficient packet scheduling has presumed that wireless packets are subject to deadlines before which they need to be transmitted. Emerging applications such as security-critical communications, information freshness, molecular communications, and more, call for expanding the delay constraint to also include limits on the time after transmission. The current work thus strongly generalizes the energy-efficient scheduling problem to two-sided delay constraints that both strictly upper- and lower-bound departure times. The formulation for the new two-sided delay problem as well as a provably optimal offline algorithm are provided herein. The presented theoretical framework of two-sided constrained scheduling is general and can be leveraged in any scheduling application that involves packets with finite lifetimes both before and after their transmission.