{"title":"QoS感知中继辅助OFDMA蜂窝网络的资源分配","authors":"Mohamad Maaz, P. Mary, M. Hélard","doi":"10.1109/IWCLD.2011.6123076","DOIUrl":null,"url":null,"abstract":"Relay-assisted communication is a promising technique to increase the efficiency of future cellular systems. In this paper, we deal with resource allocations in relay-assisted OFDMA downlink communications. Our purpose is to find the optimal power, subcarrier and relay allocation maximizing the global data rate while keeping a low starvation rate, under heterogeneous data rate constraints among the users. A global algorithm jointly allocating the power, subcarriers and relays is first proposed. The achievable data rate is investigated as well as the average starvation rate in the network when the load, i.e. the number of active users in the network, is increasing. Our algorithm is compared to the existing literature by means of extensive simulation settings.","PeriodicalId":149596,"journal":{"name":"2011 Third International Workshop on Cross Layer Design","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2011-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Resource allocation for QoS aware relay-assisted OFDMA cellular networks\",\"authors\":\"Mohamad Maaz, P. Mary, M. Hélard\",\"doi\":\"10.1109/IWCLD.2011.6123076\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Relay-assisted communication is a promising technique to increase the efficiency of future cellular systems. In this paper, we deal with resource allocations in relay-assisted OFDMA downlink communications. Our purpose is to find the optimal power, subcarrier and relay allocation maximizing the global data rate while keeping a low starvation rate, under heterogeneous data rate constraints among the users. A global algorithm jointly allocating the power, subcarriers and relays is first proposed. The achievable data rate is investigated as well as the average starvation rate in the network when the load, i.e. the number of active users in the network, is increasing. Our algorithm is compared to the existing literature by means of extensive simulation settings.\",\"PeriodicalId\":149596,\"journal\":{\"name\":\"2011 Third International Workshop on Cross Layer Design\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2011-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2011 Third International Workshop on Cross Layer Design\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IWCLD.2011.6123076\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 Third International Workshop on Cross Layer Design","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IWCLD.2011.6123076","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Resource allocation for QoS aware relay-assisted OFDMA cellular networks
Relay-assisted communication is a promising technique to increase the efficiency of future cellular systems. In this paper, we deal with resource allocations in relay-assisted OFDMA downlink communications. Our purpose is to find the optimal power, subcarrier and relay allocation maximizing the global data rate while keeping a low starvation rate, under heterogeneous data rate constraints among the users. A global algorithm jointly allocating the power, subcarriers and relays is first proposed. The achievable data rate is investigated as well as the average starvation rate in the network when the load, i.e. the number of active users in the network, is increasing. Our algorithm is compared to the existing literature by means of extensive simulation settings.