On Resource Allocation in Fading Multiple Access Channels -- An Efficient Approximate Projection Approach
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...
| Main Authors: | , , , |
|---|---|
| Other Authors: | |
| Format: | Article |
| Language: | en_US |
| Published: |
Institute of Electrical and Electronics Engineers (IEEE)
2012
|
| Online Access: | http://hdl.handle.net/1721.1/73045 https://orcid.org/0000-0002-1827-1285 https://orcid.org/0000-0003-4059-407X |
| _version_ | 1826190211137142784 |
|---|---|
| author | Parandehgheibi, Ali Ozdaglar, Asuman E. Medard, Muriel Eryilmaz, Atilla |
| author2 | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science |
| author_facet | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science Parandehgheibi, Ali Ozdaglar, Asuman E. Medard, Muriel Eryilmaz, Atilla |
| author_sort | Parandehgheibi, Ali |
| collection | MIT |
| description | 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. |
| first_indexed | 2024-09-23T08:36:45Z |
| format | Article |
| id | mit-1721.1/73045 |
| institution | Massachusetts Institute of Technology |
| language | en_US |
| last_indexed | 2024-09-23T08:36:45Z |
| publishDate | 2012 |
| publisher | Institute of Electrical and Electronics Engineers (IEEE) |
| record_format | dspace |
| spelling | mit-1721.1/730452022-09-30T09:57:35Z On Resource Allocation in Fading Multiple Access Channels -- An Efficient Approximate Projection Approach Parandehgheibi, Ali Ozdaglar, Asuman E. Medard, Muriel Eryilmaz, Atilla 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 Parandehgheibi, Ali Ozdaglar, Asuman E. Medard, Muriel 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. Stanford University (Contract 18870740-37362-C) 2012-09-19T15:59:36Z 2012-09-19T15:59:36Z 2010-09 2010-07 Article http://purl.org/eprint/type/JournalArticle 0018-9448 http://hdl.handle.net/1721.1/73045 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 https://orcid.org/0000-0002-1827-1285 https://orcid.org/0000-0003-4059-407X en_US http://dx.doi.org/10.1109/TIT.2010.2053902 IEEE Transactions on Information Theory 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. application/pdf Institute of Electrical and Electronics Engineers (IEEE) IEEE |
| spellingShingle | Parandehgheibi, Ali Ozdaglar, Asuman E. Medard, Muriel Eryilmaz, Atilla On Resource Allocation in Fading Multiple Access Channels -- An Efficient Approximate Projection Approach |
| title | On Resource Allocation in Fading Multiple Access Channels -- An Efficient Approximate Projection Approach |
| title_full | On Resource Allocation in Fading Multiple Access Channels -- An Efficient Approximate Projection Approach |
| title_fullStr | On Resource Allocation in Fading Multiple Access Channels -- An Efficient Approximate Projection Approach |
| title_full_unstemmed | On Resource Allocation in Fading Multiple Access Channels -- An Efficient Approximate Projection Approach |
| title_short | On Resource Allocation in Fading Multiple Access Channels -- An Efficient Approximate Projection Approach |
| title_sort | on resource allocation in fading multiple access channels an efficient approximate projection approach |
| url | http://hdl.handle.net/1721.1/73045 https://orcid.org/0000-0002-1827-1285 https://orcid.org/0000-0003-4059-407X |
| work_keys_str_mv | AT parandehgheibiali onresourceallocationinfadingmultipleaccesschannelsanefficientapproximateprojectionapproach AT ozdaglarasumane onresourceallocationinfadingmultipleaccesschannelsanefficientapproximateprojectionapproach AT medardmuriel onresourceallocationinfadingmultipleaccesschannelsanefficientapproximateprojectionapproach AT eryilmazatilla onresourceallocationinfadingmultipleaccesschannelsanefficientapproximateprojectionapproach |