Optimizing the Control Channel Interval of the DSRC for Vehicular Safety Applications
Bibliographic record
Abstract
Dedicated short-range communication (DSRC) technology has been adopted by the IEEE community to enable safety and nonsafety applications for vehicular ad hoc networks. To better serve these two classes of applications, the DSRC standard divides the bandwidth into seven channels. One channel, which is called the control channel (CCH), serves safety applications, and the other six channels, which are called service channels, serve nonsafety applications. The DSRC standard specifies a channel-switching scheme to allow vehicles to alternate between these two classes of applications. The standard also recommends that vehicles should visit the CCH every 100 ms, which is called the synchronization interval (SI), to send and receive their status messages. It is highly desirable that these status messages be delivered to the neighboring vehicles reliably and within an acceptable delay bound. It is obvious that increasing the time share of the CCH from the SI will increase the reliability of safety applications. In this paper, we propose two algorithms to optimize the length of the control channel interval (CCI) such that nonsafety applications have a fair share of the SI interval. One algorithm, which is called optimal channel access, is proposed to allow vehicles to access the channel with a derived optimal probability such that the successful transmission rate is maximized. The second algorithm, which is called the mobility- and topology-aware algorithm, is an adaptive scheme proposed to change the DSRC parameters based on the road and network conditions to allow the coexistence of safety and nonsafety applications on the DSRC. Vehicles will execute both algorithms in a distributed manner to achieve a high success rate within the selected CCI interval. The simulation results show that using the two new algorithms keeps the CCI below half of the SI in all scenarios while maintaining a high success rate for safety messages. This will give nonsafety applications the opportunity to work in the second half of the SI interval without jeopardizing the critical safety applications.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
How this classification was reachedexpand
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.000 | 0.001 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one teacher head, not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".