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”

Distributed Algorithm for Real-Time Energy Optimal Routing based on Dual Decomposition of Linear Programming

The result's identifiers

  • Result code in IS VaVaI

    <a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F12%3A00182450" target="_blank" >RIV/68407700:21230/12:00182450 - isvavai.cz</a>

  • Result on the web

    <a href="http://www.hindawi.com/journals/ijdsn/aip/346163/" target="_blank" >http://www.hindawi.com/journals/ijdsn/aip/346163/</a>

  • DOI - Digital Object Identifier

    <a href="http://dx.doi.org/10.1155/2012/346163" target="_blank" >10.1155/2012/346163</a>

Alternative languages

  • Result language

    angličtina

  • Original language name

    Distributed Algorithm for Real-Time Energy Optimal Routing based on Dual Decomposition of Linear Programming

  • Original language description

    This work proposes a novel in-network distributed algorithm for real-time energy optimal routing in ad-hoc and sensor networks for systems with linear cost functions and constant communication delays. The routing problem is described as a minimum-cost multi-commodity network flow problem by Linear programming and modified by network replication to a real-time aware form. Based on the convex programming theory we use dual decomposition to derive the distributed algorithm. Thanks to the exact mathematicalderivation, the algorithm computes the energy optimal real-time routing. It uses only peer-to-peer communication between neighboring nodes and does not need any central node or knowledge about the whole network structure. Each node knows only the produced and collected data flow and the costs of its outgoing communication links. This work is the first, which solves the real-time routing problem with linear cost functions and constant communication delays, using the dual decomposition.

  • Czech name

  • Czech description

Classification

  • Type

    J<sub>x</sub> - Unclassified - Peer-reviewed scientific article (Jimp, Jsc and Jost)

  • CEP classification

    BC - Theory and management systems

  • OECD FORD branch

Result continuities

  • Project

    Result was created during the realization of more than one project. More information in the Projects tab.

  • Continuities

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

Others

  • Publication year

    2012

  • 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

    International Journal of Distributed Sensor Networks

  • ISSN

    1550-1329

  • e-ISSN

  • Volume of the periodical

    2012

  • Issue of the periodical within the volume

  • Country of publishing house

    US - UNITED STATES

  • Number of pages

    13

  • Pages from-to

    1-13

  • UT code for WoS article

    000299532700001

  • EID of the result in the Scopus database