MétaCan
Menu
Back to cohort
Record W2095379324 · doi:10.1145/2641798.2641813

Transmission power control-based opportunistic routing for wireless sensor networks

2014· article· en· W2095379324 on OpenAlexafffund
Rodolfo W. L. Coutinho, Azzedine Boukerche, Luiz F. M. Vieira, Antônio A. F. Loureiro

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicMobile Ad Hoc Networks
Canadian institutionsUniversity of Ottawa
FundersConselho Nacional de Desenvolvimento Científico e TecnológicoNatural Sciences and Engineering Research Council of CanadaCoordenação de Aperfeiçoamento de Pessoal de Nível SuperiorCanada Research Chairs
KeywordsComputer networkComputer scienceWireless sensor networkRouting protocolReliability (semiconductor)Network packetTransmission (telecommunications)ForwarderWirelessEnergy consumptionPower controlGeographic routingWireless Routing ProtocolPower (physics)TelecommunicationsEngineeringElectrical engineering

Abstract

fetched live from OpenAlex

Energy efficient and reliable communication are two very important and conflicting requirements in the design of large-scale, self-organizing wireless sensor networks (WSNs). By reducing the transmission power level of the nodes, energy conservation is achieved whereas the communication reliability is degraded. We propose a novel opportunistic routing protocol to reduce the energy consumption while keep the communication reliability in acceptable levels. Transmission power Control-based Opportunistic Routing (TCOR) saves energy by reducing the transmission power of the nodes while maintains the communication reliability by employing the opportunistic forwarding paradigm, leveraging the broadcast nature of wireless transmission medium. We propose an expected energy cost function for next-hop forwarder set selection, which considers the multiple available transmission power levels and the impact of each one on the next-hop packet reception probability.

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

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.002
Meta-epidemiology (narrow)0.0010.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.001
Science and technology studies0.0000.001
Scholarly communication0.0010.001
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.012
GPT teacher head0.229
Teacher spread0.217 · 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

Citations36
Published2014
Admission routes2
Has abstractyes

Explore more

Same topicMobile Ad Hoc NetworksFrench-language works237,207