2015 IEEE International Conference on Smart City/SocialCom/SustainCom (SmartCity) 2015
DOI: 10.1109/smartcity.2015.53
|View full text |Cite
|
Sign up to set email alerts
|

A Distributed Scheduling Algorithm for IEEE 802.15.4e Networks

Abstract: In a Wireless Sensor Network, the medium access control (MAC) layer protocol design is very important due to the constraint of the limited processing capability and the power on wireless sensors. Recently, the IEEE released a revised version of the IEEE 802.15.4, referred to as IEEE 802.15.4e, which defined the Slotted Channel Hopping (TSCH) mechanism. The TSCH then adopted the slotframe structure. A slotframe is composed of several time slots, with the time slot scheduling then planned based on the routing to… Show more

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
1
1
1

Citation Types

0
5
0

Year Published

2017
2017
2021
2021

Publication Types

Select...
5
1
1

Relationship

0
7

Authors

Journals

citations
Cited by 11 publications
(5 citation statements)
references
References 19 publications
0
5
0
Order By: Relevance
“…Another feature in the IEEE 802.15.4e standard is the frequency hopping, which could improve the reliability of the data transmission [24]. Since the IEEE 802.15.4e TSCH standard does not specify how to plan the time slot scheduling, Wang et al [25] proposed a distributed scheduling strategy such that each sensor node knows the time to transmit packets in a distributed and simple manner.…”
Section: 42: Related Workmentioning
confidence: 99%
“…Another feature in the IEEE 802.15.4e standard is the frequency hopping, which could improve the reliability of the data transmission [24]. Since the IEEE 802.15.4e TSCH standard does not specify how to plan the time slot scheduling, Wang et al [25] proposed a distributed scheduling strategy such that each sensor node knows the time to transmit packets in a distributed and simple manner.…”
Section: 42: Related Workmentioning
confidence: 99%
“…In distributed approaches, neighbouring nodes negotiate with each other and decide locally on which links to schedule their own plan for wake up and sleep time. In this class, many works were proposed by Accettura et al (2013Accettura et al ( , 2015, Aijaz and Raza (2017), Demir andBilgili (2017), Domingo-Prieto et al (2016), Antoni et al (2013), Tinka et al (2010), Soua et al (2015aSoua et al ( , 2015b and Wang and Hwang (2015). Indeed, these solutions have a quick response to the sudden changes of network topology, but still need an additive communication overhead for the negotiation between neighbours.…”
Section: Network Schedulingmentioning
confidence: 99%
“…Works on multiple channels mainly include [16,17,15]. These works use channel diversity to improve the performance of scheduling.…”
Section: Work Using Multiple Channelsmentioning
confidence: 99%
“…Saifulah et al [17] aim at channel scheduling with deadline in Wireless HART networks, where the wireless links are assumed to be highly reliable. Wang et al [15] propose a decentralized scheduling algorithm to allocate the channels and time slots in order to jointly reduce control overhead, packet transmission delay and duty cycle. In these works, the underlying assumption is that a packet transmission is successful in one slot and the corresponding channel.…”
Section: Work Using Multiple Channelsmentioning
confidence: 99%
See 1 more Smart Citation