Annals of Telecommunications最新文献_第5页

Investigation of LDPC codes with interleaving for 5G wireless networks 针对 5G 无线网络的交织 LDPC 码研究

IF 2.2 4区计算机科学

Annals of Telecommunications Pub Date : 2024-07-23 DOI: 10.1007/s12243-024-01054-0

Pooja Pathak, Richa Bhatia

{"title":"Investigation of LDPC codes with interleaving for 5G wireless networks","authors":"Pooja Pathak, Richa Bhatia","doi":"10.1007/s12243-024-01054-0","DOIUrl":"10.1007/s12243-024-01054-0","url":null,"abstract":"<div><p>Low-density parity check (LDPC) codes are employed for data channels due to their capability of achieving high throughput and good performance. However, the belief propagation decoding algorithm for LDPC codes has high computational complexity. The min-sum approach reduces decoding complexity at the expense of performance loss. In this paper, we investigate the performance of LDPC codes using interleaving. The codes are investigated using BPSK modulation for short to moderate message lengths for various numbers of iterations using the min-sum decoding algorithm. The paper aims to improve the block error rate (BLER) and bit error rate (BER) for short to moderate block lengths required for massive machine-type communications (mMTC) supporting numerous IoT devices with short data packets, and ultra-reliable low-latency communications (URLLC) for delay-sensitive services of 5G. By incorporating interleaving alongside min-sum decoding, the performance is not only improved but also reaches a level of comparability with established algorithms such as the belief propagation algorithm (BPA) and the sum-product algorithm (SPA). LDPC coding with interleaving and subsequent min-sum decoding is a promising approach for improving the performance metrics of codes for short to moderate block length without incurring a significant increase in decoding complexity.</p></div>","PeriodicalId":50761,"journal":{"name":"Annals of Telecommunications","volume":"80 7-8","pages":"569 - 579"},"PeriodicalIF":2.2,"publicationDate":"2024-07-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141778741","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

Opportunistic data gathering in IoT networks using an energy-efficient data aggregation mechanism 利用节能数据聚合机制在物联网网络中进行机会性数据收集

IF 2.2 4区计算机科学

Annals of Telecommunications Pub Date : 2024-07-23 DOI: 10.1007/s12243-024-01055-z

Edvar Afonso, Miguel Elias M. Campista

{"title":"Opportunistic data gathering in IoT networks using an energy-efficient data aggregation mechanism","authors":"Edvar Afonso, Miguel Elias M. Campista","doi":"10.1007/s12243-024-01055-z","DOIUrl":"10.1007/s12243-024-01055-z","url":null,"abstract":"<div><p>Internet of Things (IoT) applications rely on data collection and centralized processing to assist decision-making. Nevertheless, in multi-hop Low Power and Lossy Networks (LLN) scenarios, data forwarding can be troublesome as it imposes multiple retransmissions, consuming more energy. This paper revisits the concept of mobile agents to collect data from sensors more efficiently. Upon receiving a data request, the IoT gateway performs a cache lookup and promptly dispatches a mobile agent to collect data if this is not available. Data collection then uses closed-loop itineraries computed using a Traveling Salesman Problem (TSP) heuristic starting at the network gateway. The itinerary goes through nodes producing solicited and unsolicited data. We assume that the unsolicited data will be requested soon, and opportunistically collecting it avoids future agent transmissions. We limit the collection capacity of each agent using a knapsack problem approach. Simulation results show that our proposal reduces the network traffic and energy consumption compared with a traditional mobile agent without opportunistic data collection. In addition, we show that data aggregation can further improve the performance of our proposal.</p></div>","PeriodicalId":50761,"journal":{"name":"Annals of Telecommunications","volume":"80 7-8","pages":"599 - 611"},"PeriodicalIF":2.2,"publicationDate":"2024-07-23","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141778742","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

Deep learning based channel estimation in PLC systems 基于深度学习的 PLC 系统信道估计

IF 2.2 4区计算机科学

Annals of Telecommunications Pub Date : 2024-07-20 DOI: 10.1007/s12243-024-01051-3

Nasser Sadeghi, Masoumeh Azghani

{"title":"Deep learning based channel estimation in PLC systems","authors":"Nasser Sadeghi, Masoumeh Azghani","doi":"10.1007/s12243-024-01051-3","DOIUrl":"10.1007/s12243-024-01051-3","url":null,"abstract":"<div><p>Power line communication systems (PLC) are used for data transmission. Accurate channel state information (CSI) is essential for the receiver design in such systems, however, impulsive noise poses a challenge for the channel estimation task. In this paper, we propose a deep learning based method for PLC channel estimation which is resistant against impulsive noise as well as the additive white Gaussian noise (AWGN). The proposed deep neural network consists of three sub-networks: The first one is a denoising network which aims to remove the noise from the received signal. The second sub-network offers a low-accuracy estimation of the channel using the denoised signal. The third sub-network is designed for high-accuracy channel estimation. The training of the proposed network is done in two stages: Firstly, the denoising sub-network is trained. Secondly, by freezing the trained parameters of the denoising network, the two-channel estimation sub-networks are trained. Moreover, we have derived the Cramer Rao lower bound of the PLC channel estimation problem. The proposed method has been evaluated through various simulation scenarios which confirm the superiority of the proposed method over its counterpart. The suggested algorithm indicates acceptable resistance against impulsive and Gaussian noises.</p></div>","PeriodicalId":50761,"journal":{"name":"Annals of Telecommunications","volume":"80 7-8","pages":"581 - 590"},"PeriodicalIF":2.2,"publicationDate":"2024-07-20","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141742452","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

Throughput and latency targeted RL spectrum allocation in heterogeneous OTN 异构 OTN 中针对吞吐量和延迟的 RL 频谱分配

IF 2.2 4区计算机科学

Annals of Telecommunications Pub Date : 2024-07-17 DOI: 10.1007/s12243-024-01056-y

Sam Aleyadeh, Abbas Javadtalab, Abdallah Shami

{"title":"Throughput and latency targeted RL spectrum allocation in heterogeneous OTN","authors":"Sam Aleyadeh, Abbas Javadtalab, Abdallah Shami","doi":"10.1007/s12243-024-01056-y","DOIUrl":"10.1007/s12243-024-01056-y","url":null,"abstract":"<div><p>The increased adoption and development of 5 G-based services have greatly increased the dynamic nature of traffic, including types, sizes, and requirements. Flex-grid elastic optical networks (EONs) have become prolific in supporting these services. However, this transition led to issues such as lower traffic throughput and resource wastage in the form of bandwidth fragmentation. With the continued growth of these services, proper traffic management to reduce this issue has become essential. To overcome this challenge, we propose a Throughput and Latency-First Reinforcement Learning-based spectrum allocation algorithm (TLFRL) in IP-over-fixed/flex-grid optical networks. The main target of TLFRL is to reduce the need to reallocate the spectrum by lowering the fragmentation and blocking probability. We achieve this by leveraging advanced demand organization techniques while using traditional networking infrastructure intelligently to offload compatible services, avoiding latency violations. Extensive simulations evaluated traffic throughput, fragmentation, and average latency. The results show that the proposed solution outperforms contemporary fixed grid-based and heuristic approaches. It also provides comparable results to state-of-the-art flex-grid spectrum allocation techniques.</p></div>","PeriodicalId":50761,"journal":{"name":"Annals of Telecommunications","volume":"80 7-8","pages":"557 - 567"},"PeriodicalIF":2.2,"publicationDate":"2024-07-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141718795","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

Discreet: distributed delivery service with context-aware cooperation Discreet：具有情境感知合作功能的分布式交付服务

IF 1.8 4区计算机科学

Annals of Telecommunications Pub Date : 2024-07-11 DOI: 10.1007/s12243-024-01053-1

Ludovic Paillat, Claudia-Lavinia Ignat, Davide Frey, Mathieu Turuani, Amine Ismail

{"title":"Discreet: distributed delivery service with context-aware cooperation","authors":"Ludovic Paillat, Claudia-Lavinia Ignat, Davide Frey, Mathieu Turuani, Amine Ismail","doi":"10.1007/s12243-024-01053-1","DOIUrl":"10.1007/s12243-024-01053-1","url":null,"abstract":"<div><p>End-to-end encrypted messaging applications such as Signal became widely popular thanks to their capability to ensure the confidentiality and integrity of online communication. While the highest security guarantees were long reserved for two-party communication, solutions for n-party communication remained either inefficient or less secure until the standardization of the MLS protocol (Messaging Layer Security). This new protocol offers an efficient way to provide end-to-end secure communication with the same guarantees originally offered by the Signal protocol for two-party communication. However, both solutions still rely on a centralized component for message delivery, called the Delivery Service in the MLS protocol. The centralization of the delivery service makes it an ideal target for attackers and threatens the availability of any protocol relying on MLS. In order to overcome this issue, we propose DiSCreet (Distributed delIvery Service with Context-awaRE coopEraTion), a design that allows clients to exchange protocol messages efficiently and without any intermediary. It uses a probabilistic reliable-broadcast mechanism to efficiently deliver messages and the Cascade Consensus protocol to handle messages requiring an agreement. Our solution strengthens the availability of the MLS protocol without compromising its security. We compare the theoretical performance of DiSCreet with another distributed solution, the DCGKA protocol, and detail the implementation of our solution.</p></div>","PeriodicalId":50761,"journal":{"name":"Annals of Telecommunications","volume":"80 3-4","pages":"357 - 374"},"PeriodicalIF":1.8,"publicationDate":"2024-07-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141586718","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 revocable attribute-based access control with non-monotonic access structure 基于属性的可撤销访问控制与非单调访问结构

IF 1.8 4区计算机科学

Annals of Telecommunications Pub Date : 2024-07-10 DOI: 10.1007/s12243-024-01052-2

Maede Ashouri-Talouki, Nafiseh Kahani, Masoud Barati, Zomorod Abedini

{"title":"A revocable attribute-based access control with non-monotonic access structure","authors":"Maede Ashouri-Talouki, Nafiseh Kahani, Masoud Barati, Zomorod Abedini","doi":"10.1007/s12243-024-01052-2","DOIUrl":"10.1007/s12243-024-01052-2","url":null,"abstract":"<div><p>Internet of Things (IoT) has revolutionized data manipulation across various applications, particularly in online healthcare paradigm, where medical data are collected and processed for remote monitoring and analysis. To improve the privacy and security of such sensitive healthcare data, the attribute-based encryption (ABE) with non-monotonic access policies has recently provided a fine-grained access control within cloud and IoT-based healthcare ecosystems. Specifically, the adoption of multi-authority ABE with untrusted authorities has eliminated the need for a trusted authority. However, ensuring the privacy of user’s identity and attribute sets from these untrusted authorities remains a significant challenge in this context. To address this challenge, this paper introduces an enhanced multi-authority ABE approach, incorporating a robust attribute revocation mechanism. This enhancement safeguards user’s identity and attribute-set privacy while remaining resilient against collusion attacks and ensuring backward secrecy. Moreover, the proposed approach provides non-monotonic access policies, which supports positive and negative constraints using NOT operation as well as AND and OR operations.</p></div>","PeriodicalId":50761,"journal":{"name":"Annals of Telecommunications","volume":"79 11-12","pages":"833 - 842"},"PeriodicalIF":1.8,"publicationDate":"2024-07-10","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141574941","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

CSNet 2022 special issue—decentralized and data-driven security in networking CSNet 2022 特刊--网络中的去中心化和数据驱动安全

IF 1.8 4区计算机科学

Annals of Telecommunications Pub Date : 2024-07-01 DOI: 10.1007/s12243-024-01049-x

Diogo Menezes Ferrazani Mattos, Marc-Oliver Pahl, Carol Fung

引用次数: 0

A comprehensive evaluation of software-defined radio performance in virtualized environments for radio access networks 全面评估虚拟化环境中无线电接入网络的软件定义无线电性能

IF 1.8 4区计算机科学

Annals of Telecommunications Pub Date : 2024-06-26 DOI: 10.1007/s12243-024-01044-2

Govinda M. G. Bezerra, Nicollas R. de Oliveira, Tadeu N. Ferreira, Diogo M. F. Mattos

引用次数: 0

Inferring the confidence level of BGP-based distributed intrusion detection systems alarms 推断基于 BGP 的分布式入侵检测系统警报的置信度

IF 1.8 4区计算机科学

Annals of Telecommunications Pub Date : 2024-06-18 DOI: 10.1007/s12243-024-01045-1

Renato S. Silva, Felipe M. F. de Assis, Evandro L. C. Macedo, Luís Felipe M. de Moraes

{"title":"Inferring the confidence level of BGP-based distributed intrusion detection systems alarms","authors":"Renato S. Silva, Felipe M. F. de Assis, Evandro L. C. Macedo, Luís Felipe M. de Moraes","doi":"10.1007/s12243-024-01045-1","DOIUrl":"10.1007/s12243-024-01045-1","url":null,"abstract":"<div><p>Border Gateway Protocol (BGP) is increasingly becoming a multipurpose protocol. However, it keeps suffering from security issues such as bogus announcements for malicious goals. Some of these security breaches are especially critical for distributed intrusion detection systems that use BGP as the underlay network for interchanging alarms. In this sense, assessing the confidence level of detection alarms transported via BGP messages is critical to prevent internal attacks. Most of the proposals addressing the confidence level of detection alarms rely on complex and time-consuming mechanisms that can also be a potential target for further attacks. In this paper, we propose an out-of-band system based on machine learning to infer the confidence level of BGP messages, using just the mandatory fields of the header. Tests using two different data sets, (<i>i</i>) from the indirect effects of a widespread worm attack and (<i>ii</i>) using up-to-date data from the IPTraf Project, show promising results, considering well-known performance metrics, such as recall, accuracy, receiver operating characteristics (ROC), and f1-score.</p></div>","PeriodicalId":50761,"journal":{"name":"Annals of Telecommunications","volume":"79 11-12","pages":"901 - 912"},"PeriodicalIF":1.8,"publicationDate":"2024-06-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141507290","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

Impact of phase modulator on the performance of Costas loop 相位调制器对科斯塔斯环路性能的影响

IF 1.8 4区计算机科学

Annals of Telecommunications Pub Date : 2024-06-17 DOI: 10.1007/s12243-024-01048-y

F. Sinhababu, A. Mukherjee, S. Sarkar, B. Chatterjee, A. Sarkar

引用次数: 0