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

Facets (new session)
Description
Metadata
Settings
- owl:sameAs
- Inference Rule:

About: Distributed Algorithm for Real-Time Energy Optimal Routing based on Dual Decomposition of Linear Programming Goto Sponge NotDistinct Permalink

An Entity of Type : http://linked.opendata.cz/ontology/domain/vavai/Vysledek, within Data Space : linked.opendata.cz associated with source document(s)

Attributes	Values
rdf:type	skos:Concept http://linked.opendata.cz/ontology/domain/vavai/Vysledek
rdfs:seeAlso	http://www.hindawi.com/journals/ijdsn/aip/346163/
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 mathematical derivation, 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. 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 mathematical derivation, 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. (en)
Title	Distributed Algorithm for Real-Time Energy Optimal Routing based on Dual Decomposition of Linear Programming Distributed Algorithm for Real-Time Energy Optimal Routing based on Dual Decomposition of Linear Programming (en)
skos:prefLabel	Distributed Algorithm for Real-Time Energy Optimal Routing based on Dual Decomposition of Linear Programming Distributed Algorithm for Real-Time Energy Optimal Routing based on Dual Decomposition of Linear Programming (en)
skos:notation	RIV/68407700:21230/12:00182450!RIV13-MSM-21230___
http://linked.open...avai/riv/aktivita	P
http://linked.open...avai/riv/aktivity	P(GAP103/10/0850), P(ME10039)
http://linked.open...iv/cisloPeriodika	0
http://linked.open...vai/riv/dodaniDat	2013
http://linked.open...aciTvurceVysledku	Hanzálek, Zdeněk Trdlička, Jiří
http://linked.open.../riv/druhVysledku	J - Článek v odborném periodiku
http://linked.open...iv/duvernostUdaju	S - Úplné a pravdivé údaje nepodléhající ochraně podle zvláštních právních předpisů
http://linked.open...titaPredkladatele	České vysoké učení technické v Praze / Fakulta elektrotechnická
http://linked.open...dnocenehoVysledku	131580
http://linked.open...ai/riv/idVysledku	RIV/68407700:21230/12:00182450
http://linked.open...riv/jazykVysledku	eng - angličtina
http://linked.open.../riv/klicovaSlova	In-network distributed algorithm; Dual decomposition; Real-time; Routing; sensor networks (en)
http://linked.open.../riv/klicoveSlovo	Real-time sensor networks Routing Dual decomposition In-network distributed algorithm
http://linked.open...odStatuVydavatele	US - Spojené státy americké
http://linked.open...ontrolniKodProRIV	[0B389737043A]
http://linked.open...i/riv/nazevZdroje	International Journal of Distributed Sensor Networks
http://linked.open...in/vavai/riv/obor	BC
http://linked.open...ichTvurcuVysledku	2 (xsd:int)
http://linked.open...cetTvurcuVysledku	2 (xsd:int)
http://linked.open...vavai/riv/projekt	Energy Efficient Scheduling in Data Processing and Communication Distributed Adaptive Algorithms for Routing in Sensor Networks.
http://linked.open...UplatneniVysledku	2012
http://linked.open...v/svazekPeriodika	2012
http://linked.open...iv/tvurceVysledku	Hanzálek, Zdeněk Trdlička, Jiří
http://linked.open...ain/vavai/riv/wos	000299532700001
issn	1550-1329
number of pages	13 (xsd:int)
http://bibframe.org/vocab/doi	10.1155/2012/346163
http://localhost/t...ganizacniJednotka	21230

Faceted Search & Find service v1.16.118 as of Jun 21 2024

Alternative Linked Data Documents: ODE Content Formats:

RDF

ODATA

Microdata

About

OpenLink Virtuoso version 07.20.3240 as of Jun 21 2024, on Linux (x86_64-pc-linux-gnu), Single-Server Edition (126 GB total memory, 100 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software