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 u...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.展开更多
The Maximum C/I scheduling algorithm can provide the maximumsystem capacity for adaptive modu- lation and coding systems.however, it incurs poor fairness and high packet-dropping rate forreal-time service. We propose ...The Maximum C/I scheduling algorithm can provide the maximumsystem capacity for adaptive modu- lation and coding systems.however, it incurs poor fairness and high packet-dropping rate forreal-time service. We propose here a new scheduling algorithm,Earliest-Due-Date Maximum C/I Scheduling Algorithm(EDDMCI), bycombining deadline control with Maximum C/I to solve this problemeffectively. Analysis and simulation show that EDDMCI can providebounded delay/jitter guarantee and better fairness, as well as finesystem throughput.展开更多
基金supported in part by Shanghai Pujiang Program under Grant No.21PJ1402600in part by Natural Science Foundation of Chongqing,China under Grant No.CSTB2022NSCQ-MSX0375+4 种基金in part by Song Shan Laboratory Foundation,under Grant No.YYJC022022007in part by Zhejiang Provincial Natural Science Foundation of China under Grant LGJ22F010001in part by National Key Research and Development Program of China under Grant 2020YFA0711301in part by National Natural Science Foundation of China under Grant 61922049。
文摘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.
文摘The Maximum C/I scheduling algorithm can provide the maximumsystem capacity for adaptive modu- lation and coding systems.however, it incurs poor fairness and high packet-dropping rate forreal-time service. We propose here a new scheduling algorithm,Earliest-Due-Date Maximum C/I Scheduling Algorithm(EDDMCI), bycombining deadline control with Maximum C/I to solve this problemeffectively. Analysis and simulation show that EDDMCI can providebounded delay/jitter guarantee and better fairness, as well as finesystem throughput.
