Linqiong Jia, Wence Zhang, Zhaohui Yang, Chunhua Ma, Ming Chen
{"title":"LTE网络中小区负载均衡约束下最小功耗小区站点规划","authors":"Linqiong Jia, Wence Zhang, Zhaohui Yang, Chunhua Ma, Ming Chen","doi":"10.1109/WCSP.2013.6677145","DOIUrl":null,"url":null,"abstract":"The problem of cell sites planning in a given service area in LTE cellular networks is studied in this paper, the optimization objective of which is to minimize the power consumption of both users and cell sites under the constraint of cell load balancing. Non-uniform traffic distributions across the entire service area are considered. An efficient algorithm is proposed, which first works out a proper range of the optimal sites number, and then determines the cell sites locations for each number in the range by iteratively solving a convex problem to minimize the power consumption of both users and cell sites. The optimal cell sites number is the one with minimal power consumption and the locations are determined accordingly. An example scenario is presented to demonstrate the convergence and effectiveness of the proposed algorithm.","PeriodicalId":342639,"journal":{"name":"2013 International Conference on Wireless Communications and Signal Processing","volume":"25 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2013-12-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"4","resultStr":"{\"title\":\"Cell sites planning with minimized power consumption under cell load balancing constraint in LTE networks\",\"authors\":\"Linqiong Jia, Wence Zhang, Zhaohui Yang, Chunhua Ma, Ming Chen\",\"doi\":\"10.1109/WCSP.2013.6677145\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"The problem of cell sites planning in a given service area in LTE cellular networks is studied in this paper, the optimization objective of which is to minimize the power consumption of both users and cell sites under the constraint of cell load balancing. Non-uniform traffic distributions across the entire service area are considered. An efficient algorithm is proposed, which first works out a proper range of the optimal sites number, and then determines the cell sites locations for each number in the range by iteratively solving a convex problem to minimize the power consumption of both users and cell sites. The optimal cell sites number is the one with minimal power consumption and the locations are determined accordingly. An example scenario is presented to demonstrate the convergence and effectiveness of the proposed algorithm.\",\"PeriodicalId\":342639,\"journal\":{\"name\":\"2013 International Conference on Wireless Communications and Signal Processing\",\"volume\":\"25 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2013-12-02\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"4\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"2013 International Conference on Wireless Communications and Signal Processing\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1109/WCSP.2013.6677145\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"2013 International Conference on Wireless Communications and Signal Processing","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1109/WCSP.2013.6677145","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
Cell sites planning with minimized power consumption under cell load balancing constraint in LTE networks
The problem of cell sites planning in a given service area in LTE cellular networks is studied in this paper, the optimization objective of which is to minimize the power consumption of both users and cell sites under the constraint of cell load balancing. Non-uniform traffic distributions across the entire service area are considered. An efficient algorithm is proposed, which first works out a proper range of the optimal sites number, and then determines the cell sites locations for each number in the range by iteratively solving a convex problem to minimize the power consumption of both users and cell sites. The optimal cell sites number is the one with minimal power consumption and the locations are determined accordingly. An example scenario is presented to demonstrate the convergence and effectiveness of the proposed algorithm.