一种基于GSM／GPRS的动态信道分配策略

针对GSM／GPRS网络中某些小区因频繁切换导致掉话率高的问题,提出了一种新的动态信道分配策略。该方案将信道划分为数据业务专用信道和语音／数据业务共享信道,并在共享信道中为切换型语音呼叫预留保护信道以降低其呼叫失败率。对于数据业务采用FIFO排队机制。最后利用一种近似计算方法求取该策略的呼叫阻塞率等指标。实验结果表明该方案能有效降低语音呼叫掉话率。     

移动通信中软切换算法的研究

在具体介绍和比较当前各移动通信系统中切换算法的基础上，提出了在多业务环境下基于HCA(混合信道分配方案)上的双FIFO(先进先出)排队算法：系统分别为切换语音呼叫与初始语音呼叫和数据呼叫设置了遵从FIF0法则的排队空间，同时，可根据当前业务量调整为切换语音呼叫预留的信道数目，该算法改善了系统的性能，更能适应高业务量小区的需要。     

一种新型的TD-SCDMA动态信道分配方案

本文提出了一种基于可移动边界(MB)的动态信道分配方案.该方案将信道分为两部分:语音信道和数据信道.在业务传输过程中,如果语音信道空闲且数据缓存器队列不空时,那么队列中的数据包可以借用语音信道进行数据传输.而当语音呼叫到来时,语音业务可以强占被数据业务借用的语音信道,进行语音业务传输,而数据业务则停止在借用的语音信道中的传输,继续排队等待.仿真结果显示此方案可以降低系统成本,提高数据业务的性能和更有效地利用系统资源.     

移动通信系统呼叫接入控制算法性能分析

在对移动系统的性能分析中，为了便于分析，通常都没有区分一个小区中切换呼叫和新 呼叫，而是假定它们的信道占用时间具有相同的分布。但在有些实际的系统中，这种假设是不合理的， 两者信道占用时间的均值往往是不同的。设计了一种适用于多业务的呼叫接入控制算法，它对语音业 务基于保护信道法而对语音和数据业务之间采取可移动边界法，并对其性能进行了分析，结果表明切换 呼叫和新呼叫的均值对语音业务和数据业务的性能都具有重要的影响。     

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

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

多业务无线蜂窝移动通信系统的一种呼叫允许控制策略

第三代移动通信系统要求支持宽带多媒体业务,如话音、视频、数据等多种业务,不同业务有不同的QoS要求。本文提出的多业务无线蜂窝移动通信系统中一种基于QoS的呼收允许控制策略,对不同业务的切换呼叫给予不同的优先权。本文分析了两种呼叫允许控制（CAC）算法,一种是各种业务的切控呼叫无缓冲器,不进入排队系统;另一种是各种业务的切换呼叫设置有缓冲器,进入排除系统,并且话音、视频业务的切切呼叫比数据业务的切换呼叫有更高的优先权,系统的空闲信道应首先分配给话音、视频业务的切换呼叫,再分配给数据业务的切换呼叫。在分析两种CAC算法的呼叫阻塞概率、切换失败概率以及系统吞吐量的基础上,给出了计算机仿真结果。     

CDMA分层小区结构系统中基于干扰门限的呼叫接入控制策略

本文提出了一种分层小区结构系统中的呼叫接入控制策略,系统根据当前本小区和周围小区的干扰情况实时地对呼叫请求作相应控制,考虑了实时语音和非实时数据两种典型业务,为切换呼叫设置了高于新呼叫的优先级,并对暂时得不到资源的切换呼叫(包括语音和数据业务)进行排队处理,有效地降低了系统的切换掉话率.     

CDMA分层小区结构系统中基于干扰门限的呼叫接人控制策略

本文提出了一种分层小区结构系统中的呼叫接入控制策略，系统根据当前本小区和周围小区的干扰情况实时地对呼叫请求作相应控制，考虑了实时语音和非实时数据两种典型业务，为切换呼叫设置了高于新呼叫的优先级，并对暂时得不到资源的切换呼叫（包括语音和数据业务）进行排队处理，有效地降低了系统的切换掉话率。     

切换保留信道与新呼叫排队相结合的LEO星座通信系统信道分配方案研究

提出一种适用于LEO(低轨道)星座通信系统的信道分配方案。该方案为切换呼叫提供了保留信道,降低了切换呼叫的阻塞概率。同时,采取新呼叫排队策略抑制保留信道引起的新呼叫阻塞概率的恶化,如果正在进行的呼叫离开,队列中的新呼叫可以按照次序获得分配信道。结果表明,该方案可以显著降低切换呼叫阻塞概率,并使新呼叫阻塞概率得到改善。     

一种新的切换策略在LEO卫星系统中的应用

增强对数据业务等非话音业务的支持,是LEO(低地球轨道)卫星通信系统的一个重要发展方向。提出了LEO卫星通信系统中一种新的保护信道和强占优先相结合的信道分配策略,即为话音呼叫提供一定的强占数据业务的优先权。将该策略与单纯保护信道策略的各项主要性能指标进行比较,结果表明新策略以略微增加数据时延为代价换取了话音新呼叫阻塞概率和切换阻塞概率的极大改善。     

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.     

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.     

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     

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     

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.     

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.     

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 for voice/data integration on a finite-buffermobile system

Personal communication service (PCS) networks offer mobile users diverse telecommunication applications, such as voice, data, and image, with different bandwidth and quality-of-service (QoS) requirements. This paper proposes an analytical model to investigate the performance of an integrated voice/data mobile network with finite data buffer in terms of voice-call blocking probability, data loss probability, and mean data delay. The model is based on the movable-boundary scheme that dynamically adjusts the number of channels for voice and data traffic. With the movable-boundary scheme, the bandwidth can be utilized efficiently while satisfying the QoS requirements for voice and data traffic. Using our model, the impact of hot-spot traffic in the heterogeneous PCS networks, in which the parameters (e.g., number of channels, voice, and data arrival rates) of cells can be varied, can be effectively analyzed. In addition, an iterative algorithm based on our model is proposed to determine the handoff traffic, which computes the system performance in polynomial-bounded time. The analytical model is validated by simulation     

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.     

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.