首页> 外文期刊>Wireless Communications, IEEE Transactions on >Maximizing Network Capacity of Cognitive Radio Networks by Capacity-Aware Spectrum Allocation
【24h】

Maximizing Network Capacity of Cognitive Radio Networks by Capacity-Aware Spectrum Allocation

机译:通过容量感知频谱分配最大化认知无线电网络的网络容量

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

摘要

In this paper, we present a novel capacity-aware spectrum allocation model for cognitive radio networks. First, we model interference constraints based on the interference temperature model, and let the secondary users (SUs) increase their transmission power until the interference temperature on one of their neighbors exceeds its interference temperature threshold. Then, knowing the SINR and bandwidth of potential links, we calculate the link capacity based on the Shannon formula, and model the co-channel interference between potential links on each channel by using an interference graph. Next, we formulate the spectrum assignment problem in the form of a binary integer linear programming (BILP) to find the optimal feasible set of simultaneously active links among all the potential links in the sense of maximizing the overall network capacity. We also propose a new radix tree based algorithm that, by removing the sparse areas in the search space, leads to a considerable decrease in time complexity of solving the spectrum allocation problem as compared to the BILP algorithm. The simulation results have shown that this proposed model leads to a considerable improvement in overall network capacity as compared to genetic algorithm, and leads to a considerable decrease in time duration needed to find the optimal solution as compared to the BILP algorithm.
机译:在本文中,我们提出了一种用于认知无线电网络的新颖的容量感知频谱分配模型。首先,我们基于干扰温度模型对干扰约束进行建模,然后让次用户(SU)增加其传输功率,直到其邻居之一的干扰温度超过其干扰温度阈值为止。然后,了解潜在链路的SINR和带宽,我们基于Shannon公式计算链路容量,并使用干扰图对每个信道上潜在链路之间的同信道干扰进行建模。接下来,我们以二进制整数线性规划(BILP)的形式制定频谱分配问题,以在使整个网络容量最大化的意义上,找到所有潜在链路之间同时活动链路的最佳可行集。我们还提出了一种新的基于基数树的算法,与BILP算法相比,该算法通过消除搜索空间中的稀疏区域,可大大减少解决频谱分配问题的时间复杂度。仿真结果表明,与遗传算法相比,该模型可显着提高整体网络容量,与BILP算法相比,可显着减少寻找最佳解决方案所需的时间。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号