An Energy-Efficient Backpressure Routing and Scheduling Algorithm for Wireless Sensor Networks
Bibliographic record
Abstract
Much previous work had demonstrated the remarkable performance of backpressure based routing and scheduling algorithms in wireless sensor networks (WSNs). However, the absence of consideration on energy use efficiency in the design of existing backpressure based algorithms makes them difficult to be deployed in resource-limited WSNs. In this paper, we study how to improve the energy use efficiency of backpressure based algorithm. For this purpose, we propose an energy efficient backpressure routing and scheduling algorithm (EBP) for WSNs. In EBP, a new link weight calculation method is designed, based on which nodal energy status is considered when making decisions on backpressure based transmission scheduling. In EBP, packets are encouraged to be forwarded to nodes with more residual energy while the throughput-optimality of backpressure based algorithm is still preserved. Simulation results show that EBP can obtain significant performance improvements in terms of energy use efficiency, network throughput, and packet delivery ratio as compared with existing work.
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.001 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.001 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.004 | 0.001 |
| 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".