MétaCan
Menu
Back to cohort
Record W2159753173 · doi:10.1109/glocom.2009.5425854

Capacity of Wireless Multi-hop Networks Using Physical Carrier Sense and Transmit Power Control

2009· article· en· W2159753173 on OpenAlexaff
Eren Gürses, Raouf Boutaba

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicWireless Networks and Protocols
Canadian institutionsUniversity of Waterloo
Fundersnot available
KeywordsTransmitter power outputPower controlComputer scienceComputer networkSense (electronics)Wireless networkTopology (electrical circuits)WirelessHop (telecommunications)Carrier sense multiple access with collision avoidanceNetwork topologyPower (physics)TelecommunicationsElectrical engineeringEngineeringTransmitterThroughputChannel (broadcasting)

Abstract

fetched live from OpenAlex

In this paper, we investigate the capacity of CSMA (carrier sense multiple access) based wireless multi-hop networks with random topologies described by the hop length distribution. First we develop an analytical model for the effective link capacity as a function of transmit power adaptation policy, physical carrier sense threshold, hop length distribution and medium access probability of p-persistent CSMA. Secondly, we devise an optimal transmit power control scheme that maximizes the network capacity by adjusting the transmit power and the corresponding physical carrier sense threshold. Thereafter, it is extended for the joint optimization of these parameters with the medium access probability of CSMA. Finally we compare the optimal power control scheme with the minimum transmit power policy in. Results show that the proposed power control scheme optimally trades off the spatial reuse (number of interfering links) to the link SIR (signal-to-interference ratio) and achieves an amount of ~%15 increase in network capacity when both schemes employ joint optimization.

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.010
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.013

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0020.010
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0010.001
Bibliometrics0.0010.001
Science and technology studies0.0000.002
Scholarly communication0.0020.003
Open science0.0010.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.021
GPT teacher head0.260
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

Citations5
Published2009
Admission routes1
Has abstractyes

Explore more

Same topicWireless Networks and ProtocolsFrench-language works237,207