Performance Analysis Of Cellular Networks Research Articles

Using Burr Type XII distribution for user — Nearest access point distance modelling in finite Poisson networks with edge effect

Uniform Poisson Point Processes (uPPPs) have been extensively used for performance analysis of cellular networks. Of particular importance is the distribution of the distance between a user node (UE) and its closest access point (AP), which is useful for performance evaluation purposes. In this paper, the Burr Type XII distribution is proposed as a mathematically tractable statistical model of such distances in finite Poisson networks with the presence of edge effect. This result is further employed to evaluate the outage probability and ergodic capacity of Poisson networks in the presence of Nakagami-m fading. The accuracy of the proposed model is substantiated by simulations. Our newly derived results include as limiting cases existing ones available in the literature, namely Rayleigh distributed distances.

Performance analysis of cellular networks with delay tolerant users

In this paper, we analyze the impact of delaying delay-tolerant calls under certain conditions in cellular networks. We propose to queue the call if the user agrees when the terminal has bad radio conditions and the system is loaded. The call is served as soon as radio conditions become good or the current load goes below a given threshold. We model the system as a continuous-time Markov chain, which allows us to compute the blocking probability, the mean waiting time and the mean service time. Numerical results show that when the proportion of users with delay tolerance is 20%, the system can bear 16% more calls with the same blocking probability, and 113% more calls if 80% of users are delay tolerant.

Performance Analysis of Cellular Networks With Opportunistic Scheduling Using Queueing Theory and Stochastic Geometry

Combining stochastic geometric approach with some classical results from queueing theory regarding generalized processor sharing queues, in this paper we extend the synthetic framework for the performance study of large cellular networks, previously proposed in Blaszczyszyn et al. , by allowing it to take into account opportunistic scheduling. Rapid and verifiable with respect to real data, our approach is particularly useful for network dimensioning and long term economic planning. It is based on a detailed network model combining an information-theoretic representation of the link layer, a queueing-theoretic representation of the users’ scheduler, and a stochastic-geometric representation of the signal propagation and the network cells. It allows one to evaluate principal characteristics of the individual cells, such as loads the mean number of users and the user throughput. A simplified, Gaussian approximate model is also proposed to facilitate study of the spatial distribution of these metrics across the network. Using of both models requires only simulations of the point process of base stations and the shadowing field to estimate the expectations of some stochastic-geometric functionals not admitting explicit expressions. A key observation of our approach, bridging spatial and temporal analysis, relates the SINR distribution of the typical user to the load of the typical cell of the network. The former is a static characteristic of the network related to its spectral efficiency while the latter characterizes the performance of the (generalized) processor sharing queue serving the dynamic population of users of this cell.

Fundamentals of Mobility-Aware Performance Characterization of Cellular Networks: A Tutorial

This paper provides a tutorial on mobility-aware performance analysis of cellular networks considering both the spatially random [where base stations (BSs) are deployed according to a homogeneous point process] and deterministic grid-based network deployment topologies. We first provide a summary of users’ mobility models with no spatiotemporal correlations (e.g., random walk, random way point, and random direction), with spatial correlations (e.g., pursue mobility and column mobility), and with temporal correlations (e.g., Gauss–Markov and Levy flight). The differences among various mobility models, their statistical properties, and their pros and cons are presented. We then describe two primary approaches (referred to as trajectory-based and association-based approaches) for mobility-aware performance analysis of both random and deterministic cellular networks. For the first approach (which is more general but less tractable than the other approach), we describe a general methodology and present several case studies for different cellular network tessellations, such as square lattice, hexagon lattice, single-tier, and multi-tier models in which BSs follow a homogeneous Poisson point process (PPP). For the second approach, we also outline the general methodology and highlight some limitations/imperfections of the existing techniques and provide corrections to these imperfections. For both of these approaches, we present selected numerical and simulation results to calibrate the achievable handoff rate and coverage probability in various network settings. Finally, we point out specific emerging fifth generation (5G) cellular wireless applications where the impact of mobility would be significant and outline the challenges associated with mobility-aware analysis of those network applications.

Stochastic Geometry Analysis of Downlink Data Rate Over Fast Fading Channels

Performance analysis of cellular networks using stochastic geometry has received extensive studies. Different from existing works that are mainly applicable for slow fading channels, in the letter, we consider fast fading channels and analyze the statistics of downlink achievable rate by first averaging out small-scale channels and then only treating large-scale channels as random variables. We first derive an approximated cumulative distribution function (CDF) of downlink achievable rate, based on which two approximated CDFs with simpler expressions are then developed. Simulations validate the accuracy of the derived analytical results, and an application example of the obtained results for video on demand service is demonstrated.

Performance Analysis of Cellular Networks with D2D communication Based on Queuing Theory Model

In this paper, we develop a spatiotemporal model to analysis of cellular user in underlay D2D communication by using stochastic geometry and queuing theory. Firstly, by exploring stochastic geometry to model the user locations, we derive the probability that the SINR of cellular user in a predefined interval, which constrains the corresponding transmission rate of cellular user. Secondly, in contrast to the previous studies with full traffic models, we employ queueing theory to evaluate the performance parameters of dynamic traffic model and formulate the cellular user transmission mechanism as a M/G/1 queuing model. In the derivation, Embedded Markov chain is introduced to depict the stationary distribution of cellular user queue status. Thirdly, the expressions of performance metrics in terms of mean queue length, mean throughput, mean delay and mean dropping probability are obtained, respectively. Simulation results show the validity and rationality of the theoretical analysis under different channel conditions.

Performance analysis of cellular networks with mobile relays under different modes

With the popularity of smart phones and tablets, people make intensive use of these devices on public transport. The deployment of mobile relays on public transport may increase the quality of mobile services.The objective of this paper is to study the performance of cellular networks when mobile relays are deployed in public transport vehicles. We consider two modes: in the FDD mobile relay mode, the same spectrum is reused for all links while in the TDD/FDD hybrid mode, a small part of the spectrum is dedicated to the access link between the terminals inside a transport vehicle and the mobile relay. We provide a general analytical model for the two mobile relay modes by using the stochastic geometry approach. Key metrics like the CDF of the SINR and the CDF of the end-to-end rate are computed. Furthermore, the cell total average rate and the energy efficiency in different modes are evaluated. It has been found that penetration loss is a factor that determines how much gain mobile relay can bring. Numerical results show that when the ratio of vehicular UEs in the cell is 0.4 and the penetration loss is 20 dB, the FDD mobile relay mode and the TDD/FDD hybrid mobile relay mode can achieve \(+16.3, +29.1\%\) cell rate gain respectively compared with the direct mode.

Handoff traffic characterization in cellular networks under nonclassical arrivals and service time distributions

The phenomenal growth in the subscriber population has necessitated the accurate dimensioning and performance analysis of cellular networks. Classically, cellular networks have been analyzed using Poisson call arrivals and negative exponential channel holding times. However, these assumptions may not be valid for modern networks providing heterogeneous services and serving users with highly varied mobility. In this paper, we propose a moment-based approach for analyzing cellular networks under more generalized arrival processes and more generalized channel holding-time distributions. We present a model for accurately characterizing the handoff traffic offered by a cell to its neighbor in a simple two-cell scenario. We derive this handoff traffic for two different channel holding-time distributions. Our two-cell model easily lends itself to being used as a building block for analyzing more general cellular network layouts. We illustrate the accuracy of our analysis using comparison with simulation results.

Performance analysis of cellular networks

Dynamic channel allocation can reduce the probability of blocking in cellular telephone networks. However, more is needed to achieve optimal performance. The author aims at estimating the minimal blocking probability for some simple cellular networks. Some dynamic channel allocation strategies are analyzed, the optimal performance (obtained by dynamic allocation and flow control) of some very simple networks is computed, and simple bounds on optimal performance are presented. These results lead to a better understanding of cellular networks and can be used to evaluate new control algorithms.< <ETX xmlns:mml="http://www.w3.org/1998/Math/MathML" xmlns:xlink="http://www.w3.org/1999/xlink">&gt;</ETX>