Annals of Telecommunications最新文献

{"title":"({l_{1/2}})-FRSVT-based channel estimation algorithm for mmWave massive MIMO systems in quantum optimization","authors":"Xiaoli Jing,&nbsp;Xianpeng Wang,&nbsp;Chenglong Shao,&nbsp;Xiang Lan","doi":"10.1007/s12243-025-01117-w","DOIUrl":"10.1007/s12243-025-01117-w","url":null,"abstract":"<div><p>Millimeter wave (mmWave) massive multiple-input multiple-output (MIMO) systems have become a research hotspot because of its advantages. Particularly, the corresponding channel estimation problem has attracted a lot of attention. However, the problem of low accuracy and high complexity cannot be ignored. Aiming at the problem of high computational complexity, a channel estimation method based on <span>({{varvec{l}}_{varvec{1/2}}})</span>-FRSVT (fast randomized singular value thresholding) principle is proposed. Firstly, the channel estimation problem is transformed into the optimization problem of the objective function related to angle parameters. Then, channel estimation is performed based on the quantum particle swarm optimization (QPSO) algorithm. By updating the process equation of particles, it keeps getting closer to the true angle values. Meanwhile, in order to reduce the computational complexity, a preprocessing scheme based on the FRSVT principle is proposed to avoid calculating the singular value decomposition (SVD) directly. The key of the proposed method is to extract the approximate basis of the matrix range from the compressed matrix, and calculate some singular values of the original matrix from a small factorization matrix. In addition, a basic approximation can be avoided in each iteration by adopting the range propagation technique. Simulation results show that the proposed <span>({{varvec{l}}_{varvec{1/2}}})</span>-FRSVT-based channel estimation method has good estimation accuracy, and reduces computational complexity simultaneously.</p></div>","PeriodicalId":50761,"journal":{"name":"Annals of Telecommunications","volume":"81 5-6","pages":"317 - 330"},"PeriodicalIF":2.2,"publicationDate":"2025-10-30","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"147968026","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":"An FCM-based hybrid method for DDoS attack detection in resource-constrained devices","authors":"Prathibha Keshavamurthy,&nbsp;Sarvesh Kulkarni","doi":"10.1007/s12243-025-01130-z","DOIUrl":"10.1007/s12243-025-01130-z","url":null,"abstract":"<div><p>Smart interconnected devices belonging to the Internet of Things ecosystem are resource-constrained in terms of hardware and software. They are also prime attack targets for malicious parties. Although there has been an extensive exploration of attack detection methods rooted in machine learning, such approaches necessitate high processing overhead, which is ill-suited for devices of modest processing capabilities. Furthermore, machine learning algorithms are opaque black boxes. Therefore, we present a novel hybrid approach to detect distributed denial-of-service attacks using fuzzy cognitive maps paired with machine learning feature selection. Our approach incorporates contextual information (features) drawn from network packets. We utilize feature selection methods to compute the weights of the features. The weights capture the influence of each input feature on the target output feature that determines the classification of any packet as malicious or benign. The features and weights are used to construct a fuzzy cognitive map for each type of attack. The fuzzy cognitive map is then used to train and test the dataset. We also auto-compute a threshold value that allows our model to classify a packet as malicious or benign. Our model performs best using the weights computed by two particular statistical feature selection algorithms, namely, SelectKBest-Classification and SelectKBest Chi-squared, combined with FCM. Our experiments show that this hybrid approach is simple, reliable, and transparent with a low memory footprint, and therefore well-suited for devices with limited resources.</p></div>","PeriodicalId":50761,"journal":{"name":"Annals of Telecommunications","volume":"80 -","pages":"1071 - 1094"},"PeriodicalIF":2.2,"publicationDate":"2025-10-27","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s12243-025-01130-z.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145963716","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":"A new dynamic spectrum access scheme based on prioritized secondary data traffics for realistic networking scenarios with finite number of users","authors":"Sedat Atmaca","doi":"10.1007/s12243-025-01131-y","DOIUrl":"10.1007/s12243-025-01131-y","url":null,"abstract":"<div><p>This paper introduces a novel priority-based dynamic spectrum access (PB-DSA) scheme designed for centralized cognitive radio (CR) networking environments, where a finite number of secondary users (SUs) are categorized into two distinct groups based on their data traffic characteristics: high-priority and low-priority. High-priority SUs, such as those handling delay-sensitive applications like Voice over Internet Protocol (VoIP) and real-time health monitoring, are given high priority. On the other hand, low-priority SUs, which manage delay-tolerant data like e-mail and file transfers, are given low priority. The proposed PB-DSA scheme prioritizes channel allocation and spectrum handoff for high-priority SUs over low-priority ones. The study thoroughly investigates the effects of varying arrival rates of PUs and SUs on key performance metrics, including call blocking, call dropping, call completion, and call handoff probabilities. Analytical and simulation results of the proposed PB-DSA scheme are compared to those of a conventional DSA scheme that does not differentiate between SUs based on a predefined priority. The primary goals of this new PB-DSA scheme and its application are to reduce both call blocking and call dropping probabilities for high-priority SUs while maintaining them at acceptable levels for low-priority SUs. The proposed PB-DSA scheme is rigorously modeled by using three-dimensional continuous-time Markov chains, and the obtained analytical results are validated through a detailed discrete-event simulation study. The results clearly demonstrate that the PB-DSA scheme achieves a relatively high performance by reducing call blocking probability for high-priority SUs by up to <span>(98.78%)</span> and call dropping probability by up to <span>(73.38%)</span>, compared to the traditional DSA scheme without a priority differentiation.</p></div>","PeriodicalId":50761,"journal":{"name":"Annals of Telecommunications","volume":"81 5-6","pages":"399 - 416"},"PeriodicalIF":2.2,"publicationDate":"2025-10-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"147967945","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":"The impact of human movement on 2.4 GHz link quality in indoor space","authors":"Ivana Stefanovic,&nbsp;Vesna Radonjic Djogatovic,&nbsp;Marija Malnar","doi":"10.1007/s12243-025-01128-7","DOIUrl":"10.1007/s12243-025-01128-7","url":null,"abstract":"<div><p>Network planning frequently ignores the impact of humans on signal propagation. We conducted research as a part of this study to quantify the propagation losses caused by humans in an indoor environment. The initial hypothesis assumes that, apart from the population size, the level of human movement also influences transmission degradation. As part of the research, 60 measures were taken for three distinct scenarios, including various levels of movement: low, medium, and high. The number of individuals involved in each scenario ranged from 1 to 20. The experiments were conducted at a frequency of 2.4 GHz to assess the impact of people’s movement on the deterioration of the signal-to-noise ratio and received signal strength. The results show that, under a low-movement scenario, the mean signal-to-noise ratio deterioration is 5.97%; however, in a high-movement scenario, this degradation escalates to 23.82%. Once the initial hypothesis was confirmed for determining the propagation losses caused by humans, various supervised and unsupervised machine learning techniques were employed for every particular scenario. The obtained findings will be utilized to develop a novel propagation model, providing a practical implementation of study outcomes.</p></div>","PeriodicalId":50761,"journal":{"name":"Annals of Telecommunications","volume":"81 5-6","pages":"381 - 398"},"PeriodicalIF":2.2,"publicationDate":"2025-10-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"147968198","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":"Advanced data-driven anomalies detection and diagnosis for cyber-physical energy systems","authors":"Hassan N. Noura,&nbsp;Zaid Allal,&nbsp;Ola Salman,&nbsp;Ali Chehab","doi":"10.1007/s12243-025-01123-y","DOIUrl":"10.1007/s12243-025-01123-y","url":null,"abstract":"<div><p>Cyber-physical energy systems (CPES) are the core components of an energy system. A CPES is characterized by a high level of complexity and uncertainty, while ensuring a more resilient and efficient distributed energy system, including robust energy security and economic viability. This work presents a novel and effective approach for anomaly detection in CPES systems using advanced tree-based machine learning models. The proposed approach is centralized with a minimal set of features that achieve a maximum detection rate and system performance. The results emphasize the effectiveness of ML methods in this domain, showcasing their ability to handle complex, high-dimensional datasets while providing interpretability and efficiency. The study also highlights associated challenges such as scalability and adversarial resilience, proposing future research directions such as hybrid models and interpretable AI for real-world deployment.</p></div>","PeriodicalId":50761,"journal":{"name":"Annals of Telecommunications","volume":"80 -","pages":"1159 - 1182"},"PeriodicalIF":2.2,"publicationDate":"2025-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145963600","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":"Blockchain-empowered e-ticket distribution system for secure and efficient transactions, validation, and audits","authors":"Adrián Guayasamín,&nbsp;Walter Fuertes,&nbsp;Nahir Carrera,&nbsp;Luis Tello-Oquendo,&nbsp;Valeria Suango","doi":"10.1007/s12243-025-01125-w","DOIUrl":"10.1007/s12243-025-01125-w","url":null,"abstract":"<div><p>Secure and efficient electronic ticket (e-ticket) management in the entertainment industry is important for both the compliance of service-level agreements and the pride of those involved. Despite its numerous benefits, the ease of duplication, fraud, and illegal resale poses several issues in the industry, which can adversely impact event organizers and legitimate buyers. Furthermore, security breaches could compromise buyers’ personal and financial information. An e-ticketing system based on blockchain is implemented, mainly designed for managing raffles. This system issues e-tickets recorded in encrypted form in a blockchain with multiple blocks. The system digitally signs each ticket, links it to the buyer, records the data on-chain, and conducts draws using secure cryptographic randomness. At the end of the process, the system provides an option to download an audit chain that facilitates the validation and audit of the draws. We used the agile Scrum methodology and Java to develop the e-ticket system, implementing the blockchain with a PostgreSQL database and a custom hash function. We store each block in an unstructured JSON-type field. To optimize response times in processing the proof-of-work (PoW) blockchain, a Java socket server was implemented to manage mining pools and distribute the load among miners. We organized the load into groups by applying the <i>K</i>-means algorithm to historical performance data. This classification enabled the formation of efficient groups that accelerated PoW resolution, enhancing the security and performance of raffle creation, signing, and execution, particularly under increased hash difficulty. Each miner received rewards based on their contribution, fostering community participation and encouraging continuous improvement in individual performance. We evaluated the system with an average block time of 30 s and a cost of <span>($ )</span>0.005, demonstrating economic viability for popular raffles with affordable ticket prices. In security tests, 10% of counterfeit tickets were successfully injected and rejected, demonstrating tamper resistance. These results confirm the feasibility of open, secure, and auditable raffles through blockchain verification, strengthening trust in public systems based on distributed technologies.</p></div>","PeriodicalId":50761,"journal":{"name":"Annals of Telecommunications","volume":"80 -","pages":"1195 - 1220"},"PeriodicalIF":2.2,"publicationDate":"2025-10-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145963602","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":"Lightweight hybrid lattice–based session key agreement protocol for multimedia IoT","authors":"Akanksha Singh,&nbsp;Harish Chandra,&nbsp;Saurabh Rana","doi":"10.1007/s12243-025-01122-z","DOIUrl":"10.1007/s12243-025-01122-z","url":null,"abstract":"<div><p>In this study, we introduce a quantum-resistant and lightweight authenticated key agreement protocol tailored for the Multimedia Internet of Things (MIoT) environment. MIoT devices gather and send sensitive multimedia data to cloud servers, which means that secure mutual authentication and quick session key creation are needed. To accomplish feasible lattice-based key exchange, our scheme uses a reconciliation technique and the Ring Learning With Errors (RLWE) assumption. While informal analysis demonstrates resilience to common threats like replay and impersonation, the random oracle model formally proves security. The robustness of the protocol against a variety of active attacks is confirmed through additional verification using the AVISPA tool. Further performance analysis shows that the suggested method clearly improves post-quantum security and computational efficiency when compared to current authenticated key agreement schemes, while facing slightly higher communication costs to ensure stronger security. In general, this work strengthens the provable security of smart devices enabled by the MIoT. Future research will investigate more extensive MIoT applications and energy-efficient optimizations.</p></div>","PeriodicalId":50761,"journal":{"name":"Annals of Telecommunications","volume":"80 -","pages":"1033 - 1051"},"PeriodicalIF":2.2,"publicationDate":"2025-10-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145963599","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":"IoT-Beeps: IoT Behavior Perception System","authors":"Franklin Magalhães Ribeiro Junior,&nbsp;Reinaldo A. C. Bianchi,&nbsp;Carlos A. Kamienski","doi":"10.1007/s12243-025-01126-9","DOIUrl":"10.1007/s12243-025-01126-9","url":null,"abstract":"<div><p>A fog-based IoT system can have dozens of thousands of heterogeneous devices with distinct computing constraints, presenting different unknown and expected behaviors. Furthermore, the fog nodes’ expected behaviors can change depending on spatiotemporal features. Some investigations use supervised machine learning (ML) techniques to deal with anomalies, but they do not learn new behaviors in execution time. Unsupervised ML can detect outliers as anomalies, but it does not consider the spatiotemporal features. Therefore, it is challenging to design a fog-based IoT system that identifies the behaviors of every fog node during execution and which considers the variability of the expected behavior. This paper proposes a system named IoT-Beeps that uses ML to group these nodes’ behaviors into clusters and identifies each fog node’s performance anomalies. Different behaviors were used to evaluate the proposed system, using traditional ML clustering algorithms such as Mean-Shift, BIRCH, and K-Means, in two fog nodes. The clustering data models created were also evaluate using Silhouette, Davies-Bouldin, and Calinski-Harabasz indexes. Finally, the proposed system performance in the simulated experiment achieved at least 99% accuracy for the first fog node when using the K-Means algorithm and at least 98% accuracy for the second fog node using the K-Means or BIRCH algorithms, using the Calinski-Harabasz index for clustering validation.</p></div>","PeriodicalId":50761,"journal":{"name":"Annals of Telecommunications","volume":"81 5-6","pages":"361 - 380"},"PeriodicalIF":2.2,"publicationDate":"2025-10-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"147968024","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":"Distributed zero trust architecture based on policy negotiation secured by DPP in blockchain","authors":"Fatemeh Stodt,&nbsp;Philipp Ruf,&nbsp;Christoph Reich,&nbsp;Fabrice Theoleyre","doi":"10.1007/s12243-025-01124-x","DOIUrl":"10.1007/s12243-025-01124-x","url":null,"abstract":"<div><p>Distributed policy negotiation is a key issue in modern manufacturing landscapes. However, existing solutions struggle with ensuring efficient policy negotiation and enforcement across entities while maintaining device authentication and trust in dynamic, cross-organizational environments. Specifically, the reliance on distributed architectures introduces challenges related to scalability, data fairness, and implementation complexity, limiting its applicability in large-scale industrial networks. This paper provides an overview of foundational concepts critical to understanding the proposed distributed policy consensus with blockchain integration: the proposed architecture leverages the decentralized and immutable nature of blockchain to achieve secure and transparent consensus among the distributed policy engines (PE), addressing challenges in policy negotiation within a distributed zero trust architecture (ZTA). The proposed methodology is applied in the context of a multinational supply chain network, involving various stakeholders such as manufacturers, suppliers, logistics providers, distributors, and retailers. The methodology provides a scalable foundation for advancing secure cross-company interactions in increasingly interconnected systems.</p></div>","PeriodicalId":50761,"journal":{"name":"Annals of Telecommunications","volume":"80 -","pages":"1053 - 1070"},"PeriodicalIF":2.2,"publicationDate":"2025-10-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145963711","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":"Joint simulation of urban vehicle traffic and relay-empowered 5G communications at city scale","authors":"Florian Condette,&nbsp;Patrick Sondi,&nbsp;Eric Ramat,&nbsp;Sylvain Lecomte","doi":"10.1007/s12243-025-01129-6","DOIUrl":"10.1007/s12243-025-01129-6","url":null,"abstract":"<div><p>The fifth and beyond generations of communications (B5G/6G) aim to support massive connected objects and mission-critical applications. In the context of disaster management, the vehicles coordinating rescue operations in each area can also serve as local communication relays for the other participants. The evaluation of such applications at a city scale requires accurate modelling of both urban mobility and vehicular communications. Most works propose either analytical models providing a big picture of the performance expected in large-scale deployments, or real-world testing at a lower scale showing performance for concrete but limited scenarios. This paper proposes a simulation approach to the evaluation of 5G relay-empowered communications, which uses an event-based urban traffic modelling in order to accelerate large-scale simulations. It also uses propagation models designed from real-world measurements performed on mobile operators’ 5G infrastructure, which allows to envision the 5G communication performance that could be expected for applications such as cooperative localization and extended perception between the participating vehicles. The evaluations over a relay-empowered 5G network including one base station (gNB), 180 relays, and up to 350 vehicles in an urban city show that the relays improve downlink communications speed and end-to-end delay, while the gNB provides higher speeds in uplink communications overall. These evaluation results draw the performance expected from existing 5G deployments, and offer insight for communication management policy regarding the applications involved in rescue operations.</p></div>","PeriodicalId":50761,"journal":{"name":"Annals of Telecommunications","volume":"81 7-8","pages":"591 - 606"},"PeriodicalIF":2.2,"publicationDate":"2025-10-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"148553090","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}