Transient handover blocking probabilities in road covering cellular mobile networks
3
Citation
9
Reference
10
Related Paper
Citation Trend
Keywords:
Blocking (statistics)
Transient (computer programming)
Call blocking
In cellular systems there is usually an overlap cell coverage area (area covered by two or more base stations) which has valuable practical applications. Particularly, it permits the queuing of handover requests as a handover prioritization scheme. The modeling of the sojourn time in the overlap area is a topic which is not sufficiently explored, and even less is the effect it may have on the performance of prioritized channel assignment schemes based on handover queuing. In this paper we develop an analytical model for a cellular system with channel reservation for handovers and handoff queuing. In our model, the common assumption of exponentially distributed maximum queuing time is removed and a general distribution is allowed. The model is used to quantify the influence that the coefficient of variation of the overlap area sojourn time has on system performance. We also propose an approximate model that is more versatile and numerically more efficient than the exact model.
Prioritization
Cite
Citations (16)
In this paper, we suggest a new dynamic channel assignment scheme with two types of channel allocation strategies, and perform an analysis on the handoff probabilities of handoff and new calls. Our scheme is compared with other existing schemes in terms of three types of blocking probabilities-new call blocking probability, handover blocking probability, and network blocking probability. Simulation results show that our scheme significantly reduces those blocking probabilities over the existing schemes. Furthermore, our scheme has much smaller number of reallocations than other schemes.
Blocking (statistics)
Call blocking
Channel allocation schemes
Cite
Citations (0)
In cellular networks, blocking occurs when a base station has no free channel to allocate to a mobile user. One distinguishes between two kinds of blocking, the first is called new call blocking and refers to blocking of new calls, the second is called handoff blocking and refers to blocking of ongoing calls due to the mobility of the users. We first provide explicit analytic expressions for the two kinds of blocking probabilities in two asymptotic regimes, i.e., for very slow mobile users and for very fast mobile users, and show the fundamental differences between these blocking probabilities. Next, an approximation is introduced in order to capture the system behavior for moderate mobility. The approximation is based on the idea of isolating a set of cells and having a simplifying assumption regarding the handoff traffic into this set of cells, while keeping the exact behavior of the traffic between cells in the set. It is shown that a group of 3 cells is enough to capture the difference between the blocking probabilities of handoff call attempts and new call attempts.
Blocking (statistics)
Call blocking
Cite
Citations (57)
Blocking (statistics)
Transient (computer programming)
Call blocking
Cite
Citations (3)
In this paper, the effects of soft handoff (HO) on outage and call blocking in cellular CDMA are investigated. The blocking probability of an interference based call admission scheme is analyzed in the presence of soft HO. The influence of soft HO parameters, shadowing correlation and PCE (power control error) on outage and call blocking have been studied.
Blocking (statistics)
Call blocking
Soft handover
Cellular radio
Call Admission Control
Shadow mapping
Cite
Citations (2)
In this paper, we investigate the call blocking probability calculations in the uplink of W-CDMA mobile cellular networks. In these networks, we distinguish two types of blocking, the new-call blocking, which concerns the initial call establishment request, and the handoffcall blocking, due to the users' mobility from one cell to the other. To analyze the system, we describe it by a Discrete Time Markov Chain, and based on it, we derive a recursive formula for the calculation of the state probabilities. Consequently, the new-call blocking probabilities and the handoffcall blocking probabilities are determined. To evaluate the proposed formulas, the analytical results are compared with simulation results. This comparison shows that the accuracy of the proposed formulas is very satisfactory.
Blocking (statistics)
Call blocking
Cellular radio
Cite
Citations (14)
The geographical connection admission control (GCAC) algorithm is introduced for low Earth orbit (LEO) satellite networks. The GCAC scheme estimates the future handover blocking probability of a new call attempt based on the user location database, in order to decrease the handover blocking. By simulation, it is shown that the proposed GCAC scheme guarantees the handover blocking probability to a predefined target level. Since GCAC algorithm utilizes the user location information, performance evaluation shows that this technique also guarantees the target level of handover blocking probability in the nonuniform traffic pattern.
Blocking (statistics)
Call blocking
Cite
Citations (11)
In cellular networks, blocking occurs when a base station has no free channel to allocate to a mobile user, blocking can be new call blocking or handoff call blocking. One of the research challenges for cellular systems is the design of improved call admission control scheme which will reduce call blocking probability and improve the quality of service. The Previously proposed schemes are reviewed here through which we can build such a scheme in future for cellular network which can easily improve the quality of service.
Blocking (statistics)
Call blocking
Call Admission Control
Cellular traffic
Cite
Citations (2)
Cellular communication systems that support a mixture of platform types distinguished by different mobility characteristics are considered. A tractable analytical model for traffic performance analysis is developed using multidimensional birth-death processes and the method of phases. The framework allows consideration of homogeneous and nonhomogeneous systems, a broad class of dwell time distributions, and missed handoff initiations. Cut-off priority for handoffs and several platform types are considered to demonstrate the approach. The effects of different mobility parameters and of imperfect detection of handoff needs are examined. Theoretical performance characteristics are obtained. These exhibit carried traffic, handoff activity, blocking probability, and forced termination probability for each platform type. The realizable exchange of blocking for handoff performance is shown.< >
Blocking (statistics)
Dwell time
Call blocking
Cite
Citations (11)
In this paper, a geometrical analysis is proposed to analyse the performance of call blocking probability in low earth orbit (LEO) satellite networks. Call blocking probability is an important measure to analyse the performance of LEO satellite networks. Assuming shape of the corresponding cells in the footprint of a typical LEO satellite network is hexagonal, a theorem on calculating the maximum call blocking probability is proven. Furthermore, by applying the theorem, the impact of the peak traffic, half depression angle and the height of LEO satellite networks on call blocking probability is also analysed. The results we get can be used as a reference for the performance optimization of LEO satellite networks.
Blocking (statistics)
Call blocking
Footprint
Communications satellite
Cite
Citations (0)