Energy Efficient Resource Allocation for eHealth Monitoring Wireless Body Area Networks With Backscatter Communication
Bibliographic record
Abstract
Electronic Health (eHealth) monitoring systems with wireless body area networks (WBANs) have recently emerged as promising solutions to provide sustainable and high-quality health services. In this paper, we propose an optimization framework to maximize the energy efficiency (EE) of a WBAN assisted by backscatter communication (BackCom) and energy harvesting technologies, subject to quality-of-service and power budget constraints. More specifically, the optimization problem jointly optimizes the transmit power of the aggregator, transmission time, and backscatter time of the WBAN consisting of energy-constrained sensor nodes (SNs) which have the ability to harvest energy from the signals transmitted by the aggregator. A generalized gamma distribution is adopted to characterize the channel propagation characteristics of patients under different arbitrary body movements and their corresponding transmission requirements during daily life activities. It is shown that the formulated EE optimization problem is a quasi-concave nonlinear fractional program, and it is transformed to an equivalent parametric problem by using the Dinkelbach algorithm to obtain the solution. We exploit the structure of the optimization problem and propose a low-complexity iterative-based suboptimal heuristic with performance fairly close to the optimized solution. Simulation results demonstrate the effectiveness of the proposed schemes in maximizing EE of the WBAN, whereas the comparisons with the related work from the literature reaffirm the superiority of the proposed algorithms.
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.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.000 |
| Bibliometrics | 0.000 | 0.001 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.000 |
| Insufficient payload (model declined to judge) | 0.001 | 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".