Distributed Real Time TDMA Scheduling Algorithm for Tree Topology WSNs

Result code in IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F17%3A00314502" target="_blank" >RIV/68407700:21230/17:00314502 - isvavai.cz</a>

Alternative codes found

RIV/68407700:21730/17:00314502

Result on the web

<a href="https://www.sciencedirect.com/science/article/pii/S240589631732061X" target="_blank" >https://www.sciencedirect.com/science/article/pii/S240589631732061X</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1016/j.ifacol.2017.08.1484" target="_blank" >10.1016/j.ifacol.2017.08.1484</a>

Result language

angličtina

Original language name

Distributed Real Time TDMA Scheduling Algorithm for Tree Topology WSNs

Original language description

In this paper, we address the problem of developing TDMA scheduling algorithm for tree topology WSNs. The data transmissions are organized into periodic data flows that may have opposite directions since they are carrying sensor and actuator values for feedback control. It is required to determine a periodic and collision-free allocation of the time-slots to the sensor nodes such that the end-to-end deadline of each data flow, as given in time units, is satisfied. The objective is to maximize the lifetime of the network by maximizing the time when the nodes are in the sleep mode. However, the longer the time at which the nodes stay in the sleep mode, the harder is to meet the timeliness requirements of the data flows. To solve the TDMA scheduling problem, we have found an elegant approach to express the end-to-end deadline as an integer number of the length of the schedule period. Moreover, since the distributed algorithms, in comparison with the centralized algorithms, well-suit the scarce resources of the WSNs, we focus on the distributed methods that allow each node in the network to come up with its allocated time-slots in the schedule. The proposed algorithm is based on the graph theory algorithms, namely the distributed shortest path and the distributed topological ordering. Furthermore, it falls into the category of the exact algorithms for tree topology with single-collision domain and in the category of the heuristic algorithms for multiple-collision domains tree topology.

Czech name

—

Czech description

—

Type

D - Article in proceedings

CEP classification

—

OECD FORD branch

10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)

Project

<a href="/en/project/GA16-23509S" target="_blank" >GA16-23509S: Flexible Scheduling and Optimization Algorithms for Distributed Real-time Embedded Systems</a><br>

Continuities

P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)

Publication year

2017

Confidentiality

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Article name in the collection

Proceedings of the IFAC 2017 World Congress

ISBN

—

ISSN

2405-8963

e-ISSN

2405-8963

Number of pages

8

Pages from-to

5926-5933

Publisher name

Elsevier

Place of publication

Kidlington Oxford OX GB

Event location

Toulouse

Event date

Jul 9, 2017

Type of event by nationality

WRD - Celosvětová akce

UT code for WoS article

—