MétaCan
Menu
Back to cohort
Record W2584228689 · doi:10.1109/glocom.2016.7842279

Spatial Clustering in Slotted ALOHA Two-Hop Random Access for Machine Type Communication

2016· article· en· W2584228689 on OpenAlexaff
Ziwen Zhao, Sebastian S. Szyszkowicz, Tamer Beitelmal, Halim Yanıkömeroğlu

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldEngineering
TopicIoT Networks and Protocols
Canadian institutionsCarleton University
FundersMinistero dello Sviluppo Economico
KeywordsRandom accessAlohaComputer scienceCluster analysisBase stationComputer networkUploadMachine to machineChannel (broadcasting)Energy consumptionAccess methodPerformance metricDistributed computingThroughputWirelessTelecommunicationsInternet of ThingsEmbedded systemEngineeringOperating system

Abstract

fetched live from OpenAlex

The LTE random access procedures proposed in 3GPP for Machine Type Communication in current cellular systems may become overwhelmed when too many machine devices attempt to upload their data. In this paper, we propose a two-hop cluster random access based on slotted ALOHA communication. In each cluster, a cluster head (CH) is selected according to the channel gains. The CH aggregates data from cluster members and then initiates the LTE random access procedure to the base station. Due to the offloading from the random access channel to the slotted ALOHA, the number of contending devices is reduced, which alleviates the collision problem and results in better performance. The simplification of access procedure can also significantly decrease the energy consumption. We define a clustering metric for machine locations and we examine the impact of the metric on the performance. The simulation results show that as machine locations become more clustered, the overall performance improves.

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.002
metaresearch head score (Gemma)0.004
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: Simulation or modeling
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.003
Threshold uncertainty score0.008

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0020.004
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0010.001
Science and technology studies0.0010.001
Scholarly communication0.0010.002
Open science0.0020.001
Research integrity0.0010.001
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.025
GPT teacher head0.302
Teacher spread0.278 · 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

Citations12
Published2016
Admission routes1
Has abstractyes

Explore more

Same topicIoT Networks and ProtocolsFrench-language works237,207