Optimal scheduling policies with mutual information accumulation in wireless networks

Jing Yang, Yanpei Liu, Stark C. Draper

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

5 Citations (Scopus)

Abstract

In this paper, we aim to develop scheduling policies to maximize the stability region of a wireless network under the assumption that mutual information accumulation is implemented at the physical layer. This enhanced physical layer capability enables the system to accumulate information even when the link between two nodes is not good and a packet cannot be decoded within a slot. The result is an expansion of the stability region of the system. The accumulation process does not satisfy the i.i.d assumption that underlies many previous analysis in this area. Therefore it also brings new challenges to the problem. We propose two dynamic scheduling algorithms to overcome this difficulty. One performs scheduling every T slot, which inevitably increases average delay in the system, but approaches the boundary of the stability region. The second constructs a virtual system with the same stability region. Through controlling the virtual queues in the constructed system, we avoid the non-i.i.d difficulty and attain the stability region. We derive performance bounds under both algorithms and compare them through simulation results.

Original languageEnglish (US)
Title of host publication2012 Proceedings IEEE INFOCOM, INFOCOM 2012
Pages1062-1070
Number of pages9
DOIs
StatePublished - Jun 4 2012
EventIEEE Conference on Computer Communications, INFOCOM 2012 - Orlando, FL, United States
Duration: Mar 25 2012Mar 30 2012

Other

OtherIEEE Conference on Computer Communications, INFOCOM 2012
CountryUnited States
CityOrlando, FL
Period3/25/123/30/12

Fingerprint

Wireless networks
Scheduling
Scheduling algorithms

All Science Journal Classification (ASJC) codes

  • Computer Science(all)
  • Electrical and Electronic Engineering

Cite this

Yang, J., Liu, Y., & Draper, S. C. (2012). Optimal scheduling policies with mutual information accumulation in wireless networks. In 2012 Proceedings IEEE INFOCOM, INFOCOM 2012 (pp. 1062-1070). [6195462] https://doi.org/10.1109/INFCOM.2012.6195462
Yang, Jing ; Liu, Yanpei ; Draper, Stark C. / Optimal scheduling policies with mutual information accumulation in wireless networks. 2012 Proceedings IEEE INFOCOM, INFOCOM 2012. 2012. pp. 1062-1070
@inproceedings{bb1be1640aa24ae69cfefc8ffd5b5009,
title = "Optimal scheduling policies with mutual information accumulation in wireless networks",
abstract = "In this paper, we aim to develop scheduling policies to maximize the stability region of a wireless network under the assumption that mutual information accumulation is implemented at the physical layer. This enhanced physical layer capability enables the system to accumulate information even when the link between two nodes is not good and a packet cannot be decoded within a slot. The result is an expansion of the stability region of the system. The accumulation process does not satisfy the i.i.d assumption that underlies many previous analysis in this area. Therefore it also brings new challenges to the problem. We propose two dynamic scheduling algorithms to overcome this difficulty. One performs scheduling every T slot, which inevitably increases average delay in the system, but approaches the boundary of the stability region. The second constructs a virtual system with the same stability region. Through controlling the virtual queues in the constructed system, we avoid the non-i.i.d difficulty and attain the stability region. We derive performance bounds under both algorithms and compare them through simulation results.",
author = "Jing Yang and Yanpei Liu and Draper, {Stark C.}",
year = "2012",
month = "6",
day = "4",
doi = "10.1109/INFCOM.2012.6195462",
language = "English (US)",
isbn = "9781467307758",
pages = "1062--1070",
booktitle = "2012 Proceedings IEEE INFOCOM, INFOCOM 2012",

}

Yang, J, Liu, Y & Draper, SC 2012, Optimal scheduling policies with mutual information accumulation in wireless networks. in 2012 Proceedings IEEE INFOCOM, INFOCOM 2012., 6195462, pp. 1062-1070, IEEE Conference on Computer Communications, INFOCOM 2012, Orlando, FL, United States, 3/25/12. https://doi.org/10.1109/INFCOM.2012.6195462

Optimal scheduling policies with mutual information accumulation in wireless networks. / Yang, Jing; Liu, Yanpei; Draper, Stark C.

2012 Proceedings IEEE INFOCOM, INFOCOM 2012. 2012. p. 1062-1070 6195462.

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

TY - GEN

T1 - Optimal scheduling policies with mutual information accumulation in wireless networks

AU - Yang, Jing

AU - Liu, Yanpei

AU - Draper, Stark C.

PY - 2012/6/4

Y1 - 2012/6/4

N2 - In this paper, we aim to develop scheduling policies to maximize the stability region of a wireless network under the assumption that mutual information accumulation is implemented at the physical layer. This enhanced physical layer capability enables the system to accumulate information even when the link between two nodes is not good and a packet cannot be decoded within a slot. The result is an expansion of the stability region of the system. The accumulation process does not satisfy the i.i.d assumption that underlies many previous analysis in this area. Therefore it also brings new challenges to the problem. We propose two dynamic scheduling algorithms to overcome this difficulty. One performs scheduling every T slot, which inevitably increases average delay in the system, but approaches the boundary of the stability region. The second constructs a virtual system with the same stability region. Through controlling the virtual queues in the constructed system, we avoid the non-i.i.d difficulty and attain the stability region. We derive performance bounds under both algorithms and compare them through simulation results.

AB - In this paper, we aim to develop scheduling policies to maximize the stability region of a wireless network under the assumption that mutual information accumulation is implemented at the physical layer. This enhanced physical layer capability enables the system to accumulate information even when the link between two nodes is not good and a packet cannot be decoded within a slot. The result is an expansion of the stability region of the system. The accumulation process does not satisfy the i.i.d assumption that underlies many previous analysis in this area. Therefore it also brings new challenges to the problem. We propose two dynamic scheduling algorithms to overcome this difficulty. One performs scheduling every T slot, which inevitably increases average delay in the system, but approaches the boundary of the stability region. The second constructs a virtual system with the same stability region. Through controlling the virtual queues in the constructed system, we avoid the non-i.i.d difficulty and attain the stability region. We derive performance bounds under both algorithms and compare them through simulation results.

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

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

U2 - 10.1109/INFCOM.2012.6195462

DO - 10.1109/INFCOM.2012.6195462

M3 - Conference contribution

AN - SCOPUS:84861648651

SN - 9781467307758

SP - 1062

EP - 1070

BT - 2012 Proceedings IEEE INFOCOM, INFOCOM 2012

ER -

Yang J, Liu Y, Draper SC. Optimal scheduling policies with mutual information accumulation in wireless networks. In 2012 Proceedings IEEE INFOCOM, INFOCOM 2012. 2012. p. 1062-1070. 6195462 https://doi.org/10.1109/INFCOM.2012.6195462