Securing Vehicular Ad-hoc Networks Against Malicious Drivers: A Probabilistic Approach

D. Rawat, B. B. Bista, Gongjun Yan, Michele C. Weigle
{"title":"Securing Vehicular Ad-hoc Networks Against Malicious Drivers: A Probabilistic Approach","authors":"D. Rawat, B. B. Bista, Gongjun Yan, Michele C. Weigle","doi":"10.1109/CISIS.2011.30","DOIUrl":null,"url":null,"abstract":"Future development of Intelligent Transportation Systems (ITS) depends on Vehicular Ad-hoc Networks (VANETs) in which communications will help to improve traffic safety and efficiency through exchanging information among vehicles. As each vehicle cannot be a source of all messages in VANET, most communications depend on the information received from other vehicles. To protect VANET from malicious action, each vehicle must be able to evaluate, decide and react locally on information received from other vehicles. Message verification is more challenging in VANETs since the security and privacy of the participating vehicles, in general, and of the drivers and passengers specifically is of major concern. Each vehicle needs to verify the accuracy of the message and needs to verify that the received message is from a legitimate vehicle. In this paper, we propose a new algorithm to secure vehicular communication with the help of trust measured for the given period using a probabilistic approach. The proposed algorithm secures VANETs against the untrustworthy drivers. The proposed algorithm is illustrated through numerical results obtained from simulations.","PeriodicalId":203206,"journal":{"name":"2011 International Conference on Complex, Intelligent, and Software Intensive Systems","volume":"14 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-06-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"43","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 International Conference on Complex, Intelligent, and Software Intensive Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/CISIS.2011.30","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 43

Abstract

Future development of Intelligent Transportation Systems (ITS) depends on Vehicular Ad-hoc Networks (VANETs) in which communications will help to improve traffic safety and efficiency through exchanging information among vehicles. As each vehicle cannot be a source of all messages in VANET, most communications depend on the information received from other vehicles. To protect VANET from malicious action, each vehicle must be able to evaluate, decide and react locally on information received from other vehicles. Message verification is more challenging in VANETs since the security and privacy of the participating vehicles, in general, and of the drivers and passengers specifically is of major concern. Each vehicle needs to verify the accuracy of the message and needs to verify that the received message is from a legitimate vehicle. In this paper, we propose a new algorithm to secure vehicular communication with the help of trust measured for the given period using a probabilistic approach. The proposed algorithm secures VANETs against the untrustworthy drivers. The proposed algorithm is illustrated through numerical results obtained from simulations.
保护车载Ad-hoc网络免受恶意驱动:一种概率方法
智能交通系统(ITS)的未来发展取决于车辆自组织网络(VANETs),其中通信将通过车辆之间的信息交换帮助提高交通安全和效率。由于不可能每辆车都是VANET中所有信息的来源,因此大多数通信依赖于从其他车辆接收到的信息。为了保护VANET免受恶意攻击,每辆车都必须能够评估、决定并根据从其他车辆接收到的信息做出本地反应。消息验证在VANETs中更具挑战性,因为参与车辆的安全性和隐私性,特别是驾驶员和乘客的安全性和隐私性是主要关注的问题。每辆车都需要验证消息的准确性,并且需要验证接收到的消息是否来自合法的车辆。在本文中,我们提出了一种新的算法,利用概率方法在给定时间段内测量信任来保护车辆通信。提出的算法保护vanet免受不可信驱动程序的影响。仿真结果说明了该算法的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:604180095
Book学术官方微信