...
首页> 外文期刊>IEEE transactions on mobile computing >Interference Management in D2D-Enabled Heterogeneous Cellular Networks Using Matching Theory
【24h】

Interference Management in D2D-Enabled Heterogeneous Cellular Networks Using Matching Theory

机译:使用匹配理论的启用D2D的异构蜂窝网络中的干扰管理

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

获取外文期刊封面封底 >>

       

摘要

To support the increasing data traffic demand in wireless communications networks, a multi-tier architecture that consists of multiple small cells is adopted in traditional (macro) cellular networks. Nevertheless, due to the expansion of various wireless devices and services, there is still a need to increase the network capacity in new generation networks such as 5G. Hence, the integration of Device-to-Device (D2D) communication as a promising technology with heterogeneous networks has been proposed. This integration not only increases network capacity but also improves spectral efficiency and alleviates the traffic load of base stations. However, the co/cross-tier interferences between D2D and cellular communications caused by resource sharing is a significant challenge. In this paper, we propose a distributed resource allocation algorithm based on matching theory to minimize these interferences and optimize the network performance. It is shown in this paper that the proposed algorithm converges to a stable matching and terminates after finite iterations. Simulation results show that the proposed algorithm is able to achieve more than 90 percent of the optimum network performance with much lower overhead and complexity.
机译:为了支持无线通信网络中不断增长的数据流量需求,在传统(宏)蜂窝网络中采用了由多个小蜂窝组成的多层体系结构。尽管如此,由于各种无线设备和服务的扩展,仍然需要增加诸如5G之类的新一代网络的网络容量。因此,已经提出了将设备对设备(D2D)通信与异构网络集成为有希望的技术。这种集成不仅增加了网络容量,而且还提高了频谱效率并减轻了基站的业务量。然而,由资源共享引起的D2D和蜂窝通信之间的co /跨层干扰是一个重大挑战。在本文中,我们提出了一种基于匹配理论的分布式资源分配算法,以最小化这些干扰并优化网络性能。本文表明,所提出的算法收敛到稳定的匹配,并在有限迭代后终止。仿真结果表明,该算法能够以较低的开销和复杂度实现超过90%的最佳网络性能。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号