An Energy Efficient Schedule for IEEE 802.15.4/ZigBee Cluster Tree WSN with Multiple Collision Domains and Period Crossing Constraint

Kód výsledku v IS VaVaI

<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F18%3A00314488" target="_blank" >RIV/68407700:21230/18:00314488 - isvavai.cz</a>

Nalezeny alternativní kódy

RIV/68407700:21730/18:00314488

Výsledek na webu

<a href="http://dx.doi.org/10.1109/TII.2017.2725907" target="_blank" >http://dx.doi.org/10.1109/TII.2017.2725907</a>

DOI - Digital Object Identifier

<a href="http://dx.doi.org/10.1109/TII.2017.2725907" target="_blank" >10.1109/TII.2017.2725907</a>

Jazyk výsledku

angličtina

Název v původním jazyce

An Energy Efficient Schedule for IEEE 802.15.4/ZigBee Cluster Tree WSN with Multiple Collision Domains and Period Crossing Constraint

Popis výsledku v původním jazyce

Cluster scheduling respecting collision avoidance is a complex problem in cluster-tree Wireless Sensor Networks (WSNs). The difficulty of the problem also increases significantly when the traffic is organized as time-constrained data flows with opposite directions. Thus, in this paper we seek for collision-free cluster schedule that meets all the data flows deadlines as given in time units. In this context, we have found an elegant approach that expresses the deadline of each flow as an integer number of the length of the schedule period (i.e., period crossing constraints). Consequently, the data flows timeliness requirements become easier to be tackled. Due to the scarce resources of the WSNs, the minimization of the energy consumption of the nodes is a problem of paramount importance. Therefore, the objective is to maximize the lifetime of the network by maximizing the time when the nodes stay in low-power mode.

Název v anglickém jazyce

An Energy Efficient Schedule for IEEE 802.15.4/ZigBee Cluster Tree WSN with Multiple Collision Domains and Period Crossing Constraint

Popis výsledku anglicky

Cluster scheduling respecting collision avoidance is a complex problem in cluster-tree Wireless Sensor Networks (WSNs). The difficulty of the problem also increases significantly when the traffic is organized as time-constrained data flows with opposite directions. Thus, in this paper we seek for collision-free cluster schedule that meets all the data flows deadlines as given in time units. In this context, we have found an elegant approach that expresses the deadline of each flow as an integer number of the length of the schedule period (i.e., period crossing constraints). Consequently, the data flows timeliness requirements become easier to be tackled. Due to the scarce resources of the WSNs, the minimization of the energy consumption of the nodes is a problem of paramount importance. Therefore, the objective is to maximize the lifetime of the network by maximizing the time when the nodes stay in low-power mode.

Druh

J_imp - Článek v periodiku v databázi Web of Science

CEP obor

—

OECD FORD obor

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

Projekt

<a href="/cs/project/GA16-23509S" target="_blank" >GA16-23509S: Flexibilní rozvrhovací a optimalizační algoritmy pro distribuované systémy reálného času</a><br>

Návaznosti

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

Rok uplatnění

2018

Kód důvěrnosti údajů

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

Název periodika

IEEE TRANSACTIONS ON INDUSTRIAL INFORMATICS

ISSN

1551-3203

e-ISSN

1941-0050

Svazek periodika

14

Číslo periodika v rámci svazku

1

Stát vydavatele periodika

US - Spojené státy americké

Počet stran výsledku

12

Strana od-do

12-23

Kód UT WoS článku

000422661900002

EID výsledku v databázi Scopus

2-s2.0-85023621601