Efficient optical communication in parallel computers
SPAA '92 Proceedings of the fourth annual ACM symposium on Parallel algorithms and architectures
On contention resolution protocols and associated probabilistic phenomena
Journal of the ACM (JACM)
Analysis of practical backoff protocols for contention resolution with multiple servers
Journal of Computer and System Sciences
Contention resolution with constant expected delay
Journal of the ACM (JACM)
Stochastic Contention Resolution with Short Delays
Stochastic Contention Resolution with Short Delays
ALOHA packet system with and without slots and capture
ACM SIGCOMM Computer Communication Review
Slotted Aloha as a game with partial information
Computer Networks: The International Journal of Computer and Telecommunications Networking
Adversarial contention resolution for simple channels
Proceedings of the seventeenth annual ACM symposium on Parallelism in algorithms and architectures
ICDCS '06 Proceedings of the 26th IEEE International Conference on Distributed Computing Systems
Efficient contention resolution protocols for selfish agents
SODA '07 Proceedings of the eighteenth annual ACM-SIAM symposium on Discrete algorithms
Cooperation and Fairness for Slotted Aloha
Wireless Personal Communications: An International Journal
Distributed opportunistic scheduling for ad-hoc communications: an optimal stopping approach
Proceedings of the 8th ACM international symposium on Mobile ad hoc networking and computing
THE ALOHA SYSTEM: another alternative for computer communications
AFIPS '70 (Fall) Proceedings of the November 17-19, 1970, fall joint computer conference
STACS'99 Proceedings of the 16th annual conference on Theoretical aspects of computer science
Using game theory to analyze wireless ad hoc networks
IEEE Communications Surveys & Tutorials
IEEE Transactions on Information Theory
Contention issues in congestion games
ICALP'12 Proceedings of the 39th international colloquium conference on Automata, Languages, and Programming - Volume Part II
| Hi-index | 0.00 |
In many communications settings, such as wired and wireless local-area networks, when multiple users attempt to access a communication channel at the same time, a conflict results and none of the communications are successful. Contention resolution is the study of distributed transmission and retransmission protocols designed to maximize notions of utility such as channel utilization in the face of blocking communications. An additional issue to be considered in the design of such protocols is that selfish users may have incentive to deviate from the prescribed behavior, if another transmission strategy increases their utility. The work of Fiat et al. [8] addresses this issue by constructing an asymptotically optimal incentive-compatible protocol. However, their protocol assumes the cost of any single transmission is zero, and the protocol completely collapses under non-zero transmission costs. In this paper, we treat the case of non-zero transmission cost c. We present asymptotically optimal contention resolution protocols that are robust to selfish users, in two different channel feedback models. Our main result is in the Collision Multiplicity Feedback model, where after each time slot, the number of attempted transmissions is returned as feedback to the users. In this setting, we give a protocol that has expected cost 2n + clogn and is in o(1)-equilibrium, where n is the number of users.