Slotted Aloha as a game with partial information
Computer Networks: The International Journal of Computer and Telecommunications Networking
Solvability of a Markovian Model of an IEEE 802.11 LAN under a Backoff Attack
MASCOTS '05 Proceedings of the 13th IEEE International Symposium on Modeling, Analysis, and Simulation of Computer and Telecommunication Systems
802.11 denial-of-service attacks: real vulnerabilities and practical solutions
SSYM'03 Proceedings of the 12th conference on USENIX Security Symposium - Volume 12
Game theory and the design of self-configuring, adaptive wireless networks
IEEE Communications Magazine
Performance analysis of the IEEE 802.11 distributed coordination function
IEEE Journal on Selected Areas in Communications
Radio resource sharing games: enabling QoS support in unlicensed bands
IEEE Network: The Magazine of Global Internetworking
| Hi-index | 0.00 |
For an ad hoc IEEE 802.11 WLAN we investigate how a backoff attack (configuring small minimum and/or maximum CSMA/CA contention windows at some stations in pursuit of a large bandwidth share) affects a proposed capacity-fairness index CFI. If the backoff mechanism is mandatory, the CSMA/CA game that arises has a unique Nash equilibrium. In the opposite case there is no single compelling outcome; we envisage that a station then calculates backoff attack incentives to predict imminent play. We link CFI the network size, "power awareness," a station's perception of the other stations' susceptibility to incentives, and the way of learning how the stations perceive the other stations' susceptibility to incentives. We show that if the stations are few and "power aware," cooperative behavior emerges quite frequently.