Distributed opportunistic scheduling with two-level channel probing

Thejaswi P S Chandrashekhar, Junshan Zhang, Man On Pun, H. V. Poor

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

6 Citations (Scopus)

Abstract

Distributed opportunistic scheduling (DOS) is studied for wireless ad-hoc networks in which many links contend for the channel using random access before data transmissions. Simply put, DOS involves a process of joint channel probing and distributed scheduling for ad-hoc (peer-to-peer) communications. Since, in practice, link conditions are estimated with noisy observations, the transmission rate has to be backed off from the estimated rate to avoid transmission outages. Then, a natural question to ask is whether it is worthwhile for the link with successful contention to perform further channel probing to mitigate estimation errors, at the cost of additional probing. Thus motivated, this work investigates DOS with two-level channel probing by optimizing the tradeoff between the throughput gain from more accurate rate estimation and the resulting additional delay. Capitalizing on optimal stopping theory with incomplete information, we show that the optimal scheduling policy is threshold-based and is characterized by either one or two thresholds, depending on network settings. Necessary and sufficient conditions for both cases are rigorously established. In particular, our analysis reveals that performing second-level channel probing is optimal when the first-level estimated channel condition falls in between the two thresholds. Finally, numerical results are provided to illustrate the effectiveness of the proposed DOS with two-level channel probing.

Original languageEnglish (US)
Title of host publicationProceedings - IEEE INFOCOM
Pages1683-1691
Number of pages9
DOIs
StatePublished - 2009
Externally publishedYes
Event28th Conference on Computer Communications, IEEE INFOCOM 2009 - Rio de Janeiro, Brazil
Duration: Apr 19 2009Apr 25 2009

Other

Other28th Conference on Computer Communications, IEEE INFOCOM 2009
CountryBrazil
CityRio de Janeiro
Period4/19/094/25/09

Fingerprint

Scheduling
Wireless ad hoc networks
Outages
Data communication systems
Error analysis
Throughput
Communication

ASJC Scopus subject areas

  • Computer Science(all)
  • Electrical and Electronic Engineering

Cite this

Chandrashekhar, T. P. S., Zhang, J., Pun, M. O., & Poor, H. V. (2009). Distributed opportunistic scheduling with two-level channel probing. In Proceedings - IEEE INFOCOM (pp. 1683-1691). [5062087] https://doi.org/10.1109/INFCOM.2009.5062087

Distributed opportunistic scheduling with two-level channel probing. / Chandrashekhar, Thejaswi P S; Zhang, Junshan; Pun, Man On; Poor, H. V.

Proceedings - IEEE INFOCOM. 2009. p. 1683-1691 5062087.

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

Chandrashekhar, TPS, Zhang, J, Pun, MO & Poor, HV 2009, Distributed opportunistic scheduling with two-level channel probing. in Proceedings - IEEE INFOCOM., 5062087, pp. 1683-1691, 28th Conference on Computer Communications, IEEE INFOCOM 2009, Rio de Janeiro, Brazil, 4/19/09. https://doi.org/10.1109/INFCOM.2009.5062087
Chandrashekhar TPS, Zhang J, Pun MO, Poor HV. Distributed opportunistic scheduling with two-level channel probing. In Proceedings - IEEE INFOCOM. 2009. p. 1683-1691. 5062087 https://doi.org/10.1109/INFCOM.2009.5062087
Chandrashekhar, Thejaswi P S ; Zhang, Junshan ; Pun, Man On ; Poor, H. V. / Distributed opportunistic scheduling with two-level channel probing. Proceedings - IEEE INFOCOM. 2009. pp. 1683-1691
@inproceedings{215f21c33d1e468eb8f5c822a7d062b5,
title = "Distributed opportunistic scheduling with two-level channel probing",
abstract = "Distributed opportunistic scheduling (DOS) is studied for wireless ad-hoc networks in which many links contend for the channel using random access before data transmissions. Simply put, DOS involves a process of joint channel probing and distributed scheduling for ad-hoc (peer-to-peer) communications. Since, in practice, link conditions are estimated with noisy observations, the transmission rate has to be backed off from the estimated rate to avoid transmission outages. Then, a natural question to ask is whether it is worthwhile for the link with successful contention to perform further channel probing to mitigate estimation errors, at the cost of additional probing. Thus motivated, this work investigates DOS with two-level channel probing by optimizing the tradeoff between the throughput gain from more accurate rate estimation and the resulting additional delay. Capitalizing on optimal stopping theory with incomplete information, we show that the optimal scheduling policy is threshold-based and is characterized by either one or two thresholds, depending on network settings. Necessary and sufficient conditions for both cases are rigorously established. In particular, our analysis reveals that performing second-level channel probing is optimal when the first-level estimated channel condition falls in between the two thresholds. Finally, numerical results are provided to illustrate the effectiveness of the proposed DOS with two-level channel probing.",
author = "Chandrashekhar, {Thejaswi P S} and Junshan Zhang and Pun, {Man On} and Poor, {H. V.}",
year = "2009",
doi = "10.1109/INFCOM.2009.5062087",
language = "English (US)",
isbn = "9781424435135",
pages = "1683--1691",
booktitle = "Proceedings - IEEE INFOCOM",

}

TY - GEN

T1 - Distributed opportunistic scheduling with two-level channel probing

AU - Chandrashekhar, Thejaswi P S

AU - Zhang, Junshan

AU - Pun, Man On

AU - Poor, H. V.

PY - 2009

Y1 - 2009

N2 - Distributed opportunistic scheduling (DOS) is studied for wireless ad-hoc networks in which many links contend for the channel using random access before data transmissions. Simply put, DOS involves a process of joint channel probing and distributed scheduling for ad-hoc (peer-to-peer) communications. Since, in practice, link conditions are estimated with noisy observations, the transmission rate has to be backed off from the estimated rate to avoid transmission outages. Then, a natural question to ask is whether it is worthwhile for the link with successful contention to perform further channel probing to mitigate estimation errors, at the cost of additional probing. Thus motivated, this work investigates DOS with two-level channel probing by optimizing the tradeoff between the throughput gain from more accurate rate estimation and the resulting additional delay. Capitalizing on optimal stopping theory with incomplete information, we show that the optimal scheduling policy is threshold-based and is characterized by either one or two thresholds, depending on network settings. Necessary and sufficient conditions for both cases are rigorously established. In particular, our analysis reveals that performing second-level channel probing is optimal when the first-level estimated channel condition falls in between the two thresholds. Finally, numerical results are provided to illustrate the effectiveness of the proposed DOS with two-level channel probing.

AB - Distributed opportunistic scheduling (DOS) is studied for wireless ad-hoc networks in which many links contend for the channel using random access before data transmissions. Simply put, DOS involves a process of joint channel probing and distributed scheduling for ad-hoc (peer-to-peer) communications. Since, in practice, link conditions are estimated with noisy observations, the transmission rate has to be backed off from the estimated rate to avoid transmission outages. Then, a natural question to ask is whether it is worthwhile for the link with successful contention to perform further channel probing to mitigate estimation errors, at the cost of additional probing. Thus motivated, this work investigates DOS with two-level channel probing by optimizing the tradeoff between the throughput gain from more accurate rate estimation and the resulting additional delay. Capitalizing on optimal stopping theory with incomplete information, we show that the optimal scheduling policy is threshold-based and is characterized by either one or two thresholds, depending on network settings. Necessary and sufficient conditions for both cases are rigorously established. In particular, our analysis reveals that performing second-level channel probing is optimal when the first-level estimated channel condition falls in between the two thresholds. Finally, numerical results are provided to illustrate the effectiveness of the proposed DOS with two-level channel probing.

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

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

U2 - 10.1109/INFCOM.2009.5062087

DO - 10.1109/INFCOM.2009.5062087

M3 - Conference contribution

SN - 9781424435135

SP - 1683

EP - 1691

BT - Proceedings - IEEE INFOCOM

ER -