All

What are you looking for?

All
Projects
Results
Organizations

Quick search

  • Projects supported by TA ČR
  • Excellent projects
  • Projects with the highest public support
  • Current projects

Smart search

  • That is how I find a specific +word
  • That is how I leave the -word out of the results
  • “That is how I can find the whole phrase”

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

The result's identifiers

  • Result code in 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>

  • Alternative codes found

    RIV/68407700:21730/18:00314488

  • Result on the web

    <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>

Alternative languages

  • Result language

    angličtina

  • Original language name

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

  • Original language description

    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.

  • 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/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)

Others

  • Publication year

    2018

  • 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

    IEEE TRANSACTIONS ON INDUSTRIAL INFORMATICS

  • ISSN

    1551-3203

  • e-ISSN

    1941-0050

  • Volume of the periodical

    14

  • Issue of the periodical within the volume

    1

  • Country of publishing house

    US - UNITED STATES

  • Number of pages

    12

  • Pages from-to

    12-23

  • UT code for WoS article

    000422661900002

  • EID of the result in the Scopus database

    2-s2.0-85023621601