By Topic

Adaptive distributed algorithms for optimal random access channels

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

2 Author(s)
Yichuan Hu ; Dept. of Electr. & Syst. Eng., Univ. of Pennsylvania, Philadelphia, PA, USA ; Ribeiro, A.

We develop adaptive scheduling and power control algorithms for random access in a multiple access channel where terminals acquire instantaneous channel state information but do not know the probability distribution of the channel. In each time slot, terminals measure the channel to the common access point. Based on the observed channel value, they determine whether to transmit or not and, if they decide to do so, adjust their transmitted power. We remark that there is no coordination between terminals and that adaptation is to the local channel value only. It is shown that the proposed algorithm almost surely maximizes a proportional fair utility while adhering to instantaneous and average power constraints. Important properties of the algorithm are adaptivity, low computational complexity and the ability to handle non-convex rate functions. Numerical results on a randomly generated network with heterogeneous users corroborate theoretical results.

Published in:

Communication, Control, and Computing (Allerton), 2010 48th Annual Allerton Conference on

Date of Conference:

Sept. 29 2010-Oct. 1 2010