Sensing-throughput tradeoff in cooperative spectrum sensing

Mohsen Nader Tehrani, Murat Uysal

Research output: Chapter in Book/Report/Conference proceedingConference contribution


In the current literature on cognitive radio, it is commonly assumed that fixed time durations are assigned for spectrum sensing and data transmission. It is however possible to improve the performance by finding the best tradeoff between sensing time and network throughput. In this paper, we formulate the sensing-throughput problem to dynamically assign a number of SUs for cooperatively sensing each channel and calculate the optimal sensing time such as to maximize the total average throughput of SUs in the presence of interference with PUs. We propose a two-step optimization algorithm to optimize sensing time and the number of assigned SUs to each channel. Simulation results demonstrate that significant improvement in the throughput of SUs is achieved when the sensing time and the number of assigned SUs is jointly optimized.

Original languageEnglish (US)
Title of host publication2012 IEEE Globecom Workshops, GC Wkshps 2012
Number of pages6
StatePublished - 2012
Event2012 IEEE Globecom Workshops, GC Wkshps 2012 - Anaheim, CA, United States
Duration: Dec 3 2012Dec 7 2012

Publication series

Name2012 IEEE Globecom Workshops, GC Wkshps 2012


Conference2012 IEEE Globecom Workshops, GC Wkshps 2012
Country/TerritoryUnited States
CityAnaheim, CA


  • Cognitive radio networks
  • Cooperative spectrum sensing
  • Knapsack problem
  • Sensing-throughput tradeoff

ASJC Scopus subject areas

  • Computer Networks and Communications


Dive into the research topics of 'Sensing-throughput tradeoff in cooperative spectrum sensing'. Together they form a unique fingerprint.

Cite this