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”

In-Network Distributed Algorithm for 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%3A00197258" target="_blank" >RIV/68407700:21230/12:00197258 - isvavai.cz</a>

  • Result on the web

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

  • DOI - Digital Object Identifier

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

Alternative languages

  • Result language

    angličtina

  • Original language name

    In-Network Distributed Algorithm for Energy Optimal Routing Based on Dual Decomposition of Linear Programming

  • Original language description

    This work proposes an in-network distributed algorithm for the energy optimal routing in a wireless sensor network. The routing problem is described as a minimum-cost multi-commodity network flow problem by Linear programming. Based on the convex programming theory we use the dual decomposition theorem to derive the distributed algorithm on a mathematical basic. The algorithm computes the exact energy optimal routing in the network without any central node or the knowledge about the whole network structure, using only peer-topeer communication between neighboring nodes. In contrast to other works in this area, the presented approach is not limited to strictly convex objective functions and it handles linear objective functions.

  • 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

    IEEE Transactions on Communications

  • ISSN

    0090-6778

  • e-ISSN

  • Volume of the periodical

    60

  • Issue of the periodical within the volume

    6

  • Country of publishing house

    US - UNITED STATES

  • Number of pages

    12

  • Pages from-to

    1634-1645

  • UT code for WoS article

    000305579500019

  • EID of the result in the Scopus database