Channel aware distributed scheduling for exploiting multi-receiver diversity and multiuser diversity in ad-hoc networks: A unified PHY/MAC approach

Dong Zheng, Min Cao, Junshan Zhang, P. R. Kumar

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

12 Citations (Scopus)

Abstract

We study channel aware distributed scheduling in ad hoc networks where many links contend for the common channel using random access, and the focus here is on the model where each transmitter node has multiple intended receivers. In such a network, channel probing takes place in two phases: 1) in phase I, all transmitters contend for the channel using random access to reserve the channel, and the probing to accomplish a successful channel contention takes a random duration; and 2) in phase II, subsequent probings are carried out to estimate the link conditions from the successful transmitter in phase I to its intended receivers, according to specific probing mechanisms, and the probing for each receiver takes a constant duration. In this paper, we shall study various probing mechanisms for utilizing multi-receiver diversity in phase II and multiuser diversity in phase I for ad hoc (peer-to-peer) communications. Clearly, further probing increases the likelihood of seeing better channel conditions for exploiting diversities, but at the cost of additional time. Therefore, channel probing must be done efficiently to balance the tradeoff between the throughput gain from better channel conditions and the probing cost. One main objective of this study is to characterize this tradeoff in a stochastic decision making framework. Specifically, we cast network throughput optimization as an optimal stopping problem, and then explore channel aware distributed scheduling to leverage multi-receiver diversity and multiuser diversity in a joint manner. We show that the optimal scheduling policies for all proposed probing mechanisms exhibit threshold structures, indicating that they are amenable to easy distributed implementation. We show that the optimal thresholds and the maximum network throughput can be obtained off-line by solving fixed point equations. We further develop iterative algorithms to compute the optimal thresholds and the throughput.

Original languageEnglish (US)
Title of host publicationProceedings - IEEE INFOCOM
Pages2128-2136
Number of pages9
DOIs
StatePublished - 2008
EventINFOCOM 2008: 27th IEEE Communications Society Conference on Computer Communications - Phoenix, AZ, United States
Duration: Apr 13 2008Apr 18 2008

Other

OtherINFOCOM 2008: 27th IEEE Communications Society Conference on Computer Communications
CountryUnited States
CityPhoenix, AZ
Period4/13/084/18/08

Fingerprint

Ad hoc networks
Scheduling
Throughput
Transmitters
Telecommunication links
Decision making
Communication
Costs

ASJC Scopus subject areas

  • Electrical and Electronic Engineering
  • Hardware and Architecture

Cite this

Channel aware distributed scheduling for exploiting multi-receiver diversity and multiuser diversity in ad-hoc networks : A unified PHY/MAC approach. / Zheng, Dong; Cao, Min; Zhang, Junshan; Kumar, P. R.

Proceedings - IEEE INFOCOM. 2008. p. 2128-2136 4509799.

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

Zheng, D, Cao, M, Zhang, J & Kumar, PR 2008, Channel aware distributed scheduling for exploiting multi-receiver diversity and multiuser diversity in ad-hoc networks: A unified PHY/MAC approach. in Proceedings - IEEE INFOCOM., 4509799, pp. 2128-2136, INFOCOM 2008: 27th IEEE Communications Society Conference on Computer Communications, Phoenix, AZ, United States, 4/13/08. https://doi.org/10.1109/INFOCOM.2007.204
@inproceedings{51391548d2114ba1a7a9a8a5dfe89a73,
title = "Channel aware distributed scheduling for exploiting multi-receiver diversity and multiuser diversity in ad-hoc networks: A unified PHY/MAC approach",
abstract = "We study channel aware distributed scheduling in ad hoc networks where many links contend for the common channel using random access, and the focus here is on the model where each transmitter node has multiple intended receivers. In such a network, channel probing takes place in two phases: 1) in phase I, all transmitters contend for the channel using random access to reserve the channel, and the probing to accomplish a successful channel contention takes a random duration; and 2) in phase II, subsequent probings are carried out to estimate the link conditions from the successful transmitter in phase I to its intended receivers, according to specific probing mechanisms, and the probing for each receiver takes a constant duration. In this paper, we shall study various probing mechanisms for utilizing multi-receiver diversity in phase II and multiuser diversity in phase I for ad hoc (peer-to-peer) communications. Clearly, further probing increases the likelihood of seeing better channel conditions for exploiting diversities, but at the cost of additional time. Therefore, channel probing must be done efficiently to balance the tradeoff between the throughput gain from better channel conditions and the probing cost. One main objective of this study is to characterize this tradeoff in a stochastic decision making framework. Specifically, we cast network throughput optimization as an optimal stopping problem, and then explore channel aware distributed scheduling to leverage multi-receiver diversity and multiuser diversity in a joint manner. We show that the optimal scheduling policies for all proposed probing mechanisms exhibit threshold structures, indicating that they are amenable to easy distributed implementation. We show that the optimal thresholds and the maximum network throughput can be obtained off-line by solving fixed point equations. We further develop iterative algorithms to compute the optimal thresholds and the throughput.",
author = "Dong Zheng and Min Cao and Junshan Zhang and Kumar, {P. R.}",
year = "2008",
doi = "10.1109/INFOCOM.2007.204",
language = "English (US)",
isbn = "9781424420261",
pages = "2128--2136",
booktitle = "Proceedings - IEEE INFOCOM",

}

TY - GEN

T1 - Channel aware distributed scheduling for exploiting multi-receiver diversity and multiuser diversity in ad-hoc networks

T2 - A unified PHY/MAC approach

AU - Zheng, Dong

AU - Cao, Min

AU - Zhang, Junshan

AU - Kumar, P. R.

PY - 2008

Y1 - 2008

N2 - We study channel aware distributed scheduling in ad hoc networks where many links contend for the common channel using random access, and the focus here is on the model where each transmitter node has multiple intended receivers. In such a network, channel probing takes place in two phases: 1) in phase I, all transmitters contend for the channel using random access to reserve the channel, and the probing to accomplish a successful channel contention takes a random duration; and 2) in phase II, subsequent probings are carried out to estimate the link conditions from the successful transmitter in phase I to its intended receivers, according to specific probing mechanisms, and the probing for each receiver takes a constant duration. In this paper, we shall study various probing mechanisms for utilizing multi-receiver diversity in phase II and multiuser diversity in phase I for ad hoc (peer-to-peer) communications. Clearly, further probing increases the likelihood of seeing better channel conditions for exploiting diversities, but at the cost of additional time. Therefore, channel probing must be done efficiently to balance the tradeoff between the throughput gain from better channel conditions and the probing cost. One main objective of this study is to characterize this tradeoff in a stochastic decision making framework. Specifically, we cast network throughput optimization as an optimal stopping problem, and then explore channel aware distributed scheduling to leverage multi-receiver diversity and multiuser diversity in a joint manner. We show that the optimal scheduling policies for all proposed probing mechanisms exhibit threshold structures, indicating that they are amenable to easy distributed implementation. We show that the optimal thresholds and the maximum network throughput can be obtained off-line by solving fixed point equations. We further develop iterative algorithms to compute the optimal thresholds and the throughput.

AB - We study channel aware distributed scheduling in ad hoc networks where many links contend for the common channel using random access, and the focus here is on the model where each transmitter node has multiple intended receivers. In such a network, channel probing takes place in two phases: 1) in phase I, all transmitters contend for the channel using random access to reserve the channel, and the probing to accomplish a successful channel contention takes a random duration; and 2) in phase II, subsequent probings are carried out to estimate the link conditions from the successful transmitter in phase I to its intended receivers, according to specific probing mechanisms, and the probing for each receiver takes a constant duration. In this paper, we shall study various probing mechanisms for utilizing multi-receiver diversity in phase II and multiuser diversity in phase I for ad hoc (peer-to-peer) communications. Clearly, further probing increases the likelihood of seeing better channel conditions for exploiting diversities, but at the cost of additional time. Therefore, channel probing must be done efficiently to balance the tradeoff between the throughput gain from better channel conditions and the probing cost. One main objective of this study is to characterize this tradeoff in a stochastic decision making framework. Specifically, we cast network throughput optimization as an optimal stopping problem, and then explore channel aware distributed scheduling to leverage multi-receiver diversity and multiuser diversity in a joint manner. We show that the optimal scheduling policies for all proposed probing mechanisms exhibit threshold structures, indicating that they are amenable to easy distributed implementation. We show that the optimal thresholds and the maximum network throughput can be obtained off-line by solving fixed point equations. We further develop iterative algorithms to compute the optimal thresholds and the throughput.

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

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

U2 - 10.1109/INFOCOM.2007.204

DO - 10.1109/INFOCOM.2007.204

M3 - Conference contribution

AN - SCOPUS:51349117064

SN - 9781424420261

SP - 2128

EP - 2136

BT - Proceedings - IEEE INFOCOM

ER -