%0 Conference Paper %1 har19ITC31 %A K, Haritha %A Singh, Chandramani %B 31th International Teletraffic Congress (ITC 31) %C Budapest, Hungary %D 2019 %K itc itc31 %T Max Weight Scheduling with Base Station Running and Switching Costs %U https://gitlab2.informatik.uni-wuerzburg.de/itc-conference/itc-conference-public/-/raw/master/itc31/har19ITC31.pdf?inline=true %X We consider a wireless network of $N$ base stations(BSs) serving $M$ users through time-varying channels. The service rate provided by the channel is observed only when the corresponding BS is switched on. In this setup, we consider two types of costs: $(1)$the cost of maintaining BS in on state, $(2)$the cost of switching the state of BS(from on to off or from off to on). In this paper, we propose an algorithm which achieves cost arbitrarily close to the optimum cost under queue stability. Since traditional Drift-plus-Penalty approach does not suffice to achieve this, we propose proof in two steps. In the first step, we show the BS running cost arbitrarily close to the optimum under queue stability. In the second step, we show the mean number of BS switch-overs is of the order $O(1/U)$. We illustrate the performance of the proposed algorithms via simulations.

@inproceedings{har19ITC31, abstract = {We consider a wireless network of $N$ base stations(BSs) serving $M$ users through time-varying channels. The service rate provided by the channel is observed only when the corresponding BS is switched on. In this setup, we consider two types of costs: $(1)$the cost of maintaining BS in on state, $(2)$the cost of switching the state of BS(from on to off or from off to on). In this paper, we propose an algorithm which achieves cost arbitrarily close to the optimum cost under queue stability. Since traditional Drift-plus-Penalty approach does not suffice to achieve this, we propose proof in two steps. In the first step, we show the BS running cost arbitrarily close to the optimum under queue stability. In the second step, we show the mean number of BS switch-overs is of the order $O(1/U)$. We illustrate the performance of the proposed algorithms via simulations.}, added-at = {2020-04-29T15:29:04.000+0200}, address = {Budapest, Hungary}, author = {K, Haritha and Singh, Chandramani}, biburl = {https://www.bibsonomy.org/bibtex/2d71f51bd908e1e891a7ca1109d4b1439/itc}, booktitle = {31th International Teletraffic Congress (ITC 31)}, interhash = {4e00bcac04834379c36062bd98d31bab}, intrahash = {d71f51bd908e1e891a7ca1109d4b1439}, keywords = {itc itc31}, timestamp = {2020-04-30T18:18:45.000+0200}, title = {Max Weight Scheduling with Base Station Running and Switching Costs}, url = {https://gitlab2.informatik.uni-wuerzburg.de/itc-conference/itc-conference-public/-/raw/master/itc31/har19ITC31.pdf?inline=true}, year = 2019 }