首页> 外文期刊>IEEE communications letters >Resource Allocation Schemes Based on Coalition Games for Vehicular Communications
【24h】

Resource Allocation Schemes Based on Coalition Games for Vehicular Communications

机译:基于车辆通信联盟的资源分配方案

获取原文
获取原文并翻译 | 示例
获取外文期刊封面目录资料

摘要

In this letter, we propose a suboptimal resource allocation scheme for the uplink vehicular communications networks. Our aim is to maximize the minimum throughput of all vehicle-to-vehicle (V2V) links under the constraints of the minimum vehicle-to-infrastructure (V2I) link throughput requirements. The optimization problem has a non-linear and non-convex objective function and we cannot obtain the optimal solutions directly. To solve this problem, we first propose a V2V partitioning method from the view point of game theory. Then, an efficient power allocation algorithm is developed to obtain the optimal power allocation solutions by exploiting the D.C. (difference of convex functions) structure of the objective function. Simulation results demonstrate the effectiveness of the proposed resource allocation algorithms.
机译:在这封信中,我们提出了一个用于上行链路车辆通信网络的次优资源分配方案。我们的目的是在最小车辆到基础设施(V2I)链路吞吐量要求的约束下最大化所有车辆到车辆(V2V)链路的最小吞吐量。优化问题具有非线性和非凸面目标函数,我们无法直接获得最佳解决方案。为了解决这个问题,我们首先从博弈论的视点提出了一个V2V分区方法。然后,开发了一种有效的功率分配算法来通过利用D.C来获得最佳功率分配解决方案。(凸起函数的差异)的目标函数的结构。仿真结果证明了所提出的资源分配算法的有效性。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号