MétaCan
Menu
Back to cohort
Record W2153133580 · doi:10.1145/1143549.1143614

Multi-hop CDMA cellular networks with power control

2006· article· en· W2153133580 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
KeywordsPower controlCellular networkTelecommunications linkComputer scienceInterference (communication)Code division multiple accessComputer networkHop (telecommunications)Spread spectrumPower (physics)Electronic engineeringEngineeringPhysics

Abstract

fetched live from OpenAlex

The concept of multi-hop CDMA cellular networks has been around for sometime now. It is a widely accepted assumption that using multi-hopping in cellular networks will increase the cellular capacity. This capacity increase has yet to be quantified. In this paper, this quantification is done, for the first time, for multi-hop CDMA cellular networks with power control. CDMA networks are interference limited. For this reason, interference is calculated at BSs and relaying MTs during an uplink slot, assuming power control is in use in all hops. The results for interference calculations show the possible increase in capacity, by increasing either the number of simultaneous calls or data rates. An increase of 23% in the number of supported simultaneous calls is shown to be possible even with relaying MTs being different than active MTs sending their own data. This paper derives formulas to calculate interference at BSs and MTs using power control in all hops. It also quantifies the potential capacity increase using multi-hopping with power control.

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

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.001
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0020.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.012
GPT teacher head0.238
Teacher spread0.226 · 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

Citations8
Published2006
Admission routes1
Has abstractyes

Explore more

Same topicWireless Communication Networks ResearchFrench-language works237,207