A New Transport Layer Sensor Network Protocol
Bibliographic record
Abstract
Wireless sensor networks (WSN) are becoming a viable tool for many monitoring applications. These applications may be of critical nature where the transportation of the information of events from the region of interest to some base station or sink is crucial, where the data loss cannot be tolerated. In the other direction, the information (for the purpose of control or management) sent from the base station to the sensor nodes can be very sensitive to loss as well. For example, in re-tasking sensors nodes, sending a program image to them is challenging. A loss of a single message, associated with the program code, would leave the image useless and the whole re-tasking process would fail. To deal with this issue, a reliable transport protocol is needed that can guarantee the delivery of packets and can cater to the special needs and characteristics of WSN. In this paper, we discuss the importance and the need of the transport layer protocol for wireless sensor networks and review some existing work. We also propose to implement the transport layer protocol on two-tiered wireless sensor network, a clustering-based architecture where the cluster-heads, more powerful in resources and features, can deal with the responsibilities of a transport layer protocol, and can provide the reliability in data transmission
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 imitationNot 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.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.002 | 0.004 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.002 | 0.002 |
| Science and technology studies | 0.002 | 0.001 |
| Scholarly communication | 0.004 | 0.007 |
| Open science | 0.004 | 0.003 |
| Research integrity | 0.002 | 0.004 |
| Insufficient payload (model declined to judge) | 0.007 | 0.004 |
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 source (direct Gemma or distilled Codex), 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".