Evidence map›Paper›PMID 40096271›Full record

ArticleSensors (Basel, Switzerland)2025

Adaptive Cell Scheduling and Negotiation Techniques for 6TiSCH Networks Under Bursty Traffic.

Je-Hyeong Lee, Sang-Hwa Chung

Abstract read
In one paragraph

Article in Sensors (Basel, Switzerland), 2025. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Not yet cited in PubMed.

0numbers the graph read from it
0cells of the map it votes in
0citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

0 citing papers in PubMed.

No citing paper in PubMed yet.

4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

2 authors.

Je-Hyeong LeeDepartment of Information Convergence Engineering, Pusan National University, Busan 46241, Republic of Korea.ORCID 0009-0007-9666-7422
Sang-Hwa ChungDepartment of Information Convergence Engineering, Pusan National University, Busan 46241, Republic of Korea.

Funding

No grant is acknowledged in the PubMed record.

6 · The paper itself

Abstract

6TiSCH networks adopt the IEEE 802.15.4e-based TSCH protocol to support efficient and reliable communication in low-power and lossy network (LLN) environments. However, under bursty traffic conditions, the traditional minimal scheduling function (MSF)-based scheduling technique cannot effectively handle the traffic load and suffers from packet queue overflow. In this study, we propose two main techniques to solve these problems. The first technique, dynamic cell cycle adjustment, dynamically adjusts the cell addition and deletion cycles based on the link quality and packet queue utilization to prevent packet queue overflow and efficiently use limited cell resources. The second technique, the parent node 6P transaction forwarding technique, is designed to pre-forward cell addition requests to higher nodes along the path when the cell utilization exceeds a set threshold due to traffic spikes at the lower nodes, so that the higher nodes can perform 6P negotiation immediately without waiting for MAX_NUMCELLS cycles. This minimizes the cell addition delay and prevents packet queue overflow. The simulation results show that the proposed technique has a high packet delivery ratio (PDR), low latency, and energy efficiency compared to conventional MSF, IMSF, and LMSF in various traffic environments. In particular, it maintains stable performance while preventing packet overflow under bursty traffic conditions. This work contributes to the optimization of scheduling and cell negotiation in 6TiSCH networks to improve the network efficiency and reliability in IoT environments.

Indexed as

6TiSCH6top protocolcell allocationminimal scheduling functionwireless sensor network

Identifiers

PMID40096271
PMCPMC11902844

What OpenQuestion holds

Textmetadata
LicenceCC BY
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.