Distributed Scheduling Algorithms for Optimizing Information Freshness\n in Wireless Networks

2018/03/17 by Rajat Talak, Talak, Rajat, Sertaç Karaman +3 · 2 citations
Computer Science · Engineering · Psychology · #Age of Information Optimization #Cognitive Functions and Memory #FOS: Computer and information sciences #Information Theory (cs.IT) #IoT Networks and Protocols #Networking and Internet Architecture (cs.NI)

paper · pdf · doi:10.48550/arxiv.1803.06469

openalex publication_date 2018/03/17 · openalex created_date 2022/09/27 · openalex updated_date 2026/07/28

Abstract

Age of Information (AoI), measures the time elapsed since the last received\ninformation packet was generated at the source. We consider the problem of AoI\nminimization for single-hop flows in a wireless network, under pairwise\ninterference constraints and time varying channel. We consider simple, yet\nbroad, class of distributed scheduling policies, in which a transmission is\nattempted over each link with a certain attempt probability. We obtain an\ninteresting relation between the optimal attempt probability and the optimal\nAoI of the link, and its neighboring links. We then show that the optimal\nattempt probabilities can be computed by solving a convex optimization problem,\nwhich can be done distributively.\n

Cited by

• A Survey of Freshness-Aware Wireless Networking with Reinforcement Learning
• Age of Information: An Introduction and Survey

Related

• Optimizing Information Freshness in Wireless Networks under General\n Interference Constraints
• Scheduling Policies for Age Minimization in Wireless Networks with Unknown Channel State
• Scheduling Policies for Minimizing Age of Information in Broadcast Wireless Networks
• Optimizing Age of Information in Wireless Networks with Perfect Channel\n State Information
• Minimizing the Age of Information in Wireless Networks with Stochastic Arrivals