首页> 外文会议>IEEE Malaysia International Conference on Communications >Efficient rate adaptation algorithm in high-dense vehicular ad hoc network
【24h】

Efficient rate adaptation algorithm in high-dense vehicular ad hoc network

机译:高密度车载自组网中的高效速率自适应算法

获取原文

摘要

In the Vehicular Ad hoc NETwork (VANET) communications, the presence of intersections, vehicles, and obstacles such as buildings may obstruct signal propagation especially in urban areas. Moreover, the vehicle's mobility and density also cause intermittent in inter-vehicle connection due to unpredictable and diverse channel conditions. Rate adaptation is the key method in VANET to predict the prevailing channel conditions and decide appropriate transmission rate quickly based on channel status. Although various rate adaptation algorithms using closed and open loop exist, it is difficult to select the best rate adaptation method due to unpredictable nature of the vehicular environment, while inappropriate data selection leads poor network performance as well. This paper aims to evaluate the performance of different data rate adaptation algorithms in VANET, using closed-loop and open-loop based approaches. The two-targeted open loops are Atsushi Onoe Algorithm and Minstrel, while Collision-Aware Rate Adaptation (CARA) and Robust Rate Adaptation Algorithm (RRAA) are closed-loop based approaches. The mentioned algorithms are simulated under high-density VANET scenario with a number of nodes starts from 40 up to a hundred using the discrete event network simulator NS-3. Moreover, the distance between the nodes is investigated also over the selected approaches. Simulation results, in general, show that the close-looped outperform the open-looped approach, with RRAA better than others by at least 9.4% and nearby reach to 62% in the average throughput over the different node density as the distance varied. The packet delivery ratio is slightly diverse over the node density. However, an end-end delay is 233.39 ms which is the worst among others, but still adequate for the high critical demand applications.
机译:在车辆专用网络(VANET)通信中,尤其是在城市地区,交叉路口,车辆和障碍物(如建筑物)的存在可能会阻碍信号传播。此外,由于不可预测的和多样化的通道条件,车辆的移动性和密度也导致车辆间连接的间歇性。速率自适应是VANET中预测主要信道条件并根据信道状态快速确定合适的传输速率的关键方法。尽管存在使用闭环和开环的各种速率自适应算法,但是由于车辆环境的不可预测性,难以选择最佳速率自适应方法,而不合适的数据选择也会导致不良的网络性能。本文旨在使用基于闭环和开环的方法评估VANET中不同数据速率自适应算法的性能。有两个目标的开环是Atsushi Onoe算法和Minstrel,而冲突感知速率自适应(CARA)和鲁棒速率自适应算法(RRAA)是基于闭环的方法。所提到的算法是使用离散事件网络模拟器NS-3在高密度VANET场景下进行仿真的,其中节点数从40到100不等。此外,还通过选定的方法研究了节点之间的距离。总体而言,仿真结果表明,闭环性能优于开环方法,在距离变化的情况下,RRAA比其他方法至少好9.4%,并且在不同节点密度下的平均吞吐量接近达到62% 。分组传送率在节点密度上略有不同。但是,端到端延迟是233.39 ms,这是最糟糕的,但仍足以满足高关键需求的应用。

著录项

相似文献

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

客服邮箱:kefu@zhangqiaokeyan.com

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

  • 服务号