arXivDaily arXiv每日学术速递 周一至周五更新
arXiv 2103.16425cs.ITmath.IT
收藏

峰值信息年龄约束下的在线能量最小化

Online Energy Minimization Under A Peak Age of Information Constraint

Kumar Saurav, Rahul Vaze

AI总结:

本文研究峰值信息年龄约束下的节点在线能耗最小化问题,推导了因果策略竞争比的下界,并提出一种竞争比与下界参数依赖阶数相近的策略。

摘要:

我们研究这样一个节点:固定大小(以比特为单位)的数据包以任意间隔生成。该节点需要通过传输所生成数据包的一个子集,将监控端的峰值信息年龄(AoI)维持在阈值以下。在任意时刻,根据数据包可用情况和当前AoI,节点可以选择传输哪个数据包,以及以何种传输速率(单位:比特每秒)传输。功耗是传输速率的单调递增凸函数。本文针对任意给定的时间范围,目标是找到一种因果策略,在满足峰值AoI约束的同时使总能耗最小。我们采用竞争比作为性能指标,其定义为因果策略的期望成本与预先知晓输入(数据包生成时间)的最优离线策略的期望成本之比。我们首先推导了所有因果策略竞争比的下界,该下界以系统参数(如功率函数、数据包大小和峰值AoI阈值)表示,随后提出了一种特定策略,并证明其竞争比与所推导下界在系统参数上的依赖阶数相近。

英文摘要:

We consider a node where packets of fixed size (in bits) are generated at arbitrary intervals. The node is required to maintain the peak age of information (AoI) at the monitor below a threshold by transmitting potentially a subset of the generated packets. At any time, depending on the packet availability and the current AoI, the node can choose which packet to transmit, and at what transmission speed (in bits per second). Power consumption is a monotonically increasing convex function of the transmission speed. In this paper, for any given time horizon, the objective is to find a causal policy that minimizes the total energy consumption while satisfying the peak AoI constraint. We consider competitive ratio as the performance metric, that is defined as the ratio of the expected cost of a causal policy, and the expected cost of an optimal offline policy that knows the input (packet generation times) in advance. We first derive a lower bound on the competitive ratio of all causal policies, in terms of the system parameters (such as power function, packet size and peak AoI threshold), and then propose a particular policy for which we show that its competitive ratio has similar order of dependence on the system parameters as the derived lower bound.

机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。

↑