Power Controlled Scheduling with Consecutive Transmission Constraints: Complexity Analysis and Algorithm Design

We study the joint power control and minimum-frame-length scheduling problem in wireless networks, under the physical interference model and subject to consecutive transmission constraints. We start by investigating the complexity of the problem and present the first NP-completeness proof in the lit...

Celý popis

Uloženo v:
Podrobná bibliografie
Vydáno v:IEEE INFOCOM 2009 s. 1530 - 1538
Hlavní autoři: Fu, L., Liew, S. C., Huang, J.
Médium: Konferenční příspěvek
Jazyk:angličtina
Vydáno: IEEE 01.04.2009
Témata:
Algorithm design and analysis
Approximation algorithms
Interference constraints
Optimal scheduling
Power control
Power system modeling
Protocols
Scheduling algorithm
Telecommunication traffic
Wireless networks
ISBN:1424435129, 9781424435128
ISSN:0743-166X
On-line přístup:Získat plný text
Tagy: Přidat tag
Žádné tagy, Buďte první, kdo vytvoří štítek k tomuto záznamu!
Popis
Shrnutí:We study the joint power control and minimum-frame-length scheduling problem in wireless networks, under the physical interference model and subject to consecutive transmission constraints. We start by investigating the complexity of the problem and present the first NP-completeness proof in the literature. We propose a polynomial-time approximation algorithm, called guaranteed and greedy scheduling (GGS) algorithm, to tackle this problem. We prove a bounded approximation ratio of the proposed algorithm relative to the optimal scheduling algorithm. Moreover, the proposed algorithm significantly outperforms the state-of-the-art related algorithm. Interestingly, our algorithm together with its bounded approximation ratio is applicable even when the consecutive transmission constraint is relaxed. To the best of our knowledge, the proposed algorithm is the first known polynomial-time algorithm with a proven bounded approximation ratio for the joint power control and scheduling problem under the physical interference model. We further demonstrate the performance and advantages of our algorithm through extensive simulations.
ISBN:1424435129
9781424435128
ISSN:0743-166X
DOI:10.1109/INFCOM.2009.5062070