MétaCan
Menu
Back to cohort
Record W2125156513 · doi:10.4304/jnw.4.1.1-8

Effective Location Management of Mobile Actors in Wireless Sensor and Actor Networks

2009· article· en· W2125156513 on OpenAlexaff
Nauman Aslam, William Phillips, William Robertson

Bibliographic record

VenueJournal of Networks · 2009
Typearticle
Languageen
FieldComputer Science
TopicEnergy Efficient Wireless Sensor Networks
Canadian institutionsDalhousie University
Fundersnot available
KeywordsComputer scienceWireless sensor networkWirelessMobile wirelessWireless networkComputer securityComputer networkTelecommunications

Abstract

fetched live from OpenAlex

Abstract—Recent years have witnessed an increasing availability of heterogeneous sensor networks that consist of a large number of resource constrained nodes (sensors) and a small number of powerful resource rich nodes (actors). Such heterogeneous Wireless Sensor Actor Network (WSANs) offer improvement of sensor networks' capacity/coverage, energy conservation and network lifetime. This paper investigates the case where sensors are organized into clusters and mobile actors are used for maintaining an energy efficient topology by periodically manipulating their geographical position. We present an elegant technique that allows actor nodes to find an optimal geographical location with respect to their associated cluster heads such that the overall energy consumed is minimized. The proposed technique includes a weighted cost function based on the residual energy levels of cluster heads that allows the mobile actor to optimally fine-tune its geographical location. We present simulation results that demonstrate a significant increase of network lifetime over the traditional cluster based WSN deployments. Index Terms—wireless sensor actor networks, mobile actors, clustering, energy efficiency, network lifetime. I.

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.

How this classification was reachedexpand

Full frame machine prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.001
metaresearch head score (Gemma)0.003
Version: metacan-v3-hybrid-931329e0061cValidation 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.001
Threshold uncertainty score0.005

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0010.003
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.001
Science and technology studies0.0010.001
Scholarly communication0.0010.002
Open science0.0010.001
Research integrity0.0010.000
Insufficient payload (model declined to judge)0.0010.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.004
GPT teacher head0.224
Teacher spread0.219 · 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

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designSimulation or modeling
Domainnot available
GenreEmpirical

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations9
Published2009
Admission routes1
Has abstractyes

Explore more

Same venueJournal of NetworksSame topicEnergy Efficient Wireless Sensor NetworksFrench-language works237,207