Utility-based joint routing and scheduling in OFDMA cellular relay networks with traffic prioritization

Jian Liang, Hui Yin, Haokai Chen, Zhongnian Li, Shouyin Liu
{"title":"Utility-based joint routing and scheduling in OFDMA cellular relay networks with traffic prioritization","authors":"Jian Liang, Hui Yin, Haokai Chen, Zhongnian Li, Shouyin Liu","doi":"10.1109/ChinaCom.2011.6158134","DOIUrl":null,"url":null,"abstract":"This paper researches the utility-based resource allocation problem in a real-time and non-real-time traffics mixed OFDMA cellular relay network to exploit the potentiality of relay. In order to apply utility theory to obtain an efficient tradeoff between throughput and fairness as well as satisfy the delay requirements of real-time traffic, a joint routing and scheduling scheme is proposed to resolve the resource allocation problem. Additionally, a low-complexity iterative algorithm is introduced to realize the scheme. Numerical results indicate that besides meet the delay requirements of real-time traffic, the scheme can effectively achieve the tradeoff between throughput and fairness.","PeriodicalId":339961,"journal":{"name":"2011 6th International ICST Conference on Communications and Networking in China (CHINACOM)","volume":"6 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-08-17","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 6th International ICST Conference on Communications and Networking in China (CHINACOM)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ChinaCom.2011.6158134","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

This paper researches the utility-based resource allocation problem in a real-time and non-real-time traffics mixed OFDMA cellular relay network to exploit the potentiality of relay. In order to apply utility theory to obtain an efficient tradeoff between throughput and fairness as well as satisfy the delay requirements of real-time traffic, a joint routing and scheduling scheme is proposed to resolve the resource allocation problem. Additionally, a low-complexity iterative algorithm is introduced to realize the scheme. Numerical results indicate that besides meet the delay requirements of real-time traffic, the scheme can effectively achieve the tradeoff between throughput and fairness.
具有流量优先级的OFDMA蜂窝中继网络中基于效用的联合路由与调度
本文研究了实时与非实时混合OFDMA蜂窝中继网络中基于效用的资源分配问题,以充分发挥中继的潜力。为了应用效用理论在吞吐量和公平性之间进行有效权衡,同时满足实时流量的延迟要求,提出了一种联合路由和调度方案来解决资源分配问题。此外,还引入了一种低复杂度的迭代算法来实现该方案。数值结果表明,该方案在满足实时流量的时延要求的同时,能够有效地实现吞吐量与公平性的平衡。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术文献互助群
群 号:481959085
Book学术官方微信