Adaptive Sleeping Periods in IEEE 802.15.4 for Efficient Energy Savings: Markov-Based Theoretical Analysis
Bibliographic record
Abstract
The strict resource-constrained conditions under which Wireless Sensor Networks (WSNs) operate impose primary restrictions on power consumption. Algorithms implemented on sensor nodes should refrain from performing complex computations in order to prolong the lifetime of the overall WSN. The IEEE 802.15.4 standard is the appropriate suite of specifications that conforms to the distinguished characteristics of WSNs. This standard is suited for low data rate, low power, and low radio transmission ranges that are typical in WSNs. This paper proposes a modification to the IEEE 802.15.4 standard that achieves efficient power savings for the sensor nodes, better channel utilization, and improved reliability. The proposal is based on the addition of a sleeping state that allows nodes to save more power while reducing the level of packet collisions. The sleeping periods can be tuned such that the highest level of channel utilization is achieved. A theoretical analysis based on Markov chain is performed to derive a mathematical model for our proposal. Using Matlab software, we show that we can achieve high levels of channel utilization, enhance reliability, and save more power compared to the performance of the original IEEE 802.15.4 standard.
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.007 |
| 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.002 | 0.003 |
| Open science | 0.002 | 0.001 |
| Research integrity | 0.001 | 0.002 |
| Insufficient payload (model declined to judge) | 0.004 | 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".