2020/01/09 by Ali Maatouk, Maatouk, Ali, Saad Kriouile +5 · 4 citations
Computer Science · Engineering · #Advanced Wireless Network Optimization #Age of Information Optimization #FOS: Computer and information sciences #Information Theory (cs.IT)
paper · pdf · doi:10.48550/arxiv.2001.03096
openalex publication_date 2020/01/09 · openalex created_date 2022/07/26 · openalex updated_date 2026/07/28
In this paper, we consider the average age minimization problem where a\ncentral entity schedules M users among the N available users for transmission\nover unreliable channels. It is well-known that obtaining the optimal policy,\nin this case, is out of reach. Accordingly, the Whittle's index policy has been\nsuggested in earlier works as a heuristic for this problem. However, the\nanalysis of its performance remained elusive. In the sequel, we overcome these\ndifficulties and provide rigorous results on its asymptotic optimality in the\nmany-users regime. Specifically, we first establish its optimality in the\nneighborhood of a specific system's state. Next, we extend our proof to the\nglobal case under a recurrence assumption, which we verify numerically. These\nfindings showcase that the Whittle's index policy has analytically provable\noptimality in the many-users regime for the AoI minimization problem. Finally,\nnumerical results that showcase its performance and corroborate our theoretical\nfindings are presented.\n