Base station (BS) sleeping has emerged as a viable solution to enhance the overall network energy efficiency by inactivating the underutilized BSs. However, it affects the performance of users in sleeping cells depending on their BS association criteria, their channel conditions toward the active BSs, and scheduling criteria and traffic loads at the active BSs. This paper characterizes the performance of cellular systems with BS sleeping by developing a systematic framework to derive the spectral efficiency and outage probability of downlink transmission to the sleeping cell users taking into account the aforementioned factors. In this context, a user association scheme is also developed in which sleeping cell users associate to a BS with maximum mean channel access probability (MMAP). The MMAP-based user association scheme adapts according to traffic load and scheduling criteria at the active BSs. We consider greedy and round-robin schemes at active BSs for scheduling users in a channel. We also derive the analytical results for the conventional maximum received signal power (MRSP)-based user association scheme. Finally, we derive the statistics of the received signal and interference power to evaluate the downlink spectral efficiency of a given sleeping cell user. Numerical results provide a comparison between two user association schemes as a function of system parameters and demonstrate the efficacy of the MMAP-based association scheme in non-uniform traffic load scenarios.
A distance-aware BS switching algorithm is presented in @cite_21 that recommends to switch-off a BS with maximum average distance from its own and neighboring cell users. In @cite_20 four heuristic-based BS switching-off patterns are proposed and the coordination among the BSs is exploited to provide coverage to the sleeping cell users.
@cite_21 @cite_20
2156842280 2149707006
Energy-efficiency, one of the major design goals in wireless cellular networks, has received much attention lately, due to increased awareness of environmental and economic issues for network operators. In this paper, we develop a theoretical framework for BS energy saving that encompasses dynamic BS operation and the related problem of user association together. Specifically, we formulate a total cost minimization that allows for a flexible tradeoff between flow-level performance and energy consumption. For the user association problem, we propose an optimal energy-efficient user association policy and further present a distributed implementation with provable convergence. For the BS operation problem (i.e., BS switching on off), which is a challenging combinatorial problem, we propose simple greedy-on and greedy-off algorithms that are inspired by the mathematical background of submodularity maximization problem. Moreover, we propose other heuristic algorithms based on the distances between BSs or the utilizations of BSs that do not impose any additional signaling overhead and thus are easy to implement in practice. Extensive simulations under various practical configurations demonstrate that the proposed user association and BS operation algorithms can significantly reduce energy consumption. The energy consumption of the information and communication technology (ICT) industry, which has become a serious problem, is mostly due to the network infrastructure rather than the mobile terminals. In this paper, we focus on reducing the energy consumption of base stations (BSs) by adjusting their working modes (active or sleep). Specifically, the objective is to minimize the energy consumption while satisfying quality of service (QoS, e.g., blocking probability) requirement and, at the same time, avoiding frequent mode switching to reduce signaling and delay overhead. The problem is modeled as a dynamic programming (DP) problem, which is NP-hard in general. Based on cooperation among neighboring BSs, a low-complexity algorithm is proposed to reduce the size of state space as well as that of action space. Simulations demonstrate that, with the proposed algorithm, the active BS pattern well meets the time variation and the non-uniform spatial distribution of system traffic. Moreover, the tradeoff between the energy saving from BS sleeping and the cost of switching is well balanced by the proposed scheme. In this paper, the optimal BS (Base Station) density for both homogeneous and heterogeneous cellular networks to minimize network energy cost is analyzed with stochastic geometry theory. For homogeneous cellular networks, both upper and lower bounds of the optimal BS density are derived. For heterogeneous cellular networks, our analysis reveals the best type of BSs to be deployed for capacity extension, or to be switched off for energy saving. Specifically, if the ratio between the micro BS cost and the macro BS cost is lower than a threshold, which is a function of path loss and their transmit power, then the optimal strategy is to deploy micro BSs for capacity extension or to switch off macro BSs (if possible) for energy saving with higher priority. Otherwise, the optimal strategy is the opposite. The optimal combination of macro and micro BS densities can be calculated numerically through our analysis, or alternatively be conservatively approximated with a closed-form solution. Based on the parameters from EARTH, numerical results show that in the dense urban scenario, compared to the traditional macro-only homogeneous cellular network with no BS sleeping, deploying micro BSs can reduce about 40 of the total energy cost, and further reduce up to 35 with BS sleeping capability. In this paper, we propose a switch on off algorithm for Base Stations (BSs), which exploits the knowledge of the distance between the User Equipments (UEs) and their associated BS. Our novel approach hopes to provide an improvement to the problem of energy consumption. The major concern lies on reducing the energy consumption of the telecommunication networks by optimizing the power utilization without sacrificing the offered Quality of Service (QoS). Our proposed scheme achieves a significant power saving, based on switching off the Base Stations that are underutilized during low traffic periods (especially during night) in the LTE-Advanced. While the deployment of base stations (BSs) becomes increasingly dense in order to accommodate the growth in traffic demand, these BSs may be under-utilized during most hours except peak hours. The deactivation of these under-utilized BSs is regarded as the key to reducing network power consumption; however, the remaining active BSs should increase their transmit power in order to fill network coverage holes that result from BS switching off. This paper investigates the optimal balance between such beneficial and harmful effects of BS switching off in terms of minimizing the network power consumption, through comprehensively considering the spatial BS distribution, BS transmit power, BS power consumption behaviors, radio propagation environments, and frequency reuse. The suboptimal and approximated design problems are formulated as geometric programming and the numerical results demonstrate that the proposed suboptimal solutions for the spatial density, transmit power, and frequency reuse of remaining active BSs significantly contribute to reducing the power consumption of BSs. Partial Spectrum Reuse (PSR) in the second tier of two-tier heterogeneous cellular networks has a potential to improve spectrum efficiency by reducing inter-cell interference, and thus energy efficiency as well by deploying less or switching off more Base Stations (BSs). In this paper, we analyze the optimal PSR factor, defined as the portion of spectrum reused by micro cells in two-tier heterogeneous networks, which is not in an explicit form generally. Then, a closed-form limit of the optimal PSR factor is derived as the ratio of the user rate requirement over the whole system spectrum bandwidth is approaching zero, based on which a threshold of the micro-BS energy cost is also derived to determine which type of BSs is preferable. Specifically, one should deploy more micro BSs or switch off more macro BSs if the micro-BS energy cost is lower than the threshold. Otherwise, the optimal choice is the opposite. This threshold with the PSR scheme is higher than that without PSR scheme, i.e., PSR can improve both spectrum efficiency and energy efficiency. Numerical results show that adopting PSR can reduce the network energy consumption by up to 50 when the transmit power of macro BSs is 10dB higher than that of micro BSs. In this paper, we adopt stochastic geometry theory to analyze the optimal macro micro BS (base station) density for energy-efficient heterogeneous cellular networks with QoS constraints. We first derive the upper and lower bounds of the optimal BS density for homogeneous scenarios and, based on these, we analyze the optimal BS density for heterogeneous networks. The optimal macro micro BS density can be calculated numerically through our analysis, and the closed-form approximation is also derived. Our results reveal the best type of BSs to be deployed for capacity extension, or to be switched off for energy saving. Specifically, if the ratio between the micro BS cost and the macro BS cost is lower than a threshold, which is a function of path loss and their transmit power, the micro BSs are preferred, i.e., deploy more micro BSs for capacity extension or switch off certain macro BSs for energy saving. Otherwise, the optimal choice is the opposite. Our work provides guidance for energy efficient cellular network planning and dynamic operation control.1 Cellular systems in general suffer from co-channel interference, when simultaneous transmissions in other cells use the same physical resources. In order to mitigate such co-channel interference cooperating Base Stations (BSs) can perform joint multi-antenna signal processing across cell borders. This paper describes a concept of distributed cooperation, where BSs communicate directly via a BS-BS interface without central control. A serving BS can serve its terminals on its own or it can request cooperation from one or more supporting BSs. By collecting IQ samples from the supporting BSs' antenna elements, the serving BS can virtually increase its number of receive antennas. Exchanging additional parameters allows applying advanced receiver algorithms, e.g., interference rejection or cancelation. Performance evaluations by means of simulation show the capability of BS cooperation applied to 3GPP LTE in terms of cell and user throughput but it also shows the trade-off in terms of increased backhaul requirement due to BS-BS communication. Cell search is the process for a user to detect its neighboring base stations (BSs) and make a cell selection decision. Due to the importance of beamforming in 5G cellular networks including both the millimeter wave and sub-6 GHz networks, there is a need for a better understanding of the directional cell search delay performance. A cellular network with fixed BS and user locations is considered, so as to take into account the strong temporal correlations that exist for the SINR experienced by each BS and user in this context. For Poisson cellular networks with Rayleigh fading channels, a closed-form expression for the spatially averaged mean cell search delay of all users is derived. This mean cell search delay for a noise-limited network is proved to be infinite whenever the non-line-of-sight path loss exponent is larger than two. For interference-limited networks, a phase transition for the mean cell search delay is shown to exist in terms of the number of BS beams @math : the mean cell search delay is infinite when @math is smaller than a threshold and finite otherwise. Beam-sweeping is also demonstrated to be effective in decreasing the cell search delay, especially for cell edge users. In this paper, we investigate dynamic base station (BS) switching to reduce energy consumption in wireless cellular networks. Specifically, we formulate a general energy minimization problem pertaining to BS switching that is known to be a difficult combinatorial problem and requires high computational complexity as well as large signaling overhead. We propose a practically implementable switching-on off based energy saving (SWES) algorithm that can be operated in a distributed manner with low computational complexity. A key design principle of the proposed algorithm is to turn off a BS one by one that will minimally affect the network by using a newly introduced notion of network-impact, which takes into account the additional load increments brought to its neighboring BSs. In order to further reduce the signaling and implementation overhead over the air and backhaul, we propose three other heuristic versions of SWES that use the approximate values of network-impact as their decision metrics. We describe how the proposed algorithms can be implemented in practice at the protocol-level and also estimate the amount of energy savings through a first-order analysis in a simple setting. Extensive simulations demonstrate that the SWES algorithms can significantly reduce the total energy consumption, e.g., we estimate up to 50-80 potential savings based on a real traffic profile from a metropolitan urban area. With the explosive deployment of the information and communications technology (ICT) infrastructures, the rising cost of energy and increased environmental awareness has sparked a keen interest in the development and deployment of energy-efficient communication technologies. As a major player in the ICT sector, the energy efficiency of the mobile cellular networks can be significantly improved by switching off some base stations during off-peak periods. In this paper, we propose an energy-efficient BS switching strategy, and use cooperative communication techniques among the base stations to effectively extend network coverage. We incorporate both the path-loss and fading effects in our system model, and derive closed-form expressions for two important quality of service metrics, the call-blocking probability and the channel outage probability. The proposed scheme guarantees the quality of service of the user equipments by identifying the user equipments situated at the worst-case locations. The energy-saving performance is evaluated and compared with the conventional uni-pattern operation. Both analytical and numerical results show that the proposed energy-efficient switching strategy, facilitated by BS cooperation, can provide significant energy-saving potential for the cellular networks with guaranteed quality of service. Energy efficiency (EE) is becoming an important design goal for wireless communication systems providing high spectral efficiency (SE). Both massive multi-input multi-output (MIMO) and small cell network (SCN) are expected to achieve high EE for high throughput cellular networks, though using different mechanisms. Massive MIMO improves EE by exploiting a large array gain, while SCN improves EE by deploying a large number of low-power base stations (BSs) to reduce the propagation loss and increase the opportunity of BS sleep. In this paper, we compare the EEs as well as the SEs of Massive MIMO and SCN. For a fair comparison, we consider a multi-cell network with the same user density, antenna density and average cell-edge signal-to-noise-ratio (SNR). Perfect channel information is assumed, and three BS sleep strategies are considered. Our analysis shows that the EE of SCN increases with the cell size shrinking, and the achievable SEs of SCN and Massive MIMO increase with the cell-edge SNR. When the number of cells is large, SCN is always more energy efficient than Massive MIMO. On the other hand, when the number of cells is small, Massive MIMO achieves higher EE than SCN when the circuit power consumptions of Massive MIMO are much lower than SCN. We develop a tractable, flexible, and accurate model for downlink heterogeneous cellular networks. It consists of K tiers of randomly-located base stations (BSs), where each tier may differ in terms of the average transmit power, the supported data rate and the BS density. This allows elements spanning traditional, micro, pico, and femtocell BSs to be simultaneously considered. Assuming a mobile user connects to its strongest BS, we derive its Signal-to-Interference-Ratio (SIR) distribution and use that to find the coverage (equivalently outage) probability over the entire network. We verify the accuracy of these analytical results through empirical comparisons with an actual 4G macro-cell network. We consider the interference management problem in a multicell MIMO heterogeneous network. Within each cell there is a large number of distributed micro pico base stations (BSs) that can be potentially coordinated for joint transmission. To reduce coordination overhead, we consider user-centric BS clustering so that each user is served by only a small number of (potentially overlapping) BSs. Thus, given the channel state information, our objective is to jointly design the BS clustering and the linear beamformers for all BSs in the network. In this paper, we formulate this problem from a sparse optimization perspective, and propose an efficient algorithm that is based on iteratively solving a sequence of group LASSO problems. A novel feature of the proposed algorithm is that it performs BS clustering and beamformer design jointly rather than separately as is done in the existing approaches for partial coordinated transmission. Moreover, the cluster size can be controlled by adjusting a single penalty parameter in the nonsmooth regularized utility function. The convergence of the proposed algorithm (to a stationary solution) is guaranteed, and its effectiveness is demonstrated via extensive simulation. This paper considers the joint optimization of frequency reuse and base-station (BS) bias for user association in downlink heterogeneous networks for load balancing and intercell interference management. To make the analysis tractable, we assume that BSs are randomly deployed as point processes in multiple tiers, where BSs in each tier have different transmission powers and spatial densities. A utility maximization framework is formulated based on the user coverage rate, which is a function of the different BS biases for user association and different frequency reuse factors across BS tiers. Compared to previous works where the bias levels are heuristically determined and full reuse is adopted, we quantitatively compute the optimal user association bias and obtain the closed-form solution of the optimal frequency reuse. Interestingly, we find that the optimal bias and the optimal reuse factor of each BS tier have an inversely proportional relationship. Further, we also propose an iterative method for optimizing these two factors. In contrast to system-level optimization solutions based on specific channel realization and network topology, our approach is off-line and is useful for deriving deployment insights. Numerical results show that optimizing user association and frequency reuse for multi-tier heterogeneous networks can effectively improve cell-edge user rate performance and utility. Base station (BS) cooperation is set to play a key role in managing interference in dense heterogeneous cellular networks (HCNs). Non-coherent joint transmission (JT) is particularly appealing due to its low complexity, smaller overhead, and ability for load balancing. However, a general analysis of this technique is difficult mostly due to the lack of tractable models. This paper addresses this gap and presents a tractable model for analyzing non-coherent JT in HCNs, while incorporating key system parameters such as user-centric BS clustering and channel-dependent cooperation activation. Assuming all BSs of each tier follow a stationary Poisson point process, the coverage probability for non-coherent JT is derived. Using the developed model, it is shown that for small cooperative clusters of small-cell BSs, non-coherent JT by small cells provides spectral efficiency gains without significantly increasing cell load. Further, when cooperation is aggressively triggered intra-cluster frequency reuse within small cells is favorable over intra-cluster coordinated scheduling. We consider transmit rate allocation and the associated cooperative decoding strategies in uplink multi-cell networks where base stations (BSs) are connected by capacity-limited backhaul (BH) links. In particular, we propose two cooperative group decoding (CGD) schemes for the BSs with partial decoding results shared via the BH. In parallel CGD, at each stage, each BS locally selects and jointly decodes a group of users by treating the remaining users as noise; then it forwards some partial decoding results to other BSs via the BH. After subtracting the decoded users and the received decoding results from other BSs, each BS repeats the same procedure until all its designated users are decoded. On the other hand, in sequential CGD, each user can be decoded at any BS. At each stage only one BS is selected to decode a group of users, which then forwards the decoding results to other BSs for interference cancellation. The process is repeated until all users are decoded. Numerical results are provided to demonstrate that the proposed CGD schemes offer significant gain in terms of the achievable rates. Femtocells are recognized as effective for improving network coverage and capacity and for reducing power consumption due to the reduced range of wireless transmissions. Although highly appealing, a plethora of challenging problems need to be addressed for fully harvesting its potential. In this paper, we investigate the problem of cell association and service scheduling in femtocell networks. In addition to the general goal of offloading traffic from the macrobase station (BS), we also aim at minimizing the latency of service requested by the users, while considering both open and closed access strategies. We show that the cell association problem is NP-hard, and propose several near-optimal solution algorithms for assigning users to BSs, including a sequential fixing algorithm, a rounding approximation algorithm, a greedy approximation algorithm, and a randomized algorithm. For service scheduling, we develop an optimal algorithm to minimize the average waiting time for the users associated with the same BS. The proposed algorithms are analyzed with respect to performance bounds, approximation ratios, and optimality, and are evaluated with simulations. Very recent studies showed that in a fully loaded dense small cell network (SCN), the coverage probability performance will continuously decrease with the network densification. Such new results were captured in IEEE ComSoc Technology News with an alarming title of "Will Densification Be the Death of 5G?". In this paper, we revisit this issue from more practical views of realistic network deployment, such as a finite number of active base stations (BSs) and user equipments (UEs), a decreasing BS transmission power with the network densification, etc. Particularly, in dense SCNs, due to an oversupply of BSs with respect to UEs, a large number of BSs can be put into idle modes without signal transmission, if there is no active UE within their coverage areas. Setting those BSs into idle modes mitigates unnecessary inter-cell interference and reduces energy consumption. In this paper, we investigate the performance impact of such BS idle mode capability (IMC) on dense SCNs. Different from existing work, we consider a realistic path loss model incorporating both line-of-sight (LoS) and non-line-of-sight (NLoS) transmissions. Moreover, we obtain analytical results for the coverage probability, the area spectral efficiency (ASE) and the energy efficiency (EE) performance for SCNs with the BS IMC and show that the performance impact of the IMC on dense SCNs is significant. As the BS density surpasses the UE density in dense SCNs, the coverage probability will continuously increase toward one, addressing previous concerns on "the death of 5G". Finally, the performance improvement in terms of the EE performance is also investigated for dense SCNs using practical energy models developed in the Green-Touch project. This paper proposes a method for designing base station (BS) clusters and cluster patterns for pair-wise BS coordination. The key idea is that each BS cluster is formed by using the second-order Voronoi region, and the BS clusters are assigned to a specific cluster pattern by using edge-coloring for a graph drawn by Delaunay triangulation. The main advantage of the proposed method is that the BS selection conflict problem is prevented, while users are guaranteed to communicate with their two closest BSs in any irregular BS topology. With the proposed coordination method, analytical expressions for the rate distribution and the ergodic spectral efficiency are derived as a function of relevant system parameters in a fixed irregular network model. In a random network model with a homogeneous Poisson point process, a lower bound on the ergodic spectral efficiency is characterized. Through system level simulations, the performance of the proposed method is compared with that of conventional coordination methods: dynamic clustering and static clustering. Our major finding is that, when users are dense enough in a network, the proposed method provides the same level of coordination benefit with dynamic clustering to edge users.