Optimal RAT selection algorithm through Common Radio Resource Management in heterogeneous wireless networks

H. Elbadawy
{"title":"Optimal RAT selection algorithm through Common Radio Resource Management in heterogeneous wireless networks","authors":"H. Elbadawy","doi":"10.1109/NRSC.2011.5873632","DOIUrl":null,"url":null,"abstract":"Nowadays, mobile communication has become an essential for the human life. On the other hand, there is a booming in the developed technologies. So, the operators are facing a lot of problems for best utilizations of the operation of coexisting radio access technologies (RATs) that they may have. The RAT selection algorithm is one of the key research areas in Common Radio Resource Management (CRRM). CRRM is used to enhance the selection of the suitable RAT in the heterogeneous wireless networks (HWN). Selection of the suitable RAT maximizes the HWN performance and its Quality of Service (QoS) by allocating users to the most suitable RAT in the case of two or more RATs co-located in the same coverage area. This paper evaluates the performance of HWN with three different RATs. Four different CRRM RAT selection algorithms are compared, load balancing (LB), service based (SB), priority based (PB), and random selection (RS). The results of GERAN900, the best utilization of the available Radio Resource Units (RRUs) are occurred with the deployment of SB algorithm. On the other hand, the GERAN1800 is best utilized with the deployment of LB algorithm. Un-served users are minimized by operation with 40∼43dBm transmutation power.","PeriodicalId":438638,"journal":{"name":"2011 28th National Radio Science Conference (NRSC)","volume":"401 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2011-04-26","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"8","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2011 28th National Radio Science Conference (NRSC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/NRSC.2011.5873632","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 8

Abstract

Nowadays, mobile communication has become an essential for the human life. On the other hand, there is a booming in the developed technologies. So, the operators are facing a lot of problems for best utilizations of the operation of coexisting radio access technologies (RATs) that they may have. The RAT selection algorithm is one of the key research areas in Common Radio Resource Management (CRRM). CRRM is used to enhance the selection of the suitable RAT in the heterogeneous wireless networks (HWN). Selection of the suitable RAT maximizes the HWN performance and its Quality of Service (QoS) by allocating users to the most suitable RAT in the case of two or more RATs co-located in the same coverage area. This paper evaluates the performance of HWN with three different RATs. Four different CRRM RAT selection algorithms are compared, load balancing (LB), service based (SB), priority based (PB), and random selection (RS). The results of GERAN900, the best utilization of the available Radio Resource Units (RRUs) are occurred with the deployment of SB algorithm. On the other hand, the GERAN1800 is best utilized with the deployment of LB algorithm. Un-served users are minimized by operation with 40∼43dBm transmutation power.
异构无线网络中基于公共无线资源管理的最佳RAT选择算法
如今,移动通信已经成为人类生活中必不可少的一部分。另一方面,发达技术正在蓬勃发展。因此,运营商面临着如何最大限度地利用现有无线接入技术的诸多问题。RAT选择算法是公共无线电资源管理(CRRM)中的关键研究领域之一。在异构无线网络(HWN)中,CRRM用于增强合适RAT的选择。在同一覆盖区域内存在两个或多个RAT的情况下,通过选择合适的RAT,将用户分配到最合适的RAT,可以最大限度地提高HWN的性能和服务质量(QoS)。本文用三种不同的rat对HWN的性能进行了评价。比较了四种不同的CRRM RAT选择算法:负载均衡(load balancing)、基于服务(service based)、基于优先级(priority based)和随机选择(random selection)。GERAN900的结果表明,采用SB算法可以最大限度地利用可用的无线电资源单元(rru)。另一方面,在部署LB算法的情况下,GERAN1800得到了最好的利用。通过40 ~ 43dBm嬗变功率的操作,将未服务用户最小化。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信