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”

A Polynomial scheduling algorithm for IEEE 802.15.4/ ZigBee cluster tree WSN with one collision domain 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%2F14%3A00221734" target="_blank" >RIV/68407700:21230/14:00221734 - isvavai.cz</a>

  • Result on the web

  • DOI - Digital Object Identifier

Alternative languages

  • Result language

    angličtina

  • Original language name

    A Polynomial scheduling algorithm for IEEE 802.15.4/ ZigBee cluster tree WSN with one collision domain and period crossing constraint

  • Original language description

    Cluster scheduling is a crucial issue in clustertree Wireless Sensor Networks (WSNs). The paper presents a methodology that provides a Time Division Cluster Scheduling (TDCS) mechanism based on the shortest path problem. The objective is to meet all theflows? deadlines defined by the maximum number of crossed periods for each flow to reach its destination assuming one collision domain. Formulating the problem as the shortest path problem gives us a light exact algorithm suitable to the scarce properties of WSNs especially related to memory, power consumption and processors. Our polynomial algorithm leads to the minimization of the energy consumption and, consequently, the lifetime of the network is maximized by setting the TDCS period as long as possible. Since each cluster is active only once during the period, the given flow may span over several periods when there are flows with an opposite direction. The scheduling tool enables the system designers to efficiently configure all the

  • Czech name

  • Czech description

Classification

  • Type

    D - Article in proceedings

  • CEP classification

    BC - Theory and management systems

  • OECD FORD branch

Result continuities

  • Project

    <a href="/en/project/GAP103%2F12%2F1994" target="_blank" >GAP103/12/1994: Adaptive scheduling and Optimization algorithms for distributed Real-time Embeddes Systems</a><br>

  • Continuities

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

Others

  • Publication year

    2014

  • 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

  • Article name in the collection

    Proceedings of the 19th IEEE International Conference on Emerging Technologies and Factory Automation

  • ISBN

    978-1-4799-4845-1

  • ISSN

  • e-ISSN

  • Number of pages

    8

  • Pages from-to

    1-8

  • Publisher name

    IEEE

  • Place of publication

    Piscataway

  • Event location

    Barcelona

  • Event date

    Sep 16, 2014

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article

    000360999100133