摘要
In this paper, we analyze performance of cooperative spectrum sensing under counting rules when exponential model is utilized to characterize the burst nature of primary user （PU） link. Our objective is to minimize the average error probability （AEP） so that the link utilization in the considered link achieves its maximum. We derive a closed-form expression of AEP as well as the probability of interference （PoI） by classifying cognitive transmission into six events. Then, we consider the minimization of AEP over counting rules under the constraint of interference. As the solution, we develop an efficient algorithm to evaluate the optimal fusion rule. Finally, we verify our analysis in numerical results.
In this paper, we analyze performance of cooperative spectrum sensing under counting rules when exponential model is utilized to characterize the burst nature of primary user （PU） link. Our objective is to minimize the average error probability （AEP） so that the link utilization in the considered link achieves its maximum. We derive a closed-form expression of AEP as well as the probability of interference （PoI） by classifying cognitive transmission into six events. Then, we consider the minimization of AEP over counting rules under the constraint of interference. As the solution, we develop an efficient algorithm to evaluate the optimal fusion rule. Finally, we verify our analysis in numerical results.
基金
supported by the Research Fund for the Doctoral Program of Higher Education(20092125110006)
the Open Research Fund of National Mobile Communications Research Laboratory, Southeast University(2011D01)
the Guangdong Provincial Natural Science Foundation of China(10451802904006030)
the Fundamental Research Funds for the Central Universities of China
