MétaCan
Menu
Back to cohort
Record W2164224206 · doi:10.1109/icnp.2006.320213

Virtual Surrounding Face Geocasting with Guaranteed Message Delivery for Ad Hoc and Sensor Networks

2006· article· en· W2164224206 on OpenAlex
Jie Lian, Kshirasagar Naik, Yunhao Liu, Lei Chen

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

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicMobile Ad Hoc Networks
Canadian institutionsUniversity of Waterloo
Fundersnot available
KeywordsComputer networkComputer scienceWireless ad hoc networkTransmission (telecommunications)Protocol (science)Wireless sensor networkGeocastMobile ad hoc networkData transmissionWirelessVehicular ad hoc networkDistributed computingTelecommunicationsNetwork packetMedicine

Abstract

fetched live from OpenAlex

Geocasting in wireless sensor networks and ad hoc networks is the delivery of a message from a source to all the nodes in a given geographical region. The objectives of a geocasting protocol are two-folds: guaranteed message delivery and low transmission cost. Most of the existing protocols do not guarantee message delivery, and those that do incur a high transmission costs. In this paper, we introduce the idea of a virtual surrounding face (VSF), and present a geocasting protocol based on VSF. By using mathematical analyses and simulation studies, we show that the proposed protocol guarantees message delivery and has a significant lower transmission cost than the existing approaches.

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

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.001
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.011
GPT teacher head0.211
Teacher spread0.200 · 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

Quick stats

Citations29
Published2006
Admission routes1
Has abstractyes

Explore more

Same topicMobile Ad Hoc NetworksFrench-language works237,207