Overlap-Minimization Scheduling Strategy for Data Transmission in VANET
Yong Zhang, Mao Ye, Lin Guan

TL;DR
This paper introduces an overlap-minimization scheduling strategy for VANETs that reduces packet collisions and delays by scheduling transmission start times, improving data delivery and network performance.
Contribution
It proposes a novel connection-level scheduling algorithm overlaid on CSMA/CA to minimize transmission overlaps and collision probability in VANETs.
Findings
Significantly improves packet delivery ratio (PDR)
Reduces data packet collisions
Enhances network delay performance
Abstract
The vehicular ad-hoc network (VANET) based on dedicated short-range communication (DSRC) is a distributed communication system, in which all the nodes share the wireless channel with carrier sense multiple access/collision avoid (CSMA/CA) protocol. However, the competition and backoff mechanisms of CSMA/CA often bring additional delays and data packet collisions, which may hardly meet the QoS requirements in terms of delay and packets delivery ratio (PDR). Moreover, because of the distribution nature of security information in broadcast mode, the sender cannot know whether the receivers have received the information successfully. Similarly, this problem also exists in no-acknowledge (non-ACK) transmissions of VANET. Therefore, the probability of packet collisions should be considered in broadcast or non-ACK working modes. This paper presents a connection-level scheduling algorithm…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
