移动网络中干扰感知下行链路调度算法

K. Ramkumar, P. Newton
{"title":"移动网络中干扰感知下行链路调度算法","authors":"K. Ramkumar, P. Newton","doi":"10.1109/ISCO.2017.7855999","DOIUrl":null,"url":null,"abstract":"Scheduling process is a tedious task in heterogeneous networks because of the large number of users and the reduced radio resource facilities. Scheduling is nothing but granting certain number of sources to the users in a frequency and timing fashion. Resources define the symbols and subcarriers for transmitting the bits in scheduling. There are many ways to assign these things to the subscribers. Interference is one of the biggest issues in downlink scheduling algorithms. Due to high demands of the user requirement and speed, the network fails to validate their interference ranges and finally it assigns the resources wrongly. This cause the Non-Interference users get more number of blocks when comparing with the Interference users. This paper proposes a new technique to overcome the above issue and assign the resources starting from the users who are in non-interference range to interference range users. The outcome of the proposed work properly assigns the resources and increases the system throughput of the standard subscribers and also mitigates the wrong resource block assignment of the interference users.","PeriodicalId":321113,"journal":{"name":"2017 11th International Conference on Intelligent Systems and Control (ISCO)","volume":"4 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"1900-01-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"Interference aware downlink scheduling algorithm in Mobile networks\",\"authors\":\"K. Ramkumar, P. Newton\",\"doi\":\"10.1109/ISCO.2017.7855999\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Scheduling process is a tedious task in heterogeneous networks because of the large number of users and the reduced radio resource facilities. Scheduling is nothing but granting certain number of sources to the users in a frequency and timing fashion. Resources define the symbols and subcarriers for transmitting the bits in scheduling. There are many ways to assign these things to the subscribers. Interference is one of the biggest issues in downlink scheduling algorithms. Due to high demands of the user requirement and speed, the network fails to validate their interference ranges and finally it assigns the resources wrongly. This cause the Non-Interference users get more number of blocks when comparing with the Interference users. This paper proposes a new technique to overcome the above issue and assign the resources starting from the users who are in non-interference range to interference range users. The outcome of the proposed work properly assigns the resources and increases the system throughput of the standard subscribers and also mitigates the wrong resource block assignment of the interference users.\",\"PeriodicalId\":321113,\"journal\":{\"name\":\"2017 11th International Conference on Intelligent Systems and Control (ISCO)\",\"volume\":\"4 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"1900-01-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2017 11th International Conference on Intelligent Systems and Control (ISCO)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ISCO.2017.7855999\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2017 11th International Conference on Intelligent Systems and Control (ISCO)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ISCO.2017.7855999","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 1

摘要

在异构网络中,由于用户数量庞大和无线资源设施的减少,调度过程是一项繁琐的任务。调度只不过是以频率和定时的方式向用户授予一定数量的源。资源定义了在调度中传输比特的符号和子载波。有很多方法可以将这些东西分配给订阅者。干扰是下行链路调度算法中最大的问题之一。由于对用户需求和速度的要求较高,网络无法验证其干扰范围,最终导致资源分配错误。这导致非干扰用户比干扰用户获得更多的区块数量。本文提出了一种克服上述问题的新技术,将资源从非干扰范围内的用户分配给干扰范围内的用户。该方法合理地分配了资源,提高了标准用户的系统吞吐量,减少了干扰用户的资源块分配错误。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Interference aware downlink scheduling algorithm in Mobile networks
Scheduling process is a tedious task in heterogeneous networks because of the large number of users and the reduced radio resource facilities. Scheduling is nothing but granting certain number of sources to the users in a frequency and timing fashion. Resources define the symbols and subcarriers for transmitting the bits in scheduling. There are many ways to assign these things to the subscribers. Interference is one of the biggest issues in downlink scheduling algorithms. Due to high demands of the user requirement and speed, the network fails to validate their interference ranges and finally it assigns the resources wrongly. This cause the Non-Interference users get more number of blocks when comparing with the Interference users. This paper proposes a new technique to overcome the above issue and assign the resources starting from the users who are in non-interference range to interference range users. The outcome of the proposed work properly assigns the resources and increases the system throughput of the standard subscribers and also mitigates the wrong resource block assignment of the interference users.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信