MétaCan
Menu
Back to cohort
Record W4250183891 · doi:10.1504/ijsnet.2018.096205

Passive and greedy beaconless geographic routing for real-time data dissemination in wireless networks

2018· article· en· W4250183891 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

VenueInternational Journal of Sensor Networks · 2018
Typearticle
Languageen
FieldComputer Science
TopicWireless Networks and Protocols
Canadian institutionsUniversity of British Columbia
Fundersnot available
KeywordsComputer scienceComputer networkGeographic routingStateless protocolNetwork packetGreedy algorithmNode (physics)Wireless sensor networkRouting (electronic design automation)Hop (telecommunications)Real-time computingDistributed computingRouting protocolStatic routingAlgorithm

Abstract

fetched live from OpenAlex

Real-time geographic routing is one of the most popular examples relying on a greedy algorithm to deliver real-time data in wireless networks. Each sender node decides a next-hop node among one-hop neighbours in stateless manner. However, this sender-side decision paradigm suffers from periodic and network-wide beaconing to discover neighbour nodes. To overcome the limitation, this paper suggests a passive and greedy beaconless real-time routing, called PGBR. To forward real-time data by receiver-side selection, PGBR focuses on two major challenging issues: a delay estimation procedure and a contention function design. The delay estimation procedure estimates both waiting delay and packet transmission delay used for the contention function. PGBR also redesigns receiver-side contention function with deliberating the estimated delay and discuss combinations of important metrics for the contention. The experimental results show that PGBR could improve the energy-efficiency as well as keeps high delivery deadline success ratio.

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.001
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: Empirical · Consensus signal: none
Teacher disagreement score0.954
Threshold uncertainty score0.729

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.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.001
Open science0.0020.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.017
GPT teacher head0.305
Teacher spread0.288 · 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