首页> 外文会议>IEEE Conference on Computer Communications Workshops >Joint mode selection and resource allocation for D2D communications under queueing constraints
【24h】

Joint mode selection and resource allocation for D2D communications under queueing constraints

机译:排队约束下D2D通信的联合模式选择和资源分配

获取原文

摘要

Device-to-device (D2D) communication underlaid with cellular networks is a new paradigm, proposed to enhance the performance of cellular networks. By allowing a pair of D2D users to communicate directly and share the same spectral resources with the cellular users, D2D communication can achieve higher spectral efficiency, improve the energy efficiency, and lower the traffic delay. In this paper, we propose a novel channel matching algorithm for joint mode selection and channel allocation with the goal of maximizing the system throughput under statistical queueing constraints. Seven possible modes are considered, namely the D2D cellular mode, D2D dedicated mode, uplink dedicated mode, downlink dedicated mode, uplink reuse mode, downlink reuse mode, and D2D reuse mode. Using tools from stochastic network calculus, the throughput is characterized by determining the effective capacity. We formulate the channel allocation problem as a maximum-weight matching problem, which can be solved by employing the Hungarian algorithm. Via simulation results, we verify the performance improvements achieved by our proposed matching algorithm.
机译:蜂窝网络底层的设备到设备(D2D)通信是一种新的范例,旨在提高蜂窝网络的性能。通过允许一对D2D用户直接通信并与蜂窝用户共享相同的频谱资源,D2D通信可以实现更高的频谱效率,提高能量效率并降低流量延迟。在本文中,我们提出了一种用于联合模式选择和信道分配的新颖信道匹配算法,其目的是在统计排队约束下最大化系统吞吐量。考虑了七个可能的模式,即D2D蜂窝模式,D2D专用模式,上行链路专用模式,下行链路专用模式,上行链路重用模式,下行链路重用模式和D2D重用模式。使用来自随机网络演算的工具,通过确定有效容量来表征吞吐量。我们将信道分配问题表述为最大权重匹配问题,可以通过采用匈牙利算法来解决。通过仿真结果,我们验证了我们提出的匹配算法所实现的性能改进。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号