MétaCan
Menu
Back to cohort
Record W2059929071 · doi:10.1145/1292331.1292409

On high-throughput and fair multi-hop wireless ad hoc networks with MIMO

2006· article· en· W2059929071 on OpenAlexaff
Yihu Li, Ahmed Safwat

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicWireless Networks and Protocols
Canadian institutionsQueen's University
Fundersnot available
KeywordsGoodputComputer networkComputer scienceWireless ad hoc networkSpatial multiplexingMultiple Access with Collision Avoidance for WirelessAd hoc wireless distribution serviceThroughputMIMOVehicular ad hoc networkWireless networkService setNetwork allocation vectorWirelessOptimized Link State Routing ProtocolIEEE 802.11Wi-FiTelecommunicationsChannel (broadcasting)

Abstract

fetched live from OpenAlex

Nowadays, the prevalence of multimedia applications mandates that wireless networks provide higher throughput and increased spatial efficiency. Aimed primarily at achieving this goal, the first IEEE 802.11n draft was recently approved. In the draft, MIMO and frame aggregation are utilized to improve the PHY and MAC layers in single-hop WLANs by achieving high raw rates and goodput. However, in the context of multi-hop wireless ad hoc networks, the hidden terminal, exposed terminal, and deafness problems remain unsolved by IEEE 802.11n. Consequently, this greatly degrades the MAC efficiency in multi-hop wireless ad hoc networks, even in the presence of frame aggregation. In this paper, we propose a novel MAC scheme that utilizes MIMO distributed spatial multiplexing to solve all the aforementioned problems, resulting in high throughput and fairness in multi-hop wireless ad hoc networks. Moreover, our scheme can be integrated with frame aggregation to further enhance the network performance.

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.004
metaresearch head score (Gemma)0.006
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.004
Threshold uncertainty score0.020

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0040.006
Meta-epidemiology (narrow)0.0010.001
Meta-epidemiology (broad)0.0010.000
Bibliometrics0.0010.001
Science and technology studies0.0020.003
Scholarly communication0.0020.003
Open science0.0010.002
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.009
GPT teacher head0.223
Teacher spread0.213 · 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

Citations4
Published2006
Admission routes1
Has abstractyes

Explore more

Same topicWireless Networks and ProtocolsFrench-language works237,207