MétaCan
Menu
Back to cohort
Record W1605102876 · doi:10.1109/wimob.2005.1512937

Optimal wireless sensor networks (WSNs) deployment: minimum cost with lifetime constraint

2006· article· en· W1605102876 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

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicEnergy Efficient Wireless Sensor Networks
Canadian institutionsQueen's University
Fundersnot available
KeywordsSoftware deploymentWireless sensor networkComputer scienceProvisioningConstraint (computer-aided design)Distributed computingSet (abstract data type)Computer networkMathematical optimizationEngineeringMathematics

Abstract

fetched live from OpenAlex

Device deployment is a fundamental issue of WSN provisioning. The types, number, and locations of devices determine many intrinsic properties of a WSN, such as coverage, connectivity, cost and lifetime. In this paper, we explore the problem of the optimal WSN deployment, with an objective of minimizing the network cost with lifetime constraint. We discuss and identify the characteristics of a type of WSN applications. The ultimate objectives of the device deployment for such applications are presented and discussed. We refine a deployment problem in a practical and fundamental scenario. We model this problem with the minimum set covering problem. Based on a recursive algorithm, a deterministic deployment strategy is proposed.

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 categoriesMeta-epidemiology (narrow)
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.761
Threshold uncertainty score1.000

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.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.007
GPT teacher head0.201
Teacher spread0.194 · 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

Citations87
Published2006
Admission routes1
Has abstractyes

Explore more

Same topicEnergy Efficient Wireless Sensor NetworksFrench-language works237,207