MétaCan
Menu
Back to cohort
Record W2503451167 · doi:10.1109/pimrc.1995.477308

A multiple access scheme for wireless access to a broadband ATM LAN based on polling and sectored antennas

2002· article· en· W2503451167 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 institutionsCarleton University
Fundersnot available
KeywordsComputer sciencePollingComputer networkAsynchronous Transfer ModeBroadband networksHybrid automatic repeat requestAutomatic repeat requestPower controlWirelessWireless broadbandReal-time computingBroadbandWireless networkTelecommunications linkTelecommunicationsPower (physics)

Abstract

fetched live from OpenAlex

An adaptive polling scheme for multiple access in a broadband wireless local area networks (LANs) is proposed. It is designed to accommodate asynchronous transfer mode (ATM) traffic with a large and variable range of bit rates. The radio architecture is microcellular, with switched sectored-beam antennas and a small frequency reuse factor. Features of the multiple access scheme include polling rate depending on a terminal's average bit rate, fixed-length frames divided into segments corresponding to base antenna sectors, and automatic-repeat-request (ARQ) for error control, combined with randomized sector segment ordering. The steady-state performance (cell loss, call blocking and dropping probabilities, waiting time, and buffer occupancy) are evaluated by simulation for an open indoor environment, and for handoff, ARQ, and simple power control enhancements; focusing mainly on the effects of the propagation and interference conditions.

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 categoriesScholarly communication
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.945
Threshold uncertainty score1.000

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.0010.001
Open science0.0030.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.108
GPT teacher head0.342
Teacher spread0.234 · 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

Citations11
Published2002
Admission routes1
Has abstractyes

Explore more

Same topicWireless Communication Networks ResearchFrench-language works237,207