CoChat

Heuristic Intrusion Detection Based on Traffic Flow Statistical Analysis

Open access

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

Abstract

As telecommunications are becoming increasingly important for modern systems, ensuring secure data transmission is getting more and more critical. Specialised numerous devices that form smart grids are a potential attack vector and therefore is a challenge for cybersecurity. It requires the continuous development of methods to counteract this risk. This paper presents a heuristic approach to detecting threats in network traffic using statistical analysis of packet flows. The important advantage of this method is ability of intrusion detection also in encrypted transmissions. Flow information is processing by neural networks to detect malicious traffic. The architectures of subsequent versions of the artificial neural networks were generated based on the results obtained by previous iterations by searching the hyperparameter space, resulting in more refined models. Finally, the networks prepared in this way exhibited high performance while maintaining a small size—thereby making them an effective method of attacks detection in network environment to protect smart grids.

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.3390/en15113951

Cites

35 of 35 references verified0 citation errors · 0 not checkable

Statistics

Figures

Image 1
CC-BY · From the PDF
Image 2
CC-BY · From the PDF
Figure 3 Changes in number of layers and neurons during trials for each crossfold.
Figure 3 Changes in number of layers and neurons during trials for each crossfold.CC-BY · From the PDF
Figure 4 Changes in learning rate, activation function, and preprocessing method during trials for each crossfold.
Figure 4 Changes in learning rate, activation function, and preprocessing method during trials for each crossfold.CC-BY · From the PDF
Figure 5 Changes in dropout and L2 regularization rate during trials for each crossfold.
Figure 5 Changes in dropout and L2 regularization rate during trials for each crossfold.CC-BY · From the PDF

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

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

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

Show all 35 references

Research works printed but not linked: 3

  1. Goodfellow, I., Bengio, Y., and Courville, A. (2016). Deep Learning, MIT Press.
  2. Tieleman, 2012, Lecture 6.5-rmsprop: Divide the gradient by a running average of its recent magnitude, Neural Netw. Mach. Learn., 4, 26
  3. Cortes, C., Mohri, M., and Rostamizadeh, A. (2009, January 18–21). L2 Regularization for Learning Kernels. Proceedings of the Twenty-Fifth Conference on Uncertainty in Artificial Intelligence, Montreal, QC, Canada.

Cited by

See all 9

Metadata

Authors
Szczepanik, W., & Niemiec, M.
Affiliations
AGH University of Krakow (PL)
Corresponding author
Szczepanik, Wojciech
Venue
Energies
Publisher
MDPI AG
Published
2022-05-27
Volume
15
Issue
11
Pages
3951
ISSN
1996-1073 (ISSN-L)
OpenAlex
W4281729307
Cited by
9
References
30
Citations by year
2025: 3 · 2024: 3 · 2023: 2 · 2022: 1
FWCI
1.00
Type
journal article
Language
en
Open access
Locations
  • Energies (publishedVersion, cc-by)
  • RePEc: Research Papers in Economics (submittedVersion)
  • DOAJ (DOAJ: Directory of Open Access Journals) (submittedVersion, cc-by-sa)
Funders
European Union’s Horizon 2020 Research and Innovation Programme (830943)
Topics
  • Physical Sciences › Computer Science › Computer Networks and Communications › Network Security and Intrusion Detection
  • Physical Sciences › Computer Science › Artificial Intelligence › Internet Traffic Analysis and Secure E-voting
  • Physical Sciences › Computer Science › Hardware and Architecture › Network Packet Processing and Optimization
Keywords
intrusion detection, network traffic analysis, smart grid cybersecurity, encrypted traffic, malicious traffic detection, neural network architecture, hyperparameter optimization, heuristic detection

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

How to cite

Cite CoChat for the checks on this page, and the paper for its own findings.

This page
CoChat. (2026). Citation check: Heuristic Intrusion Detection Based on Traffic Flow Statistical Analysis. https://app.cochat.ai/papers/10.3390/en15113951
The paper
Szczepanik, W., & Niemiec, M. (2022). Heuristic Intrusion Detection Based on Traffic Flow Statistical Analysis. Energies. https://doi.org/10.3390/en15113951

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.