• 主题
高级搜索  >
历史搜索 清空历史
首页> 外文期刊>Vehicular Communications >Clustering based energy efficient multi-relay scheduling in green vehicular infrastructure
【24h】

Clustering based energy efficient multi-relay scheduling in green vehicular infrastructure

机译：基于集群的绿色车辆基础设施中的节能多继电器调度

获取原文
获取原文并翻译 | 示例
           
页面导航
  • 摘要
  • 著录项
  • 相似文献
  • 相关主题

摘要

Proper scheduling of downlink (RSU-to-vehicle) communication reduces power consumption of Road Side Unit (RSU) in green vehicular networks. In highway scenarios, due to high deployment cost of RSUs, it is necessary to leave some areas uncovered in which vehicles cannot get direct access to the RSUs. Therefore, a vehicle with large data requirement may enter into an uncovered area without completely downloading from the RSU and such a vehicle is referred as target vehicle. In this paper, we provide an energy efficient offline downlink scheduling for store-carry-forward vehicles (relays) to satisfy the residual data requirement of the target vehicle moving in the uncovered area. An integer linear programming problem is formulated for relay scheduling and evaluated its NP-hardness by reduction from well-known Seminar Assignment Problem. A polynomial time solution is presented by modeling the problem as a Minimum Cost Flow (MCF) graph. Furthermore, we propose a cluster-based approach to identify vehicles in energy favorable locations and multi-hop distance to relay vehicles. These vehicles forward data to relay vehicles using off-channel vehicle-to-vehicle (V2V) forwarding. Combining the V2V forwarding with relay scheduling further reduces the power consumption of the RSU. Extensive simulations show that the proposed approach augmented with MCF reduces the power consumption of RSU when compared to offline schedulers Nearest Fastest Set (NFS), MCF and two more basic algorithms First Come First Serve (FCFS) and Fastest First (FF). In addition, the proposed approach improves data delivery to the target vehicle in the uncovered area. (C) 2020 Elsevier Inc. All rights reserved.
机译：下行链路（RSU到车辆）通信的适当调度降低了绿色车辆网络中的道路侧单元（RSU）的功耗。在高速公路方案中，由于RSU的高部署成本，必须留下一些区域，其中车辆无法直接访问RSU。因此，具有大数据要求的车辆可以进入未从RSU完全下载的未覆盖区域，并且这种车辆被称为目标车辆。在本文中，我们提供了用于储存前进车辆（继电器）的节能离线链路调度，以满足在未覆盖区域移动的目标车辆的残余数据要求。整数线性编程问题被配制用于中继调度，并通过从知名的研讨会分配问题减少来评估其NP硬度。通过将问题建模为最小成本流（MCF）图来呈现多项式时间解决方案。此外，我们提出了一种基于簇的方法来识别能量有利位置的车辆和多跳距离到中继车辆。这些车辆使用离线车辆到车辆（V2V）转发来转发数据以中继车辆。将V2V转发与继电器调度相结合，进一步降低了RSU的功耗。广泛的模拟表明，与最近最快的集合（NFS），MCF和两个基本算法相比，使用MCF增强的方法减少了RSU的功耗，MCF和两个基本算法首先先获得（FCF）和最快的第一个（FF）。此外，所提出的方法将数据传送改善到未覆盖区域的目标车辆。 （c）2020 Elsevier Inc.保留所有权利。

著录项

相似文献

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

客服邮箱：kefu@zhangqiaokeyan.com

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

  • 客服微信

  • 服务号