Game-Theoretic Analysis of Selfish Secondary Users in Cognitive Radio Networks

  • Received : 2015.03.18
  • Published : 2015.08.31

Abstract

In this paper, we study the problem of selfish behavior of secondary users (SUs) based on cognitive radio (CR) with the presence of primary users (PUs). SUs are assumed to contend on a channel using the carrier sense multiple access with collision avoidance (CSMA/CA) and PUs do not consider transmission of SUs, where CSMA/CA protocols rely on the random deference of packets. SUs are vulnerable to selfish attacks by which selfish users could pick short random deference to obtain a larger share of the available bandwidth at the expense of other SUs. In this paper, game theory is used to study the systematic cheating of SUs in the presence of PUs in multichannel CR networks. We study two cases: A single cheater and multiple cheaters acting without any restraint. We identify the Pareto-optimal point of operation of a network with multiple cheaters and also derive the Nash equilibrium of the network. We use cooperative game theory to drive the Pareto optimality of selfish SUs without interfering with the activity of PUs. We show the influence of the activity of PUs in the equilibrium of the whole network.

Keywords

Acknowledgement

Supported by : Institute for Information and Communication Technology Promotion (IITP)

References

  1. Federal Communications Commission: FCC, ET Docket No 03-222 "Notice of proposed rule making and order," Tech. Rep., Dec. 2003.
  2. S. Haykin, "Cognitive radio: Brain-empowered wireless communications," IEEE J. Sel. Areas Commun., vol. 23, no. 2, pp. 201-220, Feb. 2005. https://doi.org/10.1109/JSAC.2004.839380
  3. G. Bianchi, "Performance analysis of the IEEE 802.11 distributed coordination function," IEEE J. Sel. Areas Commun., vol. 18, no. 3, Mar. 2000.
  4. J. Konorski, "CSMA/CA performance under backoff attacks: A gametheoretic context," in Proc. MMB, 2004.
  5. J.W. Chong, Y. Sung, and D. K. Sung, "Multiband CSMA/CA-based cognitive radio networks," J. Commun. Netw., vol. 11, no. 2, pp. 174-185, 2009.
  6. M. Cagalj et al., "On selfish behavior in CSMA/CA networks," in Proc. IEEE INFOCOM, 2005.
  7. L. Guang, C. Assi, and A. Benslimane "Modeling and analysis of predictable random backoff in selfish environments," in Proc. ACM MSWiM, Oct. 2006.
  8. Y. Xiao, X. Shan, and Y. Ren "Game theory models for IEEE 802.11 DCF in wireless ad hoc networks," IEEE Commun. Mag., 2005.
  9. D. Fudenberg and J. Tirole, Game Theory. The MIT Press, 1991.
  10. 802.11: Wireless LAN Medium Access Control (MAC) and Physical Layer (PHY) Specifications, IEEE Standard, 1999
  11. V. V. Vazirani, "The notion of a rational convex program, and an algorithm for the arrow-debreu Nash bargaining game," J. ACM, vol. 59(2), 2012
  12. S. Boyd and L. Vandenberghe, Convex Optimization. Cambridge Unvesity Press, 2004.
  13. M. Felegyhazi, M. Cagalj, and J. P. Hubaux, "Efficient MAC in cognitive radio systems: A game-theoretic approach," IEEE Trans. Wireles Commun., 2009.