MétaCan
Menu
Back to cohort
Record W1580069493 · doi:10.1109/icc.2015.7248801

A novel D2D data offloading scheme for LTE networks

2015· article· en· W1580069493 on OpenAlexaff
Zehua Wang, Vincent W. S. Wong

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicOpportunistic and Delay-Tolerant Networks
Canadian institutionsUniversity of British Columbia
Fundersnot available
KeywordsComputer networkComputer scienceUploadBluetoothReuseCellular networkTelecommunications linkSpectrum managementScheme (mathematics)Channel (broadcasting)WirelessTelecommunicationsOperating system

Abstract

fetched live from OpenAlex

Downloading remote files (e.g., pictures, videos) from online social networks via smart user equipments (UEs) (e.g., smartphones, tablets) is becoming popular. Friends who are nearby may want to download the same files shared by their mutual acquaintance. People can obtain these files in a device-to-device (D2D) manner via opportunistic connections to reduce their payment for data service. This is referred to as D2D data offloading. However, D2D communications on unlicensed spectrum using Bluetooth or WiFi-Direct may not maintain high data rate when many D2D pairs nearby need to communicate simultaneously. Since D2D connections are transient, it is important to improve spatial reuse of communication resources and increase the data rate of opportunistic D2D communications. In this paper, we propose a scheme to reuse the downlink licensed spectrum of cellular networks for D2D data offloading. Our proposed scheme includes determining the availability of digital files on neighbouring devices, estimating the channel gains, and performing channel allocation and power control for D2D pairs. Simulation results show that our proposed scheme does not affect the existing cellular UEs and it can also offload more data traffic when compared with WiFi-Direct on an unlicensed spectrum.

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 machine prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.001
Version: metacan-v3-hybrid-931329e0061cValidation 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.007
Threshold uncertainty score0.013

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0000.001
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.000
Bibliometrics0.0010.001
Science and technology studies0.0020.000
Scholarly communication0.0010.001
Open science0.0010.001
Research integrity0.0010.000
Insufficient payload (model declined to judge)0.0010.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.249
GPT teacher head0.323
Teacher spread0.075 · 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

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designSimulation or modeling
Domainnot available
GenreEmpirical

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

Quick stats

Citations16
Published2015
Admission routes1
Has abstractyes

Explore more

Same topicOpportunistic and Delay-Tolerant NetworksFrench-language works237,207