Fast algorithms for joint power control and scheduling in wireless networks

This paper studies the problem of finding a minimum-length schedule of a power-controlled wireless network subject to traffic demands and SINR (signal-to-interference-plus-noise ratio) constraints. We propose a column generation based algorithm that finds the optimal schedules and transmit powers. T...

Full description

Saved in:
Bibliographic Details
Published in:IEEE transactions on wireless communications Vol. 9; no. 3; pp. 1186 - 1197
Main Authors: Fu, Liqun, Liew, Soung Chang, Huang, Jianwei
Format: Journal Article
Language:English
Published: New York, NY IEEE 01.03.2010
Institute of Electrical and Electronics Engineers
The Institute of Electrical and Electronics Engineers, Inc. (IEEE)
Subjects:
Algorithms
Applied sciences
branch-and-price
column generation
Columns (structural)
Communication system traffic control
Exact sciences and technology
Heuristic algorithms
Links
Networks
Optimal scheduling
Optimization
Power control
Power generation
Pricing
Runtime
Scheduling
Scheduling algorithm
Signal to noise ratio
SINR constraints
Systems, networks and services of telecommunications
Telecommunications
Telecommunications and information theory
Teletraffic
Wireless communication
Wireless networks
Performance evaluation
Optimal algorithm
Branch and bound method
Wireless telecommunication
branch-and-price
Teletraffic
Eigenvalue
SINR constraints
column generation
Scheduling
Joint
Optimization
Time slot assignment
Algorithm performance
Simulation
Power control
Optimal solution
Pricing
Heuristic method
Wireless network
Optimal planning
Tariffication
Fast algorithm
Signal to interference plus noise ratio
ISSN:1536-1276, 1558-2248
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:This paper studies the problem of finding a minimum-length schedule of a power-controlled wireless network subject to traffic demands and SINR (signal-to-interference-plus-noise ratio) constraints. We propose a column generation based algorithm that finds the optimal schedules and transmit powers. The column generation method decomposes a complex linear optimization problem into a restricted master problem and a pricing problem. We develop a new formulation of the pricing problem using the Perron-Frobenius eigenvalue condition, which enables us to integrate link scheduling with power control in a single framework. This new formulation reduces the complexity of the pricing problem, and thus improves the overall efficiency of the column generation method significantly - for example, the average runtime is reduced by 99.86% in 18-link networks compared with the traditional column generation method. Furthermore, we propose a branch-and-price method that combines column generation with the branch-and-bound technique to tackle the integer constraints on time slot allocation. We develop a new branching rule in the branch-and-price method that maintains the size of the pricing problem after each branching. Our branch-and-price method can obtain optimal integer solutions efficiently for example, the average runtime is reduced by 99.72% in 18-link networks compared with the traditional branch-and-price method. We further suggest efficient heuristic algorithms based on the structure of the optimal algorithms. Simulation results show that the heuristic algorithms can reach solutions within 10% of optimality for networks with less than 30 links.
Bibliography:ObjectType-Article-2
SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
content type line 23
ISSN:1536-1276
1558-2248
DOI:10.1109/TWC.2010.03.090824