Opportunistic Sleep Mode Strategies in Wireless Small Cell Networks

Opportunistic Sleep Mode Strategies in
Wireless Small Cell Networks

Sumudu Samarakoon1, Mehdi Bennis1, Walid Saad2 and Matti Latva-aho1
This work is supported by the SHARING project under the Finland grant 128010 and the U.S. National Science Foundation (NSF) under Grant CNS-1406947 and CNS-1253731. 1Centre for Wireless Communications, University of Oulu, Finland,
email: {sumudu,bennis,matti.latva-aho}@ee.oulu.fi
2Electrical and Computer Engineering Department, University of Miami, Coral Gables, FL, USA, email: walid@miami.edu
Abstract

The design of energy-efficient mechanisms is one of the key challenges in emerging wireless small cell networks. In this paper, a novel approach for opportunistically switching ON/OFF base stations to improve the energy efficiency in wireless small cell networks is proposed. The proposed approach enables the small cell base stations to optimize their downlink performance while balancing the load among each another, while satisfying their users’ quality-of-service requirements. The problem is formulated as a noncooperative game among the base stations that seek to minimize a cost function which captures the tradeoff between energy expenditure and load. To solve this game, a distributed learning algorithm is proposed using which the base stations autonomously choose their optimal transmission strategies. Simulation results show that the proposed approach yields significant performance gains in terms of reduced energy expenditures up to and reduced load up to compared to conventional approaches.

{keywords}

Energy efficiency, game theory, learning, small cell networks;

I Introduction

In the past decade, the demand for wireless resources has grown exponentially due to the proliferation of bandwidth-intensive applications such as video streaming and social media [online:comscore13]. This growth increases the load on existing wireless cellular systems and leads to an increased energy consumption over the radio spectrum [pap:arshad12, pap:brevis11]. Therefore, developing energy-efficient mechanisms for resource allocation in wireless networks has become a major research topic in recent years [pap:brevis11, jnl:kyuho11]. In this respect, one promising approach to provide high wireless quality-of-service (QoS) while maintaining energy-efficient operation is through the deployment of low-cost, low-power small cells over existing cellular networks.

Existing literature has studied a number of problems related to resource allocation in small cell networks, such as base station (BS) placement, load balancing, power control, and dynamic BS sleep-wake mechanism, among others [pap:arshad12, pap:brevis11, pap:richter12, jnl:hongseok12, jnl:kyuho11, pap:zhou11]. In [pap:arshad12], an optimal deployment strategy is proposed for a two-tier network based on power consumption minimization subject to a target spectral efficiency. In [pap:brevis11], a stochastic programing approach with the goal of minimizing energy consumption is proposed for optimizing micro-BS locations. The authors in [pap:richter12] propose a decentralized cellular deployment mechanism based on forced fields for load balancing. A distributed load balancing problem is studied in [jnl:hongseok12] by introducing a utility function which captures different user association policies. In [jnl:kyuho11], a BS operation mechanism is proposed based on tradeoffs between energy and traffic load. The proposed greedy algorithm improves the energy efficiency by allowing certain BSs to switch between on and off states. A probabilistic approach for sleep-wake mechanism is presented in [pap:zhou11] to optimize the energy efficiency of relays in conventional cellular networks.

Although the above studies provide good insights on improving energy efficiency, all of them rely on a central controller which gathers all network information and makes all decisions. Such a mechanism introduces additional costs and overhead for information exchange and backhauls. Therefore, providing self-organizing capabilities to BSs seems to be a cost effective solution. However, with the absence of a central controller, the main issue faced by the BS activation/deactivating mechanism is to determine when and how to activate the sleeping BSs. This requires monitoring the entire network, the capability to predict the load, and react to the network changes. Failure to activate a sufficient number of BSs causes outages and activation of excessive number of BSs degrades the network efficiency. In this paper, our goal is to overcome these challenges by developing a new approach for opportunistic sleep mode strategies in small cell networks.

The main contribution of this paper is to develop opportunistic on/off strategies for BSs allowing them to decide on whether to switch to a sleep mode or to an active mode, depending on the current traffic load and network environment. Within the context of small cell networks, developing such a dynamic state switching algorithm requires a self-organizing, decentralized approach so as to minimize the overhead or coordination among base stations. Unlike the previous studies [jnl:kyuho11, pap:zhou11] which rely on a central controller, we propose a novel implicit coordination mechanism for dynamically activating/deactivating base stations while maintaining a balance between throughput and energy consumption. In the proposed approach, the BSs learn their best strategy profile based only on their individual energy consumption and handled load, without requiring global information. The goal of the BSs is to minimize a cost function which captures both energy consumption and load. We cast the problem as a non-cooperative game between the BSs. To solve this game, we propose a distributed algorithm using notions from regret learning [pap:bennis12, jnl:qian12]. Simulation results show that the proposed approach improves the energy efficiency and reduces the overall load in the system as compared to conventional approaches.

The rest of the paper is organized as follows. The system model and problem formulation are presented in Section II. The proposed game theoretical approach is discussed and the decentralized ON/OFF algorithm is proposed in Section III. Simulation results are presented and analyzed in Section IV. Finally, conclusions are drawn in Section V.

Ii System Model and Problem Formulation

Ii-a Notation

The regular symbols represent the scalars while the boldface symbols are used for vectors. The sets are denoted by upper case calligraphic symbols. and represent the cardinality and the set of all probability distributions of the finite set , respectively. The function denotes the indicator function which is defined as,

Ii-B Network Model

Consider the downlink transmission of a heterogeneous wireless network with a set of BSs . The set consists of a set of small cell base stations (SBSs) underlaid on a macro cellular network with a set of macro base stations (MBSs) , i.e. . Without loss of generality, we assume that the MBS is located at the origin of the two-dimensional network layout and we let be any location on the plane measured with respect to the origin. Moreover, let be the coverage area of BS such that any given user equipment (UE) at a given location is served by BS if . An illustrative example is shown in Fig 1.

Fig. 1: Illustration of the studied network. MBS- located at the origin and the shaded regions around the BSs represent their respective coverage areas.

Let be the transmission indicator of BS such that indicates the active state while reflects the idle or sleep state. Here, we assume that, in active state, each BS will service all UEs in its coverage area. From an energy saving perspective, some BSs might have an incentive to switch into sleep mode. Note that during the idle state, a BS consumes nonzero power to sense the UEs in its vicinity. The power consumption of BS is given by [pap:georgios12B]:

(1)

where represent, respectively, the total power of the radio frequency component and baseband unit, are respective loss fractions in feeders, DC-DC conversion, main supply and cooling, and is the efficiency of the power amplifier. represents the power consumption for the backhaul of . We note that, with this model, we are able to capture not only the power consumption due to the transmission, but also the power consumption required to maintain the BS in active mode.

Consider that BS uses a cell range expansion bias (CREB) to absorb additional UEs (expand its coverage ) along the transmission power . The concept of CREB has been proposed in small cell networks due to the disparate cell sizes between different BSs [book:quek13]. Since the CREB concept is used only by SBSs, we let for all . Moreover, we assume that all BSs transmit on the same frequency spectrum (i.e., co-channel deployment). Therefore, the received signal to interference and noise ratio (SINR) from BS at location is given by:

(2)

where is the channel gain from BS to a given UE location at and is the noise variance. Further, the data rate at a given location from BS is given by:

(3)

where is the bandwidth.

We assume that the UEs connected to BS are heterogeneous in nature such that each UE has a different QoS requirement based on its individual packet arrival rate. In this respect, let and be the packet arrival rate and the mean packet size of any UE at location . The data rate offered to the UE at location from BS is and thus, the load density of BS becomes where . Consequently, the BS load of a BS is given by:

(4)

Ii-C Problem Formulation

The configuration of the entire network is defined by the transmission powers and the states of all the BSs. This configuration can thus be captured by a transmission power vector , a CREB vector , and a state indicator vector as follows;

(5)

Due to the fact that the load of each BS is coupled with the above parameters as per (1)-(4), we map the configuration to a vector . Hereinafter, we refer to the load as the “network configuration”.

For a given network configuration , BS handles the load from the set of UEs in its coverage area . Consider a scenario in which BS increases its transmission power from to in order to serve the UEs in . Following (2) and (3), this power increment results in a higher SINR and higher data rate at location . Furthermore, for all , the load density of BS decreases resulting in a load reduction,

Clearly, for a given coverage area , each BS can reduce the handled load by increasing the offered throughput for all . However, in order to achieve higher throughputs, the BS needs to increase its power consumption. Thus, there is a tradeoff between load reduction (throughput increment and delay reduction) and energy consumption reduction.

Here, for each BS , we define a cost function that captures both energy consumption and load, as follows:

(6)

where the coefficients and are weight parameters that indicate the impact of energy and load on the cost, respectively. The overall objective is to minimize the total network cost:

(7)
subject to (9)

where is the maximum transmit power of BS . The load constraint (9) avoids outages and ensures service for all UEs in serviced by BS .

Iii Self-Organizing Switching ON/OFF Mechanism

The goal of this work is to propose a self-organizing solution for (7)-(9) in which each BS individually adjust its transmission parameters , without global network informations. We assume that BSs do not communicate among each others, thus, each BS makes its decision independently. To do so, we use a regret-based learning approach [pap:bennis12, jnl:qian12], in which the proposed solution consists of two interrelated parts: user association and BS transmission optimization.

Iii-a Load-Based User Association

The coverage area defines the locations of UEs associated with BS . Classical UE association techniques include received signal strength indication (RSSI) and SINR based associations [pap:richter12]. In these two cases, a UE connects to the BS which offers the best signal strength (maximum RSSI based approach) or to the BS providing the best SINR (maximum SINR based approach). However, these two techniques are oblivious to the base stations’ and the network’s traffic load. This may lead to overloading BSs and lower spectral efficiencies. Thus, a smarter mechanism in which the BSs advertise their load to all UEs within their coverage area is desirable. Such association mechanism allows UEs to consider both BS capability (load) and the quality of the communication link. Moreover, with such approach, the system yields fewer number of unsatisfied UEs and lesser overloaded BSs.

At time instant , each BS advertises its estimated load and an offset via a broadcast control message along with its transmission power and CREB . Considering both the received signal strength and load, at time the UE at location connects to BS , , according to the following UE association rule:

(10)

Here, is the received signal power at the UE in location from BS at time . The impact of the load is determined by the coefficient . The classical RSSI-based UE association is a special case of (11) when . Note that the offset is selected as where is the preferred load per BS . The UE association rule (10) encourages UEs to connect to underloaded BSs .

Due to fact that the BSs need to estimate their loads beforehand, the estimations must accurately reflect the actual load. In order to obtain an accurate estimation for the load of the BS , we compute the load estimation at time based on history as follows:

(11)

where is the learning rate of the load estimation. Leveraging different time-scales, we assume that is selected such that the load estimation procedure (11) is much slower than the UE association process. In addition, this learning rule considers both the instantaneous load and the long-term history , and to predict the load by balancing between those two quantities.

Iii-B Game Formulation

In the proposed approach, the BSs need to autonomously select in order to minimize their cost functions. However, the cell coverage and the achievable throughput of a BS depends not only on its own choice of action but also on remaining BSs due to the interference. In this regard, we formulate a non-cooperative game in which the set of BSs () is the set of players. Each player has set of actions where an action of BS , , is composed of its transmission power , CREB , and state , i.e. . The action of BS and the actions of the other BSs define the load of the system. is the utility function of BS with where . Let be a probability distribution in which BS selects a given action from at time instant , i.e. is BS ’s mixed strategy where is the action of player at time . Our goal is to develop a distributed mechanism to solve the switch ON/OFF game and reach the -coarse correlated equilibrium (-CCE) defined as follows [jnl:qian12]:

Definition 1

(-coarse correlated equilibrium): A mixed strategy probability is an -coarse correlated equilibrium if, and , it holds that:

where is the marginal probability distribution w.r.t. and .

In order to reach the -CCE, first, suppose that a given BS constantly changes its actions following a particular strategy and observes the time-average of its utility while the rest of the players follow their strategies captured by vector . While BS plays action , it may regret or be satisfied about the action it played based on the observed utility feedback . Therefore, player estimates its utility and regret for each action assuming it has played the same action during all previous times . At each time , player updates its mixed strategy probability distribution in which the actions with higher regrets are exploited while exploring the actions with low regrets [pap:bennis12]. Such behavior is captured by the Boltzmann-Gibbs (BG) distribution which is calculated as follows:

(12)

where is a temperature parameter which balances between exploration and exploitation. For each time , all the estimations for any player , and , are updated as follows;

(13)

with the learning rates and satisfying,

(14)
(15)
(16)

This process guarantees the convergence of the algorithm to an -CCE [pap:bennis12, jnl:qian12]. Our choice of the learning rates follows the format of with exponent .

At the beginning of each time instant , all BSs advertise their loads and select their actions based on their mixed-strategy probabilities, i.e. for all ,

(17)

where is the mapping from probability distribution to an action. Based on the the estimated load, UEs associate as per . All the BSs carry out the transmission based on their actions and calculate their utilities . Each BS individually updates its utility, regret, and load estimations along with the mixed strategy probabilities . The proposed algorithm is summarized in Algorithm 1.

1:  Input: and for and
2:  while  true  do
3:     
4:     Action selection: , (17)
5:     Load advertising: , (11)
6:     UE association: , (10)
7:     Calculations:
8:     Update utility and regret estimations, and probability:
9:         , (13)
10:  end while
Algorithm 1 Opportunistic Switching ON/OFF Algorithm

Iv Simulation Results

For our simulations, we consider a single cell covered by a macrocell BS with an arbitrary number of SBSs and UEs uniformly distributed over the area. All the BSs share the entire spectrum and thus, suffer co-channel interference. We conduct a series of simulations for various practical configurations and the presented results are averaged over a large number of runs. The parameters used for the simulations are summarized in Table I. Moreover, we compare our proposed approach with the conventional network operation referred to hereinafter as “classical approach” in which BSs do not have the capability to switch between sleep-wake states. For additional comparisons, the achievable lower bounds (the optimal cost-minimizing solution) are calculated using exhaustive search.

Parameter Value
Carrier frequency GHz
System bandwidth MHz
Thermal noise () dBm/Hz
Mean offered traffic 180 kbps
Maximum transmission powers: MBS, SBS dBm
Minimum distances
MBS – SBS, MBS – UE 75 m, 35m
SBS – SBS, SBS – UE 40 m, 10 m
Path loss models ( in km)
MBS - UE
SBS - UE
Learning
Boltzmann temperature () 10
Energy and load impacts on cost () 0.5, 0.5
learning rate exponents for
TABLE I: Simulation parameters.
Fig. 2: Variation of the cost per BS with respect to the number of SBSs. The number of UEs is fixed to .

Fig. 2 shows the average cost achieved per BS as the number of SBSs varies. The cost captures the tradeoff between load and energy consumption. As the number of BSs increases, the total energy consumption of the network increases. However, the load from a fixed number of UEs is distributed among the various BSs. Therefore, the energy required to handle the load decreases per BS resulting in a cost decrease per BS for all three approaches as seen in Fig. 2. In the proposed approach, the BSs switch to a sleep state when there are no UEs in their vicinity. Consequently, Fig. 2 shows that the proposed approach exhibits a considerable cost reduction compared to the classical model. IWe also see that, for a single SBS, the proposed approach exhibits a cost reduction of and it reaches up to , relative to the classical approach, with eight SBSs. Fig. 2 also shows that the difference in the average performance between the proposed approach and the optimal exhaustive search solution reaches about at SBSs. However, the optimal solution requires an exhaustive centralized search which yields significant overhead. Indeed, the gap between the exhaustive search and the proposed approach is a byproduct of the uncoordinated decision making processes and the selfish behavior of the players (BSs).

Fig. 3: Variation of the cost per BS as a function of the number of UEs. The number of BS is fixed to .

Fig. 3 shows the changes in the average cost per BS as the number of UEs varies. With the increasing number of UEs, the load in the system increases and the BSs consume more energy to serve their UEs. However, as seen in Fig 3, the proposed approach manages to reduce the cost by balancing the energy consumption and the handled load. Fig. 3 demonstrates that the proposed learning approach yields significant cost reductions of up to (for a network with 160 UEs), relative to the classical approach.

Fig. 4: The tradeoff between the load per BS and the energy consumption per BS for networks with 4 SBSs and 8 SBSs with various number of UEs.

In Fig. 4, we show the tradeoff between energy consumption and load for both proposed and classical approaches for networks with 4 and 8 SBSs with various number of UEs. Fig. 4 corroborates the intuition derived in (1)-(4) which showed that, at the expense of increasing delays, energy savings are possible at higher loads. Moreover, we can see that, for a given load, it can be observed that the proposed approach consumes less energy compared to the classical approach. The main reason is that the opportunistic ON/OFF algorithm switches off unnecessary BSs and thus saves a large portion of energy compared to the classical approach. As we increase the number of SBSs from four to eight, the UEs are distributed among the additional BSs, and thus, both energy consumption per BS and load per BS are reduced. Finally, Fig. 4 shows that these energy reductions reach up to for four SBSs and for 8 SBSs compared to the classical approach.

Fig. 5: Average percentage of active BSs as the network changes over time for two different cases of UEs departures/arrivals.

Fig. 5 shows how the proposed approach adapts to slowly varying network dynamics. Here, the network starts with a given number of UEs. After each 10 minutes, we evaluate the percentage of active BSs as the number of UEs changes. Here, we assume that each 10 minutes a maximum of 10 UEs will leave/join the network. We consider two cases with five changes as follows: Case 1) the simulation starts with 20 UEs. Every 10 minutes, an additional 10 UEs will enter the network. Case 2) the initial number of UEs is 80, and 10 UEs leave the network every 10 minutes. The results in Fig. 5 show that the proposed approach can activate additional BSs to handle the increased load (case 1) as well as deactivate the unwanted BSs to save energy (case 2) thus adapting to the changes in the network composition.

Fig. 6: The convergence time of the proposed algorithm as a function of the number of SBSs.

In Fig. 6, we show the convergence time of the proposed approach as the number of SBSs varies for 50 and 100 users. In this figure, we can see that, as the network size increases, the average number of iterations till convergence increases. Fig. 6 also shows that reducing the number of UEs leads to a faster convergence time. Although UEs are not players in the game, they affect load balancing among BSs for each action selection. As the number of UEs increases, the frequency of offloading UEs among BSs increases, and, thus, a longer convergence time is observed. Fig. 6 shows that the maximum average number of iterations reaches up to for a network with SBSs and UEs.

V Conclusions

In this paper, we have proposed a distributed learning mechanism using which small cell base stations opportunistically switch between active and sleep modes, depending on various network parameters. We have formulated the problem as a game in which the goal of each base station is to minimize the system cost which captures the energy and load expenditures. To solve the game, we have proposed a distributed algorithm using which the base stations choose their transmission modes with little additional overhead. Simulation results shows that the proposed learning approach yields significant gains, in terms of reducing energy consumption and overall cost in the network, when compared with conventional transmission techniques. The results also show that the proposed approach can successfully adapt to slow, periodic, and dynamic changes in the environment.

References

Comments 0
Request Comment
You are adding the first comment!
How to quickly get a good reply:
  • Give credit where it’s due by listing out the positive aspects of a paper before getting into which changes should be made.
  • Be specific in your critique, and provide supporting evidence with appropriate references to substantiate general statements.
  • Your comment should inspire ideas to flow and help the author improves the paper.

The better we are at sharing our knowledge with each other, the faster we move forward.
""
The feedback must be of minimum 40 characters and the title a minimum of 5 characters
   
Add comment
Cancel
Loading ...
20759
This is a comment super asjknd jkasnjk adsnkj
Upvote
Downvote
""
The feedback must be of minumum 40 characters
The feedback must be of minumum 40 characters
Submit
Cancel

You are asking your first question!
How to quickly get a good answer:
  • Keep your question short and to the point
  • Check for grammar or spelling errors.
  • Phrase it like a question
Test
Test description