Distributed Adaptive Algorithms for Optimal Opportunistic Medium Access

Authors:
Yahya Al-Harthi;Sem Borst;Phil Whiting
Affiliations:
Department of Electrical Engineering, King Fahd University of Petroleum & Minerals, Dhahran, Saudi Arabia 31261;Department of Mathematics & Computer Science, Eindhoven University of Technology, Eindhoven, The Netherlands 5600 and Alcatel-Lucent Bell Labs, Murray Hill, USA 07974;Alcatel-Lucent Bell Labs, Murray Hill, USA 07974
Venue:
Mobile Networks and Applications
Year:
2011

Citing 13
Cited 0

A framework for opportunistic scheduling in wireless networks

Computer Networks: The International Journal of Computer and Telecommunications Networking
SCHEDULING IN A QUEUING SYSTEM WITH ASYNCHRONOUSLY VARYING SERVICE RATES

Probability in the Engineering and Informational Sciences
On the Asymptotic Optimality of the Gradient Scheduling Algorithm for Multiuser Throughput Allocation

Operations Research
Cross-layer rate control for end-to-end proportional fairness in wireless networks with random access

Proceedings of the 6th ACM international symposium on Mobile ad hoc networking and computing
Stable scheduling policies for fading wireless channels

IEEE/ACM Transactions on Networking (TON)
Resource allocation and cross-layer control in wireless networks

Foundations and Trends® in Networking
Greedy primal-dual algorithm for dynamic resource allocation in complex networks

Queueing Systems: Theory and Applications
Joint scheduling and resource allocation in CDMA systems

IEEE Transactions on Information Theory
Opportunistic ALOHA and cross layer design for sensor networks

MILCOM'03 Proceedings of the 2003 IEEE conference on Military communications - Volume I
Opportunistic medium access for wireless networking adapted to decentralized CSI

IEEE Transactions on Wireless Communications
Stability of N interacting queues in random-access systems

IEEE Transactions on Information Theory
Exploiting decentralized channel state information for random access

IEEE Transactions on Information Theory
Dynamic power allocation and routing for time-varying wireless networks

IEEE Journal on Selected Areas in Communications

Quantified Score

Hi-index	0.00

Visualization

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.