Pub Date : 2024-04-01DOI: 10.23919/JCN.2024.000004
Benedetta Picano;Romano Fantacci
The advent of sixth-generation networks has given rise to numerous challenges, requiring the synergistic exploitation of both ground and air edge computing facilities. This paper considers an integrated ground-air edge computing scenario where the computation offloading of a set of delay sensitive tasks has to be performed in a context where ground and air computational facilities are already involved in monitoring and control proceduers in a remote area under an unpredictable overload of computation requests, e.g., related to the management of an emergency situation. In this reference, a matching game is proposed to assign tasks to the most suitable computation nodes, in order to minimize the outage probability of the newly arrived tasks, i.e., the probability with which tasks experience a completion time greater than the corresponding deadline. To this regard, we have considered that new allocated task suffer for a waiting time due to the time needed to complete the service of all the tasks already in the ground or air computation node. As a consequence, to statistically characterize such waiting time, under proper assumptions, we have resorted to the G/G/1 queuing system model and the Lindley's integral equation approach to define a suitable metric to formulate a tasks allocation procedure based on the matching theory. Furthermore, matching stability has been theoretically proved for the proposed approach. Finally, numerical results have been provided in order to highlight the better behavior of the proposed task allocation scheme in comparison with different state-of-the-art alternatives.
{"title":"An efficient tasks offloading procedure for an integrated edge-computing architecture","authors":"Benedetta Picano;Romano Fantacci","doi":"10.23919/JCN.2024.000004","DOIUrl":"https://doi.org/10.23919/JCN.2024.000004","url":null,"abstract":"The advent of sixth-generation networks has given rise to numerous challenges, requiring the synergistic exploitation of both ground and air edge computing facilities. This paper considers an integrated ground-air edge computing scenario where the computation offloading of a set of delay sensitive tasks has to be performed in a context where ground and air computational facilities are already involved in monitoring and control proceduers in a remote area under an unpredictable overload of computation requests, e.g., related to the management of an emergency situation. In this reference, a matching game is proposed to assign tasks to the most suitable computation nodes, in order to minimize the outage probability of the newly arrived tasks, i.e., the probability with which tasks experience a completion time greater than the corresponding deadline. To this regard, we have considered that new allocated task suffer for a waiting time due to the time needed to complete the service of all the tasks already in the ground or air computation node. As a consequence, to statistically characterize such waiting time, under proper assumptions, we have resorted to the G/G/1 queuing system model and the Lindley's integral equation approach to define a suitable metric to formulate a tasks allocation procedure based on the matching theory. Furthermore, matching stability has been theoretically proved for the proposed approach. Finally, numerical results have been provided in order to highlight the better behavior of the proposed task allocation scheme in comparison with different state-of-the-art alternatives.","PeriodicalId":54864,"journal":{"name":"Journal of Communications and Networks","volume":null,"pages":null},"PeriodicalIF":3.6,"publicationDate":"2024-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10522525","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140880786","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-04-01DOI: 10.23919/JCN.2024.000019
{"title":"Information for authors","authors":"","doi":"10.23919/JCN.2024.000019","DOIUrl":"https://doi.org/10.23919/JCN.2024.000019","url":null,"abstract":"","PeriodicalId":54864,"journal":{"name":"Journal of Communications and Networks","volume":null,"pages":null},"PeriodicalIF":3.6,"publicationDate":"2024-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10522522","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140880818","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}
System performance analysis is a vital issue in the fifth generation (5G) and beyond wireless communications, which is widely adopted for the design and estimation of wireless communication systems before deployments. To this end, the versatile system performance expressions that can be used under various conditions are of significant importance. This paper investigates the symbol error rate (SER) performance over the generalized κ — μ and η — μ fading channels, whereby the SER expressions in this case are versatile and can characterize the performance under various wireless channel models. To address the computational complexity associated with high-order trigonometric integration, we present the closed-form SER expressions with arbitrary small errors. Monte Carlo-based simulations demonstrate the validity of our derivation and analysis. Simulation results also show that: 1) the closed-form solutions we derived for SER yield minimal errors upon variations in the truncation factor T and are computationally more efficient, in which T can be set to a minimal value to attain precise outcomes or be optimally chosen contingent on the channel parameters; 2) elevating the values of parameters κ, μ and η results in decreased SER, with μ exerting a more significant impact than κ and η; and 3) our approximate expressions have superior accuracy compared to the previous estimated expressions.
系统性能分析是第五代（5G）及以后无线通信领域的一个重要问题，被广泛用于无线通信系统部署前的设计和估算。为此，可在各种条件下使用的通用系统性能表达式具有重要意义。本文研究了广义κ - μ和η - μ衰减信道上的符号错误率（SER）性能，在这种情况下，SER表达式具有多样性，可以表征各种无线信道模型下的性能。为了解决与高阶三角积分相关的计算复杂性问题，我们提出了具有任意小误差的闭式 SER 表达式。基于蒙特卡罗的仿真证明了我们的推导和分析的有效性。模拟结果还表明1) 我们推导出的 SER 闭式解在截断因子 T 变化时误差最小，计算效率更高，其中 T 可设置为最小值以获得精确结果，或根据信道参数进行优化选择；2) 提高参数 κ、μ 和 η 的值会降低 SER，其中 μ 比 κ 和 η 的影响更大；3) 与之前的估计表达式相比，我们的近似表达式具有更高的精确度。
{"title":"SER performance analysis of generalized κ — μ and η — μ fading channels","authors":"Jingjing Guo;Di Zhang;Li You;Xuewan Zhang;Shahid Mumtaz","doi":"10.23919/JCN.2024.000005","DOIUrl":"https://doi.org/10.23919/JCN.2024.000005","url":null,"abstract":"System performance analysis is a vital issue in the fifth generation (5G) and beyond wireless communications, which is widely adopted for the design and estimation of wireless communication systems before deployments. To this end, the versatile system performance expressions that can be used under various conditions are of significant importance. This paper investigates the symbol error rate (SER) performance over the generalized κ — μ and η — μ fading channels, whereby the SER expressions in this case are versatile and can characterize the performance under various wireless channel models. To address the computational complexity associated with high-order trigonometric integration, we present the closed-form SER expressions with arbitrary small errors. Monte Carlo-based simulations demonstrate the validity of our derivation and analysis. Simulation results also show that: 1) the closed-form solutions we derived for SER yield minimal errors upon variations in the truncation factor T and are computationally more efficient, in which T can be set to a minimal value to attain precise outcomes or be optimally chosen contingent on the channel parameters; 2) elevating the values of parameters κ, μ and η results in decreased SER, with μ exerting a more significant impact than κ and η; and 3) our approximate expressions have superior accuracy compared to the previous estimated expressions.","PeriodicalId":54864,"journal":{"name":"Journal of Communications and Networks","volume":null,"pages":null},"PeriodicalIF":3.6,"publicationDate":"2024-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10522516","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140880797","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-04-01DOI: 10.23919/JCN.2024.000014
Tyson Baptist D. Cunha;Kiran Manjappa
In this work, a static random access memory-physical unclonable function (SRAM-PUF) based device security framework is proposed which uses the trending blockchain technology for securing the device credentials. The proposed framework produces a unique fingerprint called PUF key for each device based on its hardware characteristics which will act as an authenticating parameter for the devices during the authentication and re-authentication phase. The proposed work uses both consortium and private blockchains for storing device credentials and authentication, unlike the current trend of using either a secured database or only a public blockchain. The consortium blockchain is used for first-time authentication, while the private blockchain is used for repeated authentication which saves the time incurred in accessing the consortium blockchain during repeated authentication. The proposed protocol also includes mutual authentication between the entities involved and thus provides dual security (device authentication and mutual authentication) to the proposed protocol making the system more secure and robust against attacks. Security analysis of the proposed protocol is done using the Scyther tool and the protocol is also theoretically proven to be stable under various attacks using threat analysis and the real-or-random model (ROR). The performance analysis of the protocol is done by analyzing the computation and communication cost of the proposed protocol against other state-of-the-art protocols. Further, the proposed protocol is also evaluated in the blockchain testbed which includes Raspberry PI and Arduino components. The results conveyed that the introduction of a private blockchain reduces the time incurred in the device re-authentication.
{"title":"Private and consortium blockchain-based authentication protocol for IoT devices using PUF","authors":"Tyson Baptist D. Cunha;Kiran Manjappa","doi":"10.23919/JCN.2024.000014","DOIUrl":"https://doi.org/10.23919/JCN.2024.000014","url":null,"abstract":"In this work, a static random access memory-physical unclonable function (SRAM-PUF) based device security framework is proposed which uses the trending blockchain technology for securing the device credentials. The proposed framework produces a unique fingerprint called PUF key for each device based on its hardware characteristics which will act as an authenticating parameter for the devices during the authentication and re-authentication phase. The proposed work uses both consortium and private blockchains for storing device credentials and authentication, unlike the current trend of using either a secured database or only a public blockchain. The consortium blockchain is used for first-time authentication, while the private blockchain is used for repeated authentication which saves the time incurred in accessing the consortium blockchain during repeated authentication. The proposed protocol also includes mutual authentication between the entities involved and thus provides dual security (device authentication and mutual authentication) to the proposed protocol making the system more secure and robust against attacks. Security analysis of the proposed protocol is done using the Scyther tool and the protocol is also theoretically proven to be stable under various attacks using threat analysis and the real-or-random model (ROR). The performance analysis of the protocol is done by analyzing the computation and communication cost of the proposed protocol against other state-of-the-art protocols. Further, the proposed protocol is also evaluated in the blockchain testbed which includes Raspberry PI and Arduino components. The results conveyed that the introduction of a private blockchain reduces the time incurred in the device re-authentication.","PeriodicalId":54864,"journal":{"name":"Journal of Communications and Networks","volume":null,"pages":null},"PeriodicalIF":3.6,"publicationDate":"2024-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10522519","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140880724","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}
Vehicle-to-everything (V2X) communication is an essential component for fully autonomous vehicles in future intelligent transportation systems, and cellular-V2X (C-V2X) is a standard that allows vehicles to communicate with its surroundings using cellular technology. Among the resource allocation modes of C-V2X, Mode 4 is a distributed scheme in which each vehicle independently selects a radio resource using the sensing-based semi-persistent scheduling (SB-SPS) algorithm. However, it is susceptible to resource conflicts especially with increased vehicle density or mobility, and the conflicts cannot be detected, leading to poor performance due to collisions and interference. To address this problem, this paper proposes a delivery rate estimation based probabilistic resource re-scheduling (EB-PRS) scheme. The delivery ratio is estimated using opportunistic bloom filter-based feedback on which vehicle's messages are received successfully. Based on the estimated delivery rate, EB-PRS carefully reselects resources probabilistically to maximize performance. EB-PRS is evaluated in highway and urban scenarios using WiLabV2Xsim simulator to show that it significantly improves upon the SB-SPS by reducing packet collisions.
{"title":"Probabilistic resource rescheduling for C-V2X based on delivery rate estimation","authors":"Doyeon Hyeon;Chaeyeong Lee;Heemin Kim;Sungrae Cho;Jeongyeup Paek;Ramesh Govindan","doi":"10.23919/JCN.2024.000006","DOIUrl":"https://doi.org/10.23919/JCN.2024.000006","url":null,"abstract":"Vehicle-to-everything (V2X) communication is an essential component for fully autonomous vehicles in future intelligent transportation systems, and cellular-V2X (C-V2X) is a standard that allows vehicles to communicate with its surroundings using cellular technology. Among the resource allocation modes of C-V2X, Mode 4 is a distributed scheme in which each vehicle independently selects a radio resource using the sensing-based semi-persistent scheduling (SB-SPS) algorithm. However, it is susceptible to resource conflicts especially with increased vehicle density or mobility, and the conflicts cannot be detected, leading to poor performance due to collisions and interference. To address this problem, this paper proposes a delivery rate estimation based probabilistic resource re-scheduling (EB-PRS) scheme. The delivery ratio is estimated using opportunistic bloom filter-based feedback on which vehicle's messages are received successfully. Based on the estimated delivery rate, EB-PRS carefully reselects resources probabilistically to maximize performance. EB-PRS is evaluated in highway and urban scenarios using WiLabV2Xsim simulator to show that it significantly improves upon the SB-SPS by reducing packet collisions.","PeriodicalId":54864,"journal":{"name":"Journal of Communications and Networks","volume":null,"pages":null},"PeriodicalIF":3.6,"publicationDate":"2024-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://ieeexplore.ieee.org/stamp/stamp.jsp?tp=&arnumber=10522524","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140880726","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}
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":null,"pages":null},"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}
Pub Date : 2024-04-01DOI: 10.23919/JCN.2024.000007
Hui Zhi;Yaning Wang
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.
{"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":null,"pages":null},"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}
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":null,"pages":null},"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":null,"pages":null},"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":null,"pages":null},"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}
京公网安备 11010802042870号
京ICP备2023020795号-1
扫码关注我们
求助内容：
应助结果提醒方式：