Annals of Telecommunications最新文献_第2页

Bridging digital and physical realms: cross-evaluating intrusion detection models in cyber-physical systems 桥接数字和物理领域：网络物理系统中入侵检测模型的交叉评估

IF 2.2 4区计算机科学

Annals of Telecommunications Pub Date : 2025-10-11 DOI: 10.1007/s12243-025-01119-8

Henry Chima Ukwuoma, Gilles Dusserre, Gouenou Coatrieux, Johanne Vincent, Nasir Baba-Ahmed, Stéphane Lecoeuche, Emmanuel Song Shombot

{"title":"Bridging digital and physical realms: cross-evaluating intrusion detection models in cyber-physical systems","authors":"Henry Chima Ukwuoma, Gilles Dusserre, Gouenou Coatrieux, Johanne Vincent, Nasir Baba-Ahmed, Stéphane Lecoeuche, Emmanuel Song Shombot","doi":"10.1007/s12243-025-01119-8","DOIUrl":"10.1007/s12243-025-01119-8","url":null,"abstract":"<div><p>The application of digital models in industries is recently being used as a means to enhance the operational efficiency of cyber-physical systems (CPSs). However, this comes with challenges bordering mostly around the detection of cyber-attacks using replication as a means. This study considers a synthetic digital object dataset and its equivalent physical object for intrusion detection using principal component analysis (PCA) and an autoencoder for dimensionality reduction. Application of random forest and XGBoost machine learning on both objects is applied to compare the performance on the two objects. To fill a methodological gap, the study implemented the developed model on the digital object dataset and its physical object equivalent to assess intrusion detection capability. The study established that the application of the developed random forest model on the use case digital object dataset varies slightly from its physical equivalent as assessed using standard performance metrics, though revealing very good performance for both objects, which validates the digital object and its applicability in the real world.</p></div>","PeriodicalId":50761,"journal":{"name":"Annals of Telecommunications","volume":"80 -","pages":"1143 - 1158"},"PeriodicalIF":2.2,"publicationDate":"2025-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145963713","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

A real-time autonomic architecture for detection and defeat of open-access chess bots 用于检测和击败开放访问国际象棋机器人的实时自主架构

IF 2.2 4区计算机科学

Annals of Telecommunications Pub Date : 2025-10-11 DOI: 10.1007/s12243-025-01120-1

Andrew Bengtson, Ali Tekeoglu, Christopher Rouff

引用次数: 0

A versatile XAI-based framework for efficient and explainable intrusion detection systems 一个通用的基于xai的框架，用于高效和可解释的入侵检测系统

IF 2.2 4区计算机科学

Annals of Telecommunications Pub Date : 2025-09-29 DOI: 10.1007/s12243-025-01118-9

Beny Nugraha, Abhishek Venkatesh Jnanashree, Thomas Bauschert

{"title":"A versatile XAI-based framework for efficient and explainable intrusion detection systems","authors":"Beny Nugraha, Abhishek Venkatesh Jnanashree, Thomas Bauschert","doi":"10.1007/s12243-025-01118-9","DOIUrl":"10.1007/s12243-025-01118-9","url":null,"abstract":"<div><p>Artificial intelligence (AI)-based intrusion detection systems (IDSs) markedly advance network security by leveraging machine learning (ML) and deep learning (DL) models for accurate, adaptive threat detection. Their main drawback, however, is an inherent “black-box” character that impedes trust, traceability, and regulatory compliance. To overcome this limitation, we propose an efficient explainable-AI (XAI) framework that enhances both robustness and interpretability. The two-stage process first couples a statistical selector (ANOVA) with global SHAP scores to retain only the ten most informative features, an approximately 70% dimensionality reduction, then retrains a lightweight XGBoost detector whose decisions are explained locally by SHAP and LIME. Cross-validating the two explanation modalities adds a reliability check absent from earlier hybrids, while the inclusion of a time-efficiency evaluation for explanation generation provides a new performance dimension that prior XAI-IDS studies have not addressed. To our knowledge, this is the first framework to jointly apply dual-stage statistical–model-based feature selection and SHAP–LIME cross-validation in IDS, enabling near-real-time explainability without sacrificing accuracy. Comprehensive experiments on three representative traces, CIC-DDoS2019 (legacy IP DDoS), CICIoT2023 (IoT malware), and 5 G PFCP (control-plane attacks), confirm the framework’s versatility: it sustains an F1 Score of at least 99 % while accelerating LIME explanation time from 36 to 4.9 s, an 87 % speed-up. These results demonstrate that high detection accuracy and transparent, near-real-time interpretability can be achieved simultaneously in modern IDS deployments.</p></div>","PeriodicalId":50761,"journal":{"name":"Annals of Telecommunications","volume":"80 -","pages":"1095 - 1120"},"PeriodicalIF":2.2,"publicationDate":"2025-09-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s12243-025-01118-9.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145963712","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

SBRC 2024 special issue—cross-layer advances for resilient and intelligent communication systems SBRC 2024专题——弹性和智能通信系统的跨层进展

IF 2.2 4区计算机科学

Annals of Telecommunications Pub Date : 2025-09-26 DOI: 10.1007/s12243-025-01116-x

Célio Albuquerque, Katia Obraczka, Diogo Menezes Ferrazani Mattos

引用次数: 0

Blind retrieval of signals via analytical and sequential determination of separation angles 通过分析和顺序确定分离角的信号盲检索

IF 2.2 4区计算机科学

Annals of Telecommunications Pub Date : 2025-09-18 DOI: 10.1007/s12243-025-01115-y

El Mouataz Billah Smatti, Djemai Arar

{"title":"Blind retrieval of signals via analytical and sequential determination of separation angles","authors":"El Mouataz Billah Smatti, Djemai Arar","doi":"10.1007/s12243-025-01115-y","DOIUrl":"10.1007/s12243-025-01115-y","url":null,"abstract":"<div><p>This paper presents a novel method for blind source separation of non-Gaussian signals from instantaneous linear mixtures. The approach analytically derives optimal rotation angles to ensure statistical independence among the signals. The process begins by decorrelating the mixed signals, followed by maximizing the kurtosis of the orthogonal signal pairs. By utilizing a sinusoidal objective function, this method calculates the necessary phase shifts, facilitating precise source recovery with minimal computational effort and requiring only four angle tests per signal pair per iteration. The simulation results validate the high accuracy and rapid convergence of the method, even under noisy conditions and scenarios with limited data availability. Compared with traditional optimization techniques, this approach substantially reduces computational complexity, underscoring its superior efficiency. Additionally, the proposed method is evaluated against widely recognized techniques, known for their robustness and execution speed, demonstrating comparable results and performance while maintaining its reliability and efficiency.\u0000</p></div>","PeriodicalId":50761,"journal":{"name":"Annals of Telecommunications","volume":"81 3-4","pages":"275 - 289"},"PeriodicalIF":2.2,"publicationDate":"2025-09-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"147617936","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Towards identification of network applications in encrypted traffic 在加密流量中识别网络应用

IF 2.2 4区计算机科学

Annals of Telecommunications Pub Date : 2025-09-03 DOI: 10.1007/s12243-025-01114-z

Ivana Burgetová, Petr Matoušek, Ondřej Ryšavý

{"title":"Towards identification of network applications in encrypted traffic","authors":"Ivana Burgetová, Petr Matoušek, Ondřej Ryšavý","doi":"10.1007/s12243-025-01114-z","DOIUrl":"10.1007/s12243-025-01114-z","url":null,"abstract":"<div><p>Network traffic monitoring for security threat detection and network performance management is challenging due to the encryption of most communications. This article addresses the problem of identifying network applications associated with Transport Layer Security (TLS) connections. The evaluation of three primary approaches to classifying TLS-encrypted traffic was carried out: fingerprinting methods, Server Name Indication (SNI)–based identification, and machine learning–based classifiers. Each method has its own strengths and limitations: fingerprinting relies on a regularly updated database of known hashes, SNI is vulnerable to obfuscation or missing information, and AI techniques such as machine learning require sufficient labeled training data. A comparison of these methods highlights the challenges of identifying individual applications, as the TLS properties are significantly shared between applications. Nevertheless, even when identifying a collection of candidate applications, a valuable insight into network monitoring can be gained, and this can be achieved with high accuracy by all the methods considered. To facilitate further research in this area, a novel publicly available dataset of TLS communications has been created, with the communications annotated for popular desktop and mobile applications. Furthermore, the results of three different approaches to refine TLS traffic classification based on a combination of basic classifiers and context are presented. Finally, practical use cases are proposed, and future research directions are identified to further improve application identification methods.</p></div>","PeriodicalId":50761,"journal":{"name":"Annals of Telecommunications","volume":"80 -","pages":"1015 - 1032"},"PeriodicalIF":2.2,"publicationDate":"2025-09-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s12243-025-01114-z.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145963715","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

EWMAX and NDIST: RSSI filtering mechanisms for handoff algorithms in dense networks EWMAX和NDIST：密集网络中切换算法的RSSI过滤机制

IF 2.2 4区计算机科学

Annals of Telecommunications Pub Date : 2025-08-01 DOI: 10.1007/s12243-025-01112-1

Helga D. Balbi, Eduardo C. A. dos Santos, Diego Passos, Luiz C. S. Magalhães, Célio Albuquerque

引用次数: 0

A low-complexity successive cancellation list decoding for polar codes with variable thresholds 可变阈值极化码的低复杂度连续消列译码

IF 2.2 4区计算机科学

Annals of Telecommunications Pub Date : 2025-07-29 DOI: 10.1007/s12243-025-01111-2

Liping Du, Ping An, Xiaoyun Hou, Yueyun Chen

{"title":"A low-complexity successive cancellation list decoding for polar codes with variable thresholds","authors":"Liping Du, Ping An, Xiaoyun Hou, Yueyun Chen","doi":"10.1007/s12243-025-01111-2","DOIUrl":"10.1007/s12243-025-01111-2","url":null,"abstract":"<div><p>The successive cancellation list (SCL) decoding algorithm has attracted significant interest in polar code due to its superior performance by retaining multiple decoding paths with increasing the complexity of decoding. To reduce the decoding complexity, we propose two low-complexity SCL decoding algorithms, including the codewords grouping-based threshold modified sequential probability ratio test (CG-TMSPRT) algorithm and the bit-based threshold modified sequential probability ratio test (B-TMSPRT) algorithm. Both algorithms trim some decoding paths by the proposed splitting rules, which consider adaptive double thresholds for the SCL decoding procedure. Based on the SCL decoding procedure, the CG-TMSPRT algorithm considers double thresholds, which vary with the group of code length, while the B-TMSPRT algorithm changes double thresholds with decoding bit according to Gaussian approximation. The simulation results show that both proposed algorithms significantly reduce the decoding complexity while keeping good decoding performance. Compared with the CG-TMSPRT algorithm, the B-TMSPRT algorithm has better decoding performance and higher computational complexity.</p></div>","PeriodicalId":50761,"journal":{"name":"Annals of Telecommunications","volume":"81 3-4","pages":"291 - 300"},"PeriodicalIF":2.2,"publicationDate":"2025-07-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"147617965","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Improving channel equalization in cell-free MIMO networks using reconfigurable intelligent surfaces and in-context learning 利用可重构智能曲面和情境学习改进无小区MIMO网络中的信道均衡

IF 2.2 4区计算机科学

Annals of Telecommunications Pub Date : 2025-07-25 DOI: 10.1007/s12243-025-01109-w

Manju Shanmugam, Sundarambal Balaraman, Krishnamoorthy Ranganathan

{"title":"Improving channel equalization in cell-free MIMO networks using reconfigurable intelligent surfaces and in-context learning","authors":"Manju Shanmugam, Sundarambal Balaraman, Krishnamoorthy Ranganathan","doi":"10.1007/s12243-025-01109-w","DOIUrl":"10.1007/s12243-025-01109-w","url":null,"abstract":"<div><p>Reconfigurable intelligent surface (RIS)-aided Multiple Input and Multiple Output (MIMO) systems offer increased spectral efficiency and signal quality in futuristic wireless networks. However, optimizing channel equalization in time-varying channel conditions and fronthaul-constrained capacity is a challenging task. This paper introduces an in-context learning (ICL)-based equalization scheme that can adapt to changing channel conditions in real time without the need for retraining. Compared to conventional methods like linear minimum mean square error (LMMSE) and model-agnostic meta-learning (MAML), ICL is unique as it uses a transformer model to learn optimal equalization policies from pilot data. This makes it efficient and computationally less complex. Most RIS-aided cell-free MIMO (CF-MIMO) network simulations show that ICL reduces mean squared error (MSE) by up to <span>(80%)</span> and improves spectral efficiency and capacity with limited fronthaul capacity (b). The results validate the scalability and performance of ICL and make it a promising candidate for deployment in low-resource wireless systems. Our future efforts are focused on extending ICL to multi-user and RIS environments, optimizing equalization with reinforcement learning, and confirming its performance in real-world hardware environments.</p></div>","PeriodicalId":50761,"journal":{"name":"Annals of Telecommunications","volume":"81 3-4","pages":"259 - 273"},"PeriodicalIF":2.2,"publicationDate":"2025-07-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"147617886","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Lightweight certificateless authenticated key agreement protocol for IIoT 用于工业物联网的轻量级无证书认证密钥协议

IF 2.2 4区计算机科学

Annals of Telecommunications Pub Date : 2025-07-24 DOI: 10.1007/s12243-025-01108-x

Hongju Xia, Wenbo Bi, Jinsheng Zhang, Heng Zhang

{"title":"Lightweight certificateless authenticated key agreement protocol for IIoT","authors":"Hongju Xia, Wenbo Bi, Jinsheng Zhang, Heng Zhang","doi":"10.1007/s12243-025-01108-x","DOIUrl":"10.1007/s12243-025-01108-x","url":null,"abstract":"<div><p>The Industrial Internet of Things (IIoT) plays a significant role in the manufacturing industry and promotes the development of industrial intelligence. However, industrial data are extremely confidential, and securing their transmission remains essential yet challenging. Authenticated key agreement (AKA) is a promising strategy for ensuring secure communication in IIoT. For resource-limited IoT devices, there has been a gradual shift toward the development of lightweight protocol schemes. Thus, certificateless AKA (CL-AKA) protocols are gradually being used in the IoT field. However, in recent years, many lightweight schemes have exhibited security loopholes and noted to be unable to resist key compromise impersonation attacks. To address these limitations, we propose a novel lightweight CL-AKA protocol scheme that can effectively avoid KCI attacks and is suitable for IIoT scenarios. The effectiveness of the proposed scheme is formally proven under the standard security model, demonstrating that it can satisfy the security requirement for communication between industrial devices and cloud servers. The proposed protocol outperforms existing IoT schemes in terms of computational cost, communication cost, and security and is more suitable for embedded low-power devices in IoT contexts, including the IIoT.</p></div>","PeriodicalId":50761,"journal":{"name":"Annals of Telecommunications","volume":"81 3-4","pages":"233 - 245"},"PeriodicalIF":2.2,"publicationDate":"2025-07-24","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"147617883","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":4,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0