...
首页> 外文期刊>Wireless personal communications: An Internaional Journal >Globally Optimal Cooperation in Dense Cognitive Radio Networks
【24h】

Globally Optimal Cooperation in Dense Cognitive Radio Networks

机译:密集认知无线电网络中的全球最佳合作

获取原文
获取原文并翻译 | 示例
           

摘要

In cooperative spectrum sensing, local sensing at different sensing nodes is done either using soft decisions or hard decisions. The hard decision-based sensing has the advantage of using only one bit to report the local decision. In the literature, the hard decisions are combined at the fusion center using AND, OR, or MAJORITY rules. Although the problem of finding the "optimal'' fusion rule was addressed and solved for the soft decisions fusion, it was not solved in the hard-decisions sensing. The problem of calculating the local and global decision thresholds in hard decisions-based cooperative spectrum sensing is known for its mathematical intractability. Hence, previous studies relied on simple suboptimal counting rules for decision fusion in order to avoid the exhaustive numerical search required for obtaining the optimal thresholds. These simple rules are not globally optimal as they do not maximize the overall global detection probability by jointly selecting local and global thresholds. Instead, they try to maximize the detection probability for a specific global threshold. In this paper, a globally optimal decision fusion rule for Primary User signal detection based on the Neyman-Pearson (NP) criterion is derived. The algorithm is based on a novel representation for the global performance metrics in terms of the regularized incomplete beta function. Based on this mathematical representation, it is shown that the globally optimal NP hard decision fusion test can be put in the form of a conventional one dimensional convex optimization problem. A binary search for the global threshold can be applied yielding a complexity of O(log2(N)), where N represents the number of cooperating users. The logarithmic complexity is appreciated because we are concerned with dense networks, and thus N is expected to be large. The proposed optimal scheme outperforms conventional counting rules, such as the OR, AND, and MAJORITY rules. It is shown via simulations that, although the optimal rule tends to the simple OR rule when the number of cooperating secondary users is small, it offers significant SNR gain in dense cognitive radio networks with large number of cooperating users.
机译:在协作频谱感测中,使用软判决或硬判决来完成不同感测节点处的局部感测。基于硬决策的检测的优势是仅使用一位来报告本地决策。在文献中,使用AND,OR或MAJORITY规则在融合中心组合了艰难的决策。尽管为软决策融合解决并找到了“最佳”融合规则的问题,但在硬决策感知中并没有解决,在基于硬决策的合作频谱中计算局部和全局决策阈值的问题感知以其数学难解性而著称,因此,先前的研究依靠简单的次优计数规则进行决策融合,以避免获得最佳阈值所需的详尽的数值搜索,这些简单规则并非全局最优,因为它们无法使总体最大化通过联合选择局部阈值和全局阈值来实现全局检测概率,而是尝试最大化特定全局阈值的检测概率。本文提出一种基于Neyman-Pearson(NP)的主要用户信号检测全局最优决策融合规则推导标准,该算法基于一种新颖的表示形式,用于表示全球绩效指标正则化的不完全Beta函数。基于该数学表示,表明可以以常规的一维凸优化问题的形式提出全局最优NP硬决策融合测试。可以应用对全局阈值的二进制搜索,从而产生O(log2(N))的复杂度,其中N表示合作用户的数量。由于我们关注稠密的网络,因此对数复杂度受到赞赏,因此N预计会很大。所提出的最佳方案优于常规计数规则,例如OR,AND和MAJORITY规则。通过仿真表明,尽管当合作的次级用户数量较少时,最佳规则趋向于简单的OR规则,但在具有大量合作用户的密集认知无线电网络中,该规则可提供显着的SNR增益。

著录项

相似文献

  • 外文文献
  • 中文文献
  • 专利
获取原文

客服邮箱:kefu@zhangqiaokeyan.com

京公网安备:11010802029741号 ICP备案号:京ICP备15016152号-6 六维联合信息科技 (北京) 有限公司©版权所有
  • 客服微信

  • 服务号