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     

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.     

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.     

无线/移动网络中自适应的接纳控制算法及性能分析

无线／移动网络中重要的连接级QoS性能指标包括新连接请求阻塞率(CBP)、切换连接请求丢弃率(HDP)等。其中，更不希望因切换连接请求的丢弃而导致服务的终止。为降低HDP，通常采用资源预留方案。但这种方案导致CBP较高、资源利用率低。本文针对自适应的多媒体应用带宽可以动态调整的特点，研究无线／移动网络中多优先级服务自适应的接纳控制机制，提出一个自适应的接纳控制算法，对其QoS性能进行分析。     

Predictive QoS-based admission control for multiclass traffic incellular wireless networks

We develop the notion of quality of service (QoS) for multimedia traffic in terms of maximum call dropping probabilities independent of system load and a predefined call blocking probability profile for the different traffic classes for wireless networks of arbitrary shape and dimension. We describe two distributed predictive admission control algorithms, independent multiclass one-step prediction (IMOSP-CS and IMOSP-RES), which provide each traffic class with a given call dropping probability and a desired call blocking probability profile. Both algorithms may be seen as extensions of the multimedia one-step prediction (MMOSPRED) algorithm previously reported, which uses prediction of the overload probability in the home and neighbor cells in deciding whether to admit new users into a multiclass cellular system. The two algorithms differ in their approach to handoff call admission. The first algorithm completely shares the bandwidth among the entering handoff users while the second implements a partition-based reservation scheme. In this paper, we additionally impose a call blocking criterion that ensures a system-imposed call priority independent of the traffic in the system and which adapts to changes in the offered load. In comparing these algorithms to each other, we focus on system throughput and class independence. Both algorithms provide appropriate throughput under both homogeneous and heterogeneous traffic loading conditions while maintaining steady call dropping probabilities for each traffic class     

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.     

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.     

Dynamic-Grouping bandwidth reservation scheme for multimedia wireless networks

In wireless networks carrying multimedia traffic (voice, video, data, and image), it becomes necessary to provide a quality-of-service(QoS) guarantee for multimedia traffic connections supported by the network. In order to provide mobile hosts with high QoS in the next-generation wireless networks, efficient and better bandwidth reservation schemes must be designed. This paper presents a novel dynamic-grouping bandwidth reservation scheme as a solution to support QoS guarantees in the next-generation wireless networks. The proposed scheme is based on the probabilistic resource estimation to provide QoS guarantees for multimedia traffic in wireless cellular networks. We establish several reservation time sections, called groups, according to the mobility information of mobile hosts of each base station. The amount of reserved bandwidth for each base station is dynamically adjusted for each reservation group. We use the dynamic-grouping bandwidth reservation scheme to reduce the connection blocking rate and connection dropping rate, while increasing the bandwidth utilization. The simulation results show that the dynamic-grouping bandwidth reservation scheme provides less connection-blocking rate and less connection-dropping rate and achieves high bandwidth utilization.     

Soft QoS in Call Admission Control for Wireless Personal Communications

In wireless multimedia communication systems, call admission control (CAC) is critical for simultaneously achieving a high resource utilization efficiency and maintaining quality-of-service (QoS) to mobile users. User mobility, heterogeneous nature of multimedia traffic, and limited radio spectrum pose significant challenges to CAC. QoS provisioning to both new calls and handoff calls comes with a cost of low resource utilization. This paper proposes a CAC policy for a wireless communication system supporting integrated voice and dataservices. In particular, soft QoS (or relaxed target QoS) is incorporated in the CAC policy to make compromises among different objectives.Numerical results are presented to demonstrate that (a) in dealing with the dilemma between QoS satisfaction and high resource utilization, how the resource utilization efficiency can be increased by introducing soft QoS; and (b) in accommodating different types of traffic, how the QoS of low priority traffic can be improved by specifying soft QoS to high priority traffic.     

基于动态信道预约的自适应QoS切换算法

未来无线网络将为固定和移动用户提供多媒体通信和计算业务．为移动用户提供无线多媒体业务的一个最关键的挑战是保证端到端连接的业务质量．通过重复使用无线频谱的微蜂窝或微微蜂窝结构是一个有前途的改善移动多媒体网络容量的方式．但切换次数随着蜂窝大小的降低而增加．移动多媒体网络的一个至关重要的问题是需要可以满足各种QoS需要且有更高资源利用率的有效切换方式．该文提出了一种称为基于动态信道预约的自适应QoS切换算法,并与其它切换方式进行了性能比较．     

DiffServ resource allocation for fast handoff in wireless mobileInternet

The next-generation wireless networks are evolving toward a versatile IP-based network that can provide various real-time multimedia services to mobile users. Two major challenges in establishing such a wireless mobile Internet are support of fast handoff and provision of quality of service (QoS) over IP-based wireless access networks. In this article, a DiffServ resource allocation architecture is proposed for the evolving wireless mobile Internet. The registration-domain-based scheme supports fast handoff by significantly reducing mobility management signaling. The registration domain is integrated with the DiffServ mechanism and provisions QoS guarantee for each service class by domain-based admission control. Furthermore, an adaptive assured service is presented for the stream class of traffic, where resource allocation is adjusted according to the network condition in order to minimize handoff call dropping and new call blocking probabilities     

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     

Joint connection-level and packet-level quality-of-service support for VBR traffic in wireless multimedia networks

In this paper, we investigate call admission control (CAC) schemes that can jointly provide connection-level quality-of-service (QoS) (in terms of the new call blocking probability and the handoff dropping probability) and packet-level QoS (in terms of the packet loss probability) for wireless multimedia networks. Stationary CAC schemes are proposed as the results of the solution to constrained optimization problems. A dynamic CAC scheme that can be adapted to varied and varying traffic conditions dynamically is also proposed. The proposed CAC schemes are computationally efficient and easy to implement, thus being suitable for real-time system deployment. Simulation results have demonstrated that the proposed dynamic CAC scheme achieves better performance when applied to realistic traffic conditions found in wireless multimedia networks.     

An adaptive bandwidth reservation scheme for high-speed multimediawireless networks

In the next generation high-speed wireless networks, it is important to provide quality-of-service (QoS) guarantees as they are expected to support multimedia applications. This paper proposes an admission control scheme based on adaptive bandwidth reservation to provide QoS guarantees for multimedia traffic carried in high-speed wireless cellular networks. The proposed scheme allocates bandwidth to a connection in the cell where the connection request originates and reserves bandwidth in all neighboring cells. When a user moves to a new cell and a handoff occurs, bandwidth is allocated in the new cell, bandwidth is reserved in the new cell's neighboring cells, and reserved bandwidth in more distant cells is released. The amount of bandwidth to reserve is dynamically adjusted, reflecting the current network conditions. The performance of the proposed scheme is evaluated through simulations of realistic cellular environments. The simulated network consists of a large number of cells, mobile users with various movement patterns are assumed, and a variety of multimedia applications (e.g., audio phone, video conference, video on demand, file transfer, etc.) is considered. It is shown that the proposed scheme provides small handoff dropping probability (i.e., the probability that handoff connections are dropped due to a lack of bandwidth) and achieves high bandwidth utilization     

End-to-End Adaptive QoS Provisioning over GPRS Wireless Mobile Network

The General Packet Radio Service (GPRS) offers performance guaranteed packet data services to mobile users over wireless frequency-division duplex links with time division multiple access, and core packet data networks. This paper presents a dynamic adaptive guaranteed Quality-of-Service (QoS) provisioning scheme over GPRS wireless mobile links by proposing a guaranteed QoS media access control (GQ-MAC) protocol and an accompanying adaptive prioritized-handoff call admission control (AP-CAC) protocol to maintain GPRS QoS guarantees under the effect of mobile handoffs. The GQ-MAC protocol supports bounded channel access delay for delay-sensitive traffic, bounded packet loss probability for loss-sensitive traffic, and dynamic adaptive resource allocation for bursty traffic with peak bandwidth allocation adapted to the current queue length. The AP-CAC protocol provides dynamic adaptive prioritized admission by differentiating handoff requests with higher admission priorities over new calls via a dynamic multiple guard channels scheme, which dynamically adapts the capacity reserved for dealing with handoff requests based on the current traffic conditions in the neighboring radio cells. Integrated services (IntServ) QoS provisioning over the IP/ATM-based GPRS core network is realized over a multi-protocol label switching (MPLS) architecture, and mobility is supported over the core network via a novel mobile label-switching tree (MLST) architecture. End-to-end QoS provisioning over the GPRS wireless mobile network is realized by mapping between the IntServ and GPRS QoS requirements, and by extending the AP-CAC protocol from the wireless medium to the core network to provide a unified end-to-end admission control with dynamic adaptive admission priorities.     

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.     

Modelling and Performance Evaluation of Mobile Multimedia Systems Using QoS-GSPN

Quality of Service (QoS) measurement of multimedia applications is one of the most important issues for call handoff and call admission control in mobile networks. Based on the QoS measures, we propose a Generalized Stochastic Petri Net (GSPN) based model, called QoS-GSPN, which can express the real-time behavior of QoS measurement for mobile networks. QoS-GSPN performance analysis methodology includes the formal expression and performance analysis environment. It offers the promise of providing real-time behavior predictability for systems characterized by substantial stochastic behavior. With this methodology we model and analyze the call handoff and call admission control schemes in the different multimedia traffic environments of a mobile network. The results of simulation experiments are used to verify the optimal performance achievable for these schemes under the QoS constraints in the given setting of design parameters.     

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)的目标。     

Handoff Performance Improvement with Latency Reduction in Next Generation Wireless Networks

The next generation (NG) wireless networks are expected to provide mobile users with the real-time multimedia services. High sensitivity to time constraints like delay and jitter is one of the important characteristics of the multimedia traffic. In order to maintain a certain quality of service (QoS) level, the handoff latency should be minimized. Furthermore, if the new cell is not ready at the actual handoff time, the handoff call may be even forced terminated. Hence, the handoff preparation latency directly affects the performance of the cellular networks in terms of QoS support and the handoff blocking probability. In this paper, we present the expected visitor list (EVL) method to achieve reduced handoff blocking probability and maintain a certain QoS level in the network by minimizing handoff preparation latency. The handoff signaling decomposition is introduced to make the neighbor cells aware of the resource demands and QoS requirements of the mobile terminal before the actual handoff time. The obtained information about the prospective active mobile terminal is stored in an EVL entry at the neighbor cells. The call admission control (CAC) with QoS-provisioning is run against each EVL entry. According to the CAC result, the network preparation algorithms are executed and the results are stored in the entry. No resource reservation or allocation is performed in advance, and the varying network conditions are reflected to validity and admission status of the entries. The results of handoff preparation algorithms stored in the EVL entry are activated at the actual handoff time and hence the handoff latency is minimized. Performance evaluation through mathematical analysis and extensive simulation experiments show that the EVL method reduces handoff latency and hence handoff call blocking probability significantly without introducing high overhead.Özgür B. Akan received the B.S. and M.S. degrees in electrical and electronics engineering from Bilkent University and Middle East Technical University, Ankara, Turkey, in 1999 and 2001, respectively. He received the Ph.D. degree in electrical and computer engineering from the Broadband and Wireless Networking Laboratory, School of Electrical and Computer Engineering, Georgia Institute of Technology, Atlanta, in 2004. He is currently an Assistant Professor with the Department of Electrical and Electronics Engineering, Middle East Technical University. His current research interests include sensor networks, next-generation wireless networks, and deep space communication networks.Buyurman Baykal received his B.Sc. (High Hons.) degree in Electrical and Electronics Engineering from Middle East Technical University in 1990; M.Sc. (Distinction) and Ph.D. degrees in 1992 and 1995 from Imperial College of Science, Technology and Medicine. Dr. Baykal has research and teaching interests in speech processing, signal processing for telecommunications, and communication networks. He has extensive experience both in the theory and applications of adaptive signal processing techniques to communication applications such as acoustic echo cancellation, noise reduction, channel equalization and digital receiver design through self-conducted research and industry-funded research projects. He conducts research and implementation work on low bit rate speech coding and content based indexing of audio signals. He is also involved in communication network research with particular interest in ATM/IP design aspects, wireless networks and network management issues. Dr. Baykal is an Associate Editor of Computer Networks (Elsevier Science), Sensor Letters (American Scientific Publishing), a past Associate Editor of the IEEE Transactions on Circuits and Systems Part II—Analog and Digital Signal Processing (TCAS-II). He authored and co-authored over 50 technical papers.