{"title":"Redefining data collection: energy-conscious path optimization for sustainable wireless sensor networks","authors":"Rajeev Ranjan, Prabhat Kumar, Abhinav Tomar","doi":"10.1007/s12243-025-01127-8","DOIUrl":"10.1007/s12243-025-01127-8","url":null,"abstract":"<div><p>Data collection in wireless sensor networks (WSNs) using a mobile sink (MS) is a well-established method for improving network performance and longevity. Among various data collection strategies, rendezvous-point (RP)-based data collection strategies have gained traction due to their ability to reduce communication overhead. However, designing an optimal MS path that minimizes path length and energy consumption simultaneously remains a persistent challenge, primarily due to the NP-hard nature of the problem. Existing approaches often address these objectives in isolation, failing to fully exploit the interplay between path efficiency and energy optimization. This limitation motivates the need for innovative solutions that can balance these dual objectives effectively. In this paper, we present a novel MS path planning framework based on the vortex search algorithm (VSA), designed to overcome these challenges. The proposed scheme introduces a unique solution encoding strategy and a multi-objective fitness function that optimizes both path length and energy utilization. By dynamically determining the optimal number of RPs, the algorithm enhances data collection efficiency while extending network lifetime. This dual-focus optimization not only addresses the limitations of existing methods but also sets a new benchmark in energy-aware MS path planning. Simulation results demonstrate the superiority of the proposed scheme, achieving a 15.25% reduction in energy consumption and a 7.28% increase in network lifetime compared to state-of-the-art methods. These findings underscore the novelty and practical significance of the proposed approach, providing a robust foundation for sustainable and efficient WSN operations.</p></div>","PeriodicalId":50761,"journal":{"name":"Annals of Telecommunications","volume":"81 5-6","pages":"345 - 359"},"PeriodicalIF":2.2,"publicationDate":"2025-10-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"147968134","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}
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}
{"title":"A real-time autonomic architecture for detection and defeat of open-access chess bots","authors":"Andrew Bengtson, Ali Tekeoglu, Christopher Rouff","doi":"10.1007/s12243-025-01120-1","DOIUrl":"10.1007/s12243-025-01120-1","url":null,"abstract":"<div><p>With the rise of online chess, the increasing prevalence of automated chess bots, and recent high-profile cheating controversies, there is growing interest in developing effective methods for detecting bots in chess. Current approaches in this domain largely depend on analyzing player history, detecting anomalies, and conducting engine analysis to identify bot-like behavior after a game has concluded. However, these post-hoc techniques struggle to adapt to real-time detection scenarios, such as those required in dynamic cybersecurity contexts. This paper introduces a novel challenge: detecting bots during an ongoing game, enabling adaptive strategies based on the real-time identification of an opponent’s behavior. It further proposes an autonomic system leveraging self-adaptive properties to address this challenge as well as discussing the application of this bot detection to other domains.</p></div>","PeriodicalId":50761,"journal":{"name":"Annals of Telecommunications","volume":"80 -","pages":"1183 - 1193"},"PeriodicalIF":2.2,"publicationDate":"2025-10-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145963601","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}
{"title":"A multi-antenna multi-tag monostatic backscatter system","authors":"AbbasAli Atarodi Kozehkonan, Masoumeh Azghani","doi":"10.1007/s12243-025-01121-0","DOIUrl":"10.1007/s12243-025-01121-0","url":null,"abstract":"<div><p>This work presents a novel iterative optimization approach for multi-antenna multi-tag monostatic backscatter systems (MBS). The proposed method maximizes the collective communication rate (sum-rate) of multiple tags while incorporating constraints on transmission power, combiner design, and tag limitations. A closed-form solution is derived for the combiners, while beamforming vectors and backscattering coefficients are optimized through a two-step iterative algorithm. The block coordinate descent technique is employed to solve the optimization problem, where variables are updated sequentially while others are held constant. Furthermore, the model is simplified for low-SNR regimes, providing tractable benchmarks for performance evaluation. Extensive simulations demonstrate that the proposed iterative approach achieves superior performance compared with existing methods, resulting in a significant improvement in the communication rate within the MBS system.</p></div>","PeriodicalId":50761,"journal":{"name":"Annals of Telecommunications","volume":"81 5-6","pages":"331 - 343"},"PeriodicalIF":2.2,"publicationDate":"2025-10-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"147967985","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}
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}
{"title":"SBRC 2024 special issue—cross-layer advances for resilient and intelligent communication systems","authors":"Célio Albuquerque, Katia Obraczka, Diogo Menezes Ferrazani Mattos","doi":"10.1007/s12243-025-01116-x","DOIUrl":"10.1007/s12243-025-01116-x","url":null,"abstract":"","PeriodicalId":50761,"journal":{"name":"Annals of Telecommunications","volume":"80 9-10","pages":"711 - 713"},"PeriodicalIF":2.2,"publicationDate":"2025-09-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145210376","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}
{"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}
{"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}
Anusaya Swain, Shrishail M. Hiremath, Sarat Kumar Patra
{"title":"DSCNN-AttNet: A low complexity deep learning framework for CSI feedback in mmWave massive MIMO systems","authors":"Anusaya Swain, Shrishail M. Hiremath, Sarat Kumar Patra","doi":"10.1007/s12243-025-01113-0","DOIUrl":"10.1007/s12243-025-01113-0","url":null,"abstract":"<div><p>Massive multiple-input and multiple-output (M-MIMO) is the prime technology of fifth-generation (5 G) communication systems. Antenna diversity and multiplexing gain in M-MIMO systems are achieved through feedback of precise downlink channel state information (CSI) to the base station (BS). The knowledge of CSI at the BS benefits dynamic scheduling, interference management, precoding, detection, and adaptive modulation. However, transmitting CSI to the BS is expensive in frequency division duplexing (FDD) due to the absence of the principle of channel reciprocity and limitations in the bandwidth of the feedback link. In this paper, we designed a deep learning (DL)-based framework DSCNN-AttNet applicable to the 5 G new radio clustered delay line (nrCDL) channel model that conforms with 3GPP specifications. The framework exploits depthwise separable convolution and an attention mechanism and is termed DSCNN-AttNet. For this purpose, a set of synthetic data is generated. The performance is competitive with baseline networks CRNet, CsiNet, MRFNet, CsiNet+, and DFECsiNet. The experimental results exhibit that DSCNN-AttNet demonstrates superior performance in terms of cosine similarity (<span>(rho )</span>) and normalized mean square error (NMSE) for four different lengths of codeword (<span>(N_s)</span>) while maintaining computational complexity. The designed network provides a 5 dB improvement and a 33.5<span>(%)</span> reduction in complexity. The applicability of the work is extended to the millimeter-wave (mmWave) channel to exhibit the efficacy of the framework in diverse scenarios. To verify the generalization of DSCNN-AttNet, it is trained on a mixed dataset, which shows the feasibility of the architecture in real-time communication scenarios.</p></div>","PeriodicalId":50761,"journal":{"name":"Annals of Telecommunications","volume":"81 5-6","pages":"301 - 316"},"PeriodicalIF":2.2,"publicationDate":"2025-08-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"147968062","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}
Helga D. Balbi, Eduardo C. A. dos Santos, Diego Passos, Luiz C. S. Magalhães, Célio Albuquerque
{"title":"EWMAX and NDIST: RSSI filtering mechanisms for handoff algorithms in dense networks","authors":"Helga D. Balbi, Eduardo C. A. dos Santos, Diego Passos, Luiz C. S. Magalhães, Célio Albuquerque","doi":"10.1007/s12243-025-01112-1","DOIUrl":"10.1007/s12243-025-01112-1","url":null,"abstract":"<div><p>Handoffs are common in wireless networks with high device density. Since the IEEE 802.11 standard does not specify the criteria for initiating these handoffs, their implementation varies by manufacturer. Most current solutions rely on the Received Signal Strength Indicator (RSSI) as a key performance metric, which often leads to unstable associations—a phenomenon often referred to as the “ping-pong” effect. To address this effect, we propose EWMAX and NDIST, two RSSI filtering mechanisms designed to enhance association stability with minimal delay in handoff triggering. Comparative tests demonstrate that both EWMAX and NDIST improve stability without significantly increasing delay. However, a comprehensive evaluation reveals that EWMAX dominates the majority of results on the Pareto frontier, often generating the best solutions. Specifically, EWMAX matched NDIST in stability and outperformed it with a 24.64% reduction in delay, demonstrating superior performance in the evaluated scenario.</p></div>","PeriodicalId":50761,"journal":{"name":"Annals of Telecommunications","volume":"80 9-10","pages":"759 - 774"},"PeriodicalIF":2.2,"publicationDate":"2025-08-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145210483","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}