Medium access control protocols with memory
TL;DR: In this paper, a general framework to express and evaluate distributed medium access control protocols utilizing a finite length of memory for a given form of feedback information is provided. But the performance of protocols with one-slot memory is not analyzed.
read more
Abstract: Many existing medium access control (MAC) protocols utilize past information (e.g., the results of transmission attempts) to adjust the transmission parameters of users. This paper provides a general framework to express and evaluate distributed MAC protocols utilizing a finite length of memory for a given form of feedback information. We define protocols with memory in the context of a slotted random access network with saturated arrivals. We introduce two performance metrics, throughput and average delay, and formulate the problem of finding an optimal protocol. We first show that a time-division multiple access (TDMA) outcome, which is the best outcome in the considered scenario, can be obtained after a transient period by using a protocol with (N - 1)-slot memory, where N is the total number of users. Next, we analyze the performance of protocols with one-slot memory using a Markov chain and numerical methods. Protocols with one-slot memory can achieve throughput arbitrarily close to 1 (i.e., 100% channel utilization) at the expense of large average delay by correlating successful users in two consecutive slots. Finally, we apply our framework to wireless local area networks (WLANs).
read more
Chat with Paper
AI Agents for this Paper
Find similar papers on Google Scholar, PubMed and Arxiv
Write a critical review of this paper
Analyze citations of this paper to find unaddressed research gaps
Citations
Repeated Games with Intervention: Theory and Applications in Communications
TL;DR: A model of repeated games with intervention is formed that can convexify the set of feasible payoffs in one-shot games and achieve a larger set of equilibrium payoffs, and study the problem of maximizing a welfare function defined on users' payoffs.
31
•Posted Content
Repeated Games With Intervention: Theory and Applications in Communications
TL;DR: In this article, the authors proposed a generalized repeated game model generalized by intervention to solve the problem of maximizing a welfare function defined on users' equilibrium payoffs, subject to minimum payoff guarantees.
24
Attachment-Learning for Multi-Channel Allocation in Distributed OFDMA-Based Networks
TL;DR: This work proposes a cross layer design, termed Attachment Learning (AT-Learning), to achieve multi-channel allocation with low cost and high efficiency in distributed OFDMA based networks, and demonstrates that AT-Learning can improve the throughput by up to 300% over Slotted ALOHA.
18
Winning the Lottery: Learning Perfect Coordination With Minimal Feedback
TL;DR: Simulations show that, in a variety of deployment scenarios, perfect coordination protocols outperform existing state-of-the-art protocols-despite requiring much less feedback.
Multiple Antenna Techniques for Wireless Mesh Networks
Athanasios Gkelias,K. K. Leung +1 more
- 01 Jan 2008
13
References
An Introduction To Probability Theory And Its Applications
Feller William
- 01 Jan 1950
TL;DR: A First Course in Probability (8th ed.) by S. Ross is a lively text that covers the basic ideas of probability theory including those needed in statistics.
10.2K
Performance analysis of the IEEE 802.11 distributed coordination function
TL;DR: In this paper, a simple but nevertheless extremely accurate, analytical model to compute the 802.11 DCF throughput, in the assumption of finite number of terminals and ideal channel conditions, is presented.
8.8K
•Book
Matrix Analysis and Applied Linear Algebra
Carl D. Meyer
- 24 May 2010
TL;DR: The author presents Perron-Frobenius theory of nonnegative matrices Index, a theory of matrices that combines linear equations, vector spaces, and matrix algebra with insights into eigenvalues and Eigenvectors.
5.3K
ALOHA packet system with and without slots and capture
Lawrence G. Roberts
- 01 Apr 1975
TL;DR: Roberts investigates methods of increasing the effective channel capacity of such a channel and proposes to consider the channel to be slotted into segments of time whose duration is equal to the packet transmission time, and to require the devices to begin a packet transmission at the beginning of a time slot.
1.5K
Related Papers (5)
Guanghong Wang,Yantai Shu,Liang Zhang,Oliver W. W. Yang +3 more
- 07 Sep 2003
X. Liu,Andrea Goldsmith +1 more
- 01 Jan 2004