Energy efficient greedy link scheduling and power control in wireless networks

Arun Sridharan, Changhee Joo, C. Emre Koksal

Research output: Chapter in Book/Report/Conference proceedingConference contribution

Abstract

We consider the problem of joint link scheduling and power control for wireless networks with average transmission power constraints. Due to the high computational complexity of the optimal policies, we extend the class of greedy link scheduling policies to handle average power constraints. We develop a greedy link scheduling and power control scheme GECS, with provable performance guarantees. We show that the performance of our greedy scheduler can be characterized using the Local Pooling Factor (LPF) of a network graph, which has been previously used to characterize the stability of the Greedy Maximal Scheduling (GMS) policy for wireless networks. We also simulate the performance of GECS on wireless network, and compare its performance to another candidate greedy link scheduling and power control policy.

Original languageEnglish
Title of host publication2012 IEEE International Symposium on Information Theory Proceedings, ISIT 2012
Pages811-815
Number of pages5
DOIs
Publication statusPublished - 2012
Externally publishedYes
Event2012 IEEE International Symposium on Information Theory, ISIT 2012 - Cambridge, MA, United States
Duration: 2012 Jul 12012 Jul 6

Publication series

NameIEEE International Symposium on Information Theory - Proceedings

Conference

Conference2012 IEEE International Symposium on Information Theory, ISIT 2012
Country/TerritoryUnited States
CityCambridge, MA
Period12/7/112/7/6

ASJC Scopus subject areas

  • Theoretical Computer Science
  • Information Systems
  • Modelling and Simulation
  • Applied Mathematics

Fingerprint

Dive into the research topics of 'Energy efficient greedy link scheduling and power control in wireless networks'. Together they form a unique fingerprint.

Cite this