Reversible Models for Wireless Multi-Channel Multiple Access
Michael J. Neely
Abstract
This paper presents a network layer model for a wireless multiple access system with both persistent and nonpersistent users. There is a single access point with multiple identical channels. Each user who wants to send a file first scans a subset of the channels to find one that is idle. If at least one idle channel is found, the user transmits a file over that channel. If no idle channel is found, a persistent user will repeat the access attempt at a later time, while a nonpersistent user will leave. This is a useful mathematical model for situations where a group of persistent users stay near an access point for an extended period of time while nonpersistent users come and go. Users have heterogeneous activity behavior, file upload rates, and service durations. The system is a complex multi-dimensional Markov chain. The steady state probabilities are found by exploiting a latent reversibility property and leveraging a discrete Fourier transform. This enables simple expressions for throughput and blocking probability.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Related papers
- A Converse Result on Convergence Time for Opportunistic Wireless SchedulingMichael J. NeelyINFOCOM 2020 · 3 citations
- Stable and Efficient Piece-Selection in Multiple Swarm BitTorrent-like Peer-to-Peer NetworksNouman Khan, Mehrdad Moharrami, Vijay G. SubramanianINFOCOM 2020 · 3 citations
- Age-Dependent Distributed MAC for Ultra-Dense Wireless NetworksDheeraj Narasimha, Srinivas Shakkottai, Lei YingINFOCOM 2021 · 2 citations
- Confusions and Erasures of Error-Bounded Block Decoders with Finite BlocklengthBin Han, Yao Zhu, Rafael F. Schaefer, Giuseppe Caire et al.INFOCOM 2026
- Motion-Prediction-based Wireless Scheduling for Multi-User Panoramic Video StreamingJiangong Chen, Xudong Qin, Guangyu Zhu, Bo Ji et al.INFOCOM 2021 · 16 citations
