MétaCan
Menu
Back to cohort
Record W2167406707 · doi:10.1109/icc.2005.1494581

Channel assignment in multi-hop TDD W-CDMA cellular networks

2005· article· en· W2167406707 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
FieldComputer Science
TopicWireless Communication Networks Research
Canadian institutionsQueen's University
Fundersnot available
KeywordsComputer scienceComputer networkCode division multiple accessHop (telecommunications)Cellular network

Abstract

fetched live from OpenAlex

Relaying is a fundamental concept in multi-hop wireless ad hoc networks whereby communications between mobile terminals are carried out through intermediate nodes. The small distance and the potential high transmission rate between the relaying entities draws our attention to the significance of multi-hop relaying in hot and/or dead spots. Consequently, when relaying is employed in cellular networks, poor communications to and from the base station due to severe multi-path fading and/or noise can be avoided. Hence, in this paper, multi-hop relaying is used as an overlay architecture for single-hop time division duplex (TDD) wideband-code division multiple access (W-CDMA) cellular networks. A major challenge pertaining to the introduction of this technology into cellular networks is the design of an efficient slot assignment algorithm for relaying nodes. In this paper, we propose a heuristic slot assignment scheme, namely delay-sensitive slot assignment (DSSA). DSSA is capable of fully utilizing a limited number of channels to enhance spatial reuse and reduce the end-to-end delay.

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.001
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: Methods · Consensus signal: none
Teacher disagreement score0.949
Threshold uncertainty score0.560

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.001
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0020.001
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.051
GPT teacher head0.297
Teacher spread0.246 · 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

Citations23
Published2005
Admission routes1
Has abstractyes

Explore more

Same topicWireless Communication Networks ResearchFrench-language works237,207