MétaCan
Menu
Back to cohort
Record W2112531426 · doi:10.1109/icc.2010.5502148

Scheduled Access Using the IEEE 802.15.4 Guaranteed Time Slots

2010· article· en· W2112531426 on OpenAlex

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicWireless Networks and Protocols
Canadian institutionsUniversity of Alberta
Fundersnot available
KeywordsComputer scienceTime division multiple accessNetwork packetComputer networkWireless sensor networkNode (physics)Distributed computing

Abstract

fetched live from OpenAlex

In this paper we consider the design of IEEE 802.15.4 wireless sensor networks (WSNs) where nodes belong to different priority classes. Each class is characterized by a specified average data transmission rate requirement, and the overall network forms a multi-level tree. We devise a framework for constructing TDMA schedules for solving the underlying rate differentiation problem using the GTS facility of the standard. Our framework defines a class of schedules, called flow balanced schedules, that are efficient in terms of the delay incurred by packets transmitted to the sink node, and the number of packets queued in each node. We identify two useful optimization aspects that help in constructing schedules with short cycle length. We then outline an algorithm, called GTS-TDMA, which integrates two algorithms that take advantage of the identified optimization aspects, and present simulation results that show the performance gains of the devised algorithm.

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.

Full frame distilled prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.

metaresearch head score (Codex)0.000
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: none
Teacher disagreement score0.956
Threshold uncertainty score0.750

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0000.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0010.001
Open science0.0020.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.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.

Opus teacher head0.031
GPT teacher head0.314
Teacher spread0.282 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Quick stats

Citations13
Published2010
Admission routes1
Has abstractyes

Explore more

Same topicWireless Networks and ProtocolsFrench-language works237,207