An active constraint method for distributed routing, and power control in wireless networks
An active constraint method for distributed routing, and power control in wireless networks
Efficiently transmitting data in wireless networks requires joint optimization of routing, scheduling, and power control. As opposed to the universal dual decomposition we present a method that solves this optimization problem by fully exploiting our knowledge of active constraints. The method still maintains main requirements such as optimality, distributed implementation, multiple path routing and per-hop error performance. To reduce the complexity of the whole problem, we separate scheduling from routing and power control, including it instead in the constraint set of the joint optimization problem. Apart from the mathematical framework we introduce a routing and power control decomposition algorithm that uses the active constraint method, and we give further details on its distributed application. For verification, we apply the distributed RPCD algorithm to examples of wireless mesh backhaul networks with fixed nodes. Impressive convergence results indicate that the distributed RPCD algorithm calculates the optimum solution in one decomposition step only.
656832-[12 pp]
Ferizi, Alban
b5d788a5-1947-4275-b3d0-7875f64439b3
Dekorsy, Armin
be243cd2-a585-48ff-b701-da153098bf5d
Fliege, Joerg
54978787-a271-4f70-8494-3c701c893d98
Popova, Larissa
95861d80-c198-4eae-bb3a-079f4a37f103
Koch, Wolfgang
28036d53-8095-4876-bbb4-b24883bcae5e
Soellner, Michael
2ec0af68-c42d-47b1-a1a3-c091c887d449
23 March 2010
Ferizi, Alban
b5d788a5-1947-4275-b3d0-7875f64439b3
Dekorsy, Armin
be243cd2-a585-48ff-b701-da153098bf5d
Fliege, Joerg
54978787-a271-4f70-8494-3c701c893d98
Popova, Larissa
95861d80-c198-4eae-bb3a-079f4a37f103
Koch, Wolfgang
28036d53-8095-4876-bbb4-b24883bcae5e
Soellner, Michael
2ec0af68-c42d-47b1-a1a3-c091c887d449
Ferizi, Alban, Dekorsy, Armin, Fliege, Joerg, Popova, Larissa, Koch, Wolfgang and Soellner, Michael
(2010)
An active constraint method for distributed routing, and power control in wireless networks.
EURASIP Journal on Wireless Communications and Networking, 2009, .
(doi:10.1155/2009/656832).
Abstract
Efficiently transmitting data in wireless networks requires joint optimization of routing, scheduling, and power control. As opposed to the universal dual decomposition we present a method that solves this optimization problem by fully exploiting our knowledge of active constraints. The method still maintains main requirements such as optimality, distributed implementation, multiple path routing and per-hop error performance. To reduce the complexity of the whole problem, we separate scheduling from routing and power control, including it instead in the constraint set of the joint optimization problem. Apart from the mathematical framework we introduce a routing and power control decomposition algorithm that uses the active constraint method, and we give further details on its distributed application. For verification, we apply the distributed RPCD algorithm to examples of wireless mesh backhaul networks with fixed nodes. Impressive convergence results indicate that the distributed RPCD algorithm calculates the optimum solution in one decomposition step only.
This record has no associated files available for download.
More information
Published date: 23 March 2010
Organisations:
Operational Research
Identifiers
Local EPrints ID: 79916
URI: http://eprints.soton.ac.uk/id/eprint/79916
ISSN: 1687-1472
PURE UUID: 7966d6de-f69a-4d89-843b-acf769bbf2ff
Catalogue record
Date deposited: 23 Mar 2010
Last modified: 14 Mar 2024 02:53
Export record
Altmetrics
Contributors
Author:
Alban Ferizi
Author:
Armin Dekorsy
Author:
Larissa Popova
Author:
Wolfgang Koch
Author:
Michael Soellner
Download statistics
Downloads from ePrints over the past year. Other digital versions may also be available to download e.g. from the publisher's website.
View more statistics