MétaCan
Menu
Back to cohort
Record W2001690738 · doi:10.1504/ijsnet.2014.066788

Maximum WSN coverage in environments of heterogeneous path loss

2014· article· en· W2001690738 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 · 2014
Typearticle
Languageen
FieldComputer Science
TopicEnergy Efficient Wireless Sensor Networks
Canadian institutionsAthabasca UniversityUniversity of Alberta
Fundersnot available
KeywordsComputer scienceWireless sensor networkRelayPath lossNode (physics)Path (computing)Computer networkReal-time computingTransmission (telecommunications)Log-distance path loss modelDistributed computingWirelessTelecommunications

Abstract

fetched live from OpenAlex

We study wireless sensor network (WSN) node placement in an environment where RF signal losses vary with position. This reflects real–world outdoor environments where vegetation and topography cause nonuniform path loss. Many techniques that solve for a variety of objective functions subject to various constraints have previously been proposed for node placement. However, many of these methods make simplifying assumptions such as all nodes having the same transmission range. Our goal is to take the insights and approaches of this previous ork and extend it to real–world environments. The present work assumes we have a map that quantifies the path loss behaviour of the real environment. Based on this map, and a path loss model that accounts for spatial variations in the path loss exponent, we propose a node placement algorithm for two–tiered WSNs that maximises the area covered by a specified number of relay nodes and sensor nodes.

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.656
Threshold uncertainty score0.718

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.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.211
Teacher spread0.205 · 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