An energy efficient and low latency multiple events' propagation protocol for wireless sensor networks with multiple sinks
Bibliographic record
Abstract
This paper considers the tasks of multiple event detection and propagation in Wireless Sensor Networks (WSNs) thatare monitored by multiple Sinks. The event propagation is achieved by introducing extensions to the routing protocol for WSNs. To accomplish the task of multiple event propagation, the proposed extensions employ the routing protocol's properties. The first property of the protocol is the availability of multiple paths that are created and stored during a subscription message's propagation. The second property is based on providing Quality of Service (QoS) by selecting the route with the least cost for high-priority event notification messages. Moreover, the QoS property is extended to take into account the availability of multiple Sinks monitoring the WSN. We propose having a Distributed Database Management System over the multiple Sinks, which contains event notifications. This way, a high-priority event notification message can be delivered from asource node to the Sink toward which there exists a pathwith the least cost, and will be available in the database for the Sink that has subscribed to the event. We discuss the extensions to the routing protocol and present their proof of correctness.
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 imitationNot 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.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.001 | 0.000 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.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.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one teacher head, not a consensus.
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".