MétaCan
Menu
Back to cohort
Record W2063930117 · doi:10.1109/glocom.2008.ecp.161

Efficient Rate Adaptation with QoS Support for Wireless Networks

2008· article· en· W2063930117 on OpenAlexaff
Khoder Shamy, Chadi Assi, Jad El‐Najjar

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicWireless Networks and Protocols
Canadian institutionsConcordia University
Fundersnot available
KeywordsComputer scienceQuality of serviceComputer networkThroughputLink adaptationNetwork packetPacket lossReal-time computingIEEE 802.11FadingFrame (networking)Wireless networkBandwidth (computing)Channel (broadcasting)WirelessTelecommunications

Abstract

fetched live from OpenAlex

Wireless LANs (WLANs) suffer degrading performance when operating within domestic areas due to multiple reasons such as: multi-path, fading, path loss and user mobility. To overcome this, transmission rate is usually adjusted to a more error-resistant rate. In this paper, we first present a novel rate adaptation algorithm for IEEE 802.11 that can efficiently identify the threshold frame error rate (FER) at which link adjustment is required, based on a simple throughput analysis at the MAC layer. Then, we extend our rate adaptation algorithm to support IEEE 802.11e quality of service (QoS) requirements. When a real-time stream with QoS requirements is admitted, critical constraints such as delay bound and maximum packet drop count are integrated in the selection of the most convenient transmission rate that best respects the flow requirements. Moreover, we use dynamic bandwidth allocation rather than the default transmission opportunities (TXOPs) in a way that best offers a flow the required time for retransmissions due to packet failure based on the variant loss rate present in the channel. We validate our proposed rate adaptation algorithms via simulation results where the efficiency and effectiveness of the algorithm are noticed for both best effort and QoS flows.

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 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.928
Threshold uncertainty score0.401

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.000
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0000.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.026
GPT teacher head0.240
Teacher spread0.214 · 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 teacher head, not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designSimulation or modeling
Domainnot available
GenreMethods

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
Published2008
Admission routes1
Has abstractyes

Explore more

Same topicWireless Networks and ProtocolsFrench-language works237,207