Detecting faulty and malicious vehicles using rule-based communications data mining

Jihene Rezgui, S. Cherkaoui
{"title":"Detecting faulty and malicious vehicles using rule-based communications data mining","authors":"Jihene Rezgui, S. Cherkaoui","doi":"10.1109/LCN.2011.6115558","DOIUrl":null,"url":null,"abstract":"The reliability of most safety applications that are based on vehicular communications, depends in turn on the reliability of data received by each vehicle from its neighbors. Routine messages exchanged in Vehicular Ad hoc Networks (VANETs) include crucial information for safety applications such as direction, position, etc. A vehicle failure and/or a malicious vehicle transmitting false information may affect the data collection scheme and cause a disturbance for safety applications. In such a scenario, (1) the faulty/malicious vehicle should be detected rapidly and (2) routine messages exchange should be updated in consequence. To be able to detect the faulty/malicious vehicle, we developed a mechanism that collects, at a single vehicle, data regarding each neighbour transmission, and extracts the temporal correlation rules between vehicles implicated in transmissions in the neighbourhood. With the mechanism, called VANETs Association Rules Mining (VARM), a mining process will take place during a-priori constant historical period. The associations rules formulated during the mining process will be used to detect a faulty or malicious vehicle, i.e., a vehicle which is not correlated with vehicles in the neighbourhood following these rules. To react after this kind of anomaly detection, an 1:N technique is used as a protection for reestablishing the accuracy of the data collection process between vehicles communicating in the neighbourhood. Simulation results demonstrate the efficiency of the VARM scheme.","PeriodicalId":437953,"journal":{"name":"2011 IEEE 36th Conference on Local Computer Networks","volume":"83 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-10-04","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"30","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 IEEE 36th Conference on Local Computer Networks","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/LCN.2011.6115558","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 30

Abstract

The reliability of most safety applications that are based on vehicular communications, depends in turn on the reliability of data received by each vehicle from its neighbors. Routine messages exchanged in Vehicular Ad hoc Networks (VANETs) include crucial information for safety applications such as direction, position, etc. A vehicle failure and/or a malicious vehicle transmitting false information may affect the data collection scheme and cause a disturbance for safety applications. In such a scenario, (1) the faulty/malicious vehicle should be detected rapidly and (2) routine messages exchange should be updated in consequence. To be able to detect the faulty/malicious vehicle, we developed a mechanism that collects, at a single vehicle, data regarding each neighbour transmission, and extracts the temporal correlation rules between vehicles implicated in transmissions in the neighbourhood. With the mechanism, called VANETs Association Rules Mining (VARM), a mining process will take place during a-priori constant historical period. The associations rules formulated during the mining process will be used to detect a faulty or malicious vehicle, i.e., a vehicle which is not correlated with vehicles in the neighbourhood following these rules. To react after this kind of anomaly detection, an 1:N technique is used as a protection for reestablishing the accuracy of the data collection process between vehicles communicating in the neighbourhood. Simulation results demonstrate the efficiency of the VARM scheme.
使用基于规则的通信数据挖掘检测故障和恶意车辆
大多数基于车辆通信的安全应用程序的可靠性依赖于每辆车从相邻车辆接收到的数据的可靠性。在车辆自组织网络(VANETs)中交换的常规信息包括方向、位置等安全应用的关键信息。车辆故障和/或恶意车辆传输虚假信息可能会影响数据收集方案,并对安全应用程序造成干扰。在这种情况下,(1)应该迅速检测到故障/恶意车辆,(2)应该相应地更新常规消息交换。为了能够检测故障/恶意车辆,我们开发了一种机制,可以在单个车辆上收集有关每个邻居传输的数据,并提取涉及邻居传输的车辆之间的时间相关性规则。利用这种被称为VANETs关联规则挖掘(valm)的机制,挖掘过程将在先验的恒定历史时期内进行。在挖掘过程中制定的关联规则将用于检测故障或恶意车辆,即与遵循这些规则的邻近车辆不相关的车辆。为了在这种异常检测后做出反应,使用1:N技术作为保护,以重建在附近通信的车辆之间数据收集过程的准确性。仿真结果验证了该方案的有效性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信
小红书