适用于平台摆动模型的HAPS通信系统信道分配算法

针对高空平台(HAPS)遭受平流层横风影响呈现水平摆动现象,引起地面呼叫用户为继续获得可靠服务在蜂窝间来回切换的问题,提出了平台摆动条件下区分用户优先级的信道预留和切换排队相结合的信道分配算法。该算法充分考虑了不同类型用户终端对服务等级的需求,对用户终端进行了优先级区分,且从降低切换失败率的角度,在信道预留基础上对切换呼叫用户进行排队。仿真结果表明,与传统的无优先级切换排队和区分优先级的固定信道预留算法相比,该算法能够显著降低切换掉话率,尤其是高优先级用户的切换掉话率,补偿了因平台运动所导致的系统性能损失。     

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

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

基于优先级信道预留的快速动态信道分配算法

针对TD-SCDMA系统现有快速动态信道分配算法的不足,提出了一种基于优先级信道预留的快速动态信道分配算法.该算法根据接力切换用户的移动台属性设定不同的优先级,为接力切换呼叫预留信道,结合小分组借用算法,增加了可移动边界动态信道分配(MB DCA)策略的灵活性.仿真结果表明,此算法相对于混合数据速率、小分组借用(MRG,mixed-data rate grouping borrowed)MB DCA算法,实现了VIP和快速移动切换用户的优先接入,有效地降低了切换呼叫的阻塞率,提高了数据业务性能和系统的信道利用率.     

一种基于距离判决的HAPS通信无线DCA算法

本文提出一种基于距离判决的高空平台站(HAPS)通信的动态信道分配(DCA)算法,通过对无线链路功率到收发链路距离的转化,实时监测HAPS通信的收发链路距离来进行无线信道分配,解决HAPS通信中由于负载不均等造成的无线资源无法满足用户需求的问题.通过与随机信道分配算法及最差可接受信道分配算法的性能进行比较,本文提出的基于距离判决的算法能够在阻塞概率稍微增加的情况下解决系统连接中断问题,有效地提高了系统的整体性能.     

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

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

多媒体业务在越区切换中服务质量保证方法的研究

为了降低多媒体业务在移动环境中的呼叫中断率,提高无线信道的利用率,该文提出了一种动态预留带宽分配机制(DRBA),该机制对到达的越区切换呼叫按业务类型区别处理,对于高优先级的实时业务,通过在邻近小区内预留带宽的方法降低呼叫中断率;对于非实时业务,当小区内的信道带宽不足以支持新到达的越区切换呼叫时,通过动态地借用实时业务过度预留的带宽,改善非实时业务的呼叫中断率,进一步达到提高无线信道利用率,为不同的业务类型提供公平的服务质量(QoS)的目标。     

提高GSM切换性能的策略

介绍了一种提高ＧＳＭ切换性能的策略：通过为切换预留信道并使切换请求（切换呼叫）排队来降低切换失败率,从而达到提高切换性能的目的。提出了该策略的模型及计算呼叫阻塞率的分式。     

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

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

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

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

卫星通信系统多优先级信道预留分配策略

随着通信系统的不断发展,对融合地面系统的天地一体化网络的研究越来越多,而卫星通信系统中,由于卫星高速移动等特性,不可避免需要对呼叫的接入切换进行研究。针对天地一体化信息网络需要支持多场景多业务情况下的通信需求,考虑不同呼叫优先级不同,对多优先级的多种呼叫业务进行考虑。根据信道预留的思想,对不同优先级接入与切换呼叫设定不同的可用信道数,优先级越高的呼叫,为其留更多的可用信道以确保其接入信道成功。同时,由于动态信道预留较固定信道预留能够更好地利用信道资源,最终考虑多优先级下的动态信道预留策略。对多优先级动态信道预留与多优先级固定信道预留策略进行仿真验证,发现动态预留方案得到的系统服务质量更好。对于单一策略,发现优先级越高的用户接入与切换呼叫接入信道失败率更低。     

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.     

A Novel Probability-Based Handoff Strategy for Multimedia LEO Satellite Communications

A novel bandwidth allocation strategy and a connection admission control technique arc proposed to improve the utilization of network resource and provide the network with better quality of service （QoS） guarantees in multimedia low earth orbit （LEO） satellite networks. Our connection admission control scheme, we call the probability based dynamic channel reservation strategy （PDR）, dynamically reserves bandwidth for real-time services based on their handoff probability. And the reserved bandwidth for real-time handoff connection can also be used by new connections under a certain probability determined by the mobility characteristics and bandwidth usage of the system. Simulation results show that our scheme not only lowers the call dropping probability （CDP） for Class I real-time service but also maintains the call blocking probability （CBP） to certain degree. Consequently, the scheme can offer very low CDP for rcal-time connections while keeping resource utilization high.     

A prioritized handoff dynamic channel allocation strategy for PCS

An analytical method is developed to calculate the blocking probability (p_b), the probability of handoff failure (p_h ), the forced termination probability (p_ft), and the probability that a call is not completed (p_nc) for the no priority (NPS) and reserved channel (RCS) schemes for handoff, using fixed channel allocation (FCA) in a microcellular system. Based only on the knowledge of the new call arrival rate, a method of assessing the handoff arrival rate for any kind of traffic is derived. The analytical method is valid for uniform and nonuniform traffic distributions and is verified by computer simulations. An extension (generalization) to the nonuniform compact pattern allocation algorithm is presented as an application of this analysis. Based on this extended concept, a modified version of a dynamic channel allocation strategy (DCA) called compact pattern with maximized channel borrowing (CPMCB) is presented. With modifications, it is shown that CPMCB is a self-adaptive prioritized handoff DCA strategy with enhanced performance that can be exploited in a personal communications service (PCS) environment leading either to a reduction in infrastructure or to an increase in capacity and grade of service. The effect of user mobility on the grade of service is also considered using CPMCB     

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     

A Hopfield neural-network-based dynamic channel allocation withhandoff channel reservation control

As channel allocation schemes become more complex and computationally demanding in cellular radio networks, alternative computational models that provide the means for faster processing time are becoming the topic of research interest. These computational models include knowledge-based algorithms, neural networks, and stochastic search techniques. This paper is concerned with the application of a Hopfield (1982) neural network (HNN) to dynamic channel allocation (DCA) and extends previous work that reports the performance of HNN in terms of new call blocking probability. We further model and examine the effect on performance of traffic mobility and the consequent intercell call handoff, which, under increasing load, can force call terminations with an adverse impact on the quality of service (QoS). To maintain the overall QoS, it is important that forced call terminations be kept to a minimum. For an HNN-based DCA, we have therefore modified the underlying model by formulating a new energy function to account for the overall channel allocation optimization, not only for new calls but also for handoff channel allocation resulting from traffic mobility. That is, both new call blocking and handoff call blocking probabilities are applied as a joint performance estimator. We refer to the enhanced model as HNN-DCA++. We have also considered a variation of the original technique based on a simple handoff priority scheme, here referred to as HNN-DCA+. The two neural DCA schemes together with the original model are evaluated under traffic mobility and their performance compared in terms of new-call blocking and handoff-call dropping probabilities. Results show that the HNN-DCA++ model performs favorably due to its embedded control for assisting handoff channel allocation     

DiffServ resource allocation for fast handoff in wireless mobileInternet

The next-generation wireless networks are evolving toward a versatile IP-based network that can provide various real-time multimedia services to mobile users. Two major challenges in establishing such a wireless mobile Internet are support of fast handoff and provision of quality of service (QoS) over IP-based wireless access networks. In this article, a DiffServ resource allocation architecture is proposed for the evolving wireless mobile Internet. The registration-domain-based scheme supports fast handoff by significantly reducing mobility management signaling. The registration domain is integrated with the DiffServ mechanism and provisions QoS guarantee for each service class by domain-based admission control. Furthermore, an adaptive assured service is presented for the stream class of traffic, where resource allocation is adjusted according to the network condition in order to minimize handoff call dropping and new call blocking probabilities     

A learning approach for prioritized handoff channel allocation in mobile multimedia networks

An efficient channel allocation policy that prioritizes handoffs is an indispensable ingredient in future cellular networks in order to support multimedia traffic while ensuring quality of service requirements (QoS). In this paper we study the application of a reinforcement-learning algorithm to develop an alternative channel allocation scheme in mobile cellular networks that supports multiple heterogeneous traffic classes. The proposed scheme prioritizes handoff call requests over new calls and provides differentiated services for different traffic classes with diverse characteristics and quality of service requirements. Furthermore, it is asymptotically optimal, computationally inexpensive, model-free, and can adapt to changing traffic conditions. Simulations are provided to compare the effectiveness of the proposed algorithm with other known resource-sharing policies such as complete sharing and reservation policies     

A channel reservation and preemption model using overlapping regions in sector‐based cellular networks

This paper presents a channel reservation and preemption (CRP) model using overlapping regions in a cellular network with multiple sectors. To fully exploit and reuse the frequencies, directional antennas are installed on base stations (BSs) to divide the coverage into a number of equal‐sized sectors. When traffic is unevenly distributed across the sectors in a BS, channel utilization in every sector may become very different; low‐traffic sectors may be underutilized while high‐traffic sectors may be overutilized. A CRP scheme is thus proposed to more efficiently utilize free channels among sectors. CRP aims at reducing the dropping probabilities of handoff calls. Specifically, when free channels in a sector are not available, a handoff call, instead of being dropped, is allowed to preempt an ongoing call residing in the overlapping region of two adjacent sectors or two neighbor cells. Under CRP, the preempted ongoing call will not be disconnected, because it can switch over its service to the BS of a neighbor cell or to another directional antenna of an adjacent sector. For the purpose of evaluation, we build an analytical model for the proposed CRP using six‐tuple Markov chains. Analytical results show that the proposed CRP can significantly reduce the dropping probabilities of inter‐sector handoff calls, particularly when traffic between two sectors is not evenly distributed. Copyright © 2013 John Wiley & Sons, Ltd.     

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

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