Performance analysis of a preemptive and priority reservation handoff scheme for integrated service-based wireless mobile networks

We propose an analytical model for integrated real-time and non-real-time services in a wireless mobile network with priority reservation and preemptive priority handoff schemes. We categorize the service calls into four different types, namely, real-time and non-real-time service originating calls, and real-time and non real-time handoff service request calls. Accordingly, the channels in each cell are divided into three parts: one is for real-time service calls only, the second is for non-real-time service calls only, and the last one is for overflow of handoff requests that cannot be served in the first two parts. In the third group, several channels are reserved exclusively for real-time service handoffs so that higher priority can be given to them. In addition, a realtime service handoff request has the right to preempt non-real-time service in the preemptive priority handoff scheme if no free channels are available, while the interrupted non-real-time service call returns to its handoff request queue. The system is modeled using a multidimensional Markov chain and a numerical analysis is presented to estimate blocking probabilities of originating calls, forced termination probability, and average transmission delay. This scheme is also simulated under different call holding time and cell dwell time distributions. It is observed that the simulation results closely match the analytical model. Our scheme significantly reduces the forced termination probability of real-time service calls. The probability of packet loss of non-real-time transmission is shown to be negligibly small, as a non-real-time service handoff request in waiting can be transferred from the queue of the current base station to another one.     

Design and Analysis of a Channel Assignment Scheme for CDMA/TDMA Mobile Networks

In this paper, a channel assignment scheme is proposed for use in CDMA/TDMA mobile networks carrying voice and data traffic. In each cell, three types of calls are assumed to compete for access to the limited number of available channels by the cell: new voice calls, handoff voice calls, and data calls. The scheme uses the movable boundary concept in both the code and time domains in order to guarantee the quality of service (QoS) requirements of each type. A traditional Markov analysis method is employed to evaluate the performance of the proposed scheme. Measures, namely, the new call blocking probability, the handoff call forced termination probability, the data call loss probability, the expected number of handoff and the handoff link maintenance probability are obtained from the analysis. The numerical results, which are validated by simulation, indicate that the scheme helps meet the QoS requirements of the different call types.     

Performance analysis of a dynamic handoff scheme in wireless networks with heterogeneous call arrival processes

The Guard Channel Scheme (GCS) and Handoff Queueing Scheme (HQS) are the popular and practical strategies to prioritize handoff calls in wireless cellular networks. A key issue of giving handoff calls the higher priority is how to achieve a tradeoff among the handoff call blocking probability, new call blocking probability and handoff delay. This paper extends GCS and HQS and presents an efficient handoff scheme that dynamically manages the channels reserved for handoff calls depending on the current status of the handoff queue. A three-dimensional Markov model is developed to analyze the performance of this scheme and investigate the desirable performance tradeoff. The Poisson process and Markov-Modulated-Poisson-Process (MMPP) are used to model the arrival processes of new and handoff calls, respectively. The accuracy of this model is evaluated through the extensive comparison of the analytical results to those obtained from discrete-event simulation experiments. Performance measures in terms of the mean number of calls in the system, aggregate response time, aggregate call blocking probability, handoff call blocking probability, new call blocking probability and handoff delay are evaluated. The analytical model is used to investigate the effects of the number of channels originally reserved for handoff calls, the number of dynamic channels, and the ratio of the rate of handover calls to the aggregate arrival rate on the system performance.     

Traffic model and performance analysis for cellular mobile radio telephone systems with prioritized and nonprioritized handoff procedures

A traffic model and analysis for cellular mobile radio telephone systems with handoff are described. Three schemes for call traffic handling are considered. One is nonprioritized and two are priority oriented. Fixed channel assignment is considered. In the nonprioritized scheme the base stations make no distinction between new call attempts and handoff attempts. Attempts which find all channels occupied are cleared. In the first priority scheme considered, a fixed number of channels in each cell are reserved exclusively for handoff calls. The second priority scheme employs a similar channel assignment strategy, but, additionally, the queueing of handoff attempts is allowed. Appropriate analytical models and criteria are developed and used to derive performance characteristics. These show, for example, blocking probability, forced termination probability, and fraction of new calls not completed, as functions of pertinent system parameters. General formulas are given and specific numerical results for nominal system parameters are presented.     

Analysis of a hybrid cutoff priority scheme for multiple classes of traffic in multimedia wireless networks

In this paper, we propose and analyze the performance of a new handoff scheme called hybrid cutoff priority scheme for wireless networks carrying multimedia traffic. The unique characteristics of this scheme include support for N classes of traffic, each may have different QoS requirements in terms of number of channels needed, holding time of the connection and cutoff priority. The proposed scheme can handle finite buffering for both new calls and handoffs. Futhermore, we take into consideration the departure of new calls due to caller impatience and the dropping of queued handoff calls due to unavailability of channels during the handoff period. The performance indices adopted in the evaluation using the Stochastic Petri Net (SPN) model include new call and handoff blocking probabilities, call forced termination probability, and channel utilization for each type of traffic. Impact on the performance measures by various system parameters such as queue length, traffic input and QoS of different traffic has also been studied. This revised version was published online in June 2006 with corrections to the Cover Date.     

Performance analysis of flexible hierarchical cellular systems witha bandwidth-efficient handoff scheme

In this paper, a bandwidth-efficient handoff strategy is proposed and analyzed for hierarchical cellular systems. Mobile subscribers are divided into two classes, i.e., low- and high-mobility subscribers. In our bandwidth-efficient handoff strategy, each of the originating and handoff calls of both slow and fast mobile subscribers first tries to get a channel in a microcell. Macrocells are overlaid over the microcells to handle overflowed calls. A call overflowed into a macrocell requests a take-back to the new microcell at each border crossing of the microcells. The request will be accommodated by the target microcell if there is any idle traffic channel in the cell. An analytical model is developed, and the most important performance measures such as the blocking probability of originating calls and the forced termination probability of calls are evaluated. It is shown through extensive comparisons with other candidate handoff strategies that if the total traffic load of the system is not very heavy, our scheme has the best bandwidth efficiency and can provide better quality of service for mobile subscribers without bringing too much processing expense to the system     

A MAC Protocol for New and Handoff Calls with Finite Population

A MAC protocol for new and handoff calls with a finite populationof users, rather than with an infinite user population as indynamic channel reservation scheme (DCRS), is considered. Similarto DCRS, we divide the wireless channels into shared channels andreserved channels. The handoff calls access any available channelwith probability of one, while the new calls access a sharedchannel with probability of one and access a reserved channel witha request probability. We propose three simpler formulae than thatused in the existing DCRS in setting the request probability. Inaddition, the handoff calls in our proposed protocol are allowedto queue in a finite buffer. To evaluate the system performance, amathematical model based on queuing theory, rather than asimulation method used in DCRS, is developed. It is a generalmodel that can be adopted for any types of request probabilitiesincluding DCRS. Suggestions of how to get the optimum values ofthe design parameters are also given.     

基于排队理论的信道分配算法研究

针对蜂窝移动通信系统,基于排队理论提出了一种信道分配方案。该方案将信道分为2部分:语音信道和数据保护信道。预留数据保护信道用于补偿数据丢包率,同时对语音业务设置FIFO排队缓冲器,切换呼叫优先占用缓冲器以确保切换优先。当语音信道空闲时,数据业务可以占用语音信道,一旦有语音呼叫请求到来且无可用语音信道,数据业务应释放占用的语音信道,在数据缓存器中排队等待。仿真结果表明该方案不仅降低了新增呼叫阻塞率和切换掉话率,而且提升了数据业务的性能。     

基于预留信道和强占优先相结合的接入策略

报道了一种用于话音／数据综合的蜂窝移动通信系统中的基于预留切换信道和强占优先策略相结合的业务接入方案。在本方案中为具有越区切换请求的话音呼叫提供了预留切换信道和强占数据业务的优先权相结合的接入策略。同时为了提高系统总的承载话音的业务量,也为新近产生的话音呼叫提供了一定的强占数据业务的优先权。结果表明：我们的方案可以为移动用户提供更好的服务质量。     

Traffic management in a multicode CDMA system supporting softhandoffs

A traffic management scheme is proposed in a multicode code-division multiple-access system supporting soft handoff that uses guard channels and a queue for real-time traffic. Preemptive queue control gives priority to queued handoff calls. Handoff traffic is derived as a function of the new call arrival rate, the size of the soft handoff region, mobile speed, the new call blocking probability, and the handoff failure probability. System performance with K types of calls is analyzed by introducing a concept of effective channel. The effects of the number of guard channels, the number of effective channels, system capacity, and other factors are numerically investigated. The effectiveness of the proposed queue control scheme is also observed in terms of handoff processing delay     

Dynamic channel reservation based on mobility in wireless ATMnetworks

We present a dynamic channel reservation scheme to improve the utilization of wireless network resources while guaranteeing the required QoS of handoff calls. The wireless channels are dynamically reserved by using the request probability determined by the mobility characteristics and channel occupancy to guarantee acceptable quality of handoff calls and keep the new call blocking probability as low as possible     

Performance analysis of CDMA cellular networks with channel sub‐rating

This paper presents the analysis of CDMA cellular networks with channel sub‐rating. From users' point of view, our considered scheme gives higher priority to handoff calls over new calls by sub‐rating the existing connections when handoff calls find no idle channels upon their arrivals. Therefore, it is considered that the disadvantage of the soft handoff which needs more channels than the hard handoff is made up for. Handoff calls can also wait in a queue while they are in handoff areas if all channels are sub‐rated in the cell of interest. We mathematically model this scheme by applying queueing theory. Then, we analyse its performance to derive the blocking probabilities of the new and handoff calls, the probability that handoff calls leave the handoff area without getting new channels, the degradation ratio of the voice quality by sub‐rating, mean and coefficient of variation of the waiting time of handoff calls. In numerical results, the analytical results are compared with the simulation ones to validate our analytical approach. Moreover, we compare the sub‐rating scheme with full‐rating one with respect to some characteristic values to show the effect of sub‐rating. Copyright © 2005 John Wiley & Sons, Ltd.     

Teletraffic performance evaluation of microcellular personalcommunication networks (PCN's) with prioritized handoff procedures

Evaluates four handoff priority-oriented channel allocation schemes. These give priority to handoff calls by reserving channels exclusively for handoff calls. The measurement-based handover channel adaptive reassignment scheme (MHAR-A) exclusively uses reserved handover channels for newly originated calls if a certain criterion is satisfied. All four schemes studied differ from the conventional guard channel-based handover priority-oriented channel allocation scheme. To study the schemes, a personal communication network (PCN) based on city street microcells is considered. A teletraffic simulation model accommodating a fast moving vehicle is developed, and the performance parameters are obtained. The performances of all four schemes are compared with the nonpriority scheme and the conventional guard channel-based handover priority-oriented channel allocation scheme. It was found that some of the channel allocation algorithms studied improved the teletraffic capacity over the nonpriority and the conventional guard case. Also, the probability of new call blocking and carried traffic was improved for three of the schemes when compared to the conventional guard scheme. The MHAR-A scheme did not perform up to expectation. Nevertheless, it can be used to finely control the communication service quality equivalent to the control obtained by varying the number of handoff channels in a fraction of one. Increasing the number of reserved handover channels in fraction of one can never be achieved in the conventional guard channel-based handover priority-oriented channel allocation scheme     

Admission control scheme for soft handoff in DS-CDMA cellular systems supporting voice and stream-type data services

The soft handoff call requests of real-time services in third-generation (3G) direct-sequence code-division multiple access (DS-CDMA) and first- and second-generation cellular systems are more important than new call requests from the viewpoint of quality of service (QoS). Rejection of soft handoff requests causes forced termination of an ongoing real-time call, which is a severer problem than blocking of new call attempts. An admission control scheme that can guarantee a higher QoS for the soft handoff requests of real-time services in 3G DS-CDMA systems is proposed for delay-sensitive voice and delay-tolerant stream-type data services. The proposed scheme (P-Scheme) accommodates both voice and data services by utilizing the full bandwidth. However, voice soft handoff call requests are given priority over new voice call and stream-type data packet requests by suppressing interference from stream-type data services according to voice soft handoff requests, and by varying interference levels. Performance of the P-Scheme is evaluated using a Markovian model. Results are compared with a conventional reservation scheme (C-Scheme) that reserves resources exclusively for voice soft handoff requests. Numerical results show that system performance can be significantly improved using the proposed P-Scheme, compared with the conventional C-Scheme, when various types of service are supported in third-generation DS-CDMA systems.     

Performance Analysis of QoS-Based Voice/Data CDMA Systems

This paper examines the performance of a quality-based voice/data CDMA systemwhere new and handoff calls are considered. A call request for handoff dataqueues up if the signal-to-interference ratio exceeds a predefined thresholdwhile priority is given to handoff voice calls by exclusively reserving somechannels for them. The transmission rate of data users may vary according tomeasured SIR value. The transmission power of voice and data users may bedifferent. Important performance measures of the system such as blockingprobability and system capacity for voice and data calls are also compared fordifferent schemes.     

Adaptive channel reservation for call admission control to support prioritized soft handoff calls in a cellular CDMA system

This paper proposes a prioritized call admission control (CAC) model to support soft handoff calls with quality of service (QoS) assurances for both the uplink and downlink connections in a CDMA system. CAC is formulated as a combinatorial optimization problem in which the problem objective is to minimize the handoff forced termination rate. The model, which is based on the adaptive channel reservation (ACR) scheme for prioritized calls, adapts to changes in handoff traffic where the associated parameters (reserved channels, and new and handoff call arrival rates) can be varied. To solve the optimization model, iteration-based Lagrangean relaxation is applied by allocating a time budget. We express our achievements in terms of the problem formulation and performance improvement. Computational experiments demonstrate that the proposed ACR scheme outperforms other approaches when there are fewer rather than more channels, and it reduces the handoff call blocking rate more efficiently when the handoff traffic is heavily loaded. Moreover, the model can be adapted to any kind of reservation service.     

Handoff priority scheme with preemptive, finite queueing and reneging in mobile multiservice networks

A scheme supporting voice and data calls with some grade of service (GoS)¹ guarantee in mobile multiservice networks is proposed. In this system, voice calls have preemptive priority over data calls. Preempted data calls can wait in a queue for a random patience time after which they leave the queue. A data call can be preempted only if there is space left in the finite size queue. To assess the performance of this system, an analytical model is given and performance metrics such as call blocking, call dropping and call non‐completion probabilities are investigated. Although this scheme is a generic model, it can be easily adapted to take into account the specific definitions of practical and commercial data service standards in wireless mobile networks such as GPRS or DECT. This revised version was published online in June 2006 with corrections to the Cover Date.     

Class-Based Service Connectivity Using Multi-level Bandwidth Adaptation in Multimedia Wireless Networks

Due to the fact that quality of service requirements are not very strict for all traffic types, more calls of higher priority can be accommodated by reducing some bandwidth allocation for the bandwidth adaptive calls. The bandwidth adaptation to accept a higher priority call is more than that of a lower priority call. Therefore, the multi-level bandwidth adaptation technique improves the overall forced call termination probability as well as provides priority of the traffic classes in terms of call blocking probability without reducing the bandwidth utilization. We propose a novel bandwidth adaptation model that releases multi-level of bandwidth from the existing multimedia traffic calls. The amount of released bandwidth is decided based on the priority of the requesting traffic calls and the number of existing bandwidth adaptive calls. This prioritization of traffic classes does not reduce the bandwidth utilization. Moreover, our scheme reduces the overall forced call termination probability significantly. The proposed scheme is modeled using the Markov Chain. The numerical results show that the proposed scheme is able to provide negligible handover call dropping probability as well as significantly reduced new call blocking probability of higher priority calls without increasing the overall forced call termination probability.     

Analysis of a cutoff priority cellular radio system with finitequeueing and reneging/dropping

Queueing of new or handoff calls can minimize blocking probabilities or increase total carried traffic. This paper investigates a new cutoff priority cellular radio system that allows finite queueing of both new and handoff calls. We consider the reneging from the system of queued new calls due to caller impatience and the dropping of queued handoff calls by the system as they move out of a handoff area before being accomplished successfully. We use signal-flow graphs and Mason's formula to obtain the blocking probabilities of new and handoff calls and the average waiting times. Moreover, an optimal cutoff parameter and appropriate queue sizes for new and handoff calls are numerically determined so that a proposed overall blocking probability is minimized     

Analysis of a hierarchical cellular system with reneging anddropping for waiting new and handoff calls

We analyze a hierarchical cellular system with finite queues for new and handoff calls. Both the effect of the reneging of waiting new calls because of the callers' impatience and the effect of the dropping of queued handoff calls as the callers move out of the handoff area are considered, besides the effect of the guard channel scheme. We successfully solve the system by adopting the multidimensional Markovian chain and using the transition-probability matrix and the signal-flow graph to obtain the average new-call blocking probability, the forced termination probability, and the average waiting time of queued new and handoff calls. We further investigate how the design parameters of the buffer sizes and guard channel numbers in macrocell and microcells affect the performance of the hierarchical cellular system. The results show that provision of a buffering scheme and guard channel scheme can effectively reduce the new call blocking probability and the forced termination probability in the hierarchical cellular system, and the effectiveness is more significant in the macrocell than in the microcells