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     

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     

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.     

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.     

An efficient cross layer based channel reservation method for vehicular networks

The swift growth of the mobile users and limited availability of bandwidth lead to the requirement of effective channel allocation process. Channel allocation becomes tedious in vehicular ad hoc network, as the mobility of the nodes is high. So, in this paper, we propose a method called as cross layer based channel reservation with preemption (CCRP) method that performs channel allocation process by estimating the handoffs in vehicular ad hoc networks. The time estimated is communicated from physical layer to medium access control layer using a cross‐layer design. The reusability concept is used, and the channels are divided into three groups. The different cells acquire different groups based on the database status and exclusively to avoid interference. Preemption is incorporated to give the highest priority to real time originating calls and real time handoff calls. The performance of the proposed method, CCRP, is compared with the legacy systems such as cooperative reservation of service channels and very fast handover scheme in terms of dropping probability, blocking probability, and handoff latency. The results show that the proposed algorithm, CCRP, performs better in comparison. Copyright © 2013 John Wiley & Sons, Ltd.     

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     

Performance evaluation of different resource management strategies in mobile cellular networks

The foreseen mass diffusion of mobile communication services will require the identification of suitable resource management strategies to utilize efficiently the available spectrum. This paper refers to highmobility cellular systems and carries out a performance evaluation for different channel assignment techniques that belong to the following classes: Fixed Channel Allocation (FCA), or Dynamic Channel Allocation (DCA). Suitable handoff prioritization techniques have been considered to obtain a high quality of service; in particular, the queueing of handoff requests and the use of guard channels have been investigated. The resource management techniques have been compared in terms of the following parameters: the call blocking probability, the call dropping probability, the probability of unsuccessful call and the average number of channel rearrangements per call. The joint use of DCA, guard channels, queueing of handoff requests and channel rearrangements has shown promising results for the management of both new call attempts and handoff requests.     

Design and Performance Analysis of a New Soft Handoff Scheme for CDMA Cellular Systems

In this paper, a new soft handoff scheme for CDMA cellular systems is proposed and investigated. It is pointed out that some handoff calls unnecessarily occupy multiple channels with little contribution to the performance of handoffs in IS95/CDMA2000-based handoff schemes or systems. To alleviate performance degradation due to channel resource shortage during soft handoff, a new concept of channel convertible set (CCS), which contains several types of handoff calls that unnecessarily occupy extra channels by considering the relative mobility of the calls in the handoff area is introduced. A new scheme that reallocates those extra channels in the CCS to new handoff calls when there is no available free channel in the system is proposed. Furthermore, according to the variation of the CCS, the proposed scheme dynamically adjusts the number of guard channels reserved exclusively for handoff. Then, the feasibility and implementation issues of the proposed scheme are discussed. To evaluate and compare performance indexes of different soft handoff schemes, continuous-time Markov chain models are constructed. Automated generation and solution of the underlying Markov chains are facilitated by stochastic reward net models, which are specified and solved by stochastic Petri net package. Numerical results show that this scheme can significantly decrease both the number of dropped handoff calls and the number of blocked calls without degrading the quality of communication service and the soft handoff process.     

Efficient handoff policy without guard channels for mobile radio telephone systems

Presented in this letter is a prioritised pushout handoff policy without guard channels for increasing the total grade of service (GOS) in a mobile radio telephone system. Blocking probability and waiting time distribution for each call are obtained, and a boundary for two handoff policies between with and without guard channels is found.<>     

一种结合信道性能的频谱分配算法

在认知无线电网络中,由于授权信道的时变性,各可用信道的性能相差较大。为避免过多使用忙闲交替频繁的信道,首先用ON—OFF模型建模授权信道的使用情况,并推导了认知用户切换概率,提出了一种用信道状态变化率衡量信道性能的方法。在此基础上提出了一种结合信道性能的频谱分配算法,在网络吞吐量相同或相近情况下优先分配性能较好的信道。仿真分析表明,这种结合信道性能的频谱分配算法在降低切换概率的同时提高了实际总效益。     

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     

Call admission control for voice/data integration, in.broadband, wireless networks

This paper addresses bandwidth allocation for an integrated voice/data broadband mobile wireless network. Specifically, we propose a new admission control scheme called EFGC, which is an extension of the well-known fractional guard channel scheme proposed for cellular networks supporting voice traffic. The main idea is to use two acceptance ratios, one for voice calls and the other for data calls in order to maintain the proportional service quality for voice and data traffic while guaranteeing a target handoff failure probability for voice calls. We describe two variations of the proposed scheme: EFGC-REST, a conservative approach which aims at preserving the proportional service quality by sacrificing the bandwidth utilization, and EFGC-UTIL, a greedy approach which achieves higher bandwidth utilization at the expense of increasing the handoff failure probability for voice calls. Extensive simulation results show that our schemes satisfy the hard constraints on handoff failure probability and service differentiation while maintaining a high bandwidth utilization.     

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.     

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

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

Handoff performance in wireless DS‐CDMA networks

This paper analyses the performance of DS‐CDMA networks in the presence of call handoffs. We show that a handoff may violate the SINR requirements for other users, and thus cause an outage in the target cell. We propose to use the probability of such events as a possible metric for quality of service in networks with multiple traffic types, and derive the corresponding QoS parameters. A two‐level admission policy is defined: in tier 1 policy, the network capacity is calculated on the basis of the bound on outage probability. However, this policy does not suffice to prevent outage events upon handoffs for various traffic types, and henceforth, we propose an extension that reserves extra bandwidth for handoff calls, thus ensuring that handoff calls will not violate the outage probability bound. The overhead imposed by the extension is negligible, as the complete two‐tier admission control algorithm is executed only when a call is admitted into the network. Once admitted, calls can freely execute handoffs using the reserved bandwidth. The modified second‐tier bandwidth reservation policy is adaptive with respect to the traffic intensity and user's mobility and we show that it can provide satisfactory call (flow) quality during its lifetime. Analytical results for the QoS have been verified by the simulations. Copyright © 2002 John Wiley & Sons, Ltd.     

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.     

Adaptation of CDMA Soft Handoff Thresholds Using Fuzzy Inference System

This paper proposes a new procedure to adjust soft handoff thresholds dynamically by using fuzzy inference system. This algorithm is compared with IS-95A and IS-95B/cdma2000 soft handoffs. The aims are to increase the thresholds at high traffic loads in order to release the traffic channel for supporting more carried traffic, and to decrease the thresholds at low traffic loads in order to give high quality of traffic channel. The inputs of the proposed algorithm are the number of remaining channels of each base station and the number of active pilots in active set of each mobile station. The output is the new soft handoff thresholds. In the fuzzy inference module, the triangular membership function, the max-min composition, and the weighted average formula defuzzification are selected. By comparison of all performance indicators among three algorithms, soft handoff using fuzzy inference tends to give higher performance than those of IS-95A and IS-95B/cdma2000 soft handoffs at high traffic loads and at lower soft handoff thresholds while the quality of traffic channel is still acceptable. Moreover, the wider soft handoff window size of the proposed algorithm gives high carried traffic and low blocking probability but lower quality of traffic channels. In addition, the adaptive soft handoff window size can give lower blocking probability while still keep acceptable quality of traffic channels.     

Capacity optimization in multiservice mobile wireless networks with multiple fractional channel reservation

In this paper, the multiple fractional channel reservation (MFCR) strategy for service differentiation is proposed. MFCR overcomes the "integer nature" of traditional channel reservation schemes (also referred to as guard channel, trunk reservation, or cutoff priority) that precludes them to achieve maximum system capacity in single- and multiservice environments. Contrary to the rest of the channel reservation schemes previously proposed in the literature on the topic, MFCR reserves, on average, real numbers of channels to prioritize new and/or handoff calls in multiple service environments. Given a set of requirements on new call blocking and forced termination probabilities for each service type, MFCR maximizes system capacity while meeting the quality of service (QoS) constraints in multiservice mobile cellular networks. It finely controls the communication service quality, by varying the average numbers of reserved channels by a fraction of one. Determining the right amount of resources (cutoff threshold or number of reserved channels) to prioritize each call type and to satisfy all QoS constraints in multiservice environments, however, is a difficult task. Selecting the optimal prioritization order is not an easy process either, as it is affected by QoS constraints, system characteristics, and resource sharing. Thus, an heuristic algorithm to determine the optimum numbers of reserved (resources) channels to achieve maximum system capacity when using the MFCR is also proposed. To our knowledge, the capacity optimization problem considering individual QoS constraints had only been addressed in single service environments. Also, a comprehensive survey on channel reservation strategies proposed in the literature has been included.     

An adaptive handoff strategy for cognitive radio networks

Spectrum handoff plays an important role in spectrum management as it is the process of seamlessly shifting the on-going transmission of a secondary user (SU) to a free channel without degrading the quality of service. In this paper, we develop an adaptive handoff algorithm that allows an SU to detect the arrival of a primary user (via sensing) and adapt to a reactive or a proactive handoff strategy accordingly. The adaptive handoff scheme first allows an SU to decide whether to stay and wait on current channel or to perform handoff. Then, in case of handoff, an SU intelligently shifts between proactive or reactive handoff modes based on primary use (PU) arrival rate. Further, a PU prioritized Markov approach is presented in order to model the interactions between PUs and SUs for smooth channel access. Numerical results show that the proposed handoff scheme minimizes the blocking probability, number of handoffs, handoff delay and data delivery time while maintaining channel utilization and system throughput at maximal level compared to simple reactive and proactive schemes.     

Channel allocation for GPRS

Based on the GSM radio architecture, the general packet radio service (GPRS) provides users data connections with variable data rates and high bandwidth efficiency. In the GPRS service, allocation of physical channels is flexible, i.e., multiple channels can be allocated to a user. We propose four algorithms for the GPRS radio resource allocation: fixed resource allocation (FRA), dynamic resource allocation (DRA), fixed resource allocation with queue capability (FRAQ), and dynamic resource allocation with queue capability (DRAQ). We develop analytic and simulation models to evaluate the performance for these resource allocation algorithms in terms of the acceptance rate of both GPRS packet data and GSM voice calls. Our study indicates that DRAQ (queuing for both new and handoff calls) outperforms other algorithms