MétaCan
Menu
Back to cohort
Record W2135825905 · doi:10.1109/ainaw.2007.161

Effective Caching in Wireless Sensor Network

2007· article· en· W2135825905 on OpenAlex
Md Ashiqur Rahman, Sajid Hussain

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 institutionsAcadia University
Fundersnot available
KeywordsWireless sensor networkComputer scienceComputer networkKey distribution in wireless sensor networksWireless networkWirelessTelecommunications

Abstract

fetched live from OpenAlex

This paper proposes few ways of improving a WSN's energy efficiency that already uses an energy efficient data routing protocol for continuous monitoring application. The proposed improvements are (i) data negotiation, (ii) development of data change expectancy, and (iii) data vanishing. In data negotiation, an active sensor sends its sensed data only when the data changes. In expectancy development, a sensor develops the expectancy of when its sensed data might change. It then adjusts its sensing frequency accordingly to avoid unnecessary sensing. In data vanishing, duplicate sensed data from multiple sensors are discarded while routed to the BS. Together, the proposed improvements can be viewed as an emulated cache where latest sensed data are always known without requiring the sensors to sense and report continuously. Our simulation results also show significant WSN lifetime increase from this emulated caching.

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: Simulation or modeling
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.602
Threshold uncertainty score0.697

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.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.005
GPT teacher head0.226
Teacher spread0.221 · 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

Citations22
Published2007
Admission routes1
Has abstractyes

Explore more

Same topicEnergy Efficient Wireless Sensor NetworksFrench-language works237,207