Vehicular CommunicationsPub Date : 2026-04-01Epub Date: 2026-01-29DOI: 10.1016/j.vehcom.2026.101006
Maryam Taghizadeh, Mahmood Ahmadi
{"title":"A GWO-based approach for task scheduling in heterogeneous vehicular fog computing environments","authors":"Maryam Taghizadeh, Mahmood Ahmadi","doi":"10.1016/j.vehcom.2026.101006","DOIUrl":"10.1016/j.vehcom.2026.101006","url":null,"abstract":"<div><div>Vehicular Fog Computing (VFC) empowers automotive networks with fog computing, ensuring minimal delays for user services and vehicle operations. This study introduces a novel meta-heuristic algorithm for optimizing task scheduling in Vehicular Fog Computing (VFC). Leveraging Grey Wolf Optimization (GWO), the method differentiates between static and dynamic fog nodes, representing stationary servers and moving vehicles, respectively. Afterwards, a new stage is applied to refine the results of the GWO. The purpose of this step is to identify the fog node with the highest workload and distribute a percentage of its workload to several other fog nodes. This will reduce waiting time and improve makespan. Lastly, resource-intensive tasks are prioritized and allocated to these nodes. The paper includes a thorough evaluation of the GWO-based approach, analyzing the impact of various algorithm parameters. Performance is assessed using both real-world applications and synthetic data.Moreover, our implementation is considered ARM processor as computing resources in dynamic fog node. Experimental results demonstrate that the proposed algorithm achieves lower monetary costs than existing solutions and it shows the improvement at wait and makespan.</div></div>","PeriodicalId":54346,"journal":{"name":"Vehicular Communications","volume":"58 ","pages":"Article 101006"},"PeriodicalIF":6.5,"publicationDate":"2026-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146072505","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}
Vehicular CommunicationsPub Date : 2026-04-01Epub Date: 2026-01-10DOI: 10.1016/j.vehcom.2026.100999
Sang-Quang Nguyen , Duy Tran Trung , Lam-Thanh Tu , Anh Le-Thi , Mui Van Nguyen
{"title":"Securing short-packet transmissions via partial NOMA: Performance analysis under keyhole fading","authors":"Sang-Quang Nguyen , Duy Tran Trung , Lam-Thanh Tu , Anh Le-Thi , Mui Van Nguyen","doi":"10.1016/j.vehcom.2026.100999","DOIUrl":"10.1016/j.vehcom.2026.100999","url":null,"abstract":"<div><div>This paper proposes a novel secure downlink framework that integrates Partial Non-Orthogonal Multiple Access (PNOMA) with short-packet communications (SPC) under keyhole fading channels, tailored for ultra-reliable low-latency (URLLC) services. Unlike prior studies that addressed NOMA, SPC, or keyhole effects in isolation, our work is the first to jointly consider all three aspects in a unified design. Closed-form expressions for the average secure block error rate (SBLER) and block error rate (BLER) are derived under both partial and full transmission information (PTI/FTI) assumptions at the eavesdropper, together with asymptotic analysis capturing the impact of blocklength, power allocation, and keyhole severity. Numerical simulations confirm that the proposed PNOMA-SPC system consistently outperforms conventional NOMA scheme in terms of latency, reliability, and secrecy, even under strong eavesdropping conditions. These contributions provide new theoretical and practical insights into the secure design of multiple access schemes for next-generation 6G URLLC scenarios.</div></div>","PeriodicalId":54346,"journal":{"name":"Vehicular Communications","volume":"58 ","pages":"Article 100999"},"PeriodicalIF":6.5,"publicationDate":"2026-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145957191","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":"Enhancing quantum-resistant data privacy in vehicular cloud networks using NIST-qualified FALCON algorithm","authors":"Mritunjay Shall Peelam , Brijesh Kumar Chaurasia , Man Mohan Shukla , Vinay Chamola","doi":"10.1016/j.vehcom.2025.100995","DOIUrl":"10.1016/j.vehcom.2025.100995","url":null,"abstract":"<div><div>Road safety, congestion, pollution, and data security are critical challenges in the development of smart transportation systems. Vehicular Ad-hoc Networks (VANETs) form the backbone of such systems by enabling real-time communication, accident management, and traffic monitoring. However, the vast data generated in VANETs is increasingly vulnerable in the post-quantum era, where traditional cryptographic methods like RSA, ECC, and DSA fail to withstand quantum attacks. To address this, we propose the integration of the NIST-qualified Falcon algorithm, a lattice-based post-quantum cryptographic scheme, to ensure confidentiality, integrity, and resilience of vehicular communication. The proposed scheme is implemented and evaluated in a Vehicular Network Cloud (VNC) environment on different computational platforms, including Apple Silicon M1 Max and AMD Ryzen systems. Experimental results demonstrate that Falcon achieves practical signing and verification delays (22 ms and 17 ms on M1), while maintaining robust key generation performance even at higher bit lengths. Comparative analysis with RSA and ECC shows Falcon’s superiority in quantum resistance and a balanced trade-off between computational cost and communication efficiency. Although Falcon incurs relatively higher encryption and decryption delays, its security guarantees and scalability make it a strong candidate for deployment in VANETs. This research confirms that Falcon provides a feasible, quantum-resistant solution for securing smart transportation ecosystems while meeting the stringent real-time requirements of vehicular communications.</div></div>","PeriodicalId":54346,"journal":{"name":"Vehicular Communications","volume":"58 ","pages":"Article 100995"},"PeriodicalIF":6.5,"publicationDate":"2026-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145894647","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}
Vehicular CommunicationsPub Date : 2026-04-01Epub Date: 2025-12-22DOI: 10.1016/j.vehcom.2025.100996
Vikas Hassija , Tamonash Majumder , Debangshu Roy , Raja Piyush , Vinay Chamola
{"title":"The role of large language models (LLMs) in enhancing intelligent transportation systems: A survey","authors":"Vikas Hassija , Tamonash Majumder , Debangshu Roy , Raja Piyush , Vinay Chamola","doi":"10.1016/j.vehcom.2025.100996","DOIUrl":"10.1016/j.vehcom.2025.100996","url":null,"abstract":"<div><div>Large Language Models (LLMs) are transforming Intelligent Transportation Systems (ITS) by shifting operations from static, rule based systems toward adaptive, data-driven decision-making. This paper presents a comprehensive methodological and application-focused survey of LLMs in ITS, grounded in transformer-based architectures like GPT-4, BERT, and LlaMa. We analyze the technical challenge of integrating diverse multimodal data including sensor logs, visual inputs, and textual reports via cross-modal fusion strategies. The survey examines key applications such as traffic signal optimization, predictive maintenance, V2X communication, public transport scheduling, and route personalization. Furthermore, we detail core methodologies (e.g., fine- tuning, Chain-of-Thought prompting, federated learning, RLHF) used to enhance LLM performance under real-time conditions and assess explainability frameworks (SHAP, LIME) to foster trust. We also identify critical challenges, including model hallucination, privacy risks, resource demands, and latency constraints. By synthesizing insights from over 200 primary research contributions, this work offers a foundational reference for designing scalable, intelligent, and ethically aligned ITS architectures.</div></div>","PeriodicalId":54346,"journal":{"name":"Vehicular Communications","volume":"58 ","pages":"Article 100996"},"PeriodicalIF":6.5,"publicationDate":"2026-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145813956","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}
Vehicular CommunicationsPub Date : 2026-04-01Epub Date: 2026-01-29DOI: 10.1016/j.vehcom.2026.101008
Lei Ding, Yi Zhi, Lina Zhu, Lu Ren, Lei Liu, Changle Li
{"title":"Traffic aware adaptive neighbor discovery for vehicular networks","authors":"Lei Ding, Yi Zhi, Lina Zhu, Lu Ren, Lei Liu, Changle Li","doi":"10.1016/j.vehcom.2026.101008","DOIUrl":"10.1016/j.vehcom.2026.101008","url":null,"abstract":"<div><div>In vehicular networks, neighbor discovery is achieved via frequently broadcasting a certain kind of control message, which is called beacon message. Since there are both control messages and various types of service messages which coexist and share wireless channels with limited communication resources, it is essential to balance the resource allocation between control messages and service messages. Specifically, if too much communication resource is allocated to transmit the control message, the communication quality of services may be degraded. Conversely, it may lead to unstable network connections and further impact the communication quality of services in vehicular networks. Thus in this work, we focus on optimizing the broadcast rate of beacon messages in a vehicular network by jointly considering the vehicle mobility, the channel randomness and the multi-traffic network characteristics, for achieving the optimal tradeoff between the accuracy and overhead of neighbor discovery. We first establish a theoretical analysis model for deriving the closed-form relationship between the stable hitting probability and the broadcast rate of beacon messages. Based on that, we then propose an optimal neighbor discovery scheme called Mobility and Multi-Traffic based Adaptive Neighbor Discovery method (MMTAND), which can adjust the broadcast rate of beacon messages according to dynamical network environments and achieve the optimal tradeoff between the accuracy and overhead of neighbor discovery. Extensive simulation results show that the proposed method outperforms the existing methods in terms of performance, which is expected to be applied to neighbor discovery in practical vehicular networks.</div></div>","PeriodicalId":54346,"journal":{"name":"Vehicular Communications","volume":"58 ","pages":"Article 101008"},"PeriodicalIF":6.5,"publicationDate":"2026-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146071828","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}
Vehicular CommunicationsPub Date : 2026-04-01Epub Date: 2026-02-04DOI: 10.1016/j.vehcom.2026.101007
Mingfeng Huang , Peng Wang , Athanasios V. Vasilakos , Hai Zhong
{"title":"Task offloading based on lightweight identity authentication and genetic optimization for the internet of vehicles","authors":"Mingfeng Huang , Peng Wang , Athanasios V. Vasilakos , Hai Zhong","doi":"10.1016/j.vehcom.2026.101007","DOIUrl":"10.1016/j.vehcom.2026.101007","url":null,"abstract":"<div><div>Task offloading ensures low-latency responsiveness for computation-intensive Internet of Vehicles applications by dynamically distributing workloads across vehicle, edge, and cloud resources. However, due to the dynamicity of vehicle networking environment, open access characteristics, and complex interactions between vehicles and servers, existing offloading methods face dual challenges of security threats and insufficient optimization efficiency. To address this, a task offloading scheme based on lightweight identity authentication and genetic optimization is proposed in this paper. First, we design an anonymous authentication mechanism based on elliptic curves, combined with pseudo-identity generation, verifiable signatures, and timestamp technology. It ensures the privacy of vehicles while supporting malicious node tracking, thereby guaranteeing the trustworthiness of nodes participating in task offloading. After that, an improved genetic optimization model is proposed, integrating elite retention strategy, multi-point crossover-mutation operations, and resource allocation penalty functions to dynamically adapt to vehicle mobility and server resource states, achieving globally optimal offloading decisions. Finally, extensive experiments demonstrate that the proposed scheme significantly outperforms the baseline methods in terms of secure signature efficiency, authentication speed, and task processing performance. It reduces task latency by 6.29%-34.14%, and reduces energy consumption by 9.54%-35.36%.</div></div>","PeriodicalId":54346,"journal":{"name":"Vehicular Communications","volume":"58 ","pages":"Article 101007"},"PeriodicalIF":6.5,"publicationDate":"2026-04-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"146135150","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":"GSAAS: A group signature-based anonymous authentication scheme for VANETs","authors":"Xinyang Deng , Xiaohong Wu , Qinggele Qi , Cong Zhao","doi":"10.1016/j.vehcom.2025.100988","DOIUrl":"10.1016/j.vehcom.2025.100988","url":null,"abstract":"<div><div>In vehicular ad-hoc networks (VANETs), ensuring robust security for vehicle identities and messages while maintaining essential service functionalities presents a significant challenge. This paper proposes a group signature-based anonymous authentication scheme for VANETs (GSAAS). GSAAS supports anonymous vehicle authentication within a certificateless framework, effectively mitigating the complexities associated with certificate management and distribution. To alleviate the high computation overhead on the Trust Authority (TA) and minimize the communication delay associated with pseudonym requests, the base station (BS) is employed as the group manager, enabling efficient group maintenance and pseudonym management, facilitating seamless vehicle authentication while ensuring secure data transmission. Security analysis demonstrates that GSAAS is robust against various attacks. Furthermore, performance analysis highlights the superior efficiency of GSAAS compared to existing schemes, with significant improvements in both computation and communication overheads in VANETs.</div></div>","PeriodicalId":54346,"journal":{"name":"Vehicular Communications","volume":"57 ","pages":"Article 100988"},"PeriodicalIF":6.5,"publicationDate":"2026-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145498831","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}
Vehicular CommunicationsPub Date : 2026-02-01Epub Date: 2025-11-04DOI: 10.1016/j.vehcom.2025.100986
Yongqiang Cui, Yiyang Zhang , Di Bai, Yi Diao, Yulei Wang
{"title":"3D map and mmWave radar-based self-localization for UAVs in GNSS-denied environments","authors":"Yongqiang Cui, Yiyang Zhang , Di Bai, Yi Diao, Yulei Wang","doi":"10.1016/j.vehcom.2025.100986","DOIUrl":"10.1016/j.vehcom.2025.100986","url":null,"abstract":"<div><div>Reliable self-localization of unmanned aerial vehicles (UAVs) in dense urban environments remains a major challenge due to the frequent unavailability or degradation of Global Navigation Satellite Systems (GNSS) and other radio signals. This paper presents a robust and cost-effective method for UAV self-localization by using vision and millimeter-wave (mmWave) radar data in GNSS-denied environments. The approach generates an initial dense point cloud through depth estimation and semantic segmentation, which is then geometrically refined using sparse mmWave radar point cloud. A semantic-guided clustering method is applied to the mmWave radar point cloud to remove noise and extract key structural elements such as walls, which are later fused with vision-based depth information. For positioning, image matching algorithm provides coarse localization, followed by fine registration that leverages geometric features of windows to enhance precision. Experimental results demonstrate that the proposed method can achieve self-localization accuracy within 0.4 m, while maintaining low system complexity and deployment cost, offering a practical solution for UAV self-localization in GNSS-denied urban scenarios.</div></div>","PeriodicalId":54346,"journal":{"name":"Vehicular Communications","volume":"57 ","pages":"Article 100986"},"PeriodicalIF":6.5,"publicationDate":"2026-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145442107","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}
Vehicular CommunicationsPub Date : 2026-02-01Epub Date: 2025-11-17DOI: 10.1016/j.vehcom.2025.100985
Timo Salomon , Lisa Maile , Philipp Meyer , Franz Korf , Thomas C. Schmidt
{"title":"Negotiating strict latency limits for dynamic real-time services in vehicular time-sensitive networks","authors":"Timo Salomon , Lisa Maile , Philipp Meyer , Franz Korf , Thomas C. Schmidt","doi":"10.1016/j.vehcom.2025.100985","DOIUrl":"10.1016/j.vehcom.2025.100985","url":null,"abstract":"<div><div>Future vehicles are expected to dynamically deploy in-vehicle applications within a Service-Oriented Architecture (SOA) while critical services continue to operate under hard real-time constraints. Time-Sensitive Networking (TSN) on the in-vehicle Ethernet layer is dedicated to ensure deterministic communication between critical services; its Credit-Based Shaper (CBS) supports dynamic resource reservations. However, the dynamic nature of service deployment challenges network resource configuration, since any new reservation may change the latency of already validated flows. Standard methods of worst-case latency analysis for CBS have been found incorrect, and current TSN stream reservation procedures lack mechanisms to signal application layer Quality-of-Service (QoS) requirements or verify deadlines.</div><div>In this paper, we propose and validate a QoS negotiation scheme that interacts with the TSN network controller to reserve resources while ensuring latency bounds. For the first time, this work comparatively evaluates reservation schemes using worst-case analysis and simulations of a realistic In-Vehicle Network (IVN) and demonstrates their impact on QoS guarantees, resource utilization, and setup times. We find that only one reservation scheme utilizing per-queue delay budgets and network calculus provides valid configurations and guarantees acceptable latency bounds throughout the IVN. The proposed service negotiation mechanism efficiently establishes 450 vehicular network reservations in just 11 ms.</div></div>","PeriodicalId":54346,"journal":{"name":"Vehicular Communications","volume":"57 ","pages":"Article 100985"},"PeriodicalIF":6.5,"publicationDate":"2026-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145535999","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}
Vehicular CommunicationsPub Date : 2026-02-01Epub Date: 2025-11-09DOI: 10.1016/j.vehcom.2025.100989
Huayu Liu , Hua Wu , Yang Liu , Hailong Dong , Hao Li
{"title":"A multi-layer based collaborative optimization (MCO) for multiple UAVs’ task allocation and scheduling","authors":"Huayu Liu , Hua Wu , Yang Liu , Hailong Dong , Hao Li","doi":"10.1016/j.vehcom.2025.100989","DOIUrl":"10.1016/j.vehcom.2025.100989","url":null,"abstract":"<div><div>Multiple unmanned aerial vehicles (UAVs) play a critical role in disaster response and rescue missions. This paper proposes a multi-layer based collaborative optimization (MCO) method, which consists of three stages: path preplanning, task allocation, and task scheduling. These three stages correspond to three levels that are upper level, middle level and lower level. A dynamic constrained particle swarm optimization (DPSO) is proposed for path preplanning in the upper layer by designing a kind of dynamic subpopulation division strategy. After that a clustered consensus-based bundle algorithm (CCBA) is designed to allocate different tasks to available UAVs based on preplanned paths to solve the problems of discontinuous task allocation and redundant paths. Then a multi-neighborhood variable simulated annealing (MNV-SA) algorithm is proposed to further optimize the task execution sequence of each UAV. To validate the effectiveness of MCO method, a set of experiments is conducted in a simulated disaster scenario based on a real urban environment. The results demonstrate that the proposed MCO method significantly improves the task execution benefits and reduces UAV flight distances across all scenarios. Particularly, in complex scenarios, MCO method outperforms CBBA, ACO, and PI algorithms in terms of task execution benefits by 14.01 %, 6.01 %, and 24.06 %, respectively.</div></div>","PeriodicalId":54346,"journal":{"name":"Vehicular Communications","volume":"57 ","pages":"Article 100989"},"PeriodicalIF":6.5,"publicationDate":"2026-02-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":null,"resultStr":null,"platform":"Semanticscholar","paperid":"145473283","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}