首页> 外文期刊>IEEE Journal on Selected Areas in Communications >Risk-Aware Cooperative Spectrum Access for Multi-Channel Cognitive Radio Networks
【24h】

Risk-Aware Cooperative Spectrum Access for Multi-Channel Cognitive Radio Networks

机译:多通道认知无线电网络的风险感知协作频谱访问

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

摘要

In this paper, risk-aware cooperative spectrum access schemes for cognitive radio networks (CRNs) with multiple channels are proposed, whereby multiple primary users (PUs) operating over different channels choose trustworthy secondary users (SUs) as relays to improve throughput, and in return SUs gain transmission opportunities. To study the multi-channel cooperative spectrum access, cooperation over single channel is investigated first, which involves a PU selecting the suitable SU and granting a period of access time to the selected SU as a reward, considering trustworthiness of SUs. The above procedure is modeled as a Stackelberg game, through which access time allocation and power allocation are obtained. Based on the above results, cooperation over multiple channels is studied from the perspectives of the primary network and secondary network, respectively. Two schemes are proposed accordingly: the primary network-centric matching (PCM) scheme and the secondary network-centric cluster-based (SCC) scheme. In PCM scheme, cooperating SU for each channel is determined to maximize the total utility of the primary network, which is formulated as a maximum weight matching problem. In SCC scheme, SUs first form a cluster to share the channel state information (CSI), and the best SUs are selected for cooperation with PUs over different channels to obtain the maximum aggregate access time for the secondary network. Then, SUs share the obtained resource using congestion game and quadrature signalling. Numerical results demonstrate that, with the proposed schemes, PUs can achieve higher throughput, while SUs can obtain longer average access time, compared with the random channel access approach.
机译:在本文中,提出了用于具有多个信道的认知无线电网络(CRN)的具有风险意识的合作频谱访问方案,其中,在不同信道上运行的多个主要用户(PU)选择可信赖的辅助用户(SU)作为中继,以提高吞吐量,并且返回SU获得传输机会。为了研究多信道协作频谱接入,首先研究在单信道上的协作,这包括考虑到SU的可信度,PU选择合适的SU并给予所选SU一定的接入时间作为奖励。以上过程被建模为Stackelberg游戏,通过该游戏可以获得访问时间分配和功率分配。基于以上结果,分别从主网络和辅助网络的角度研究了多渠道合作。相应地提出了两种方案:主要的以网络为中心的匹配(PCM)方案和次要的基于网络的基于簇的匹配(SCC)方案。在PCM方案中,确定每个通道的协作SU以使主网络的总效用最大化,这被表述为最大权重匹配问题。在SCC方案中,SU首先形成一个集群以共享信道状态信息(CSI),然后选择最佳的SU与不同信道上的PU协作以获得辅助网络的最大聚合访问时间。然后,SU使用拥塞博弈和正交信令共享获得的资源。数值结果表明,与随机信道访问方法相比,通过所提出的方案,PU可以实现更高的吞吐量,而SU可以获得更长的平均访问时间。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号