Abstract:
We study Age of Information (AoI) in a random access channel where a number of devices try to send status updates over a common medium. Assuming a time-slotted scenario w...Show MoreMetadata
Abstract:
We study Age of Information (AoI) in a random access channel where a number of devices try to send status updates over a common medium. Assuming a time-slotted scenario where multiple transmissions result in collision, we propose a threshold-based lazy version of Slotted ALOHA and derive the time average AoI achieved by this policy. We demonstrate that the average AoI performance of the lazy policy is significantly better than Slotted ALOHA, and close to the ideal round robin benchmark.
Published in: IEEE INFOCOM 2020 - IEEE Conference on Computer Communications Workshops (INFOCOM WKSHPS)
Date of Conference: 06-09 July 2020
Date Added to IEEE Xplore: 10 August 2020
ISBN Information: