摘要
In this paper,we investigate the minimization of age of information(AoI),a metric that measures the information freshness,at the network edge with unreliable wireless communications.Particularly,we consider a set of users transmitting status updates,which are collected by the user randomly over time,to an edge server through unreliable orthogonal channels.It begs a natural question:with random status update arrivals and obscure channel conditions,can we devise an intelligent scheduling policy that matches the users and channels to stabilize the queues of all users while minimizing the average AoI?To give an adequate answer,we define a bipartite graph and formulate a dynamic edge activation problem with stability constraints.Then,we propose an online matching while learning algorithm(MatL)and discuss its implementation for wireless scheduling.Finally,simulation results demonstrate that the MatL is reliable to learn the channel states and manage the users’buffers for fresher information at the edge.
基金
supported in part by Shanghai Pujiang Program under Grant No.21PJ1402600
in part by Natural Science Foundation of Chongqing,China under Grant No.CSTB2022NSCQ-MSX0375
in part by Song Shan Laboratory Foundation,under Grant No.YYJC022022007
in part by Zhejiang Provincial Natural Science Foundation of China under Grant LGJ22F010001
in part by National Key Research and Development Program of China under Grant 2020YFA0711301
in part by National Natural Science Foundation of China under Grant 61922049
。
