...
首页> 外文期刊>Journal of network and computer applications >Two-stage coalition formation and radio resource allocation with Nash bargaining solution for inband underlaid D2D communications in 5G networks
【24h】

Two-stage coalition formation and radio resource allocation with Nash bargaining solution for inband underlaid D2D communications in 5G networks

机译:用于5G网络中带内嵌入式D2D通信的两阶段联盟形成和采用Nash讨价还价解决方案的无线电资源分配

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

摘要

For D2D communications in the inband underlaid 5G networks, to improve the utilization of cellular uplink spectrum, a two-stage coalition formation and resource allocation scheme is proposed to allocate the radio resources based on the numbers of resource blocks (RBs) requested by D2D pairs. Any set of D2D pairs whose pairwise distances longer than a threshold value are organized into a Stage-1 coalition by the Bron-Kerbosch algorithm. Otherwise, they are organized into Stage-2 coalitions based on the total number of RBs they requested. Since D2D pairs in a Stage-1 coalition are far away from each other, the co-channel interference can be ignored. To Improve the RB utilization, RBs that can be used by D2D pairs in the same Stage-1 coalition are first allocated to that Stage-1 coalition. Then, based on the total number of RBs requested by D2D pairs in a Stage-2 coalition, RBs are allocated to Stage-2 coalitions. Since RBs allocated to a Stage-2 coalition cannot be shared by D2D pairs in that Stage-2 coalition, the Nash bargaining solution (NBS) is used to further allocate RBs to D2D pairs in that Stage-2 coalition. Simulation results show that, the proposed two-stage coalition formation and resource allocation scheme allocates more number of equivalent RBs to D2D pairs than the number of RBs allocated by the greedy algorithm. Specifically, based on the simulation results, the total number of equivalent RBs allocated by the proposed scheme can be up to 325.52% of that allocated by the greedy algorithm.
机译:对于带内嵌入式5G网络中的D2D通信,为了提高蜂窝上行链路频谱的利用率,提出了一种两级联盟形成和资源分配方案,以根据D2D对请求的资源块(RB)的数量分配无线电资源。 。 Bron-Kerbosch算法将成对距离长于阈值的任何D2D对集合组织为Stage-1联盟。否则,将根据其请求的RB总数将其组织为第二阶段联盟。由于第1阶段联盟中的D2D对彼此远离,因此可以忽略同信道干扰。为了提高RB利用率,首先将同一Stage-1联盟中D2D对可以使用的RB分配给该Stage-1联盟。然后,根据第二阶段联盟中D2D对请求的RB总数,将RB分配给第二阶段联盟。由于分配给第二阶段联盟的RB无法在该第二阶段联盟中被D2D对共享,因此Nash讨价还价解决方案(NBS)用于进一步为该第二阶段联盟中的D2D对分配RB。仿真结果表明,与贪婪算法分配的RB数量相比,所提出的两阶段联盟形成和资源分配方案为D2D对分配了更多的等效RB。具体地,基于仿真结果,所提出的方案分配的等效RB的总数可以达到贪婪算法分配的等效RB的总数的325.52%。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号