MétaCan
Menu
Back to cohort
Record W2156812364 · doi:10.1109/twc.2009.080453

Scaling laws of single-hop cognitive networks

2009· article· en· W2156812364 on OpenAlexaff
Mai Vu, Vahid Tarokh

Bibliographic record

VenueIEEE Transactions on Wireless Communications · 2009
Typearticle
Languageen
FieldComputer Science
TopicCooperative Communication and Network Coding
Canadian institutionsMcGill University
FundersArmy Research OfficeMultidisciplinary University Research Initiative
KeywordsCognitive radioTransmitterTransmitter power outputComputer scienceCognitive networkThroughputTransmission (telecommunications)Computer networkScalingCognitionTopology (electrical circuits)TelecommunicationsWirelessMathematicsChannel (broadcasting)

Abstract

fetched live from OpenAlex

We consider a cognitive network consisting of n cognitive users uniformly distributed with constant density among primary users. Each user has a single transmitter and a single receiver, and the primary and cognitive users transmit concurrently. The cognitive users use single-hop transmission in two scenarios: (i) with constant transmit power, and (ii) with transmit power scaled according to the distance to a designated primary transmitter. We show that, in both cases, the cognitive users can achieve a throughput scaled linearly with the number of users n. The first scenario requires the cognitive users to have the transmitter-receiver (Tx-Rx) distance bounded, but it can be arbitrarily large. Then with high probability, any network realization has the throughput scaling linearly with n. The second scenario allows the cognitive Tx-Rx distance to grow with the network at a feasible exponent as a function of the path loss and the power scaling factors. In this case, the average network throughput grows at least linearly with n and at most as n log(n). These results suggest that single-hop transmission may be a suitable choice for cognitive transmission.

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.001
metaresearch head score (Gemma)0.007
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.002
Threshold uncertainty score0.008

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.007
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.000
Bibliometrics0.0010.001
Science and technology studies0.0010.002
Scholarly communication0.0020.002
Open science0.0010.001
Research integrity0.0010.001
Insufficient payload (model declined to judge)0.0020.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.057
GPT teacher head0.296
Teacher spread0.239 · 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

Citations57
Published2009
Admission routes1
Has abstractyes

Explore more

Same venueIEEE Transactions on Wireless CommunicationsSame topicCooperative Communication and Network CodingFrench-language works237,207