• 제목/요약/키워드: sensing-reporting optimization

검색결과 4건 처리시간 0.021초

Opportunistic Reporting-based Sensing-Reporting-Throughput Optimization Scheme for Cooperative Cognitive Radio Networks

  • So, Jaewoo
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제11권3호
    • /
    • pp.1319-1335
    • /
    • 2017
  • This paper proposes an opportunistic reporting-based sensing-reporting-throughput optimization scheme that maximizes the spectral efficiency of secondary users (SUs) in cooperative cognitive radio networks with a soft combining rule. The performance of cooperative spectrum sensing depends on the sensing time, the reporting time of transmitting sensing results, and the fusion scheme. While longer sensing time and reporting time improve the sensing performance, this shortens the allowable data transmission time, which in turn degrades the spectral efficiency of SUs. The proposed scheme adopts an opportunistic reporting scheme to restrain the reporting overhead and it jointly controls the sensing-reporting overhead in order to increase the spectral efficiency of SUs. We show that there is a trade-off between the spectral efficiency of SUs and the overheads of cooperative spectrum sensing. The numerical results demonstrate that the proposed scheme significantly outperforms the conventional sensing-throughput optimization schemes when there are many SUs. Moreover, the numerical results show that the sensing-reporting time should be jointly optimized in order to maximize the spectral efficiency of SUs.

Optimization of Cooperative Sensing in Interference-Aware Cognitive Radio Networks over Imperfect Reporting Channel

  • Kan, Changju;Wu, Qihui;Song, Fei;Ding, Guoru
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제8권4호
    • /
    • pp.1208-1222
    • /
    • 2014
  • Due to the low utilization and scarcity of frequency spectrum in current spectrum allocation methodology, cognitive radio networks (CRNs) have been proposed as a promising method to solve the problem, of which spectrum sensing is an important technology to utilize the precious spectrum resources. In order to protect the primary user from being interfered, most of the related works focus only on the restriction of the missed detection probability, which may causes over-protection of the primary user. Thus the interference probability is defined and the interference-aware sensing model is introduced in this paper. The interference-aware sensing model takes the spatial conditions into consideration, and can further improve the network performance with good spectrum reuse opportunity. Meanwhile, as so many fading factors affect the spectrum channel, errors are inevitably exist in the reporting channel in cooperative sensing, which is improper to be ignored. Motivated by the above, in this paper, we study the throughput tradeoff for interference-aware cognitive radio networks over imperfect reporting channel. For the cooperative spectrum sensing, the K-out-of-N fusion rule is used. By jointly optimizing the sensing time and the parameter K value, the maximum throughput can be achieved. Theoretical analysis is given to prove the feasibility of the optimization and computer simulations also shows that the maximum throughput can be achieved when the sensing time and the parameter of K value are both optimized.

Fast Cooperative Sensing with Low Overhead in Cognitive Radios

  • Dai, Zeyang;Liu, Jian;Li, Yunji;Long, Keping
    • KSII Transactions on Internet and Information Systems (TIIS)
    • /
    • 제8권1호
    • /
    • pp.58-73
    • /
    • 2014
  • As is well known, cooperative sensing can significantly improve the sensing accuracy as compared to local sensing in cognitive radio networks (CRNs). However, a large number of cooperative secondary users (SUs) reporting their local detection results to the fusion center (FC) would cause much overhead, such as sensing delay and energy consumption. In this paper, we propose a fast cooperative sensing scheme, called double threshold fusion (DTF), to reduce the sensing overhead while satisfying a given sensing accuracy requirement. In DTF, FC respectively compares the number of successfully received local decisions and that of failed receptions with two different thresholds to make a final decision in each reporting sub-slot during a sensing process, where cooperative SUs sequentially report their local decisions in a selective fashion to reduce the reporting overhead. By jointly considering sequential detection and selective reporting techniques in DTF, the overhead of cooperative sensing can be significantly reduced. Besides, we study the performance optimization problems with different objectives for DTF and develop three optimum fusion rules accordingly. Simulation results reveal that DTF shows evident performance gains over an existing scheme.

인지 무선 네트워크 내 분산 협력 대역 검출을 위한 문턱값 최적화 방법 (A Threshold Optimization Method for Decentralized Cooperative Spectrum Sensing in Cognitive Radio Networks)

  • 김낙균;변윤식
    • 한국통신학회논문지
    • /
    • 제40권2호
    • /
    • pp.253-263
    • /
    • 2015
  • 최근 다수의 후 순위 사용자(Secondary User)가 각각의 검출 결과를 융합 센터(Fusion Center)에 보고하여 대역 검출의 성능을 향상시키기 위한 협력 대역 검출 기법이 이루어지고 있다. 또한 선 순위 사용자(Primary User)에게 할당된 주파수 대역을 융합 센터가 공유하는 인지 무선(Cognitive Radio)기술이 개발되고 있다. 이 논문에서는 분산 협력 대역 검출 환경에서 후 순위 사용자의 검출 정보가 융합 센터로 보고되는 채널의 오류 확률을 고려한 기존 분산 협력 대역 검출 기법의 성능 저하를 보완하는 새로운 분산 협력 대역 검출 기법을 제안하였다. 또한 분산 협력 대역 검출 기법의 오류 확률을 최소화 하는 검출 문턱값의 최적화 방법을 수식의 유도를 통해 제안하였다. 최적의 검출 문턱값은 분산 협력 대역 검출의 성능을 최대화 하는 것을 확인하였다.