Affiliation:
1. Indian Institute of Technology Madras, India
Abstract
In this short paper, we consider the problem of designing a near-optimal competitive scheduling policy to maximize the freshness of available information uniformly across N mobile users. Motivated by the unreliability and non-stationarity of the emerging 5G-mmWave channels for high-speed users, we forego of any statistical modeling assumptions of the wireless channels and user-mobility. Instead, we allow the channel states and the mobility patterns to be dictated by an omniscient adversary. It is not difficult to see that no competitive scheduling policy can exist for the corresponding throughput-maximization problem in this adversarial model. Surprisingly, we show that there exists a simple online distributed scheduling policy with a finite competitive ratio for maximizing the freshness of information in this model. We also prove that the proposed policy is competitively optimal up to an O(logN) factor.
Publisher
Association for Computing Machinery (ACM)
Subject
Computer Networks and Communications,Hardware and Architecture,Software
Cited by
6 articles.
订阅此论文施引文献
订阅此论文施引文献,注册后可以免费订阅5篇论文的施引文献,订阅后可以查看论文全部施引文献
1. Age-Based Cache Updating Under Timestomping;2023 21st International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks (WiOpt);2023-08-24
2. Age of Information of a Power Constrained Scheduler in the Presence of a Power Constrained Adversary;IEEE INFOCOM 2023 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS);2023-05-20
3. Optimizing Age-of-Information in Adversarial and Stochastic Environments;IEEE Transactions on Information Theory;2022-10
4. Game Theoretic Analysis of an Adversarial Status Updating System;2022 IEEE International Symposium on Information Theory (ISIT);2022-06-26
5. Age of Information in the Presence of an Adversary;IEEE INFOCOM 2022 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS);2022-05-02