MétaCan
Menu
Back to cohort
Record W2170656436 · doi:10.1109/infocom.2008.4544661

Repetition-based broadcast in vehicular ad hoc networks in Rician channel with capture

2008· article· en· W2170656436 on OpenAlex

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldEngineering
Topicgraph theory and CDMA systems
Canadian institutionsUniversity of Toronto
Fundersnot available
KeywordsRician fadingComputer scienceRetransmissionQuality of serviceComputer networkThroughputCapture effectMultimedia Broadcast Multicast ServiceChannel (broadcasting)Transmission (telecommunications)Wireless ad hoc networkFadingWirelessTelecommunicationsNetwork packetMulticast

Abstract

fetched live from OpenAlex

In this paper we study the performance of different vehicular wireless broadcast schemes that rely on repetition as a means for providing reliable communications in Rician environment with capture effect. We investigate different patterns for retransmission and show that the one based on Optical Orthogonal Codes (OOC) performs better than others in terms of probability of success and delay. We propose using different numbers of repetitions for providing different Quality of Service (QoS) priority levels and show this method can effectively provide different QoS classes for different types of data without throughput loss. Probability of success and delay are obtained via simulation for three broadcast schemes in the presence of capture effect in Rician fading environment. Furthermore, analytical solutions are compared to simulation for transmission with no capture as a special case.

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.

Full frame distilled prediction

Teacher imitation

Not 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.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: Simulation or modeling
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.054
Threshold uncertainty score0.471

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0000.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.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.

Opus teacher head0.005
GPT teacher head0.153
Teacher spread0.148 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Quick stats

Citations32
Published2008
Admission routes1
Has abstractyes

Explore more

Same topicgraph theory and CDMA systemsFrench-language works237,207