MIT Libraries homeMIT Libraries logoDSpace@MIT

MIT
View Item 
  • DSpace@MIT Home
  • MIT Open Access Articles
  • MIT Open Access Articles
  • View Item
  • DSpace@MIT Home
  • MIT Open Access Articles
  • MIT Open Access Articles
  • View Item
JavaScript is disabled for your browser. Some features of this site may not work without it.

On Resource Allocation in Fading Multiple Access Channels -- An Efficient Approximate Projection Approach

Author(s)
Parandehgheibi, Ali; Ozdaglar, Asuman E.; Medard, Muriel; Eryilmaz, Atilla
Thumbnail
DownloadOzdaglar_On resource allocation.pdf (717.7Kb)
PUBLISHER_POLICY

Publisher Policy

Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use.

Terms of use
Article is made available in accordance with the publisher's policy and may be subject to US copyright law. Please refer to the publisher's site for terms of use.
Metadata
Show full item record
Abstract
In this paper, we consider the problem of rate and power allocation in a multiple-access channel (MAC). Our objective is to obtain rate and power allocation policies that maximize a general concave utility function of average transmission rates on the information-theoretic capacity region of the MAC without using queue-length information. First, we address the utility maximization problem in a nonfading channel and present a gradient projection algorithm with approximate projections. By exploiting the polymatroid structure of the capacity region, we show that the approximate projection can be implemented in time polynomial in the number of users. Second, we present optimal rate and power allocation policies in a fading channel where channel statistics are known. For the case that channel statistics are unknown and the transmission power is fixed, we propose a greedy rate allocation policy and characterize the performance difference of this policy and the optimal policy in terms of channel variations and structure of the utility function. The numerical results demonstrate superior convergence rate performance for the greedy policy compared to queue-length-based policies. In order to reduce the computational complexity of the greedy policy, we present approximate rate allocation policies which track the greedy policy within a certain neighborhood.
Date issued
2010-09
URI
http://hdl.handle.net/1721.1/73045
Department
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science; Massachusetts Institute of Technology. Laboratory for Information and Decision Systems; Massachusetts Institute of Technology. Research Laboratory of Electronics
Journal
IEEE Transactions on Information Theory
Publisher
Institute of Electrical and Electronics Engineers (IEEE)
Citation
ParandehGheibi, Ali et al. “On Resource Allocation in Fading Multiple-Access Channels–An Efficient Approximate Projection Approach.” IEEE Transactions on Information Theory 56.9 (2010): 4417–4437. © Copyright 2010 IEEE
Version: Final published version
ISSN
0018-9448

Collections
  • MIT Open Access Articles

Browse

All of DSpaceCommunities & CollectionsBy Issue DateAuthorsTitlesSubjectsThis CollectionBy Issue DateAuthorsTitlesSubjects

My Account

Login

Statistics

OA StatisticsStatistics by CountryStatistics by Department
MIT Libraries homeMIT Libraries logo

Find us on

Twitter Facebook Instagram YouTube RSS

MIT Libraries navigation

SearchHours & locationsBorrow & requestResearch supportAbout us
PrivacyPermissionsAccessibility
MIT
Massachusetts Institute of Technology
Content created by the MIT Libraries, CC BY-NC unless otherwise noted. Notify us about copyright concerns.