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”

ZigBee Cluster Tree Formation For Time-Bounded Data Flows in One Collision Domain

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F15%3A00232979" target="_blank" >RIV/68407700:21230/15:00232979 - isvavai.cz</a>

  • Result on the web

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

  • DOI - Digital Object Identifier

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

Alternative languages

  • Result language

    angličtina

  • Original language name

    ZigBee Cluster Tree Formation For Time-Bounded Data Flows in One Collision Domain

  • Original language description

    We study one-collision domain ZigBee cluster-tree design problems to satisfy periodic time-bounded data flows. The formation of the cluster-tree topology can be seen as a bounded- degree-and-depth tree which is an NP-complete problem. The objective is tominimize the number of clusters such that all flows can take place and there exists a cluster schedule that meets the deadlines of the flows. For the resulting tree, the cluster schedule is required to be energy efficient, which can be achieved by maximizing the length of the schedule period, and consequently, increasing the lifetime of the network. We present a Cluster-Tree Formation and Energy-Efficient clusters scheduling algorithm, CFEFS, based on the Hungarian algorithm, the Maximum Matching algorithm and the Branch and Bound algorithm to tackle this design problem that integrates the cluster formation and the cluster scheduling in one problem.

  • 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

    2015

  • 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 11th IEEE World Conference on Factory Communication Systems

  • ISBN

    978-1-4799-8244-8

  • ISSN

  • e-ISSN

  • Number of pages

    4

  • Pages from-to

    1-4

  • Publisher name

    IEEE

  • Place of publication

    Piscataway

  • Event location

    Palma de Mallorca

  • Event date

    May 27, 2015

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article