Modeling and analysis of hierarchical cellular networks with bidirectional overflow and take-back strategies under generally distributed cell residence times

The rapid growth of wireless services and mobile users drives a great interest in cellular networks with a hierarchical structure. Hierarchical cellular networks (HCNs) can provide high system capacity, efficient channel utilization and inherent load-balancing capability. In this paper, we develop an analytical model and a performance analysis method for a two-layer HCN with bidirectional overflow and take-back strategies. Mobile users are divided into two classes. The call requests (including new and handoff calls) of fast and slow users are preferably assigned to the macrolayer and microlayer, respectively. A call from a fast user or slow user can overflow to its non-preferable layer if there is no channel available. The successful overflow call can be taken back to its preferable layer if a channel becomes available. Since the commonly used exponentially distributed assumption for cell residence time and then the channel occupancy time does not hold for emerging mobile networks, we model various cell residence times by general distributions to adapt to more flexible mobility environments. The channel occupancy times are derived in terms of the Laplace transforms of various cell residence times. The handoff rates, overflow rates and take-back rates of each layer are also derived in terms of the new call arrival rates and related probabilities. The stationary probabilities (and then the performance measures) are determined on the basis of the theory of multi-dimensional loss systems.     

Modeling PCS networks under general call holding time and cellresidence time distributions

In a personal communication service (PCS) network, the call completion probability and the effective call holding times for both complete and incomplete calls are central parameters in the network cost/performance evaluation. These quantities will depend on the distributions of call holding times and cell residence times. The classical assumptions made in the past that call holding times and cell residence times are exponentially distributed are not appropriate for the emerging PCS networks. This paper presents some systematic results on the probability of call completion and the effective call holding time distributions for complete and incomplete calls with general cell residence times and call holding times distributed with various distributions such as gamma, erlang, hyperexponential, hyper-erlang, and other staged distributions. These results provide a set of alternatives for PCS network modeling, which can be chosen to accommodate the measured data from PCS field trials. The application of these results in billing rate planning is also discussed     

Modeling call holding time distributions for CCS network design andperformance analysis

The message traffic offered to the CCS signaling network depends on and is modulated by the traffic characteristics of the circuit switched calls supported by the CCS network. Most previous analyses of CCS network engineering, performance evaluation and congestion control protocols generally assume an exponential holding time of circuit switched calls. Analysis of actual holding time distributions in conversations, facsimile and voice mail connections revealed that these distributions radically differ from the exponential distribution. Especially significant is the large proportion of very short calls in real traffic in comparison with the exponential distribution model. The diversity of calls (partial dialing, subscriber busy, no answer) and services results in a multi-component call mix, with even larger proportion of short time intervals between message-generating events. Very short call holding times can have a significant impact on the traffic stream presented to the CCS network: for calls with short holding times, the different CCS messages arrive relatively close to each other, and this manifests as burstiness in the CCS traffic stream     

Efficient cell selection algorithm in hierarchical cellular networks: multi-user coordination

In a hierarchical cellular network employing universal frequency reuse, the level of both intra- and intercell interference largely depends on the selection of a serving cell for the users in the overlapping area of multiple cells. We propose an efficient cell selection algorithm that is suitable for hierarchical cellular networks. In the proposed algorithm, uplink transmit power is used as a key parameter and cells are selected on the basis of the coordination of multiple users, rather than the choice of a single user. Simulation results show that the proposed algorithm improves performance with respect to the number of supportable users and the transmit power that each user needs in order to achieve a given target SINR.     

Performance evaluation of hierarchical cellular CDMA networks with soft handoff queueing

We consider hierarchical cellular code-division multiple-access networks supporting soft handoff, where users with different mobility are assigned to different layers, i.e., microcells in the lower layer are used to carry slow users, whereas macrocells in the upper layer are for fast users, and handoff queues are provided for handoff calls that cannot obtain the required channel immediately, so that forced termination probability can be reduced. According to whether handoff queues are provided in microcells and/or macrocells, four different call admission control schemes are proposed and studied. We derive the mathematical model of the considered system with multidimensional birth-death process and utilize Gauss-Seidel iterative method to find the steady-state probability distribution and thus the performance measures of interest: new call blocking probability, handoff failure probability, and forced termination probability. Analytical results show that providing handoff queues in both microcells and macrocells can achieve largest performance improvement. Furthermore, handoff queue size greater than a threshold is shown to have little effect on performance measures of interest. Last but not least, the studied two-tier system is compared with a one-tier counterpart. It is shown that the two-tier system performs better in terms of average number of handoffs per fast call.     

State-dependent control of call arrivals in layered cellular mobile networks

Layered cellular mobile networks have been widely proposed as a way of accommodating traffic growth in mobile communications. There is a need, however, to give some form of priority to handover attempts over fresh call attempts to ensure that handovers are fast and reliable. A class of call control policies with state-dependent control of fresh call arrivals is considered for this purpose. A modified version of the Value Iteration Algorithm is used to solve a Markov decision model for the optimal call control policy. The network blocking performance under optimal state-dependent control is compared with the performance under a much simpler channel reservation policy for a model of a cellular sub-network. The channel reservation policy is shown to perform nearly as well as the optimal policy at lower loads, where fresh call blocking is less than 5%, indicating that it is both an effective and an efficient method for ensuring good handover performance.     

我国不同积分时间降雨率的统一转换模式

1min积分时间降雨率概率分布是10GHz以上无线电系统雨衰减预测的基础性数据。但多数气象台站降雨率数据的积分时间大于1min,因而需要一种有效的转换方法。为此利用我国典型气候区的实测降雨率数据对几种不同积分时间降雨率转换模式进行了参数拟合与结果比较,在比较研究的基础上,提出了我国统一的转换模式。这一模式可较好地用于我国不同地区的降雨率转换。     

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     

WCDMA与其它蜂窝系统共存时电磁兼容性能研究

通过系统级仿真对WCDMA与相邻频段其它蜂窝系统的电磁兼容问题进行了研究.基于系统级蒙特卡罗仿真技术,提出了一个完整的系统共存仿真容量方案,研究由于射频干扰造成的WCDMA系统的容量损失情况.在计算系统间干扰时,提出了一种称为等效技术的方法,大大提高了仿真速度.给出了可能存在的四种蜂窝系统的干扰造成的容量损失结果.     

Modeling and call admission control algorithm of variable bit ratevideo in ATM networks

The authors propose a new method for the modeling and call admission control (CAC) of variable bit rate video source, which come to the front of ATM networks as hot issues nowadays. First, the modeling of video source is accomplished using the three-state Markov chains including the effects of scene change at which the bit rate of video source is abruptly increased. Also, using two AR models, they improve the defects which an AR model has in modeling a video source. In addition, they represent the analytical model of a video source so that a network manager can acquire the information which is very important in managing the entire networks. CAC is accomplished using the previously defined analytical model. A routing manager calculates the cell loss probability of a chosen VP where a new call is connected so that the routing manager decides whether this new call is accepted or not. This calculation is accomplished through the GB/D/1-S queuing system. Using BIA (bandwidth increasing algorithm), they check whether the calls rejected by the routing manager could be accepted if possible. Finally, the applicable procedures to suitable allocate bandwidth to each VP on a link are presented in detail     

Modeling of customer retrial phenomenon in cellular mobile networks

In the planning of modern cellular mobile communication systems, the impact of customer behavior has to be carefully taken into account. Two models dealing with the call retrial phenomenon are presented. The first model considers a base station with a finite customer population and repeated attempts. A Markov chain modeling is proposed, and an efficient recursive solution of the state probabilities is presented. The second model focuses on the use of the guard channel concept to prioritize the handover traffic. Again, the retrial phenomenon plays an important role. The influence of the repeated attempt effect on the quality of service experienced by the mobile customers is discussed by means of numerical results     

Equilibrium analysis of cellular neural networks

Cellular neural networks (CNNs) are dynamical systems, described by a large set of coupled nonlinear differential equations. The equilibrium-point analysis is an important step for understanding the global dynamics and for providing design rules. We yield a set of sufficient conditions (and a simple algorithm for checking them) ensuring the existence of at least one stable equilibrium point. Such conditions give rise to simple constraints, that extend the class of CNNs, for which the existence of a stable equilibrium point is rigorously proved. In addition, they are suitable for design and easy to check, because they are directly expressed in term of the template elements.     

Handoff traffic characterization in cellular networks undernonclassical 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     

Traffic analysis of heterogeneous mobile cellular networks using “wrap-up” cell structure

In this paper, we develop a tool for evaluating performance of a heterogeneous mobile network under different traffic conditions. The traffic condition is specified in a cluster of seven heterogeneous base stations, and “wrap-up” cell structure is applied to account for the traffic that crosses the boundary of the cluster. The performance of the network is specified in metrics which can be computed using the algorithm developed. These metrics relate to call rejection, i.e. the blocking of new calls, and the termination of handoff calls, as well as the carried traffic i.e. the expected number of ongoing calls in a station. These metrics are either measured for a single base station in a cluster, or measured for the average over the whole cluster. We apply the algorithm to some hypothetical data and present the numerical results. We also consider approximating a heterogeneous model with a simpler homogeneous model. Through some numerical results, we demonstrate the magnitude of errors that could result in the approximation.     

An efficient bandwidth allocation scheme for hierarchical cellular networks with energy harvesting: an actor-critic approach

In this paper, we propose an efficient bandwidth allocation strategy for multiclass services in hierarchical cellular networks that consist of an operation controller, several small-cell base stations (SBSs), and a number of mobile users. Each SBS is equipped with a finite-capacity battery that is regularly recharged by a solar harvester. We aims to find the optimal bandwidth allocation policy in order to enhance the network performance in terms of user satisfaction and energy efficiency under energy harvesting and bandwidth sharing constraints. Since the arrivals of harvested energy and traffic requests are unknown due to users’ mobility and stochastic request generation, it is necessary to design a learning framework for the controller in order to predict these dynamics through interaction with the environment. For this purpose, we first formulate the resource allocation problem as the framework of a Markov decision process, and then, we employ an actor-critic algorithm to find the optimal policy under which the controller can effectively allocate the limited bandwidth to the SBSs for their data transmissions. We evaluate the performance of the proposed scheme through comprehensive simulations with different settings, and show that the proposed bandwidth allocation scheme can enhance the network’s performance in the long run.     

Reliability analysis of a two-unit parallel system with dissimilar units and general distributions

We study the reliability characteristics of a parallel system attended by a single repair facility and general failure and repair time probability distribution functions (pdf). The basic mathematical problem is the solution of a pair of simultaneous Wiener-Hopf integral equations.A formal solution procedure of the equations has been discussed in the case of unspecified characteristic functions (cf).Fairly explicit solutions are performed if at least one of the failure time pdf's has a rational cf.We compare some of the results presented in previous literature.     

Optimal resource allocation and adaptive call admission control for voice/data integrated cellular networks

Resource allocation and call admission control (CAC) are key management functions in future cellular networks, in order to provide multimedia applications to mobiles users with quality of service (QoS) guarantees and efficient resource utilization. In this paper, we propose and analyze a priority based resource sharing scheme for voice/data integrated cellular networks. The unique features of the proposed scheme are that 1) the maximum resource utilization can be achieved, since all the leftover capacity after serving the high priority voice traffic can be utilized by the data traffic; 2) a Markovian model for the proposed scheme is established, which takes account of the complex interaction of voice and data traffic sharing the total resources; 3) optimal CAC parameters for both voice and data calls are determined, from the perspective of minimizing resource requirement and maximizing new call admission rate, respectively; 4) load adaption and bandwidth allocation adjustment policies are proposed for adaptive CAC to cope with traffic load variations in a wireless mobile environment. Numerical results demonstrate that the proposed CAC scheme is able to simultaneously provide satisfactory QoS to both voice and data users and maintain a relatively high resource utilization in a dynamic traffic load environment. The recent measurement-based modeling shows that the Internet data file size follows a lognormal distribution, instead of the exponential distribution used in our analysis. We use computer simulations to demonstrate that the impact of the lognormal distribution can be compensated for by conservatively applying the Markovian analysis results.     

Mesh结构P/G布线网络层次化快速分析方法

本文提出了一个基于网络划分的P／G布线网络层次化快速分析方法。其中，对于子网运算，通过对Cholesky分解法三角化对称正定阵的图模型分析，并基于Mesh结构网络的自身特点，提出了一个基于图顶点排序的加速子网分析运算策略；并用基于MPI的并行结构实现了P／G布线网络分析的并行运算。     

Hybrid analysis of response time distributions in queueing networks

A hybrid analytic/simulation methodology is formulated for evaluating end-to-end response time distributions in closed product-form queueing networks. The method combines Markov-Monte-Carlo simulation with analytical results pertaining to uniformized Markov chains and product-form queuing networks. A stratified sampling plan is incorporated as a variance reduction technique. The concept of importance sampling is used to reduce the computational requirements of the plan and make it realizable in practice. The most important consequence of applying uniformization is that it enables the characterization of the response time distribution as an infinite mixture of Erlangian distributions. An estimate of the entire response time distribution may then be obtained in each simulation trial. This circumvents the practical problems associated with estimating tail probabilities. A numerical example is provided to illustrate the theory