# The Resource Mapping Algorithm of Wireless Virtualized Networks for Saving Energy in Ultradense Small Cells

Authors: Sai Zou; Fan Yang; Yulian Tang; Lei Xiao
Journal: Mobile Information Systems
 (2015)

---

## Abstract

As the current network is designed for peak loads, it results in insufficient resource utilization and energy waste. Virtualized technology makes it possible that intelligent energy perception network could be deployed and resource sharing could become an effective energy saving technology. How to make more small cells into sleeping state for energy saving in ultradense small cell system has become a research hot spot. Based on the mapping feature of virtualized network, a new wireless resource mapping algorithm for saving energy in ultradense small cells has been put forward when wireless resource amount is satisfied in every small cell. First of all, the method divides the virtual cells. Again through the alternate updating between small cell mapping and wireless resource allocation, least amount of small cells is used and other small cells turn into sleeping state on the premise of guaranteeing users’ QoS. Next, the energy consumption of the wireless access system, wireless resource utilization, and the convergence of the proposed algorithm are analyzed in theory. Finally, the simulation results demonstrate that the algorithm can effectively reduce the system energy consumption and required wireless resource amount under the condition of satisfying users’ QoS.


---

## Body

## 1. Introduction

With the rise of green network research, the problem of network energy consumption has become a research hot spot [1–3]. A large number of institutions have studied the network energy consumption, for example, the SMART2020 plan proposed by World Climate Group, North American’ Green NGI, and British’ Green Radio Cores. Most of these projects are applications of communication technology in other fields to reduce global carbon emissions without paying much attention to energy saving technology of mobile communication itself. The existing references point out that the fifth generation (5G) of mobile communication system is green, which indicates that the research on the wireless network for saving energy is of great significance [4].5G mobile communication system is expected to increase spectrum and energy efficiency at least 10 times and to increase throughput at least 25 times compared to 4G mobile communication system [5]. According to the Shannon theorem, in order to deal with the pressure of increasing capacity of future wireless network, the traditional solution is to increase the number of base stations and to reduce the size of base station coverage so as to achieve the goal of capacity growth. Obviously, this greatly increases the energy consumption of wireless access networks. 5G mobile communication system technology is mainly for ultradense network scenarios to manage the deployment of a large number of micro base stations [5]. In response to the capacity increase pressure in future, 5G mobile communication system has become the next battlefield where communications industry giants solve the problem of capacity increase [4, 5]. 5G mobile communication system technology mainly does not change or only changes partial current network structure and takes advantage of the function of the software to realize the dynamic management of the network. The existing wireless communication network system is mainly designed for area coverage and peak value. That only considers area coverage at the initial stage of deployment, but with the pass of time and the increase of village capacity, it is necessary to divide insufficient capacity of cells, which will make the wireless network topology random and multiply covered [6, 7]. A huge number of base stations mean high power consumption [7]. It has become the direction of the future communication industry and social development to conserve energy, to reduce emissions, and to develop a low-carbon society. Therefore, the research and implementation based on energy conservation as the goal of the new mobile communication network resource control technology are the priority of 5G mobile communication system.As the network system is designed for peak load, generally speaking the average load of the network is much lower than the busy load. Based on this, some scholars point out that when there are less active users, they can reduce the number of antenna configurations or sleep base stations directly to achieve the effect of energy saving [8–15]. When the base stations turn into sleeping state, the Quality of Experience of active users inside the cell will become worse. Some scholars put forward the idea that the collaboration of the wireless resource scheduling and the cooperative sleeping ways can be used to achieve energy saving [16–25]. As the base station is isolated and the allocation of wireless resources has been fixed at the beginning of the set, to realize information sharing between different base stations processing is required to establish a centralized controller or control pool of wireless resources, to achieve dynamic management of the small cells. Some scholars put forward the concept of virtualization in cloud platform, which can not only integrate network infrastructure resources, but also manage network effectively through the mapping technology of virtualized network [26–32]. How to use virtualized technology through a unified resource scheduling to meet the request of the demand and how to realize the capacity expansion of the whole network while at the same time saving network energy consumption have become the research focuses.Unlike previous views, on the basis of virtualization, resource mapping algorithm of virtualized network for energy saving in ultradense small cells has been put forward. On the premise of guaranteeing the coverage of the village and the processing capacity of the lower small cells, this algorithm maps resource mapping of baseband pool to the small cells of the approximately minimum number, while the small cells without resource mapping turn into a sleeping state so as to achieve energy saving effects. The contributions of this paper are in four aspects:(1)
Our proposed algorithm first considers the benefit-cost ratio of virtualized network mapping and the energy consumption of the system and then puts forward multiobjective decision-making model of virtualized network mapping in the wireless access network. This model can reduce the system energy consumption as much as possible, so as to maximize the mapping benefit-cost ratio approximately.(2)
On the basis of abovementioned model, two-stage mapping algorithm (TSMA) is proposed for the solution. In the first stage, the small cells of approximately minimum number are decided to cover relevant area to make sure that the need of any mobile terminal could be satisfied. In the second stage, wireless resources are mapped to guarantee that users’ QoS could be satisfied and wireless resources could be managed by small cells.(3)
Energy consumption of wireless access system, wireless resource utilization, and the convergence of the algorithm are analyzed in theory.(4)
At last, the simulation experiment of the energy consumption, the resource allocation, and the convergence of the algorithm are carried out.


## 2. Relevant Work

In this section, we review some existing power-saving protocols and virtualized technology.


### 2.1. Energy Saving Technology of Wireless Access Networks

#### 2.1.1. Energy Saving Methods by Reducing the Number of Active Stations

The methods of [8, 10, 15] prove that the sleeping method of base stations can be implemented in engineering. Sleeping model is put forward in [9]. Reference [11] proposes how to dynamically adjust the working status of base stations, depending on the predicted traffic loads. When the base stations have gone into the sleeping state, the communication quality of mobile terminals in sleeping base station will be affected. Reference [12] uses a stochastic geometry model to analyze the sleeping strategies of cellular networks. Reference [13] enlarges or shrinks its cell zooming according to the request of regional cells to achieve energy saving effect. Periodical sleep of the base stations is another method to achieve energy saving effects [14, 15]. It does monitor the base stations’ traffic loads, to judge sleep, but quite a long time is needed to start related equipment to change the base stations from sleeping state into working state, which significantly increases the packet delay.


#### 2.1.2. Discharging Capacity in the Heterogeneous Network

When the mobile terminal is in the area of Wi-Fi or of Access Point (AP), the mobile terminal communicates directly with the relevant signal source, not communicating with base stations, so as to save energy and reduce the traffic load of the base stations [16]. As the hardware of base stations is not sensitive to energy, it does not reduce the energy consumption of the base stations. Various sources aim at different traffic, so users’ QoS cannot be guaranteed through access to the nearest AP. Reference [17] chooses different networks to achieve the effect of energy saving according to back haul aware.


#### 2.1.3. To Achieve Energy Saving Effect through the Wireless Resource Configuration

Reference [18] rates energy effects and writes the scores to the corresponding resource block, so that mobile terminal can select the corresponding resource blocks to achieve energy saving effects. Reference [19] analyzes the spectrum effects and energy effects with random geometry. Reference [20] does achieve the effect of energy saving by association of downlink and uplink in C-RAN. Tang et al. have proposed a paradigm for energy efficiency (EE) and spectral efficiency (SE) tradeoff [21]. It is capable of exploiting the tradeoff between EE and SE by balancing consumption power and occupied bandwidth. Mobile terminal has multiple access networks. Each time before sending data to the network, channels of mobile terminal should be scanned, and high quality network data transmission should be chosen. Base stations that are not in the process of access will sleep, thus saving energy consumption [22]. Finally through the deployment of mobile base station [23], base stations cooperate [24] or coplan [25] to achieve energy saving effect.


### 2.2. Method of Virtualized Network Mapping

Virtualized network mapping is the process in which users’ virtualized network requests are reasonably mapped to the underlying physical network. The key problem of virtualized mapping is how to efficiently allocate physical network resources to meet the requests and how to maximize the physical network resource utilization on the premise of guaranteeing the physical node functions [26]. At present, most of algorithms of the virtualized network mapping are paid virtualized topology mapping [27]. Virtualized network mapping aiming at energy saving should minimize the physical network energy consumption on the premise of satisfying the current request [28]. Reference [29] proposes reconfigurable virtualized network to minimize energy consumption of the heuristic method. Su et al. put forward virtualized network mapping model of energy consumption and energy perception two-phase algorithm [30]. Wang et al. put forward mixed integer programming model of energy consumption and energy awareness of two-phase mapping algorithm [31]. Reference [32] in cloud data center application of ant colony optimization algorithm tries to solve energy saving virtualized network mapping. As the small cells of wireless access networks are of regional characteristics and the signal of wireless channels is not stable, the above references do research on core network virtualization mapping algorithm for minimizing energy consumption but were not suitable for wireless access networks. Zou et al. put forward resource allocation mechanism based on two-step mapping for saving energy in wireless network virtualization [33]. Reference [33] is the initial results of this work.


## 2.1. Energy Saving Technology of Wireless Access Networks

### 2.1.1. Energy Saving Methods by Reducing the Number of Active Stations

The methods of [8, 10, 15] prove that the sleeping method of base stations can be implemented in engineering. Sleeping model is put forward in [9]. Reference [11] proposes how to dynamically adjust the working status of base stations, depending on the predicted traffic loads. When the base stations have gone into the sleeping state, the communication quality of mobile terminals in sleeping base station will be affected. Reference [12] uses a stochastic geometry model to analyze the sleeping strategies of cellular networks. Reference [13] enlarges or shrinks its cell zooming according to the request of regional cells to achieve energy saving effect. Periodical sleep of the base stations is another method to achieve energy saving effects [14, 15]. It does monitor the base stations’ traffic loads, to judge sleep, but quite a long time is needed to start related equipment to change the base stations from sleeping state into working state, which significantly increases the packet delay.


### 2.1.2. Discharging Capacity in the Heterogeneous Network

When the mobile terminal is in the area of Wi-Fi or of Access Point (AP), the mobile terminal communicates directly with the relevant signal source, not communicating with base stations, so as to save energy and reduce the traffic load of the base stations [16]. As the hardware of base stations is not sensitive to energy, it does not reduce the energy consumption of the base stations. Various sources aim at different traffic, so users’ QoS cannot be guaranteed through access to the nearest AP. Reference [17] chooses different networks to achieve the effect of energy saving according to back haul aware.


### 2.1.3. To Achieve Energy Saving Effect through the Wireless Resource Configuration

Reference [18] rates energy effects and writes the scores to the corresponding resource block, so that mobile terminal can select the corresponding resource blocks to achieve energy saving effects. Reference [19] analyzes the spectrum effects and energy effects with random geometry. Reference [20] does achieve the effect of energy saving by association of downlink and uplink in C-RAN. Tang et al. have proposed a paradigm for energy efficiency (EE) and spectral efficiency (SE) tradeoff [21]. It is capable of exploiting the tradeoff between EE and SE by balancing consumption power and occupied bandwidth. Mobile terminal has multiple access networks. Each time before sending data to the network, channels of mobile terminal should be scanned, and high quality network data transmission should be chosen. Base stations that are not in the process of access will sleep, thus saving energy consumption [22]. Finally through the deployment of mobile base station [23], base stations cooperate [24] or coplan [25] to achieve energy saving effect.


## 2.1.1. Energy Saving Methods by Reducing the Number of Active Stations

The methods of [8, 10, 15] prove that the sleeping method of base stations can be implemented in engineering. Sleeping model is put forward in [9]. Reference [11] proposes how to dynamically adjust the working status of base stations, depending on the predicted traffic loads. When the base stations have gone into the sleeping state, the communication quality of mobile terminals in sleeping base station will be affected. Reference [12] uses a stochastic geometry model to analyze the sleeping strategies of cellular networks. Reference [13] enlarges or shrinks its cell zooming according to the request of regional cells to achieve energy saving effect. Periodical sleep of the base stations is another method to achieve energy saving effects [14, 15]. It does monitor the base stations’ traffic loads, to judge sleep, but quite a long time is needed to start related equipment to change the base stations from sleeping state into working state, which significantly increases the packet delay.


## 2.1.2. Discharging Capacity in the Heterogeneous Network

When the mobile terminal is in the area of Wi-Fi or of Access Point (AP), the mobile terminal communicates directly with the relevant signal source, not communicating with base stations, so as to save energy and reduce the traffic load of the base stations [16]. As the hardware of base stations is not sensitive to energy, it does not reduce the energy consumption of the base stations. Various sources aim at different traffic, so users’ QoS cannot be guaranteed through access to the nearest AP. Reference [17] chooses different networks to achieve the effect of energy saving according to back haul aware.


## 2.1.3. To Achieve Energy Saving Effect through the Wireless Resource Configuration

Reference [18] rates energy effects and writes the scores to the corresponding resource block, so that mobile terminal can select the corresponding resource blocks to achieve energy saving effects. Reference [19] analyzes the spectrum effects and energy effects with random geometry. Reference [20] does achieve the effect of energy saving by association of downlink and uplink in C-RAN. Tang et al. have proposed a paradigm for energy efficiency (EE) and spectral efficiency (SE) tradeoff [21]. It is capable of exploiting the tradeoff between EE and SE by balancing consumption power and occupied bandwidth. Mobile terminal has multiple access networks. Each time before sending data to the network, channels of mobile terminal should be scanned, and high quality network data transmission should be chosen. Base stations that are not in the process of access will sleep, thus saving energy consumption [22]. Finally through the deployment of mobile base station [23], base stations cooperate [24] or coplan [25] to achieve energy saving effect.


## 2.2. Method of Virtualized Network Mapping

Virtualized network mapping is the process in which users’ virtualized network requests are reasonably mapped to the underlying physical network. The key problem of virtualized mapping is how to efficiently allocate physical network resources to meet the requests and how to maximize the physical network resource utilization on the premise of guaranteeing the physical node functions [26]. At present, most of algorithms of the virtualized network mapping are paid virtualized topology mapping [27]. Virtualized network mapping aiming at energy saving should minimize the physical network energy consumption on the premise of satisfying the current request [28]. Reference [29] proposes reconfigurable virtualized network to minimize energy consumption of the heuristic method. Su et al. put forward virtualized network mapping model of energy consumption and energy perception two-phase algorithm [30]. Wang et al. put forward mixed integer programming model of energy consumption and energy awareness of two-phase mapping algorithm [31]. Reference [32] in cloud data center application of ant colony optimization algorithm tries to solve energy saving virtualized network mapping. As the small cells of wireless access networks are of regional characteristics and the signal of wireless channels is not stable, the above references do research on core network virtualization mapping algorithm for minimizing energy consumption but were not suitable for wireless access networks. Zou et al. put forward resource allocation mechanism based on two-step mapping for saving energy in wireless network virtualization [33]. Reference [33] is the initial results of this work.


## 3. System Model

### 3.1. Network Topology and Configuration

AreaG is a scenario of the ultradense network. In a certain time period T, there are small cells and mobile terminals to communicate. BS=bs1,…,bsm is a set of  small cells. bsi is a small cell. bsisH and bsicH, respectively, represent maximum coverage area and maximum wireless resource processing capacity of small cell bsi, i∈{1,…,m}. r represents the coverage radius of small cell and the length of the diagonal grid. All small cells share a wireless resources pool. The resources pool allocates wireless resources to each small cell in a unified way. Each small cell is connected to the resources pool by cable, as shown in Figure 1.Figure 1
Scene graph.Assume that the wireless resources to be allocated in the resources pool are abundant, and there is no need to worry about spectrum spatial reuse in the areaG. The wireless resource amount of dealing with the access information of these mobile terminals is the actual request amount of area G. In any place positioni of area G, there at least exists a small cell which deals with the access of the mobile terminal, as shown in formula (1). At any place positioni during the time T, the possibility of the emergence of mobile terminal is the same and the number of mobile terminals in each area is different. Consider(1)∃positioni∈∑j=1mbsjsH∀positioni∈G.


### 3.2. Mapping Rules

Mapping aims at making most of small cells into sleeping state and fulfilling the coverage of areaG and providing required wireless resources with minimum small cells. On the basis of the rules of virtualized network the whole process is divided into two steps: the obtainment of virtualized requests and mapping of virtualized wireless resources.Virtualized requests are the actual needed wireless resources of areaG. The obtaining process is as follows.The areaG is divided into a×b square grids. The length of diagonal line of the square grid equals the coverage radius r of small cell. SG=sg1,1,…,sga,b stands for the set of grid areas. sgi,j stands for the grid of the ith row and jth line. sgi,js stands for the area of sgi,j and the constrained relationship is as formula (2), i∈{1,…,a}, j∈{1,…,b}, k∈{1,…,m}. Consider(2)∀sgi,js<bsksH.The needed wireless resource amount of each grid area will be counted andsgi,jr stands for the needed amount of wireless resources.Virtual cell means the overlapping area of each grid area and coverage area of active small cells, noted byvibsj. vi stands for the grid area sgg,h, i=(g-1)×b+h. bsj stands for the jth small cell. vibsjs and vibsjr, respectively, stand for the coverage area and needed wireless resource amount of virtual cell vibsj.As the radio signal of small cells is of multicoverage for areaG, there exists the constrained condition of formula (3):(3)∑i=1,j=1a,bsgi,js≪∑k=1mbsksH.Virtualized network resource mapping is to allocate the wireless resources of the resources pool to each small cell to satisfy the resource needs of each grid area. It is divided into two stages. First is small cell mapping. With minimum small cells, the whole virtual cells will be covered and it is guaranteed that the requests of mobile terminals from any place in areaG can be satisfied. And then it is resource mapping. The wireless resources of the resources pool will be mapped into one or more small cells to make sure that all the requests from each virtual cell could be satisfied and the mapping resource amount of each small cell is not beyond the processing capacity. The process of virtualized network resource mapping is described in mathematical language as shown in formula (4)–(6). Formula (4) says that the obtained wireless resources of each small cell should be less than or equal to the maximum processing capacity and bsica stands for the obtained wireless resources of each small cell, i∈{1,…,m}. Formula (5) says that the obtained wireless resources of each small cell should be more than or equal to the resource request of grid areas. Formula (6) is the completion of formula (4). Consider(4)bsica≤bsicH,(5)∑i=1,j=1a,bsgi,jr≤∑k=1mbskca,(6)∑i=1mbsica≤∑i=1mbsicH.The small cell and virtual cell have regional characteristics. Any small cell can only handle the information of the virtual cell within the scope of its coverage, so there exist constrained relationship of virtual cell as shown in (7) and a constrained relationship of small cells as shown in (8). vibsjBSk is a set which is the overlapping area of each small cell and the virtual cell vibsj. ViBSjbsk is a set which is the overlapping area of each virtual cell and the small cell bsk. Consider(7)ifvibsjs∩bsksH≠ϕthenvibsjBSk=vibsjBSk∪bsk(8)ifvibsjs∩bsksH≠ϕthenViBSjbsk=vibsj∪ViBSjbsk.


### 3.3. The Underlying Network Energy Consumption

The underlying network energy consumption mainly includes two parts of fixed and dynamic energy consumption of transceiving data. The energy consumption of small cell is shown in(9)Ei=Tpbsidle+Eit+r,Active,Tpbssleep,Sleep.p
b
s
idle is the energy consumption of the small cell in the idle state. Because the control equipment is not sensitive to energy, there exists the idle state consumption [16]. Eit+r is energy consumption when the small cell i is transceiving data, i∈{1,…,m}, whose calculation is shown in(10)Eit+r=∑j=1bsicaμi,tpi,jt+μi,rpi,jr.μ
i
,
t is the amount of transmitting data. pi,jt is energy consumption when the jth wireless resource of the ith small cell transmits unit data. μi,r is the amount of receiving data. pi,jr is constant and is the energy consumption when the jth wireless resource of the ith small cell receives unit data. pbssleep is energy consumption when the small cell i goes into sleeping state. The energy consumption of the whole area is shown in(11)Etotal=∑i=1mEi.


### 3.4. Multiobjective Decision-Making Model for Resource Mapping

Virtualized resource mapping should realize the aim of saving energy, under the premise of maximizing the benefit-cost ratio. To maximize the benefit-cost ratio and minimize the energy consumption, multiobjective decision-making model is used to achieve virtualized resource mapping.∑i=1mTEiidle+Eit′+r′ is the energy consumption of existing method. ∑i=1,j=1a,bsgi,jr-∑k=1mbskca is the absolute value of the requested wireless resources of virtual cell minus the actual allocation of wireless resources. (∑k=1m[Tpbsidle+Ekt′+r′]-Etotal)/∑i=1,j=1a,bsgi,jr-∑i=kmbskca is the benefit-cost ratio. To sum up, multiobjective decision-making model of virtualized network mapping in wireless access network is shown in(12)objmin⁡Etotalmax⁡∑k=1mTpbsidle+Ekt′+r′-Etotal∑i=1,j=1a,bsgi,jr-∑k=1mbskcas.t.sgi,js<bsksH∃positioni∈∑k=1mbsksH∀positioni∈G,∑i=1,j=1a,bsgi,js≪∑k=1mbsksHbskca≤bskcH∑i=1,j=1a,bsgi,jr≤∑k=1mbskca∑k=1mbskca≤∑k=1mbskcHifvxbsys∩bsksH≠ϕthenvxbsyBSk=vxbsyBSk∪bskifvxbsys∩bsksH≠ϕthenVxBSybsk=vxbsy∪VxBSybsk.


## 3.1. Network Topology and Configuration

AreaG is a scenario of the ultradense network. In a certain time period T, there are small cells and mobile terminals to communicate. BS=bs1,…,bsm is a set of  small cells. bsi is a small cell. bsisH and bsicH, respectively, represent maximum coverage area and maximum wireless resource processing capacity of small cell bsi, i∈{1,…,m}. r represents the coverage radius of small cell and the length of the diagonal grid. All small cells share a wireless resources pool. The resources pool allocates wireless resources to each small cell in a unified way. Each small cell is connected to the resources pool by cable, as shown in Figure 1.Figure 1
Scene graph.Assume that the wireless resources to be allocated in the resources pool are abundant, and there is no need to worry about spectrum spatial reuse in the areaG. The wireless resource amount of dealing with the access information of these mobile terminals is the actual request amount of area G. In any place positioni of area G, there at least exists a small cell which deals with the access of the mobile terminal, as shown in formula (1). At any place positioni during the time T, the possibility of the emergence of mobile terminal is the same and the number of mobile terminals in each area is different. Consider(1)∃positioni∈∑j=1mbsjsH∀positioni∈G.


## 3.2. Mapping Rules

Mapping aims at making most of small cells into sleeping state and fulfilling the coverage of areaG and providing required wireless resources with minimum small cells. On the basis of the rules of virtualized network the whole process is divided into two steps: the obtainment of virtualized requests and mapping of virtualized wireless resources.Virtualized requests are the actual needed wireless resources of areaG. The obtaining process is as follows.The areaG is divided into a×b square grids. The length of diagonal line of the square grid equals the coverage radius r of small cell. SG=sg1,1,…,sga,b stands for the set of grid areas. sgi,j stands for the grid of the ith row and jth line. sgi,js stands for the area of sgi,j and the constrained relationship is as formula (2), i∈{1,…,a}, j∈{1,…,b}, k∈{1,…,m}. Consider(2)∀sgi,js<bsksH.The needed wireless resource amount of each grid area will be counted andsgi,jr stands for the needed amount of wireless resources.Virtual cell means the overlapping area of each grid area and coverage area of active small cells, noted byvibsj. vi stands for the grid area sgg,h, i=(g-1)×b+h. bsj stands for the jth small cell. vibsjs and vibsjr, respectively, stand for the coverage area and needed wireless resource amount of virtual cell vibsj.As the radio signal of small cells is of multicoverage for areaG, there exists the constrained condition of formula (3):(3)∑i=1,j=1a,bsgi,js≪∑k=1mbsksH.Virtualized network resource mapping is to allocate the wireless resources of the resources pool to each small cell to satisfy the resource needs of each grid area. It is divided into two stages. First is small cell mapping. With minimum small cells, the whole virtual cells will be covered and it is guaranteed that the requests of mobile terminals from any place in areaG can be satisfied. And then it is resource mapping. The wireless resources of the resources pool will be mapped into one or more small cells to make sure that all the requests from each virtual cell could be satisfied and the mapping resource amount of each small cell is not beyond the processing capacity. The process of virtualized network resource mapping is described in mathematical language as shown in formula (4)–(6). Formula (4) says that the obtained wireless resources of each small cell should be less than or equal to the maximum processing capacity and bsica stands for the obtained wireless resources of each small cell, i∈{1,…,m}. Formula (5) says that the obtained wireless resources of each small cell should be more than or equal to the resource request of grid areas. Formula (6) is the completion of formula (4). Consider(4)bsica≤bsicH,(5)∑i=1,j=1a,bsgi,jr≤∑k=1mbskca,(6)∑i=1mbsica≤∑i=1mbsicH.The small cell and virtual cell have regional characteristics. Any small cell can only handle the information of the virtual cell within the scope of its coverage, so there exist constrained relationship of virtual cell as shown in (7) and a constrained relationship of small cells as shown in (8). vibsjBSk is a set which is the overlapping area of each small cell and the virtual cell vibsj. ViBSjbsk is a set which is the overlapping area of each virtual cell and the small cell bsk. Consider(7)ifvibsjs∩bsksH≠ϕthenvibsjBSk=vibsjBSk∪bsk(8)ifvibsjs∩bsksH≠ϕthenViBSjbsk=vibsj∪ViBSjbsk.


## 3.3. The Underlying Network Energy Consumption

The underlying network energy consumption mainly includes two parts of fixed and dynamic energy consumption of transceiving data. The energy consumption of small cell is shown in(9)Ei=Tpbsidle+Eit+r,Active,Tpbssleep,Sleep.p
b
s
idle is the energy consumption of the small cell in the idle state. Because the control equipment is not sensitive to energy, there exists the idle state consumption [16]. Eit+r is energy consumption when the small cell i is transceiving data, i∈{1,…,m}, whose calculation is shown in(10)Eit+r=∑j=1bsicaμi,tpi,jt+μi,rpi,jr.μ
i
,
t is the amount of transmitting data. pi,jt is energy consumption when the jth wireless resource of the ith small cell transmits unit data. μi,r is the amount of receiving data. pi,jr is constant and is the energy consumption when the jth wireless resource of the ith small cell receives unit data. pbssleep is energy consumption when the small cell i goes into sleeping state. The energy consumption of the whole area is shown in(11)Etotal=∑i=1mEi.


## 3.4. Multiobjective Decision-Making Model for Resource Mapping

Virtualized resource mapping should realize the aim of saving energy, under the premise of maximizing the benefit-cost ratio. To maximize the benefit-cost ratio and minimize the energy consumption, multiobjective decision-making model is used to achieve virtualized resource mapping.∑i=1mTEiidle+Eit′+r′ is the energy consumption of existing method. ∑i=1,j=1a,bsgi,jr-∑k=1mbskca is the absolute value of the requested wireless resources of virtual cell minus the actual allocation of wireless resources. (∑k=1m[Tpbsidle+Ekt′+r′]-Etotal)/∑i=1,j=1a,bsgi,jr-∑i=kmbskca is the benefit-cost ratio. To sum up, multiobjective decision-making model of virtualized network mapping in wireless access network is shown in(12)objmin⁡Etotalmax⁡∑k=1mTpbsidle+Ekt′+r′-Etotal∑i=1,j=1a,bsgi,jr-∑k=1mbskcas.t.sgi,js<bsksH∃positioni∈∑k=1mbsksH∀positioni∈G,∑i=1,j=1a,bsgi,js≪∑k=1mbsksHbskca≤bskcH∑i=1,j=1a,bsgi,jr≤∑k=1mbskca∑k=1mbskca≤∑k=1mbskcHifvxbsys∩bsksH≠ϕthenvxbsyBSk=vxbsyBSk∪bskifvxbsys∩bsksH≠ϕthenVxBSybsk=vxbsy∪VxBSybsk.


## 4. Two-Stage Mapping Algorithm

### 4.1. The Approximate Minimum Cover Set Mapping of Small Cells

To construct Minimum Cover Set (MCS) of a target area is a problem of NP hard [34]; therefore, it has to be counted approximately. Reference [35] presents a distributed approximate algorithm in the sensor networks based on grid partition of Voronoi. Reference [35] can be reference in this paper. Small cell approximate minimum cover mapping algorithm is as follows.Step 1.
If small cellbsk is deployed on one vertex of square grid gi,j, then bsk is active and other small cells are sleeping in square grid which is one vertex under bsk, i∈{1,…,a}, j∈{1,…,b}, k∈{1,…,m}, as shown in Figure 2.
It is shown thatbs1 is active from Figure 2.Figure 2
The conditions of small cells on vertex of square grid.Step 2.
For anybsk deployed in area G, assume that bsk is active and deployed on one vertex of sgi,j. If there are bsc and bsd which are active in all the X-neighboring vertex, and |bsc-bsd|≤2r, c>k>d, then bsk is in the sleeping state, i∈{1,…,a}, j∈{1,…,b}, {k,c,d}⊆{1,…,m}.Step 3.
For anybsk deployed in area G, assume that bsk is active and deployed on one vertex of sgi,j. If there are bse and bsf which are active in all the Y-neighboring vertex and |bse-bsf|≤2r, e>k>f, and bsk is not bsc or bsd in Step 2, then bsk is in the sleeping state, i∈{1,…,a}, j∈{1,…,b}, {k,c,d,e,f}⊆{1,…,m}.After the transformation of Steps2 and 3, we find that bs2, bs6, bs8, bs10, and bs13 are sleeping. The specific conditions are as Figure 3.Figure 3
The conditions of small cells after Steps  1–3.Step 4.
Ifsmall cellbsk is deployed on one edge of the square grid sgi,j, assume that there are not active small cells on vertex of the square grid sgi,j, and bsk’s number is the smallest on the edge; then bsk is active and other small cells are sleeping in square grid: i∈{1,…,a}, j∈{1,…,b}, and k∈{1,…,m}, as shown in Figure 4.Figure 4
The conditions of small cells on edge of square grid.It is shown thatbs2 is active from Figure 4.Step 5.
For anybsk deployed in area G, assume that bsk is active and deployed on one edge of sgi,j. If there are bsc and bsd which are active in all the X-neighboring edge and |bsc-bsd|≤2r, c>k>d, then bsk is in the sleeping state, i∈{1,…,a}, j∈{1,…,b}, {k,c,d}⊆{1,…,m}.Step 6.
For anybsk deployed in area G, assume that bsk is deployed on one line of sgi,j and is active in area G. If there are bse and bsf which are active in all the Y-neighboring edge and |bse-bsf|≤2r, e>k>f, and bsk is not bsc or bsd in Step5, then bsk is in the sleeping condition, i∈{1,…,a}, j∈{1,…,b}, {k,c,d,e,f}⊆{1,…,m}.Step 7.
For anybsk deployed in sgi,j of G, assume that sgi,j is the grid with no adjacent points and lines and all of bsk’s neighboring bs are not active, if bsk is the most close to the center position and bsk’s number is the smallest in sgi,j, then bsk is active and other bs are sleeping in sgi,j, i∈{1,…,a}, j∈{1,…,b}, k∈{1,…,m}.Step 8.
When there are nobs in sgi,j of area G, bs which get to that sgi,j’s side with distance r are active. If bsc and bsd are neighboring, and bsc to sgi,j’s distance is greater than  or equal to bsd to sgi,j’s distance, then bsc turn to sleep. If bsc and bsd are in grid sgi±1,j±1 and bsc to sgi,j’s distance is greater  than  or equal to bsd to sgi,j’s distance, then bsi is sleeping. If bsc and bsd exist in the same grid sgi±1,j or sgi,j±1 or sgi±1,j±1 and bsc is a result of Step7, then bsc is sleeping, i∈{1,…,a}, j∈{1,…,b}, {k,c,d}⊆{1,…,m}.Previous Steps1 to 8 are aiming at assuring that G can be completely covered and that active small cells set bsactive can construe an approximate minimal cover set of area G.


### 4.2. Resource Mapping

#### 4.2.1. The Calculation of the Wireless Resource Amount of Virtual Cells

The required wireless resources of virtual cells should be calculated by following steps.Step 1.
Assume that the possibility of the emergency of the mobile terminals in grid area is all the same in any random place, so the required wireless resources of virtual cells are related to the area of virtual cells, as shown in formula (13), i=(g-1)×b+h, j∈{1,…,m}. Consider(13)vibsjs=sgg,hs∩bsjs.Step 2.
The area of virtual cell to the area of grid area multiplied by the needed wireless resource amount of grid area is equal to required resource amount of virtual cell as shown in formula (14):(14)vibsjr=vibsjssgg,hssgg,hr.Step 3.
In order to guarantee the completion of the coverage in areaG there exists multioverlapping area, as shown in the shadow of Figure 5. In order to reduce the number of allocated wireless resources (to maximize benefit-cost ratio in multiobjective optimization), the requirement of resource in area G whole area will be optimized by (15), {k,j}⊆{1,…,m}. One has (15)setvibskr=0,∀vibsks∈vibsjs,vi∈sgg,h.Figure 5
Overlapping cover area.Step 4.
For the convenience of management all virtual cells are ordered from large to small based on virtual cell’s size. Combine formula (7), and then the set of virtual cells grouped by grid area is established.


#### 4.2.2. Resource Allocation

Step 1.
Based on wireless resource quantization and the constrained relationship of small cells shown in formula (8), we rank the wireless resource demand of virtual cells from large to small and get the resource sets of virtual cells corresponding to small cells.Step 2 (primary allocation of wireless resources).
Centered on the small cell, related virtual cells’ wireless resource requirements are, respectively, added and are judged according to whether they reach upper limit of small cell wireless resource. If it is not reached, then the wireless resources in pool are mapped into the relevant small cells directly, else waiting for the second allocation. Wireless resources primary allocation algorithm is shown in Algorithm1.Algorithm 1:Wireless resources primary allocation algorithm.
(1) for(bsi=1active;bsiactive∈bsactive;i++)
(2)for (vj=1bsi;vjbsi∈VjBSibsi;j++)
(3)if [(bsica+vjbsir)≤bsicH] then
(4)bsica=bsica+vjbsir
(5)else vjbsir→vjbsifreerStep 3.
If the wireless resource allocation of active small cells does not reach the upper limit, the wireless resources will be allocated once again among the active small cells for reducing the number of the active small cells, whose process is shown in Algorithm2.Algorithm 2:Wireless resource allocation algorithm in active small cells.
(1) for(bsi=1active;bsiactive∈bsactive;i++)
(2)for vj=1bsifreer;vjbsi∈VjBSibsi;j++
(3)if bsica≤bsich and vjbsifreer∈∗bsiactiver then
(4) ifbsica+vjbsifreer≤bsicH then
(5)bsica=bsica+vjbsifreer
(6) vjbsifreer→vjbsir
(7) else
(8)vjbsifreer=vjbsifreer-bsicH-bsica
(9)bsica=bsicHStep 4.
If there is a need to do secondary allocation it means that the current active small cells could not manage the requirements of relevant virtual cells and hence small cells need to be added. That is, more small cells need to be woken from sleeping, as shown in Algorithm3.
The small cells can be started to undertake the task of wireless resource processing until the wireless resource demand of virtual cells has been satisfied or until there are no sleeping small cells, whose realization process algorithm is shown in Algorithm4.Algorithm 3:The algorithm of waking up sleeping small cells.
input:wakeupbs(bsksleep,vjbsifreer)
(1)bsksleep→bskactive
(2)bskca=bskca+vjbsifreer
(3)vjbsifreer→vjbsir
(4)for (vx=1bsk;vxbsk∈VxBSkbsk;x++)
(5)if (vxbskfreer) then
(6)if [(bskca+vxbskfreer)≤bskcH] then
(7)bskca=bskca+vxbskfreer
(8)  else
(9)vxbskfreer=vxbskfreer-(bskcH-bskca)
(10)bskca=bskcHAlgorithm 4:Wireless resources secondary allocation algorithm.
input:secondaryallocation(vjbsifreer)
(1)for (bsk=1sleep;bsksleep∈vjbsiBSk;k++)
(2) if(vjbsis∈vjbsksleeps) then
(3)wakeupbs(bsksleep,vjbsifreer)
(4) else
(5)max⁡s=max⁡(vjbsis∩vjbs∗sleeps)
(6)wakeupbs(bsmax⁡ssleep,max⁡s)
(7)vjbsifreer=vjbsis-max⁡s
(8)secondayallocation(vjbsifreer)Step 5.
If there are no allocated wireless resources to active small cells, small cells turn into sleeping state, whose realization process is shown in Algorithm5.Algorithm 5:Algorithm of turning active small cells into sleeping state.
(1) for(bsi=1active;bsiactive∈bsactive;i++)
(2)if (bsica=0) then
(3)bsiactive→bsisleep


## 4.1. The Approximate Minimum Cover Set Mapping of Small Cells

To construct Minimum Cover Set (MCS) of a target area is a problem of NP hard [34]; therefore, it has to be counted approximately. Reference [35] presents a distributed approximate algorithm in the sensor networks based on grid partition of Voronoi. Reference [35] can be reference in this paper. Small cell approximate minimum cover mapping algorithm is as follows.Step 1.
If small cellbsk is deployed on one vertex of square grid gi,j, then bsk is active and other small cells are sleeping in square grid which is one vertex under bsk, i∈{1,…,a}, j∈{1,…,b}, k∈{1,…,m}, as shown in Figure 2.
It is shown thatbs1 is active from Figure 2.Figure 2
The conditions of small cells on vertex of square grid.Step 2.
For anybsk deployed in area G, assume that bsk is active and deployed on one vertex of sgi,j. If there are bsc and bsd which are active in all the X-neighboring vertex, and |bsc-bsd|≤2r, c>k>d, then bsk is in the sleeping state, i∈{1,…,a}, j∈{1,…,b}, {k,c,d}⊆{1,…,m}.Step 3.
For anybsk deployed in area G, assume that bsk is active and deployed on one vertex of sgi,j. If there are bse and bsf which are active in all the Y-neighboring vertex and |bse-bsf|≤2r, e>k>f, and bsk is not bsc or bsd in Step 2, then bsk is in the sleeping state, i∈{1,…,a}, j∈{1,…,b}, {k,c,d,e,f}⊆{1,…,m}.After the transformation of Steps2 and 3, we find that bs2, bs6, bs8, bs10, and bs13 are sleeping. The specific conditions are as Figure 3.Figure 3
The conditions of small cells after Steps  1–3.Step 4.
Ifsmall cellbsk is deployed on one edge of the square grid sgi,j, assume that there are not active small cells on vertex of the square grid sgi,j, and bsk’s number is the smallest on the edge; then bsk is active and other small cells are sleeping in square grid: i∈{1,…,a}, j∈{1,…,b}, and k∈{1,…,m}, as shown in Figure 4.Figure 4
The conditions of small cells on edge of square grid.It is shown thatbs2 is active from Figure 4.Step 5.
For anybsk deployed in area G, assume that bsk is active and deployed on one edge of sgi,j. If there are bsc and bsd which are active in all the X-neighboring edge and |bsc-bsd|≤2r, c>k>d, then bsk is in the sleeping state, i∈{1,…,a}, j∈{1,…,b}, {k,c,d}⊆{1,…,m}.Step 6.
For anybsk deployed in area G, assume that bsk is deployed on one line of sgi,j and is active in area G. If there are bse and bsf which are active in all the Y-neighboring edge and |bse-bsf|≤2r, e>k>f, and bsk is not bsc or bsd in Step5, then bsk is in the sleeping condition, i∈{1,…,a}, j∈{1,…,b}, {k,c,d,e,f}⊆{1,…,m}.Step 7.
For anybsk deployed in sgi,j of G, assume that sgi,j is the grid with no adjacent points and lines and all of bsk’s neighboring bs are not active, if bsk is the most close to the center position and bsk’s number is the smallest in sgi,j, then bsk is active and other bs are sleeping in sgi,j, i∈{1,…,a}, j∈{1,…,b}, k∈{1,…,m}.Step 8.
When there are nobs in sgi,j of area G, bs which get to that sgi,j’s side with distance r are active. If bsc and bsd are neighboring, and bsc to sgi,j’s distance is greater than  or equal to bsd to sgi,j’s distance, then bsc turn to sleep. If bsc and bsd are in grid sgi±1,j±1 and bsc to sgi,j’s distance is greater  than  or equal to bsd to sgi,j’s distance, then bsi is sleeping. If bsc and bsd exist in the same grid sgi±1,j or sgi,j±1 or sgi±1,j±1 and bsc is a result of Step7, then bsc is sleeping, i∈{1,…,a}, j∈{1,…,b}, {k,c,d}⊆{1,…,m}.Previous Steps1 to 8 are aiming at assuring that G can be completely covered and that active small cells set bsactive can construe an approximate minimal cover set of area G.


## 4.2. Resource Mapping

### 4.2.1. The Calculation of the Wireless Resource Amount of Virtual Cells

The required wireless resources of virtual cells should be calculated by following steps.Step 1.
Assume that the possibility of the emergency of the mobile terminals in grid area is all the same in any random place, so the required wireless resources of virtual cells are related to the area of virtual cells, as shown in formula (13), i=(g-1)×b+h, j∈{1,…,m}. Consider(13)vibsjs=sgg,hs∩bsjs.Step 2.
The area of virtual cell to the area of grid area multiplied by the needed wireless resource amount of grid area is equal to required resource amount of virtual cell as shown in formula (14):(14)vibsjr=vibsjssgg,hssgg,hr.Step 3.
In order to guarantee the completion of the coverage in areaG there exists multioverlapping area, as shown in the shadow of Figure 5. In order to reduce the number of allocated wireless resources (to maximize benefit-cost ratio in multiobjective optimization), the requirement of resource in area G whole area will be optimized by (15), {k,j}⊆{1,…,m}. One has (15)setvibskr=0,∀vibsks∈vibsjs,vi∈sgg,h.Figure 5
Overlapping cover area.Step 4.
For the convenience of management all virtual cells are ordered from large to small based on virtual cell’s size. Combine formula (7), and then the set of virtual cells grouped by grid area is established.


### 4.2.2. Resource Allocation

Step 1.
Based on wireless resource quantization and the constrained relationship of small cells shown in formula (8), we rank the wireless resource demand of virtual cells from large to small and get the resource sets of virtual cells corresponding to small cells.Step 2 (primary allocation of wireless resources).
Centered on the small cell, related virtual cells’ wireless resource requirements are, respectively, added and are judged according to whether they reach upper limit of small cell wireless resource. If it is not reached, then the wireless resources in pool are mapped into the relevant small cells directly, else waiting for the second allocation. Wireless resources primary allocation algorithm is shown in Algorithm1.Algorithm 1:Wireless resources primary allocation algorithm.
(1) for(bsi=1active;bsiactive∈bsactive;i++)
(2)for (vj=1bsi;vjbsi∈VjBSibsi;j++)
(3)if [(bsica+vjbsir)≤bsicH] then
(4)bsica=bsica+vjbsir
(5)else vjbsir→vjbsifreerStep 3.
If the wireless resource allocation of active small cells does not reach the upper limit, the wireless resources will be allocated once again among the active small cells for reducing the number of the active small cells, whose process is shown in Algorithm2.Algorithm 2:Wireless resource allocation algorithm in active small cells.
(1) for(bsi=1active;bsiactive∈bsactive;i++)
(2)for vj=1bsifreer;vjbsi∈VjBSibsi;j++
(3)if bsica≤bsich and vjbsifreer∈∗bsiactiver then
(4) ifbsica+vjbsifreer≤bsicH then
(5)bsica=bsica+vjbsifreer
(6) vjbsifreer→vjbsir
(7) else
(8)vjbsifreer=vjbsifreer-bsicH-bsica
(9)bsica=bsicHStep 4.
If there is a need to do secondary allocation it means that the current active small cells could not manage the requirements of relevant virtual cells and hence small cells need to be added. That is, more small cells need to be woken from sleeping, as shown in Algorithm3.
The small cells can be started to undertake the task of wireless resource processing until the wireless resource demand of virtual cells has been satisfied or until there are no sleeping small cells, whose realization process algorithm is shown in Algorithm4.Algorithm 3:The algorithm of waking up sleeping small cells.
input:wakeupbs(bsksleep,vjbsifreer)
(1)bsksleep→bskactive
(2)bskca=bskca+vjbsifreer
(3)vjbsifreer→vjbsir
(4)for (vx=1bsk;vxbsk∈VxBSkbsk;x++)
(5)if (vxbskfreer) then
(6)if [(bskca+vxbskfreer)≤bskcH] then
(7)bskca=bskca+vxbskfreer
(8)  else
(9)vxbskfreer=vxbskfreer-(bskcH-bskca)
(10)bskca=bskcHAlgorithm 4:Wireless resources secondary allocation algorithm.
input:secondaryallocation(vjbsifreer)
(1)for (bsk=1sleep;bsksleep∈vjbsiBSk;k++)
(2) if(vjbsis∈vjbsksleeps) then
(3)wakeupbs(bsksleep,vjbsifreer)
(4) else
(5)max⁡s=max⁡(vjbsis∩vjbs∗sleeps)
(6)wakeupbs(bsmax⁡ssleep,max⁡s)
(7)vjbsifreer=vjbsis-max⁡s
(8)secondayallocation(vjbsifreer)Step 5.
If there are no allocated wireless resources to active small cells, small cells turn into sleeping state, whose realization process is shown in Algorithm5.Algorithm 5:Algorithm of turning active small cells into sleeping state.
(1) for(bsi=1active;bsiactive∈bsactive;i++)
(2)if (bsica=0) then
(3)bsiactive→bsisleep


## 4.2.1. The Calculation of the Wireless Resource Amount of Virtual Cells

The required wireless resources of virtual cells should be calculated by following steps.Step 1.
Assume that the possibility of the emergency of the mobile terminals in grid area is all the same in any random place, so the required wireless resources of virtual cells are related to the area of virtual cells, as shown in formula (13), i=(g-1)×b+h, j∈{1,…,m}. Consider(13)vibsjs=sgg,hs∩bsjs.Step 2.
The area of virtual cell to the area of grid area multiplied by the needed wireless resource amount of grid area is equal to required resource amount of virtual cell as shown in formula (14):(14)vibsjr=vibsjssgg,hssgg,hr.Step 3.
In order to guarantee the completion of the coverage in areaG there exists multioverlapping area, as shown in the shadow of Figure 5. In order to reduce the number of allocated wireless resources (to maximize benefit-cost ratio in multiobjective optimization), the requirement of resource in area G whole area will be optimized by (15), {k,j}⊆{1,…,m}. One has (15)setvibskr=0,∀vibsks∈vibsjs,vi∈sgg,h.Figure 5
Overlapping cover area.Step 4.
For the convenience of management all virtual cells are ordered from large to small based on virtual cell’s size. Combine formula (7), and then the set of virtual cells grouped by grid area is established.


## 4.2.2. Resource Allocation

Step 1.
Based on wireless resource quantization and the constrained relationship of small cells shown in formula (8), we rank the wireless resource demand of virtual cells from large to small and get the resource sets of virtual cells corresponding to small cells.Step 2 (primary allocation of wireless resources).
Centered on the small cell, related virtual cells’ wireless resource requirements are, respectively, added and are judged according to whether they reach upper limit of small cell wireless resource. If it is not reached, then the wireless resources in pool are mapped into the relevant small cells directly, else waiting for the second allocation. Wireless resources primary allocation algorithm is shown in Algorithm1.Algorithm 1:Wireless resources primary allocation algorithm.
(1) for(bsi=1active;bsiactive∈bsactive;i++)
(2)for (vj=1bsi;vjbsi∈VjBSibsi;j++)
(3)if [(bsica+vjbsir)≤bsicH] then
(4)bsica=bsica+vjbsir
(5)else vjbsir→vjbsifreerStep 3.
If the wireless resource allocation of active small cells does not reach the upper limit, the wireless resources will be allocated once again among the active small cells for reducing the number of the active small cells, whose process is shown in Algorithm2.Algorithm 2:Wireless resource allocation algorithm in active small cells.
(1) for(bsi=1active;bsiactive∈bsactive;i++)
(2)for vj=1bsifreer;vjbsi∈VjBSibsi;j++
(3)if bsica≤bsich and vjbsifreer∈∗bsiactiver then
(4) ifbsica+vjbsifreer≤bsicH then
(5)bsica=bsica+vjbsifreer
(6) vjbsifreer→vjbsir
(7) else
(8)vjbsifreer=vjbsifreer-bsicH-bsica
(9)bsica=bsicHStep 4.
If there is a need to do secondary allocation it means that the current active small cells could not manage the requirements of relevant virtual cells and hence small cells need to be added. That is, more small cells need to be woken from sleeping, as shown in Algorithm3.
The small cells can be started to undertake the task of wireless resource processing until the wireless resource demand of virtual cells has been satisfied or until there are no sleeping small cells, whose realization process algorithm is shown in Algorithm4.Algorithm 3:The algorithm of waking up sleeping small cells.
input:wakeupbs(bsksleep,vjbsifreer)
(1)bsksleep→bskactive
(2)bskca=bskca+vjbsifreer
(3)vjbsifreer→vjbsir
(4)for (vx=1bsk;vxbsk∈VxBSkbsk;x++)
(5)if (vxbskfreer) then
(6)if [(bskca+vxbskfreer)≤bskcH] then
(7)bskca=bskca+vxbskfreer
(8)  else
(9)vxbskfreer=vxbskfreer-(bskcH-bskca)
(10)bskca=bskcHAlgorithm 4:Wireless resources secondary allocation algorithm.
input:secondaryallocation(vjbsifreer)
(1)for (bsk=1sleep;bsksleep∈vjbsiBSk;k++)
(2) if(vjbsis∈vjbsksleeps) then
(3)wakeupbs(bsksleep,vjbsifreer)
(4) else
(5)max⁡s=max⁡(vjbsis∩vjbs∗sleeps)
(6)wakeupbs(bsmax⁡ssleep,max⁡s)
(7)vjbsifreer=vjbsis-max⁡s
(8)secondayallocation(vjbsifreer)Step 5.
If there are no allocated wireless resources to active small cells, small cells turn into sleeping state, whose realization process is shown in Algorithm5.Algorithm 5:Algorithm of turning active small cells into sleeping state.
(1) for(bsi=1active;bsiactive∈bsactive;i++)
(2)if (bsica=0) then
(3)bsiactive→bsisleep


## 5. Theory Analysis

### 5.1. Analysis of Energy Consumption

#### 5.1.1. The Energy Consumption of Transmitting or Receiving Data

As [36] says, the energy consumption of the small cells’ transmitting or receiving unit data can be written as formula (16). pl is visual space path loss in the 3GPP-TR-36-814 white paper. r is the distance between mobile terminal and small cell and is calculated by Euclidean Metric, as shown in formula (17). fc is the frequency of small cells to transceiving data. Consider(16)pl=22.0log⁡10d+28.0+20log⁡10fc,(17)d=userx-bsx2+usery-bsy2.The energy consumption of each virtual cell is shown in formula (18), μi∈vx. The establishment condition of formula (18) is shown in formula (19a), (19b), and (19c).(18)vx1bsy1activeEr=∑j=1vx1μi,tpy1,jt+μi,rpy1,jr=∑j=1vx1μi,tpl+∑j=1vx1μi,rpy1,jr=∑j=1vx1μi,t22.0log⁡10d+28.0+20log⁡10fc+∑j=1vx1μi,rpy1,jr≈vx1bsy1activervx1∑j=1vx122.0log⁡10d+28.0+20log⁡10fc+∑j=1vx1μi,rpy1,jr=vx1bsy1activervx1∑j=1vx128.0+20log⁡10fc+∑j=1vx122.0log⁡10d+∑j=1vx1μi,rpy1,jr=vx1bsy1activervx1∑j=1vx128.0+20log⁡10fc+22.0log⁡10∫vx1bsy1activelowyrvx1bsy1activehigyr∫vx1bsy1activelowxrvx1bsy1activehigxruserx-bsx2+usery-bsy2dxdy+∑j=1vx1μi,rpy1,jr.Formula (19b) stands for the value range in x-coordinate of virtual cells [vx1bsy1active]. Formula (19c) is the value range in y-coordinate:(19a)x-bsy1activex2+y-bsy1activey2≤r2,(19b)vx1bsy1activelowxr≤x≤vx1bsy1activehigxr,(19c)vx1bsy1activelowyr≤y≤vx1bsy1activehigyr.By integrating formula (11) and formula (19a), (19b), and (19c), we can get the total energy consumption of system’s receiving and transmitting data as shown in formula (20): (20)Etotalr+t=∑i=0n∑k=0mvibskactiveEr≈vibskactivern22log2∫GlowyGhigy∫GlowxGhigxr/2dxdya+c1+c2.G
low
x, Ghigx, Glowy, and Ghigy stand for the value range of area G, c1=∑j=1vx1(28.0+20log⁡10fc), and c2=∑j=1vx1(μi,rpy1,jr).


#### 5.1.2. Total Energy Consumption

Total energy consumption of small cells in areaG is the sum of the consumption of sleeping small cells, fundamental energy consumption, and transceiving data of active small cells as shown in formula (21). Nactive is the number of active small cells which is the calculation of active bs as shown in formula (22). Nsleep is the number of sleeping small cells which is shown in formula (23):(21)Etotal=Nactivepbsidle+NsleeppbssleepT+Etotalr+t,(22)Nactive=totalbssactive,(23)Nsleep=N-Nactive.


#### 5.1.3. Energy Consumption Analysis

It can be seen from formula (23) that total energy consumption consists of two parts: energy consumption of idle state and energy consumption of transceiving data. Reference [35] has proved that the number of active small cells Nactive and coverage radius r have an inverse relationship so the energy consumption of small cells is the monotone decreasing function along with the increase of r.It can be seen form formula (20) that Etotalr+t is the monotone increasing function along with the increase of r. When the sum of transmitting or receiving data is fixed and the coverage density of small cells is fixed, if r=+∞, then Nactive=1, the energy consumption of small cells is minimum and Etotalr+t is maximum. If r=r′, then Nactive=N, energy consumption of base equipment is maximum, and Etotalr+t is minimum. It could be seen that Etotal is the relevant convex function of r. Set r∈r′,+∞; then there exists minimum value. The results conform to the assumption of this paper which means that two-stage mapping algorithm could get energy saving effects.


### 5.2. Mapping Cost Minimization and QoS Analysis

To find the solution, the benefit-cost ratio is shown in formula (24):(24)∑k=1mTEkidle+Ekt′+r′-Etotal∑i=1,j=1a,bsgi,jr-∑k=1mbskca=NEkidleT+Etotalt′+r′-NsleepEksleep+NactiveEkidleT-Etotalr+t∑i=1,j=1a,bsgi,jr-∑x=1V∑y=1activevxbsyactiver=NsleepEkidle-EksleepT+Etotalt′+r′-Etotalr+t∑i=1,j=1a,bsgi,jr-∑x=1v∑y=1activevxbsyactiver.Along with the increase of the coverage radius of small cells, the value ofEtotalt′+r′-Etotalr+t can be regarded as the consumed energy when a relay is set at the place of r-r′; thus Etotalt′+r′-Etotalr+t=(vibskactiver/n)(22log2[∫GlowyGhigy∫GlowxGhigxr/2dxdy]a+c1). And then we could deduce that when the required wireless resources of virtual cells are fixed there exists a coverage radius r of a small cell which helps TSMA save energy. That conforms to the energy consumption analysis in Section 5.1 and also shows that coverage radius r and required wireless resources of virtual cells are one-to-one mapping relationship.Satisfying QoS means that the amount of wireless resource allocation for any virtual cell should be more than or equal to the amount of wireless resource request. Now we will analyze the wireless resource allocation of each virtual cell. From Section4.2 it can be seen that each virtual cell and the common area of each small cell comap wireless resources and reach the required amount of the cell, which satisfies QoS.


### 5.3. Convergence Analysis of the Algorithm

Location of small cells and mobile terminal are random. When the number of mobile terminals is fixed, the number of active small cells is mainly decided by the coverage radius of small cells. The method of value iteration can be used to get the minimum of energy consumption as shown in formula (25):(25)Xk+1=Xk+tkpk.k is the iteration times. pk is the moving direction which is regarded as 1 in this paper. The initial point X0 is the minimum coverage radius of small cell and X0=bsr=202. Set k=0, and then step length tk=(k+1)∗bsr=202. The termination rule is (fXk+1-fXk)/f(Xk)≥0 and the specific data could be seen in simulation.


## 5.1. Analysis of Energy Consumption

### 5.1.1. The Energy Consumption of Transmitting or Receiving Data

As [36] says, the energy consumption of the small cells’ transmitting or receiving unit data can be written as formula (16). pl is visual space path loss in the 3GPP-TR-36-814 white paper. r is the distance between mobile terminal and small cell and is calculated by Euclidean Metric, as shown in formula (17). fc is the frequency of small cells to transceiving data. Consider(16)pl=22.0log⁡10d+28.0+20log⁡10fc,(17)d=userx-bsx2+usery-bsy2.The energy consumption of each virtual cell is shown in formula (18), μi∈vx. The establishment condition of formula (18) is shown in formula (19a), (19b), and (19c).(18)vx1bsy1activeEr=∑j=1vx1μi,tpy1,jt+μi,rpy1,jr=∑j=1vx1μi,tpl+∑j=1vx1μi,rpy1,jr=∑j=1vx1μi,t22.0log⁡10d+28.0+20log⁡10fc+∑j=1vx1μi,rpy1,jr≈vx1bsy1activervx1∑j=1vx122.0log⁡10d+28.0+20log⁡10fc+∑j=1vx1μi,rpy1,jr=vx1bsy1activervx1∑j=1vx128.0+20log⁡10fc+∑j=1vx122.0log⁡10d+∑j=1vx1μi,rpy1,jr=vx1bsy1activervx1∑j=1vx128.0+20log⁡10fc+22.0log⁡10∫vx1bsy1activelowyrvx1bsy1activehigyr∫vx1bsy1activelowxrvx1bsy1activehigxruserx-bsx2+usery-bsy2dxdy+∑j=1vx1μi,rpy1,jr.Formula (19b) stands for the value range in x-coordinate of virtual cells [vx1bsy1active]. Formula (19c) is the value range in y-coordinate:(19a)x-bsy1activex2+y-bsy1activey2≤r2,(19b)vx1bsy1activelowxr≤x≤vx1bsy1activehigxr,(19c)vx1bsy1activelowyr≤y≤vx1bsy1activehigyr.By integrating formula (11) and formula (19a), (19b), and (19c), we can get the total energy consumption of system’s receiving and transmitting data as shown in formula (20): (20)Etotalr+t=∑i=0n∑k=0mvibskactiveEr≈vibskactivern22log2∫GlowyGhigy∫GlowxGhigxr/2dxdya+c1+c2.G
low
x, Ghigx, Glowy, and Ghigy stand for the value range of area G, c1=∑j=1vx1(28.0+20log⁡10fc), and c2=∑j=1vx1(μi,rpy1,jr).


### 5.1.2. Total Energy Consumption

Total energy consumption of small cells in areaG is the sum of the consumption of sleeping small cells, fundamental energy consumption, and transceiving data of active small cells as shown in formula (21). Nactive is the number of active small cells which is the calculation of active bs as shown in formula (22). Nsleep is the number of sleeping small cells which is shown in formula (23):(21)Etotal=Nactivepbsidle+NsleeppbssleepT+Etotalr+t,(22)Nactive=totalbssactive,(23)Nsleep=N-Nactive.


### 5.1.3. Energy Consumption Analysis

It can be seen from formula (23) that total energy consumption consists of two parts: energy consumption of idle state and energy consumption of transceiving data. Reference [35] has proved that the number of active small cells Nactive and coverage radius r have an inverse relationship so the energy consumption of small cells is the monotone decreasing function along with the increase of r.It can be seen form formula (20) that Etotalr+t is the monotone increasing function along with the increase of r. When the sum of transmitting or receiving data is fixed and the coverage density of small cells is fixed, if r=+∞, then Nactive=1, the energy consumption of small cells is minimum and Etotalr+t is maximum. If r=r′, then Nactive=N, energy consumption of base equipment is maximum, and Etotalr+t is minimum. It could be seen that Etotal is the relevant convex function of r. Set r∈r′,+∞; then there exists minimum value. The results conform to the assumption of this paper which means that two-stage mapping algorithm could get energy saving effects.


## 5.1.1. The Energy Consumption of Transmitting or Receiving Data

As [36] says, the energy consumption of the small cells’ transmitting or receiving unit data can be written as formula (16). pl is visual space path loss in the 3GPP-TR-36-814 white paper. r is the distance between mobile terminal and small cell and is calculated by Euclidean Metric, as shown in formula (17). fc is the frequency of small cells to transceiving data. Consider(16)pl=22.0log⁡10d+28.0+20log⁡10fc,(17)d=userx-bsx2+usery-bsy2.The energy consumption of each virtual cell is shown in formula (18), μi∈vx. The establishment condition of formula (18) is shown in formula (19a), (19b), and (19c).(18)vx1bsy1activeEr=∑j=1vx1μi,tpy1,jt+μi,rpy1,jr=∑j=1vx1μi,tpl+∑j=1vx1μi,rpy1,jr=∑j=1vx1μi,t22.0log⁡10d+28.0+20log⁡10fc+∑j=1vx1μi,rpy1,jr≈vx1bsy1activervx1∑j=1vx122.0log⁡10d+28.0+20log⁡10fc+∑j=1vx1μi,rpy1,jr=vx1bsy1activervx1∑j=1vx128.0+20log⁡10fc+∑j=1vx122.0log⁡10d+∑j=1vx1μi,rpy1,jr=vx1bsy1activervx1∑j=1vx128.0+20log⁡10fc+22.0log⁡10∫vx1bsy1activelowyrvx1bsy1activehigyr∫vx1bsy1activelowxrvx1bsy1activehigxruserx-bsx2+usery-bsy2dxdy+∑j=1vx1μi,rpy1,jr.Formula (19b) stands for the value range in x-coordinate of virtual cells [vx1bsy1active]. Formula (19c) is the value range in y-coordinate:(19a)x-bsy1activex2+y-bsy1activey2≤r2,(19b)vx1bsy1activelowxr≤x≤vx1bsy1activehigxr,(19c)vx1bsy1activelowyr≤y≤vx1bsy1activehigyr.By integrating formula (11) and formula (19a), (19b), and (19c), we can get the total energy consumption of system’s receiving and transmitting data as shown in formula (20): (20)Etotalr+t=∑i=0n∑k=0mvibskactiveEr≈vibskactivern22log2∫GlowyGhigy∫GlowxGhigxr/2dxdya+c1+c2.G
low
x, Ghigx, Glowy, and Ghigy stand for the value range of area G, c1=∑j=1vx1(28.0+20log⁡10fc), and c2=∑j=1vx1(μi,rpy1,jr).


## 5.1.2. Total Energy Consumption

Total energy consumption of small cells in areaG is the sum of the consumption of sleeping small cells, fundamental energy consumption, and transceiving data of active small cells as shown in formula (21). Nactive is the number of active small cells which is the calculation of active bs as shown in formula (22). Nsleep is the number of sleeping small cells which is shown in formula (23):(21)Etotal=Nactivepbsidle+NsleeppbssleepT+Etotalr+t,(22)Nactive=totalbssactive,(23)Nsleep=N-Nactive.


## 5.1.3. Energy Consumption Analysis

It can be seen from formula (23) that total energy consumption consists of two parts: energy consumption of idle state and energy consumption of transceiving data. Reference [35] has proved that the number of active small cells Nactive and coverage radius r have an inverse relationship so the energy consumption of small cells is the monotone decreasing function along with the increase of r.It can be seen form formula (20) that Etotalr+t is the monotone increasing function along with the increase of r. When the sum of transmitting or receiving data is fixed and the coverage density of small cells is fixed, if r=+∞, then Nactive=1, the energy consumption of small cells is minimum and Etotalr+t is maximum. If r=r′, then Nactive=N, energy consumption of base equipment is maximum, and Etotalr+t is minimum. It could be seen that Etotal is the relevant convex function of r. Set r∈r′,+∞; then there exists minimum value. The results conform to the assumption of this paper which means that two-stage mapping algorithm could get energy saving effects.


## 5.2. Mapping Cost Minimization and QoS Analysis

To find the solution, the benefit-cost ratio is shown in formula (24):(24)∑k=1mTEkidle+Ekt′+r′-Etotal∑i=1,j=1a,bsgi,jr-∑k=1mbskca=NEkidleT+Etotalt′+r′-NsleepEksleep+NactiveEkidleT-Etotalr+t∑i=1,j=1a,bsgi,jr-∑x=1V∑y=1activevxbsyactiver=NsleepEkidle-EksleepT+Etotalt′+r′-Etotalr+t∑i=1,j=1a,bsgi,jr-∑x=1v∑y=1activevxbsyactiver.Along with the increase of the coverage radius of small cells, the value ofEtotalt′+r′-Etotalr+t can be regarded as the consumed energy when a relay is set at the place of r-r′; thus Etotalt′+r′-Etotalr+t=(vibskactiver/n)(22log2[∫GlowyGhigy∫GlowxGhigxr/2dxdy]a+c1). And then we could deduce that when the required wireless resources of virtual cells are fixed there exists a coverage radius r of a small cell which helps TSMA save energy. That conforms to the energy consumption analysis in Section 5.1 and also shows that coverage radius r and required wireless resources of virtual cells are one-to-one mapping relationship.Satisfying QoS means that the amount of wireless resource allocation for any virtual cell should be more than or equal to the amount of wireless resource request. Now we will analyze the wireless resource allocation of each virtual cell. From Section4.2 it can be seen that each virtual cell and the common area of each small cell comap wireless resources and reach the required amount of the cell, which satisfies QoS.


## 5.3. Convergence Analysis of the Algorithm

Location of small cells and mobile terminal are random. When the number of mobile terminals is fixed, the number of active small cells is mainly decided by the coverage radius of small cells. The method of value iteration can be used to get the minimum of energy consumption as shown in formula (25):(25)Xk+1=Xk+tkpk.k is the iteration times. pk is the moving direction which is regarded as 1 in this paper. The initial point X0 is the minimum coverage radius of small cell and X0=bsr=202. Set k=0, and then step length tk=(k+1)∗bsr=202. The termination rule is (fXk+1-fXk)/f(Xk)≥0 and the specific data could be seen in simulation.


## 6. Simulation

We use the Vienna LTE-A [37] to build the whole simulation platform. We set the related parameters of this simulation experiment in Table 1, according to the model of energy consumption mentioned in [38, 39]. Reference [38] is derived from the data of [39].Table 1
Simulation parameters.
Parameter name
value
Length and width of the areaG
100 m∗ 100 m
The number of small cells
25
The coverage radius of small cell
r
∈
[
20
2
,
100
2
]
Each small cell that can deal with the number of mobile terminals
≤10
Each mobile terminal that needs the number of resource
=1
Run time
Time of system simulation
Idle state current consumption
15 milliwatts
Sleep state current consumption
0.55 milliwattsThe simulation is carried out in two scenarios. We first analyze a scene where small cells are discrete uniform distribution in the areaG and then test another scene where the small cells are Poisson distribution. Although the discrete uniform distribution can ensure the full coverage of the area G, the situation of repetitive wireless resource allocation is impossible to happen because the model is too ideal. Poisson distribution can compensate for these defects but cannot guarantee full coverage in the area G and maybe appear as coverage holes.


### 6.1. In the Case of the Discrete Uniform Distribution of Small Cells

First, generate 25 small cells of space with the random discrete uniform distribution function. Then generate a mobile terminal in a space by Poisson point process, and the size and the time of data packets transmitted by mobile terminal are equal. Test the energy consumption of different case coverage density, respectively, and test the regional situation and the distribution of the wireless resource request. The result can be shown in Figure6, where the square represents a small cell and the circle represents a mobile terminal.Figure 6
The scenario for the discrete uniform distribution of small cells.Figure7 shows the situation of the energy consumption with the increase of coverage density, in which coverage density can be achieved by varying the coverage radius of the small cell. “Original” indicates energy consumption when energy saving algorithm is not used, while “virtualization” indicates energy saving algorithm proposed in this paper. Along with the increase of coverage density, it can be found from Figure 7 that the energy consumption of a small cell functions is of minimum value when the number of small cells is fixed. This conclusion is consistent with the energy consumption analysis in Section 5. It indicates that there is a coverage density value making the energy consumption of the network minimum when the number of mobile terminals is certain. Using wireless virtualized network mapping algorithm can save the network energy consumption.Figure 7
The relation of the energy consumption with the coverage density (under discrete uniform distribution).Figure8 shows the wireless resource usage of each small cell. The ordinate indicates the amount of wireless resources of the small cells with a maximum of 10 which means the usage rate is 100%. It could be seen from Figure 8 that, with the greater coverage radius of small cells, the wireless resource usage of active small cells becomes greater and the number of the sleeping small cells becomes larger. In conjunction with Figure 7, it can be found that the coverage radius is maximum and the number of sleeping small cells is increasing, but energy consumption is not the least when “5r=1002.” This is mainly because the energy consumption increases with the increase of the distance when small cells receive or transmit data.Figure 8
The wireless resource usage of each small cell (under discrete uniform distribution).Figure9 shows the volume of requests and the actual distribution of each grid area wireless resources with the increase of coverage radius. The virtual cell area changes, while the required allocation wireless resources have also increased, with the increase of the coverage radius of small cells. It can be seen from Figure 9 that the amount of allocated wireless resources is greater than or equal to the amount of requested wireless resources of grid area, which indicates that wireless virtualized network mapping algorithm on the basis of energy saving could ensure QoS requirements in the case of super-dense networks.Figure 9
The volume of requests and the actual distribution of each grid area wireless resources (under discrete uniform distribution).


### 6.2. In the Case of the Poisson Distribution of Small Cells

Then we generate a mobile terminal in space by Poisson point process and then generate a small cell in space by Poisson point process, as shown in Figure10. The circle in Figure 10 stands for the coverage range of small cells and the place without coverage is communication blind zone.Figure 10
The scenario for the Poisson distribution of small cells.Figure11 shows the energy consumption of small cells when their topology structure is in Poisson distribution, which is almost the same as the uniform distribution in Figure 7 only with the difference of energy consumption when abscissa is “r=202.” That is because there exists communication blind zone in Poisson distribution which makes some data fail to be transmitted.Figure 11
The relation of the energy consumption with the coverage density (under Poisson distribution).Figure12 is the QoS situation when algorithm is in Poisson distribution. It could be seen from Figure 12 that, from “r=2” to “r=5,” allocated wireless resources are more than or equal to the required wireless resources of grid area, satisfying the QoS. When it is “r=1,” the required wireless resources of the 3rd grid are “2,” actual allocated wireless resources are “1.9,” the required wireless resources of the 6th grid are “2,” the actual allocated wireless resources are “0.5”, and so on. In conjunction with Figure 10 the grid area, where QoS could not be satisfied, is communication blind zone, so the whole process of this algorithm could satisfy QoS.Figure 12
The requested amount of and actual allocated amount of wireless resources (under Poisson distribution).


### 6.3. Scheme of Energy Saving Analysis and Comparison

Depending on threshold value, [11] adjusts the working status of small cells. When it is lower than threshold value, small cells turn into sleeping state, which has good energy saving effects but the QoS could not be satisfied. In [14], quite a long time is needed to start relevant equipment to turn the base stations from sleeping status into working status when mobile terminal is monitored; the data packets are obviously delayed. Reference [15] is to save down-link data in buffer, and when it reaches maximum delayed range, the nodes will be woken to achieve the goal of energy saving. The energy consumption of this paper and that of [15] have been compared. “r=3” is used for simulated experiment.Figure13 shows the situation of energy consumption while the number of mobile terminals changes. When the number of mobile terminals is between 0 and 10, the energy consumption of proposed algorithm in [15] is lower than that of TSMA. The main reason is the fact that the distance is far from small cells to mobile terminal in TSMA. When the number of mobile terminals is between 10 and 200, the energy consumption of TSMA is lower because only some of small cells are active in TSMA. When the number of mobile terminals is between 200 and 250, the energy consumption of the two is almost the same. It could be concluded that there is no delay in the TSMA algorithm, but there exists certain delay when small cells turn into working status from sleeping status when algorithm of [15] is used. When the number of mobile terminals is between 1 and 40 or between 190 and 250, TSMA’s energy consumption grows linearly. When the number of mobile terminals is between 40 and 190, the energy consumption grows by leaps and bounds. That is mainly because four active small cells can process the data and the energy consumption when the number of mobile terminals is between 1 and 40. The energy consumption is mainly determined by the amount of data regardless of the number of small cells. Between 210 and 250 all the small cells are active, so it is also increasing linearly. Energy leaping growth between 40 and 190 is mainly due to the wake-up of small cells with the mobile terminal, thereby reducing the distance of data transmission, which is consistent with the theoretical analysis.Figure 13
The situation of energy consumption while the number of mobile terminals changes.


## 6.1. In the Case of the Discrete Uniform Distribution of Small Cells

First, generate 25 small cells of space with the random discrete uniform distribution function. Then generate a mobile terminal in a space by Poisson point process, and the size and the time of data packets transmitted by mobile terminal are equal. Test the energy consumption of different case coverage density, respectively, and test the regional situation and the distribution of the wireless resource request. The result can be shown in Figure6, where the square represents a small cell and the circle represents a mobile terminal.Figure 6
The scenario for the discrete uniform distribution of small cells.Figure7 shows the situation of the energy consumption with the increase of coverage density, in which coverage density can be achieved by varying the coverage radius of the small cell. “Original” indicates energy consumption when energy saving algorithm is not used, while “virtualization” indicates energy saving algorithm proposed in this paper. Along with the increase of coverage density, it can be found from Figure 7 that the energy consumption of a small cell functions is of minimum value when the number of small cells is fixed. This conclusion is consistent with the energy consumption analysis in Section 5. It indicates that there is a coverage density value making the energy consumption of the network minimum when the number of mobile terminals is certain. Using wireless virtualized network mapping algorithm can save the network energy consumption.Figure 7
The relation of the energy consumption with the coverage density (under discrete uniform distribution).Figure8 shows the wireless resource usage of each small cell. The ordinate indicates the amount of wireless resources of the small cells with a maximum of 10 which means the usage rate is 100%. It could be seen from Figure 8 that, with the greater coverage radius of small cells, the wireless resource usage of active small cells becomes greater and the number of the sleeping small cells becomes larger. In conjunction with Figure 7, it can be found that the coverage radius is maximum and the number of sleeping small cells is increasing, but energy consumption is not the least when “5r=1002.” This is mainly because the energy consumption increases with the increase of the distance when small cells receive or transmit data.Figure 8
The wireless resource usage of each small cell (under discrete uniform distribution).Figure9 shows the volume of requests and the actual distribution of each grid area wireless resources with the increase of coverage radius. The virtual cell area changes, while the required allocation wireless resources have also increased, with the increase of the coverage radius of small cells. It can be seen from Figure 9 that the amount of allocated wireless resources is greater than or equal to the amount of requested wireless resources of grid area, which indicates that wireless virtualized network mapping algorithm on the basis of energy saving could ensure QoS requirements in the case of super-dense networks.Figure 9
The volume of requests and the actual distribution of each grid area wireless resources (under discrete uniform distribution).


## 6.2. In the Case of the Poisson Distribution of Small Cells

Then we generate a mobile terminal in space by Poisson point process and then generate a small cell in space by Poisson point process, as shown in Figure10. The circle in Figure 10 stands for the coverage range of small cells and the place without coverage is communication blind zone.Figure 10
The scenario for the Poisson distribution of small cells.Figure11 shows the energy consumption of small cells when their topology structure is in Poisson distribution, which is almost the same as the uniform distribution in Figure 7 only with the difference of energy consumption when abscissa is “r=202.” That is because there exists communication blind zone in Poisson distribution which makes some data fail to be transmitted.Figure 11
The relation of the energy consumption with the coverage density (under Poisson distribution).Figure12 is the QoS situation when algorithm is in Poisson distribution. It could be seen from Figure 12 that, from “r=2” to “r=5,” allocated wireless resources are more than or equal to the required wireless resources of grid area, satisfying the QoS. When it is “r=1,” the required wireless resources of the 3rd grid are “2,” actual allocated wireless resources are “1.9,” the required wireless resources of the 6th grid are “2,” the actual allocated wireless resources are “0.5”, and so on. In conjunction with Figure 10 the grid area, where QoS could not be satisfied, is communication blind zone, so the whole process of this algorithm could satisfy QoS.Figure 12
The requested amount of and actual allocated amount of wireless resources (under Poisson distribution).


## 6.3. Scheme of Energy Saving Analysis and Comparison

Depending on threshold value, [11] adjusts the working status of small cells. When it is lower than threshold value, small cells turn into sleeping state, which has good energy saving effects but the QoS could not be satisfied. In [14], quite a long time is needed to start relevant equipment to turn the base stations from sleeping status into working status when mobile terminal is monitored; the data packets are obviously delayed. Reference [15] is to save down-link data in buffer, and when it reaches maximum delayed range, the nodes will be woken to achieve the goal of energy saving. The energy consumption of this paper and that of [15] have been compared. “r=3” is used for simulated experiment.Figure13 shows the situation of energy consumption while the number of mobile terminals changes. When the number of mobile terminals is between 0 and 10, the energy consumption of proposed algorithm in [15] is lower than that of TSMA. The main reason is the fact that the distance is far from small cells to mobile terminal in TSMA. When the number of mobile terminals is between 10 and 200, the energy consumption of TSMA is lower because only some of small cells are active in TSMA. When the number of mobile terminals is between 200 and 250, the energy consumption of the two is almost the same. It could be concluded that there is no delay in the TSMA algorithm, but there exists certain delay when small cells turn into working status from sleeping status when algorithm of [15] is used. When the number of mobile terminals is between 1 and 40 or between 190 and 250, TSMA’s energy consumption grows linearly. When the number of mobile terminals is between 40 and 190, the energy consumption grows by leaps and bounds. That is mainly because four active small cells can process the data and the energy consumption when the number of mobile terminals is between 1 and 40. The energy consumption is mainly determined by the amount of data regardless of the number of small cells. Between 210 and 250 all the small cells are active, so it is also increasing linearly. Energy leaping growth between 40 and 190 is mainly due to the wake-up of small cells with the mobile terminal, thereby reducing the distance of data transmission, which is consistent with the theoretical analysis.Figure 13
The situation of energy consumption while the number of mobile terminals changes.


## 7. Conclusion

In this work, to save the high energy consumption of the wireless access network, we have put forward a method (a two-stage wireless virtualized network resource mapping algorithm) based on virtualization technology. Numerical results confirm the effectiveness of the scheme that can save system energy consumption on the basis of ensuring the QoS of the users. In the future, we will study the mapping algorithm based on energy conservation under the condition of heterogeneous networks and spectrum spatial reuse.



---

*Source: 958431-2015-12-22.xml*