Show simple item record

dc.contributor.authorTrdlicka, J.
dc.contributor.authorHanzalek, Z.
dc.date.accessioned2016-03-11T09:20:18Z
dc.date.available2016-03-11T09:20:18Z
dc.date.issued2010-12cs
dc.identifier.citationRadioengineering. 2010, vol. 19, č. 4, s. 579-588. ISSN 1210-2512cs
dc.identifier.issn1210-2512
dc.identifier.urihttp://hdl.handle.net/11012/57036
dc.description.abstractThis 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.en
dc.formattextcs
dc.format.extent579-588cs
dc.format.mimetypeapplication/pdfen
dc.language.isoencs
dc.publisherSpolečnost pro radioelektronické inženýrstvícs
dc.relation.ispartofRadioengineeringcs
dc.relation.urihttp://www.radioeng.cz/fulltexts/2010/10_04_579_588.pdfcs
dc.rightsCreative Commons Attribution 3.0 Unported Licenseen
dc.rights.urihttp://creativecommons.org/licenses/by/3.0/en
dc.subjectRoutingen
dc.subjectIn-network distributed algorithmsen
dc.subjectMulti-commodity network flowen
dc.subjectDual decompositionen
dc.titleDistributed Multi-Commodity Network Flow Algorithm for Energy Optimal Routing in Wireless Sensor Networks.en
eprints.affiliatedInstitution.facultyFakulta eletrotechniky a komunikačních technologiícs
dc.coverage.issue4cs
dc.coverage.volume19cs
dc.rights.accessopenAccessen
dc.type.driverarticleen
dc.type.statusPeer-revieweden
dc.type.versionpublishedVersionen


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record

Creative Commons Attribution 3.0 Unported License
Except where otherwise noted, this item's license is described as Creative Commons Attribution 3.0 Unported License