Towards a global IoT: Resource re-utilization in WSNs
Bibliographic record
Abstract
The Internet of Things (IoT) is envisioned as a paradigm shift, with a plethora of applications, on the premise of well-established enabling technologies; prominently Wireless Sensor Networks (WSNs) and RFIDs. The former has evolved to improve energy efficiency and resilient operation, yet true scalability has only been recently probed and quite sparsely advanced. Moreover, the traditional approach, whereby most WSN platforms are tailored for a single-application, imposes significant rigidity in re-utilizing platforms for new applications, and limitations on re-using previously deployed ones. In remedy, we present a novel paradigm in WSNs to efficiently utilize network resources, and extend it to a platform for multiple applications to cross-utilize resources over multiple WSNs. We present the approach in three phases; the first calibers resources in the network and their usability. Then applications are represented as finite sets of functional requirements. Finally, we present an optimization approach to find an optimal mapping between applications and resources. This paradigm presents a leap in scalability, not only in a WSN but across multiple ones, dynamically accommodating varying resources being introduced and removed; in addition to utilizing transient resources in their vicinity. To this end, we present an architecture to efficiently adopt WSNs in IoT with changing demands and scale. Our approach is further explained and demonstrated via a detailed use case depicting the premise of IoT applications.
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.001 | 0.001 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.002 | 0.005 |
| Open science | 0.001 | 0.002 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 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 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".