同步HetNets中动态TDD帧重构的集中算法

Khanh Nguyen, Luca Zappaterra, Hyeong-Ah Choi
{"title":"同步HetNets中动态TDD帧重构的集中算法","authors":"Khanh Nguyen, Luca Zappaterra, Hyeong-Ah Choi","doi":"10.1109/ICCW.2015.7247164","DOIUrl":null,"url":null,"abstract":"Traffic demands of mobile radio network have been tremendously increasing in the recent years due to the enormous success of smartphones and their continuous feature evolution requiring higher data rates. Heterogeneous networks (HetNets) consisting of low-power small cells underlying the existing macro cells represent the preferred solution to increase the capacity of cellular systems by means of spatial spectrum reuse. Static uplink/downlink time-division duplexing (TDD) configurations of existing networks cannot satisfy the varying traffic patterns of large number of small cells, which vary among cells and over time. In this paper we propose and evaluate a centralized algorithm for dynamic TDD frame configuration to which operates on a cluster-based cellular network, maximize the network throughput and preserving fairness. Our algorithm is characterized by only O(n log n) time complexity (with n cells in the network), which allows for instantaneous network-wise reconfigurations minimizing overhead. The algorithm is proven to be optimal and time efficient. Extensive simulation results using realistic application traffic have shown the superiority the proposed solution against static TDD configurations of LTE systems. Throughput improvements up to 43% as well as reductions in queued traffic at cells up to 52% are obtained using separate utility functions designed for throughput maximization and fairness respectively.","PeriodicalId":6464,"journal":{"name":"2015 IEEE International Conference on Communication Workshop (ICCW)","volume":null,"pages":null},"PeriodicalIF":0.0000,"publicationDate":"2015-06-08","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"A centralized algorithm for dynamic TDD frame reconfigurations in synchronized HetNets\",\"authors\":\"Khanh Nguyen, Luca Zappaterra, Hyeong-Ah Choi\",\"doi\":\"10.1109/ICCW.2015.7247164\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Traffic demands of mobile radio network have been tremendously increasing in the recent years due to the enormous success of smartphones and their continuous feature evolution requiring higher data rates. Heterogeneous networks (HetNets) consisting of low-power small cells underlying the existing macro cells represent the preferred solution to increase the capacity of cellular systems by means of spatial spectrum reuse. Static uplink/downlink time-division duplexing (TDD) configurations of existing networks cannot satisfy the varying traffic patterns of large number of small cells, which vary among cells and over time. In this paper we propose and evaluate a centralized algorithm for dynamic TDD frame configuration to which operates on a cluster-based cellular network, maximize the network throughput and preserving fairness. Our algorithm is characterized by only O(n log n) time complexity (with n cells in the network), which allows for instantaneous network-wise reconfigurations minimizing overhead. The algorithm is proven to be optimal and time efficient. Extensive simulation results using realistic application traffic have shown the superiority the proposed solution against static TDD configurations of LTE systems. Throughput improvements up to 43% as well as reductions in queued traffic at cells up to 52% are obtained using separate utility functions designed for throughput maximization and fairness respectively.\",\"PeriodicalId\":6464,\"journal\":{\"name\":\"2015 IEEE International Conference on Communication Workshop (ICCW)\",\"volume\":null,\"pages\":null},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-06-08\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2015 IEEE International Conference on Communication Workshop (ICCW)\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/ICCW.2015.7247164\",\"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 International Conference on Communication Workshop (ICCW)","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/ICCW.2015.7247164","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 4

摘要

近年来,由于智能手机的巨大成功及其不断发展的特性要求更高的数据速率,移动无线网络的流量需求急剧增加。异构网络(HetNets)是在现有宏蜂窝基础上由低功耗小蜂窝组成的网络,是通过空间频谱复用来增加蜂窝系统容量的首选解决方案。现有网络的静态上行/下行时分双工(TDD)配置不能满足大量小小区的不同业务模式,这些业务模式在小区之间和时间上都有变化。本文提出并评估了一种集中的动态TDD帧配置算法,该算法在基于集群的蜂窝网络上运行,可以最大限度地提高网络吞吐量并保持公平性。我们的算法的特点是只有O(n log n)的时间复杂度(网络中有n个单元),这允许瞬时的网络重新配置最小化开销。实验证明,该算法具有最优性和时间效率。实际应用流量的大量仿真结果表明,该方案相对于LTE系统的静态TDD配置具有优越性。通过使用分别为吞吐量最大化和公平性设计的效用函数,可以获得高达43%的吞吐量改进以及高达52%的单元队列流量减少。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
查看原文
分享 分享
微信好友 朋友圈 QQ好友 复制链接
本刊更多论文
A centralized algorithm for dynamic TDD frame reconfigurations in synchronized HetNets
Traffic demands of mobile radio network have been tremendously increasing in the recent years due to the enormous success of smartphones and their continuous feature evolution requiring higher data rates. Heterogeneous networks (HetNets) consisting of low-power small cells underlying the existing macro cells represent the preferred solution to increase the capacity of cellular systems by means of spatial spectrum reuse. Static uplink/downlink time-division duplexing (TDD) configurations of existing networks cannot satisfy the varying traffic patterns of large number of small cells, which vary among cells and over time. In this paper we propose and evaluate a centralized algorithm for dynamic TDD frame configuration to which operates on a cluster-based cellular network, maximize the network throughput and preserving fairness. Our algorithm is characterized by only O(n log n) time complexity (with n cells in the network), which allows for instantaneous network-wise reconfigurations minimizing overhead. The algorithm is proven to be optimal and time efficient. Extensive simulation results using realistic application traffic have shown the superiority the proposed solution against static TDD configurations of LTE systems. Throughput improvements up to 43% as well as reductions in queued traffic at cells up to 52% are obtained using separate utility functions designed for throughput maximization and fairness respectively.
求助全文
通过发布文献求助,成功后即可免费获取论文全文。 去求助
来源期刊
自引率
0.00%
发文量
0
期刊最新文献
CI/DS-CDMA scheme for autonomous underwater vehicle communication Optimising OFDM based visible light communication for high throughput and reduced PAPR A channel sensing based design for LTE in unlicensed bands Local and cooperative spectrum sensing via Kuiper's test Delay-aware energy-efficient communications over Nakagami-m fading channel with MMPP traffic
×
引用
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