Evolution of Cooperation: A Case with Interference-Aware Cooperative Spectrum Sensing in Cognitive Radio Networks

  • You-En Lin
  • Hung-Yun Hsieh
Part of the Lecture Notes of the Institute for Computer Sciences, Social Informatics and Telecommunications Engineering book series (LNICST, volume 75)


We consider in this work a group of secondary users with backlogged traffic to transmit in the primary network. To avoid interfering with the primary user, each secondary user must perform interference-aware spectrum sensing before transmission. Unlike conventional sensing techniques, interference-aware spectrum sensing allows a secondary user to adjust its sensing parameters for optimal performance depending on the probability of interfering with the primary user. While interference-aware sensing can achieve better performance for individual users, challenges arise when secondary users collaborate with each other for cooperative spectrum sensing due to their unequal interference probabilities that result in a conflict for setting the optimal sensing parameters. To model this problem, we consider an interference-aware cooperative sensing game and analyze player behaviors under such a game. We find that there is a unique pure Nash equilibrium of the game, but it tends to deviate from the desirable solution of social optimum. We then design a repeated game based on evolutionary game theory to address this problem. Players in the repeated game have the chance to revenge “uncooperative” players in ensuing repetitions for driving the equilibrium to the social optimum. We show through numerical results that the proposed game of evolution does achieve the desirable performance for interference-aware cooperative sensing in dynamic spectrum access.


Nash Equilibrium False Alarm Detection Threshold Primary User Secondary User 
These keywords were added by machine and not by the authors. This process is experimental and the keywords may be updated as the learning algorithm improves.


Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.


  1. 1.
    Bellman, R.: The theory of dynamic programming. Bulletin of the American Mathematical Society 60, 503–516 (1954)MathSciNetCrossRefzbMATHGoogle Scholar
  2. 2.
    Chow, C.S., Tsitsiklis, J.: An optimal multigrid algorithm for continuous state discrete time stochastic control. In: Proceedings of the 27th IEEE Conference on Decision and Control, vol. 3, pp. 1908–1912 (December 1988)Google Scholar
  3. 3.
    Cornuejols, G.: Valid inequalities for mixed integer linear programs. Mathematical Programming 112(1), 3–44 (2008)MathSciNetCrossRefzbMATHGoogle Scholar
  4. 4.
    Datla, D., Wyglinski, A., Minden, G.: A spectrum surveying framework for dynamic spectrum access networks. IEEE Transactions on Vehicular Technology 58(8), 4158–4168 (2009)CrossRefGoogle Scholar
  5. 5.
    Digham, F.F., Alouini, M.S., Simon, M.K.: On the energy detection of unknown signals over fading channels. IEEE Transactions on Communications 55(1), 21–24 (2007)CrossRefGoogle Scholar
  6. 6.
    Ganesan, G., Li, Y.: Cooperative spectrum sensing in cognitive radio networks. In: Proceeding of IEEE DySPAN, Baltimore, MD, USA, pp. 137–143 (November 2005)Google Scholar
  7. 7.
    Gardner, W.: Signal interception: A unifying theoretical framework for feature detection. IEEE Transactions on Communications 36(8), 897–906 (1988)CrossRefGoogle Scholar
  8. 8.
    Ghasemi, A., Sousa, E.: Collaborative spectrum sensing for opportunistic access in fading environments. In: IEEE International Symposium on New Frontiers in Dynamic Spectrum Access Networks, pp. 131–136 (November 2005)Google Scholar
  9. 9.
    Huang, S., Liu, X., Ding, Z.: Optimal transmission strategies for dynamic spectrum access in cognitive radio networks. IEEE Transactions on Mobile Computing 8(12), 1636–1648 (2009)CrossRefGoogle Scholar
  10. 10.
    Kay, S.M.: Fundamentals of Statistical Signal Processing: Detection Theory. Prentice Hall (February 1998)Google Scholar
  11. 11.
    Liang, Y.C., Zeng, Y., Peh, E., Hoang, A.T.: Sensing-throughput tradeoff for cognitive radio networks. IEEE Transactions on Wireless Communications 7(4), 1326–1337 (2008)CrossRefGoogle Scholar
  12. 12.
    Moghimi, F., Nasri, A., Schober, R.: LP-norm spectrum sensing for cognitive radio networks impaired by non-Gaussian noise. In: Proceedings of IEEE Global Telecommunications Conference (GLOBECOM), pp. 1–6 (November 2009)Google Scholar
  13. 13.
    Peh, E., Liang, Y.C., Guan, Y.L., Zeng, Y.: Optimization of cooperative sensing in cognitive radio networks: A sensing-throughput tradeoff view. IEEE Transactions on Vehicular Technology 58(9), 5294–5299 (2009)CrossRefGoogle Scholar
  14. 14.
    Sahai, A., Tandra, R., Mishra, S.M., Hoven, N.: Fundamental design tradeoffs in cognitive radio systems. In: Proceedings of the First International Workshop on Technology and Policy for Accessing Spectrum (TAPAS), New York, NY, USA (2006)Google Scholar
  15. 15.
    Tuy, H.: Monotonic optimization: Problems and solution approaches. SIAM Journal on Optimization 11(2), 464–494 (2000)MathSciNetCrossRefzbMATHGoogle Scholar
  16. 16.
    Weibull, J.W.: Evolutionary Game Theory. MIT Press (1995)Google Scholar
  17. 17.
    Yucek, T., Arslan, H.: A survey of spectrum sensing algorithms for cognitive radio applications. IEEE Communications Surveys and Tutorials 11(1), 116–130 (2009)CrossRefGoogle Scholar
  18. 18.
    Zhang, T., Wu, Y., Lang, K., Tsang, D.: Optimal scheduling of cooperative spectrum sensing in cognitive radio networks. IEEE Systems Journal 4(4), 535–549 (2010)CrossRefGoogle Scholar

Copyright information

© ICST Institute for Computer Science, Social Informatics and Telecommunications Engineering 2012

Authors and Affiliations

  • You-En Lin
    • 1
  • Hung-Yun Hsieh
    • 1
    • 2
  1. 1.Graduate Institute of Communication EngineeringNational Taiwan UniversityTaipeiTaiwan
  2. 2.Department of Electrical EngineeringNational Taiwan UniversityTaipeiTaiwan

Personalised recommendations