MétaCan
Menu
Back to cohort
Record W2122975771 · doi:10.1109/ccnc.2007.170

Hybrid Data Dissemination Approach for Sensor Network with Multiple Cooperative Sinks

2007· article· en· W2122975771 on OpenAlexaff
Sonia Hashish, A. Karmouch

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicOpportunistic and Delay-Tolerant Networks
Canadian institutionsUniversity of Ottawa
Fundersnot available
KeywordsScalabilitySynchronizingComputer scienceDistributed computingDisseminationComputer networkSimple (philosophy)Wireless sensor networkSoftwareOperating systemTelecommunicationsTransmission (telecommunications)

Abstract

fetched live from OpenAlex

In this paper, we introduce a hybrid scalable approach for data-gathering and dissemination in sensor networks. The approach maintains the desirable on-demand communication feature of the pull technique by synchronizing its underling push and pull components. At the same time, scalability is achieved by allowing sinks to cooperatively embed virtual network sectorizing. The mechanism has two phases. First, virtual boards are constructed to form virtual closed sectors where queries are announced. Second, nodes located outside these boards initiate local bridges to carry their active events to the first board they encounter. Bridges are only created when boards are constructed. We validate our proposed solution with a simple analytical model and extensive software simulation. The initial investigation shows that our integrated protocol promises an efficient and scalable paradigm for data-gathering and dissemination in sensor networks that reduces the communication cost and leads to load balancing.

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.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: none
GenreCandidate signal: Methods · Consensus signal: none
Teacher disagreement score0.985
Threshold uncertainty score0.481

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.036
GPT teacher head0.277
Teacher spread0.240 · 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
GenreMethods

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

Citations4
Published2007
Admission routes1
Has abstractyes

Explore more

Same topicOpportunistic and Delay-Tolerant NetworksFrench-language works237,207