Cost-Constrained Constrained Viterbi Algorithm For Resource Allocation in Solar Base Stations
Abstract: Solar energy is currently a popular renewable resource, yet limited daily. In green cellular networks, multiple constraints optimization (MCO) problems arise naturally. For example, a typical objective is to control the power transmission of the hybrid base e stations (BSs) (connected to both solar panels and electrical grid) in order to maximize user’s average throughput, under the constraints of consumed grid energy and user’s blocking rate. However, such problems have been generally proved to be NP-hard. NP In n this paper, we formulate this generic MCO problem as a quantized Markovian cost cost-reward reward model, with no assumption on input data. We then propose a novel algorithm, namely cost-constrained cost Viterbi algorithm, which recursively returns the optimal policy with wit linear computational complexity for this model. As an application, we provide engineering rules for the design of hybrid BSs through extensive simulations. In comparison with brute force method for a simple scenario, we find that our algorithm does achieve ve the constrained optimal policy.