A Game-Theoretic Study of CSMA/CA Under a Backoff Attack

• Published in: IEEE/ACM transactions on networking 2006-12, Vol.14 (6), p.1167-1178
• Main Author: Konorski, J.
• Format: Article
• Language: English
• Subjects: Access protocols; Ad hoc LAN; Bandwidth; Bandwidths; Communications networks; Crisps; Game theory; Games; IEEE standards; Local area networks; MAC protocol; Media Access Protocol; Mobile ad hoc networks; Multiaccess communication; Nash equilibrium; Network security; Pareto optimality; Pareto optimum; selfish behavior; Stations; Strategy; Studies; Transport protocols; Utilities; Wireless LAN
• ISSN: 1063-6692; 1558-2566
• DOI: 10.1109/TNET.2006.886298

CSMA/CA, the contention mechanism of the IEEE 802.11 DCF medium access protocol, has recently been found vulnerable to selfish backoff attacks consisting in nonstandard configuration of the constituent backoff scheme. Such attacks can greatly increase a selfish station's bandwidth share at the expense of honest stations applying a standard configuration. The paper investigates the distribution of bandwidth among anonymous network stations, some of which are selfish. A station's obtained bandwidth share is regarded as a payoff in a noncooperative CSMA/CA game. Regardless of the IEEE 802.11 parameter setting, the payoff function is found similar to a multiplayer Prisoners' Dilemma; moreover, the number (though not the identities) of selfish stations can be inferred by observation of successful transmission attempts. Further, a repeated CSMA/CA game is defined, where a station can toggle between standard and nonstandard backoff configurations with a view of maximizing a long-term utility. It is argued that a desirable station strategy should yield a fair, Pareto efficient, and subgame perfect Nash equilibrium. One such strategy, called CRISP, is described and evaluated