Vehicular Communications最新文献

{"title":"S2DN: Design of robust authentication protocol with session key establishment in multi-controller based software-defined VANETs","authors":"Isha Pali ,&nbsp;Mohammad Abdussami ,&nbsp;Ruhul Amin ,&nbsp;Taher Al-Shehari ,&nbsp;Muna Al-Razgan ,&nbsp;Taha Alfakih","doi":"10.1016/j.vehcom.2024.100767","DOIUrl":"10.1016/j.vehcom.2024.100767","url":null,"abstract":"<div><p>Advancements in technology and the adoption of innovative developments have significantly simplified our lives. One notable innovation in the networking domain is Software Defined Networking (SDN), which revolutionizes the network layer by enabling centralized network administration and re-programmability. SDN technology finds application in diverse fields such as Vehicular Ad-hoc Networks (VANETs), Wireless Sensor Networks (WSNs), Internet of Things (IoT) communications, and cloud-fog computing. The integration of SDN technology into VANET systems has notably improved network performance but has also raised security concerns. To tackle this issue, this paper focuses on devising an authentication mechanism to facilitate secure communication across various VANET levels by establishing a shared session key. Moreover, the research proposes a method to mitigate the challenge of single points of failure, a typically difficult issue to address. To ensure the security of all confidential information during protocol execution, simulations are conducted using the Scyther tool. Additionally, an informal security analysis is performed, demonstrating the robustness of the proposed protocol. The proposed protocol also performs outstanding in terms of performance results</p></div>","PeriodicalId":54346,"journal":{"name":"Vehicular Communications","volume":"47 ","pages":"Article 100767"},"PeriodicalIF":6.7,"publicationDate":"2024-03-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140343650","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}

{"title":"Federated learning-based trajectory prediction for dynamic resource allocation in moving small cell networks","authors":"Saniya Zafar ,&nbsp;Sobia Jangsher ,&nbsp;Adnan Zafar","doi":"10.1016/j.vehcom.2024.100766","DOIUrl":"10.1016/j.vehcom.2024.100766","url":null,"abstract":"<div><p>With the evolution of fifth generation (5G) of mobile communication, vehicular edge computing (VEC) and moving small cell (MSC) network are gaining attention because of their capability to provide improved quality-of-service (QoS) to vehicular users. The ultimate goal of VEC-enabled MSC network is to diminish the vehicular penetration effect and path loss resulting in improved network performance for vehicular users. In this paper, we explore distributed resource block (RB) allocation for fronthaul links of MSCs with probabilistic mobility in VEC-enabled MSC network. The proposed work exploits the computational power of road side units (RSUs) deployed with VEC servers present along the road sides to allocate the resources to MSCs in a distributed manner by exchanging limited information, with the objective of maximizing the data rate achieved by MSC network. Moreover, we propose federated learning (FL)-based position prediction of MSCs to predict the trajectory of MSCs in advance for efficient prediction of resource allocation in MSC network. Simulations results are presented to compare the position prediction dependent distributed and centralized time interval dependent interference graph-based resource allocation to MSCs in terms of RB utilization and average achievable data rate of MSC network. For comparison, we further investigated centralized as well as distributed threshold time dependent interference graph-based allocation of resources to MSC network.</p></div>","PeriodicalId":54346,"journal":{"name":"Vehicular Communications","volume":"47 ","pages":"Article 100766"},"PeriodicalIF":6.7,"publicationDate":"2024-03-21","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140281540","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}

{"title":"DSSPS: A dynamic secure service provision scheme in fog-based VANETs","authors":"Yan Xu,&nbsp;Ailian Shi,&nbsp;Jie Cui,&nbsp;Hong Zhong","doi":"10.1016/j.vehcom.2024.100762","DOIUrl":"10.1016/j.vehcom.2024.100762","url":null,"abstract":"<div><p>In fog-based VANETs, fog nodes are close to the network edge that analyze data uploaded by vehicles, and then provide value-added services. It is suitable to adopt data sharing schemes to provide value-added services. However, applying existing data sharing schemes directly for service provision in fog-based VANETs has limitations in terms of security and efficiency. Therefore, we propose a dynamic secure service provision scheme in fog-based VANETs called DSSPS. Firstly, we construct an efficient subscription permission authentication mechanism that allows vehicles to request service from different fog nodes after a single subscription at TA. Secondly, a subgroup selecting algorithm is proposed, which effectively reduces the decryption overhead of vehicles. Formal security proof demonstrates DSSPS is secure. At the same time, DSSPS achieves better performance in terms of computation and communication costs.</p></div>","PeriodicalId":54346,"journal":{"name":"Vehicular Communications","volume":"47 ","pages":"Article 100762"},"PeriodicalIF":6.7,"publicationDate":"2024-03-19","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140173391","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}

{"title":"MTL-PIE: A multi-task learning based drone pilot identification and operation evaluation scheme","authors":"Liyao Han,&nbsp;Xiangping Zhong,&nbsp;Yanning Zhang","doi":"10.1016/j.vehcom.2024.100760","DOIUrl":"10.1016/j.vehcom.2024.100760","url":null,"abstract":"<div><p>As one of the most promising industries, consumer-grade Unmanned Aerial Vehicles (UAVs), also known as drones, have changed our lives. Although significant progress in drones has been made, adversary impersonation attacks still pose severe risks to flying drones. In addition, authorized pilot miss-operations also has become a critical factor leading to drone flight accidents. To validate the pilot's legal status and remind the authorized pilot about their miss-operations, we propose a multi-task learning-based drone pilot identification and operation evaluation scheme named MTL-PIE. Specifically, we first present qualitative and quantitative guidelines to evaluate pilot operation proficiency. Then, we design a pilot identification module and an operation evaluation module to resist pilot impersonation attacks and assess pilot operation proficiency, respectively. Finally, we propose a soft-parameter sharing mechanism to transfer knowledge between two modules and a dynamic weight-adjusting algorithm to prevent domain-dominant problems. Numerical results show that MTL-PIE can verify pilot legal status with an accuracy of 95.36% (outperforming our previous work with a margin of 2%-3%) and act as assessors to evaluate pilot operation proficiency with an accuracy of 94.47%. Note that MTL-PIE needs only 35 ms to verify pilot legal status and assess pilot operation proficiency; it has great potential to reduce drone flight accidents.</p></div>","PeriodicalId":54346,"journal":{"name":"Vehicular Communications","volume":"47 ","pages":"Article 100760"},"PeriodicalIF":6.7,"publicationDate":"2024-03-18","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140173359","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}

{"title":"Lightweight three-party key agreement for V2G networks with physical unclonable function","authors":"Dingyi Shui ,&nbsp;Yong Xie ,&nbsp;Libing Wu ,&nbsp;Yining Liu ,&nbsp;Xing Su","doi":"10.1016/j.vehcom.2024.100747","DOIUrl":"10.1016/j.vehcom.2024.100747","url":null,"abstract":"<div><p>Electric vehicles (EV) are gradually replacing traditional fuel-based vehicles to reduce carbon emissions and protect the human living environment. EVs can be easily integrated into the smart grid infrastructure, and achieve the rapid demand response of power exchange in the vehicle-to-grid (V2G) ecosystem, and achieve optimal energy allocation. However, it is a challenge to simultaneously solve the security, privacy and efficiency of communication in V2G. To meet this challenge, we propose a three-party key agreement protocol based on Physical Unclonable Function (PUF). The proposed protocol just uses a small amount of XOR operations, PUF functions, and hash functions with low computation cost. It is a truly lightweight and efficient three-party key agreement protocol. It realizes the privacy protection of one-time random pseudonym under the condition that the server only needs to store two pseudonyms. And it also provides a supplementary sub-protocol for pseudonym error conditions to achieve high robustness of the authentication system. Strict security formal proof shows the proposed protocol meets various security requirements. Compared with similar protocol, the proposed protocol reduces the total communication cost by 73% and the computing cost by 79%.</p></div>","PeriodicalId":54346,"journal":{"name":"Vehicular Communications","volume":"47 ","pages":"Article 100747"},"PeriodicalIF":6.7,"publicationDate":"2024-03-16","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140173234","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}

{"title":"Crowdsourced vehicles and UAVs for last-mile delivery application using blockchain-hosted matching mechanism","authors":"Maha Kadadha ,&nbsp;Rabeb Mizouni ,&nbsp;Shakti Singh ,&nbsp;Hadi Otrok ,&nbsp;Azzam Mourad","doi":"10.1016/j.vehcom.2024.100761","DOIUrl":"10.1016/j.vehcom.2024.100761","url":null,"abstract":"<div><p>The crowdsourcing paradigm has been used for last-mile delivery applications to offer cost-efficient delivery through crowdsourced vehicles. The increasing demand from users for fast delivery led to the adoption of Unmanned Aerial Vehicles (UAVs) due to their speed and cost, for instance, in peak hours. However, existing frameworks do not offer a comprehensive solution that utilizes vehicles and UAVs for transparent, timely, and cost-efficient delivery. This paper proposes a novel supply chain management framework on a consortium blockchain with last-mile delivery through crowdsourced vehicles and UAVs. The blockchain-based framework aims to provide last-mile delivery for time-critical tasks in a transparent and cost-efficient manner. A blockchain-hosted Gale-Shapley Matching mechanism is designed for allocating delivery tasks to UAVs and vehicles that will perform them timely and cost-efficiently. The allocation mechanism is incorporated in the proposed management framework consisting of smart contracts that autonomously respond to members' interactions. In addition, the framework stores the supply chain process data transparently and immutably. The performed experiments explore the feasibility of the proposed solution showing the increase in task allocation percentage (at least 6%) and reward (at least 50%) while reducing the delivery time (at least 23%) compared to the considered benchmarks.</p></div>","PeriodicalId":54346,"journal":{"name":"Vehicular Communications","volume":"47 ","pages":"Article 100761"},"PeriodicalIF":6.7,"publicationDate":"2024-03-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140173337","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}

{"title":"SoVEC: Social vehicular edge computing-based optimum route selection","authors":"Sushovan Khatua ,&nbsp;Anwesha Mukherjee ,&nbsp;Debashis De","doi":"10.1016/j.vehcom.2024.100764","DOIUrl":"10.1016/j.vehcom.2024.100764","url":null,"abstract":"<div><p>This paper proposes a new architecture <em><u>So</u>cial <u>V</u>ehicular <u>E</u>dge <u>C</u>omputing (SoVEC)</em> by integrating three domains: social network, vehicular ad-hoc network, and mobile edge computing. The users access various mobile applications and share various types of information on the social network during travel time. Using SoVEC three categories of social networks are generated based on the type of information shared among the users such as traffic information, professional information, and personal interests. To reach the destination in minimal time, this paper proposes an optimum route selection strategy based on TOPSIS method and genetic algorithm. The SoVEC is simulated using the network simulator Qualnet 7, and average delay, jitter, and throughput are determined. A case study of generating social network based on road traffic-related information is also demonstrated. Finally, the effectiveness of the proposed approach for selecting the optimum route is assessed, and the results present that the proposed method outperforms the existing algorithms.</p></div>","PeriodicalId":54346,"journal":{"name":"Vehicular Communications","volume":"47 ","pages":"Article 100764"},"PeriodicalIF":6.7,"publicationDate":"2024-03-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140173300","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}

{"title":"DRCLAS: An efficient certificateless aggregate signature scheme with dynamic revocation in vehicular ad-hoc networks","authors":"Rui Guo ,&nbsp;Ruihan Dong ,&nbsp;Xiong Li ,&nbsp;Yinghui Zhang ,&nbsp;Dong Zheng","doi":"10.1016/j.vehcom.2024.100763","DOIUrl":"10.1016/j.vehcom.2024.100763","url":null,"abstract":"<div><p>The emergence of the Vehicular Ad-hoc Networks (VANETs) has greatly enhanced the efficiency and safety of transportation systems. However, due to the dynamicness and openness of vehicular networks, it is vulnerable for VANETs to confront various security threats. The dissemination of disinformation and the occurrence of attacks within these networks can result in severe damage and compromise the overall security of transportation systems. To mitigate such challenges, this paper presents an efficient certificateless aggregate signature scheme with dynamic revocation in VANETs. Taking use of the early-stopping factorial bitwise divisions (EFBD) algorithm, it achieves the invalid signatures tracking, and revokes the malicious vehicles dynamically. In addition, by combining the fingerprint counting bloom filter (FP-CBF), the trust assessment mechanism and the cloud server, it enables the vehicle to remedy its incorrect signatures. At last, through the comprehensive security and performance analysis, it demonstrates that this protocol enjoys improved communication security and computational efficiency.</p></div>","PeriodicalId":54346,"journal":{"name":"Vehicular Communications","volume":"47 ","pages":"Article 100763"},"PeriodicalIF":6.7,"publicationDate":"2024-03-15","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140173238","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}

{"title":"Data accuracy in Vehicle-to-X cooperative awareness messages: An experimental study for the first commercial deployment of C-ITS in Europe","authors":"Maximilian Bauder ,&nbsp;Andreas Festag ,&nbsp;Tibor Kubjatko ,&nbsp;Hans-Georg Schweiger","doi":"10.1016/j.vehcom.2024.100744","DOIUrl":"https://doi.org/10.1016/j.vehcom.2024.100744","url":null,"abstract":"<div><p>Cooperative Intelligent Transportation Systems have achieved a mature technology stage and are in an early phase of mass deployment in Europe. Relying on Vehicle-to-X communication, these systems were primarily developed to improve traffic safety, efficiency, and driving comfort. However, they also offer great opportunities for other use cases. One of them is forensic accident analysis, where the received data provide details about the status of other traffic participants, give insights into the accident scenario, and therefore help in understanding accident causes. A high accuracy of the sent information is essential: For safety use cases, such as traffic jam warning, a poor accuracy of the data may result in wrong driver information, undermine the usability of the system and even create new safety risks. For accident analysis, a low accuracy may prevent the correct reconstruction of an accident. This paper presents an experimental study of the first generation of Cooperative Intelligent Transportation Systems in Europe. The results indicate a high accuracy for most of the data fields in the Vehicle-to-X messages, namely speed, acceleration, heading and yaw rate information, which meet the accuracy requirements for safety use cases and accident analysis. In contrast, the position data, which are also carried in the messages, have larger errors. Specifically, we observed that the lateral position still has an acceptable accuracy. The error of the longitudinal position is larger and may compromise safety use cases with high accuracy requirements. Even with limited accuracy, the data provide a high value for the accident analysis. Since we also found that the accuracy of the data increases for newer vehicle models, we presume that Vehicle-to-X data have the potential for exact accident reconstruction.</p></div>","PeriodicalId":54346,"journal":{"name":"Vehicular Communications","volume":"47 ","pages":"Article 100744"},"PeriodicalIF":6.7,"publicationDate":"2024-03-06","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"https://www.sciencedirect.com/science/article/pii/S2214209624000196/pdfft?md5=cf7428d15ec06780200a6433b03dc530&pid=1-s2.0-S2214209624000196-main.pdf","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140121900","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}

{"title":"On energy conservation for fixed-wing UAV assisted practical full-duplex relaying with service requirement and bank angle limit","authors":"Xuan Zhu ,&nbsp;Xiaodong Ji ,&nbsp;Senyi Shi ,&nbsp;Jian-Feng Gu","doi":"10.1016/j.vehcom.2024.100749","DOIUrl":"10.1016/j.vehcom.2024.100749","url":null,"abstract":"<div><p>This paper studies a full-duplex (FD) amplify-and-forward relaying, where a fixed-wing unmanned aerial vehicle (UAV) is dispatched as a mobile relay to serve a source-destination communication pair so as to satisfy their service requirement. Here, the UAV relay flies in a circular path and hence it must continuously change its heading of flight which leads to a bank angle of the aircraft. In order to ensure flight safety, therefore, a bank angle limit is imposed on the UAV relay. By considering a practical FD relaying, namely, there exists both residual loop interference (RLI) and processing time-delay at the relay side, novel signal to interference plus noise ratio (SINR) received at the destination is analyzed, giving a closed-form expression in addition to a concise lower-bound. Armed with the SINR analysis, the size of data received by the destination during a period of flight time of the UAV is calculated, leading to a closed-form lower-bound of the size of data. Taking bank angle limit into consideration and using the calculated lower-bound of the size of data, an optimization problem with the purpose of energy conservation is solved, leading to a novel method for joint adjustment of the UAV's flight parameters. Computer simulation experiments are conducted, and the results demonstrated that the proposed optimization method performs better in terms of energy conservation compared to the benchmark techniques regardless of the value of RLI and/or the service requirement of the source-destination communication pair.</p></div>","PeriodicalId":54346,"journal":{"name":"Vehicular Communications","volume":"47 ","pages":"Article 100749"},"PeriodicalIF":6.7,"publicationDate":"2024-03-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"140046061","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}