• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文会议>International Conference on Computer Science and Network Technology >Joint Resource Allocation Algorithm Based on Throughput Maximization in D2D Communication
【24h】

Joint Resource Allocation Algorithm Based on Throughput Maximization in D2D Communication

机译：基于D2D通信吞吐量最大化的联合资源分配算法

获取原文
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

Specific to the maximization of the system throughput, the joint resource allocation schemes for Device-toDevice (D2D) communication are proposed. Another purpose of the joint resource allocation schemes is to avoid the strong interference between cellular communication and the D2D communication. The core strategy of the algorithm is to establish a throughput matrix and find maximum throughput according to the D2D and cellular users. The results show that the proposed methods significantly improve the system throughput and the number of permitted D2D users. The performance of the proposed scheme for jointly allocation scenario is preferable to that of the proposed scheme for independently allocation scenario in some ways. The algorithm has four steps to solve problem of channel resource shortage: divided multiplexing channel selection, D2D communication access, potential channel selection and resources allocation. In order to avoid the high complexity of the exhaustive search for optimal resource allocation algorithm, we have achieved a good balance between performance and efficiency.
机译：特定于系统吞吐量的最大化，提出了用于设备 - 待办事项（D2D）通信的联合资源分配方案。联合资源分配方案的另一个目的是避免蜂窝通信与D2D通信之间的强烈干扰。算法的核心策略是建立吞吐量矩阵并根据D2D和蜂窝用户找到最大吞吐量。结果表明，该方法的方法显着提高了系统吞吐量和允许的D2D用户的数量。建议的共同分配方案的表现是在某种程度上在某种程度上进行独立分配方案的建议方案的表现。该算法有四个步骤来解决信道资源短缺问题：划分复用信道选择，D2D通信访问，潜在信道选择和资源分配。为了避免彻底搜索最佳资源分配算法的高复杂性，我们在性能和效率之间取得了良好的平衡。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号