A Hybrid Trust Management Heuristic for VANETs

A. Mahmood, B. Butler, W. Zhang, Quan Z. Sheng, S. A. Siddiqui
{"title":"A Hybrid Trust Management Heuristic for VANETs","authors":"A. Mahmood, B. Butler, W. Zhang, Quan Z. Sheng, S. A. Siddiqui","doi":"10.1109/PERCOMW.2019.8730675","DOIUrl":null,"url":null,"abstract":"State-of-the-art advances in vehicular communication have fostered the development of smart mobility platforms, where moving vehicles exchange safety-critical information with minimal latency, to improve passenger and pedestrian safety. It is, therefore, of paramount importance that the information that is exchanged is not only authentic, but its sender should be trustworthy. Consequently, incorrect information needs to be detected as such, and its source needs to be flagged as untrustworthy if it consistently sends incorrect information. In the case of highly dynamic vehicular networks, ignoring trustworthiness poses a serious threat to vehicular communications, especially if there is a chance that the malicious vehicle could be elected as the cluster head of other vehicles within a group. We propose a hybrid trust management scheme to identify such malicious vehicles and to inhibit them from being elected as the cluster head. The scheme encompasses a composite metric (i.e., trust values assigned to the vehicles coupled with their resource availability) for cluster head and proxy cluster head selection via intermittent elections. This approach helps to form trustworthy and resource efficient vehicular networks. Simulations of the proposed scheme have been conducted using MATLAB and are also presented in this manuscript.","PeriodicalId":437017,"journal":{"name":"2019 IEEE International Conference on Pervasive Computing and Communications Workshops (PerCom Workshops)","volume":"65 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2019-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"31","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2019 IEEE International Conference on Pervasive Computing and Communications Workshops (PerCom Workshops)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/PERCOMW.2019.8730675","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 31

Abstract

State-of-the-art advances in vehicular communication have fostered the development of smart mobility platforms, where moving vehicles exchange safety-critical information with minimal latency, to improve passenger and pedestrian safety. It is, therefore, of paramount importance that the information that is exchanged is not only authentic, but its sender should be trustworthy. Consequently, incorrect information needs to be detected as such, and its source needs to be flagged as untrustworthy if it consistently sends incorrect information. In the case of highly dynamic vehicular networks, ignoring trustworthiness poses a serious threat to vehicular communications, especially if there is a chance that the malicious vehicle could be elected as the cluster head of other vehicles within a group. We propose a hybrid trust management scheme to identify such malicious vehicles and to inhibit them from being elected as the cluster head. The scheme encompasses a composite metric (i.e., trust values assigned to the vehicles coupled with their resource availability) for cluster head and proxy cluster head selection via intermittent elections. This approach helps to form trustworthy and resource efficient vehicular networks. Simulations of the proposed scheme have been conducted using MATLAB and are also presented in this manuscript.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
一种基于vanet的混合信任管理启发式算法
车辆通信的最新进展促进了智能移动平台的发展,移动车辆以最小的延迟交换安全关键信息,以提高乘客和行人的安全。因此,最重要的是,所交换的信息不仅是真实的,而且其发送者应该是值得信赖的。因此,需要检测不正确的信息,如果它始终发送不正确的信息,则需要将其来源标记为不可信。在高度动态的车辆网络中,忽略可信度会对车辆通信造成严重威胁,特别是当恶意车辆有可能被选为组内其他车辆的簇头时。我们提出了一种混合信任管理方案来识别这些恶意车辆,并阻止它们被选为簇头。该方案包含一个复合度量(即,分配给车辆的信任值及其资源可用性),用于通过间歇选举选择簇头和代理簇头。这种方法有助于形成可信赖且资源高效的车辆网络。本文还使用MATLAB对所提出的方案进行了仿真。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Protecting IoT-environments against Traffic Analysis Attacks with Traffic Morphing Anticipated Acceptance of Head Mounted Displays: a content analysis of YouTube comments Straightforward Recognition of Daily Objects in Smart Environments from Wearable Vision Sensor A Blockchain-Based Architecture for Integrated Smart Parking Systems Vision and Acceleration Modalities: Partners for Recognizing Complex Activities
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1