Achieving coordination in random access networks without explicit message passing

Authors:
Jaeok Park;Mihaela van der Schaar
Affiliations:
Department of Economics, University of California, Los Angeles, CA;Department of Electrical Engineering, University of California, Los Angeles, CA
Venue:
GameNets'09 Proceedings of the First ICST international conference on Game Theory for Networks
Year:
2009

Citing 8
Cited 0

Ultimate instability of exponential back-off protocol for acknowledgment-based transmission control of random access communication channels

IEEE Transactions on Information Theory
Stability of binary exponential backoff

Journal of the ACM (JACM)
Data networks (2nd ed.)

Data networks (2nd ed.)
Matrix analysis and applied linear algebra

Matrix analysis and applied linear algebra
Slotted Aloha as a game with partial information

Computer Networks: The International Journal of Computer and Telecommunications Networking
Performance analysis of exponential backoff

IEEE/ACM Transactions on Networking (TON)
An analysis of generalized slotted-Aloha protocols

IEEE/ACM Transactions on Networking (TON)
Correlated equilibrium in access control for wireless communications

NETWORKING'06 Proceedings of the 5th international IFIP-TC6 conference on Networking Technologies, Services, and Protocols; Performance of Computer and Communication Networks; Mobile and Wireless Communications Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

We propose a class of medium access control (MAC) protocols that utilize users' own transmission decisions and feedback information from the past slots. We consider an idealized slotted Aloha system and formulate the problem of a protocol designer who cares about the total throughput, the short-term fairness, and the complexity of protocols. A solution to the protocol designer's problem is provided with two users, and an approximate solution with three or more users. We use numerical methods to obtain optimal protocols that solve the protocol designer's problem, compare the total throughput of optimal protocols with that of other protocols proposed in the literature, and analyze a trade-off between throughput and fairness. The results show that by utilizing information obtained in the previous slot, users can achieve some degree of coordination without explicit message passing, which leads to high total throughput.