An Analytical Framework for IEEE 802.15.6-Based Wireless Body Area Networks With Instantaneous Delay Constraints and Shadowing Interruptions
Bibliographic record
Abstract
In this paper, a novel queueing analytical framework is proposed to evaluate the performance of IEEE 802.15.6-based carrier-sense multiple access with collision avoidance (CSMA/CA) scheduling in wireless body area networks with joint consideration of instantaneous delay constraints and body shadowing effects. Specifically, we develop an absorbing Markov chain to model the medium access process with error controls that is defined by the IEEE standard and design a random time-limited single vacation to describe the potential body shadowing interruption process. To guarantee the timeliness of received packets and avoid energy waste for transmitting valueless packets, an instantaneous delay constraint is carefully considered, which is then characterized by an overdeadline packet dropping process with a predefined waiting deadline. In our analysis, a Markovian arrival process is also adopted to capture the correlation of arrival traffic, and all other random processes are modeled by phase-type distributions, which make our framework more general and comprehensive. To address the inherent complexity of the original model, based on the transient queueing analysis, we develop a buffer-overflowing queueing principle to approximate the overdeadline packet dropping principle by solving a buffer length optimization problem. After that, we construct a multidimensional discrete-time Markov chain to analyze the stationary distribution through the matrix-geometric method. Performance measures, including the average delay, waiting time distribution, and packet transmission failure probability, are derived. The accuracy of our proposed analytical framework is validated by extensive simulations.
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.002 | 0.004 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.001 | 0.002 |
| Open science | 0.002 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 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".