首页> 外文期刊>IEEE transactions on wireless communications >Resource Allocation in Highly Dynamic Device-to-Device Communication: An Adaptive Set Multi-Cover Approach
【24h】

Resource Allocation in Highly Dynamic Device-to-Device Communication: An Adaptive Set Multi-Cover Approach

机译:高动态设备到设备通信中的资源分配:一种自适应集多覆盖方法

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

摘要

Device-to-device (D2D) communication has recently gained much attention for its potential to boost the capacity of cellular systems. D2D enables direct communication between devices while bypassing a base station (BS), hence decreasing the load of BSs and increasing the network throughput via spatial reuse of radio resources. However, the cellular system is highly dynamic, an optimal allocation plan of radio resource to D2D links at one time point can easily become suboptimal when devices move. Thus, to maximize spatial reuse in cellular systems, it is crucial to update the resource allocation adaptively to reflect the current system status. In this paper, we develop the first adaptive solution framework to the dynamic resource problem for maximizing spatial reuse. At the core of the framework, we present the two algorithms for the adaptive set multicover problem with approximation ratio f and log n, respectively, where f is the frequency of the most frequent element and n is the total number of elements. The experimental results not only show that our solutions have a significant improvement in running time, compared with optimal or approximated offline methods, but also demonstrate their good performance through the resource usage, network throughput, and other metrics.
机译:设备到设备(D2D)通信最近因其潜在的提高蜂窝系统容量的能力而备受关注。 D2D使设备之间可以进行直接通信,同时绕过基站(BS),从而通过无线资源的空间复用减少了BS的负载并增加了网络吞吐量。然而,蜂窝系统是高度动态的,当设备移动时,在一个时间点对D2D链路的无线资源的最佳分配计划可能很容易成为次优。因此,为了使蜂窝系统中的空间重用最大化,至关重要的是自适应地更新资源分配以反映当前系统状态。在本文中,我们针对动态资源问题开发了第一个自适应解决方案框架,以最大程度地提高空间复用率。在框架的核心,我们提出了两种自适应集多覆盖问题的算法,分别具有近似比率f和log n,其中f是最频繁元素的频率,n是元素总数。实验结果不仅表明与最佳或近似的离线方法相比,我们的解决方案在运行时间上有显着改善,而且还通过资源使用,网络吞吐量和其他指标证明了它们的良好性能。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号