Threshold structure of channel aware distributed scheduling in ad-hoc networks: An optimal stopping view

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

3 Citations (Scopus)

Abstract

As evidenced by measurement data, channel fading and co-channel interference occur on the same time scales, and it is therefore difficult to determine if packet losses are due to interference change or channel variation. The coupling between the timescales of fading and interference at the MAC layer calls for a unified PHY/MAC design. Using optimal stopping theory, we first devise channel aware distributed scheduling to exploit rich PHY/MAC diversities in single-hop ad-hoc networks, for a variety of PHY-layer models. We show that the optimal channel aware distributed scheduling algorithms have threshold structures, and hence are amenable to easy implementation. We then generalize the study to multi-hop wireless networks, and discuss further open issues such as the delay performance of distributed scheduling.

Original languageEnglish (US)
Title of host publicationCISS 2008, The 42nd Annual Conference on Information Sciences and Systems
Pages486-491
Number of pages6
DOIs
StatePublished - 2008
EventCISS 2008, 42nd Annual Conference on Information Sciences and Systems - Princeton, NJ, United States
Duration: Mar 19 2008Mar 21 2008

Other

OtherCISS 2008, 42nd Annual Conference on Information Sciences and Systems
CountryUnited States
CityPrinceton, NJ
Period3/19/083/21/08

Fingerprint

Ad hoc networks
Scheduling
Packet loss
Scheduling algorithms
Parallel algorithms
Fading channels
Wireless networks

Keywords

  • Ad-hoc networks
  • Distributed scheduling
  • Optimal stopping
  • Threshold policy

ASJC Scopus subject areas

  • Computer Science Applications
  • Information Systems
  • Control and Systems Engineering

Cite this

Zhang, J. (2008). Threshold structure of channel aware distributed scheduling in ad-hoc networks: An optimal stopping view. In CISS 2008, The 42nd Annual Conference on Information Sciences and Systems (pp. 486-491). [4558575] https://doi.org/10.1109/CISS.2008.4558575

Threshold structure of channel aware distributed scheduling in ad-hoc networks : An optimal stopping view. / Zhang, Junshan.

CISS 2008, The 42nd Annual Conference on Information Sciences and Systems. 2008. p. 486-491 4558575.

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

Zhang, J 2008, Threshold structure of channel aware distributed scheduling in ad-hoc networks: An optimal stopping view. in CISS 2008, The 42nd Annual Conference on Information Sciences and Systems., 4558575, pp. 486-491, CISS 2008, 42nd Annual Conference on Information Sciences and Systems, Princeton, NJ, United States, 3/19/08. https://doi.org/10.1109/CISS.2008.4558575
Zhang J. Threshold structure of channel aware distributed scheduling in ad-hoc networks: An optimal stopping view. In CISS 2008, The 42nd Annual Conference on Information Sciences and Systems. 2008. p. 486-491. 4558575 https://doi.org/10.1109/CISS.2008.4558575
Zhang, Junshan. / Threshold structure of channel aware distributed scheduling in ad-hoc networks : An optimal stopping view. CISS 2008, The 42nd Annual Conference on Information Sciences and Systems. 2008. pp. 486-491
@inproceedings{f741377017ef493a8f67414f12d7cfa4,
title = "Threshold structure of channel aware distributed scheduling in ad-hoc networks: An optimal stopping view",
abstract = "As evidenced by measurement data, channel fading and co-channel interference occur on the same time scales, and it is therefore difficult to determine if packet losses are due to interference change or channel variation. The coupling between the timescales of fading and interference at the MAC layer calls for a unified PHY/MAC design. Using optimal stopping theory, we first devise channel aware distributed scheduling to exploit rich PHY/MAC diversities in single-hop ad-hoc networks, for a variety of PHY-layer models. We show that the optimal channel aware distributed scheduling algorithms have threshold structures, and hence are amenable to easy implementation. We then generalize the study to multi-hop wireless networks, and discuss further open issues such as the delay performance of distributed scheduling.",
keywords = "Ad-hoc networks, Distributed scheduling, Optimal stopping, Threshold policy",
author = "Junshan Zhang",
year = "2008",
doi = "10.1109/CISS.2008.4558575",
language = "English (US)",
isbn = "9781424422470",
pages = "486--491",
booktitle = "CISS 2008, The 42nd Annual Conference on Information Sciences and Systems",

}

TY - GEN

T1 - Threshold structure of channel aware distributed scheduling in ad-hoc networks

T2 - An optimal stopping view

AU - Zhang, Junshan

PY - 2008

Y1 - 2008

N2 - As evidenced by measurement data, channel fading and co-channel interference occur on the same time scales, and it is therefore difficult to determine if packet losses are due to interference change or channel variation. The coupling between the timescales of fading and interference at the MAC layer calls for a unified PHY/MAC design. Using optimal stopping theory, we first devise channel aware distributed scheduling to exploit rich PHY/MAC diversities in single-hop ad-hoc networks, for a variety of PHY-layer models. We show that the optimal channel aware distributed scheduling algorithms have threshold structures, and hence are amenable to easy implementation. We then generalize the study to multi-hop wireless networks, and discuss further open issues such as the delay performance of distributed scheduling.

AB - As evidenced by measurement data, channel fading and co-channel interference occur on the same time scales, and it is therefore difficult to determine if packet losses are due to interference change or channel variation. The coupling between the timescales of fading and interference at the MAC layer calls for a unified PHY/MAC design. Using optimal stopping theory, we first devise channel aware distributed scheduling to exploit rich PHY/MAC diversities in single-hop ad-hoc networks, for a variety of PHY-layer models. We show that the optimal channel aware distributed scheduling algorithms have threshold structures, and hence are amenable to easy implementation. We then generalize the study to multi-hop wireless networks, and discuss further open issues such as the delay performance of distributed scheduling.

KW - Ad-hoc networks

KW - Distributed scheduling

KW - Optimal stopping

KW - Threshold policy

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

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

U2 - 10.1109/CISS.2008.4558575

DO - 10.1109/CISS.2008.4558575

M3 - Conference contribution

AN - SCOPUS:51849083529

SN - 9781424422470

SP - 486

EP - 491

BT - CISS 2008, The 42nd Annual Conference on Information Sciences and Systems

ER -