Convex approximation algorithms for back-pressure power control

Evaggelia Matskani; Nicholas D. Sidiropoulos; Leandros Tassiulas

doi:10.1109/TSP.2012.2184097

Convex approximation algorithms for back-pressure power control

Evaggelia Matskani, Nicholas D. Sidiropoulos, Leandros Tassiulas

Electrical and Computer Engineering

Research output: Contribution to journal › Article › peer-review

9 Scopus citations

Abstract

Throughput-optimal multihop wireless network operation entails a key physical-layer optimization problem: maximizing a weighted sum of link rates, with weights given by the differential queue backlogs. This emerges in joint back-pressure routing and power control, which is central in cross-layer wireless networking. We begin by showing that the core problem is not only nonconvex, but also NP-hard. This is a negative result, which however comes with a positive flip side: drawing from related developments in the digital subscriber line (DSL) literature, we propose effective ways to approximate it. Exploiting quasi-periodicity of the power allocation in stable setups due to the push-pull nature of the solution, we derive two custom algorithms that offer excellent throughput performance at reasonable, worst-case polynomial complexity. Judicious simulations illustrate the merits of the proposed algorithms.

Original language	English (US)
Article number	6129545
Pages (from-to)	1957-1970
Number of pages	14
Journal	IEEE Transactions on Signal Processing
Volume	60
Issue number	4
DOIs	https://doi.org/10.1109/TSP.2012.2184097
State	Published - Apr 2012

Bibliographical note

Funding Information:
Manuscript received October 20, 2010; revised April 28, 2011 and November 27, 2011; accepted December 18, 2011. Date of publication January 12, 2012; date of current version March 06, 2012. The associate editor coordinating the review of this manuscript and approving it for publication was Dr. Josep Vidal. This work was co-financed by the European Union (European Social Fund—ESF) and Greek National Funds through the Operational Program “Education and Lifelong Learning” of the National Strategic Reference Framework (NSRF)—Research Funding Program: Heracleitus II, investing in knowledge society through the European Social Fund. This work was also supported in part by ARL/ERO, under contract W911NF-09-1-0004 and EC FP7 project N-CRAVE. Part of this work has appeared in Proc. IEEE ICASSP 2011 Conference.

Keywords

Back-pressure routing
NP-hard problems
convex approximation
cross-layer design
digital subscriber line (DSL)
dynamic spectrum management
network optimization
power control
utility maximization

Access

10.1109/TSP.2012.2184097

OpenUrl availability

Full text

Cite this

@article{0f1f02ab4e35490db61bb88e54775653,

title = "Convex approximation algorithms for back-pressure power control",

abstract = "Throughput-optimal multihop wireless network operation entails a key physical-layer optimization problem: maximizing a weighted sum of link rates, with weights given by the differential queue backlogs. This emerges in joint back-pressure routing and power control, which is central in cross-layer wireless networking. We begin by showing that the core problem is not only nonconvex, but also NP-hard. This is a negative result, which however comes with a positive flip side: drawing from related developments in the digital subscriber line (DSL) literature, we propose effective ways to approximate it. Exploiting quasi-periodicity of the power allocation in stable setups due to the push-pull nature of the solution, we derive two custom algorithms that offer excellent throughput performance at reasonable, worst-case polynomial complexity. Judicious simulations illustrate the merits of the proposed algorithms.",

keywords = "Back-pressure routing, NP-hard problems, convex approximation, cross-layer design, digital subscriber line (DSL), dynamic spectrum management, network optimization, power control, utility maximization",

author = "Evaggelia Matskani and Sidiropoulos, {Nicholas D.} and Leandros Tassiulas",

note = "Funding Information: Manuscript received October 20, 2010; revised April 28, 2011 and November 27, 2011; accepted December 18, 2011. Date of publication January 12, 2012; date of current version March 06, 2012. The associate editor coordinating the review of this manuscript and approving it for publication was Dr. Josep Vidal. This work was co-financed by the European Union (European Social Fund—ESF) and Greek National Funds through the Operational Program “Education and Lifelong Learning” of the National Strategic Reference Framework (NSRF)—Research Funding Program: Heracleitus II, investing in knowledge society through the European Social Fund. This work was also supported in part by ARL/ERO, under contract W911NF-09-1-0004 and EC FP7 project N-CRAVE. Part of this work has appeared in Proc. IEEE ICASSP 2011 Conference.",

year = "2012",

month = apr,

doi = "10.1109/TSP.2012.2184097",

language = "English (US)",

volume = "60",

pages = "1957--1970",

journal = "IEEE Transactions on Signal Processing",

issn = "1053-587X",

publisher = "Institute of Electrical and Electronics Engineers Inc.",

number = "4",

}

TY - JOUR

T1 - Convex approximation algorithms for back-pressure power control

AU - Matskani, Evaggelia

AU - Sidiropoulos, Nicholas D.

AU - Tassiulas, Leandros

N1 - Funding Information: Manuscript received October 20, 2010; revised April 28, 2011 and November 27, 2011; accepted December 18, 2011. Date of publication January 12, 2012; date of current version March 06, 2012. The associate editor coordinating the review of this manuscript and approving it for publication was Dr. Josep Vidal. This work was co-financed by the European Union (European Social Fund—ESF) and Greek National Funds through the Operational Program “Education and Lifelong Learning” of the National Strategic Reference Framework (NSRF)—Research Funding Program: Heracleitus II, investing in knowledge society through the European Social Fund. This work was also supported in part by ARL/ERO, under contract W911NF-09-1-0004 and EC FP7 project N-CRAVE. Part of this work has appeared in Proc. IEEE ICASSP 2011 Conference.

PY - 2012/4

Y1 - 2012/4

N2 - Throughput-optimal multihop wireless network operation entails a key physical-layer optimization problem: maximizing a weighted sum of link rates, with weights given by the differential queue backlogs. This emerges in joint back-pressure routing and power control, which is central in cross-layer wireless networking. We begin by showing that the core problem is not only nonconvex, but also NP-hard. This is a negative result, which however comes with a positive flip side: drawing from related developments in the digital subscriber line (DSL) literature, we propose effective ways to approximate it. Exploiting quasi-periodicity of the power allocation in stable setups due to the push-pull nature of the solution, we derive two custom algorithms that offer excellent throughput performance at reasonable, worst-case polynomial complexity. Judicious simulations illustrate the merits of the proposed algorithms.

AB - Throughput-optimal multihop wireless network operation entails a key physical-layer optimization problem: maximizing a weighted sum of link rates, with weights given by the differential queue backlogs. This emerges in joint back-pressure routing and power control, which is central in cross-layer wireless networking. We begin by showing that the core problem is not only nonconvex, but also NP-hard. This is a negative result, which however comes with a positive flip side: drawing from related developments in the digital subscriber line (DSL) literature, we propose effective ways to approximate it. Exploiting quasi-periodicity of the power allocation in stable setups due to the push-pull nature of the solution, we derive two custom algorithms that offer excellent throughput performance at reasonable, worst-case polynomial complexity. Judicious simulations illustrate the merits of the proposed algorithms.

KW - Back-pressure routing

KW - NP-hard problems

KW - convex approximation

KW - cross-layer design

KW - digital subscriber line (DSL)

KW - dynamic spectrum management

KW - network optimization

KW - power control

KW - utility maximization

UR - http://www.scopus.com/inward/record.url?scp=84858302605&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84858302605&partnerID=8YFLogxK

U2 - 10.1109/TSP.2012.2184097

DO - 10.1109/TSP.2012.2184097

M3 - Article

AN - SCOPUS:84858302605

SN - 1053-587X

VL - 60

SP - 1957

EP - 1970

JO - IEEE Transactions on Signal Processing

JF - IEEE Transactions on Signal Processing

IS - 4

M1 - 6129545

ER -

Convex approximation algorithms for back-pressure power control

Abstract

Bibliographical note

Keywords

Access

OpenUrl availability

Other files and links

Fingerprint

Cite this