科研之友
微信
新浪微博
Facebook
分享链接
摘要
Cognitive Radio (CR) is a promising technology that overcomes the problem of spectrum scarcity and underutilization in an efficient manner. Spectrum sensing is one of the most important functionalities of a Cognitive Radio Network (CRN). Cooperative sensing where multiple sensors cooperatively sense the spectrum proves to be the most efficient way of sensing. However, one of the main challenges in a CRN is how to appropriately schedule the Secondary Users (SU) to sense the potential Primary User (PU) channels cooperatively so that the throughput obtained in the network is optimum. At the same time, in order to protect the quality of service of the PU channels, a minimum sensing performance criteria in terms of probability of detection and false alarm must be satisfied. It can be referred to as Cooperative Sensing Scheduling (CSS) problem. The problem is formulated as a non-linear binary optimization problem that has a high computational complexity. In this paper, the CSS problem is reformulated as an equivalent Integer Linear Programming (ILP) problem which is known to be NP-Complete. A distributed algorithm using coalitional game theoretic approach is proposed that provides near optimal solutions. Numerical results are provided to evaluate the performance of the proposed algorithm and compared with the theoretically optimal results.
- 出版日期2017-9-15
