Adaptive MAC Protocols Using Memory for Networks with Critical Traffic
Jaeok Park, Mihaela van der Schaar

TL;DR
This paper introduces distributed MAC protocols leveraging finite memory to prioritize critical traffic in wireless networks, enabling rapid transmission for critical users while maintaining efficiency for non-critical users.
Contribution
It proposes novel memory-based MAC protocols that coordinate access without message passing, ensuring quick critical traffic transmission and efficient sharing.
Findings
Critical users transmit without interruption after short delay.
Protocols operate with short memory and no explicit message passing.
Efficient channel sharing when no critical traffic is present.
Abstract
We consider wireless communication networks where network users are subject to critical events such as emergencies and crises. If a critical event occurs to a user, the user needs to send critical traffic as early as possible. However, most existing medium access control (MAC) protocols are not adequate to meet the urgent need for data transmission by users with critical traffic. In this paper, we devise a class of distributed MAC protocols that achieve coordination using the finite-length memory of users containing their own observations and traffic types. We formulate a protocol design problem and find optimal protocols that solve the problem. We show that the proposed protocols enable a user with critical traffic to transmit its critical traffic without interruption from other users after a short delay while allowing users to share the channel efficiently when there is no critical…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
