基于学习的数据密集型和沉浸式触觉应用资源分配

Medhat H. M. Elsayed, M. Erol-Kantarci
{"title":"基于学习的数据密集型和沉浸式触觉应用资源分配","authors":"Medhat H. M. Elsayed, M. Erol-Kantarci","doi":"10.1109/5GWF.2018.8517001","DOIUrl":null,"url":null,"abstract":"The immersive tactile applications that are emerging in the entertainment, education and health industries are anticipated to be available for mobile users in the close future. These applications are data-intensive and delay-sensitive due to the nature of information that is being exchanged. With today’s mobile networks, the throughput and latency challenges are the major roadblocks for mobile users. In this paper, we propose a resource allocation technique with the aim of increasing throughput and reducing latency of Data Intensive Devices (DIDs). We consider the coexistence of DIDs with traditional User Equipments (UEs) on a two-tier, densely deployed network of Small cell Base Stations (SBSs) and eNBs. We propose a Q-learning-based resource allocation scheme, namely, Throughput Maximizing Q-Learning (TMQ) that learns the efficient resource allocation of both SBSs and eNB. The proposed technique is compared with well-known Proportional Fairness (PF) algorithm in terms of average throughput, delay, and fairness. Simulation results show significant improvement in throughput, 80% reduction in delay, and 6% increase in fairness.","PeriodicalId":440445,"journal":{"name":"2018 IEEE 5G World Forum (5GWF)","volume":"61 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2018-07-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"7","resultStr":"{\"title\":\"Learning-Based Resource Allocation for Data-Intensive and Immersive Tactile Applications\",\"authors\":\"Medhat H. M. Elsayed, M. Erol-Kantarci\",\"doi\":\"10.1109/5GWF.2018.8517001\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The immersive tactile applications that are emerging in the entertainment, education and health industries are anticipated to be available for mobile users in the close future. These applications are data-intensive and delay-sensitive due to the nature of information that is being exchanged. With today’s mobile networks, the throughput and latency challenges are the major roadblocks for mobile users. In this paper, we propose a resource allocation technique with the aim of increasing throughput and reducing latency of Data Intensive Devices (DIDs). We consider the coexistence of DIDs with traditional User Equipments (UEs) on a two-tier, densely deployed network of Small cell Base Stations (SBSs) and eNBs. We propose a Q-learning-based resource allocation scheme, namely, Throughput Maximizing Q-Learning (TMQ) that learns the efficient resource allocation of both SBSs and eNB. The proposed technique is compared with well-known Proportional Fairness (PF) algorithm in terms of average throughput, delay, and fairness. Simulation results show significant improvement in throughput, 80% reduction in delay, and 6% increase in fairness.\",\"PeriodicalId\":440445,\"journal\":{\"name\":\"2018 IEEE 5G World Forum (5GWF)\",\"volume\":\"61 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-07-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"7\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2018 IEEE 5G World Forum (5GWF)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/5GWF.2018.8517001\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2018 IEEE 5G World Forum (5GWF)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/5GWF.2018.8517001","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 7

摘要

在娱乐、教育和健康行业中出现的沉浸式触觉应用预计将在不久的将来为移动用户提供。由于正在交换的信息的性质,这些应用程序是数据密集型和延迟敏感的。在当今的移动网络中,吞吐量和延迟挑战是移动用户的主要障碍。在本文中,我们提出了一种资源分配技术,旨在提高数据密集型设备(did)的吞吐量和减少延迟。我们考虑在两层、密集部署的小蜂窝基站(SBSs)和enb网络上did与传统用户设备(ue)共存。我们提出了一种基于q学习的资源分配方案,即吞吐量最大化q学习(TMQ),该方案学习了SBSs和eNB的有效资源分配。在平均吞吐量、延迟和公平性方面,将该技术与著名的比例公平(PF)算法进行了比较。仿真结果表明,吞吐量显著提高,延迟减少80%,公平性提高6%。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
Learning-Based Resource Allocation for Data-Intensive and Immersive Tactile Applications
The immersive tactile applications that are emerging in the entertainment, education and health industries are anticipated to be available for mobile users in the close future. These applications are data-intensive and delay-sensitive due to the nature of information that is being exchanged. With today’s mobile networks, the throughput and latency challenges are the major roadblocks for mobile users. In this paper, we propose a resource allocation technique with the aim of increasing throughput and reducing latency of Data Intensive Devices (DIDs). We consider the coexistence of DIDs with traditional User Equipments (UEs) on a two-tier, densely deployed network of Small cell Base Stations (SBSs) and eNBs. We propose a Q-learning-based resource allocation scheme, namely, Throughput Maximizing Q-Learning (TMQ) that learns the efficient resource allocation of both SBSs and eNB. The proposed technique is compared with well-known Proportional Fairness (PF) algorithm in terms of average throughput, delay, and fairness. Simulation results show significant improvement in throughput, 80% reduction in delay, and 6% increase in fairness.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信