An Energy-efficient Distributed TDMA Scheduling Algorithm for ZigBee-like Cluster-tree WSNs
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F20%3A00334575" target="_blank" >RIV/68407700:21230/20:00334575 - isvavai.cz</a>
Alternative codes found
RIV/68407700:21730/20:00334575
Result on the web
<a href="https://doi.org/10.1145/3360722" target="_blank" >https://doi.org/10.1145/3360722</a>
DOI - Digital Object Identifier
<a href="http://dx.doi.org/10.1145/3360722" target="_blank" >10.1145/3360722</a>
Alternative languages
Result language
angličtina
Original language name
An Energy-efficient Distributed TDMA Scheduling Algorithm for ZigBee-like Cluster-tree WSNs
Original language description
The design of Medium Access Control (MAC) protocol for Wireless Sensor Networks (WSNs) with both limited energy consumption and data delivery time is crucial for industrial and control applications. Since Time Division Multiple Access (TDMA) MAC eliminates the collision occurrence and seeks the minimization of the number of time-slots assigned to each node, the energy consumption of the nodes is reduced. Furthermore, with the proper allocation of the time-slots to the nodes, the transmission delay can be significantly reduced. In this article, we propose TDMA scheduling algorithm for Cluster-tree topology WSNs that meets the timeliness and the energy demands. The algorithm adopts an elegant approach that expresses the timing constraints of the data transmissions as an integer multiple of the length of the schedule period. Moreover, since the distributed algorithm is well-suited to the scarce resources of the WSNs, we focus on the distributed methods that allow each cluster to come up with its allocated time-slots. The algorithm is based on graph theory, such as distributed shortest path, distributed topological ordering, and distributed graph coloring algorithms. The efficiency of the algorithm, regarding the elapsed time to construct the schedule and the energy consumption, is evaluated over benchmark instances up to several thousands of nodes.
Czech name
—
Czech description
—
Classification
Type
J<sub>imp</sub> - Article in a specialist periodical, which is included in the Web of Science database
CEP classification
—
OECD FORD branch
10201 - Computer sciences, information science, bioinformathics (hardware development to be 2.2, social aspect to be 5.8)
Result continuities
Project
<a href="/en/project/EF15_003%2F0000466" target="_blank" >EF15_003/0000466: Artificial Intelligence and Reasoning</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2020
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů
Data specific for result type
Name of the periodical
ACM Transactions on Sensor Networks (TOSN)
ISSN
1550-4859
e-ISSN
1550-4867
Volume of the periodical
16
Issue of the periodical within the volume
1
Country of publishing house
US - UNITED STATES
Number of pages
41
Pages from-to
—
UT code for WoS article
000535717600003
EID of the result in the Scopus database
2-s2.0-85074167296