Slotted Aloha as a game with partial information
Computer Networks: The International Journal of Computer and Telecommunications Networking
Playing CSMA/CA game to deter backoff attacks in ad hoc wireless LANs
ADHOC-NOW'05 Proceedings of the 4th international conference on Ad-Hoc, Mobile, and Wireless Networks
Wireless multihoming modeled as a multi-WLAN game
Proceedings of the 12th ACM international conference on Modeling, analysis and simulation of wireless and mobile systems
| Hi-index | 0.01 |
Contention MAC protocols for a wireless LAN cannot count on selfish stations' adherence to the standard MAC. We consider anonymous stations in that a transmitted frame is only interpretable at the recipient(s). Two components of a MAC protocol are identified, a winner policy and a selection policy; by self-optimizing the latter, selfish stations can steal bandwidth from honest ones. We apply a game-theoretic framework to a protocol family called RT/ECD and design a repeated game strategy to discourage an invader ( a station selfishly deviating from that strategy. We require that (R1) if there is no invader, or if an invader retreats to honest behavior, then ultimately all stations are honest, and (R2) an invader ultimately obtain less bandwidth than it would if behaving honestly. The proposed strategy fulfills (R1), while fulfillment of (R2) is examined via Monte Carlo simulation of heuristic invader strategies.