2026-09-19T05:19:46Zhttps://dspace.mit.edu/server/oai/request

oai:dspace.mit.edu:1721.1/447302022-01-13T07:54:29Zcom_1721.1_7582com_1721.1_7581col_1721.1_131023

Murial Médard and Asuman Ozdaglar. ParandehGheibi, Ali Massachusetts Institute of Technology. Dept. of Electrical Engineering and Computer Science. Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science 2009-03-16T19:35:30Z 2009-03-16T19:35:30Z 2008 2008 http://hdl.handle.net/1721.1/44730 298243877 Thesis (S.M.)--Massachusetts Institute of Technology, Dept. of Electrical Engineering and Computer Science, 2008. Includes bibliographical references (p. 99-102). We consider the problem of resource allocation in a multiple access channel. Our objective is to obtain rate and power allocation policies that maximize a general concave utility function of average transmission rates over the information theoretic capacity region of the multiple-access channel. We consider several different scenarios. First, we address the utility maximization problem in a non-fading channel and present an iterative gradient projection algorithm that uses approximate projection. 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 consider resource allocation in a fading channel. Optimal rate and power allocation policies are presented for the case that power control is possible and channel statistics are available. For the case where transmission power is fixed and channel statistics are unknown, we propose a greedy rate allocation policy and provide bounds on the performance difference of this policy and the optimal policy in terms of channel variations and structure of the utility function. This policy does not require queue-length information. Moreover, we present numerical results that 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 that is characterized in terms of the speed of fading. by Ali ParandehGheibi. S.M. 102 p. eng Massachusetts Institute of Technology M.I.T. theses are protected by copyright. They may be viewed from this source for any purpose, but reproduction or distribution in any format is prohibited without written permission. See provided URL for inquiries about permission. http://dspace.mit.edu/handle/1721.1/7582 Electrical Engineering and Computer Science. Fair resource allocation in multiple access channels Resource allocation in fading multiple access channels Thesis application/pdf Publication unknown unknown <Publication xmlns="https://www.openaire.eu/cerif-profile/1.1/" id="927b7d6b-fb31-4127-ad1d-db8bc7c344e3"> <Type xmlns="https://www.openaire.eu/cerif-profile/vocab/COAR_Publication_Types">http://purl.org/coar/resource_type/c_1843</Type> <Language>eng</Language> <Title>Fair resource allocation in multiple access channels</Title> <Subtitle>Resource allocation in fading multiple access channels</Subtitle> <PublishedIn> <Publication> </Publication> </PublishedIn> <PublicationDate>2008</PublicationDate> <Authors> <Author> <DisplayName>ParandehGheibi, Ali</DisplayName> <Affiliation> <OrgUnit> </OrgUnit> </Affiliation> </Author> </Authors> <Editors> </Editors> <Publishers> <Publisher> <DisplayName>Massachusetts Institute of Technology</DisplayName> <OrgUnit /> </Publisher> </Publishers> <License>http://dspace.mit.edu/handle/1721.1/7582</License> <Keyword>Electrical Engineering and Computer Science.</Keyword> <Abstract>We consider the problem of resource allocation in a multiple access channel. Our objective is to obtain rate and power allocation policies that maximize a general concave utility function of average transmission rates over the information theoretic capacity region of the multiple-access channel. We consider several different scenarios. First, we address the utility maximization problem in a non-fading channel and present an iterative gradient projection algorithm that uses approximate projection. 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 consider resource allocation in a fading channel. Optimal rate and power allocation policies are presented for the case that power control is possible and channel statistics are available. For the case where transmission power is fixed and channel statistics are unknown, we propose a greedy rate allocation policy and provide bounds on the performance difference of this policy and the optimal policy in terms of channel variations and structure of the utility function. This policy does not require queue-length information. Moreover, we present numerical results that 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 that is characterized in terms of the speed of fading.</Abstract> <Access xmlns="http://purl.org/coar/access_right" > </Access> </Publication>