An energy efficient centralized scheduling scheme in TSCH networks

Ojo, Mike; Giordano, Stefano; Portaluri, Giuseppe; Adami, Davide; Pagano, Michele

doi:10.1109/iccw.2017.7962719

Cited by 28 publications

(25 citation statements)

References 9 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…In almost all previous TSCH scheduling, authors either assume that the impact of link qualities or channel variations on performance are negligible (such as [7][8][9][10][11][12][13][14]), or that the instantaneous and complete channel information is available (such as [15][16][17]), or else the channel is modeled quasi-static (such as [18][19][20]). For example, in [15 and 16], it is assumed that the instantaneous CSI is fully measurable and available, therefore one can use an offline method and calculate the optimal scheduling for a TSCH network by the exact rate of packets to be sent over each link.…”

Section: B Related Workmentioning

confidence: 99%

“…To solve this problem, they applied the Hungarian algorithm [24], and came up with a solution that generated optimal throughput in the presence of channel information. In [16], TSCH scheduling is modeled with the goal of energy efficiency maximization, and an optimal greedy method based on the Vogel's approximation method [28] is presented. In this method, among all the nodes that apply for a specific channel, a node with the highest amount of remaining energy is selected.…”

Section: B Related Workmentioning

confidence: 99%

See 1 more Smart Citation

IEEE 802.15.4.e TSCH-Based Scheduling for Throughput Optimization: A Combinatorial Multi-Armed Bandit Approach

2020

View full text Add to dashboard Cite

In TSCH, which is a MAC mechanism set of the IEEE 802.15.4e amendment, calculation, construction, and maintenance of the packet transmission schedules are not defined. Moreover, to ensure optimal throughput, most of the existing scheduling methods are based on the assumption that instantaneous and accurate Channel State Information (CSI) is available. However, due to the inevitable errors in the channel estimation process, this assumption cannot be materialized in many practical scenarios. In this paper, we propose two alternative and realistic approaches. In our first approach, we assume that only the statistical knowledge of CSI is available a priori. Armed with this knowledge, the average packet rate on each link is computed and then, using the results, the throughput-optimal schedule for the assignment of (slotframe) cells to links can be formulated as a max-weight bipartite matching problem, which can be solved efficiently using the well-known Hungarian algorithm. In the second approach, we assume that no CSI knowledge (even statistical) is available at the design stage. For this zeroknowledge setting, we introduce a machine learning-based algorithm by formally modeling the scheduling problem in terms of a combinatorial multi-armed bandit (CMAB) process. Our CMAB-based scheme is widely applicable to many real operational environments, thanks to its reduced reliance on design-time knowledge. Simulation results show that the average throughput obtained by the statistical CSIbased method is within the margin of 15% from the theoretical upper bound associated with perfect instantaneous CSI. The aforesaid margin is around 18% for our learning-theoretic solution.Index Terms-IEEE 802.15.4e, TSCH, Scheduling, CSI, CMAB.

show abstract

Section: B Related Workmentioning

confidence: 99%

Section: B Related Workmentioning

confidence: 99%

IEEE 802.15.4.e TSCH-Based Scheduling for Throughput Optimization: A Combinatorial Multi-Armed Bandit Approach

2020

View full text Add to dashboard Cite

show abstract

“…In addition to the research of [12,13], there is a number of studies that examine the TSCH centralized scheduling algorithm, directly related to TASA or not. There are studies directly related to TASA [14][15][16], and studies not related to TASA [17,18]. Specific to [12,13], this research refers to studies conducted by Shreedar [19] and Sayenko [20].…”

Section: Related Workmentioning

confidence: 99%

“…To test the scheduling algorithm they created, Meng et al did not mention the use of simulators or specific programming languages. Other research that refers to TASA is a study conducted by Ojo et al [15], who developed a scheduling algorithm for TSCH networks to maximize energy efficiency. The scheduling algorithm was developed using the energy consumption model on TSCH nodes and nonlinear programming (NLP).…”

Section: Related Workmentioning

confidence: 99%

TLS-VaD: A New Tool for Developing Centralized Link-Scheduling Algorithms on the IEEE802.15.4e TSCH Network

2019

View full text Add to dashboard Cite

A simulator plays an important role in network protocol research, as it enables researchers to develop protocols more flexibly. Many simulators have been developed to support research in this field, including NS-2, NS-3, OPNET, OMNeT, and Cooja. Although, as a research support tools, NS3 and Cooja have already been equipped with an Internet of things (IoT) module, their support for research on IoT centralized scheduling is still limited. Therefore, this study is aimed to develop a tool for IoT centralized scheduling research, where the IoT technology is based on the IEEE802.15.4e time synchronized channel hopping (TSCH) standard. The tool is called the TSCH Link-Scheduling visualization and data processing (TLS-VaD). The results of validity tests show that TLS-VaD works well; therefore, this tool can be used in the performance measurement of centralized scheduling algorithms on TSCH networks. As an example of the application, this research used TLS-VaD to test the performance of three scheduling algorithms: Iman Ramli Bursty Transmission Scheduling Algorithm (IRByTSA), first top scheduling algorithm (FTSA), and first leaf scheduling algorithm (FLSA). The test results using TLS-VaD shows that IRByTSA had better performance compared to FLSA and FTSA, because it saved more power and was able to generate scheduling decisions relatively quickly.

show abstract

“…All mentioned algorithms implicitly minimize energy consumption by reducing the number of slots assigned to every node. In contrast, [34] explicitly targets minimum energy consumption by formulating an energy efficiency maximization problem.…”

Section: Related Workmentioning

confidence: 99%

An analytical model for wireless mesh networks with collision-free TDMA and finite queues

Kauer

Turau

2018

J Wireless Com Network

View full text Add to dashboard Cite

Wireless mesh networks are a promising technology for connecting sensors and actuators with high flexibility and low investment costs. In industrial applications, however, reliability is essential. Therefore, two time-slotted medium access methods, DSME and TSCH, were added to the IEEE 802.15.4 standard. They allow collision-free communication in multi-hop networks and provide channel hopping for mitigating external interferences. The slot schedule used in these networks is of high importance for the network performance. This paper supports the development of efficient schedules by providing an analytical model for the assessment of such schedules, focused on TSCH. A Markov chain model for the finite queue on every node is introduced that takes the slot distribution into account. The models of all nodes are interconnected to calculate network metrics such as packet delivery ratio, end-to-end delay, and throughput. An evaluation compares the model with a simulation of the Orchestra schedule. The model is applied to Orchestra as well as to two simple distributed scheduling algorithms to demonstrate the importance of traffic-awareness for achieving high throughput.

show abstract

An energy efficient centralized scheduling scheme in TSCH networks

Cited by 28 publications

References 9 publications

IEEE 802.15.4.e TSCH-Based Scheduling for Throughput Optimization: A Combinatorial Multi-Armed Bandit Approach

IEEE 802.15.4.e TSCH-Based Scheduling for Throughput Optimization: A Combinatorial Multi-Armed Bandit Approach

TLS-VaD: A New Tool for Developing Centralized Link-Scheduling Algorithms on the IEEE802.15.4e TSCH Network

An analytical model for wireless mesh networks with collision-free TDMA and finite queues

Contact Info

Product

Resources

About