Suresense: sustainable wireless rechargeable sensor networks for the smart grid
Bibliographic record
Abstract
The electrical power grid has recently been embracing the advances in Information and Communication Technologies (ICT) for the sake of improving efficiency, safety, reliability and sustainability of electrical services. For a reliable smart grid, accurate, robust monitoring and diagnosis tools are essential. Wireless Sensor Networks (WSNs) are promising candidates for monitoring the smart grid, given their capability to cover large geographic regions at low-cost. On the other hand, limited battery lifetime of the conventional WSNs may create a performance bottleneck for the long-lasting smart grid monitoring tasks, especially considering that the sensor nodes may be deployed in hard to reach, harsh environments. In this context, recent advances in Radio Frequency (RF)-based wireless energy transfer can increase sustainability of WSNs and make them operationally ready for smart grid monitoring missions. RF-based wireless energy transfer uses Electromagnetic (EM) waves and it operates in the same medium as the data communication protocols. In order to achieve timely and efficient charging of the sensor nodes, we propose the Sustainable wireless Rechargeable Sensor network (SuReSense). SuReSense employs mobile chargers that charge multiple sensors from several landmark locations. We propose an optimization model to select the minimum number of landmarks according to the locations and energy replenishment requirements of the sensors.
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.000 | 0.000 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.003 | 0.001 |
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".