Delay-Dependent Priority-Aware Transmission Scheduling for E-Health Networks: A Mechanism Design Approach
Bibliographic record
Abstract
In this paper, the management of medical packet transmissions in electronic health (e-health) networks is studied. Unlike most existing works in the literature, we focus on beyond wireless body area network (beyond-WBAN) communications, i.e., data transmissions from WBAN-gateways (e.g., smart phones) to the base station of medical centers, and consider a delay-dependent priority-aware transmission scheduling, which jointly takes into account both the criticality of medical packets and their starving time (i.e., experienced delays). In our model, medical packets are randomly aggregated at WBAN-gateways (each of which stands for one patient), and their beyond-WBAN transmission requests are reported to the base station with different priority information, which reflects their heterogeneities in medical importance. The base station then manages the beyond-WBAN transmissions following a constructed queueing system with a delay-dependent dynamic priority discipline. With the aim of maximizing the network welfare while preventing unexpected strategic behaviors from smart gateways, we design a truthful and efficient mechanism based on a virtual delay-dependent prioritized queueing game. Analytical and simulation results examine the feasibility of the proposed mechanism and demonstrate its superiority over the counterparts.
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.007 | 0.009 |
| Meta-epidemiology (narrow) | 0.001 | 0.001 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.002 |
| Scholarly communication | 0.003 | 0.003 |
| Open science | 0.005 | 0.002 |
| Research integrity | 0.002 | 0.002 |
| Insufficient payload (model declined to judge) | 0.003 | 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".