Distributed Multi-Commodity Network Flow Algorithm for Energy Optimal Routing in Wireless Sensor Networks.
Loading...
Date
2010-12
Authors
ORCID
Advisor
Referee
Mark
Journal Title
Journal ISSN
Volume Title
Publisher
Společnost pro radioelektronické inženýrství
Abstract
This work proposes a distributed algorithm for energy optimal routing in a wireless sensor network. The routing problem is described as a mathematical problem by the minimum-cost multi-commodity network flow problem. Due to the separability of the problem, we use the duality theorem to derive the distributed algorithm. The algorithm computes the energy optimal routing in the network without any central node or knowledge of 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. An evaluation of the presented algorithm on benchmarks for the energy optimal data flow routing in sensor networks with up to 100 nodes is presented.
Description
Citation
Radioengineering. 2010, vol. 19, č. 4, s. 579-588. ISSN 1210-2512
http://www.radioeng.cz/fulltexts/2010/10_04_579_588.pdf
http://www.radioeng.cz/fulltexts/2010/10_04_579_588.pdf
Document type
Peer-reviewed
Document version
Published version
Date of access to the full text
Language of document
en