Abstract
Reliable data transmission in Vehicular Ad-hoc Networks (VANETs) is critical for the safety and efficiency of autonomous and connected vehicle systems. This paper proposes a connection-level scheduling strategy that minimizes the temporal overlap of data transmissions to mitigate the limitations of standard CSMA/CA protocols. By utilizing a low-complexity Transmission Scheduling Greedy Search (TSGS) algorithm as an overlay on existing IEEE 802.11p hardware, the system achieves a significant reduction in packet collisions and a ~10% improvement in packet delivery ratios without requiring rigid time-slot synchronization.
Introduction
Most current VANET implementations rely on Dedicated Short-Range Communication (DSRC) based on the Carrier Sense Multiple Access with Collision Avoidance (CSMA/CA) protocol. While effective in low-density scenarios, CSMA/CA suffers from "hidden terminal" problems and excessive delays in high-density traffic or broadcast modes. Traditional solutions often involve complex Time Division Multiple Access (TDMA) schemes that require perfect synchronization, which is difficult to maintain in fast-moving vehicular environments. This research addresses these challenges by introducing a centralized scheduling coordinator that optimizes transmission timing at the connection level.
Methodology
System Architecture
The proposed approach utilizes a hybrid architecture where a Roadside Unit (RSU) acts as a scheduling coordinator. Vehicles communicate their transmission requirements, such as data rates and deadlines, to the RSU via a control channel. The RSU then calculates and broadcasts optimal start times for each vehicle.
Overlap Minimization and the TSGS Algorithm
The core innovation is treating transmission scheduling as a geometric overlap problem. By minimizing the temporal overlap (denoted as $\epsilon$) between different data connections, the probability of simultaneous backoff stages—and thus collisions—is drastically reduced.
To ensure real-time feasibility, the researchers developed the Transmission Scheduling Greedy Search (TSGS) algorithm. While finding an absolute optimal schedule for $N$ connections is computationally expensive ($O(M^N)$), TSGS schedules connections sequentially based on previously fixed ones, reducing complexity to $O(MN)$. This allows the RSU to provide rapid scheduling updates to vehicles within its range.
Experimental Setup
The strategy was validated through a sophisticated simulation pipeline:
- Road Topology: Real-world map data of the M1 highway near Loughborough University, UK, was sourced from OpenStreetMap (OSM).
- Traffic Modeling: Realistic vehicle trajectories were generated using the SUMO (Simulation of Urban MObility) simulator.
- Network Modeling: The IEEE 802.11p radio layers and scheduling logic were simulated using OMNeT++ and the Veins framework.
Key Results
The TSGS algorithm was compared against a standard "random sending" baseline, which represents typical distributed CSMA/CA behavior. Key findings include:
- Packet Delivery Ratio (PDR): The TSGS algorithm achieved an average PDR of 86.11%, a significant improvement over the 76.33% achieved by the baseline.
- Collision Mitigation: As the available scheduling window increased, the TSGS algorithm successfully reduced packet collisions to zero, whereas the random sending approach continued to experience significant packet loss.
- Scalability and Efficiency: The performance of TSGS improved monotonically with the size of the scheduling window, demonstrating its ability to effectively utilize available time resources to separate transmissions.
Conclusion and Future Work
This overlap-minimization strategy provides a practical, low-complexity solution for improving VANET reliability. By acting as an overlay, it maintains compatibility with existing IEEE 802.11p hardware while solving coordination issues inherent in distributed systems. Future research will focus on testing the system in ultra-dense urban environments and exploring the integration of Software Defined Networking (SDN) to enhance global control and routing integration.
Summary updated