{"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":"1 1","pages":"113-118"},"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\":\"1 1\",\"pages\":\"113-118\"},\"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}
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.