MétaCan
Menu
Back to cohort
Record W2049531648 · doi:10.1109/wiopt.2008.4586087

A distributed power and rate control scheme for mobile ad hoc networks

2008· article· en· W2049531648 on OpenAlexaff
B. Alawieh, Yongning Zhang, Chadi Assi

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicWireless Networks and Protocols
Canadian institutionsConcordia University
Fundersnot available
KeywordsMultiple Access with Collision Avoidance for WirelessComputer scienceComputer networkDistributed coordination functionThroughputWireless ad hoc networkCapture effectNetwork packetHidden node problemPower controlCarrier sense multiple access with collision avoidanceIEEE 802.11Transmission (telecommunications)Energy consumptionProtocol (science)WirelessWireless networkPower (physics)EngineeringOptimized Link State Routing ProtocolTelecommunicationsElectrical engineeringWi-Fi array

Abstract

fetched live from OpenAlex

The IEEE 802.11 Distributed Coordination Function (DCF) is the medium access protocol widely used for wireless local networks (LAN). Unfortunately, IEEE 802.11 DCF described in the standard faces some challenges when adopted for multi hop networks, which arise from the presence of the so-called hidden stations. This can cause degradation of the network throughput performance and energy consumption. Solving the hidden terminal problem will increase the possibility of the so-called exposed terminal and vice versa. In this paper, we present a novel scheme, called PRAS-CP ( transmission power and rate adaptive scheme with collision prevention), which enhances network performance through balancing the tradeoff between the hidden terminals and the exposed terminals. To accomplish this, PRAS-CP integrates the Physical/MAC attributes ( the carrier sensing range and the interference range) and carrier sensing mechanisms (PCS, VCS) to assign the appropriate data rate and transmission power values to successfully exchange the RTS/CTS DATA/ACK packets. Simulation results under different scenarios are used to demonstrate the significant throughput, energy gains, and fairness that can be obtained by PRAS-CP.

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: none
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.959
Threshold uncertainty score0.408

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.012
GPT teacher head0.240
Teacher spread0.229 · 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

Citations2
Published2008
Admission routes1
Has abstractyes

Explore more

Same topicWireless Networks and ProtocolsFrench-language works237,207