Wireless Sensor Networks for Cost-Efficient Residential Energy Management in the Smart Grid
Bibliographic record
Abstract
Wireless sensor networks (WSNs) will play a key role in the extension of the smart grid towards residential premises, and enable various demand and energy management applications. Efficient demand-supply balance and reducing electricity expenses and carbon emissions will be the immediate benefits of these applications. In this paper, we evaluate the performance of an in-home energy management (iHEM) application. The performance of iHEM is compared with an optimization-based residential energy management (OREM) scheme whose objective is to minimize the energy expenses of the consumers. We show that iHEM decreases energy expenses, reduces the contribution of the consumers to the peak load, reduces the carbon emissions of the household, and its savings are close to OREM. On the other hand, iHEM application is more flexible as it allows communication between the controller and the consumer utilizing the wireless sensor home area network (WSHAN). We evaluate the performance of iHEM under the presence of local energy generation capability, prioritized appliances, and for real-time pricing. We show that iHEM reduces the expenses of the consumers for each case. Furthermore, we show that packet delivery ratio, delay, and jitter of the WSHAN improve as the packet size of the monitoring applications, that also utilize the WSHAN, decreases.
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.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.001 |
| Open science | 0.000 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.002 | 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".