Annals of Telecommunications最新文献_第8页

Distributed congestion control method for sending safety messages to vehicles at a set target distance 向设定目标距离的车辆发送安全信息的分布式拥堵控制方法

IF 1.8 4区计算机科学

Annals of Telecommunications Pub Date : 2023-09-05 DOI: 10.1007/s12243-023-00986-3

Kai Takahashi, Shigeo Shioda

{"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}

引用次数: 0

On the performance and scalability of consensus mechanisms in privacy-enabled decentralized renewable energy marketplace 共识机制在支持隐私的分散式可再生能源市场中的性能和可扩展性

IF 1.8 4区计算机科学

Annals of Telecommunications Pub Date : 2023-09-02 DOI: 10.1007/s12243-023-00973-8

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}

引用次数: 0

Federated deep Q-learning networks for service-based anomaly detection and classification in edge-to-cloud ecosystems 用于边缘到云生态系统中基于服务的异常检测和分类的联合深度 Q-learning 网络

IF 1.8 4区计算机科学

Annals of Telecommunications Pub Date : 2023-08-31 DOI: 10.1007/s12243-023-00977-4

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}

引用次数: 0

Foreword of the special issue on « FPS 2021» symposium 《FPS 2021》专题研讨会前言

IF 1.9 4区计算机科学

Annals of Telecommunications Pub Date : 2023-08-29 DOI: 10.1007/s12243-023-00988-1

Esma Aïmeur, Maryline Laurent, Reda Yaich, Benoît Dupont, Frédéric Cuppens

引用次数: 0

Publisher Correction: Towards programmable IoT with ActiveNDN 出版商更正：利用 ActiveNDN 实现可编程物联网

IF 1.9 4区计算机科学

Annals of Telecommunications Pub Date : 2023-08-19 DOI: 10.1007/s12243-023-00985-4

引用次数: 0

Automated slow-start detection for anomaly root cause analysis and BBR identification 自动慢速启动检测，用于异常根源分析和 BBR 识别

IF 1.8 4区计算机科学

Annals of Telecommunications Pub Date : 2023-08-18 DOI: 10.1007/s12243-023-00982-7

Ziad Tlaiss, Alexandre Ferrieux, Isabel Amigo, Isabelle Hamchaoui, Sandrine Vaton

{"title":"Automated slow-start detection for anomaly root cause analysis and BBR identification","authors":"Ziad Tlaiss, Alexandre Ferrieux, Isabel Amigo, Isabelle Hamchaoui, Sandrine Vaton","doi":"10.1007/s12243-023-00982-7","DOIUrl":"10.1007/s12243-023-00982-7","url":null,"abstract":"<div><p>Network troubleshooting usually requires packet level traffic capturing and analyzing. Indeed, the observation of emission patterns sheds some light on the kind of degradation experienced by a connection. In the case of reliable transport traffic where congestion control is performed, such as TCP and QUIC traffic, these patterns are the fruit of decisions made by the congestion control algorithm (CCA), according to its own perception of network conditions. The CCA estimates the bottleneck’s capacity via an exponential probing, during the so-called “Slow-Start” (SS) state. The bottleneck is considered reached upon reception of congestion signs, typically lost packets or abnormal packet delays depending on the version of CCA used. The SS state duration is thus a key indicator for the diagnosis of faults; this indicator is estimated empirically by human experts today, which is time-consuming and a cumbersome task with large error margins. This paper proposes a method to automatically identify the slow-start state from actively and passively obtained bidirectional packet traces. It relies on an innovative timeless representation of the observed packets series. We implemented our method in our active and passive probes and tested it with CUBIC and BBR under different network conditions. We then picked a few real-life examples to illustrate the value of our representation for easy discrimination between typical faults and for identifying BBR among CCAs variants.</p></div>","PeriodicalId":50761,"journal":{"name":"Annals of Telecommunications","volume":"79 3-4","pages":"149 - 163"},"PeriodicalIF":1.8,"publicationDate":"2023-08-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"78189579","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

Generative AI in mobile networks: a survey 移动网络中的生成式人工智能：一项调查

IF 1.8 4区计算机科学

Annals of Telecommunications Pub Date : 2023-08-17 DOI: 10.1007/s12243-023-00980-9

Athanasios Karapantelakis, Pegah Alizadeh, Abdulrahman Alabassi, Kaushik Dey, Alexandros Nikou

引用次数: 0

A game-theoretical paradigm for collaborative and distributed power control in wireless networks 无线网络中协作和分布式功率控制的博弈论范式

IF 1.8 4区计算机科学

Annals of Telecommunications Pub Date : 2023-08-14 DOI: 10.1007/s12243-023-00976-5

Duc-Tuyen Ta, Nhan Nguyen-Thanh, Duy H. N. Nguyen, Van-Tam Nguyen

{"title":"A game-theoretical paradigm for collaborative and distributed power control in wireless networks","authors":"Duc-Tuyen Ta, Nhan Nguyen-Thanh, Duy H. N. Nguyen, Van-Tam Nguyen","doi":"10.1007/s12243-023-00976-5","DOIUrl":"10.1007/s12243-023-00976-5","url":null,"abstract":"<div><p>The wireless revolution requires future wireless networks the capability of intelligently optimizing the spectrum by collaborating and using autonomy to determine not just the best use of the spectrum for its own system, but the best use of spectrum for other systems that share the same spectrum bands. How to develop the wireless paradigm of collaboration, therefore, is a crucial question. In this paper, we discuss how to model collaborative power control in a wireless interference network, where users share the same frequency band. By collaborating with other users, each user exchanges information to maximize not only its own performance but also others’ performances. A game theory framework is developed to determine the optimal power allocation. The proposed framework possesses several advantages over conventional methods, such as low complexity and fast converging algorithmic solutions, distributed implementation, and better user fairness. Simulation results state the proposed approach provides better fairness between users’ data rates, higher performance in the aggregate rate, and lower convergence time.</p></div>","PeriodicalId":50761,"journal":{"name":"Annals of Telecommunications","volume":"79 1-2","pages":"1 - 14"},"PeriodicalIF":1.8,"publicationDate":"2023-08-14","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"84874472","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

Cooperative localisation for multi-RSU vehicular networks based on predictive beamforming 基于预测波束成形的多 RSU 车辆网络协同定位

IF 1.8 4区计算机科学

Annals of Telecommunications Pub Date : 2023-08-11 DOI: 10.1007/s12243-023-00974-7

Changhong Yu, Zhong Ye, Yinghui He, Ming Gao, Haiyan Luo, Guanding Yu

{"title":"Cooperative localisation for multi-RSU vehicular networks based on predictive beamforming","authors":"Changhong Yu, Zhong Ye, Yinghui He, Ming Gao, Haiyan Luo, Guanding Yu","doi":"10.1007/s12243-023-00974-7","DOIUrl":"10.1007/s12243-023-00974-7","url":null,"abstract":"<div><p>The integration of sensing and communication has become essential to next-generation vehicular networks. In this paper, we investigate a vehicle-to-infrastructure (V2I) network with multiple roadside units (RSUs) based on the dual-functional radar-communication (DFRC) technique. Since there are multiple RSUs in the system, we first propose a signal-switching model between vehicles and different RSUs. These RSUs estimate and predict vehicles’ motion parameters based on the DFRC signal echoes and the state evolution model. Accordingly, we utilise a neural network to extract angle information from signal echoes instead of traditional methods, thus improving the angle estimation accuracy. To further improve the estimation performance, we formulate an optimisation problem to minimise the Cramer-Rao bound (CRB) on angle estimation by properly allocating power to each RSU. Finally, we propose a novel weighting method to further improve the cooperative localisation accuracy of the multi-RSU system. Simulation results show that the performance of angle estimation can be improved by utilising the proposed neural network method and the novel power allocation scheme. In addition, the novel weighting method can considerably improve the localisation accuracy.</p></div>","PeriodicalId":50761,"journal":{"name":"Annals of Telecommunications","volume":"79 1-2","pages":"85 - 100"},"PeriodicalIF":1.8,"publicationDate":"2023-08-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"87646195","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 low-complexity iterative algorithm for multiuser millimeter-wave systems 多iuser 毫米波系统的低复杂度迭代算法

IF 1.8 4区计算机科学

Annals of Telecommunications Pub Date : 2023-08-02 DOI: 10.1007/s12243-023-00979-2

Mustafa Mulla, Ali Hakan Ulusoy, Ahmet Rizaner, Hasan Amca

引用次数: 0