Search Results (114)

Urban air pollution caused by vehicular emissions remains one of the most pressing environmental challenges, negatively affecting both public health and climate processes. In Kokshetau, Kazakhstan, where electric vehicle (EV) adoption accounts for only 0.019% of the total fleet and charging infrastructure is nearly absent, reducing transport-related emissions requires short-term and cost-effective solutions. This study proposes an integrated approach combining urban ecology principles with computational modeling to optimize traffic signal control for emission reduction. An artificial neural network (ANN) was trained using intersection-specific traffic data to predict emissions of carbon monoxide (CO), nitrogen oxides (NO_x), sulfur dioxide (SO₂), and particulate matter (PM_2.5). The ANN was incorporated into a nonlinear optimization framework to determine traffic signal timings that minimize total emissions without increasing traffic delays. The results demonstrate reductions in emissions of CO by 12.4%, NO_x by 9.8%, SO₂ by 7.6%, and PM_2.5 by 10.3% at major congestion hotspots. These findings highlight the potential of the proposed framework to improve urban air quality, reduce ecological risks, and support sustainable transport planning. The method is scalable and adaptable to other cities with similar urban and environmental characteristics, facilitating the transition toward eco-friendly mobility and integrating data-driven traffic management into broader climate and public health policies. Full article

Vehicular Ad Hoc Networks (VANETs) support safety-critical and traffic-optimization applications through low-latency, reliable V2X communication. However, securing integrity and auditability with blockchain is challenging because conventional BFT-style consensus incurs high message overhead and latency. We introduce CoCoChain, a concept-aware consensus mechanism tailored to VANETs. Instead of exchanging full payloads, CoCoChain trains a sparse autoencoder (SAE) offline on raw message payloads and encodes each message into a low-dimensional concept vector; only the top-k activations are broadcast during consensus. These compact semantic digests are integrated into a practical BFT workflow with per-phase semantic checks using a cosine-similarity threshold $\theta =0.85$ (calibrated on validation data to balance detection and false positives). We evaluate CoCoChain in OMNeT++/SUMO across urban, highway, and multi-hop broadcast under congestion scenarios, measuring latency, throughput, packet delivery ratio, and Age of Information (AoI), and including adversaries that inject semantically corrupted concepts as well as cross-layer stress (RF jamming and timing jitter). Results show CoCoChain reduces consensus message overhead by up to 25% and confirmation latency by 20% while maintaining integrity with up to 20% Byzantine participants and improving information freshness (AoI) under high channel load. This work focuses on OBU/RSU semantic-aware consensus (not 6G joint sensing or multi-base-station fusion). The code, configs, and an anonymized synthetic replica of the dataset will be released upon acceptance. Full article

In recent years, fog-based vehicular ad hoc networks (VANETs) have become a hot research topic. Due to the inherent insecurity of open wireless channels between vehicles and fog nodes, establishing session keys through authenticated key agreement (AKA) protocols is critically important for securing communications. However, existing AKA schemes face several critical challenges: (1) When a large number of vehicles initiate AKA requests within a short time window, existing schemes that process requests one by one individually incur severe signaling congestion, resulting in significant quality of service degradation. (2) Many AKA schemes incur excessive computational and communication overheads due to the adoption of computationally intensive cryptographic primitives (e.g., bilinear pairings and scalar multiplications on elliptic curve groups) and unreasonable design choices, making them unsuitable for the low-latency requirements of VANETs. To address these issues, we propose a lightweight batch AKA scheme based on fog computing. In our scheme, when a group of vehicles requests AKA sessions with the same fog node within the set time interval, the fog node aggregates these requests and, with assistance from the traffic control center, establishes session keys for all vehicles by a round of operations. It has significantly reduced the operational complexity of the entire system. Moreover, our scheme employs Lagrange interpolation and lightweight cryptographic tools, thereby significantly reducing both computational and communication overheads. Additionally, our scheme supports conditional privacy preservation and includes a revocation mechanism for malicious vehicles. Security analysis demonstrates that the proposed scheme meets the security and privacy requirements of VANETs. Performance evaluation indicates that our scheme outperforms existing state-of-the-art solutions in terms of efficiency. Full article

Efficient task offloading for delay-sensitive applications, such as autonomous driving, presents a significant challenge in multi-hop Vehicular Edge Computing (VEC) networks, primarily due to high vehicle mobility, dynamic network topologies, and complex end-to-end congestion problems. To address these issues, this paper proposes a graph attention-based reinforcement learning algorithm, named GAPO. The algorithm models the dynamic VEC network as an attributed graph and utilizes a graph neural network (GNN) to learn a network state representation that captures the global topological structure and node contextual information. Building on this foundation, an attention-based Actor–Critic framework makes joint offloading decisions by intelligently selecting the optimal destination and collaboratively determining the ratios for offloading and resource allocation. A multi-objective reward function, designed to minimize task latency and to alleviate link congestion, guides the entire learning process. Comprehensive simulation experiments and ablation studies show that, compared to traditional heuristic algorithms and standard deep reinforcement learning methods, GAPO significantly reduces average task completion latency and substantially decreases backbone link congestion. In conclusion, by deeply integrating the state-aware capabilities of GNNs with the decision-making abilities of DRL, GAPO provides an efficient, adaptive, and congestion-aware solution to the resource management problems in dynamic VEC environments. Full article

Intelligent transport systems are a major component of smart cities because their deployment should result in reduced journey times, less traffic congestion and a significant reduction in road deaths, which will greatly improve the quality of life of their citizens. New technologies such as vehicular networks allow more information be available in realtime, and this information can be used with new analytical models to obtain more accurate estimates of journey times. This would be extremely useful to drivers and will also enable transport authorities to optimise the transport network. This paper addresses these issues using a model-based approach to provide a new way of estimating the delay along specified routes. A journey is defined as the traversal of several road links and junctions from source to destination. The delay at the junctions is analysed using the zero-server Markov chain technique. This is then combined with the Jackson network to analyse the delay across multiple junctions. The delay at road links is analysed using an M/M/K/K model. The results were validated using two simulators: SUMO and VISSIM. A real scenario is also examined to determine the best route. The preliminary results of this model-based analysis look promising but more work is needed to make it useful for wide-scale deployment. Full article

The growing demand for bandwidth-intensive vehicular applications—particularly ultra-high-definition streaming and immersive panoramic video—is pushing current network infrastructures beyond their limits, especially in urban areas with severe congestion and degraded user experience. To address these challenges, we propose an aerial-assisted vehicular network architecture that integrates 6G base stations, distributed massive MIMO networks, visible light communication (VLC), and a heterogeneous aerial network of high-altitude platforms (HAPs) and drones. At its core is a context-aware dynamic bandwidth allocation algorithm that intelligently routes infotainment data through optimal aerial relays, bridging connectivity gaps in coverage-challenged areas. Simulation results show a 47% increase in average available bandwidth over conventional first-come-first-served schemes. Our system also satisfies the stringent latency and reliability requirements of emergency and live infotainment services, creating a sustainable ecosystem that enhances user experience, service delivery, and network efficiency. This work marks a key step toward enabling high-bandwidth, low-latency smart mobility in next-generation urban networks. Full article

Vehicle congestion and the environmental problems associated with the increasing vehicle fleet have led stakeholders to create solutions to these problems. Park-and-Ride (P&R) facilities are provided as a solution for public transportation to avoid increasing vehicular flow and using private vehicles. However, the optimal location of these facilities is still a challenge to be considered. Therefore, this article aims to present a systematic review of the mathematical models applied for P&R localization, using the PRISMA protocol to ensure a comprehensive analysis. A total of 44 articles between 2002 and 2025 were identified into four categories: decision support models, econometric models, optimization models, and other models. The review also examines the term distribution of urban contexts where the mathematical models are applied, distinguishing between Global North versus Global South urban contexts. The results showed the efficiency of mathematical models within the decision support models category due to their integration with multiple criteria. The econometric models analyze factors influencing user behavior, while the optimization models improve and optimize the efficiency of transport networks despite facing computational challenges. Finally, other models, such as multilevel programming and fuzzy logic, offer adaptive solutions for highly variable urban environments. The primary contribution of this study is its comprehensive application of the mathematical models used for the location of P&R facilities. This offers a systematic approach for anticipating future urban situations, developing supporting policies, and analyzing their effects. Full article

Efficient clustering algorithms are critical for enabling the timely dissemination of emergency messages across maximum coverage areas in vehicular networks. While existing clustering approaches demonstrate stability and scalability, there has been a limited amount of work focused on leveraging roadside units (RSUs) for cluster head selection. This research proposes a novel framework that utilizes RSUs to facilitate cluster head election, mitigating the cluster head selection process, clustering overhead, and broadcast storm problem. The proposed scheme mandates selecting an optimal number of cluster heads to maximize information coverage and prevent traffic congestion, thereby enhancing the quality of service through improved cluster head duration, reduced cluster formation time, expanded coverage area, and decreased overhead. The framework comprises three key components: (I) an acknowledgment-based system for legitimate vehicle entry into the RSU for cluster head selection; (II) an authoritative node behavior mechanism for choosing cluster heads from received notifications; and (III) the role of bridge nodes in maximizing the coverage of the established network. The comparative analysis evaluates the clustering framework’s performance under uniform and non-uniform vehicle speed scenarios for time-barrier-based emergency message dissemination in vehicular ad hoc networks. The results demonstrate that the proposed model’s effectiveness for uniform highway speed scenarios is 100% whereas for non-uniform scenarios 99.55% information coverage is obtained. Furthermore, the clustering process accelerates by over 50%, decreasing overhead and reducing cluster head election time using RSUs. The proposed approach outperforms existing methods for the number of cluster heads, cluster head election time, total cluster formation time, and maximum information coverage across varying vehicle densities. Full article

Cooperative Intelligent Transportation Systems (C-ITSs) are emerging as transformative technologies, paving the way for safe and fully automated driving solutions. As the demand for autonomous vehicles accelerates, the development of advanced Radio Access Technologies capable of delivering reliable, low-latency vehicular communications has become paramount. Standardized approaches for Vehicular-to-Everything (V2X) communication often fall short in addressing the dynamic and diverse requirements of multi-service, multi-priority systems. Conventional vehicular networks employ static parameters such as Access Category (AC) in IEEE 802.11p-based ITS-G5 and Resource Reservation Interval (RRI) in C-V2X PC5 for prioritizing different V2X services. This static parameter assignment performs unsatisfactorily in dynamic and diverse requirements. To bridge this gap, we propose intelligent Multi-Attribute Decision-Making algorithms for adaptive AC selection in ITS-G5 and RRI adjustment in C-V2X PC5, tailored to the varying priorities of active V2X services. These adaptations are integrated with a priority-aware rate-control mechanism to enhance congestion management. Through extensive simulations conducted using NS3, our proposed strategies demonstrate superior performance compared to standardized methods, achieving improvements in one-way end-to-end latency, Packet Reception Ratio (PRR) and overall communication reliability. Full article

The purpose of this study lies in developing a comparison of neural network-based models for vehicular congestion prediction, with the aim of improving urban mobility and mitigating the negative effects associated with traffic, such as accidents and congestion. This research focuses on evaluating the effectiveness of different neural network architectures, specifically Transformer and LSTM, in order to achieve accurate and reliable predictions of vehicular congestion. To carry out this research, a rigorous methodology was employed that included a systematic literature review based on the PRISMA methodology, which allowed for the identification and synthesis of the most relevant advances in the field. Likewise, the Design Science Research (DSR) methodology was applied to guide the development and validation of the models, and the CRISP-DM (Cross-Industry Standard Process for Data Mining) methodology was used to structure the process, from understanding the problem to implementing the solutions. The dataset used in this study included key variables related to traffic, such as vehicle speed, vehicular flow, and weather conditions. These variables were processed and normalized to train and evaluate various neural network architectures, highlighting LSTM and Transformer networks. The results obtained demonstrated that the LSTM-based model outperformed the Transformer model in the task of congestion prediction. Specifically, the LSTM model achieved an accuracy of 0.9463, with additional metrics such as a loss of 0.21, an accuracy of 0.93, a precision of 0.29, a recall of 0.71, an F1-score of 0.42, an MSE of 0.07, and an RMSE of 0.26. In conclusion, this study demonstrates that the LSTM-based model is highly effective for predicting vehicular congestion, surpassing other architectures such as Transformer. The integration of this model into a simulation environment showed that real-time traffic information can significantly improve urban mobility management. These findings support the utility of neural network architectures in sustainable urban planning and intelligent traffic management, opening new perspectives for future research in this field. Full article

Within the realm of intelligent transportation systems, the precise forecasting of vehicular speed across individual road segments constitutes a fundamental task. This metric serves as a pivotal indicator for evaluating the extent of network congestion and facilitating informed strategic planning. Contemporary methodologies predominantly employ recurrent neural networks (RNNs) to model temporal dependencies, while leveraging graph convolutional networks (GCNs) to capture spatial dependencies within the data. However, these methods fail to integrate temporal and spatial dependencies to establish global dependencies. This study introduces the spatio-temporal kernel graph convolutional network (STK-GCN), a novel framework designed for modeling and forecasting traffic data. Specifically, we devise a spatio-temporal kernel capable of generating both spatial and temporal matrices, which are subsequently utilized within a encoder–decoder architecture to concurrently capture spatio-temporal dependencies. Furthermore, we introduce a novel temporal graph convolution module to enhance temporal data. To demonstrate the efficacy of the proposed STK-GCN, comprehensive experiments were carried out on two real-world traffic datasets, namely METR-LA and PEMS-BAY. The results indicate that our model surpasses existing state-of-the-art methods. Full article

The Vehicular Edge-Cloud Computing (VECC) paradigm has gained traction as a promising solution to mitigate the computational constraints through offloading resource-intensive tasks to distributed edge and cloud networks. However, conventional computation offloading mechanisms frequently induce network congestion and service delays, stemming from uneven workload distribution across spatial Roadside Units (RSUs). Moreover, ensuring data security and optimizing energy usage within this framework remain significant challenges. To this end, this study introduces a deep reinforcement learning-enabled computation offloading framework for multi-tier VECC networks. First, a dynamic load-balancing algorithm is developed to optimize the balance among RSUs, incorporating real-time analysis of heterogeneous network parameters, including RSU computational load, channel capacity, and proximity-based latency. Additionally, to alleviate congestion in static RSU deployments, the framework proposes deploying UAVs in high-density zones, dynamically augmenting both storage and processing resources. Moreover, an Advanced Encryption Standard (AES)-based mechanism, secured with dynamic one-time encryption key generation, is implemented to fortify data confidentiality during transmissions. Further, a context-aware edge caching strategy is implemented to preemptively store processed tasks, reducing redundant computations and associated energy overheads. Subsequently, a mixed-integer optimization model is formulated that simultaneously minimizes energy consumption and guarantees latency constraint. Given the combinatorial complexity of large-scale vehicular networks, an equivalent reinforcement learning form is given. Then a deep learning-based algorithm is designed to learn close-optimal offloading solutions under dynamic conditions. Empirical evaluations demonstrate that the proposed framework significantly outperforms existing benchmark techniques in terms of energy savings. These results underscore the framework’s efficacy in advancing sustainable, secure, and scalable intelligent transportation systems. Full article

With the rapid development of the economy, urban road congestion has become more serious. The travel times for vehicles are becoming more uncontrollable, making it challenging to reach destinations on time. In order to find an optimal route and arrive at the destination with the shortest travel time, this paper proposes a dynamic shortest travel time path planning algorithm with an overtaking function (DSTTPP-OF) based on a vehicular ad hoc network (VANET) environment. Considering the uncertainty of driving vehicles, the target vehicle (vehicle for special tasks) is influenced by surrounding vehicles, leading to possible deadlock or congestion situations that extend travel time. Therefore, overtaking planning should be conducted through V2V communication, enabling surrounding vehicles to coordinate with the target vehicle to avoid deadlock and congestion through lane changing and overtaking. In the proposed DSTTPP-OF, vehicles may queue up at intersections, so we take into account the impact of traffic signals. We classify road segments into congested and non-congested sections, calculating travel times for each section separately. Subsequently, in front of each intersection, the improved Dijkstra algorithm is employed to find the shortest travel time path to the destination, and the overtaking function is used to prevent the target vehicle from entering a deadlocked state. The real-time traffic data essential for dynamic path planning were collected through a VANET of symmetrically deployed roadside units (RSUs) along the roadway. Finally, simulations were conducted using the SUMO simulator. Under different traffic flows, the proposed DSTTPP-OF demonstrates good performance; the target vehicle can travel smoothly without significant interruptions and experiences the fewest stops, thanks to the proposed algorithm. Compared to the shortest distance path planning (SDPP) algorithm, the travel time is reduced by approximately 36.9%, and the waiting time is reduced by about 83.2%. Compared to the dynamic minimum time path planning (DMTPP) algorithm, the travel time is reduced by around 18.2%, and the waiting time is reduced by approximately 65.6%. Full article

Traffic congestion imposes burdens on society and individuals. In 2022, the average congestion cost per auto commuter in the USA was USD1259. New possibilities to increase traffic efficiency are now available as vehicles can interact using Vehicular Ad Hoc Network (VANET) systems, a subset of the Internet of Vehicles (IoV). The traffic assignment problem deals with road network traffic optimization. It is a complex and challenging problem. A few solutions incorporating VANET technology have been presented; most are centralized or depend on infrastructure. In previous work, we introduced Road-ACO, an ant colony optimization (ACO), single-hop, decentralized, infrastructure-less, VANET solution. In this paper, we propose a new multi-hop-enabled, decentralized, ant-colony-inspired algorithm for dynamic highway traffic assignment. The algorithm works for large road networks and requires no infrastructure. We develop Veins framework-based simulations to evaluate the algorithm’s performance. The results indicate that the proposed algorithm consistently outperforms Road-ACO and performs optimally on road segments up to 4000 m long, with improvements of up to 40% on average travel time. Full article

Vehicular ad hoc networks (VANETs) enable communication among vehicles and between vehicles and infrastructure to provide safety and comfort to the users. Malicious nodes in VANETs may broadcast false information to create the impression of a fake event or road congestion. In addition, several malicious nodes may collude to collectively launch a false information attack to increase the credibility of the attack. Detection of these attacks is critical to mitigate the potential risks they bring to the safety of users. Existing techniques for detecting false information attacks in VANETs use different approaches such as machine learning, blockchain, trust scores, statistical methods, etc. These techniques rely on historical information about vehicles, artificial data used to train the technique, or coordination among vehicles. To address these limitations, we propose a false information attack detection technique for VANETs using an unsupervised anomaly detection approach. The objective of the proposed technique is to detect false information attacks based on only real-time characteristics of the network, achieving high accuracy and low processing delay. The performance evaluation results show that our proposed technique offers 30% lower data processing delay and a 17% lower false positive rate compared to existing approaches in scenarios with high proportions of malicious nodes. Full article