Distributed opportunistic scheduling for ad-hoc communications: An optimal stopping approach

Dong Zheng, Weiyan Ge, Junshan Zhang

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

39 Scopus citations

Abstract

We consider distributed opportunistic scheduling (DOS) in wireless ad-hoc networks, where many links contend for the same channel using random access. In such networks, distributed opportunistic scheduling involves a process of joint channel probing and distributed scheduling. Due to channel fading, the link condition corresponding to a successful channel probing could be either good or poor. In the latter case, further channel probing, although at the cost of additional delay, may lead to better channel conditions and hence higher transmission rates. The desired tradeoff boils down to judiciously choosing the optimal stopping strategy for channel probing and the rate threshold. In this paper, we pursue a rigorous characterization of the optimal strategies from two perspectives, namely, a network-centric perspective and a user-centric perspective. We first consider DOS from a network-centric point of view, where links cooperate to maximize the overall network throughput. Using optimal stopping theory, we show that the optimal strategy turns out to be a pure threshold policy, where the rate threshold can be obtained by solving a fixed point equation. We further devise an iterative algorithm for computing the threshold. Next, we explore DOS from a user-centric perspective, where each links seeks to maximize its own throughput. We treat the problem of rate threshold selections for different links as a non-cooperative game. We explore the existence and uniqueness of the Nash equilibrium, and show that the Nash equilibrium can be approached by the best response strategy. We then develop an online stochastic iterative algorithm using local observations only, and establish its convergence. Finally, we observe that there is an efficiency loss in terms of the throughput at the Nash equilibrium, and introduce apricing-based mechanism to mitigate the loss.

Original languageEnglish (US)
Title of host publicationMobiHoc'07
Subtitle of host publicationProceedings of the Eighth ACM International Symposium on Mobile Ad Hoc Networking and Computing
Pages1-10
Number of pages10
DOIs
StatePublished - Dec 1 2007
EventMobiHoc'07: 8th ACM International Symposium on Mobile Ad Hoc Networking and Computing - Montreal, QC, Canada
Duration: Sep 9 2007Sep 14 2007

Publication series

NameProceedings of the International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc)

Other

OtherMobiHoc'07: 8th ACM International Symposium on Mobile Ad Hoc Networking and Computing
CountryCanada
CityMontreal, QC
Period9/9/079/14/07

    Fingerprint

Keywords

  • Ad-hoc networks
  • Distributed opportunistic scheduling
  • Game theory
  • Optimal stopping

ASJC Scopus subject areas

  • Software
  • Hardware and Architecture
  • Computer Networks and Communications

Cite this

Zheng, D., Ge, W., & Zhang, J. (2007). Distributed opportunistic scheduling for ad-hoc communications: An optimal stopping approach. In MobiHoc'07: Proceedings of the Eighth ACM International Symposium on Mobile Ad Hoc Networking and Computing (pp. 1-10). (Proceedings of the International Symposium on Mobile Ad Hoc Networking and Computing (MobiHoc)). https://doi.org/10.1145/1288107.1288109