首页> 外文会议>IEEE International Conference on Communications >A two-phase auction-based fair resource allocation for underlaying D2D communications
【24h】

A two-phase auction-based fair resource allocation for underlaying D2D communications

机译:两阶段基于拍卖的公平资源分配,可用于D2D通信

获取原文

摘要

Interference coordination while sharing cellular radio resources with Device-to-Device (D2D) pairs needs to be done in the short LTE scheduling period of 1 ms. In this paper, we propose a fast, two-phase auction based, fair and interference aware resource allocation algorithm (TAFIRA) for underlaying D2D communication. TAFIRA can be used to minimize the interference both at the evolved Node B (eNB) and the receiver of the D2D pairs while simultaneously maintaining a target system sum rate and ensuring fair allocation of cellular resources among D2D pairs. We compare TAFIRA with a MInimum Knapsack based Interference Resource Allocation algorithm (MIKIRA) and a random allocation technique. The time complexity of TAFIRA on average is O(m2n), where m and n are the number of D2D pairs and number of cellular users respectively. Our simulation results how that, TAFIRA obtains a much better system sum rate while incurring very little increased interference at the eNB and the D2D receivers when compared with MIKIRA and the random approach. TAFIRA also shows much more fairness in allocating cellular resources among the D2D pairs when compared with MIKIRA.
机译:与设备到设备(D2D)对共享蜂窝无线电资源时的干扰协调需要在1毫秒的LTE短调度周期内完成。在本文中,我们提出了一种基于两阶段拍卖的快速,公平且具有干扰意识的资源分配算法(TAFIRA),以支持D2D通信。 TAFIRA可用于最小化在演进型节点B(eNB)和D2D对的接收器处的干扰,同时保持目标系统的总速率,并确保D2D对之间蜂窝资源的公平分配。我们将TAFIRA与基于最小背包的干扰资源分配算法(MIKIRA)和随机分配技术进行了比较。 TAFIRA的时间复杂度平均为O(m2n),其中m和n分别是D2D对的数量和蜂窝用户的数量。我们的仿真结果表明,与MIKIRA和随机方法相比,TAFIRA如何获得更好的系统求和率,同时在eNB和D2D接收器上引起的干扰却很小。与MIKIRA相比,TAFIRA在D2D对之间分配蜂窝资源方面也显示出更多的公平性。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号