This letter considers a wireless network where an access point (AP) broadcasts timely updates to several mobile users. The timeliness of information owned by a user is characterized by the recently proposed age of information. While frequently broadcasting the timely updates and always using the maximum power can minimize the age of information for all users, that wastes valuable communication resources (i.e., time and energy). For addressing the age-energy trade-off, it is critical to develop an efficient scheduling algorithm identifying broadcast times and allocating the power. Moreover, unpredictable users' movement would cause rapidly-varying communication channels; in particular, those channels can be non-stationary or adversarial. Our main contribution is to develop an online scheduling algorithm and a channel-agnostic scheduling algorithm for the mobile network with a provable performance guarantee.
翻译:本信认为无线网络是一个接入点向若干移动用户及时广播最新消息的无线网络。用户拥有信息的及时性以最近拟议的信息年龄为特征。经常广播及时更新信息并始终使用最大功率可以最大限度地减少所有用户的信息年龄,浪费宝贵的通信资源(即时间和能源 ) 。为了解决时代能源的权衡问题,必须制定高效的日程安排算法,确定广播时间并分配电力。此外,不可预测的用户流动将带来迅速变化的通信渠道,特别是这些渠道可以是非静止或对抗性的。我们的主要贡献是为移动网络开发在线日程排程算法和频道保密排程算法,并有可行的性能保证。