模糊技术在第三代移动通信越区切换中的应用

该文对蜂窝移动网的越区切换算法的模糊控制技术进行了介绍。蜂窝移动网中的越区切换是保证蜂窝网用户正常话的关键技术之一。从GSM的硬切换技术到CDMA的软切换技术,掉话率降低的同时也对应着更多的系统资源占用。而三代移动通信系统所能提供的频率资源得到了很大的提高,使得以前在2G时代提出的算法更无法适应新业务的要求和实的需要。该文就是对比第三代移动通信系统的越区切换算法,使用模糊控制技术,来提高CDMA系统的信道利用率,降越区切换的呼损率。     

Enhanced handoff scheme based on efficient uplink quality estimation in LTE-Advanced system

Asymmetric traffics cause downlink–uplink asymmetric interference. It can lead to a critical unbalance between a downlink and an uplink channel qualities in cell edge areas. This paper proposes an enhanced handoff scheme including an efficient uplink channel estimation method. The proposed handoff scheme determines an appropriate handoff-timing and handoff-direction according to an estimated uplink channel quality and a measured downlink channel quality. In the proposed scheme, an uplink or downlink, whose quality dominantly affects a link failure, becomes the main handoff-criterion. An efficient uplink channel estimation method is also proposed to exploit an uplink channel quality in handoff. The proposed method estimates an uplink signal strength from the measured downlink signal strength and predicts an uplink interference based on the interference-level information from neighbor base stations. We propose two different uplink estimation modes such as the simple and the precise modes. The simple estimation mode calculates the uplink channel quality for the overall bandwidth for a general handoff process. The precise estimation mode finds the best uplink band for the handoff user who wants an elaborate handoff process. In the elaborate handoff, a target base station allocates the best uplink band to a handoff user to provide the better uplink channel quality. Simulation results show that the proposed uplink estimation method can accurately compute the uplink channel quality of neighbor cells where the estimation error rate is less than 0.7% The simulation results also show that the proposed handoff scheme reduces handoff-call-dropping probability by up to 69% compared to LTE-Advanced system. In addition, the end-to-end delay of the proposed scheme can be better than that of LTE-Advanced system by 26%.     

QoS-aware radio resource management scheme for CDMA cellular networks based on dynamic interference guard margin (IGM)

Efficient radio resource management (RRM) for CDMA-based cellular communication systems using the interference guard margin (IGM) scheme is investigated in this work. Two important concepts, i.e., the guard channel (GC) and the load curve (LC), are integrated to derive IGM. The resulting call admission control (CAC) scheme gives preferential treatment to higher priority handoff calls by pre-reserving a certain amount of resource in terms of IGM. A radio resource estimation (RRE) function is implemented in each base station (BS) to assist RRM module to adjust the level of IGM dynamically. RRE in each BS estimates the amount of IGM by considering traffic load in its current cell as well as traffic conditions in neighboring cells. A service model is adopted to support quality of service (QoS) demand of multiple services, which includes mobile terminal’s data rate, different levels of priorities, mobility and rate adaptivity characteristics. Simulations are conducted by OPNET to study performance of the proposed IGM scheme in terms of a defined cost function, new call blocking probability, handoff dropping probability and system utilization, under different traffic conditions.     

Predictive channel reservation for handoff prioritization in wireless cellular networks

In wireless cellular networks, a roaming mobile station (MS) is expected to move from one cell to another. In order to ensure that ongoing calls are not dropped while the owner mobile stations roam among cells, handoff calls may be admitted with a higher priority than newly generated calls. Predictive channel reservation (or pre-reservation) schemes allow the reservation of a channel for an ongoing call in an adjacent cell before its owner MS moves into that cell, so that the call is sustained when the MS moves into the adjacent cell. Pre-reservations are made when the MS is within some distance of the new cell boundary. This distance determines the area in which the MS can make channel reservations. In this paper, we study the effect of the pre-reservation area size on handoff performance in wireless cellular networks. Our studies show that if the reserved channels are strictly mapped to the MSs that made the corresponding reservations, as we increase the pre-reservation area size, the system performance (in terms of the probability that the handoff calls are dropped) improves initially. However, beyond a certain point, the performance begins to degrade due to a large number of false reservations. The optimal pre-reservation area size is closely related to the traffic load of the network and the MSs’ mobility pattern (moving speed). We provide an analytical formulation that furthers understanding with regard to the perceived behavior in one-dimensional networks (in which all cells are along a line).With the objective of improving handoff performance and alleviating this sensitivity to the area size, we propose an adaptive channel pre-reservation scheme. Unlike prior pre-reservation methods, the key idea in our scheme is to send a channel pre-reservation request for a possible handoff call to a neighboring cell not only based on the position and orientation of the owner MS, but also as per its speed towards the target cell. The newly proposed scheme uses GPS measurements to determine when channel pre-reservation requests are to be made. Simulation results show that the adaptive channel pre-reservation scheme performs better in all typical scenarios than a previously proposed popular pre-reservation method that does not take mobility into account.     

A distributed-request-based CDMA CAC for DiffServ multimedia services in wireless cellular mobile networks

In this paper, a distributed-request-based CDMA DiffServ (differentiated service) call admission control (CAC) scheme is proposed to provide various multimedia services seamlessly in wireless mobile Internet. Conventional CDMA CAC schemes cannot fully support DiffServ QoS (Quality of Service) and seamless handoff due to lack of consideration on service priority and seamless mobility. Therefore, in order to achieve QoS guarantee for each service class, seamless fast-handoff, and high utilization of the scarce wireless resource, we define a code assignment policy and an adaptive access permission scheme taking each user’s service priority and mobility into consideration. For that purpose, in the proposed scheme, the DQRUMA/CDMA is combined with the new code assignment scheme and the adaptive access permission probability (APP). Numerical examples show that the forced termination ratio of handoff calls is guaranteed to be much less than the blocking ratio of new calls for a seamless fast-handoff while proposed scheme provides QoS guarantee for each service class efficiently.     

Quality of service estimation for soft handoff region ratio and call admission control in CDMA cellular systems

In the operational stage of code division multiple access (CDMA) systems, the soft handoff region ratio (SHRR) is among the important parameters that guarantee the quality of service (QoS) and resource allocation. This paper analytically investigates the effects of the SHRR on QoS. In doing so, we simultaneously take into account the capacity increasing factor and traffic load variation. For this purpose, we propose a new traffic load estimation model using a semi-Markov chain in order to consider the call arrivals influenced by the SHRR under general resident time condition. We also present the calculation algorithm of the QoS measures such as the new call blocking probability (NBP) and forced termination probability (FTP) by applying the proposed model to the prioritized call admission control (CAC). The numerical result illustrates the effects of various soft handoff system parameters. Likewise, it shows that the value of SHRR has a significant impact of the QoS under the normal propagation conditions. Sensitivity analysis is also performed to show the effect of exponential cell resident time assumption. The proposed modeling is expected to provide a practical guide to improve the QoS of CDMA soft handoff systems.     

WLAN与蜂窝混合网络有效的信道切换策略

针对无线局域网WLAN(Wireless Local Area Network)与蜂窝混合网络,提出一种具有抢占蜂窝网络信道的切换策略。当使用蜂窝信道的终端移入WLAN覆盖区域时,只有在该终端所使用的信道被抢占时,该机制才进行垂直切换以减少因切换造成的时延与丢包;建立了该切换策略的三维马尔可夫模型,分析了WLAN网络的终端数、蜂窝信道的利用率、信道接入请求阻塞率、信道抢占率与信道被抢占率的性能。详细的仿真结果证明了提出的模型的有效性,当WLAN覆盖面积比例为0.2时,信道抢占概率最大;当终端移动速度达到100km/h时,信道被抢占的概率是移动速度为20km/h的3倍;提出的信道切换策略与随机切换策略相比,显著地降低了业务的丢包率与传输时延。     

Mobility-based predictive call admission control and bandwidth reservation in wireless cellular networks

This paper presents call admission control and bandwidth reservation schemes in wireless cellular networks that have been developed based on assumptions more realistic than existing proposals. In order to guarantee the handoff dropping probability, we propose to statistically predict user mobility based on the mobility history of users. Our mobility prediction scheme is motivated by computational learning theory, which has shown that prediction is synonymous with data compression. We derive our mobility prediction scheme from data compression techniques that are both theoretically optimal and good in practice. In order to utilize resource more efficiently, we predict not only the cell to which the mobile will handoff but also when the handoff will occur. Based on the mobility prediction, bandwidth is reserved to guarantee some target handoff dropping probability. We also adaptively control the admission threshold to achieve a better balance between guaranteeing handoff dropping probability and maximizing resource utilization. Simulation results show that the proposed schemes meet our design goals and outperform the static-reservation and cell-reservation schemes.     

一种自适应的扇型微蜂房式带宽预留通信模式

在目前的跨区域连接方式中,扇型微蜂房式的网络系统比传统的微蜂房式系统有更高的传输速度.文中介绍了一种自适应的带宽预留模式,这种模式使用了一种神经模糊带宽预留估计量的技术,经过证实,这种技术能够减少客户连接时被强行终止的概率.在这种带宽预留模式中,使用一种通道借用技术能够在实时通信时,减少新的呼叫受阻现象的发生.通过分析强行终止的客户连接和呼叫受阻的概率事件,仿真结果表明,采用扇型微蜂房式的网络系统比传统的固定带宽预留模式要有更好的性能.     

An efficient approach for distributed dynamic channel allocation with queues for real-time and non-real-time traffic in cellular networks

We are witnessing these days a rapid growth of mobile users. Therefore, frequency spectrum must be efficiently utilized, as available frequency spectrum is limited. This paper proposes a channel allocation scheme with efficient bandwidth reservation, which initially reserves some channels for handoff calls, and later reserves the channels dynamically, based on the user mobility. The direction of user mobility may not be straight always, but the user may also go left, right or backwards. Thus, QoS can be improved, if the channel reservation is made based upon the user mobility and the location of the user. We devise here a new algorithm that deals with multiple traffic systems by modifying the existing DDCA algorithm [Krishna, P.V., Iyengar, N.Ch.S.N., 2008. Optimal channel allocation algorithm with efficient channel reservation for cellular networks. International Journal of Communication Networks and Distributed Systems 1 (1), 33-51]. This algorithm reserves more channels for hot cells, less number of channels for cold cells and an average number of channels for the medium cells. Furthermore, we maintain queues for all types of calls. We model the system by a three-dimensional Markov Chain and compute the QoS parameters in terms of the blocking probability of originating calls and the dropping probability of handoff calls. The results indicate that the proposed channel allocation scheme exhibits better performance by considering the above mentioned user mobility, type of cells, and maintaining of the queues for various traffic sources. In addition, it can be observed that our approach reduces the dropping probability by using reservation factor.     

Application of support vector machines to bandwidth reservation in sectored cellular communications

Many mechanisms based on bandwidth reservation have been proposed in the literature to decrease connection dropping probability for handoffs in cellular communications. The handoff events occur at a much higher rate in sectored cellular networks than in traditional cellular systems. An efficient bandwidth reservation mechanism for the neighboring cells is therefore critical in the process of handoff during the connection of multimedia calls to avoid the unwillingly forced termination and waste of limited bandwidth in the sectored cellular communications, particularly when the handoff traffic is heavy. In this paper, a self-adaptive bandwidth reservation scheme, which adopts support vector machines technique, is proposed to reduce the forced termination probability. Meanwhile, a channel-borrowing technique is used to decrease the new call-blocking probability of real-time traffic. The simulation results show that the proposed scheme can achieve superior performance than the representative bandwidth-reserving schemes in sectored cellular networks in the literature when performance metrics are measured in terms of the forced termination probability and the new call- blocking probability.     

无线局域网下PCF结点切换时的资源预留方案

在无线局域网（WLAN）环境中,对VoIP等实时应用结点在漫游切换时,提前在邻居AP小区进行带宽资源预留是保障其获得持续、一致OoS的主要措施．但是目前的资源预留方法要么计算复杂,不符合WLAN的实际情况;要么效率低下,不能很好地为切换结点提供资源保证．在结合已有的预留算法的基础上,根据WLAN本身的特点,提出了一种PCF结点资源预留方法,使VoIP结点采用PCFAP轮询信道访问方式,通过VoIP结点漫游时发现邻居AP的存在,提前向邻居AP发出资源预留请求,同时邻居AP根据网络状况动态调整预留资源大小．仿真实验结果表明,在不浪费无线带宽资源的条件下,提出的方法相对于其他预留方案能够获得更低的切换连接掉线率．     

A hybrid channel allocation algorithm with priority to handoff calls in mobile cellular networks

This paper proposes and investigates a novel analytical model of a hybrid channel allocation algorithm within wireless cellular networks. Each cell of the network consists of a predesigned fixed number of channels and the network may approve the request for extra channels for both new and handoff calls if all predesigned channels are occupied. This approval depends on the types of new and handoff calls, as well as the number of approved additional channels in the cell. If a request is denied for the arriving new call, this call will be blocked and cleared from the system. However, if a request is denied for an arriving handoff call, this call will not be blocked immediately but rather put on hold in a buffer with finite space. The implication behind this is to give priority to handoff calls. For this proposed hybrid channel allocation scheme, we first obtain the stationary distribution of each cell when there are i calls connecting to the system and j calls holding on in the buffer. We then derive new and handoff call blocking probabilities, the average number of borrowed channels, and the average delay period of handoff calls. The numerical results show that the proposed hybrid algorithm is more efficient than other approaches, specifically, in comparison with methods without a borrowing capability for new calls and those without a reserved buffer priority for handoff calls. The idea and results presented in this paper are expected to provide guidelines for field data processing within current wireless and mobile network design and performance evaluation.     

LACAV: an energy-efficient channel assignment mechanism for vehicular ad hoc networks

Designing an efficient channel assignment system for Vehicular Ad hoc Networks (VANETs), which conserves energy, is a challenging task, primarily because of the high degrees of mobility of nodes in these networks. As the high mobility of nodes in vehicular networks leads to frequent handoffs, channel assignment in VANETs becomes a tedious task. In this paper, we propose a channel assignment mechanism using the concepts of learning automata (LA) and reusability. LA is used to optimize the performance of the proposed system by selecting suitable number of reserved channels for the handoff calls and reusability allows the channel to be reused by the different base stations (BSs) based on the reuse distance. The proposed system is designed to reduce the dropping probability. The proposed system is suitable for network architectures in which it is possible to arrange the BSs with different groups of channels sequentially in a particular order that helps in conserving energy. Our experiments clearly indicate that the system reduces the dropping probability and allows a continuous communication throughout the duration of the call. The performance of proposed algorithm is compared with the Vehicular Fast Handover Scheme (VFHS), and the Cooperative scheme for service channel reservation (CRaSCH) scheme in terms of handoff latency, and it is shown that the proposed algorithm performs better than VFHS and CRaSCH.     

The impact of Soft handoff on the uplink capacity in WCDMA systems

Soft handoff has improved the performance of user communications during the crossing from one cell to another. However, it influences from other side on the aggregate availability of resources. Each mobile station in soft handoff uses multiple resources in both directions (uplink and downlink) to transmit/receive same data to/from each cell the mobile station connects with. Furthermore, these connections themselves will increase the interference in those cells. This paper suggests a mechanism to reduce the handoff failure and call blocking by reducing the interference arising from multiple connections of a user in soft handoff. Simulation results show that the handoff failure and call blocking can be reduced if we integrated this mechanism in the scheme of resource allocation.     

IEEE802.16中基于自适应信道预留的呼叫接入策略

呼叫接入控制（CAC）在宽带无线接入（BWA）服务质量（QoS）中起着非常重要的作用。对无线城域网中IEEE802.16复杂的QoS定义,该文提出了一种在IEEE802.16中基于自适应资源预留的呼叫接入控制策略（AR-CAC）。该策略根据UGS负载和信道利用率为其自适应预留信道,同时考虑了IEEE802.16业务的带宽特性。仿真结果表明,该策略在硬切换呼叫切换失败概率不变的情况下降低了高优先级服务的呼叫阻塞率,同时增大了系统的吞吐量。     

移动因特网切换损失率研究

通过仿真研究了移动因特网网络层的硬切换和半软切换在泊松和自相似流量下的切换损失率，其中自相似流量下的切换损失率研究尚属首次，仿真数据表明，对于泊松和自相似流量，半软切换可以提供比硬切换更低的切换损失率，在网络负载均值和切换算法相同的情况下，自相似流量下的切换损失率要明显低于传统泊松流量，通过分析泊松和自相似流量的概率密度函数尝试给出产生这一区别的原因。     

Optimal prioritized channel allocation in cellular mobile systems

Under the cutoff priority discipline, the optimal prioritized channel allocation problem is formulated, which minimizes the weighted average blocking probability of handoff calls while ensuring the prespecified grade of service for new calls and the co-channel interference constraints. We use the concept of pattern to deal with the problem more conveniently. Using Lagrangean relaxation and subgradient optimization techniques, we obtain high-quality solutions with information about their deviations from true optimal solutions. Computational experiments show that our method works very well.Scope and PurposeChannel allocation is one of the most important problems in the design of cellular mobile systems. Since the number of cells of forthcoming networks will increase rapidly, this problem will be of even greater importance in the future. In cellular mobile systems, a new channel should be assigned by the new base when a call enters an adjacent cell. It provides continuation of ongoing calls as the user travels across cell boundaries, and is called handoff. The handoff call is forced to terminate before completion if there are no channels available in the new cell. However, in many practical situations, the blocking of a handoff call attempt is critical since it will result in a disconnection of the call in the middle of conversation. Thus, for reducing the blocking probability of handoff calls, several algorithms based on the cutoff priority scheme have been introduced in the literature. In the cutoff priority scheme, priority is given to handoff calls by exclusively reserving some channels called guard channels for them. In this article, we formulate a prioritized channel allocation problem under the cutoff priority scheme in general multicell environments, and suggest an efficient algorithm to solve that problem.     

A preemptive channel allocation scheme for multimedia traffic in mobile wireless networks

This paper presents a channel allocation model with both partial and full preemptive capabilities for multimedia traffic in mobile wireless networks. The different types of multimedia traffic in transmitting through next-generation networks possess different characteristics and demand an adequate channel allocation scheme to fulfill individual Quality of Service (QoS) requirements. In the proposed model, multimedia traffic is classified into three classes corresponding to different priority levels in a decreasing order. To effectively reduce the dropping probability, a higher-priority handoff call is allowed to fully or partially preempt any lower-priority ongoing calls when the channel capacity becomes insufficient. In addition, to prevent from possible starvation of the lowest-priority traffic, a portion of system channels are purposely reserved. Performance measures, including the dropping probability of handoff calls, the call-interruption probability that an ongoing call is forced to termination due to full preemption, and the bandwidth reduction ratio due to partial preemption, are investigated through an analytical model built with 4-D Markov chains. The numerical results demonstrate the effectiveness of our model.     

Dynamically adaptive channel reservation scheme for cellular networks

In personal communications networks (PCN) supporting network-wide handoffs, new and handoff requests compete for connection resources in both mobile and backbone networks. Forced call terminations due to handoff call blocking are generally more objectionable than new call blocking. In general, most of the previously proposed schemes for radio channel allocation in cellular networks reduce handoff call blocking probability substantially at the expense of increasing the new call blocking probability by giving higher priority to handoff calls over new calls in admission control. This reduces the total admitted traffic and results in inefficient utilization of wireless channels. The tradeoff between the new and handoff calls blocking probabilities should be defined on importance basis. In this paper, we propose a performance metric equation that makes a trade off between the two probabilities depending on the network preferences. Using this equation, we study the performance of various proposed channel reservation schemes. Also in this paper, a new dynamically adaptive channel reservation scheme (DACRS) is developed and compared with other schemes proposed in the literature. The DACRS assigns handoff-reserved channels to new calls depending on the locality principle in which the base station with the help of location estimation algorithms in the mobile location center predicts the position of the mobile terminal. Eventually, the DACRS is designed to improve channel utilization while satisfying the QoS of the calls. As will be shown analytically and through simulation, the DACRS outperforms current reservation schemes and results in more statistical gain, and powerful channel utilization.