Energy Efficient and Fault Tolerant Routing Protocol for Mobile Sensor Network
Bibliographic record
Abstract
Designing energy efficient and reliable routing protocols for mobility centric Wireless Sensor Networks (WSN) applications such as wildlife monitoring, battlefield surveillance and health monitoring is a great challenge since topology of the network changes frequently. Existing cluster-based routing protocols such for LEACH-Mobile, LEACH-Mobile-Enhanced, CBR-Mobile that are designed for mobile sensor network only consider the energy efficiency of the sensor nodes. Moreover, these protocols allocate extra timeslots using TDMA scheme to accommodate nodes that enter a cluster due to mobility and hence, increases end-to-end delay. In this paper, we propose a Fault Tolerant Clustering Protocol for Mobile WSN (FTCP-MWSN) that is not only energy efficient but also reliable by introducing fault tolerance mechanism. Moreover, FTCP-MWSN does not use any extra timeslot for calculating mobility and thus, reduces end-to-end delay. Simulation results show FTCP-MWSN protocol has more network lifetime, reliability than the existing LEACH-Mobile and LEACH-Mobile-Enhanced protocols.
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.001 | 0.000 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 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".