首页 > 最新文献

Vehicular Communications最新文献

英文 中文
IDS-DEC: A novel intrusion detection for CAN bus traffic based on deep embedded clustering IDS-DEC:基于深度嵌入式聚类的新型 CAN 总线流量入侵检测器
IF 5.8 2区 计算机科学 Q1 TELECOMMUNICATIONS Pub Date : 2024-07-26 DOI: 10.1016/j.vehcom.2024.100830
Jiahao Shi, Zhijun Xie, Li Dong, Xianliang Jiang, Xing Jin

As the automotive industry advances towards greater automation, the proliferation of electronic control units (ECUs) has led to a substantial increase in the connectivity of in-vehicle networks with the external environment. However, the widely used Controller Area Network (CAN), which serves as the standard for in-vehicle networks, lacks robust security features, such as authentication or encrypted information transmission. This poses a significant challenge to the security of these networks. Despite the availability of powerful intrusion detection methods based on machine learning and deep learning, there are notable limitations in terms of stability and accuracy in the absence of a supervised learning process with labeled data. To address this issue, this paper introduces a novel in-vehicle intrusion detection system, termed IDS-DEC. This system combines a spatiotemporal self-coder employing LSTM and CNN (LCAE) with an entropy-based deep embedding clustering. Specifically, our approach involves encoding in-vehicle network traffic into windowed messages using a stream builder, designed to adapt to high-frequency traffic. These messages are then fed into the LCAE to extract a low-dimensional nonlinear spatiotemporal mapping from the initially high-dimensional data. The resulting low-dimensional mapping is subjected to a dual constraint in conjunction with our entropy-based pure deep embedding clustering module. This creates a bidirectional learning objective, addressing the optimization problem and facilitating an end-to-end training pattern for our model to adapt to diverse attack environments. The effectiveness of IDS-DEC is validated using both the benchmark Car Hacking dataset and the Car Hacking-Attack & Defense Challenge dataset. Experimental results demonstrate the model's high detection accuracy across various attacks, stabilizing at approximately 99% accuracy with a 0.5% false alarm rate. The F1 score also stabilizes at around 99%. In comparison with unsupervised methods based on deep stream clustering, LSTM-based self-encoder, and classification-based methods, IDS-DEC exhibits significant improvements across all performance metrics.

随着汽车行业向更高自动化水平迈进,电子控制单元(ECU)的激增导致车载网络与外部环境的连接大幅增加。然而,作为车载网络标准而广泛使用的控制器局域网(CAN)却缺乏强大的安全功能,如身份验证或加密信息传输。这给这些网络的安全性带来了巨大挑战。尽管基于机器学习和深度学习的入侵检测方法功能强大,但在缺乏标注数据监督学习过程的情况下,其稳定性和准确性存在明显的局限性。为解决这一问题,本文介绍了一种新型车载入侵检测系统,称为 IDS-DEC。该系统将采用 LSTM 和 CNN(LCAE)的时空自编码器与基于熵的深度嵌入聚类相结合。具体来说,我们的方法是使用流生成器将车载网络流量编码为窗口信息,以适应高频流量。然后将这些信息输入 LCAE,从最初的高维数据中提取低维非线性时空映射。由此产生的低维映射与我们基于熵的纯深度嵌入聚类模块一起受到双重约束。这就创造了一个双向学习目标,解决了优化问题,并为我们的模型提供了端到端的训练模式,以适应不同的攻击环境。IDS-DEC 的有效性通过基准 "汽车黑客攻击 "数据集和 "汽车黑客攻击& 防御挑战 "数据集进行了验证。实验结果表明,该模型对各种攻击的检测准确率很高,准确率稳定在 99% 左右,误报率为 0.5%。F1 分数也稳定在 99% 左右。与基于深度流聚类的无监督方法、基于 LSTM 的自编码器和基于分类的方法相比,IDS-DEC 在所有性能指标上都有显著提高。
{"title":"IDS-DEC: A novel intrusion detection for CAN bus traffic based on deep embedded clustering","authors":"Jiahao Shi,&nbsp;Zhijun Xie,&nbsp;Li Dong,&nbsp;Xianliang Jiang,&nbsp;Xing Jin","doi":"10.1016/j.vehcom.2024.100830","DOIUrl":"10.1016/j.vehcom.2024.100830","url":null,"abstract":"<div><p>As the automotive industry advances towards greater automation, the proliferation of electronic control units (ECUs) has led to a substantial increase in the connectivity of in-vehicle networks with the external environment. However, the widely used Controller Area Network (CAN), which serves as the standard for in-vehicle networks, lacks robust security features, such as authentication or encrypted information transmission. This poses a significant challenge to the security of these networks. Despite the availability of powerful intrusion detection methods based on machine learning and deep learning, there are notable limitations in terms of stability and accuracy in the absence of a supervised learning process with labeled data. To address this issue, this paper introduces a novel in-vehicle intrusion detection system, termed IDS-DEC. This system combines a spatiotemporal self-coder employing LSTM and CNN (LCAE) with an entropy-based deep embedding clustering. Specifically, our approach involves encoding in-vehicle network traffic into windowed messages using a stream builder, designed to adapt to high-frequency traffic. These messages are then fed into the LCAE to extract a low-dimensional nonlinear spatiotemporal mapping from the initially high-dimensional data. The resulting low-dimensional mapping is subjected to a dual constraint in conjunction with our entropy-based pure deep embedding clustering module. This creates a bidirectional learning objective, addressing the optimization problem and facilitating an end-to-end training pattern for our model to adapt to diverse attack environments. The effectiveness of IDS-DEC is validated using both the benchmark Car Hacking dataset and the Car Hacking-Attack &amp; Defense Challenge dataset. Experimental results demonstrate the model's high detection accuracy across various attacks, stabilizing at approximately 99% accuracy with a 0.5% false alarm rate. The F1 score also stabilizes at around 99%. In comparison with unsupervised methods based on deep stream clustering, LSTM-based self-encoder, and classification-based methods, IDS-DEC exhibits significant improvements across all performance metrics.</p></div>","PeriodicalId":54346,"journal":{"name":"Vehicular Communications","volume":"49 ","pages":"Article 100830"},"PeriodicalIF":5.8,"publicationDate":"2024-07-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141849672","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
ASAP: IEEE 802.11ax-based seamless access point handover for moving vehicles ASAP:基于 IEEE 802.11ax 的移动车辆无缝接入点切换
IF 5.8 2区 计算机科学 Q1 TELECOMMUNICATIONS Pub Date : 2024-07-18 DOI: 10.1016/j.vehcom.2024.100828
Pin Lv , Huanhua He , Jia Xu

The increasing number of connected and automated vehicles has led to a sharp increase in the demand for network access of moving vehicles. Although 5G networks support terminals with high mobility, the traffic load is too heavy to bear if all the vehicles have a large amount of data for transmission. Therefore, IEEE 802.11-based wireless network is a complementary offload solution to provide high-speed network access for vehicles with low cost, easy deployment and high scalability. However, frequent network handover of moving vehicles between multiple roadside access points (APs) results in network performance degradation, which is one of the challenges in vehicular communications. In this paper, we propose a framework (referred to as ASAP) based on the up-to-date IEEE 802.11ax standard to provide moving vehicles with seamless handover between multiple APs. By leveraging the high efficiency (HE) sounding protocol of IEEE 802.11ax, each AP is capable to monitor the current location of moving vehicles in real time. In addition, a mechanism is also proposed for AP uplink/downlink transmissions through collaboration between the APs and the backbone network to achieve seamless handover for moving vehicles. Since ASAP is based on IEEE 802.11ax, the compatible security scheme such as IEEE 802.11i can be applied to ASAP for security enhancement. The proposed solution does not require any modification on the user terminals, making it possible to be implemented in practice. Extensive simulations show that ASAP significantly reduces the network handover delay to microsecond level, and improves network throughput up to 59% compared with the state-of-the-art methods.

联网车辆和自动驾驶车辆的数量不断增加,导致移动车辆的网络接入需求急剧增加。虽然 5G 网络支持具有高移动性的终端,但如果所有车辆都有大量数据需要传输,其流量负载将不堪重负。因此,基于 IEEE 802.11 的无线网络是一种互补的卸载解决方案,能以低成本、易部署和高扩展性为车辆提供高速网络接入。然而,移动车辆在多个路边接入点(AP)之间频繁的网络切换会导致网络性能下降,这是车载通信面临的挑战之一。在本文中,我们基于最新的 IEEE 802.11ax 标准提出了一个框架(简称 ASAP),为行驶中的车辆提供多个接入点之间的无缝切换。通过利用 IEEE 802.11ax 的高效(HE)探测协议,每个接入点都能实时监控移动车辆的当前位置。此外,还提出了一种通过接入点与骨干网络协作进行接入点上行/下行链路传输的机制,以实现移动车辆的无缝切换。由于 ASAP 基于 IEEE 802.11ax,因此可将兼容的安全方案(如 IEEE 802.11i)应用于 ASAP,以增强安全性。提出的解决方案不需要对用户终端进行任何修改,因此可以在实践中实施。大量仿真表明,与最先进的方法相比,ASAP 能将网络切换延迟显著降低到微秒级,并将网络吞吐量提高达 59%。
{"title":"ASAP: IEEE 802.11ax-based seamless access point handover for moving vehicles","authors":"Pin Lv ,&nbsp;Huanhua He ,&nbsp;Jia Xu","doi":"10.1016/j.vehcom.2024.100828","DOIUrl":"10.1016/j.vehcom.2024.100828","url":null,"abstract":"<div><p>The increasing number of connected and automated vehicles has led to a sharp increase in the demand for network access of moving vehicles. Although 5G networks support terminals with high mobility, the traffic load is too heavy to bear if all the vehicles have a large amount of data for transmission. Therefore, IEEE 802.11-based wireless network is a complementary offload solution to provide high-speed network access for vehicles with low cost, easy deployment and high scalability. However, frequent network handover of moving vehicles between multiple roadside access points (APs) results in network performance degradation, which is one of the challenges in vehicular communications. In this paper, we propose a framework (referred to as ASAP) based on the up-to-date IEEE 802.11ax standard to provide moving vehicles with seamless handover between multiple APs. By leveraging the high efficiency (HE) sounding protocol of IEEE 802.11ax, each AP is capable to monitor the current location of moving vehicles in real time. In addition, a mechanism is also proposed for AP uplink/downlink transmissions through collaboration between the APs and the backbone network to achieve seamless handover for moving vehicles. Since ASAP is based on IEEE 802.11ax, the compatible security scheme such as IEEE 802.11i can be applied to ASAP for security enhancement. The proposed solution does not require any modification on the user terminals, making it possible to be implemented in practice. Extensive simulations show that ASAP significantly reduces the network handover delay to microsecond level, and improves network throughput up to 59% compared with the state-of-the-art methods.</p></div>","PeriodicalId":54346,"journal":{"name":"Vehicular Communications","volume":"49 ","pages":"Article 100828"},"PeriodicalIF":5.8,"publicationDate":"2024-07-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141845895","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Multi-path serial tasks offloading strategy and dynamic scheduling optimization in vehicular edge computing networks 车载边缘计算网络中的多路径串行任务卸载策略和动态调度优化
IF 5.8 2区 计算机科学 Q1 TELECOMMUNICATIONS Pub Date : 2024-07-09 DOI: 10.1016/j.vehcom.2024.100827
Xiangyan Liu , Jianhong Zheng , Yang Li , Meng Zhang , Rui Wang , Yun He

Vehicular edge computing networks (VECNs) can provide a promising solution to support efficient task execution of vehicles. Consider the channel and access time variations caused by the high mobility of vehicles in a vehicular environment when designing task offloading strategies in VECNs. In this paper, we perform multi-path offloading for a task vehicle with serial tasks based on both dynamic communication distances of vehicle-to-infrastructure (V2I) links, that of vehicle-to-vehicle (V2V) links, and slowly varying large-scale fading information of wireless channels. Considering the task vehicle's low delay requirements, our goal is to minimize the maximum task completion time of the task vehicle. A multi-path dynamic offloading scheme (MPDOS), composed of three parts, is proposed to achieve maximum delay minimization. The maximum processing capability of links between a task vehicle and roadside units (RSUs) is first taken as the objective to find the required communication links, which can decrease the total processing time by increasing transmission rate and execution capacity. Then, a task allocation scheme based on a multi-knapsack algorithm matches tasks and RSUs. Finally, a balancing scheme is leveraged to provide load-balancing computing performance across all computation devices. Numerical results show that our proposed scheme outperforms 30.7% of the RA algorithm, and the task completion rate can reach 99.55%.

车载边缘计算网络(VECN)为支持车辆高效执行任务提供了一种前景广阔的解决方案。在设计 VECN 中的任务卸载策略时,要考虑车辆在车载环境中的高流动性所导致的信道和接入时间变化。本文基于车辆到基础设施(V2I)链路和车辆到车辆(V2V)链路的动态通信距离以及缓慢变化的无线信道大规模衰落信息,为具有串行任务的任务车辆执行多路径卸载。考虑到任务车辆的低延迟要求,我们的目标是最大限度地减少任务车辆完成任务的时间。为了实现最大延迟最小化,我们提出了一种由三部分组成的多路径动态卸载方案(MPDOS)。首先,以任务车辆和路边单元(RSU)之间链路的最大处理能力为目标,找到所需的通信链路,通过提高传输速率和执行能力来减少总处理时间。然后,基于多背包算法的任务分配方案对任务和 RSU 进行匹配。最后,利用平衡方案为所有计算设备提供负载平衡计算性能。数值结果表明,我们提出的方案比 RA 算法高出 30.7%,任务完成率可达 99.55%。
{"title":"Multi-path serial tasks offloading strategy and dynamic scheduling optimization in vehicular edge computing networks","authors":"Xiangyan Liu ,&nbsp;Jianhong Zheng ,&nbsp;Yang Li ,&nbsp;Meng Zhang ,&nbsp;Rui Wang ,&nbsp;Yun He","doi":"10.1016/j.vehcom.2024.100827","DOIUrl":"10.1016/j.vehcom.2024.100827","url":null,"abstract":"<div><p>Vehicular edge computing networks (VECNs) can provide a promising solution to support efficient task execution of vehicles. Consider the channel and access time variations caused by the high mobility of vehicles in a vehicular environment when designing task offloading strategies in VECNs. In this paper, we perform multi-path offloading for a task vehicle with serial tasks based on both dynamic communication distances of vehicle-to-infrastructure (V2I) links, that of vehicle-to-vehicle (V2V) links, and slowly varying large-scale fading information of wireless channels. Considering the task vehicle's low delay requirements, our goal is to minimize the maximum task completion time of the task vehicle. A multi-path dynamic offloading scheme (MPDOS), composed of three parts, is proposed to achieve maximum delay minimization. The maximum processing capability of links between a task vehicle and roadside units (RSUs) is first taken as the objective to find the required communication links, which can decrease the total processing time by increasing transmission rate and execution capacity. Then, a task allocation scheme based on a multi-knapsack algorithm matches tasks and RSUs. Finally, a balancing scheme is leveraged to provide load-balancing computing performance across all computation devices. Numerical results show that our proposed scheme outperforms 30.7% of the RA algorithm, and the task completion rate can reach 99.55%.</p></div>","PeriodicalId":54346,"journal":{"name":"Vehicular Communications","volume":"49 ","pages":"Article 100827"},"PeriodicalIF":5.8,"publicationDate":"2024-07-09","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141622941","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
A novel Q-learning-based secure routing scheme with a robust defensive system against wormhole attacks in flying ad hoc networks 基于 Q-learning 的新型安全路由方案,以及针对飞行 ad hoc 网络中虫洞攻击的稳健防御系统
IF 5.8 2区 计算机科学 Q1 TELECOMMUNICATIONS Pub Date : 2024-07-03 DOI: 10.1016/j.vehcom.2024.100826
Mehdi Hosseinzadeh , Saqib Ali , Husham Jawad Ahmad , Faisal Alanazi , Mohammad Sadegh Yousefpoor , Efat Yousefpoor , Omed Hassan Ahmed , Amir Masoud Rahmani , Sang-Woong Lee

Nowadays, unmanned aerial vehicles (UAVs) organized in a flying ad hoc network (FANET) can successfully carry out complex missions. Due to the limitations of these networks, including the lack of infrastructure, wireless communication channels, dynamic topology, and unreliable communication between UAVs, cyberattacks, especially wormholes, weaken the performance of routing schemes. Therefore, maintaining communication security and guaranteeing the quality of service (QoS) are very challenging. In this paper, a novel Q-learning-based secure routing scheme (QSR) is presented for FANETs. QSR seeks to provide a robust defensive system against wormhole attacks, especially wormhole through encapsulation and wormhole through packet relay. QSR includes a secure neighbor discovery process and a Q-learning-based secure routing process. Firstly, each UAV gets information about its neighboring UAVs securely. To secure communication in this process, a local monitoring system is designed to counteract the wormhole attack through packet relay. This system checks data packets exchanged between neighboring UAVs and defines three rules according to the behavior of wormholes. In the second process, UAVs perform a distributed Q-learning-based routing process to counteract the wormhole attack through encapsulation. To reward the safest paths, a reward function is introduced based on five factors, the average one-hop delay, hop count, data loss ratio, packet transmission frequency (PTF), and packet reception frequency (PRF). Finally, the NS2 simulator is applied for implementing QSR and executing different scenarios. The evaluation results show that QSR works better than TOPCM, MNRiRIP, and MNDA in terms of accuracy, malicious node detection rate, data delivery ratio, and data loss ratio. However, it has more delay than TOPCM.

如今,在飞行临时网络(FANET)中组织起来的无人驾驶飞行器(UAV)可以成功执行复杂的任务。由于这些网络的局限性,包括缺乏基础设施、无线通信信道、动态拓扑以及无人飞行器之间的通信不可靠,网络攻击,特别是虫洞,削弱了路由方案的性能。因此,维护通信安全和保证服务质量(QoS)非常具有挑战性。本文针对 FANET 提出了一种基于 Q-learning 的新型安全路由方案(QSR)。QSR 试图提供一种稳健的防御系统来抵御虫洞攻击,尤其是通过封装的虫洞和通过数据包中继的虫洞。QSR 包括安全邻居发现过程和基于 Q 学习的安全路由过程。首先,每个无人机安全地获取其相邻无人机的信息。为了确保这一过程中的通信安全,设计了一个本地监控系统,通过数据包中继来抵御虫洞攻击。该系统会检查相邻无人机之间交换的数据包,并根据虫洞行为定义三条规则。在第二个过程中,无人机执行基于 Q-learning 的分布式路由过程,通过封装抵御虫洞攻击。为了奖励最安全的路径,引入了基于平均单跳延迟、跳数、数据丢失率、数据包发送频率(PTF)和数据包接收频率(PRF)这五个因素的奖励函数。最后,应用 NS2 模拟器实现 QSR 并执行不同的场景。评估结果表明,QSR 在准确率、恶意节点检测率、数据传送率和数据丢失率方面都优于 TOPCM、MNRiRIP 和 MNDA。但是,它比 TOPCM 有更多的延迟。
{"title":"A novel Q-learning-based secure routing scheme with a robust defensive system against wormhole attacks in flying ad hoc networks","authors":"Mehdi Hosseinzadeh ,&nbsp;Saqib Ali ,&nbsp;Husham Jawad Ahmad ,&nbsp;Faisal Alanazi ,&nbsp;Mohammad Sadegh Yousefpoor ,&nbsp;Efat Yousefpoor ,&nbsp;Omed Hassan Ahmed ,&nbsp;Amir Masoud Rahmani ,&nbsp;Sang-Woong Lee","doi":"10.1016/j.vehcom.2024.100826","DOIUrl":"https://doi.org/10.1016/j.vehcom.2024.100826","url":null,"abstract":"<div><p>Nowadays, unmanned aerial vehicles (UAVs) organized in a flying ad hoc network (FANET) can successfully carry out complex missions. Due to the limitations of these networks, including the lack of infrastructure, wireless communication channels, dynamic topology, and unreliable communication between UAVs, cyberattacks, especially wormholes, weaken the performance of routing schemes. Therefore, maintaining communication security and guaranteeing the quality of service (QoS) are very challenging. In this paper, a novel Q-learning-based secure routing scheme (QSR) is presented for FANETs. QSR seeks to provide a robust defensive system against wormhole attacks, especially wormhole through encapsulation and wormhole through packet relay. QSR includes a secure neighbor discovery process and a Q-learning-based secure routing process. Firstly, each UAV gets information about its neighboring UAVs securely. To secure communication in this process, a local monitoring system is designed to counteract the wormhole attack through packet relay. This system checks data packets exchanged between neighboring UAVs and defines three rules according to the behavior of wormholes. In the second process, UAVs perform a distributed Q-learning-based routing process to counteract the wormhole attack through encapsulation. To reward the safest paths, a reward function is introduced based on five factors, the average one-hop delay, hop count, data loss ratio, packet transmission frequency (PTF), and packet reception frequency (PRF). Finally, the NS2 simulator is applied for implementing QSR and executing different scenarios. The evaluation results show that QSR works better than TOPCM, MNRiRIP, and MNDA in terms of accuracy, malicious node detection rate, data delivery ratio, and data loss ratio. However, it has more delay than TOPCM.</p></div>","PeriodicalId":54346,"journal":{"name":"Vehicular Communications","volume":"49 ","pages":"Article 100826"},"PeriodicalIF":5.8,"publicationDate":"2024-07-03","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141594198","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
VESecure: Verifiable authentication and efficient key exchange for secure intelligent transport systems deployment VESecure:可验证的身份验证和高效的密钥交换,实现安全的智能传输系统部署
IF 5.8 2区 计算机科学 Q1 TELECOMMUNICATIONS Pub Date : 2024-06-28 DOI: 10.1016/j.vehcom.2024.100822
Praneetha Surapaneni , Sriramulu Bojjagani , Muhammad Khurram Khan

The Intelligent Transportation Systems (ITS) is a leading-edge, developing idea that seeks to revolutionize how people and things move inside and outside cities. Internet of Vehicles (IoV) forms a networked environment that joins infrastructure, pedestrians, fog, cloud, and vehicles to develop ITS. The IoV has the potential to improve transportation systems significantly, but as it is networked and data-driven, it poses several security issues. Numerous solutions to these IoV issues have recently been put forth. However, significant computing overhead and security concerns afflict the majority of them. Moreover, malicious vehicles may be injected into the network to access or use unauthorized services. To improve the security of the IoV network, the Mayfly algorithm is used to optimize the private keys continuously. To address these difficulties, we propose a novel VESecure system that provides secure communication, mutual authentication, and key management between vehicles, roadside units (RSU), and cloud servers. The scheme undergoes extensive scrutiny for security and privacy using the Real-or-Random (ROR) oracle model, Tamarin, and Scyther tools, along with the informal security analysis. An Objective Modular Network Testbed in OMNet++ is used to simulate the scheme. We prove our scheme's efficiency by comparing it with other existing methods regarding communication and computation costs.

智能交通系统(ITS)是一种前沿的发展理念,旨在彻底改变人和物在城市内外的移动方式。车联网(IoV)形成了一个网络环境,将基础设施、行人、雾、云和车辆连接起来,发展智能交通系统。IoV 具有显著改善交通系统的潜力,但由于它是网络化和数据驱动的,因此会带来一些安全问题。针对这些 IoV 问题,最近提出了许多解决方案。然而,这些解决方案大多存在巨大的计算开销和安全问题。此外,恶意车辆可能被注入网络,访问或使用未经授权的服务。为了提高物联网网络的安全性,我们采用了蜉蝣算法来不断优化私钥。为了解决这些难题,我们提出了一种新颖的 VESecure 系统,可在车辆、路边装置(RSU)和云服务器之间提供安全通信、相互验证和密钥管理。我们使用真实或随机(ROR)甲骨文模型、Tamarin 和 Scyther 工具以及非正式安全分析,对该方案的安全性和隐私性进行了广泛审查。我们使用 OMNet++ 中的客观模块化网络测试平台来模拟该方案。通过与其他现有方法在通信和计算成本方面的比较,我们证明了我们方案的效率。
{"title":"VESecure: Verifiable authentication and efficient key exchange for secure intelligent transport systems deployment","authors":"Praneetha Surapaneni ,&nbsp;Sriramulu Bojjagani ,&nbsp;Muhammad Khurram Khan","doi":"10.1016/j.vehcom.2024.100822","DOIUrl":"https://doi.org/10.1016/j.vehcom.2024.100822","url":null,"abstract":"<div><p>The Intelligent Transportation Systems (ITS) is a leading-edge, developing idea that seeks to revolutionize how people and things move inside and outside cities. Internet of Vehicles (IoV) forms a networked environment that joins infrastructure, pedestrians, fog, cloud, and vehicles to develop ITS. The IoV has the potential to improve transportation systems significantly, but as it is networked and data-driven, it poses several security issues. Numerous solutions to these IoV issues have recently been put forth. However, significant computing overhead and security concerns afflict the majority of them. Moreover, malicious vehicles may be injected into the network to access or use unauthorized services. To improve the security of the IoV network, the Mayfly algorithm is used to optimize the private keys continuously. To address these difficulties, we propose a novel VESecure system that provides secure communication, mutual authentication, and key management between vehicles, roadside units (RSU), and cloud servers. The scheme undergoes extensive scrutiny for security and privacy using the Real-or-Random (ROR) oracle model, Tamarin, and Scyther tools, along with the informal security analysis. An Objective Modular Network Testbed in OMNet++ is used to simulate the scheme. We prove our scheme's efficiency by comparing it with other existing methods regarding communication and computation costs.</p></div>","PeriodicalId":54346,"journal":{"name":"Vehicular Communications","volume":"49 ","pages":"Article 100822"},"PeriodicalIF":5.8,"publicationDate":"2024-06-28","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141594196","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
On a security scheme against collusive attacks in vehicular ad hoc networks 关于车载特设网络中对抗串通攻击的安全方案
IF 5.8 2区 计算机科学 Q1 TELECOMMUNICATIONS Pub Date : 2024-06-26 DOI: 10.1016/j.vehcom.2024.100821
Na Fan , Chase Wu , Slimane Benabdallah , Jialong Li , Yuxin Gao , Qinglong Wang

Vehicular Ad Hoc Networks (VANETs) offer a promising solution to bring drivers comfortable driving experiences and also improve road safety in intelligent transportation systems, but also faces many security issues. Collusive attack is one of the most challenging threats in VANETs because it violates the fundamental assumption made by VANET-based applications that all received information be correct and trustworthy. Collusive attackers can not only generate and send false or forged messages, but also purposely manipulate the reputation value of normal or malicious vehicular nodes. To address these issues, we analyze the behaviors characteristics of collusive attacks and propose a generic, lightweight, and fully distributed detection scheme against collusive attacks in VANETs. This scheme integrates two methods to identify different collusive attacks for fraud reputation and fraud message, respectively, as well as an incentive method to restrain collusive nodes. Simulation-based experiments are conducted and the results illustrate the superiority of the proposed security scheme over state-of-the-art methods.

车载 Ad Hoc 网络(VANET)为驾驶员带来舒适的驾驶体验和提高智能交通系统的道路安全性提供了一种前景广阔的解决方案,但同时也面临着许多安全问题。串通攻击是 VANET 中最具挑战性的威胁之一,因为它违反了基于 VANET 的应用所做的基本假设,即所有接收到的信息都是正确可信的。串通攻击者不仅可以生成和发送虚假或伪造信息,还可以故意操纵正常或恶意车辆节点的信誉值。针对这些问题,我们分析了串通攻击的行为特征,并提出了一种通用、轻量级和全分布式的检测方案,以对抗 VANET 中的串通攻击。该方案集成了两种方法,分别用于识别欺诈声誉和欺诈信息的不同合谋攻击,以及一种抑制合谋节点的激励方法。我们进行了基于仿真的实验,结果表明所提出的安全方案优于最先进的方法。
{"title":"On a security scheme against collusive attacks in vehicular ad hoc networks","authors":"Na Fan ,&nbsp;Chase Wu ,&nbsp;Slimane Benabdallah ,&nbsp;Jialong Li ,&nbsp;Yuxin Gao ,&nbsp;Qinglong Wang","doi":"10.1016/j.vehcom.2024.100821","DOIUrl":"https://doi.org/10.1016/j.vehcom.2024.100821","url":null,"abstract":"<div><p>Vehicular Ad Hoc Networks (VANETs) offer a promising solution to bring drivers comfortable driving experiences and also improve road safety in intelligent transportation systems, but also faces many security issues. Collusive attack is one of the most challenging threats in VANETs because it violates the fundamental assumption made by VANET-based applications that all received information be correct and trustworthy. Collusive attackers can not only generate and send false or forged messages, but also purposely manipulate the reputation value of normal or malicious vehicular nodes. To address these issues, we analyze the behaviors characteristics of collusive attacks and propose a generic, lightweight, and fully distributed detection scheme against collusive attacks in VANETs. This scheme integrates two methods to identify different collusive attacks for fraud reputation and fraud message, respectively, as well as an incentive method to restrain collusive nodes. Simulation-based experiments are conducted and the results illustrate the superiority of the proposed security scheme over state-of-the-art methods.</p></div>","PeriodicalId":54346,"journal":{"name":"Vehicular Communications","volume":"49 ","pages":"Article 100821"},"PeriodicalIF":5.8,"publicationDate":"2024-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141541723","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Broadcast signcryption scheme with equality test in smart transportation system 智能交通系统中带有平等性测试的广播式签名加密方案
IF 5.8 2区 计算机科学 Q1 TELECOMMUNICATIONS Pub Date : 2024-06-26 DOI: 10.1016/j.vehcom.2024.100820
Shufen Niu, Runyuan Dong, Wei Liu, Peng Ge, Qi Liu

With the generation of massive traffic information in the smart transportation system, the traffic control center efficiently utilizes broadcast communication to send multiple messages to multiple vehicles. Besides, diversified privacy disclosure and security attack issues also emerged spontaneously. To achieve secure communication between the traffic control center and vehicles in the smart transportation system, we design a broadcast signcryption scheme with equality test in the smart transportation system based on the certificateless cryptosystem and equality test. The scheme realizes message confidentiality and vehicle privacy by using the Lagrange interpolation theorem to encrypt messages and vehicle identities, while also achieving classify ciphertext by using the equality test and facilitate road traffic information management. Through numerical experiment analysis, the proposed work has higher operation efficiency and is more suitable for application in smart transportation systems.

随着智能交通系统中海量交通信息的产生,交通控制中心有效地利用广播通信向多辆汽车发送多条信息。此外,多样化的隐私泄露和安全攻击问题也随之出现。为了实现智能交通系统中交通控制中心与车辆之间的安全通信,我们设计了一种基于无证书密码系统和平等性测试的智能交通系统中的广播签名加密方案。该方案利用拉格朗日插值定理对信息和车辆身份进行加密,实现了信息的保密性和车辆的私密性,同时还利用等价检验实现了密文的分类,方便了道路交通信息管理。通过数值实验分析,该方案具有更高的运行效率,更适合在智能交通系统中应用。
{"title":"Broadcast signcryption scheme with equality test in smart transportation system","authors":"Shufen Niu,&nbsp;Runyuan Dong,&nbsp;Wei Liu,&nbsp;Peng Ge,&nbsp;Qi Liu","doi":"10.1016/j.vehcom.2024.100820","DOIUrl":"https://doi.org/10.1016/j.vehcom.2024.100820","url":null,"abstract":"<div><p>With the generation of massive traffic information in the smart transportation system, the traffic control center efficiently utilizes broadcast communication to send multiple messages to multiple vehicles. Besides, diversified privacy disclosure and security attack issues also emerged spontaneously. To achieve secure communication between the traffic control center and vehicles in the smart transportation system, we design a broadcast signcryption scheme with equality test in the smart transportation system based on the certificateless cryptosystem and equality test. The scheme realizes message confidentiality and vehicle privacy by using the Lagrange interpolation theorem to encrypt messages and vehicle identities, while also achieving classify ciphertext by using the equality test and facilitate road traffic information management. Through numerical experiment analysis, the proposed work has higher operation efficiency and is more suitable for application in smart transportation systems.</p></div>","PeriodicalId":54346,"journal":{"name":"Vehicular Communications","volume":"49 ","pages":"Article 100820"},"PeriodicalIF":5.8,"publicationDate":"2024-06-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141541721","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
Markov-reward based estimation of the idle-time in vehicular networks to improve multimetric routing protocols 基于马尔可夫奖励的车辆网络空闲时间估计,以改进多参数路由协议
IF 5.8 2区 计算机科学 Q1 TELECOMMUNICATIONS Pub Date : 2024-06-25 DOI: 10.1016/j.vehcom.2024.100823
Isabel V. Martin-Faus , Leticia Lemus Cárdenas , Ahmad Mohamad Mezher , Mónica Aguilar Igartua

Analyzing vehicular ad hoc networks (VANETs) poses a considerable challenge due to their constantly changing network topology and scarce network resources. Furthermore, defining suitable routing metrics for adaptive algorithms is a particularly hard task since these adaptive decisions should be taken according to the current conditions of the VANET. The literature contains different approaches aimed at optimizing the usage of wireless network resources. In a previous study, we introduced an analytical model based on a straightforward Markov reward chain (MRC) to capture transient measurements of the idle time of the link formed between two VANET nodes, which we denote as Tidle. This current study focuses on modeling and analyzing the influence of Tidle on adaptive decision mechanisms. Leveraging our MRC models, we have derived a concise equation to compute Tidle. This equation provides a quick evaluation of Tidle, facilitating quick adaptive routing decisions that align with the current VANET conditions. We have integrated our Tidle evaluation into multihop routing protocols. We specifically compare performance results of the 3MRP protocol with an enhanced version, I3MRP, which incorporates our Tidle metric. Simulation results demonstrate that integrating Tidle as a decision metric in the routing protocol enhances the performance of VANETs in terms of packet losses, packet delay, and throughput. The findings consistently indicate that I3MRP outperforms 3MRP by up to 50% in various scenarios across high, medium, and low vehicular densities.

由于网络拓扑不断变化,网络资源稀缺,因此分析车载 ad hoc 网络(VANET)是一项相当大的挑战。此外,为自适应算法定义合适的路由指标也是一项特别艰巨的任务,因为这些自适应决策应根据 VANET 的当前条件做出。文献中包含了各种旨在优化无线网络资源使用的方法。在之前的研究中,我们引入了一个基于直接马尔可夫奖赏链(MRC)的分析模型,以捕捉两个 VANET 节点之间链路空闲时间的瞬态测量值,我们将其命名为 Tidle。当前研究的重点是模拟和分析 Tidle 对自适应决策机制的影响。利用我们的 MRC 模型,我们得出了计算 Tidle 的简明方程。该等式可快速评估 Tidle,有助于根据当前 VANET 条件快速做出自适应路由决策。我们已将 Tidle 评估集成到多跳路由协议中。我们特别比较了 3MRP 协议与增强版 I3MRP 的性能结果,后者采用了我们的 Tidle 指标。仿真结果表明,在路由协议中集成 Tidle 作为决策指标,可提高 VANET 在数据包丢失、数据包延迟和吞吐量方面的性能。研究结果一致表明,在高、中、低车辆密度的各种情况下,I3MRP 的性能比 3MRP 高出多达 50%。
{"title":"Markov-reward based estimation of the idle-time in vehicular networks to improve multimetric routing protocols","authors":"Isabel V. Martin-Faus ,&nbsp;Leticia Lemus Cárdenas ,&nbsp;Ahmad Mohamad Mezher ,&nbsp;Mónica Aguilar Igartua","doi":"10.1016/j.vehcom.2024.100823","DOIUrl":"https://doi.org/10.1016/j.vehcom.2024.100823","url":null,"abstract":"<div><p>Analyzing vehicular ad hoc networks (VANETs) poses a considerable challenge due to their constantly changing network topology and scarce network resources. Furthermore, defining suitable routing metrics for adaptive algorithms is a particularly hard task since these adaptive decisions should be taken according to the current conditions of the VANET. The literature contains different approaches aimed at optimizing the usage of wireless network resources. In a previous study, we introduced an analytical model based on a straightforward Markov reward chain (MRC) to capture transient measurements of the idle time of the link formed between two VANET nodes, which we denote as <span><math><msub><mrow><mi>T</mi></mrow><mrow><mi>i</mi><mi>d</mi><mi>l</mi><mi>e</mi></mrow></msub></math></span>. This current study focuses on modeling and analyzing the influence of <span><math><msub><mrow><mi>T</mi></mrow><mrow><mi>i</mi><mi>d</mi><mi>l</mi><mi>e</mi></mrow></msub></math></span> on adaptive decision mechanisms. Leveraging our MRC models, we have derived a concise equation to compute <span><math><msub><mrow><mi>T</mi></mrow><mrow><mi>i</mi><mi>d</mi><mi>l</mi><mi>e</mi></mrow></msub></math></span>. This equation provides a quick evaluation of <span><math><msub><mrow><mi>T</mi></mrow><mrow><mi>i</mi><mi>d</mi><mi>l</mi><mi>e</mi></mrow></msub></math></span>, facilitating quick adaptive routing decisions that align with the current VANET conditions. We have integrated our <span><math><msub><mrow><mi>T</mi></mrow><mrow><mi>i</mi><mi>d</mi><mi>l</mi><mi>e</mi></mrow></msub></math></span> evaluation into multihop routing protocols. We specifically compare performance results of the 3MRP protocol with an enhanced version, I3MRP, which incorporates our <span><math><msub><mrow><mi>T</mi></mrow><mrow><mi>i</mi><mi>d</mi><mi>l</mi><mi>e</mi></mrow></msub></math></span> metric. Simulation results demonstrate that integrating <span><math><msub><mrow><mi>T</mi></mrow><mrow><mi>i</mi><mi>d</mi><mi>l</mi><mi>e</mi></mrow></msub></math></span> as a decision metric in the routing protocol enhances the performance of VANETs in terms of packet losses, packet delay, and throughput. The findings consistently indicate that I3MRP outperforms 3MRP by up to 50% in various scenarios across high, medium, and low vehicular densities.</p></div>","PeriodicalId":54346,"journal":{"name":"Vehicular Communications","volume":"49 ","pages":"Article 100823"},"PeriodicalIF":5.8,"publicationDate":"2024-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S2214209624000986/pdfft?md5=316bc8cce7c744317806874319ecfaac&pid=1-s2.0-S2214209624000986-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141481657","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
S-LDM: Server local dynamic map for 5G-based centralized enhanced collective perception S-LDM:基于 5G 的集中式增强集体感知的服务器本地动态地图
IF 5.8 2区 计算机科学 Q1 TELECOMMUNICATIONS Pub Date : 2024-06-25 DOI: 10.1016/j.vehcom.2024.100819
C.M. Risma Carletti , F. Raviglione , C. Casetti , F. Stoffella , G.M. Yilma , F. Visintainer

The automotive field is undergoing significant technological advances, which includes making the next generation of autonomous vehicles smarter, greener and safer through vehicular networks, which are often referred to as Vehicle-to-Everything (V2X) communications. Together with V2X, centralized maneuver management services for autonomous vehicles are increasingly gaining importance, as, thanks to their complete view over the road, they can optimally manage even the most complex maneuvers targeting L4 driving and beyond. These services face the challenge of strictly requiring a high reliability and low latency, which are tackled with the deployment at orchestrated Multi-Access Edge Computing (MEC) platforms. In order to properly manage safety-critical maneuvers, these services need to receive a large amount of data from vehicles, even though the useful subset of data is often related to a specific context on the road (e.g., to specific road users or geographical areas). Decoding and post-processing a large amount of raw messages, which are then for the most part filtered, increases the load on safety-critical services, which should instead focus on meeting the deadlines for the actual control and management operations. On this basis, we present an innovative open-source, 5G & MEC enabled service, called Server Local Dynamic Map (S-LDM). The S-LDM is a service that collects information about vehicles and other non-connected road objects using standard-compliant messages. Its primary purpose is to create a centralized dynamic map of the road that can be shared efficiently with other services managing L4 automation, when needed. By doing so, the S-LDM enables these services to widely and precisely understand the current situation of sections of the road, offloading them from the need of quickly processing a large number of messages. After a detailed description of the service architecture, we validate it through extensive laboratory and pilot trials, involving the MEC platforms and production 5G networks of three major European network operations and two Stellantis vehicles equipped with V2X On-Board Units (OBUs). We show how it can efficiently handle high update rates and process each messages in less than few tenths of microseconds. We also provide a complete scalability analysis with details on deployment options, providing insights on where new instances should be created in practical 5G-based V2X scenarios.

汽车领域正在经历重大的技术进步,其中包括通过车载网络(通常称为 "车对万物"(V2X)通信)使下一代自动驾驶汽车更智能、更环保、更安全。除 V2X 外,自动驾驶汽车的集中操纵管理服务也越来越重要,因为凭借对道路的全面了解,自动驾驶汽车可以优化管理最复杂的 L4 驾驶甚至更复杂的操纵。这些服务面临着严格要求高可靠性和低延迟的挑战,通过部署协调的多接入边缘计算(MEC)平台来解决这一问题。为了正确管理对安全至关重要的操作,这些服务需要接收来自车辆的大量数据,尽管有用的数据子集通常与道路上的特定环境(如特定道路用户或地理区域)有关。对大量的原始信息进行解码和后处理,然后对大部分信息进行过滤,这增加了安全关键服务的负担,而这些服务应将重点放在满足实际控制和管理操作的最后期限要求上。在此基础上,我们提出了一种创新的开源 5G & MEC 服务,称为服务器本地动态地图(S-LDM)。S-LDM 是一种使用符合标准的信息收集车辆和其他非连接道路对象信息的服务。其主要目的是创建一个集中的道路动态地图,以便在需要时与管理 L4 自动化的其他服务有效共享。这样一来,S-LDM 就能让这些服务广泛而准确地了解路段的当前情况,使其无需快速处理大量信息。在对服务架构进行详细描述后,我们通过广泛的实验室和试点试验对其进行了验证,试验涉及欧洲三大网络运营公司的 MEC 平台和 5G 生产网络,以及两辆配备 V2X 车载单元 (OBU) 的 Stellantis 车辆。我们展示了它如何高效地处理高更新率,并在不到十分之几微秒的时间内处理每条信息。我们还提供了完整的可扩展性分析和详细的部署选项,为在基于 5G 的 V2X 实际应用场景中创建新实例提供了见解。
{"title":"S-LDM: Server local dynamic map for 5G-based centralized enhanced collective perception","authors":"C.M. Risma Carletti ,&nbsp;F. Raviglione ,&nbsp;C. Casetti ,&nbsp;F. Stoffella ,&nbsp;G.M. Yilma ,&nbsp;F. Visintainer","doi":"10.1016/j.vehcom.2024.100819","DOIUrl":"https://doi.org/10.1016/j.vehcom.2024.100819","url":null,"abstract":"<div><p>The automotive field is undergoing significant technological advances, which includes making the next generation of autonomous vehicles smarter, greener and safer through vehicular networks, which are often referred to as Vehicle-to-Everything (V2X) communications. Together with V2X, centralized maneuver management services for autonomous vehicles are increasingly gaining importance, as, thanks to their complete view over the road, they can optimally manage even the most complex maneuvers targeting L4 driving and beyond. These services face the challenge of strictly requiring a high reliability and low latency, which are tackled with the deployment at orchestrated Multi-Access Edge Computing (MEC) platforms. In order to properly manage safety-critical maneuvers, these services need to receive a large amount of data from vehicles, even though the useful subset of data is often related to a specific context on the road (e.g., to specific road users or geographical areas). Decoding and post-processing a large amount of raw messages, which are then for the most part filtered, increases the load on safety-critical services, which should instead focus on meeting the deadlines for the actual control and management operations. On this basis, we present an innovative open-source, 5G &amp; MEC enabled service, called Server Local Dynamic Map (S-LDM). The S-LDM is a service that collects information about vehicles and other non-connected road objects using standard-compliant messages. Its primary purpose is to create a centralized dynamic map of the road that can be shared efficiently with other services managing L4 automation, when needed. By doing so, the S-LDM enables these services to widely and precisely understand the current situation of sections of the road, offloading them from the need of quickly processing a large number of messages. After a detailed description of the service architecture, we validate it through extensive laboratory and pilot trials, involving the MEC platforms and production 5G networks of three major European network operations and two Stellantis vehicles equipped with V2X On-Board Units (OBUs). We show how it can efficiently handle high update rates and process each messages in less than few tenths of microseconds. We also provide a complete scalability analysis with details on deployment options, providing insights on where new instances should be created in practical 5G-based V2X scenarios.</p></div>","PeriodicalId":54346,"journal":{"name":"Vehicular Communications","volume":"49 ","pages":"Article 100819"},"PeriodicalIF":5.8,"publicationDate":"2024-06-25","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S2214209624000949/pdfft?md5=150e5c867ceac116888efba68e0e6ff3&pid=1-s2.0-S2214209624000949-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141481658","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"OA","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
GASBO: User grouping–based gradient average subtraction–based optimisation for NOMA-based fog computing vehicular network GASBO:基于用户分组的梯度平均减法优化,用于基于 NOMA 的雾计算车载网络
IF 5.8 2区 计算机科学 Q1 TELECOMMUNICATIONS Pub Date : 2024-06-22 DOI: 10.1016/j.vehcom.2024.100824
C Kumara Narayana Swamy, T Velmurugan

The Internet of Vehicles (IoV) for fog computing (FC) addresses issues such as traffic congestion, transportation efficiency, and privacy. Non-orthogonal multiple access (NOMA) is a popular technology that enhances spectral efficiency and increases the network's access capability. The synchronisation between NOMA and FC radio access networks extends the application of augmented or vehicular networking and other promising uses. However, with the rapid increase in user vehicles and mobile data, the existing IoV has not succeeded in meeting the real-world and dependable communication needs of modern intelligent transportation due to its limited flexibility. To overcome this, we propose a user grouping-based hybrid optimistic framework for resource allocation in NOMA-based FC vehicular networks (FCVR), named the gradient average subtraction-based optimisation (GASBO). Initially, the NOMA-based FCVR is simulated. User grouping is performed based on GASBO using the signal-to-interference-plus-noise ratio and user distance. Finally, resource allocation is achieved using the proposed GASBO, which combines gradient descent optimisation and average subtraction-based optimisation. The analytic measures obtained for energy efficiency, throughput, sub-channel utility, capacity, and penalty function are 5,366,844,362.870 bits/joule, 883.411 Mbps, 82.031, 2316.337, and 0.011, respectively.

用于雾计算(FC)的车联网(IoV)可解决交通拥堵、运输效率和隐私等问题。非正交多址接入(NOMA)是一种流行的技术,可提高频谱效率并增强网络的接入能力。NOMA 和 FC 无线接入网络之间的同步扩展了增强型网络或车载网络的应用,以及其他前景广阔的用途。然而,随着用户车辆和移动数据的快速增长,现有的 IoV 因其有限的灵活性而无法满足现代智能交通的实际和可靠通信需求。为了克服这一问题,我们提出了一种基于用户分组的混合优化框架,用于基于 NOMA 的 FC 车辆网络(FCVR)的资源分配,命名为基于梯度平均减法的优化(GASBO)。首先,模拟基于 NOMA 的 FCVR。在 GASBO 的基础上,利用信噪比和用户距离对用户进行分组。最后,使用建议的 GASBO 实现资源分配,该方法结合了梯度下降优化和基于平均减法的优化。分析得出的能效、吞吐量、子信道效用、容量和惩罚函数分别为 5,366,844,362.870 比特/焦耳、883.411 Mbps、82.031、2316.337 和 0.011。
{"title":"GASBO: User grouping–based gradient average subtraction–based optimisation for NOMA-based fog computing vehicular network","authors":"C Kumara Narayana Swamy,&nbsp;T Velmurugan","doi":"10.1016/j.vehcom.2024.100824","DOIUrl":"https://doi.org/10.1016/j.vehcom.2024.100824","url":null,"abstract":"<div><p>The Internet of Vehicles (IoV) for fog computing (FC) addresses issues such as traffic congestion, transportation efficiency, and privacy. Non-orthogonal multiple access (NOMA) is a popular technology that enhances spectral efficiency and increases the network's access capability. The synchronisation between NOMA and FC radio access networks extends the application of augmented or vehicular networking and other promising uses. However, with the rapid increase in user vehicles and mobile data, the existing IoV has not succeeded in meeting the real-world and dependable communication needs of modern intelligent transportation due to its limited flexibility. To overcome this, we propose a user grouping-based hybrid optimistic framework for resource allocation in NOMA-based FC vehicular networks (FCVR), named the gradient average subtraction-based optimisation (GASBO). Initially, the NOMA-based FCVR is simulated. User grouping is performed based on GASBO using the signal-to-interference-plus-noise ratio and user distance. Finally, resource allocation is achieved using the proposed GASBO, which combines gradient descent optimisation and average subtraction-based optimisation. The analytic measures obtained for energy efficiency, throughput, sub-channel utility, capacity, and penalty function are 5,366,844,362.870 bits/joule, 883.411 Mbps, 82.031, 2316.337, and 0.011, respectively.</p></div>","PeriodicalId":54346,"journal":{"name":"Vehicular Communications","volume":"49 ","pages":"Article 100824"},"PeriodicalIF":5.8,"publicationDate":"2024-06-22","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"141541722","PeriodicalName":null,"FirstCategoryId":null,"ListUrlMain":null,"RegionNum":2,"RegionCategory":"计算机科学","ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":"","EPubDate":null,"PubModel":null,"JCR":null,"JCRName":null,"Score":null,"Total":0}
引用次数: 0
期刊
Vehicular Communications
全部 Acc. Chem. Res. ACS Applied Bio Materials ACS Appl. Electron. Mater. ACS Appl. Energy Mater. ACS Appl. Mater. Interfaces ACS Appl. Nano Mater. ACS Appl. Polym. Mater. ACS BIOMATER-SCI ENG ACS Catal. ACS Cent. Sci. ACS Chem. Biol. ACS Chemical Health & Safety ACS Chem. Neurosci. ACS Comb. Sci. ACS Earth Space Chem. ACS Energy Lett. ACS Infect. Dis. ACS Macro Lett. ACS Mater. Lett. ACS Med. Chem. Lett. ACS Nano ACS Omega ACS Photonics ACS Sens. ACS Sustainable Chem. Eng. ACS Synth. Biol. Anal. Chem. BIOCHEMISTRY-US Bioconjugate Chem. BIOMACROMOLECULES Chem. Res. Toxicol. Chem. Rev. Chem. Mater. CRYST GROWTH DES ENERG FUEL Environ. Sci. Technol. Environ. Sci. Technol. Lett. Eur. J. Inorg. Chem. IND ENG CHEM RES Inorg. Chem. J. Agric. Food. Chem. J. Chem. Eng. Data J. Chem. Educ. J. Chem. Inf. Model. J. Chem. Theory Comput. J. Med. Chem. J. Nat. Prod. J PROTEOME RES J. Am. Chem. Soc. LANGMUIR MACROMOLECULES Mol. Pharmaceutics Nano Lett. Org. Lett. ORG PROCESS RES DEV ORGANOMETALLICS J. Org. Chem. J. Phys. Chem. J. Phys. Chem. A J. Phys. Chem. B J. Phys. Chem. C J. Phys. Chem. Lett. Analyst Anal. Methods Biomater. Sci. Catal. Sci. Technol. Chem. Commun. Chem. Soc. Rev. CHEM EDUC RES PRACT CRYSTENGCOMM Dalton Trans. Energy Environ. Sci. ENVIRON SCI-NANO ENVIRON SCI-PROC IMP ENVIRON SCI-WAT RES Faraday Discuss. Food Funct. Green Chem. Inorg. Chem. Front. Integr. Biol. J. Anal. At. Spectrom. J. Mater. Chem. A J. Mater. Chem. B J. Mater. Chem. C Lab Chip Mater. Chem. Front. Mater. Horiz. MEDCHEMCOMM Metallomics Mol. Biosyst. Mol. Syst. Des. Eng. Nanoscale Nanoscale Horiz. Nat. Prod. Rep. New J. Chem. Org. Biomol. Chem. Org. Chem. Front. PHOTOCH PHOTOBIO SCI PCCP Polym. Chem.
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1