...
首页> 外文期刊>Vehicular Communications >A constrained Delaunay Triangulation based RSUs deployment strategy to cover a convex region with obstacles for maximizing communications probability between V2I
【24h】

A constrained Delaunay Triangulation based RSUs deployment strategy to cover a convex region with obstacles for maximizing communications probability between V2I

机译:基于约束Delaunay三角剖分的RSU部署策略可覆盖具有障碍物的凸区域,以最大化V2I之间的通信概率

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

摘要

In context of competent communication in Vehicular Ad-hoc Networks (VANets), an efficient algorithm for roadside units (RSUs) placement is considered to be a challenging task mainly due to the obstacles like buildings, trees, water-bodies and other constructions. The existing solutions available for this problem come with several limitations. While some of them consider only vehicle density and intersection popularity for RSUs position calculation (bypassing the global coverage), some others are unable to consider the obstacles present in the map to validate the model. In case of the hotspot based RSUs placement method, if the hotspot areas are changed for some reasons, the method does not work properly and even fails for real complex traffic scenarios. This paper presents a novel scheme for placing a given number of RSUs in a convex map and assigning transmission range to each of the RSUs in such a way that each and every position in the map can be covered certainly by at least one RSU despite several obstacles. The proposed method at first initial RSUs position is determined based on a Constrained Delaunay Triangulation (CDT) method to deploy the RSUs in obstacle free area, followed by an optimization method to find out the more significant position for RSUs deployment based on RSUs cost and end-to-end delay. And finally a multi-criteria decision making strategy for RSU selection is introduced for efficient communication between vehicle to infrastructure (V2I) or infrastructure to vehicle (I2V). The simulations have been performed in a real complex road traffic scenario of Ottawas downtown area considering all the obstacles. The simulation results show that the proposed method outperforms the existing methods with the improvement of about 7.7% in packet delivery rate, about 9% reduction in packet loss and about 22% reduction in end-to-end delay. Further, the impact has been analyzed by varying the vehicle density, vehicle flow and RSU cost. The proposed method is tested in different scenarios like Manhattan: Simple map, Erlangen: Medium map and Rome: Complex map to get more precise results. (C) 2018 Elsevier Inc. All rights reserved.
机译:在车辆自组织网络(VANets)中的主管通信中,有效的路边单元(RSU)放置算法被认为是一项具有挑战性的任务,这主要是由于建筑物,树木,水体和其他建筑等障碍。可用于该问题的现有解决方案具有多个限制。尽管其中一些仅考虑车辆密度和交叉路口受欢迎程度来计算RSU的位置(绕过全球覆盖范围),但其他一些则无法考虑地图中存在的障碍物来验证模型。对于基于热点的RSU放置方法,如果由于某些原因更改了热点区域,则该方法将无法正常工作,甚至在实际的复杂交通情况下也将失败。本文提出了一种新颖的方案,该方案可将给定数量的RSU放置在凸图中,并为每个RSU分配传输范围,以使尽管有多个障碍,地图上的每个位置仍可以被至少一个RSU肯定覆盖。根据约束Delaunay三角剖分(CDT)方法确定在RSU初始位置的建议方法,以将RSU部署在无障碍区域中,然后根据RSU的成本和最终位置采用优化方法找出RSU部署的更重要位置到端的延迟。最后,引入了用于RSU选择的多标准决策策略,以实现车辆对基础设施(V2I)或基础设施对车辆(I2V)之间的高效通信。考虑到所有障碍,已经在渥太华市区的实际复杂道路交通场景中进行了模拟。仿真结果表明,所提出的方法优于现有方法,分组传送速率提高了约7.7%,分组丢失减少了约9%,端到端延迟减少了约22%。此外,已经通过改变车辆密度,车辆流量和RSU成本分析了影响。在诸如曼哈顿:简单地图,埃尔兰根:中等地图和罗马:复杂地图的不同场景下对提出的方法进行了测试,以得到更精确的结果。 (C)2018 Elsevier Inc.保留所有权利。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号