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”

Optimal Flow Routing in Multi-hop Sensor Networks with Real-Time Constraints through Linear Programming

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F07%3A03133098" target="_blank" >RIV/68407700:21230/07:03133098 - isvavai.cz</a>

  • Result on the web

  • DOI - Digital Object Identifier

Alternative languages

  • Result language

    angličtina

  • Original language name

    Optimal Flow Routing in Multi-hop Sensor Networks with Real-Time Constraints through Linear Programming

  • Original language description

    We have proposed an algorithm for optimal real-time routing in multi-hop communication networks for multi-source/multi-sink connection. The algorithm deals with various capacity constraints in terms of communication limits and real-time constraints expressed as deadline for each particular flow of data. The objective is to find the optimal routing in terms of energy consumption. The algorithm is based on a data flow model leading to Linear Programming formulation and therefore it ensures polynomial-timecomplexity. An extension handling simultaneous real-time and non real-time routingis added. An example of data collection from 100 nodes is presented and performance experiments illustrating time complexity in dependense on the number of nodes are given.

  • Czech name

    Optimální řízení toku dat v senzorových sítích s real-time omezením.

  • Czech description

    Představujeme algoritmus pro výpočet energeticky optimálního řízení toku dat v senzorových sítích, který zaručí real-time chování systému. Algoritmus si poradí s různými omezeními na kapacitu komunikačních linek, časové limity komunikace a velikost toků.Algoritmus je založen na multicommodity network flow modelu a vede na definici pomocí lineárního programování, které zaručuje polynomiální časovou složitost. Algoritmus je rozšířen o souběžné routování real-time a non-real-time datových toků. V závěru jsou uvedeny experimenty pro síť o 100 vrcholech a experiment pro prezentaci časové náročnosti algoritmu.

Classification

  • Type

    D - Article in proceedings

  • CEP classification

    JD - Use of computers, robotics and its application

  • OECD FORD branch

Result continuities

  • Project

  • Continuities

    Z - Vyzkumny zamer (s odkazem do CEZ)

Others

  • Publication year

    2007

  • 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

    12th IEEE International Conference on Emerging Technologies and Factory Automation

  • ISBN

    978-1-4244-0826-9

  • ISSN

  • e-ISSN

  • Number of pages

    8

  • Pages from-to

  • Publisher name

    Institute of Electrical and Electronic Engineers

  • Place of publication

    Piscataway

  • Event location

    Patras

  • Event date

    Sep 25, 2007

  • Type of event by nationality

    WRD - Celosvětová akce

  • UT code for WoS article