Data networks
Network control by bayesian broadcast
IEEE Transactions on Information Theory
Multiple access protocols: performance and analysis
Multiple access protocols: performance and analysis
Achieving network optima using Stackelberg routing strategies
IEEE/ACM Transactions on Networking (TON)
An analysis of short-term fairness in wireless media access protocols (poster session)
Proceedings of the 2000 ACM SIGMETRICS international conference on Measurement and modeling of computer systems
Ethernet: distributed packet switching for local computer networks
Communications of the ACM
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
Selfish MAC Layer Misbehavior in Wireless Networks
IEEE Transactions on Mobile Computing
ICDCS '06 Proceedings of the 26th IEEE International Conference on Distributed Computing Systems
A game-theoretic study of CSMA/CA under a backoff attack
IEEE/ACM Transactions on Networking (TON)
THE ALOHA SYSTEM: another alternative for computer communications
AFIPS '70 (Fall) Proceedings of the November 17-19, 1970, fall joint computer conference
Achieving coordination in random access networks without explicit message passing
GameNets'09 Proceedings of the First ICST international conference on Game Theory for Networks
Effect of jamming signals on wireless ad hoc and sensor networks
GLOBECOM'09 Proceedings of the 28th IEEE conference on Global telecommunications
Medium access control protocols with memory
IEEE/ACM Transactions on Networking (TON)
Near-optimal deviation-proof medium access control designs in wireless networks
IEEE/ACM Transactions on Networking (TON)
| Hi-index | 0.00 |
Aloha and its slotted variation 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 (the "hidden terminal problem"). Competing 802.11 gateways, as well as most modern digital cellular systems, like GSM, are examples. 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. The protocol is implemented as a two-state system, where the probability that a node transmits in a given slot depends on whether the node's prior transmission attempt was successful. Using Markov Models, we evaluate the channel utilization and fairness of this class of protocols for a variety of node objectives, including maximizing aggregate throughput of the channel, each node selfishly maximizing its own throughput, and attacker nodes attempting to jam the channel. If all nodes are selfish and strategically attempt to maximize their own throughput, a situation similar to the traditional Prisoner's Dilemma arises. Our results reveal that under heavy loads, a greedy strategy reduces the utilization, and that attackers cannot do much better than attacking during randomly selected slots.