Improving Age of Information in Random Access Channels
IEEE Conference on Computer Communications (IEEE INFOCOM), ELECTR NETWORK, 6 - 09 July 2020, pp.912-917, (Full Text)
- Publication Type: Conference Paper / Full Text
- Volume:
- Doi Number: 10.1109/infocomwkshps50562.2020.9163053
- Country: ELECTR NETWORK
- Page Numbers: pp.912-917
- Keywords: Age of information, random access, slotted ALOHA, age minimization
- Middle East Technical University Affiliated: Yes
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.