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

Kód výsledku v 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>

Výsledek na webu

<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>

Jazyk výsledku

angličtina

Název v původním jazyce

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

Popis výsledku v původním jazyce

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.

Název v anglickém jazyce

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

Popis výsledku anglicky

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.

Druh

J_x - Nezařazeno - Článek v odborném periodiku (Jimp, Jsc a Jost)

CEP obor

BC - Teorie a systémy řízení

OECD FORD obor

—

Projekt

Výsledek vznikl pri realizaci vícero projektů. Více informací v záložce Projekty.

Návaznosti

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

Rok uplatnění

2012

Kód důvěrnosti údajů

S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů

Název periodika

International Journal of Distributed Sensor Networks

ISSN

1550-1329

e-ISSN

—

Svazek periodika

2012

Číslo periodika v rámci svazku

—

Stát vydavatele periodika

US - Spojené státy americké

Počet stran výsledku

13

Strana od-do

1-13

Kód UT WoS článku

000299532700001

EID výsledku v databázi Scopus

—