Abstract
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.
This is a preview of subscription content, log in via an institution to check access.
Access this chapter
Tax calculation will be finalised at checkout
Purchases are for personal use only
Preview
Unable to display preview. Download preview PDF.
References
Altman, E., El Azouzi, R., Jimenez, T.: Slotted Aloha as a Game with Partial Information. Computer Networks 45, 701–713 (2004)
Altman, E., Kumar, A., Kumar, D., Venkatesh, R.: Cooperative and Non-Cooperative Control in IEEE 802.11 WLANs. INRIA Tech. Rep.5541 (2005)
Basar, T., Olsder, G.J.: Dynamic Noncooperative Game Theory. Academic Press, London (1982)
Cagalj, M., Ganeriwal, S., Aad, I., Hubaux, J.-P.: On Selfish Behavior in CSMA/CA Networks. In: Proceedings of IEEE Infocom 2005 (2005)
Chlamtac, I., Ganz, A.: Evaluation of the Random Token Protocol for High-Speed and Radio Networks. IEEE J. Select. Areas Commun. SAC-5, 969–976 (1987)
Challet, D., Zhang, Y.-C.: Emergence of Cooperation and Organization in an Evolutionary Game. Physica A 246, 407 (1997)
ETSI TC Radio Equipment and Systems: High Performance Radio Local Area Network (HIPERLAN); Services and Facilities; Version 1.1, RES 10 (1995)
Feller, W.: An Introduction to Probability Theory and its Applications. J. Wiley, Chichester (1966)
Friedman, E.J., Shenker, S.: Synchronous and Asynchronous Learning by Responsive Learning Automata. Mimeo (1996)
Fudenberg, D., Tirole, J.: Game Theory. MIT Press, Cambridge (1991)
Fudenberg, D., Levine, D.K.: The Theory of Learning in Games. MIT Press, Cambridge (1998)
IEEE Standard for Information Technology − Wireless LAN Medium Access Control (MAC) and Physical Layer (PHY) Specifications, ISO/IEC 8802-11 (1999)
Konorski, J.: Playing CSMA/CA Game to Deter Backoff Attacks in Ad Hoc Wireless LANs. In: Proceedings of AdHocNow 2005. Lecture Notes in Computer Science, vol. 1281, pp. 127–140. Springer, Berlin Heidelberg New York (2005)
MacKenzie, A.B., Wicker, S.B.: Selfish Users in ALOHA: A Game-Theoretic Approach. In: Proceedings of VTC (Fall 2001)
Yao, X.: Evolutionary Stability in the n-Person Iterated Prisoners’ Dilemma. BioSystems 39, 189–197 (1996)
Author information
Authors and Affiliations
Editor information
Editors and Affiliations
Rights and permissions
Copyright information
© 2006 Springer-Verlag Berlin Heidelberg
About this paper
Cite this paper
Konorski, J. (2006). An Idea Bag Strategy to Discourage Selfish Behavior Under Random Token MAC Protocols for Wireless LANs. In: Chaudhuri, S., Das, S.R., Paul, H.S., Tirthapura, S. (eds) Distributed Computing and Networking. ICDCN 2006. Lecture Notes in Computer Science, vol 4308. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11947950_63
Download citation
DOI: https://doi.org/10.1007/11947950_63
Publisher Name: Springer, Berlin, Heidelberg
Print ISBN: 978-3-540-68139-7
Online ISBN: 978-3-540-68140-3
eBook Packages: Computer ScienceComputer Science (R0)