Optimal distributed routing and power control decomposition for wireless networks
Dekorsy, Armin, Fliege, Jörg and Söllner, Michael (2007) Optimal distributed routing and power control decomposition for wireless networks. In, Global Telecommunications Conference, 2007. GLOBECOM '07. IEE. Global Telecommunications Conference, 2007 (GLOBECOM '07) , Institute of Electrical and Electronics Engineers, 4920 -4924. (doi:10.1109/GLOCOM.2007.933).
Full text not available from this repository.
Efficiently transmitting data in wireless networks requires an integrated routing, scheduling, and power control strategy. As opposed to the universal dual decomposition we present a method that solve this optimization problem by fully exploiting its combinatorial structure. The method still maintains main requirements such as optimality, distributed implementation, multiple path routing, and per-hop error performance. The method represents a cross-layer approach where we include scheduling in the constraint set of a joint routing and power control optimization problem. Apart from the mathematical framework, the main contribution is a routing and power control decomposition (RPCD) algorithm. For verification, we compare the RPCD algorithm with state-of-art dual decomposition for wireless mesh backhaul networks. Impressive convergence results indicate that the RPCD algorithm calculates the optimum solution in one decomposition step only.
|Item Type:||Book Section|
|Subjects:||Q Science > QA Mathematics > QA76 Computer software|
|Divisions:||University Structure - Pre August 2011 > School of Mathematics > Operational Research
|Date Deposited:||28 Jul 2008|
|Last Modified:||27 Mar 2014 18:37|
|RDF:||RDF+N-Triples, RDF+N3, RDF+XML, Browse.|
Actions (login required)