MétaCan
Menu
Back to cohort
Record W2122771729 · doi:10.1109/icc.2009.5199428

Routing to a Mobile Data Collector on a Predefined Trajectory

2009· article· en· W2122771729 on OpenAlexaff
Waleed Alsalih, Hossam S. Hassanein, Selim G. Akl

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicEnergy Efficient Wireless Sensor Networks
Canadian institutionsQueen's University
Fundersnot available
KeywordsComputer scienceTrajectoryNode (physics)Scheme (mathematics)Data transmissionComputer networkWireless sensor networkRouting (electronic design automation)Data lossTransmission (telecommunications)Real-time computingWirelessEngineeringTelecommunications

Abstract

fetched live from OpenAlex

In this paper, we propose a distributed scheme for data gathering using a mobile data collector in wireless sensor networks (WSNs). In our scheme, a mobile data collector moves along a predefined track over the sensing field and data are forwarded to nodes whose transmission disks overlap with the trajectory of the data collector; these nodes are called relaying nodes. Data are classified into two categories: delay-sensitive data and delay-tolerant data. While delay-sensitive data are sent to the data collector directly, delay-tolerant data may be sent to a nearby relaying node, where they wait for the data collector to come and pick them up. We give a theoretical analysis to quantify the impact of data collector mobility on the lifetime of the network as compared to a WSN with a stationary data collector. Moreover, we use simulations to evaluate our scheme in practice. Simulation results show that our scheme has the potential to prolong the lifetime of the network significantly.

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 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 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.724
Threshold uncertainty score0.591

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.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.029
GPT teacher head0.268
Teacher spread0.239 · 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 teacher head, 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

Citations19
Published2009
Admission routes1
Has abstractyes

Explore more

Same topicEnergy Efficient Wireless Sensor NetworksFrench-language works237,207