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.
{"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}
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.
阻止其他节点访问资源的拒绝服务（DoS）攻击是 V2X 领域致命的安全威胁之一。本文从多个角度分析了对 C-V2X 网络的 DoS 攻击。首先，我们得出了易受攻击车辆在遭受 DoS 攻击时预计会遭受致命破坏的条件。然后，我们提供了一种方法，供攻击者识别满足推导条件的易受攻击车辆。我们还验证了在交通密度基本恒定的高速公路上，攻击者更容易识别易受攻击的车辆。我们证实，攻击满足推导条件的易受攻击车辆的 DoS 攻击在可靠性、覆盖范围和及时性方面比另一项研究中提供的传统 DoS 攻击造成的破坏更大（数据包传递率减少达 2%，通信覆盖范围减少达 30 米，低 1%更新延迟增加 0.15 秒）。此外，我们还比较了 C-V2X 的 MAC 与 DoS 攻击造成的数据包错误比率，并验证了攻击的致命性取决于流量密度。本文深入探讨了 C-V2X 网络的 DoS 攻击，未来的研究将涵盖攻击检测和防御主题。
{"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}
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.
{"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}
Pub Date : 2024-03-11DOI: 10.23919/JCN.2023.000045
Viswanathan Ramachandran
A joint message communication and input reconstruction problem over a two-user state-dependent degraded discrete-memoryless broadcast channel is considered. The state process is assumed to be independent and identically distributed (i.i.d.), and known non-causally at the transmitter as well as the non-degraded receiver. The two receivers have to decode the messages from the transmitter, while the degraded receiver also needs to estimate the channel input codeword to meet a prescribed distortion limit. A complete characterization of the optimal rates versus distortion performance is provided. The tight characterization is also illustrated by means of an example of an additive binary broadcast channel with a Hamming distortion constraint for the input reconstruction at the degraded receiver.
{"title":"State-dependent broadcast channels with reversible input constraints","authors":"Viswanathan Ramachandran","doi":"10.23919/JCN.2023.000045","DOIUrl":"https://doi.org/10.23919/JCN.2023.000045","url":null,"abstract":"A joint message communication and input reconstruction problem over a two-user state-dependent degraded discrete-memoryless broadcast channel is considered. The state process is assumed to be independent and identically distributed (i.i.d.), and known non-causally at the transmitter as well as the non-degraded receiver. The two receivers have to decode the messages from the transmitter, while the degraded receiver also needs to estimate the channel input codeword to meet a prescribed distortion limit. A complete characterization of the optimal rates versus distortion performance is provided. The tight characterization is also illustrated by means of an example of an additive binary broadcast channel with a Hamming distortion constraint for the input reconstruction at the degraded receiver.","PeriodicalId":54864,"journal":{"name":"Journal of Communications and Networks","volume":"26 2","pages":"158-165"},"PeriodicalIF":3.6,"publicationDate":"2024-03-11","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10466682","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140880785","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}
Pub Date : 2024-02-01DOI: 10.23919/JCN.2023.000063
Jimena Andrade-Hoz;Jose M. Alcaraz-Calero;Qi Wang
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.
{"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}
Pub Date : 2024-02-01DOI: 10.23919/JCN.2023.000054
Ruisi Wu;Wen-Kang Jia
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.
{"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}
Pub Date : 2024-02-01DOI: 10.23919/JCN.2024.000009
{"title":"Information for authors","authors":"","doi":"10.23919/JCN.2024.000009","DOIUrl":"https://doi.org/10.23919/JCN.2024.000009","url":null,"abstract":"","PeriodicalId":54864,"journal":{"name":"Journal of Communications and Networks","volume":"26 1","pages":"148-152"},"PeriodicalIF":3.6,"publicationDate":"2024-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10459128","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140031682","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}
Pub Date : 2024-02-01DOI: 10.23919/JCN.2024.000001
Ibrahim Ghareeb;Osama Al-Shalali
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.
本文研究了任意相关且不一定同分布的级联中上-m 渐变信道的统计分析。利用 Meijer's G 函数推导出了 N 个相关 Nakagami-m 随机变量（RV）乘积的概率密度函数（PDF）、累积分布函数（CDF）和第 n 矩，并以精确形式表达出来。级联信道被假定为具有任意非相同衰减严重性参数的平缓衰减。利用这些结果，研究了级联中上-m 信道的信道相关性和衰落严重性参数的影响。此外，还得出了相干检测二进制 PSK 和 FSK 信号的中断概率 (OP)、平均信道容量和平均误码概率 (BEP) 等性能分析。由于中神-m 分布的多功能性，推导出的表达式可以折中其他有用的多元分布的统计量，如 m = 1/2 的单边高斯分布和 m = 1 的瑞利分布。据作者所知，推导出的表达式是新颖的，在文献中从未报道过。为了帮助和验证理论分析，本文介绍了经蒙特卡罗模拟验证的数值结果。
{"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}
Pub Date : 2024-02-01DOI: 10.23919/JCN.2024.000003
Feng Yuan;Zeyu Hu;Zhiyuan Jiang
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.
{"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}
The future integration of software-defined network (SDN) with the service-oriented architecture (SOA) paradigm requires new solutions to ensure the quality of service (QoS) according to the users' requirements. The paper presents a user experience-centric approach to traffic engineering and QoS/quality of experience (QoE) support for service-oriented software-defined network (SOSDN) architecture. This approach is to enable end-to-end QoS across the networking and computing domain by monitoring and agreeing on the dynamic state of their functioning. The proposed SOSDN is based on improved traffic engineering techniques, such as adaptive prioritization of services, server selection, and QoS/QoE-based routing. The developed adaptive service prioritization algorithm automatically changes the priority of flows in the network operation mode by the SDN controller for individual users under the concluded service level agreements (SLA) contract. We proposed a mathematical model of correlation of user satisfaction level by QoE score with technical QoS parameters. This model is based on the normalized value of the integral additive QoS criterion. Accordingly, ensuring the ordered user-centric QoS/QoE is carried out by means of proposed multi-criteria adaptive routing of data flows, the metric of which is based on the integral additive QoS criterion. The simulation results showed that, in contrast to known practical solutions, the integrated use of the proposed method of adaptive multi-criteria routing and prioritization of data flows provides a high level of QoE required by users in the SOSDN paradigm.
{"title":"Traffic engineering and QoS/QoE supporting techniques for emerging service-oriented software-defined network","authors":"Mykola Beshley;Natalia Kryvinska;Halyna Beshley;Oleksiy Panchenko;Mykhailo Medvetskyi","doi":"10.23919/JCN.2023.000065","DOIUrl":"https://doi.org/10.23919/JCN.2023.000065","url":null,"abstract":"The future integration of software-defined network (SDN) with the service-oriented architecture (SOA) paradigm requires new solutions to ensure the quality of service (QoS) according to the users' requirements. The paper presents a user experience-centric approach to traffic engineering and QoS/quality of experience (QoE) support for service-oriented software-defined network (SOSDN) architecture. This approach is to enable end-to-end QoS across the networking and computing domain by monitoring and agreeing on the dynamic state of their functioning. The proposed SOSDN is based on improved traffic engineering techniques, such as adaptive prioritization of services, server selection, and QoS/QoE-based routing. The developed adaptive service prioritization algorithm automatically changes the priority of flows in the network operation mode by the SDN controller for individual users under the concluded service level agreements (SLA) contract. We proposed a mathematical model of correlation of user satisfaction level by QoE score with technical QoS parameters. This model is based on the normalized value of the integral additive QoS criterion. Accordingly, ensuring the ordered user-centric QoS/QoE is carried out by means of proposed multi-criteria adaptive routing of data flows, the metric of which is based on the integral additive QoS criterion. The simulation results showed that, in contrast to known practical solutions, the integrated use of the proposed method of adaptive multi-criteria routing and prioritization of data flows provides a high level of QoE required by users in the SOSDN paradigm.","PeriodicalId":54864,"journal":{"name":"Journal of Communications and Networks","volume":"26 1","pages":"99-114"},"PeriodicalIF":3.6,"publicationDate":"2024-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10459131","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140031619","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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：