CoChat

A Hybrid Data-driven Model for Intrusion Detection in VANET

Open access
Bangui, Hind, Ge, Mouzhi, Buhnova, Barbora · 2021 · Procedia Computer Science
Cited by 58

The DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.

Abstract

Nowadays, VANET (Vehicular Ad-hoc NETwork) has gained increasing attention from many researchers with its various applications, such as enhancing traffic safety by collecting and disseminating traffic event information. This increased interest in VANET has necessitated greater scrutiny of machine learning (ML) methods used for improving the security capabilities of intrusion detection systems (IDSs), such as the need to solve computationally intensive ML problems due to the increased vehicular data. Therefore, in this paper, we propose a hybrid ML model to enhance the performance of IDSs by dealing with the explosive growth in computing power and the need for detecting malicious incidents timely. The proposed approach mainly uses the advantages of Random Forest to detect known network intrusions. Besides, there is a post-detection phase to detect possible novel intruders by using the advantages of coresets and clustering algorithms. Our approach is evaluated over a very recent IDS dataset named CICIDS2017. The preliminary results show that the proposed hybrid model can increase the utility of IDSs.

Overview

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Integrity signals

Registry

Crossref · 10.1016/j.procs.2021.03.065

Cites

2 of 2 references verified0 citation errors · 0 not checkable

Statistics

Verification

Claims the paper makes

The claims and statistics of this paper haven’t been checked yet.

Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.

A few free checks a day · papers already verified open instantly · results are public

Self-check

Percentages, sums and reported differences re-computed from the paper’s own numbers.

The self-check needs the paper’s full text.

Citations

Cites

Research works printed but not linked: 27

  1. Cheng, 2018, Big data driven vehicular networks, IEEE Network, 32, 160, 10.1109/MNET.2018.1700460 · DOI · Paper page
  2. An, 2020, Traffic big data assisted v2x communications toward smart transportation, Wireless Networks, 26, 1601, 10.1007/s11276-019-02181-6 · DOI
  3. Ge, 2018, Big data for internet of things: A survey, Future Generation Computer Systems, 87, 601, 10.1016/j.future.2018.04.053 · DOI · Paper page
  4. Bangui, 2018, Moving to the edge-cloud-of-things: recent advances and future research directions, Electronics, 7, 309, 10.3390/electronics7110309 · DOI · Paper page
  5. Hussain, 2020, Trust in vanet: A survey of current solutions and future research opportunities, IEEE Transactions on Intelligent Transportation Systems
  6. Shams, 2018, Trust aware support vector machine intrusion detection and prevention system in vehicular ad hoc networks, Computers & Security, 78, 245, 10.1016/j.cose.2018.06.008 · DOI · Paper page
  7. Muder Almi’ani, Alia Abu Ghazleh, Amer Al-Rahayfeh, and Abdul Razaque. Intelligent intrusion detection system using clustered self organized map. In 2018 Fifth International Conference on Software Defined Systems (SDS), pages 138–144. IEEE, 2018. · DOI
  8. Nie, 2018, Spatio-temporal network traffic estimation and anomaly detection based on convolutional neural network in vehicular ad-hoc networks, IEEE Access, 6, 40168, 10.1109/ACCESS.2018.2854842 · DOI · Paper page
  9. Sharma, 2018, Hybrid fuzzy multi-criteria decision making based multi cluster head dolphin swarm optimized ids for vanet, Vehicular Communications, 12, 23, 10.1016/j.vehcom.2017.12.003 · DOI
  10. Khattab, 2016, Intelligent intrusion detection of grey hole and rushing attacks in self-driving vehicular networks, Computers, 5, 16, 10.3390/computers5030016 · DOI · Paper page
  11. Sedjelmaci, 2015, An accurate and efficient collaborative intrusion detection framework to secure vehicular networks, Computers & Electrical Engineering, 43, 33, 10.1016/j.compeleceng.2015.02.018 · DOI · Paper page
  12. David A Schmidt, Mohammad S Khan, and Brian T Bennett. Spline-based intrusion detection for vanet utilizing knot flow classification. Internet Technology Letters, page e155, 2020. · DOI
  13. Kosmanos, 2020, A novel intrusion detection system against spoofing attacks in connected electric vehicles, Array, 5, 100013, 10.1016/j.array.2019.100013 · DOI · Paper page
  14. Liu, 2014, Data mining intrusion detection in vehicular ad hoc network, IEICE TRANSACTIONS on Information and Systems, 97, 1719, 10.1587/transinf.E97.D.1719 · DOI
  15. Rupareliya, 2016, Securing vanet by preventing attacker node using watchdog and bayesian network theory, Procedia computer science, 79, 649, 10.1016/j.procs.2016.03.082 · DOI
  16. Jasleen Kaur, Tejpreet Singh, and Kamlesh Lakhwani. An enhanced approach for attack detection in vanets using adaptive neuro-fuzzy system. In 2019 International Conference on Automation, Computational and Technology Management (ICACTM), pages 191–197. IEEE, 2019. · doi:10.1109/icactm.2019.8776833
  17. Khattab M Ali Alheeti and Klaus McDonald-Maier. Hybrid intrusion detection in connected self-driving vehicles. In 2016 22nd International Conference on Automation and Computing (ICAC), pages 456–461. IEEE, 2016. · doi:10.1109/iconac.2016.7604962
  18. Sothe, 2020, Comparative performance of convolutional neural network, weighted and conventional support vector machine and random forest for classifying tree species using hyperspectral and photogrammetric data, GIScience & Remote Sensing, 57, 369, 10.1080/15481603.2020.1712102 · DOI · Paper page
  19. Lan, 2020, A comparative study of decision tree, random forest, and convolutional neural network for spread-f identification, Advances in Space Research, 10.1016/j.asr.2020.01.036 · DOI
  20. Anjaneyulu Babu Shaik and Sujatha Srinivasan. A brief survey on random forest ensembles in classification model. In International Conference on Innovative Computing and Communications, pages 253–260. Springer, 2019. · DOI · Paper page
  21. Cordeiro De Amorim, 2012, Minkowski metric, feature weighting and anomalous cluster initializing in k-means clustering, Pattern Recognition, 45, 1061, 10.1016/j.patcog.2011.08.012 · DOI · Paper page
  22. Bangui, 2019, A research roadmap of big data clustering algorithms for future internet of things, International Journal of Organizational and Collective Intelligence (IJOCI), 9, 16, 10.4018/IJOCI.2019040102 · DOI
  23. Dan Feldman and Michael Langberg. A unified framework for approximating and clustering data. In Proceedings of the forty-third annual ACM symposium on Theory of computing, pages 569–578, 2011. · DOI
  24. Lucic, 2016, Strong coresets for hard and soft bregman clustering with applications to exponential family mixtures, Artificial intelligence and statistics, 1
  25. Le Hong Trang, Hind Bangui, Mouzhi Ge, Barbora Buhnova, et al. Scaling big data applications in smart city with coresets. 2019. · doi:10.5220/0007958803570363
  26. Fabio Massimo Zennaro. Analyzing and storing network intrusion detection data using bayesian coresets: A preliminary study in offline and streaming settings. arXiv preprint arXiv:1906.08528, 2019. · DOI
  27. Munteanu, 2018, Coresets-methods and history: A theoreticians design pattern for approximation and streaming algorithms, KI-K ünstliche Intelligenz, 32, 37, 10.1007/s13218-017-0519-3 · doi:10.1007/s13218-017-0519-3

Cited by

See all 58

Metadata

Authors
Bangui, H., Ge, M., & Buhnova, B.
Venue
Procedia Computer Science
Publisher
Elsevier BV
Published
2021
Volume
184
Pages
516-523
ISSN
1877-0509 (ISSN-L)
OpenAlex
W3162195744
Cited by
58
References
2
FWCI
9.29
Type
conference paper
Language
en
Open access
diamond
Licence
Funders
  • European Regional Development Fund
  • European Social Fund (CZ.02.1.01/0.0/0.0/16 019/0000822)

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review

Data sources

Bibliographic data: Semantic Scholar, OpenAlex, Crossref.

Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).

Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.