{"title":"Deep learning-based sequential models for multi-user detection with M-PSK for downlink NOMA wireless communication systems","authors":"Bibekananda Panda, Poonam Singh","doi":"10.1007/s12243-023-00990-7","DOIUrl":"10.1007/s12243-023-00990-7","url":null,"abstract":"<div><p>Non-orthogonal multiple access (NOMA) techniques have the potential to achieve large connectivity requirements for future-generation wireless communication. NOMA detection techniques require conventional successive interference cancellation (SIC) techniques for uplink and downlink transmissions on the receiver side to decode the transmitted signals. Multipath fading significantly impacts the SIC process and correct signal detection due to propagation delay and fading channel. Deep learning (DL) techniques can overcome conventional SIC detection limitations. Signal detection for a multi-user NOMA wireless communication system that relies on orthogonal frequency-division multiplexing (OFDM) is discussed using various DL approaches in this paper. For multi-user signal detection, different deep learning-based sequential model neural networks, gated recurrent unit (GRU), long short-term memory (LSTM), and bi-directional long short-term memory (Bi-LSTM) are applied. The deep neural network is initially trained offline with multi-user NOMA signals in the OFDM system and used to recover transmitted signals directly. DL-based sequential models with different cyclic prefixes and fast Fourier transforms with various M-phase shift keying (M-PSK) modulation schemes are discussed with deep learning optimization algorithms. In simulation results, the conventional SIC technique with minimum mean square error approach is compared to the effectiveness of DL-based models for signal detection of multi-user NOMA systems by their bit error rate performances. The root mean square error performance of different deep learning-based sequence models with other optimizers is also discussed. Moreover, the robustness of the Bi-LSTM is evaluated with the reliability of other DL-based sequential model applications in the multi-user downlink NOMA wireless communication systems.</p></div>","PeriodicalId":50761,"journal":{"name":"Annals of Telecommunications","volume":"79 5-6","pages":"327 - 341"},"PeriodicalIF":1.8,"publicationDate":"2023-09-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135770455","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}
Ivan Palamà, Stefania Bartoletti, Giuseppe Bianchi, Nicola Blefari Melazzi
{"title":"Experimental assessment of SDR-based 5G positioning: methodologies and insights","authors":"Ivan Palamà, Stefania Bartoletti, Giuseppe Bianchi, Nicola Blefari Melazzi","doi":"10.1007/s12243-023-00987-2","DOIUrl":"10.1007/s12243-023-00987-2","url":null,"abstract":"<div><p>While GPS has traditionally been the primary positioning technology, 3GPP has more recently begun to include positioning services as native, built-in features of future-generation cellular networks. With Release 16 of the 3GPP, finalized in 2021, a significant standardization effort has taken place for positioning in 5G networks, especially in terms of physical layer signals, measurements, schemes, and architecture to meet the requirements of a wide range of regulatory, commercial and industrial use cases. However, experimentally driven research aiming to assess the real-world performance of 5G positioning is still lagging behind, root causes being (i) the slow integration of positioning technologies in open-source 5G frameworks, (ii) the complexity in setting up and properly configuring a 5G positioning testbed, and (iii) the cost of a multi-BS deployment. This paper sheds some light on all such aspects. After a brief overview of state of the art in 5G positioning and its support in open-source platforms based on software-defined radios (SDRs), we provide advice on how to set up positioning testbeds, and we demonstrate, via a set of real-world measurements, how to assess aspects such as reference signal configurations, localization algorithms, and network deployments. Our contribution further includes an assessment of the efficacy of utilizing measurements obtained from a single-link limited-size testbed to forecast localization performance in more elaborate (and hence more expensive) multi-node network settings. We posit that our methodological insights can assist in lowering the entry cost barriers associated with conducting 5G positioning experiments and, consequently, promote additional experimental research in this domain.</p></div>","PeriodicalId":50761,"journal":{"name":"Annals of Telecommunications","volume":"79 5-6","pages":"301 - 313"},"PeriodicalIF":1.8,"publicationDate":"2023-09-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s12243-023-00987-2.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135436293","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":"Semi-blind AF transmission in secure NOMA systems","authors":"Wided Hadj Alouane","doi":"10.1007/s12243-023-00989-0","DOIUrl":"10.1007/s12243-023-00989-0","url":null,"abstract":"<div><p>In the wireless channel state information (CSI)-assisted amplify-and-forward (AF) networks, an instantaneous CSI of the first hop is required to scale the amplification gain. However, the deployment of instantaneous CSI always remains difficult in real applications because it increases the CSI overhead and causes resources wastage such as power and bandwidth. In order to reduce the CSI overhead and the system complexity, we suggest the integration of semi-blind relay in secure non-orthogonal multiple access (NOMA) systems where only a statistical CSI of the first hop is used to generate the amplification gain. This paper addresses the performance analysis of the secure semi-blind AF-NOMA (S-SBAF-NOMA) schemes in which the base station communicates with a pair of users via a semi-blind relay node in the presence of one eavesdropper. First, we provide the expressions for the end-to-end signal-to-noise ratio (SNR) at each receiver node. We then derive new analytical and asymptotic expressions for strictly positive secrecy capacity (SPSC) and secrecy outage probability (SOP). To ensure the exactness and the tractability of mathematical analysis, we provide some numerical results obtained through simulation rounds in Matlab, and we compare them with those of secure CSI-assisted AF-NOMA (S-CSIAF-NOMA) networks. Our results show that the proposed S-SBAF-NOMA scheme achieves comparable secrecy performance/same performance bounds as compared to S-CSIAF-NOMA scheme at the gain of a decrease in processing complexity and system overhead. Numerical results also demonstrate that S-SBAF-NOMA networks achieve superior secrecy performance for lower values of target data rates and SNR of the illegal link.</p></div>","PeriodicalId":50761,"journal":{"name":"Annals of Telecommunications","volume":"79 5-6","pages":"315 - 325"},"PeriodicalIF":1.8,"publicationDate":"2023-09-13","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135734358","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}
Mustafa Tüker, Emre Karakış, Müge Sayıt, Stuart Clayman
{"title":"Using packet trimming at the edge for in-network video quality adaption","authors":"Mustafa Tüker, Emre Karakış, Müge Sayıt, Stuart Clayman","doi":"10.1007/s12243-023-00981-8","DOIUrl":"10.1007/s12243-023-00981-8","url":null,"abstract":"<div><p>This paper describes the effects of running in-network quality adaption by trimming the packets of layered video streams at the edge. The video stream is transmitted using the BPP transport protocol, which is like UDP, but has been designed to be both amenable to trimming and to provide low-latency and high reliability. The traffic adaption uses the Packet Wash process of Big Packet Protocol (BPP) on the transmitted Scalable Video Coding (SVC) video streams as they pass through a network function which is BPP-aware and embedded at the edge. Our previous work has either demonstrated the use of Software Defined Networking (SDN) controllers to implement Packet Wash directly, or the use of a network function in the core of the network to do the same task. This paper presents our effort to deploy and evaluate such a process at the edge, highlighting the packet trimming algorithm and showing the packet trimming effects on the streams. We compare the performance of transmitting video using BPP and the Packet Wash trimming, against alternative transmission schemes, namely UDP and HTTP adaptive streaming (HAS), presenting a number of quality parameters. The results demonstrate that providing traffic engineering using in-network quality adaption using packet trimming, provides high quality at the receiver.</p></div>","PeriodicalId":50761,"journal":{"name":"Annals of Telecommunications","volume":"79 3-4","pages":"197 - 210"},"PeriodicalIF":1.8,"publicationDate":"2023-09-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s12243-023-00981-8.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135980414","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":"Two level data centric aggregation scheme for wireless sensor networks","authors":"Tahira Batool, Atiq Ahmed, Dominique Gaiti","doi":"10.1007/s12243-023-00984-5","DOIUrl":"10.1007/s12243-023-00984-5","url":null,"abstract":"<div><p>Wireless sensor networks (WSNs) sense and collect information from a desired phenomenon with the help of sensor nodes that have limited computational power, battery, and memory. Several data aggregation approaches are proposed to make the sensor networks energy-efficient, increasing the network’s lifetime by controlling data redundancy at aggregator nodes. Redundant data is suppressed before transmission to the sink. In this work, our aim is to enhance the network lifetime by efficiently utilizing the network’s energy through controlled data redundancy and minimizing data transmission to the sink. Data aggregation occurs in two steps: firstly, within clusters where the cluster-head serves as the aggregation point, and secondly, at a central point in the network where the gateway node acts as the aggregation point. Experiments demonstrate that our proposed approach yields better results compared to a benchmark clustering protocol in terms of network stability, the number of data packets transferred to the destination, energy dissipation of nodes, and overall network lifetime.</p></div>","PeriodicalId":50761,"journal":{"name":"Annals of Telecommunications","volume":"79 5-6","pages":"289 - 299"},"PeriodicalIF":1.8,"publicationDate":"2023-09-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"88306389","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}
Adel Salah Ould Khaoua, Abdelmadjid Boukra, Fella Bey
{"title":"On estimating the interest satisfaction ratio in IEEE 802.15.4-based named-data networks","authors":"Adel Salah Ould Khaoua, Abdelmadjid Boukra, Fella Bey","doi":"10.1007/s12243-023-00983-6","DOIUrl":"10.1007/s12243-023-00983-6","url":null,"abstract":"<div><p>Named-Data Networking (NDN) over Low Power and Lossy Networks (LLNs), employing IEEE 802.15.4 communication technology, is projected to provide native support for mobility and efficient content delivery for the emerging Internet of Things (IoT). While many interest forwarding strategies have been proposed for NDNs over LLNs, most existing studies have relied on software simulations to evaluate their performance due to the lack of analytical modeling tools. This paper introduces the first analytical model for estimating the Interest Satisfaction Ratio (ISR) in NDN over LLNs, which is a crucial metric for assessing the effectiveness of interest forwarding strategies. We develop the analytical model specifically for the broadcast forwarding strategy, which has been extensively studied due to its simplicity and ease of implementation. Simulation results confirm that the proposed model predicts the ISR with reasonable accuracy. The model is then used to elucidate the strong interaction between the CSMA/CA parameters of the IEEE 802.15.4 standard and the achieved ISR.</p></div>","PeriodicalId":50761,"journal":{"name":"Annals of Telecommunications","volume":"79 1-2","pages":"111 - 130"},"PeriodicalIF":1.8,"publicationDate":"2023-09-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"85790219","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 congestion control method for sending safety messages to vehicles at a set target distance","authors":"Kai Takahashi, Shigeo Shioda","doi":"10.1007/s12243-023-00986-3","DOIUrl":"10.1007/s12243-023-00986-3","url":null,"abstract":"<div><p>In the present paper, we propose a method for controlling the interval of safety message transmissions in a fully distributed manner that maximizes the number of successful transmissions to vehicles located a set target distance away. In the proposed method, each vehicle estimates the density of vehicles in its vicinity, and, based on the estimated vehicle density, each vehicle calculates an optimal message transmission interval in order to maximize the number of successful message transmissions to vehicles located a set target distance away. The optimal message transmission interval can be analytically obtained as a simple expression when it is assumed that the vehicles are positioned according to a two-dimensional Poisson point process, which is appropriate for downtown scenarios. In addition, we propose two different methods for a vehicle by which to estimate the density of other vehicles in its vicinity. The first method is based on the measured channel busy ratio, and the second method relies on counting the number of distinct IDs of vehicles in the vicinity. We validate the effectiveness of the proposed methods using several simulations.</p></div>","PeriodicalId":50761,"journal":{"name":"Annals of Telecommunications","volume":"79 3-4","pages":"211 - 225"},"PeriodicalIF":1.8,"publicationDate":"2023-09-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"135255072","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}
Roman-Valentyn Tkachuk, Dragos Ilie, Remi Robert, Victor Kebande, Kurt Tutschku
{"title":"On the performance and scalability of consensus mechanisms in privacy-enabled decentralized renewable energy marketplace","authors":"Roman-Valentyn Tkachuk, Dragos Ilie, Remi Robert, Victor Kebande, Kurt Tutschku","doi":"10.1007/s12243-023-00973-8","DOIUrl":"10.1007/s12243-023-00973-8","url":null,"abstract":"<div><p>Renewable energy sources were introduced as an alternative to fossil fuel sources to make electricity generation cleaner. However, today’s renewable energy markets face a number of limitations, such as inflexible pricing models and inaccurate consumption information. These limitations can be addressed with a decentralized marketplace architecture. Such architecture requires a mechanism to guarantee that all marketplace operations are executed according to predefined rules and regulations. One of the ways to establish such a mechanism is blockchain technology. This work defines a decentralized blockchain-based peer-to-peer (P2P) energy marketplace which addresses actors’ privacy and the performance of consensus mechanisms. The defined marketplace utilizes private permissioned Ethereum-based blockchain client Hyperledger Besu (HB) and its smart contracts to automate the P2P trade settlement process. Also, to make the marketplace compliant with energy trade regulations, it includes the regulator actor, which manages the issue and consumption of guarantees of origin and certifies the renewable energy sources used to generate traded electricity. Finally, the proposed marketplace incorporates privacy-preserving features, allowing it to generate private transactions and store them within a designated group of actors. Performance evaluation results of HB-based marketplace with three main consensus mechanisms for private networks, i.e., Clique, IBFT 2.0, and QBFT, demonstrate a lower throughput than another popular private permissioned blockchain platform Hyperledger Fabric (HF). However, the lower throughput is a side effect of the Byzantine Fault Tolerant characteristics of HB’s consensus mechanisms, i.e., IBFT 2.0 and QBFT, which provide increased security compared to HF’s Crash Fault Tolerant consensus RAFT.</p></div>","PeriodicalId":50761,"journal":{"name":"Annals of Telecommunications","volume":"79 3-4","pages":"271 - 288"},"PeriodicalIF":1.8,"publicationDate":"2023-09-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s12243-023-00973-8.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"81507377","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}
Mays AL-Naday, Vlad Dobre, Martin Reed, Salman Toor, Bruno Volckaert, Filip De Turck
{"title":"Federated deep Q-learning networks for service-based anomaly detection and classification in edge-to-cloud ecosystems","authors":"Mays AL-Naday, Vlad Dobre, Martin Reed, Salman Toor, Bruno Volckaert, Filip De Turck","doi":"10.1007/s12243-023-00977-4","DOIUrl":"10.1007/s12243-023-00977-4","url":null,"abstract":"<div><p>The diversity of services and infrastructure in metropolitan edge-to-cloud network(s) is rising to unprecedented levels. This is causing a rising threat of a wider range of cyber attacks coupled with a growing integration of a constrained range of infrastructure, particularly seen at the network edge. Deep reinforcement-based learning is an attractive approach to detecting attacks, as it allows less dependency on labeled data with better ability to classify different attacks. However, current approaches to learning are known to be computationally expensive (cost), and the learning experience can be negatively impacted by the presence of outliers and noise (quality). This work tackles both the cost and quality challenges with a novel service-based federated deep reinforcement learning solution, enabling anomaly detection and attack classification at a reduced data cost and with better quality. The federated settings in the proposed approach enable multiple edge units to create clusters that follow a bottom-up learning approach. The proposed solution adapts a deep Q-learning network (DQN) for service-tunable flow classification and introduces a novel federated DQN (FDQN) for federated learning. Through such targeted training and validation, variation in data patterns and noise is reduced. This leads to improved performance per service with lower training cost. Performance and cost of the solution, along with sensitivity to exploration parameters, are evaluated using examples of publicly available datasets (UNSW-NB15 and CIC-IDS2018). Evaluation results show the proposed solution to maintain detection accuracy in the range of ≈75–85% with lower data supply while improving the classification rate by a factor of ≈2.</p></div>","PeriodicalId":50761,"journal":{"name":"Annals of Telecommunications","volume":"79 3-4","pages":"165 - 178"},"PeriodicalIF":1.8,"publicationDate":"2023-08-31","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://link.springer.com/content/pdf/10.1007/s12243-023-00977-4.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"80695695","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}
Esma Aïmeur, Maryline Laurent, Reda Yaich, Benoît Dupont, Frédéric Cuppens
{"title":"Foreword of the special issue on « FPS 2021» symposium","authors":"Esma Aïmeur, Maryline Laurent, Reda Yaich, Benoît Dupont, Frédéric Cuppens","doi":"10.1007/s12243-023-00988-1","DOIUrl":"10.1007/s12243-023-00988-1","url":null,"abstract":"","PeriodicalId":50761,"journal":{"name":"Annals of Telecommunications","volume":"78 7-8","pages":"383 - 383"},"PeriodicalIF":1.9,"publicationDate":"2023-08-29","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"50522641","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}