Journal of Communications and Networks最新文献_第9页

Network resource allocation method based on blockchain and federated learning in IoT 物联网中基于区块链和联合学习的网络资源分配方法

IF 3.6 3区计算机科学

Journal of Communications and Networks Pub Date : 2024-04-01 DOI: 10.23919/JCN.2024.000007

Hui Zhi;Yaning Wang

{"title":"Network resource allocation method based on blockchain and federated learning in IoT","authors":"Hui Zhi;Yaning Wang","doi":"10.23919/JCN.2024.000007","DOIUrl":"https://doi.org/10.23919/JCN.2024.000007","url":null,"abstract":"Virtual network embedding (VNE) is an effective approach to solve the resource allocation problem in IoT networks. But most existing VNE methods are centralized methods, they not only impose an excessive burden on the central server but also result in significant communication overhead. Therefore, this paper proposes a distributed resource allocation method based on federated learning (DRAM-FL) to alleviate the computing and communication overhead, and improve network resource utilization. When utilizing DRAM-FL, it is essential to address the security challenges arising from the unreliable nature of IoT devices. So, we introduce blockchain into DRAM-FL, and propose a distributed resource allocation method based on blockchain and federated learning (DRAM-BFL). In DRAM-BFL, a dual-chain structure is designed to facilitate reliable information exchange among nodes, a node reliability assessment method and EPBFT-NRA consensus algorithm are proposed to improve the security of VNE. Simulation results demonstrate that, compared with other methods, DRAM-BFL can increase the VN acceptance rate and long-term average revenue-to-expenditure ratio while improving system security. In addition, DRAM-BFL exhibits good scalability, and has superior throughput and delay performance in IoT with malicious nodes.","PeriodicalId":54864,"journal":{"name":"Journal of Communications and Networks","volume":"26 2","pages":"225-238"},"PeriodicalIF":3.6,"publicationDate":"2024-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10522527","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140880768","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Distributed IIoT anomaly detection scheme based on blockchain and federated learning 基于区块链和联合学习的分布式物联网异常检测方案

IF 3.6 3区计算机科学

Journal of Communications and Networks Pub Date : 2024-04-01 DOI: 10.23919/JCN.2024.000016

Xiaojun Jin;Chao Ma;Song Luo;Pengyi Zeng;Yifei Wei

{"title":"Distributed IIoT anomaly detection scheme based on blockchain and federated learning","authors":"Xiaojun Jin;Chao Ma;Song Luo;Pengyi Zeng;Yifei Wei","doi":"10.23919/JCN.2024.000016","DOIUrl":"https://doi.org/10.23919/JCN.2024.000016","url":null,"abstract":"Anomaly detection in the industrial internet of things (IIoT) devices is significant due to its fundamental role in protecting modern critical infrastructure. In the IIoT, anomaly detection can be carried out by training machine learning models. Data sharing between factories can expand the data from which the model is trained, thus improving the performance of the model. However, due to the sensitivity and privacy of IIoT data, it is also difficult to build a high-performance anomaly detection model between factories. To address this problem, we design an anomaly detection method for IIoT devices combined blockchain of main-side structure and federated learning. We store the global model on the main-chain while the side-chain records the hash value of the global models and local models, which updated by participating nodes, controlling nodes access to the global model through the main-side blockchain and the smart contracts. Only the nodes participating in the current federated learning training can get the latest global model, so as to encourage the nodes to take part in the training of the global model. We designed a proof of accuracy consensus algorithm, and select the nodes to participate in training according to the accuracy of the local model on the test dataset to resist the poisoning attack of the models. We also use the local differential privacy (LDP) algorithm to protect user data privacy from model inference attacks by adding noise to the local model. Finally, we propose a new algorithm named Fed_Acc to keep the accuracy of the global model stable when the users add a lot of noise to their local models.","PeriodicalId":54864,"journal":{"name":"Journal of Communications and Networks","volume":"26 2","pages":"252-262"},"PeriodicalIF":3.6,"publicationDate":"2024-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10522517","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140880789","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Fatal C-V2X denial-of-service attack degrading quality of service in a highway scenario 高速公路场景中降低服务质量的致命 C-V2X 拒绝服务攻击

IF 3.6 3区计算机科学

Journal of Communications and Networks Pub Date : 2024-03-11 DOI: 10.23919/JCN.2023.000066

Kyungtae Kim;Dongyoon Kwon;Woo-Cheol Jin;Sinuk Choi;Jinmo Kim;Ji-Woong Choi

{"title":"Fatal C-V2X denial-of-service attack degrading quality of service in a highway scenario","authors":"Kyungtae Kim;Dongyoon Kwon;Woo-Cheol Jin;Sinuk Choi;Jinmo Kim;Ji-Woong Choi","doi":"10.23919/JCN.2023.000066","DOIUrl":"https://doi.org/10.23919/JCN.2023.000066","url":null,"abstract":"A denial-of-service (DoS) attack, which prevents other nodes from accessing resources, is one of the fatal security threats in the V2X field. This paper analyzes the DoS attack on C-V2X networks from various viewpoints. First, we derive the conditions for the vulnerable vehicle that are expected to suffer fatal damage when subjected to the DoS attack. Then, we provide a method for the attacker to identify the vulnerable vehicle satisfying the derived conditions. We also verify that the attacker can more easily identify the vulnerable vehicle on a highway where the traffic density is generally constant. We confirm that the DoS attack that attacks the vulnerable vehicle satisfying the derived conditions causes more damage than the conventional DoS attack provided in another study in terms of reliability, coverage, and timeliness (up to 2% reduction in packet delivery ratio, up to 30 m reduction in communication coverage, and 0.15-second increase in the lower 1% update delay). In addition, we compare the ratio of packet errors by MAC of C-V2X to those caused by the DoS attack and verify the lethality of an attack depending on the traffic density. This paper provides insight into DoS attacks on C-V2X network, and future studies will cover the topic of attack detection and defense.","PeriodicalId":54864,"journal":{"name":"Journal of Communications and Networks","volume":"26 2","pages":"182-192"},"PeriodicalIF":3.6,"publicationDate":"2024-03-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10466704","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140880723","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

In-vehicle network latency analysis for a lane keeping assistance system 车道保持辅助系统的车载网络延迟分析

IF 3.6 3区计算机科学

Journal of Communications and Networks Pub Date : 2024-03-11 DOI: 10.23919/JCN.2023.000064

Sinuk Choi;Hoseung Song;Eunmin Choi;Jeong-Woo Seo;Ji-Woong Choi

{"title":"In-vehicle network latency analysis for a lane keeping assistance system","authors":"Sinuk Choi;Hoseung Song;Eunmin Choi;Jeong-Woo Seo;Ji-Woong Choi","doi":"10.23919/JCN.2023.000064","DOIUrl":"https://doi.org/10.23919/JCN.2023.000064","url":null,"abstract":"Due to the rapid advancements in automotive technologies, vehicles now rely on additional high-speed sensors. This development has led to an increase in transmission rates and traffic levels within in-vehicle networks (IVNs), thereby necessitating changes in the electrical/electronic (E/E) architecture and the emergence of next-generation IVNs. This paper explores the adoption of zonal architecture with an Ethernet backbone as the vehicle topology and analyzes the factors influencing end-to-end latency. Furthermore, to evaluate the impact of IVN latency on safety-critical applications, we adopted the lane-keeping assistance system (LKAS) and employed the widely used metric, lateral error distance, to analyze how much the vehicle deviates from its intended position. We determined the feasibility of LKAS support by establishing vehicle-specific lateral distance thresholds, as allowable lateral error distances vary depending on vehicle size and comparing them with the lateral error distance. Since LKAS demands higher resolutions to achieve enhanced accuracy, this study examines the required resolution for vehicles equipped with next-generation architectures. Additionally, the paper proposes guidelines for the compression ratio of camera sensors at various resolutions and determines the maximum lateral vehicle speed achievable.","PeriodicalId":54864,"journal":{"name":"Journal of Communications and Networks","volume":"26 2","pages":"262-272"},"PeriodicalIF":3.6,"publicationDate":"2024-03-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10466697","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140880783","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

State-dependent broadcast channels with reversible input constraints 具有可逆输入约束条件的状态相关广播信道

IF 3.6 3区计算机科学

Journal of Communications and Networks Pub Date : 2024-03-11 DOI: 10.23919/JCN.2023.000045

Viswanathan Ramachandran

引用次数: 0

NetLabeller: Architecture with data extraction and labelling framework for beyond 5G networks NetLabeller：超越 5G 网络的数据提取和标签框架架构

IF 3.6 3区计算机科学

Journal of Communications and Networks Pub Date : 2024-02-01 DOI: 10.23919/JCN.2023.000063

Jimena Andrade-Hoz;Jose M. Alcaraz-Calero;Qi Wang

{"title":"NetLabeller: Architecture with data extraction and labelling framework for beyond 5G networks","authors":"Jimena Andrade-Hoz;Jose M. Alcaraz-Calero;Qi Wang","doi":"10.23919/JCN.2023.000063","DOIUrl":"https://doi.org/10.23919/JCN.2023.000063","url":null,"abstract":"The next generation of network capabilities coupled with artificial intelligence (AI) can provide innovative solutions for network control and self-optimisation. Network control demands a detailed knowledge of the network components to enforce the correct control rules. To this end, an immense number of metrics related to devices, flows, network rules, etc. can be used to describe the state of the network and to gain insights about which rule to enforce depending on the context. However, selection of the most relevant metrics often proves challenging and there is no readily available tool that can facilitate the dataset extraction and labelling for AI model training. This research work therefore first develops an analysis of the most relevant metrics in terms of network control to create a training dataset for future AI development purposes. It then presents a new architecture to allow the extraction of these metrics from a 5G network with a novel dataset visualisation and labelling tool to help perform the exploratory analysis and the labelling process of the resultant dataset. It is expected that the proposed architecture and its associated tools would significantly speed up the training process, which is crucial for the data-driven approach in developing AI-based network control capabilities.","PeriodicalId":54864,"journal":{"name":"Journal of Communications and Networks","volume":"26 1","pages":"80-98"},"PeriodicalIF":3.6,"publicationDate":"2024-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10459140","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140031620","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

IF 3.6 3区计算机科学

Journal of Communications and Networks Pub Date : 2024-02-01 DOI: 10.23919/JCN.2023.000054

Ruisi Wu;Wen-Kang Jia

{"title":"A popularity-based caching strategy for improved efficiency in SVRF-based multicast control-planes","authors":"Ruisi Wu;Wen-Kang Jia","doi":"10.23919/JCN.2023.000054","DOIUrl":"https://doi.org/10.23919/JCN.2023.000054","url":null,"abstract":"The packet forwarding engine (PFE), a vital component of high-performance switches and routers, plays a pivotal role in rapidly selecting the appropriate output port for tens of thousands of packets. The performance of the PFE hinges on the efficacy of the group membership algorithm. In this research, we present a hybrid approach called caching scalar-pair and vectors routing and forwarding (CSVRF), which comprises virtual output port bitmap caching (VOPBC) and fractional-N SVRF, designed to address significant multicast forwarding challenges such as scalability. We achieve this through the implementation of content address memory (CAM). Within the CSVRF framework, we introduce an innovative virtual output port bitmap cache table, which encompasses the most frequently occurring combinations of output port bitmaps (OPB). Furthermore, we divide the larger scalar-pair into N subgroups to enhance the reusability of prime resources. We validate our findings using Matlab-based mathematical models and simulations. Our results demonstrate significant decreases in both memory space usage and forwarding latency. Our approach assures minimized memory consumption, faster processing, and robust scalability in high port-density settings.","PeriodicalId":54864,"journal":{"name":"Journal of Communications and Networks","volume":"26 1","pages":"115-130"},"PeriodicalIF":3.6,"publicationDate":"2024-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10459134","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140031680","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Information for authors 作者须知

IF 3.6 3区计算机科学

Journal of Communications and Networks Pub Date : 2024-02-01 DOI: 10.23919/JCN.2024.000009

引用次数: 0

Statistical analysis of cascaded Nakagami-m fading channels with generalized correlation 具有广义相关性的级联中上消隐信道的统计分析

IF 3.6 3区计算机科学

Journal of Communications and Networks Pub Date : 2024-02-01 DOI: 10.23919/JCN.2024.000001

Ibrahim Ghareeb;Osama Al-Shalali

{"title":"Statistical analysis of cascaded Nakagami-m fading channels with generalized correlation","authors":"Ibrahim Ghareeb;Osama Al-Shalali","doi":"10.23919/JCN.2024.000001","DOIUrl":"https://doi.org/10.23919/JCN.2024.000001","url":null,"abstract":"This paper studies the statistical analysis of cascaded Nakagami-m fading channels that are arbitrarily correlated and not necessarily identically distributed. The probability density function (PDF), cumulative distribution function (CDF), and the nth moment for the product of N correlated Nakagami-m random variables (RVs) are derived and presented in exact form expressions using the Meijer's G function. The cascaded channels are assumed to have flat and slow fading with arbitrarily non-identical fading severity parameters. Using these results, the impact of channel correlation and fading severity parameters are investigated for the cascaded Nakagami-m channels. Furthermore, performance analysis addressed by outage probability (OP), average channel capacity, and average bit error probability (BEP) for coherently detected binary PSK and FSK signals are derived. As a consequence of the versatility of Nakagami-m distribution, the derived expressions can compromise the statistics of other useful multivariate distributions such as One-sided Gaussian distribution with m = 1/2 and Rayleigh distribution with m = 1. To the best of the authors' knowledge, the derived expressions are novel and have not been reported in the literature. To aid and verify the theoretical analysis, numerical results authenticated by Monte Carlo simulation are presented.","PeriodicalId":54864,"journal":{"name":"Journal of Communications and Networks","volume":"26 1","pages":"1-18"},"PeriodicalIF":3.6,"publicationDate":"2024-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10459136","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140031708","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0

Analyzing age of information in multiaccess networks with time-varying channels: A fluid limits approach 分析具有时变信道的多接入网络中的信息年龄：流体极限方法

IF 3.6 3区计算机科学

Journal of Communications and Networks Pub Date : 2024-02-01 DOI: 10.23919/JCN.2024.000003

Feng Yuan;Zeyu Hu;Zhiyuan Jiang

{"title":"Analyzing age of information in multiaccess networks with time-varying channels: A fluid limits approach","authors":"Feng Yuan;Zeyu Hu;Zhiyuan Jiang","doi":"10.23919/JCN.2024.000003","DOIUrl":"https://doi.org/10.23919/JCN.2024.000003","url":null,"abstract":"In this paper, we adopt the fluid limits approach to analyze the age of information (AoI) in a wireless multi-access network where users share the channel and transmissions are unreliable. We prove the convergence of the AoI occupancy measure to the fluid limit, represented by a partial differential equation (PDE). Furthermore, we demonstrate the global convergence to the equilibrium of the PDE, i.e., the stationary AoI distribution. Within this framework, we first consider the case of i.i.d. channel conditions and generate-at-will statuses for users. We demonstrate that a previously established AoI lower bound in the literature is asymptotically accurate, and a straightforward threshold-based access policy can be asymptotically optimal. Next, we consider the case where the channel states are time-varying, i.e., the Gilbert-Elliott channel model. We assume partial channel state information (CSI) is available due to channel probing singals. Theoretical analysis reveals that only a fraction of CSI is required to approach the optimal performance. Additionally, we numerically evaluate the performance of the proposed policy and the existing Whittle's index policy under time-varying channels. Simulation results demonstrate that the proposed policy outperforms the Whittle's index policy since the latter cannot adapt to time-varying channels.","PeriodicalId":54864,"journal":{"name":"Journal of Communications and Networks","volume":"26 1","pages":"49-64"},"PeriodicalIF":3.6,"publicationDate":"2024-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10459132","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140031706","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":3,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}

引用次数: 0