Difference Based Matching Algorithm for User Association Problem in Ultra-Dense Heterogeneous Networks

Chunxia Su, Fang Ye, Shanya Cong, Yuan Tian
{"title":"Difference Based Matching Algorithm for User Association Problem in Ultra-Dense Heterogeneous Networks","authors":"Chunxia Su, Fang Ye, Shanya Cong, Yuan Tian","doi":"10.23919/USNC/URSI49741.2020.9321661","DOIUrl":null,"url":null,"abstract":"To meet the ever-increasing requirements of high data transmission rates by Internet of Things (IoT) users, ultradense heterogeneous network (HetNet) is introduced for its excellent performance in enhancing cell coverage and improving system throughput. However, the sophisticated structure in ultradense HetNet makes user association become a crucial problem. Thus, this paper focuses on the user association problem in ultradense HetNet, aiming at maximizing system throughput. Then a difference based matching algorithm is proposed, in which the achievable rate difference between the current request and the next request is taken into account when multiple IoT users compete for the access opportunity with the same low power points (LPPs). Simulation results show that the proposed algorithm can achieve both the highest system sum-throughput and the best fairness compared with the four comparison algorithms.","PeriodicalId":443426,"journal":{"name":"2020 IEEE USNC-CNC-URSI North American Radio Science Meeting (Joint with AP-S Symposium)","volume":"52 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2020-07-05","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"2020 IEEE USNC-CNC-URSI North American Radio Science Meeting (Joint with AP-S Symposium)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.23919/USNC/URSI49741.2020.9321661","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

To meet the ever-increasing requirements of high data transmission rates by Internet of Things (IoT) users, ultradense heterogeneous network (HetNet) is introduced for its excellent performance in enhancing cell coverage and improving system throughput. However, the sophisticated structure in ultradense HetNet makes user association become a crucial problem. Thus, this paper focuses on the user association problem in ultradense HetNet, aiming at maximizing system throughput. Then a difference based matching algorithm is proposed, in which the achievable rate difference between the current request and the next request is taken into account when multiple IoT users compete for the access opportunity with the same low power points (LPPs). Simulation results show that the proposed algorithm can achieve both the highest system sum-throughput and the best fairness compared with the four comparison algorithms.
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
基于差分的超密集异构网络用户关联问题匹配算法
为了满足物联网用户日益增长的高数据传输速率需求,超密集异构网络(HetNet)以其在增强小区覆盖和提高系统吞吐量方面的优异性能被引入。然而,超密集网络的复杂结构使得用户关联成为一个关键问题。因此,本文主要研究超密集网络中的用户关联问题,以实现系统吞吐量的最大化。然后提出了一种基于差异的匹配算法,该算法在多个物联网用户使用相同的低功耗点(LPPs)竞争访问机会时,考虑当前请求与下一个请求之间可实现的速率差异。仿真结果表明,与四种比较算法相比,该算法既能获得最高的系统总吞吐量,又能获得最佳的公平性。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
Length Limits for Perfectly Matched Transmission Line Impedance Transformation Borehole Water Holdup Detection Using Conical Spiral Transmission Line Analysis of GPS Gradient Parameters for Rainfall Prediction Adaptive Sensing Matrix Design in Compressive Sensing Based Direction of Arrival Estimation with Hardware Constraints Importance of Hydrostatic Delay Models in Deriving PWV from GPS Signal Delays
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
现在去查看 取消
×
提示
确定
0
微信
客服QQ
Book学术公众号 扫码关注我们
反馈
×
意见反馈
请填写您的意见或建议
请填写您的手机或邮箱
已复制链接
已复制链接
快去分享给好友吧!
我知道了
×
扫码分享
扫码分享
Book学术官方微信
Book学术文献互助
Book学术文献互助群
群 号:481959085
Book学术
文献互助 智能选刊 最新文献 互助须知 联系我们:info@booksci.cn
Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。
Copyright © 2023 Book学术 All rights reserved.
ghs 京公网安备 11010802042870号 京ICP备2023020795号-1