Reducing feedback overhead in opportunistic scheduling of wireless networks exploiting overhearing

Research output: Contribution to journalArticle

Abstract

We propose a scheme to reduce the overhead associated with channel state information (CSI) feedback required for opportunistic scheduling in wireless access networks. We study the case where CSI is partially overheard by mobiles and thus one can suppress transmitting CSI reports for time varying channels of inferior quality. We model the mechanism of feedback suppression as a Bayesian network, and show that the problem of minimizing the average feedback overhead is NP-hard. To deal with hardness of the problem we identify a class of feedback suppression structures which allow efficient computation of the cost. Leveraging such structures we propose an algorithm which not only captures the essence of seemingly complex overhearing relations among mobiles, but also provides a simple estimate of the cost incurred by a suppression structure. Simulation results are provided to demonstrate the improvements offered by the proposed scheme, e.g., a savings of 63-83% depending on the network size.

Original languageEnglish
Pages (from-to)593-609
Number of pages17
JournalKSII Transactions on Internet and Information Systems
Volume6
Issue number2
DOIs
Publication statusPublished - 2012 Feb 28

Fingerprint

Wireless networks
Channel state information
Scheduling
Feedback
Bayesian networks
Costs
Hardness

Keywords

  • Bayesian network
  • Channel state information
  • Feedback
  • Graphs
  • Scheduling

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Information Systems

Cite this

@article{8d43d55771074a6c84772d251ddfe43b,
title = "Reducing feedback overhead in opportunistic scheduling of wireless networks exploiting overhearing",
abstract = "We propose a scheme to reduce the overhead associated with channel state information (CSI) feedback required for opportunistic scheduling in wireless access networks. We study the case where CSI is partially overheard by mobiles and thus one can suppress transmitting CSI reports for time varying channels of inferior quality. We model the mechanism of feedback suppression as a Bayesian network, and show that the problem of minimizing the average feedback overhead is NP-hard. To deal with hardness of the problem we identify a class of feedback suppression structures which allow efficient computation of the cost. Leveraging such structures we propose an algorithm which not only captures the essence of seemingly complex overhearing relations among mobiles, but also provides a simple estimate of the cost incurred by a suppression structure. Simulation results are provided to demonstrate the improvements offered by the proposed scheme, e.g., a savings of 63-83{\%} depending on the network size.",
keywords = "Bayesian network, Channel state information, Feedback, Graphs, Scheduling",
author = "Baek, {Seung Jun}",
year = "2012",
month = "2",
day = "28",
doi = "10.3837/tiis.2012.02.009",
language = "English",
volume = "6",
pages = "593--609",
journal = "KSII Transactions on Internet and Information Systems",
issn = "1976-7277",
publisher = "Korea Society of Internet Information",
number = "2",

}

TY - JOUR

T1 - Reducing feedback overhead in opportunistic scheduling of wireless networks exploiting overhearing

AU - Baek, Seung Jun

PY - 2012/2/28

Y1 - 2012/2/28

N2 - We propose a scheme to reduce the overhead associated with channel state information (CSI) feedback required for opportunistic scheduling in wireless access networks. We study the case where CSI is partially overheard by mobiles and thus one can suppress transmitting CSI reports for time varying channels of inferior quality. We model the mechanism of feedback suppression as a Bayesian network, and show that the problem of minimizing the average feedback overhead is NP-hard. To deal with hardness of the problem we identify a class of feedback suppression structures which allow efficient computation of the cost. Leveraging such structures we propose an algorithm which not only captures the essence of seemingly complex overhearing relations among mobiles, but also provides a simple estimate of the cost incurred by a suppression structure. Simulation results are provided to demonstrate the improvements offered by the proposed scheme, e.g., a savings of 63-83% depending on the network size.

AB - We propose a scheme to reduce the overhead associated with channel state information (CSI) feedback required for opportunistic scheduling in wireless access networks. We study the case where CSI is partially overheard by mobiles and thus one can suppress transmitting CSI reports for time varying channels of inferior quality. We model the mechanism of feedback suppression as a Bayesian network, and show that the problem of minimizing the average feedback overhead is NP-hard. To deal with hardness of the problem we identify a class of feedback suppression structures which allow efficient computation of the cost. Leveraging such structures we propose an algorithm which not only captures the essence of seemingly complex overhearing relations among mobiles, but also provides a simple estimate of the cost incurred by a suppression structure. Simulation results are provided to demonstrate the improvements offered by the proposed scheme, e.g., a savings of 63-83% depending on the network size.

KW - Bayesian network

KW - Channel state information

KW - Feedback

KW - Graphs

KW - Scheduling

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

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

U2 - 10.3837/tiis.2012.02.009

DO - 10.3837/tiis.2012.02.009

M3 - Article

AN - SCOPUS:84862225582

VL - 6

SP - 593

EP - 609

JO - KSII Transactions on Internet and Information Systems

JF - KSII Transactions on Internet and Information Systems

SN - 1976-7277

IS - 2

ER -