4.7 Article

Online Ski Rental for ON/OFF Scheduling of Energy Harvesting Base Stations

Journal

IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS
Volume 16, Issue 5, Pages 2976-2990

Publisher

IEEE-INST ELECTRICAL ELECTRONICS ENGINEERS INC
DOI: 10.1109/TWC.2017.2672964

Keywords

Energy harvesting; cellular networks; optimization; small cell networks; online algorithms; ski rental problem

Funding

  1. U.S. National Science Foundation [CNS-1460333]
  2. Towards Energy-Efficient Hyper-Dense Wireless Networks with Trillions of Devices
  3. Commissioned Research of National Institute of Information and Communications Technology, Japan
  4. Academy of Finland CARMA project
  5. Grants-in-Aid for Scientific Research [15K18062] Funding Source: KAKEN

Ask authors/readers for more resources

The co-existence of small cell base stations (SBSs) with conventional macrocell base station is a promising approach to boost the capacity and coverage of cellular networks. However, densifying the network with a viral deployment of SBSs can significantly increase energy consumption. To reduce the reliance on unsustainable energy sources, one can adopt self-powered SBSs that rely solely on energy harvesting. Due to the uncertainty of energy arrival and the finite capacity of energy storage systems, self-powered SBSs must smartly optimize their ON and OFF schedule. In this paper, the problem of ON/OFF scheduling of self-powered SBSs is studied, in the presence of energy harvesting uncertainty with the goal of minimizing the operational costs consisting of energy consumption and transmission delay of a network. For the original problem, we show that an algorithm can solve the problem in the illustrative case. Then, to reduce the complexity of the original problem, an approximation is proposed. To solve the approximated problem, a novel approach based on the ski rental framework, a powerful online optimization tool, is proposed. Using this approach, each SBS can effectively decide on its ON/OFF schedule autonomously, without any prior information on future energy arrivals. By using competitive analysis, a deterministic online algorithm and a randomized online algorithm (ROA) are developed. The ROA is then shown to achieve the optimal competitive ratio in the approximation problem. Simulation results show that, compared with a baseline approach, the ROA can yield performance gains reaching up to 15.6% in terms of reduced total energy consumption of SBSs and up to 20.6% in terms of per-SBS network delay reduction. The results also shed light on the fundamental aspects that impact the ON time of SBSs while demonstrating that the proposed ROA can reduce up to 69.9% the total cost compared with a baseline approach.

Authors

I am an author on this paper
Click your name to claim this paper and add it to your profile.

Reviews

Primary Rating

4.7
Not enough ratings

Secondary Ratings

Novelty
-
Significance
-
Scientific rigor
-
Rate this paper

Recommended

No Data Available
No Data Available