使用JT CoMP的启用缓存的超密集网络中的用户关联

Siyun Chen, Ye Wang, Jia Yu, Nian-sheng Wang, Yan Yan
{"title":"使用JT CoMP的启用缓存的超密集网络中的用户关联","authors":"Siyun Chen, Ye Wang, Jia Yu, Nian-sheng Wang, Yan Yan","doi":"10.1109/IAEAC.2018.8577878","DOIUrl":null,"url":null,"abstract":"Coordinated Multi Point(CoMP) can be employed to reduce interference and improve network throughput in Ultra Dense Network(UDN). However, backhaul capacity is a bottleneck in achieving the goal. Fortunately, proactive caching is a promising technology to alleviate backhaul load. In a cache-enabled system with CoMP, user association is an important problem which can give prominence to its advantage. In this paper, to pursue large network throughput gain at less cost of backhaul load, we formulate user association problem as an Integer Programming(IP) problem. Given the strategy of content placement, we propose an N-Best Binary Particle Swarm Optimization(NB-BPSO) algorithm to solve the problem. Simulation results show that our algorithm improves network throughput and reduces backhaul traffic significantly compared with traditional user association schemes.","PeriodicalId":6573,"journal":{"name":"2018 IEEE 3rd Advanced Information Technology, Electronic and Automation Control Conference (IAEAC)","volume":"206 1","pages":"964-968"},"PeriodicalIF":0.0000,"publicationDate":"2018-10-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"User Association in Cache-enabled Ultra Dense Network with JT CoMP\",\"authors\":\"Siyun Chen, Ye Wang, Jia Yu, Nian-sheng Wang, Yan Yan\",\"doi\":\"10.1109/IAEAC.2018.8577878\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Coordinated Multi Point(CoMP) can be employed to reduce interference and improve network throughput in Ultra Dense Network(UDN). However, backhaul capacity is a bottleneck in achieving the goal. Fortunately, proactive caching is a promising technology to alleviate backhaul load. In a cache-enabled system with CoMP, user association is an important problem which can give prominence to its advantage. In this paper, to pursue large network throughput gain at less cost of backhaul load, we formulate user association problem as an Integer Programming(IP) problem. Given the strategy of content placement, we propose an N-Best Binary Particle Swarm Optimization(NB-BPSO) algorithm to solve the problem. Simulation results show that our algorithm improves network throughput and reduces backhaul traffic significantly compared with traditional user association schemes.\",\"PeriodicalId\":6573,\"journal\":{\"name\":\"2018 IEEE 3rd Advanced Information Technology, Electronic and Automation Control Conference (IAEAC)\",\"volume\":\"206 1\",\"pages\":\"964-968\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2018-10-01\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2018 IEEE 3rd Advanced Information Technology, Electronic and Automation Control Conference (IAEAC)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/IAEAC.2018.8577878\",\"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 3rd Advanced Information Technology, Electronic and Automation Control Conference (IAEAC)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/IAEAC.2018.8577878","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

摘要

在超密集网络(UDN)中,采用协调多点(CoMP)可以减少干扰,提高网络吞吐量。然而,回程容量是实现这一目标的瓶颈。幸运的是,主动缓存是一种很有前途的减轻回程负载的技术。在支持缓存的CoMP系统中,用户关联是一个重要的问题,可以突出其优势。为了在更小的回程负载代价下获得更大的网络吞吐量,我们将用户关联问题表述为整数规划(IP)问题。针对内容放置策略,提出了一种N-Best二元粒子群优化算法(NB-BPSO)来解决该问题。仿真结果表明,与传统的用户关联方案相比,该算法显著提高了网络吞吐量,减少了回程流量。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
User Association in Cache-enabled Ultra Dense Network with JT CoMP
Coordinated Multi Point(CoMP) can be employed to reduce interference and improve network throughput in Ultra Dense Network(UDN). However, backhaul capacity is a bottleneck in achieving the goal. Fortunately, proactive caching is a promising technology to alleviate backhaul load. In a cache-enabled system with CoMP, user association is an important problem which can give prominence to its advantage. In this paper, to pursue large network throughput gain at less cost of backhaul load, we formulate user association problem as an Integer Programming(IP) problem. Given the strategy of content placement, we propose an N-Best Binary Particle Swarm Optimization(NB-BPSO) algorithm to solve the problem. Simulation results show that our algorithm improves network throughput and reduces backhaul traffic significantly compared with traditional user association schemes.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
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学术官方微信