A multi-channel timeslot scheduling algorithm for link recovery in wireless multi-hop sensor networks

lee, jun-hee; Jeong, Wootae; Choi, Byeong-Cheol

doi:10.1109/ictc.2016.7763319

Cited by 8 publications

(8 citation statements)

References 5 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…Shared Slot Retransmissions [28] x x x x x x Improve e2e reliability [62] x x x x Shared cells for retx & cells stealing Lower-Bound Reliability [63] [64] x x x Strengthen the schedule with dedicated retx cells [65] x x x x Greedy allocation will flow constraints Hop-Count Based [66] x x x x Sequential scheduling with retx cells Model Training [67] [68] x x x x Burstiness aware scheduling Graph Routing [69] [70] x x x x Redundant slots for the optimal path [71] x x x x Multiparent scheduling [72] x x x x Multipath scheduling [73] x x x x Multipath scheduling…”

Section: Fault Minimizationmentioning

confidence: 99%

See 1 more Smart Citation

Scheduling for IEEE802.15.4-TSCH and slow channel hopping MAC in low power industrial wireless networks: A survey

Hermeto

Gallais

Théoleyre

2017

Computer Communications

109

107

View full text Add to dashboard Cite

The so-called Industrial Internet of Things (IIoT) is expected to transform our world, and in depth modernize very different domains such as manufacturing, energy, agriculture, construction industry, and other industrial sectors. The need for low power radio networks first led to low duty cycle approaches where nodes turn off their radio chipset most of the time to save energy. The medium access control (MAC) has thus been largely investigated over the last fifteen years. Unfortunately, classical contention access methods use a random access and are unable to provide guarantees. In the meantime, some dedicated standards have emerged (e.g. IEEE 802.15.4-2006, IEEE 802.15.4-2015), combining Time Division Multiple Access (TDMA) with slow channel hopping in order to enable reliability and energy efficiency. Slow channel hopping allows each node to use different channels for a frame and its possible retransmissions with a low-cost hardware. To provide high-reliability, these protocols rely on a common schedule in order to prevent simultaneously interfering transmissions. In this context, we clearly observe a strong growth of the number of proposals in the last years, denoting a strong interest of the research community for deterministic slow channel hopping scheduling for the IIoT. We categorize here the numerous existing solutions according to their objectives (e.g. high-reliability, mobility support) and approaches. We also identify some open challenges, expected to attract much attention over the next few years.

show abstract

Section: Fault Minimizationmentioning

confidence: 99%

“…Lee et al [72] schedule dedicated links for a redundant communication path. They exploit the max-min algorithm to optimize the number of dedicated slots necessary to establish an alternative route once the link fails.…”

Section: Graph Routingmentioning

confidence: 99%

Scheduling for IEEE802.15.4-TSCH and slow channel hopping MAC in low power industrial wireless networks: A survey

Hermeto

Gallais

Théoleyre

2017

Computer Communications

109

107

View full text Add to dashboard Cite

show abstract

“…Lee et al [29] address the reliability problem: if a given radio link is broken, it impacts all the flows forwarded through this link. Thus, the authors propose to exploit substitute paths, so that the packets keep on being forwarded through alternative radio links, using backup cells.…”

Section: Centralized Approachesmentioning

confidence: 99%

Self-healing distributed scheduling for end-to-end delay optimization in multihop wireless networks with 6TiSCh

Hosni

Théoleyre

2017

Computer Communications

View full text Add to dashboard Cite

Time Slotted Channel Hopping (TSCH) is an amendment of the the IEEE 802.15.4 working group to provide a low-power Medium Access Control (MAC) for the Internet of Things (IoT). This standard relies on techniques such as channel hopping and bandwidth reservation to ensure both energy savings and reliable transmissions. Since many applications require low end-to-end delay (e.g. alarms), we propose here a distributed algorithm to schedule the transmissions with a short end-to-end delay. We divide the network in stratums, regrouping all the nodes with the same depth in the DODAG constructed by RPL. Then, different time-frequency blocks are assigned deterministically to each stratum. By appropriately organizing the blocks in the slotframe, we are able to deliver a packet before the end of the slotframe, whatever the route length is. We present a simple analytical study to define the initial size of each block in a homogeneous scenario. We experimentally analyze the behavior of our strategy to validate its ability to provide both high reliability and low latency in a distributed manner.

show abstract

“…e weighted version of this problem is to achieve the sum of maximal weights for the users assigned channels for communication. e channel scheduling problem is NPhard even in the single-channel model [1] and has been studied in a series of papers (for example, [2][3][4]). According to IEEE standard 802.11a, there are 13 orthogonal channels provided for wireless network [5].…”

Section: Introductionmentioning

confidence: 99%

“…A maximal independent set problem based on joint scheduling and routing optimization is studied in [2], which is a mixed integer non-linear programming NP-hard problem. It developed a column generation based ϵ-approximation-bounded approximation algorithm, which can find tight ϵ-bounded approximate solutions and the optimal solutions.…”

Section: Introductionmentioning

confidence: 99%

Different Approximation Algorithms for Channel Scheduling in Wireless Networks

Huang

Pardalos

et al. 2020

Mobile Information Systems

View full text Add to dashboard Cite

We introduce a new two-side approximation method for the channel scheduling problem, which controls the accuracy of approximation in two sides by a pair of parameters f , g . We present a series of simple and practical-for-implementation greedy algorithms which give constant factor approximation in both sides. First, we propose four approximation algorithms for the weighted channel allocation problem: 1. a greedy algorithm for the multichannel with fixed interference radius scheduling problem is proposed and an one side O 1 -IS-approximation is obtained; 2. a greedy O 1 , O 1 -approximation algorithm for single channel with fixed interference radius scheduling problem is presented; 3. we improve the existing algorithm for the multichannel scheduling and show an E O d / ε time 1 − ϵ -approximation algorithm; 4. we speed up the polynomial time approximation scheme for single-channel scheduling through merging two algorithms and show a 1 − ϵ , O 1 -approximation algorithm. Next, we study two polynomial time constant factor greedy approximation algorithms for the unweighted channel allocation with variate interference radius. A greedy O 1 -approximation algorithm for the multichannel scheduling problem and an O 1 , O 1 -approximation algorithm for single-channel scheduling problem are developed. At last, we do some experiments to verify the effectiveness of our proposed methods.

show abstract

A multi-channel timeslot scheduling algorithm for link recovery in wireless multi-hop sensor networks

Cited by 8 publications

References 5 publications

Scheduling for IEEE802.15.4-TSCH and slow channel hopping MAC in low power industrial wireless networks: A survey

Scheduling for IEEE802.15.4-TSCH and slow channel hopping MAC in low power industrial wireless networks: A survey

Self-healing distributed scheduling for end-to-end delay optimization in multihop wireless networks with 6TiSCh

Different Approximation Algorithms for Channel Scheduling in Wireless Networks

Contact Info

Product

Resources

About