Distributed Algorithm for Energy Optimal Multi-Commodity Network Flow Routing in Sensor Networks.

Result code in IS VaVaI
<a href="https://www.isvavai.cz/riv?ss=detail&h=RIV%2F68407700%3A21230%2F10%3A00172685" target="_blank" >RIV/68407700:21230/10:00172685 - isvavai.cz</a>
Result on the web
—
DOI - Digital Object Identifier
—

Result language
angličtina
Original language name
Distributed Algorithm for Energy Optimal Multi-Commodity Network Flow Routing in Sensor Networks.
Original language description
This work proposes a distributed algorithm for the energy optimal routing in 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 weuse the dual decomposition theorem to derive the distributed algorithm. The algorithm computes the energy optimal routing in the network without any central node or the knowledge about the whole network structure. Each node only needs to know the flow which is supposed to send or receive and the costs and capacities of the neighboring links.
Czech name
—
Czech description
—

Project
<a href="/en/project/GAP103%2F10%2F0850" target="_blank" >GAP103/10/0850: Distributed Adaptive Algorithms for Routing in Sensor Networks.</a><br>
Continuities
Z - Vyzkumny zamer (s odkazem do CEZ)

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

Article name in the collection
Wireless Communications and Signal Processing (WCSP), 2010 International Conference on
ISBN
978-1-4244-7556-8
ISSN
—
e-ISSN
—
Number of pages
6
Pages from-to
—
Publisher name
IEEE
Place of publication
Beijing
Event location
Suzhou
Event date
Oct 21, 2010
Type of event by nationality
WRD - Celosvětová akce
UT code for WoS article
—

Similar results(10)