An improved algorithm for transmission in heterogeneous cellular networks

Yao-Liang Chung
{"title":"An improved algorithm for transmission in heterogeneous cellular networks","authors":"Yao-Liang Chung","doi":"10.1109/ICDIM.2017.8244692","DOIUrl":null,"url":null,"abstract":"This paper presents improvements to a coverage algorithm that we previously proposed for use in heterogeneous cellular networks, with the improved algorithm being referred to as the modified coverage algorithm. The modified coverage algorithm maintains the coverage advantages provided by the previous coverage algorithm; that is, users can be covered by the network in any scenario and unnecessary power consumption can be avoided through the use of the algorithm. The modified coverage algorithm also mitigates the sole disadvantage of the previous coverage algorithm, that is, its inability to meet users' transmission rate requirements, instead ensuring that the respective transmission rate requirements of all users can be typically met. According to the simulation results, compared with the previous coverage algorithm, the modified coverage algorithm improves the average transmission rate significantly (especially when the traffic volume is low) at the small expense of a slightly increased outage ratio under high traffic volumes; however, based on our design, the users who face an increase in the outage ratio are of lower priority. As a result, the system's overall performance is at an acceptable level.","PeriodicalId":144953,"journal":{"name":"2017 Twelfth International Conference on Digital Information Management (ICDIM)","volume":"40 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2017-09-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 Twelfth International Conference on Digital Information Management (ICDIM)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICDIM.2017.8244692","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

Abstract

This paper presents improvements to a coverage algorithm that we previously proposed for use in heterogeneous cellular networks, with the improved algorithm being referred to as the modified coverage algorithm. The modified coverage algorithm maintains the coverage advantages provided by the previous coverage algorithm; that is, users can be covered by the network in any scenario and unnecessary power consumption can be avoided through the use of the algorithm. The modified coverage algorithm also mitigates the sole disadvantage of the previous coverage algorithm, that is, its inability to meet users' transmission rate requirements, instead ensuring that the respective transmission rate requirements of all users can be typically met. According to the simulation results, compared with the previous coverage algorithm, the modified coverage algorithm improves the average transmission rate significantly (especially when the traffic volume is low) at the small expense of a slightly increased outage ratio under high traffic volumes; however, based on our design, the users who face an increase in the outage ratio are of lower priority. As a result, the system's overall performance is at an acceptable level.
异构蜂窝网络中一种改进的传输算法
本文提出了我们之前提出的用于异构蜂窝网络的覆盖算法的改进,改进的算法被称为改进的覆盖算法。改进的覆盖算法保持了前一种覆盖算法提供的覆盖优势;即在任何场景下,用户都可以被网络覆盖,通过使用该算法可以避免不必要的功耗。改进后的覆盖算法也缓解了原有覆盖算法无法满足用户传输速率要求的唯一缺点,保证了所有用户各自的传输速率要求都能得到典型满足。仿真结果表明,与之前的覆盖算法相比,改进后的覆盖算法在高流量情况下,以小幅增加中断率为代价,显著提高了平均传输速率(特别是在流量较低时);但是,根据我们的设计,面临停机率增加的用户的优先级较低。因此,系统的整体性能处于可接受的水平。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约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学术官方微信