基于博弈论的LTE网络分类服务调度算法

Ayman Hajjawi, M. Ismail, N. Abdullah, N. Ramli
{"title":"基于博弈论的LTE网络分类服务调度算法","authors":"Ayman Hajjawi, M. Ismail, N. Abdullah, N. Ramli","doi":"10.1109/MICC.2015.7725461","DOIUrl":null,"url":null,"abstract":"Long Term Evolution (LTE) network is a promising wireless technology which provides mobile users with high data rate and low latency. LTE has been developed by the 3rd Generation Partnership Project (3GPP) to improve the end to end system delay and support higher Quality of Services (QoS). However, 3GPP has not defined a firm provision to handle the scheduling process, so that scheduling becomes an open issue for researchers. Instead, they defined nine classes with their corresponding Quality of Services (QoS) requirements. In this paper, a novel scheduling algorithm is proposed based on class service using cooperative game theory technique. The available resources are fairly distributed among classes as proportion which results in higher fairness level among classes. In the second level, the users with tightest delay requirements are prioritized. The proposed algorithm is compared with Proportional Fairness (PF) and Exponential (EXP) rule algorithms in terms of throughput, delay and fairness index. The proposed model outperforms PF and EXP schemes in all comparative parameters.","PeriodicalId":225244,"journal":{"name":"2015 IEEE 12th Malaysia International Conference on Communications (MICC)","volume":"35 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-11-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":"{\"title\":\"A novel scheduling algorithm based class-service using game theory for LTE network\",\"authors\":\"Ayman Hajjawi, M. Ismail, N. Abdullah, N. Ramli\",\"doi\":\"10.1109/MICC.2015.7725461\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Long Term Evolution (LTE) network is a promising wireless technology which provides mobile users with high data rate and low latency. LTE has been developed by the 3rd Generation Partnership Project (3GPP) to improve the end to end system delay and support higher Quality of Services (QoS). However, 3GPP has not defined a firm provision to handle the scheduling process, so that scheduling becomes an open issue for researchers. Instead, they defined nine classes with their corresponding Quality of Services (QoS) requirements. In this paper, a novel scheduling algorithm is proposed based on class service using cooperative game theory technique. The available resources are fairly distributed among classes as proportion which results in higher fairness level among classes. In the second level, the users with tightest delay requirements are prioritized. The proposed algorithm is compared with Proportional Fairness (PF) and Exponential (EXP) rule algorithms in terms of throughput, delay and fairness index. The proposed model outperforms PF and EXP schemes in all comparative parameters.\",\"PeriodicalId\":225244,\"journal\":{\"name\":\"2015 IEEE 12th Malaysia International Conference on Communications (MICC)\",\"volume\":\"35 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-11-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"7\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2015 IEEE 12th Malaysia International Conference on Communications (MICC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/MICC.2015.7725461\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2015 IEEE 12th Malaysia International Conference on Communications (MICC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/MICC.2015.7725461","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 7

摘要

长期演进(LTE)网络是一种很有前途的无线技术,它为移动用户提供高数据速率和低延迟。LTE由第三代合作伙伴计划(3GPP)开发,旨在改善端到端系统延迟并支持更高的服务质量(QoS)。然而,3GPP并没有明确规定如何处理调度过程,因此调度成为研究人员的一个开放性问题。相反,他们定义了9个具有相应服务质量(QoS)需求的类。本文利用协作博弈论技术,提出了一种基于类服务的调度算法。可用资源按比例在班级间公平分配,班级间公平程度较高。在第二级,对延迟要求最严格的用户进行优先级排序。在吞吐量、延迟和公平性指标方面,将该算法与比例公平(PF)和指数公平(EXP)规则算法进行了比较。该模型在所有比较参数上都优于PF和EXP方案。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
A novel scheduling algorithm based class-service using game theory for LTE network
Long Term Evolution (LTE) network is a promising wireless technology which provides mobile users with high data rate and low latency. LTE has been developed by the 3rd Generation Partnership Project (3GPP) to improve the end to end system delay and support higher Quality of Services (QoS). However, 3GPP has not defined a firm provision to handle the scheduling process, so that scheduling becomes an open issue for researchers. Instead, they defined nine classes with their corresponding Quality of Services (QoS) requirements. In this paper, a novel scheduling algorithm is proposed based on class service using cooperative game theory technique. The available resources are fairly distributed among classes as proportion which results in higher fairness level among classes. In the second level, the users with tightest delay requirements are prioritized. The proposed algorithm is compared with Proportional Fairness (PF) and Exponential (EXP) rule algorithms in terms of throughput, delay and fairness index. The proposed model outperforms PF and EXP schemes in all comparative parameters.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信