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.     

Adaptive quality of service handoff priority scheme for mobilemultimedia networks

For various advantages including better utilization of radio spectrum (through frequency reuse), lower mobile transmit power requirements, and smaller and cheaper base station equipment, future wireless mobile multimedia networks are likely to adopt micro/picocellular architectures. A consequence of using small cell sizes is the increased rate of call handoffs as mobiles move between cells during the holding times of calls. In a network supporting multimedia services, the increased rate of call handoffs not only increases the signaling load on the network, but makes it very difficult for the network to guarantee the quality of service (QoS) promised to a call at setup or admission time. This paper describes an adaptive QoS handoff priority scheme which reduces the probability of call handoff failures in a mobile multimedia network with a micro/picocellular architecture. The scheme exploits the ability of most multimedia traffic types to adapt and trade off QoS with changes in the amount of bandwidth used. In this way, calls can trade QoS received for fewer handoff failures. The call level and packet level performance of the handoff scheme are studied analytically for a homogeneous network supporting a mix of wide-band and narrow-band calls. Comparisons are made to the performance of the nonpriority handoff scheme and the well-known guard-channel handoff scheme     

An adaptive measured-based preassignment scheme withconnection-level QoS support for mobile networks

This paper presents a new adaptive bandwidth allocation scheme to prevent handoff failure in wireless cellular networks, known as the measurement-based preassignment (MPr) technique. This technique is particularly useful in micro/pico cellular networks which offers quality-of-service (QoS) guarantee against call dropping. The proposed MPr scheme distinguishes itself from the well-known guarded channel (GC) based schemes in that it allows the handoff calls to utilize a prereserved channel pool before competing for the shared channels with new call arrivals. The key advantage of the proposed MPr scheme is that it enables easy derivation of the number of channels that needs to be reserved for handoff based on a predetermined handoff dropping probability, without the need for solving the often complex Markov chain required in GC schemes, thus, making the proposed MPr scheme simple and efficient for implementation. This is essential in handling multiple traffic types with potentially different QoS requirements. In addition, the MPr scheme is adaptive in that it can dynamically adjust the number of reserved channels for the handoff according to the periodical measurement of the traffic status within a local cell, thus completely eliminating the signaling overhead for status information exchange among cells mandated in most existing channel allocation schemes. Numerical results and comparisons are given to illustrate the tradeoff     

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.     

A call admission control scheme for packet data in CDMA cellular communications

In wireless cellular communication systems, call admission control (CAC) is to ensure satisfactory services for mobile users and maximize the utilization of the limited radio spectrum. In this paper, we propose a new CAC scheme for a code division multiple access (CDMA) wireless cellular network supporting heterogeneous self-similar data traffic. In addition to ensuring transmission accuracy at the bit level, the CAC scheme guarantees service requirements at both the call level and the packet level. The grade of service (GoS) at the call level and the quality of service (QoS) at the packet level are evaluated using the handoff call dropping probability and the packet transmission delay, respectively. The effective bandwidth approach for data traffic is applied to guarantee QoS requirements. Handoff probability and cell overload probability are derived via the traffic aggregation method. The two probabilities are used to determine the handoff call dropping probability, and the GoS requirement can be guaranteed on a per call basis. Numerical analysis and computer simulation results demonstrate that the proposed CAC scheme can meet both QoS and GoS requirements and achieve efficient resource utilization.     

多媒体业务在越区切换中服务质量保证方法的研究

为了降低多媒体业务在移动环境中的呼叫中断率,提高无线信道的利用率,该文提出了一种动态预留带宽分配机制(DRBA),该机制对到达的越区切换呼叫按业务类型区别处理,对于高优先级的实时业务,通过在邻近小区内预留带宽的方法降低呼叫中断率;对于非实时业务,当小区内的信道带宽不足以支持新到达的越区切换呼叫时,通过动态地借用实时业务过度预留的带宽,改善非实时业务的呼叫中断率,进一步达到提高无线信道利用率,为不同的业务类型提供公平的服务质量(QoS)的目标。     

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

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

Adaptive resource allocation for prioritized call admission over anATM-based wireless PCN

In future personal communications networks (PCNs) supporting network-wide handoffs, new and handoff requests will compete for connection resources in both the mobile and backbone networks. Forced call terminations due to handoff call blocking are generally more objectionable than new call blocking. The previously proposed guard channel scheme for radio channel allocation in cellular networks reduces handoff call blocking probability substantially at the expense of slight increases in new call blocking probability by giving resource access priority to handoff calls over new calls in call admission control. While the effectiveness of a fixed number of guard channels has been demonstrated under stationary traffic conditions, with nonstationary call arrival rates in a practical system, the achieved handoff call blocking probability may deviate significantly from the desired objective. We propose a novel dynamic guard channel scheme which adapts the number of guard channels in each cell according to the current estimate of the handoff call arrival rate derived from the current number of ongoing calls in neighboring cells and the mobility pattern, so as to keep the handoff call blocking probability close to the targeted objective while constraining the new call blocking probability to be below a given level. The proposed scheme is applicable to channel allocation over cellular mobile networks, and is extended to bandwidth allocation over the backbone network to enable a unified approach to prioritized call admission control over the ATM-based PCN     

Modeling and efficient handling of handoffs in integrated wireless mobile networks

We propose and analyze two handoff schemes without and with preemptive priority procedures for integrated wireless mobile networks. We categorize the service calls into four different types, namely, originating voice calls, originating data calls, voice handoff request calls, and data handoff request calls and we assume two separate queues for two handoff services. A number of channels in each cell are reserved exclusively for handoff request calls. Out of these channels, few are reserved exclusively for voice handoff request calls. The remaining channels are shared by both originating and handoff request calls. In the preemptive priority scheme, higher priority is given to voice handoff request calls over data handoff request calls and can preempt data service to the queue if, upon arrival, a voice handoff request finds no free channels. We model the system by a three-dimensional Markov chain and compute the system performance in terms of blocking probability of originating calls, forced termination probability of voice handoff request calls, and average transmission delay of data calls. It is observed that forced termination probability of voice handoff request calls can be decreased by increasing the number of reserved channels. On the other hand, as a data handoff request can be transferred from a queue of one base station to another, there is no packet loss of data handoff except for a negligibly small blocking probability.     

Enabling seamless multimedia wireless access through QoS‐based bandwidth adaptation

Effective support of real‐time multimedia applications in wireless access networks, viz. cellular networks and wireless LANs, requires a dynamic bandwidth adaptation framework where the bandwidth of an ongoing call is continuously monitored and adjusted. Since bandwidth is a scarce resource in wireless networking, it needs to be carefully allocated amidst competing connections with different Quality of Service (QoS) requirements. In this paper, we propose a new framework called QoS‐adaptive multimedia wireless access (QoS‐AMWA) for supporting heterogeneous traffic with different QoS requirements in wireless cellular networks. The QoS‐AMWA framework combines the following components: (i) a threshold‐based bandwidth allocation policy that gives priority to handoff calls over new calls and prioritizes between different classes of handoff calls by assigning a threshold to each class, (ii) an efficient threshold‐type connection admission control algorithm, and (iii) a bandwidth adaptation algorithm that dynamically adjusts the bandwidth of an ongoing multimedia call to minimize the number of calls receiving lower bandwidth than the requested. The framework can be modeled as a multi‐dimensional Markov chain, and therefore, a product‐form solution is provided. The QoS metrics—new call blocking probability (NCBP), handoff call dropping probability (HCDB), and degradation probability (DP)—are derived. The analytical results are supported by simulation and show that this work improves the service quality by minimizing the handoff call dropping probability and maintaining the bandwidth utilization efficiently. Copyright © 2006 John Wiley & Sons, Ltd.     

NACR: A New Adaptive Channel Reservation in Cellular Communication Systems

Future Personal Communication Networks (PCN) will employ microcells and picocells to support a higher capacity, thus increasing the frequency of handoff calls. Forced call terminations due to handoff call blocking are generally more objectionable than new call blocking. The proposed guard channel schemes for radio channel allocation in cellular networks reduce handoff call blocking probability at the expense of increases in new call blocking probability by giving resource access priority to handoff calls over new calls in call admission control. Under uniform traffic assumptions, it has been shown that a fixed number of guard channels leads to good performance results. In a more realistic system, non-uniform traffic conditions should be considered. In this case, the achieved call blocking probability may deviate significantly from the desired objective. In this paper, we propose a new adaptive guard channel scheme: New Adaptive Channel Reservation (NACR). In NACR, for a given period of time, a given number of channels are guarded in each cell for handoff traffic. An approximate analytical model of NACR is presented. Tabu search method has been implemented in order to optimize the grade of service. Discrete event simulations of NACR were run. The effectiveness of the proposed method is emphasized on a complex configuration.     

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     

融合的蜂窝网络/无线局域网中资源管理的性能分析

Wireless Local Area Network (WLAN) with high data bit rates can be used with cellular network to achieve higher level of Quality of Service (QoS) by sharing their total resources efficiently. The integration between cellular and WLAN networks should be ensured considering different channel allocation strategies of both networks and efficient resource management techniques should be developed. In this paper, we propose a new call admission scheme to use the coupled resource effectively. The proposed scheme, by taking the different resource sharing strategies for two access networks, limits the new, horizontal and vertical handoff voice and data call arrivals with respect to their call level QoS requirements. Numerical results show that the proposed integrated cellular/WLAN network model uses the resources more effectively and achieves all upper bound QoS requirements for voice and data users as compared with the non integrated network model.     

A distributed adaptive guard channel reservation scheme for cellular networks

In this paper, a distributed adaptive guard channel reservation (DAGCR) scheme is proposed to give priority to handoff calls. This scheme is built upon the concept of guard channels and it uses an adaptive algorithm to search automatically the optimal number of guard channels to be reserved at each base station. The quality‐of‐service (QoS) parameters used are the new and handoff call blockings. Simulation studies are performed to compare the present algorithm with the static guard channel policy. Simulation results show that this proposed algorithm guarantees the handoff call blocking probability to remain below the targeted threshold up to a substantially high offered load with a minimal blocking to new calls up to a moderate offered load and also shows significantly high channel utilization in all offered load conditions. This scheme is examined over a wide range of offered load. Thus, it seems the proposed scheme is very useful in controlling the blocking performances in wireless cellular networks. Copyright © 2006 John Wiley & Sons, Ltd.     

Admission Control Algorithms for Revenue Optimization with QoS Guarantees in Mobile Wireless Networks

We propose and analyze call admission control algorithms integrated with pricing for revenue optimization with QoS guarantees to serve multiple service classes in mobile wireless networks. Traditional admission control algorithms make acceptance decisions for new and handoff calls to satisfy certain QoS constraints such as the dropping probability of handoff calls and the blocking probability of new calls being lower than a pre-specified threshold. We analyze a class of partitioning and threshold-based admission control algorithms that make acceptance/rejection decisions not only to satisfy QoS requirements but also to optimize the revenue of the system by taking prices and arrival/departure information of service calls into account. We show that for a “charge-by-time” pricing scheme, there exist optimal resource allocation settings under which the partitioning and threshold-based admission control algorithms would produce the maximum revenue obtainable by the system without sacrificing QoS requirements. Further, we develop a new hybrid admission control algorithm which outperforms both partitioning and threshold-based admission control algorithms over a wide range of input parameters characterizing the operating environment and service workload conditions. Methods for utilizing of the analysis results for realtime admission control for revenue optimization with QoS guarantees are described with numerical data given to demonstrate the applicability.     

Distributed call admission control in mobile/wireless networks

The major focus of this paper is distributed call admission control in mobile/wireless networks, the purpose of which is to limit the call handoff dropping probability in loss systems or the cell overload probability in lossless systems. Handoff dropping or cell overload are consequences of congestion in wireless networks. Our call admission control algorithm takes into consideration the number of calls in adjacent cells, in addition to the number of calls in the cell where a new call request is made, in order to make a call admission decision. This is done by every base station in a distributed manner without the involvement of the network call processor. The admission condition is simple enough that the admission decision can be made in real time. Furthermore, we show that our distributed call admission control scheme limits the handoff dropping or the cell overload probability to a predefined level almost independent of load conditions. This is an important requirement of future wireless/mobile networks with quality-of-service (QoS) provisioning     

Performance evaluation of priority based adaptive multiguard channel call admission control for multiclass services in mobile networks

The CAC (call admission control), which can guarantee call services to meet their QoS (Quality of Service) requirements, plays a significant role in providing QoS in wireless mobile networks. In this paper, an adaptive multiguard channel scheme‐based CAC strategy is proposed to prioritize traffic types and handoff calls. The major aim of the study is to develop the analytical model of the priority traffic and handoff calls based adaptive multiguard channel scheme and examining the performance through setting the value of the adaptive ratio parameters. Our proposed scheme tries to mediate the advantages and drawbacks of the static and dynamic CAC schemes. The proposed scheme is quite different from previous studies because multithreshold values have been considered for multiclass traffic by adaption parameters, and a closed form analytical model is developed The numerical results show that this scheme can be used to keep the targeted QoS requirement by suitably setting the adaptive ratio parameters. Copyright © 2011 John Wiley & Sons, Ltd.     

Aggregate History of User Mobility Pattern for QoS Provisioning in Multimedia Wireless Networks

Multimedia traffic is expected to be included in the next generation of wireless networks. As in wireline networks, the wireless network must also be capable of providing guaranteed quality-of-service (QoS) over the lifetime of mobile connections. In this paper, a bandwidth reservation scheme incorporating a user mobility prediction is proposed to manage the QoS of the networks. The mobility prediction scheme is developed based on the aggregate history of mobile users. Based on the mobility prediction, bandwidth is reserved to guarantee the uninterrupted handoff process. Simulation results demonstrate that the proposed scheme can guarantee the required QoS requirements in terms of handoff call dropping probability and new call blocking probability while maintaining efficient bandwidth utilization.     

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.     

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