A Load Adaptive subcarrier and bit allocation algorithm for non-real time services in an OFDMA system

H. Fattah, H. Alnuweiri
{"title":"A Load Adaptive subcarrier and bit allocation algorithm for non-real time services in an OFDMA system","authors":"H. Fattah, H. Alnuweiri","doi":"10.1109/ISWCS.2009.5285312","DOIUrl":null,"url":null,"abstract":"Orthogonal Frequency Division Multiple Access (OFDMA) is an efficient access technique that allocates different subcarriers to multiple users where each subcarrier is loaded with a number of bits belonging to that user. Allocating subcarriers and bits to multiple users has been the focus of many algorithms that attempt to maximize the throughput or minimize the total transmit power used. Non-real time applications such as web browsing are dominant applications in most of the emerging wireless networks. A key performance measure of such applications is the average packet delay provided by the network. In this paper, we propose a novel Load Adaptive (LA) algorithm for non-real time services that allocates the subcarriers and bits to each user according to its individual load and the available transmit power so as to minimize the overall average packet delay for all users. The algorithm takes into account queueing theory and the quality of service requirement of each user. Numerical results show that the overall average packet delay of the proposed algorithm is significantly reduced compared to other algorithms.","PeriodicalId":344018,"journal":{"name":"2009 6th International Symposium on Wireless Communication Systems","volume":"27 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2009-09-07","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"2","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2009 6th International Symposium on Wireless Communication Systems","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISWCS.2009.5285312","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 2

Abstract

Orthogonal Frequency Division Multiple Access (OFDMA) is an efficient access technique that allocates different subcarriers to multiple users where each subcarrier is loaded with a number of bits belonging to that user. Allocating subcarriers and bits to multiple users has been the focus of many algorithms that attempt to maximize the throughput or minimize the total transmit power used. Non-real time applications such as web browsing are dominant applications in most of the emerging wireless networks. A key performance measure of such applications is the average packet delay provided by the network. In this paper, we propose a novel Load Adaptive (LA) algorithm for non-real time services that allocates the subcarriers and bits to each user according to its individual load and the available transmit power so as to minimize the overall average packet delay for all users. The algorithm takes into account queueing theory and the quality of service requirement of each user. Numerical results show that the overall average packet delay of the proposed algorithm is significantly reduced compared to other algorithms.
OFDMA系统中非实时业务的负载自适应子载波和位分配算法
正交频分多址(OFDMA)是一种高效的接入技术,它为多个用户分配不同的子载波,其中每个子载波都加载了属于该用户的若干位。将子载波和位分配给多个用户一直是许多算法的重点,这些算法试图最大化吞吐量或最小化所使用的总发射功率。在大多数新兴的无线网络中,网页浏览等非实时应用是主要的应用。这类应用程序的一个关键性能度量是网络提供的平均数据包延迟。在本文中,我们提出了一种新的负载自适应(LA)算法,该算法根据每个用户的负载和可用发射功率为每个用户分配子载波和比特,以最小化所有用户的总体平均数据包延迟。该算法考虑了排队理论和每个用户对服务质量的要求。数值结果表明,与其他算法相比,该算法的总体平均数据包延迟显著降低。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信