Distributed adaptive algorithms for optimal opportunistic medium access

Yahya Al-Harthi, Sem Borst*, Phil Whiting

*Corresponding author for this work

Research output: Contribution to journalArticlepeer-review

3 Citations (Scopus)

Abstract

We examine threshold-based transmission strategies for distributed opportunistic medium access in a scenario with fairly general probabilistic interference conditions. Specifically, collisions between concurrent transmissions are governed by arbitrary probabilities, allowing for a form of channel capture and covering binary interference constraints as an important special case. We address the problem of setting the threshold values so as to optimize the aggregate throughput utility of the various users, and particularly focus on a weighted logarithmic throughput utility function (Proportional Fairness). We provide an adaptive algorithm for finding the optimal threshold values in a distributed fashion, and rigorously establish the convergence of the proposed algorithm under mild statistical assumptions. Moreover, we discuss how the algorithm may be adapted to achieve packet-level stability with only limited exchange of queue length information among the various users. We also conduct extensive numerical experiments to corroborate the theoretical convergence results.

Original languageEnglish
Pages (from-to)217-230
Number of pages14
JournalMobile Networks and Applications
Volume16
Issue number2
DOIs
Publication statusPublished - Apr 2011
Externally publishedYes
Event7th International Symposium on Modeling and Optimization in Mobile, Ad Hoc, and Wireless Networks - Seoul, South Korea, Seoul
Duration: 23 Jun 200927 Jun 2009

Fingerprint Dive into the research topics of 'Distributed adaptive algorithms for optimal opportunistic medium access'. Together they form a unique fingerprint.

Cite this