Emergency Data Transmission Mechanism in VANETs using Improved Restricted Greedy Forwarding (IRGF) Scheme

IF 0.5 Q4 COMPUTER SCIENCE, INFORMATION SYSTEMS
K. Lakshmi, M. Soranamageswari
{"title":"Emergency Data Transmission Mechanism in VANETs using Improved Restricted Greedy Forwarding (IRGF) Scheme","authors":"K. Lakshmi, M. Soranamageswari","doi":"10.5614/itbj.ict.res.appl.2023.17.1.3","DOIUrl":null,"url":null,"abstract":"One of the most critical tasks in Vehicular Ad-hoc Networks (VANETs) is broadcasting Emergency Messages (EMs) at considerable data delivery rates (DDRs). The enhanced spider-web-like Transmission Mechanism for Emergency Data (TMED) is based on request spiders and authenticated spiders to create the shortest route path between the source vehicle and target vehicles. However, the adjacent allocation is based on the DDR only and it is not clear whether each adjacent vehicle is honest or not. Hence, in this article, the Improved Restricted Greedy Forwarding (IRGF) scheme is proposed for adjacent allocation with the help of trust computation in TMED. The trust and reputation score value of each adjacent vehicle is estimated based on successfully broadcast emergency data. The vehicles’ position, velocity, direction, density, and the reputation score, are fed to a fuzzy logic (FL) scheme, which selects the most trusted adjacent node as the forwarding node for broadcasting the EM to the destination vehicles. Finally, the simulation results illustrate the TMED-IRGF model’s efficiency compared to state-of-the-art models in terms of different network metrics.","PeriodicalId":42785,"journal":{"name":"Journal of ICT Research and Applications","volume":null,"pages":null},"PeriodicalIF":0.5000,"publicationDate":"2023-04-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Journal of ICT Research and Applications","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.5614/itbj.ict.res.appl.2023.17.1.3","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"Q4","JCRName":"COMPUTER SCIENCE, INFORMATION SYSTEMS","Score":null,"Total":0}
引用次数: 0

Abstract

One of the most critical tasks in Vehicular Ad-hoc Networks (VANETs) is broadcasting Emergency Messages (EMs) at considerable data delivery rates (DDRs). The enhanced spider-web-like Transmission Mechanism for Emergency Data (TMED) is based on request spiders and authenticated spiders to create the shortest route path between the source vehicle and target vehicles. However, the adjacent allocation is based on the DDR only and it is not clear whether each adjacent vehicle is honest or not. Hence, in this article, the Improved Restricted Greedy Forwarding (IRGF) scheme is proposed for adjacent allocation with the help of trust computation in TMED. The trust and reputation score value of each adjacent vehicle is estimated based on successfully broadcast emergency data. The vehicles’ position, velocity, direction, density, and the reputation score, are fed to a fuzzy logic (FL) scheme, which selects the most trusted adjacent node as the forwarding node for broadcasting the EM to the destination vehicles. Finally, the simulation results illustrate the TMED-IRGF model’s efficiency compared to state-of-the-art models in terms of different network metrics.
基于改进限制贪婪转发(IRGF)方案的vanet应急数据传输机制
在车载自组织网络(vanet)中,最关键的任务之一是以相当高的数据传输速率(ddr)广播紧急消息(EMs)。增强的类似蛛网的应急数据传输机制(TMED)是基于请求蜘蛛和认证蜘蛛来创建源车辆和目标车辆之间最短的路径。然而,相邻分配仅基于DDR,并且不清楚每个相邻车辆是否诚实。因此,本文提出了一种改进的限制贪婪转发(IRGF)方案,利用TMED中的信任计算进行相邻分配。基于成功广播的应急数据估计相邻车辆的信任和信誉得分值。将车辆的位置、速度、方向、密度和信誉分数等信息反馈给模糊逻辑(FL)方案,该方案选择最可信的相邻节点作为转发节点,向目标车辆广播EM信息。最后,仿真结果说明了TMED-IRGF模型在不同网络指标方面的效率。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
Journal of ICT Research and Applications
Journal of ICT Research and Applications COMPUTER SCIENCE, INFORMATION SYSTEMS-
CiteScore
1.60
自引率
0.00%
发文量
13
审稿时长
24 weeks
期刊介绍: Journal of ICT Research and Applications welcomes full research articles in the area of Information and Communication Technology from the following subject areas: Information Theory, Signal Processing, Electronics, Computer Network, Telecommunication, Wireless & Mobile Computing, Internet Technology, Multimedia, Software Engineering, Computer Science, Information System and Knowledge Management. Authors are invited to submit articles that have not been published previously and are not under consideration elsewhere.
×
引用
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学术官方微信