{"title":"灾害环境下的细胞缩放能效调度算法","authors":"A. Uchiyama, K. Kitada, T. Higashino","doi":"10.1145/2810362.2810369","DOIUrl":null,"url":null,"abstract":"Nowadays, many base stations (BSs) are equipped with batteries to provide services even during blackouts due to severe events such as disasters. In this paper, we propose a scheduling algorithm to adjust cell sizes, aka cell zooming, of battery-operated BSs in order for efficient use of energy. Our goal is to balance the tradeoff between user coverage and battery lifetime. For this purpose, we define the energy efficiency as user coverage per energy and maximize the efficiency under the assumption that future user distribution is roughly given. We propose a greedy algorithm to solve the problem that is formulated as an integer linear programming problem. The simulation results show that user coverage increases by 17% compared with the case without cell zooming.","PeriodicalId":332932,"journal":{"name":"Proceedings of the 13th ACM International Symposium on Mobility Management and Wireless Access","volume":"31 3 1","pages":"0"},"PeriodicalIF":0.0000,"publicationDate":"2015-11-02","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"1","resultStr":"{\"title\":\"A Scheduling Algorithm of Cell Zooming for Energy Efficiency in Disasters\",\"authors\":\"A. Uchiyama, K. Kitada, T. Higashino\",\"doi\":\"10.1145/2810362.2810369\",\"DOIUrl\":null,\"url\":null,\"abstract\":\"Nowadays, many base stations (BSs) are equipped with batteries to provide services even during blackouts due to severe events such as disasters. In this paper, we propose a scheduling algorithm to adjust cell sizes, aka cell zooming, of battery-operated BSs in order for efficient use of energy. Our goal is to balance the tradeoff between user coverage and battery lifetime. For this purpose, we define the energy efficiency as user coverage per energy and maximize the efficiency under the assumption that future user distribution is roughly given. We propose a greedy algorithm to solve the problem that is formulated as an integer linear programming problem. The simulation results show that user coverage increases by 17% compared with the case without cell zooming.\",\"PeriodicalId\":332932,\"journal\":{\"name\":\"Proceedings of the 13th ACM International Symposium on Mobility Management and Wireless Access\",\"volume\":\"31 3 1\",\"pages\":\"0\"},\"PeriodicalIF\":0.0000,\"publicationDate\":\"2015-11-02\",\"publicationTypes\":\"Journal Article\",\"fieldsOfStudy\":null,\"isOpenAccess\":false,\"openAccessPdf\":\"\",\"citationCount\":\"1\",\"resultStr\":null,\"platform\":\"Semanticscholar\",\"paperid\":null,\"PeriodicalName\":\"Proceedings of the 13th ACM International Symposium on Mobility Management and Wireless Access\",\"FirstCategoryId\":\"1085\",\"ListUrlMain\":\"https://doi.org/10.1145/2810362.2810369\",\"RegionNum\":0,\"RegionCategory\":null,\"ArticlePicture\":[],\"TitleCN\":null,\"AbstractTextCN\":null,\"PMCID\":null,\"EPubDate\":\"\",\"PubModel\":\"\",\"JCR\":\"\",\"JCRName\":\"\",\"Score\":null,\"Total\":0}","platform":"Semanticscholar","paperid":null,"PeriodicalName":"Proceedings of the 13th ACM International Symposium on Mobility Management and Wireless Access","FirstCategoryId":"1085","ListUrlMain":"https://doi.org/10.1145/2810362.2810369","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"","PubModel":"","JCR":"","JCRName":"","Score":null,"Total":0}
A Scheduling Algorithm of Cell Zooming for Energy Efficiency in Disasters
Nowadays, many base stations (BSs) are equipped with batteries to provide services even during blackouts due to severe events such as disasters. In this paper, we propose a scheduling algorithm to adjust cell sizes, aka cell zooming, of battery-operated BSs in order for efficient use of energy. Our goal is to balance the tradeoff between user coverage and battery lifetime. For this purpose, we define the energy efficiency as user coverage per energy and maximize the efficiency under the assumption that future user distribution is roughly given. We propose a greedy algorithm to solve the problem that is formulated as an integer linear programming problem. The simulation results show that user coverage increases by 17% compared with the case without cell zooming.