Real-Time Flow Routing in Sensor Networks
The result's identifiers
Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F07%3A00129965" target="_blank" >RIV/68407700:21230/07:00129965 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—
Alternative languages
Result language
angličtina
Original language name
Real-Time Flow Routing in Sensor Networks
Original language description
We propose an algorithm for optimal real-time routing in multi-hop communication networks. The algorithm deals with various capacity constraints in terms of communication limits and real-time constraints expressed as deadline for each particular flow ofdata. The objective is to find the optimal routing in terms of energy consumption. The algorithm is based on data flow model leading to Linear Programming formulation and therefore it ensures polynomialtime complexity. At the end an example of data collection from 100 nodes is presented and performance experiments illustrating time complexity in dependence on the number of nodes are given.
Czech name
—
Czech description
—
Classification
Type
O - Miscellaneous
CEP classification
BC - Theory and management systems
OECD FORD branch
—
Result continuities
Project
<a href="/en/project/1M0567" target="_blank" >1M0567: Centre for Applied Cybernetics</a><br>
Continuities
P - Projekt vyzkumu a vyvoje financovany z verejnych zdroju (s odkazem do CEP)
Others
Publication year
2007
Confidentiality
S - Úplné a pravdivé údaje o projektu nepodléhají ochraně podle zvláštních právních předpisů