On selfish behavior in CSMA/CA networks

CSMA/CA protocols rely on the random deferment of packet transmissions. Like most other protocols, CSMA/CA was designed with the assumption that the nodes would play by the rules. This can be dangerous, since the nodes themselves control their random deferment. Indeed, with the higher programmability of the network adapters, the temptation to tamper with the software or firmware is likely to grow; by doing so, a user could obtain a much larger share of the available bandwidth at the expense of other users. We use a game-theoretic approach to investigate the problem of the selfish behavior of nodes in CSMA/CA networks, specifically geared towards the most widely accepted protocol in this class of protocols, IEEE 802.11. We characterize two families of Nash equilibria in a single stage game, one of which always results in a network collapse. We argue that this result provides an incentive for cheaters to cooperate with each other. Explicit cooperation among nodes is clearly impractical. By applying the model of dynamic games borrowed from game theory, we derive the conditions for the stable and optimal functioning of a population of cheaters. We use this insight to develop a simple, localized and distributed protocol that successfully guides multiple selfish nodes to a Pareto-optimal Nash equilibrium.

[1]  Voon Chin Phua,et al.  Wireless lan medium access control (mac) and physical layer (phy) specifications , 1999 .

[2]  Jerzy Konorski,et al.  Multiple Access in Ad-Hoc Wireless LANs with Noncooperative Stations , 2002, NETWORKING.

[3]  T. Başar,et al.  Dynamic Noncooperative Game Theory , 1982 .

[4]  Ariel Orda,et al.  Competitive routing in multiuser communication networks , 1993, TNET.

[5]  Ariel Orda,et al.  Architecting noncooperative networks , 1995, Eighteenth Convention of Electrical and Electronics Engineers in Israel.

[6]  Eitan Altman,et al.  CDMA Uplink Power Control as a Noncooperative Game , 2002, Wirel. Networks.

[7]  Cem U. Saraydar,et al.  Efficient power control via pricing in wireless data networks , 2002, IEEE Trans. Commun..

[8]  George Kesidis,et al.  Equilibria of a noncooperative game for heterogeneous users of an ALOHA network , 2002, IEEE Communications Letters.

[9]  Nitin H. Vaidya,et al.  Detection and handling of MAC layer misbehavior in wireless networks , 2003, 2003 International Conference on Dependable Systems and Networks, 2003. Proceedings..

[10]  Stephen P. Boyd,et al.  Convex Optimization , 2004, Algorithms and Theory of Computation Handbook.

[11]  Philip M. Morse,et al.  Introduction to the Theory of Games , 1952 .

[12]  Catherine Rosenberg,et al.  A game theoretic framework for bandwidth allocation and pricing in broadband networks , 2000, TNET.

[13]  Rita H. Wouhaybi,et al.  Incentive engineering in wireless LAN based access networks , 2002, 10th IEEE International Conference on Network Protocols, 2002. Proceedings..

[14]  A. Girotra,et al.  Performance Analysis of the IEEE 802 . 11 Distributed Coordination Function , 2005 .

[15]  Ariel Orda,et al.  Competitive routing in multi-user communication networks , 1993, IEEE INFOCOM '93 The Conference on Computer Communications, Proceedings.

[16]  Richard J. La,et al.  Optimal routing control: repeated game approach , 2002, IEEE Trans. Autom. Control..

[17]  Stephen B. Wicker,et al.  Stability of multipacket slotted Aloha with selfish users and perfect information , 2003, IEEE INFOCOM 2003. Twenty-second Annual Joint Conference of the IEEE Computer and Communications Societies (IEEE Cat. No.03CH37428).

[18]  Marco Conti,et al.  Dynamic tuning of the IEEE 802.11 protocol to achieve a theoretical throughput limit , 2000, TNET.

[19]  John N. Tsitsiklis,et al.  Parallel and distributed computation , 1989 .

[20]  A. M. Abdullah,et al.  Wireless lan medium access control (mac) and physical layer (phy) specifications , 1997 .

[21]  Saurabh Ganeriwal,et al.  On Cheating in CSMA/CA Ad Hoc Networks , 2004 .

[22]  Maxim Raya,et al.  DOMINO: a system to detect greedy behavior in IEEE 802.11 hotspots , 2004, MobiSys '04.

[23]  Hari Balakrishnan,et al.  An analysis of short-term fairness in wireless media access protocols (poster session) , 2000, SIGMETRICS '00.

[24]  Rachid El Azouzi,et al.  Slotted Aloha as a Stochastic Game with Partial Information , 2003 .