Empowering WBANs: Enhanced Energy Efficiency Through Cluster-Based Routing and Swarm Optimization
Bibliographic record
Abstract
Wireless body area networks (WBANs) have great potential to supply society with vital technical services, but the low power of network nodes severely hampers their development. To solve this problem, Energy-Efficient, a low-power cluster-based routing system intended for precise biological data gathering in WBANs, is presented in this study. This approach comprises three main stages: data aggregation, cluster head (CH) selection, and cluster creation. The suggested approach balances biosensor energy and optimizes energy usage by utilizing the modified snake swarm optimization algorithm (MSSOA) for routing and the adaptive binary bird swarm optimization algorithm (ABBSOA) for cluster formation and CH selection. The suggested technique outperforms the most recent WBAN routing protocols, including MT-MAC, ALOC, DHCO, and M-GWO, by using a power-balancing routing tree and considering biosensor distance and remaining energy. The experimental results demonstrate that the proposed ABBSOA-MSSOA model achieves a jitter protocol value of 0.3 ms at 100 nodes, a buffer occupancy ratio of 2.5%, a cluster lifetime of 600 s, a cluster building time of 12.2 s, an energy consumption of 42 mJ, a communication overhead of 8.3%, a packet delivery ratio of 98.2%, and an average end-to-end delay of 25 ms compared to other existing methods.
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.000 | 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.000 |
| Open science | 0.000 | 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 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".