Adaptive traffic management with VANET in V to I communication using greedy forwarding algorithm

R. Yugapriya, P. Dhivya, M. Dhivya, S. Kirubakaran
{"title":"Adaptive traffic management with VANET in V to I communication using greedy forwarding algorithm","authors":"R. Yugapriya, P. Dhivya, M. Dhivya, S. Kirubakaran","doi":"10.1109/ICICES.2014.7034067","DOIUrl":null,"url":null,"abstract":"Vehicular ad hoc networks (VANETs) are used to collect and aggregate real-time speed and position information on individual vehicles to optimize signal control at traffic intersections. VANET can be used to group vehicles into approximately equal-sized platoons, which can then be scheduled using OJF. Greedy forwarding algorithm is proposed to use in the traffic management as it offer the better transfer. Vehicle to infrastructure method is used to transfer the message from the platoon to the vehicle thus increases the safety. The road block information is transfer from platoon to V to I and from one V to I it is transfer to another. Greedy Forwarding algorithm is used to forwarded message to the neighboring node which is \"closest\" to the destination. In this paper Greedy Forwarding is used to increase the delivery rate and throughput. This algorithm is also used to reduce the load traffic. Greedy algorithm has computationally efficient and can find the error in early stage. Under heavy vehicular traffic load, the greedy algorithm performs the same as the platooning algorithm but still produces low delays, and high throughput.","PeriodicalId":13713,"journal":{"name":"International Conference on Information Communication and Embedded Systems (ICICES2014)","volume":"58 1","pages":"1-6"},"PeriodicalIF":0.0000,"publicationDate":"2014-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"10","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"International Conference on Information Communication and Embedded Systems (ICICES2014)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICICES.2014.7034067","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 10

Abstract

Vehicular ad hoc networks (VANETs) are used to collect and aggregate real-time speed and position information on individual vehicles to optimize signal control at traffic intersections. VANET can be used to group vehicles into approximately equal-sized platoons, which can then be scheduled using OJF. Greedy forwarding algorithm is proposed to use in the traffic management as it offer the better transfer. Vehicle to infrastructure method is used to transfer the message from the platoon to the vehicle thus increases the safety. The road block information is transfer from platoon to V to I and from one V to I it is transfer to another. Greedy Forwarding algorithm is used to forwarded message to the neighboring node which is "closest" to the destination. In this paper Greedy Forwarding is used to increase the delivery rate and throughput. This algorithm is also used to reduce the load traffic. Greedy algorithm has computationally efficient and can find the error in early stage. Under heavy vehicular traffic load, the greedy algorithm performs the same as the platooning algorithm but still produces low delays, and high throughput.
基于贪婪转发算法的V对I通信中VANET的自适应流量管理
车辆自组织网络(VANETs)用于收集和汇总单个车辆的实时速度和位置信息,以优化交通交叉口的信号控制。VANET可用于将车辆分组成大约相等大小的队列,然后可以使用OJF进行调度。由于贪心转发算法具有较好的传输性能,因此提出将其应用于流量管理中。采用车辆到基础设施的方法将信息从队列传递到车辆,从而提高了安全性。路障信息从排传递到V再传递到I,从一个V再传递到另一个V。贪婪转发算法用于将消息转发到距离目标“最近”的相邻节点。本文采用贪婪转发来提高传输速率和吞吐量。该算法还用于减少负载流量。贪心算法计算效率高,能在早期发现错误。在车辆交通负荷较大的情况下,贪婪算法的性能与队列算法相同,但仍然具有低延迟和高吞吐量。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术官方微信