异构分层无线网络中的混合动态流量均衡算法研究

结合信道借用和流量转移技术提出了一种混合动态流量均衡算法。使用该算法热点小区可以向紧凑模式中的同类型轻负载小区借用信道，同时还可以按一定条件将呼叫转移到与热点小区重叠覆盖的异构轻负载小区中，每个流量周期借用的信道数和转移的呼叫数将根据热点小区的剩余可用信道数和新呼叫到达率来计算。仿真结果表明，该流量均衡算法能够显著降低热点小区系统和整个异构系统的新呼叫阻塞概率、切换呼叫掉线率，而且整个异构系统的利用率也得到了相应提高。     

LTE中基于位置预测的双层负载均衡算法

当前负载均衡算法中,超负载小区在负载均衡切换决策阶段主要考虑把负载转移到邻近轻负载小区,而忽略该轻负载小区是否适合接受来自超负载小区的负载转移。文章提出了一种基于位置预测的双层负载均衡算法,结合用户运动机制和方向改变规律预测下一时刻的接收信号强度,同时在超负载小区的负载转移时考虑两层信息。仿真结果表明,当呼叫到达率低于1时,使用基于位置预测的双层负载均衡算法可以有效地降低整个系统的呼叫阻塞率,提高全网资源利用率。     

异构无线网络中基于业务转移和接入控制的混合负载均衡

 针对现有异构无线网络负载均衡方法未能综合考虑重载网络业务转移和新业务接入控制的问题,提出了一种混合负载均衡算法.该算法首先根据各小区负载水平和终端移动性,将重载小区的适量业务向重叠覆盖的轻载小区转移;其次通过资源预留和强占优先的接入控制策略,为不同优先级的新到业务提供有差别的服务.仿真结果表明,本文算法在保证系统资源利用率的同时,保障了实时与非实时业务的QoS,并相对于参考算法有效降低了系统阻塞率和业务切换概率.     

LTE-Advanced中继系统基于资源共享的呼叫接纳控制方法

针对LTE-Advanced中继系统提出了一种基于资源共享的呼叫接纳控制方法。如果目标站点内新用户和切换用户共享资源已经被使用完,切换用户可以使用目标站点为切换用户预留的资源接入系统,而新用户则可以通过目标站点所在小区内的站点间资源共享接入系统。仿真结果表明,与LTE-Advanced系统固定带宽预留方案和LTE-Advanced中继系统固定带宽预留方案相比较,提出的算法能有效降低小区内新用户阻塞率和切换用户的掉话率,并且能够提高系统的资源利用率。     

3G动态预留呼叫接纳控制算法研究

第三代移动通信技术支持不同服务质量(QoS)的多媒体业务,而呼叫接纳控制(CAC)技术是移动通信中的关键技术之一.本文提出一种动态预留呼叫接纳控制算法,该算法根据小区中各业务的话务量预测各业务所需信道教,从而为切换业务和新业务预留一定的信道.通过比较动态预留算法与新呼叫受限算法和中断优先级算法的性能,得出动态预留算法在降低语音和数据业务的呼叫阻塞率、中断率方面有明显的改善,是一种比较理想的呼叫接纳控制算法.     

面向负载均衡的主动切换

为了解决超密集网络中用户在移动过程中由于小区间干扰和负载不均衡导致的用户服务质量下降的问题,本文研究了一种面向负载均衡的主动切换策略,设计了一种基于双门限的移动切换策略,包含小区内的切换与小区间的切换。通过优化小区内的切换门限,可以最小化系统总资源开销。通过优化小区间的切换门限,能够保证用户实时业务需求的同时均衡网络负载。通过预测用户未来大尺度信道信息,设计主动的双门限切换策略,可以有效降低切换延迟。仿真结果表明,与现有的切换策略相比,所提算法不仅提高了资源利用率,还降低了用户掉线概率与切换次数。      

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

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

准静止状态下的高空平台实时业务信道分配

受平台准静止状态的影响,高空平台（ HAPS)通信网络内存在大量的切换呼叫,且业务量动态变化。 HAPS网络可传输多种业务,其中实时业务在切换过程中具有较高的时延要求。通过为切换呼叫预留信道可降低平台不稳定对服务质量（ QoS)造成的影响。在基于服务优先级的多业务信道分配算法基础上,重点对实时业务的信道分配算法进行改进,提出了一种基于概率的预留信道借用策略。该算法可根据网络内业务量的实时统计数据控制新呼叫业务的准入。仿真结果表明：与固定预留信道算法和门限预留信道算法相比,该算法能够适应网络内业务量的动态变化,在保证切换呼叫掉线率满足期望值的条件下提升系统的整体性能,降低平台不稳定造成的性能损失。     

高空平台通信系统中切换性能受限的呼叫允许控制策略

本文分析了高空平台通信系统中利用地理位置信息的呼叫密度受限和切换间隔时间受限的CAC(Call Admission Control,CAC)策略.设计了切换性能受限的CAC策略,该策略利用地理位置信息在每次新呼叫到达时计算可能引起的切换失败的概率,并且通过设置切换性能门限来约束切换性能,在满足切换性能的同时,能够尽量提高新呼叫阻塞性能.仿真结果表明,在相同切换掉话概率门限要求情况下,与新呼叫切换时间间隔受限的CAC策略相比,改进的切换时间间隔受限的CAC策略可提升新呼叫阻塞性能13.6%以上.在实际应用过程中,可以根据当前流量自适应地改变切换间隔时间门限,达到在满足切换性能的同时最小化新呼叫阻塞概率的目的.切换性能受限的CAC策略在业务量较高的条件下能够较好地保证了系统的切换掉话性能;比其它策略具有更好的呼叫阻塞性能,比呼叫密度受限的CAC至少提升25.3%,比切换时间间隔受限的CAC策略至少提升6.5%.     

可重配置系统中的联合负载控制及其终端选择算法

该文基于现有端到端可重配置系统架构,提出了一种改进的动态门限联合负载控制方法,以适应不同负载条件下对负载均衡的要求,达到资源的有效利用.同时,结合终端的可重配置特点及业务要求的多样性,在执行网络发起的垂直切换过程中采用了基于层次分析法的终端选择算法,从而在均衡异构网络负载的同时减少系统开销和对用户的影响.仿真结果表明,该方法能够在保证用户满意度的同时有效地减轻重叠覆盖区域的网络拥塞,提高系统性能.     

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     

A Simple and Robust Vertical Handoff Algorithm for Heterogeneous Wireless Mobile Networks

Wireless networking is becoming an increasingly important and popular way of providing global information access to users on the move. One of the main challenges for seamless mobility is the availability of simple and robust vertical handoff algorithms, which allow a mobile node to roam among heterogeneous wireless networks. In this paper, motivated by the facts that vertical handoff procedure is done on mobile nodes and battery power may be one crucial parameter for certain mobile nodes, a simple and robust two-step vertical handoff decision algorithm is proposed for heterogeneous wireless mobile networks. To the best of our knowledge, this is the first vertical handoff algorithm that takes the classification of mobile nodes into consideration, one is resource-poor mobile nodes, and the other is resource-rich mobile nodes. This new feature makes it more applicable in the real world. In addition, dynamic new call blocking probability is firstly introduced by this paper to make handoff decision for wireless networks. The experiment results have shown that the proposed algorithm outperforms traditional algorithms in bandwidth utilization, handoff dropping rate and handoff rate.     

Effect of mobile terminal heterogeneity on call blocking/dropping probability in cooperative heterogeneous cellular networks

It is envisaged that next generation wireless networks (NGWN) will be heterogeneous, consisting of multiple radio access technologies (RATs) coexisting in the same geographical area. In these heterogeneous wireless networks, mobile terminals of different capabilities (heterogeneous terminals) will be used by subscribers to access network services. We investigate the effect of using heterogeneous mobile terminals (e.g. single-mode, dual-mode, triple-mode, etc.) on call blocking and call dropping probabilities in cooperative heterogeneous wireless networks. We develop analytical models for heterogeneous mobile terminals and joint radio resource management in heterogeneous wireless networks. Using a two-class three-RAT heterogeneous wireless network as an example, the effect of using heterogeneous terminals in the network is evaluated. Results show the overall call blocking/dropping probability experienced by subscribers in heterogeneous wireless networks depends on the capabilities of mobile terminals used by the subscribers. In the worst case scenario, when all subscribers use single-mode mobile terminals, each subscriber is confined to a single RAT and consequently, joint radio resource management in heterogeneous wireless network has no improvement on new call blocking and handoff call dropping probabilities. However, in the best case scenario, when all subscribers use three-mode terminals, new class-1 call blocking probability decreases from 0.37 (for 100% single-mode terminals) to 0.05, at the arrival rate of 6 calls per minute. New class-2 call blocking probability also decreases from 0.8 to 0.52. Similarly, handoff class-1 call dropping probability decreases from 0.14 to 0.003, and handoff class-2 call dropping probability decreases from 0.44 to 0.09.     

Seamless vertical handoff using modified weed optimization algorithm for heterogeneous wireless networks

In the global scenario, a variety of wireless access networks are available. Different types of applications such as real time, nonreal time, and high bandwidth availability are used for heterogeneous wireless networks. Therefore, it is necessary for a service provider to make an appropriate connection support. For better performance, connections are to be exchanged among the different networks using seamless vertical handoff (VHO). The proposed algorithm shows the effect of optimization technique, which involves handoff decision process using vertical handoff triggering and selection of the network. The handoff triggering is initiated by using the received signal strength (RSS). In traditional method, handoff triggering is initiated by using RSS only. This method, modified weed optimization (M-WO) algorithm, reduces the unnecessary handoff by considering both RSS and velocity of the mobile node in handoff triggering. The parameters such as battery lifetime, handoff call dropping rate, load, dynamic weights adaptation and so on are to be considered individually or combined to make an effective network selection process. This paper highlights a novel effect ofM-WOalgorithm for decision making during the VHO. Our effort is to essentially optimize the system load, so that it reduces the handoff call dropping rate and the battery power consumption of the mobile node (MN). Weight of each QoS metrics is adjusted along with the networks changing conditions to trace the M-WO. Therefore, the novel VHO decision-making algorithm is superior to the existing SSF and OPTG methods. The simulation results show that the performance ofM-WOalgorithm is far better than SSF andOPTGmethods in terms of load, handoff call dropping rate and battery lifetime of MN.     

Joint admission control algorithm based on load transfer in heterogeneous networks

A load-transfer-based joint admission control (LJAC) algorithm in heterogeneous networks was proposed.The access requirements of users were admitted based on load balancing,the dynamic load transfer of traffics in the overlapping coverage areas of heterogeneous networks were introduced,and the influence of such factors as the layout of heterogeneous networks and the vertical handoff was considered in the algorithm.The integrated system of heterogeneous networks was modeled as a multidimensional Markov chain,the steady-state probabilities were obtained and the quality of service (QoS) performance metrics were derived.Based on the Poisson point process theory,the upper bound of capacity of the heterogeneous networks satisfying QoS limitations was obtained.The admission control parameters of the integrated system of heterogeneous networks were optimized in order to maximize the resource utilization rate as well as guaranteeing the QoS of users.The simulation results demonstrate lower traffic blocking probability,lower failure probability of vertical handoff requirements,and larger system capacity gain can be achieved by using the proposed LJAC algorithm.     

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

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

Priority-determined multiclass handoff scheme with guaranteed mobile QoS in wireless multimedia networks

The provision of multiclass services is gaining wide acceptance and will be more ubiquitous in future wireless and mobile systems. The crucial issue is to provide the guaranteed mobile quality of service (QoS) for arriving multiclass calls. In multimedia cellular networks, we should not only minimize the dropping rate of handoff calls, but also control the blocking rate of new calls at an acceptable level. This paper proposes a novel multiclass call-admission-control mechanism that is based on a dynamic reservation pool for handoff requests. In this paper, we propose the concept of servicing multiclass connections based on priority determination through the combined analysis of mobile movement information and the desired QoS requirements of multimedia traffic. A practical framework is provided to determine the occurrence time of handoff-request reservations. In our simulation experiments, three kinds of timers are introduced for controlling the progress of discrete events. Our simulation results show that the individual QoS criteria of multiclass traffic such as the handoff call-dropping probability can be achieved within a targeted objective and the new-call-blocking probability is constrained to be below a given level. The proposed scheme is applicable to channel allocation of multiclass calls over high-speed wireless multimedia networks.     

Adaptive Resource Management in Mobile Wireless Networks Using Feedback Control Theory

Emerging mobile wireless networks are characterized by significant uncertainties in mobile user population and system resource state. Such networks require adaptive resource management that continuously monitor the system and dynamically adjust resource allocations for adherence to the desired system performance requirements. We propose adaptive resource management technique based on control theory. The controller dynamically solves resource allocation problem using feedback control laws. In the base algorithm, the number of guard channels is dynamically adjusted by feeding back the current handoff call dropping probability. The base algorithm is then enhanced in two ways: feeding back the instantaneous number of handoff calls and by probabilistically implementing a fractional number of guard channels. We study the effects of parameter choices on the performance of the proposed algorithms using discrete event simulation. Simulation results indicate that the feedback controllers can guarantee the predetermined call dropping probability under a variety of traffic conditions, and so can utilize the scarce wireless resource efficiently by accepting more new calls.