Modeling and Analysis of Generalized Slotted-Aloha MAC Protocols in Cooperative, Competitive and Adversarial Environments

Authors:
Richard T. B. Ma;Vishal Misra;Dan Rubenstein
Affiliations:
Columbia University;Columbia University;Columbia University
Venue:
ICDCS '06 Proceedings of the 26th IEEE International Conference on Distributed Computing Systems
Year:
2006

Citing 0
Cited 9

Cooperative and non-cooperative control for slotted aloha with random power level selections algorithms

Proceedings of the 2nd international conference on Performance evaluation methodologies and tools
Homogeneous Interference Game in Wireless Networks

WINE '08 Proceedings of the 4th International Workshop on Internet and Network Economics
An analysis of generalized slotted-Aloha protocols

IEEE/ACM Transactions on Networking (TON)
A hierarchical slotted aloha game

GameNets'09 Proceedings of the First ICST international conference on Game Theory for Networks
Stochastic learning solution for constrained Nash Equilibrium throughput in non saturated wireless collision channels

Proceedings of the Fourth International ICST Conference on Performance Evaluation Methodologies and Tools
Modeling slotted aloha as a stochastic game with random discrete power selection algorithms

Journal of Computer Systems, Networks, and Communications
Contention resolution under selfishness

ICALP'10 Proceedings of the 37th international colloquium conference on Automata, languages and programming: Part II
Stackelberg contention games in multiuser networks

EURASIP Journal on Advances in Signal Processing - Special issue on game theory in signal processing and communications
Hierarchy sustains partial cooperation and induces a Braess-like paradox in slotted aloha-based networks

Computer Communications

Quantified Score

Hi-index	0.02

Visualization

Abstract

Aloha [1] and its slotted variant [2] are commonly deployed Medium Access Control (MAC) protocols in environments where multiple transmitting devices compete for a medium, yet may have difficulty sensing each other's presence. This paper models and evaluates the throughput that can be achieved in a system where nodes compete for bandwidth using a generalized version of slotted- Aloha protocols. We evaluate the channel utilization and fairness of these types of protocols for a variety of node objectives, including maximizing aggregate throughput of the channel, each node greedily maximizing its own throughput, and attacker nodes that attempt to jam the channel. If all nodes are selfish and greedily attempt to maximize their own throughputs, a situation similar to the traditional Prisoner's Dilemma[3] arises. Our results reveal that under heavy loads, greedy strategies reduce the utilization, and that attackers cannot do much better than attacking during randomly selected slots.