The University of Southampton
University of Southampton Institutional Repository

Optimal distributed routing and power control decomposition for wireless networks

Optimal distributed routing and power control decomposition for wireless networks
Optimal distributed routing and power control decomposition for wireless networks
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.
9781424410439
4920 -4924
IEEE
Dekorsy, Armin
be243cd2-a585-48ff-b701-da153098bf5d
Fliege, Jörg
54978787-a271-4f70-8494-3c701c893d98
Söllner, Michael
cd441272-57dd-4ada-ae3e-51a89c10a96b
Dekorsy, Armin
be243cd2-a585-48ff-b701-da153098bf5d
Fliege, Jörg
54978787-a271-4f70-8494-3c701c893d98
Söllner, Michael
cd441272-57dd-4ada-ae3e-51a89c10a96b

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) (26/11/07 - 30/11/07) IEEE, 4920 -4924. (doi:10.1109/GLOCOM.2007.933).

Record type: Book Section

Abstract

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.

This record has no associated files available for download.

More information

Published date: 12 December 2007
Venue - Dates: Global Telecommunications Conference, 2007 (GLOBECOM '07), Washington DC, USA, 2007-11-26 - 2007-11-30
Organisations: Operational Research

Identifiers

Local EPrints ID: 54549
URI: http://eprints.soton.ac.uk/id/eprint/54549
ISBN: 9781424410439
PURE UUID: e15cca35-1f5a-479b-9a74-0bcfbf71f676
ORCID for Jörg Fliege: ORCID iD orcid.org/0000-0002-4459-5419

Catalogue record

Date deposited: 28 Jul 2008
Last modified: 16 Mar 2024 03:57

Export record

Altmetrics

Contributors

Author: Armin Dekorsy
Author: Jörg Fliege ORCID iD
Author: Michael Söllner

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

Atom RSS 1.0 RSS 2.0

Contact ePrints Soton: eprints@soton.ac.uk

ePrints Soton supports OAI 2.0 with a base URL of http://eprints.soton.ac.uk/cgi/oai2

This repository has been built using EPrints software, developed at the University of Southampton, but available to everyone to use.

We use cookies to ensure that we give you the best experience on our website. If you continue without changing your settings, we will assume that you are happy to receive cookies on the University of Southampton website.

×