基于预留信道机制的CR频谱切换描述及改进

利用IEEE 802.22标准草案中的预留信道机制,分析和描述认知无线电的3种基本频谱切换方案。针对预留信道机制以牺牲新呼阻塞率换取较低切换阻塞率的不足,提出对新呼用户进行排队缓冲的方法,并利用二维马尔可夫模型和排队理论,给出其状态转移图。仿真结果表明,该方法在保证切换性能的条件下,能有效降低新呼阻塞率,并使GoA值大幅下降。     

基于IEEE 802.16的接纳控制机制

分析IEEE 802.16的QoS机制,针对其没有详细规定接纳控制算法的情况,结合协议中定义的业务类型QoS特性,在信令交互机制下,提出一种基于优先级的动态带宽分配接纳控制机制。仿真结果表明,与预留带宽的固定带宽分配机制相比,采用该机制后,系统的切换连接掉线率、新增连接的阻塞率和带宽利用率得到改善。     

无线多媒体网络中一种基于测量网络状态的动态呼叫接纳控制算法

提出了一种无线多媒体网络中基于测量网络状态的动态呼叫接纳控制算法.它区分了实时和非实时业务,在网络带宽资源不足时可通过降低非实时业务带宽确保实时业务呼叫连接的可靠性;还可根据当前网络状况调整预留带宽大小,使小区实时业务切换呼叫掉线率低于设定的门限值.大量仿真结果显示该算法具有低实时业务切换呼叫掉线率和与固定预留方案相当的带宽利用率,而只以略高的新呼叫阻塞率为代价,适合各种不同概率发生时实际应用的情况.     

一种基于IEEE 802.16的动态带宽分配准入控制机制

通过对IEEE 802.16的QoS机制的分析,针对在802.16中没有详细规定准入控制算法的情况,并结合协议中行定义的业务类型的QoS特性和对移动性的支持,提出一种基于802.16的动态带宽分配准入控制机制.仿真结果表明提出的准入控制机制同带宽预留的固定带宽分配机制相比,系统的切换连接掉线率(CDP)、新增连接的阻塞率(CBP)和带宽利用率均有了明显的改善.     

基于Markov的频谱切换研究

为了进一步提高认知无线电网络中认知用户的切换性能,有效降低认知用户切换中的阻塞率和强制中断率,提出了频谱池与预留信道相结合的解决方案,并且借助马尔科夫链和排队理论对认知切换系统关键指标进行分析.仿真结果显示,该方案能够有效保障和提高认知用户的服务质量.     

蜂窝中继网络中协作切换策略研究

传统蜂窝网络架构存在着不少缺陷,小区边缘用户的服务质量远差于靠近基站中心的用户。通过部署中继,并完善其切换算法,提出了在该蜂窝中继网络中基于中继协作的切换策略,且对小区内及小区间切换策略进行细化,这样可以更精确的选择接入站点。比较了传统切换与协作切换中的切换阻塞率以及切换次数,通过仿真证明基于中继协作的协作切换的切换阻塞率小于传统切换,且基站间切换次数也得到降低,减轻了基站的负担,使系统性能得到提升。     

无线/移动网络中基于价格的接纳控制方案

无线/移动网络中,为降低切换连接丢弃率,通常以新连接请求阻塞率的增加及网络资源利用率的降低为代价。提出一种基于价格的接纳控制方案,利用价格杠杆调节用户对网络资源的使用,从而达到提高系统的连接级QoS水平,并增加网络利润的目的。仿真实验证明了这一结论。     

异构网络中基于排队策略的信道分配研究

为满足特定用户的带宽需求,提出了一种改进垂直切换方案,将优先排队策略引入到垂直切换中。此方案的目的在于在优先满足特定用户的需求的条件下,研究整个系统的性能变化及对其他一般用户的影响。仿真结果表明,方案在优先保证特定用户需求的同时对其他用户阻塞率的影响较小,系统信道利用率较高。     

一种基于元策略的自适应移动切换控制方案

为有效保障移动用户不同业务的服务质量,拓展策略机制的应用,利用策略形式的业务QoS属性及移动节点移动和资源需求的预测信息,用元策略自动生成相应的控制策略,实现切换过程自适应的资源管理。通过分析和仿真,该自适应切换方案在保证切换掉线率的前提下,最小化新呼叫阻塞率,为用户提供较好的QoS保证,其特点在于自适应性,可以根据当前网络状况自动进行重要参数的调整,另外,使用策略,可提供不同的优先级,能方便地进行算法定义和选择,相对于传统方法更灵活。     

基于可变连接价格的TCP接入控制研究

本文面向有连接的弹性应用,探讨了基于可变连接价格的TCP接入控制问题.将该问题描述为追求连接阻塞率最小化和活动连接时长最大化的多目标优化问题,分别考察了在连接请求确定到达和随机到达时的连接价格确定问题.提出了在阻塞率不高于某一设定值的情况下,使得单位时间内期望活动连接时长最大化的连接价格调整算法,并给出了基于Socks代理协议的价格协商和接入控制实现方法.     

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.     

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.     

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

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

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.     

基于多业务的移动通信系统呼叫接入控制

针对在可移动边界保护信道方法中新呼叫堵塞率高的问题,提出一种呼叫接入控制策略。当切换呼叫的掉话率小于门限时,新呼叫以一定的概率使用为切换呼叫预留的保护信道。当高优先级数据等待队列中的数据包为空时,传输普通数据等待队列中的数据包。仿真结果表明,在对切换呼叫掉话率影响较小的前提下,该策略能够有效降低新呼叫的堵塞率和高优先级数据的掉包率。     

一种新的基于多业务的移动通信系统切换策略

针对目前移动通信系统大部分信道切换策略中新呼叫阻塞率高的问题,提出了一种新的呼叫延迟切换策略,该策略是让即将占用最后一个空闲信道的新呼叫短暂延迟后再占用空闲信道,切换呼叫则直接占用空闲信道,缩短了信道被全部占用的时间,增加了新呼叫和切换呼叫占用信道的机会。该策略同时考虑了数据业务之间的优先级,只有当高优先级数据队列中的数据包为空时,低优先级队列中的数据包才能够占用信道。给出了切换呼叫掉话率、新呼叫阻塞率及数据包掉包率的理论公式。与预留信道策略和可移动边界策略的对比表明,新策略既提高了新呼叫进入系统的概率,又有效降低了切换呼叫的掉话率,同时也减少了高优先级数据的掉包率。     

Optimum reserved resource allocation scheme for handoff in CDMA cellular system

CDMA cellular systems support two types of handoff: soft handoff and hard handoff. Soft handoff has many advantages over hard handoff. Qualitatively, this feature provides more reliable handoff between base stations as a mobile moves from one cell to the adjacent one. Quantitatively, it considerably increases both the capacity of a heavily loaded multicellular system and the coverage of each individual cell in a lightly loaded system. In this paper, in order to increase the probability of soft handoff at the time of handoff, optimum reserved resource allocation scheme for handoff in CDMA cellular system is proposed, which allocates reserved resource to each frequency channel according to the number of neighbor cells using the same frequency channel. Performance analysis results show that the proposed scheme has higher probability of soft handoff at the time of handoff and higher total call processing performance which is a function of both new calls accepted probability and soft handoff probability than the conventional scheme allocating reserved resource irrelevantly to frequency channels being used by neighbor cells.     

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.