MétaCan
Menu
Back to cohort
Record W1987469009 · doi:10.1109/sarnof.2009.4850301

Sink mobility in wireless sensor networks: When theory meets reality

2009· article· en· W1987469009 on OpenAlex
Natalija Vlajic, Dusan Stevanovic

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
TopicEnergy Efficient Wireless Sensor Networks
Canadian institutionsYork University
Fundersnot available
KeywordsWireless sensor networkSink (geography)Computer scienceSoftware deploymentEnergy consumptionComputer networkMobility modelWirelessWireless networkKey distribution in wireless sensor networksTelecommunicationsEngineeringElectrical engineering

Abstract

fetched live from OpenAlex

The use of sink mobility in wireless sensor networks (WSN) is commonly recognized as one of the most effective means of load balancing, ultimately leading to fewer failed nodes and longer network lifetime. The aim of this paper is to provide a comprehensive overview and evaluation of various deployment strategies involving sink mobility. The evaluation of the surveyed techniques is based on the traditional performance metrics (energy consumption, network lifetime, delay) as well as their practical feasibility in real-world WSN applications. We believe that by combining analytical and real- world perspective on various issues concerning sink mobility, the content of this paper will be appreciated by both theoreticians and practitioners working in the field of wireless sensor networks.

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.002
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesMeta-epidemiology (narrow)
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.897
Threshold uncertainty score1.000

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0020.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.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.014
GPT teacher head0.239
Teacher spread0.225 · 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

Citations21
Published2009
Admission routes1
Has abstractyes

Explore more

Same topicEnergy Efficient Wireless Sensor NetworksFrench-language works237,207