首页> 外文会议>ICC;IEEE International Conference on Communications >Capacity maximization in cooperative CRNs: Joint relay assignment and channel allocation
【24h】

Capacity maximization in cooperative CRNs: Joint relay assignment and channel allocation

机译:协作CRN中的容量最大化:联合中继分配和信道分配

获取原文

摘要

Cooperative communication (CC) can offer high channel capacity and reliability in an efficient and low-cost way by forming a virtual antenna array among single-antenna nodes that cooperatively share their antennas. It has been well recognized that the selection of relay nodes plays a critical role in the performance of multiple source-destination pairs. Unfortunately, all prior work has made an unrealistic assumption that each source-destination pair communicates over a dedicated channel with no mutual interference. In this paper, we study the problem of capacity maximization using cooperative communication in a cognitive radio network by jointly considering the relay assignment and channel allocation under a finite set of available channels, where the interference must be considered. It is proved to be NP-hard and a heuristic algorithm is proposed. Moreover, we exploit the network coding opportunities existing in CC that can further increase the capacity. Extensive simulations are conducted to show that the proposed algorithms can achieve high total capacity under various network settings.
机译:通过在协作共享天线的单天线节点之间形成虚拟天线阵列,协作通信(CC)可以以高效且低成本的方式提供高信道容量和可靠性。众所周知,中继节点的选择在多个源-目的地对的性能中起着至关重要的作用。不幸的是,所有先前的工作都做出了不切实际的假设,即每个源-目的地对在专用信道上进行通信而没有相互干扰。在本文中,我们通过在有限的可用信道集(其中必须考虑干扰)下共同考虑中继分配和信道分配,研究认知无线电网络中使用协作通信的容量最大化问题。证明是NP难的,并提出了启发式算法。此外,我们利用CC中存在的网络编码机会,可以进一步增加容量。进行了广泛的仿真,表明所提出的算法在各种网络设置下都可以实现较高的总容量。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号