MétaCan
Menu
Back to cohort
Record W2963148427 · doi:10.1109/tvt.2019.2930885

Analysis of a Distance-Based Pairing Scheme for Collaborative Content Distribution via Device-to-Device Communications

2019· article· en· W2963148427 on OpenAlex
Wei Song

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.
fundA Canadian funder is recorded on the work.

Bibliographic record

VenueIEEE Transactions on Vehicular Technology · 2019
Typearticle
Languageen
FieldComputer Science
TopicCaching and Content Delivery
Canadian institutionsUniversity of New Brunswick
FundersNatural Sciences and Engineering Research Council of Canada
KeywordsPairingScheme (mathematics)Content distributionComputer scienceComputer networkElectronic engineeringEngineeringPhysicsMathematics

Abstract

fetched live from OpenAlex

With the increasing penetration of smart devices, device-to-device (D2D) communications offer a promising paradigm to accommodate the ever-growing mobile video traffic and unremitting demands for fast content distribution. The redundant storage and communication capacities of smart devices can be exploited for collaborative content caching and distribution. Such united resources at the network edge can serve end users with low delivery cost and high performance. In this paper, we analyze a heuristic distance-based scheme, which appropriately pairs a device requesting a content item with a cache device within a collaboration distance and providing the requested content. An analytical framework is developed to derive the optimal collaboration distance so as to maximize the likelihood that the paired cache devices successfully fulfill the content requests. The simulation results validate the analytical framework and the effectiveness of the heuristic distance-based scheme for D2D-assisted content distribution. We also investigate the effects of various system parameters on the performance in terms of expected satisfaction probability.

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: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.826
Threshold uncertainty score0.687

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0010.003
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0010.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.032
GPT teacher head0.262
Teacher spread0.230 · 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