MétaCan
Menu
Back to cohort
Record W2107386394 · doi:10.1109/pccc.2003.1203708

Minimum-energy broadcast routing in wireless multi-hop networks

2003· article· en· W2107386394 on OpenAlexaff
Song Guo, Ou Yang

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicMobile Ad Hoc Networks
Canadian institutionsUniversity of Ottawa
Fundersnot available
KeywordsComputer scienceComputer networkEnergy consumptionInteger programmingLinear programmingRelayGeographic routingDistributed computingHop (telecommunications)WirelessHeuristicRouting (electronic design automation)Routing protocolDynamic Source RoutingMathematical optimizationPower (physics)TelecommunicationsEngineeringMathematicsAlgorithmElectrical engineering

Abstract

fetched live from OpenAlex

Energy conservation is a critical issue in wireless multi-hop networks since the nodes are powered by batteries only. One major metric for energy conservation is to route a communication session along the routes which requires the lowest total energy consumption. In this paper, based on the concepts of virtual relay, we present a constraint formulation for the minimum-energy broadcast routing problem in terms of mixed integer linear programming (MIP). Moreover the model extends its analytical capability into more general scenarios in asymmetric networks, where few studies have addressed the broadcast routing problem before. The experiment results show that in a typical multi-hop network with node less than 50, optimal solution can be always solved in a timely manner, and save up to 30% power consumption compared to the most efficient heuristic algorithm BIP known so far.

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.955
Threshold uncertainty score0.876

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.0000.000
Open science0.0010.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.015
GPT teacher head0.232
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 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
Published2003
Admission routes1
Has abstractyes

Explore more

Same topicMobile Ad Hoc NetworksFrench-language works237,207