A Network Graph Approach for Network Energy Saving in Small Cell Networks

Small cell networks are key components in 5G networks to boost the network capacity, improve spectrum and energy efficiency, and enable flexible and new services. Due to the flexible spectrum access among and flexible deployment of small cells, the inter- cell coordination becomes critical for the performance of the network. In this paper, based on the key concept in software defined networking (SDN) for Internet, we first introduce the network graph approach as a tool for the control and coordination among small cells. The network graph is constructed from the abstracted network state information extracted from underlying base stations. It shields the logical centralized control unit from implementation details of the underlying physical layer and thus reduces the control overhead in a centralized solution. We use the network graph for network energy saving in small cell networks, in which network graphs are used to decide the optimal set of small cells in the network. For cells outside this set we can switch them off for energy saving. We propose three types of network graphs with different network state details. Based on these graphs, we formulate the energy saving problem as an integer linear programming (ILP) problem, and propose the practical algorithms to solve the problem. The performance of the algorithms are studied by simulation. It shows the potential of the proposed network graph approach for the inter-cell resource coordination in small cell networks.