About: Optimal Flow Routing in Multi-hop Sensor Networks with Real-Time Constraints through 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)

AttributesValues
rdf:type
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. (cs)
  • 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-time complexity. 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.
  • 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-time complexity. 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. (en)
Title
  • Optimal Flow Routing in Multi-hop Sensor Networks with Real-Time Constraints through Linear Programming
  • Optimal Flow Routing in Multi-hop Sensor Networks with Real-Time Constraints through Linear Programming (en)
  • Optimální řízení toku dat v senzorových sítích s real-time omezením. (cs)
skos:prefLabel
  • Optimal Flow Routing in Multi-hop Sensor Networks with Real-Time Constraints through Linear Programming
  • Optimal Flow Routing in Multi-hop Sensor Networks with Real-Time Constraints through Linear Programming (en)
  • Optimální řízení toku dat v senzorových sítích s real-time omezením. (cs)
skos:notation
  • RIV/68407700:21230/07:03133098!RIV08-MSM-21230___
http://linked.open.../vavai/riv/strany
  • Nečíslováno
http://linked.open...avai/riv/aktivita
http://linked.open...avai/riv/aktivity
  • Z(MSM6840770038)
http://linked.open...vai/riv/dodaniDat
http://linked.open...aciTvurceVysledku
http://linked.open.../riv/druhVysledku
http://linked.open...iv/duvernostUdaju
http://linked.open...titaPredkladatele
http://linked.open...dnocenehoVysledku
  • 439747
http://linked.open...ai/riv/idVysledku
  • RIV/68407700:21230/07:03133098
http://linked.open...riv/jazykVysledku
http://linked.open.../riv/klicovaSlova
  • Linear Programming; Real-Time; Routing; Sensor Networks (en)
http://linked.open.../riv/klicoveSlovo
http://linked.open...ontrolniKodProRIV
  • [FA219B004DC8]
http://linked.open...v/mistoKonaniAkce
  • Patras
http://linked.open...i/riv/mistoVydani
  • Piscataway
http://linked.open...i/riv/nazevZdroje
  • 12th IEEE International Conference on Emerging Technologies and Factory Automation
http://linked.open...in/vavai/riv/obor
http://linked.open...ichTvurcuVysledku
http://linked.open...cetTvurcuVysledku
http://linked.open...UplatneniVysledku
http://linked.open...iv/tvurceVysledku
  • Hanzálek, Zdeněk
  • Johansson, M.
  • Trdlička, Jiří
http://linked.open...vavai/riv/typAkce
http://linked.open.../riv/zahajeniAkce
http://linked.open...n/vavai/riv/zamer
number of pages
http://purl.org/ne...btex#hasPublisher
  • Institute of Electrical and Electronic Engineers
https://schema.org/isbn
  • 978-1-4244-0826-9
http://localhost/t...ganizacniJednotka
  • 21230
Faceted Search & Find service v1.16.118 as of Jun 21 2024


Alternative Linked Data Documents: ODE     Content Formats:   [cxml] [csv]     RDF   [text] [turtle] [ld+json] [rdf+json] [rdf+xml]     ODATA   [atom+xml] [odata+json]     Microdata   [microdata+json] [html]    About   
This material is Open Knowledge   W3C Semantic Web Technology [RDF Data] Valid XHTML + RDFa
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, 58 GB memory in use)
Data on this page belongs to its respective rights holders.
Virtuoso Faceted Browser Copyright © 2009-2024 OpenLink Software