Millimeter wave (mmWave) signals are much more sensitive to blockage, which results in a significant increase of the outage probability, especially for the users at the edge of the cells. In this paper, we exploit the technique of base station (BS) cooperation to improve the performance of the cell-edge users in the downlink transmission of mmWave cellular networks. We design two cooperative schemes, which are referred to as fixed-number BS cooperation (FNC) scheme and fixed-region BS cooperation (FRC) scheme, respectively. In FNC scheme, the cooperative BSs consist of the M nearest BSs around the served cell-edge users, and in FRC scheme, the cooperative BSs include all the BSs located within a given region. We derive the expressions for the average rate and outage probability of a typical cell-edge user located at the origin based on the stochastic geometry framework. To reduce the computational complexity of our analytical results for the outage probability, we further propose a Gamma approximation based method to provide approximations with satisfying accuracy. Our analytical results incorporate the critical characteristics of mmWave channels, i.e., the blockage effects, the different path loss of LOS and NLOS links and the highly directional antenna arrays. Simulation results show that the performance of the cell-edge users is greatly improved when mmWave networks are combined with the technique of BS cooperation.
Based on the stochastic geometry model, BS cooperation in conventional microwave networks has already been extensively studied in the past few years @cite_2 @cite_20 @cite_9 @cite_17 @cite_10 @cite_1 @cite_26 @cite_34 .
@cite_26 @cite_9 @cite_1 @cite_2 @cite_34 @cite_10 @cite_20 @cite_17
2290746637 2087240286 2121822142 2336650418 1991712798 2065735671 2314232061 2069443635
This paper presents a stochastic geometry model for studying spatiotemporal base station cooperation in a cellular network. Unlike most previous related works in the literature, the paper focuses on the coverage probability at the typical cellcorner user, i.e., a user that is equidistant to its three neighboring base stations (BSs). Three schemes are considered: joint transmission, base station silencing, and the Alamouti space-time code. In addition, BSs are allowed to cooperatively retransmit data across consecutive time slots, such that the cell-corner user can benefit from time diversity. For all these schemes, an expression for the coverage probability at the cell-corner user is derived. The best performing scheme is shown to be the Alamouti code, when only two BSs cooperate. Otherwise, cooperative retransmission performs the best in the high-coverage regime, while joint transmission without retransmission outperforms the remaining schemes in all other regimes. These results extend previous findings on spatiotemporal base station cooperation that only applied to the typical user in a cellular network. 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 Stochastic geometry proves to be a powerful tool for modeling dense wireless networks adopting random MAC protocols such as ALOHA and CSMA. The main strength of this methodology lies in its ability to account for the randomness in the nodes' location jointly with an accurate description at the physical layer, based on the SINR, that allows to consider also random fading on each link. Existing models of CSMA networks adopting the stochastic geometry approach suffer from two important weaknesses: 1) they permit to evaluate only spatial averages of the main performance measures, thus hiding possibly huge discrepancies in the performance achieved by individual nodes; 2) they are analytically tractable only when nodes are distributed over the area according to simple spatial processes (e.g., the Poisson point process). In this paper we show how the stochastic geometry approach can be extended to overcome the above limitations, allowing to obtain node throughput distributions as well as to analyze a significant class of topologies in which nodes are not independently placed. This paper presents a tutorial on stochastic geometry (SG)-based analysis for cellular networks. This tutorial is distinguished by its depth with respect to wireless communication details and its focus on cellular networks. This paper starts by modeling and analyzing the baseband interference in a baseline single-tier downlink cellular network with single antenna base stations and universal frequency reuse. Then, it characterizes signal-to-interference-plus-noise-ratio and its related performance metrics. In particular, a unified approach to conduct error probability, outage probability, and transmission rate analysis is presented. Although the main focus of this paper is on cellular networks, the presented unified approach applies for other types of wireless networks that impose interference protection around receivers. This paper then extends the unified approach to capture cellular network characteristics (e.g., frequency reuse, multiple antenna, power control, etc.). It also presents numerical examples associated with demonstrations and discussions. To this end, this paper highlights the state-of-the-art research and points out future research directions. This paper characterizes the performance of coordinated beamforming with dynamic clustering. A downlink model based on stochastic geometry is put forth to analyze the performance of such a base station (BS) coordination strategy. Analytical expressions for the complementary cumulative distribution function (CCDF) of the instantaneous signal-to-interference ratio (SIR) are derived in terms of relevant system parameters, chiefly the number of BSs forming the coordination clusters, the number of antennas per BS, and the pathloss exponent. Utilizing this CCDF, with pilot overheads further incorporated into the analysis, we formulate the optimization of the BS coordination clusters for a given fading coherence. Our results indicate that: 1) coordinated beamforming is most beneficial to users that are in the outer part of their cells yet in the inner part of their coordination cluster and that 2) the optimal cluster cardinality for the typical user is small and it scales with the fading coherence. Simulation results verify the exactness of the SIR distributions derived for stochastic geometries, which are further compared with the corresponding distributions for deterministic grid networks. Stochastic geometry models for wireless communication networks have recently attracted much attention. This is because the performance of such networks critically depends on the spatial configuration of wireless nodes and the irregularity of the node configuration in a real network can be captured by a spatial point process. However, most analysis of such stochastic geometry models for wireless networks assumes, owing to its tractability, that the wireless nodes are deployed according to homogeneous Poisson point processes. This means that the wireless nodes are located independently of each other and their spatial correlation is ignored. In this work we propose a stochastic geometry model of cellular networks such that the wireless base stations are deployed according to the Ginibre point process. The Ginibre point process is one of the determinantal point processes and accounts for the repulsion between the base stations. For the proposed model, we derive a computable representation for the coverage probability—the probability that the signal-to-interference-plus-noise ratio (SINR) for a mobile user achieves a target threshold. To capture its qualitative property, we further investigate the asymptotics of the coverage probability as the SINR threshold becomes large in a special case. We also present the results of some numerical experiments. In this paper, a comprehensive study of the downlink performance in a heterogeneous cellular network (or HetNet) is conducted via stochastic geometry. A general HetNet model is considered consisting of an arbitrary number of open-access and closed-access tiers of base stations (BSs) arranged according to independent homogeneous Poisson point processes. The BSs within each tier have a constant transmission power, random fading factors with an arbitrary distribution and arbitrary path-loss exponent of the power-law path-loss model. For such a system, analytical characterizations for the coverage probability are derived for the max-SINR connectivity and nearest-BS connectivity models. Using stochastic ordering, interesting properties and simplifications for the HetNet downlink performance are derived by relating these two connectivity models to the maximum instantaneous received power (MIRP) connectivity model and the maximum biased received power (MBRP) connectivity models, providing good insights about HetNets and their downlink performance in these complex networks. Furthermore, the results also demonstrate the effectiveness and analytical tractability of the stochastic geometric approach to study the HetNet performance. 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.