摘要
信息年龄(AoI)是近年来针对时间敏感类应用所提出的一种描述数据交付及时性的度量标准,它是从网络中目标节点的角度出发,衡量其最新收到的数据包的新鲜程度。在信道资源受限的多信道无线网络场景中,基于信息年龄的链路调度问题需要考虑信道资源和链路冲突的约束。针对上述问题,该文提出一种逐时隙调度链路进行数据传输的调度方法,以最小化网络的平均信息年龄。该文首先将信息年龄的优化问题转化为李雅普诺夫优化问题,然后将冲突约束下的多信道分配问题转换为二分图匹配问题并采用Kuhn-Munkres(KM)算法进行求解,进而得到约束条件下的链路调度方法。仿真结果表明,所提方法有效地优化了网络中的平均信息年龄,提升了网络数据的新鲜度。
Age of Information(AoI)is a novel metric that describes the timeliness of data delivery for timesensitive applications,which measures the freshness of the most recently received packet from the perspective of destination node.In the multi-channel wireless network scenario with limited channel resources,the constraints of channel resources and link conflicts should be considered in the link scheduling with respect to AoI.To address this issue,in this paper,a time slot based scheduling method for data transmission to minimize the average AoI in the network is proposed.In this method,the optimization problem of AoI is first formulated into a Lyapunov optimization problem.Then the multi-channel conflict problem is converted to find the maximum matching policy of bipartite graph,which is solved by Kuhn-Munkres(KM)algorithm.Thus,a scheduling policy under constraints is obtained.The simulation results demonstrate that the proposed method optimizes effectively the average AoI and improves the freshness of data in the network.
作者
王恒
段思勰
谢鑫
WANG Heng;DUAN Sixie;XIE Xin(Key Laboratory of Industrial Internet of Things and Networked Control,Chongqing University of Posts and Telecommunications,Chongqing 400065,China;School of Communication and Information Engineering,Chongqing University of Posts and Telecommunications,Chongqing 400065,China)
出处
《电子与信息学报》
EI
CSCD
北大核心
2022年第2期702-709,共8页
Journal of Electronics & Information Technology
基金
国家重点研发计划(2018YFB1702000)
重庆市自然科学基金(cstc2019jcyjjqX0012,cstc2019jcyj-msxmX0444)
重庆邮电大学博士研究生人才培养项目(BYJS202001)。
关键词
信息年龄
网络调度
多信道网络
李雅普诺夫优化
Age of Information(AoI)
Network scheduling
Multi-channel network
Lyapunov optimization
