Fuzzy Algorithms for Maximum Lifetime Routing in Wireless Sensor Networks
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
We address the maximum lifetime routing problem in wireless sensor networks (WSNs) and propose two online routing algorithms based on fuzzy logic, namely fuzzy maximum lifetime algorithm and fuzzy multiobjective algorithm. The former attempts to maximize the WSN lifetime objective, whereas the latter strives to simultaneously optimize the lifetime as well as the energy consumption objectives. The distinguishing aspect of this work is the novel use of fuzzy membership functions and rules in the design of cost functions for the routing objectives considered in this work. A range of simulation results obtained under various network scenarios show that the proposed approach is superior to a number of other well-known online routing heuristics, both in terms of the obtained network lifetime as well as the average energy consumption.
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.
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.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.000 |
| Open science | 0.001 | 0.000 |
| 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 it