Scheduling to Minimize Age of Information With Multiple Sources

Finding an optimal/near-optimal scheduling algorithm to minimize the age of information (AoI) in a multi-source G/G/1 system is well-known to be a hard problem, more so if there is a transmission (energy) cost. In this paper, we consider a multi-source G/G/1 system and the goal is to minimize a weig...

Full description

Bibliographic Details

Published in:	IEEE journal on selected areas in information theory Vol. 4; pp. 539 - 550
Main Authors:	Saurav, Kumar, Vaze, Rahul
Format:	Journal Article
Language:	English
Published:	Piscataway IEEE 2023 The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:	Age of information Algorithms competitive ratio Costs Energy costs Monitoring Optimal scheduling Preempting Scheduling Scheduling algorithms Stochastic processes Upper bound
ISSN:	2641-8770, 2641-8770
Online Access:	Get full text
Tags:	Add Tag No Tags, Be the first to tag this record!