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

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

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

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

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

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

低轨星座卫星通信系统中多业务条件下的非充分保证切换策略

该文提出了一种适用于低轨星座卫星通信系统多业务条件下的非充分保证切换策略。该策略在小于一个小区最大驻留时间的时间间隔内为到达小区的呼叫安排和预定信道,在呼叫结束环节作为补充策略对存在切换失败风险的信道进行调整。提出了策略在多业务条件下具体的实施方法,根据实时的切换呼叫性能调整策略的非充分程度。通过仿真,分析比较了不同程度非充分保证切换策略的QoS性能,验证了动态自适应调整非充分程度值的IGH策略的有效性。仿真结果表明,相对于保证切换策略,新策略以存在微小切换失败概率为代价,换取了新呼叫阻塞概率的显著降低,是一种适用于多业务低轨卫星通信系统的信道分配策略。     

无线移动多媒体通信网的一种切换策略

该文提出了无线移动多媒体通信网中基于宽带呼叫业务和窄带呼叫业务的双向层间切换业务模型(BLHM)和单向层间切换业务模型(SLHM),分别研究了两种业务在模型中的新呼叫阻塞概率和切换呼叫失败概率,对由于层间切换机制带来的呼叫业务质量(QoS)下降的宽带切换呼叫进行了定量分析。另外,该文还提出了基于呼叫业务代价函数和呼叫业务QoS的信道分配算法。最后进行了计算机仿真,将两种模型的性能进行了比较。     

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

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

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

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

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

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

LEO卫星通信中基于服务质量的综合加权接入策略

该文首先建立了LEO卫星全球业务密度,提出4种卫星接入和卫星间切换策略,并对LEO卫星通信的新呼叫阻塞概率和强制中断概率在这4种策略下的性能进行了仿真分析, 然后在简单综合加权策略的基础上,根据全球各个地区不同的地形、地表以及通信业务的特点,提出了基于服务质量的综合加权策略。仿真结果表明根据实际地理情况采用改进的综合加权策略,新呼叫阻塞率和切换失败率得到了较大的改善。     

多业务LEO卫星网络中最优呼叫允许控制及切换管理策略

该文针对多业务条件下的LEO(Low-Earth-Orbit)卫星网络,提出了一种新的基于最优多门限信道预留(OMTCR)的呼叫允许控制(CAC)及切换管理策略,建立了评价LEO卫星网络连接级QoS性能的理论分析模型框架。借鉴经济学收益函数的概念分别建立了无QoS约束和有QoS约束的系统收益目标优化模型,求解在给定系统参数和输入业务条件下OMTCR的最优门限参数矢量。仿真结果表明OMTCR能够在不同用户QoS要求和系统收益目标的多业务环境下获得比传统CS(Completely Sharing)策略及GC(Guard Channel)策略更好的性能。     

Cooperative directional inter-cell handover scheme in high altitude platform communications systems

A novel Cooperative Directional inter-cell Handover Scheme (CDHS) for High Altitude Platform (HAP) communications systems is proposed, in which the handover target cell and the two cells adjacent to this handover target cell work cooperatively to exploit the traffic fluctuation to improve handover performance. Users in the overlap area of the overloaded handover target cell will be forced to handover directionally before their optimal handover boundary in order to free up resources for the handover calls which would otherwise be dropped due to the shortage of resources and queue time out. Simulation results show that the handover call dropping probability is greatly reduced (at least 60%) compared with the general queue handover scheme, with little performance reduction to the call blocking probability, and the Not in the Best Cell (NBC) average time is only increased moderately. Moreover, an optimal cell radius can be achieved for a specific platform speed by minimizing the unified system performance, which is the linear combination of the handover call dropping probability and the NBC average time.     

Self‐optimization of handover parameters for dynamic small‐cell networks

Seamless handover is an essential feature of cellular networks. For small‐cell networks, effective handover becomes particularly challenging. If some cells may be activated and deactivated dynamically, effective handover handling will become even more difficult. A key factor of good handover performance is “handover timing,” that is, making handover decision at a right time. If handover is executed too early or too late, users will experience temporary link disconnection, called radio link failure (RLF). Handover timing is controlled by handover parameters, which are set by the network. RLF prevention is directly related to the proper configuration of these parameters. In this paper, we propose a self‐optimization scheme that adjusts the handover parameters to minimize RLFs for dynamic small‐cell networks. Our scheme first detects the types of RLF and then adjusts the handover parameters according to the types of RLF. Unlike most existing schemes, our scheme adjusts both system common parameters and cell‐specific parameters together. In certain situations, such as when two adjacent cells do not have sufficient coverage overlap, RLFs may not be reduced to a satisfactory level by the handover parameter adjustment alone. To deal with such a case, our scheme adjusts the cell coverage in conjunction with the handover parameter optimization. The simulation results show that the proposed scheme can virtually eliminate RLFs. Copyright © 2013 John Wiley & Sons, Ltd.     

Handover prioritizing scheme for reducing call failure probability in cellular wireless network

This paper proposes a scheme suitable for managing handover in wireless cellular network. The main objective of the proposed scheme is to reduce the probability of forced termination of ongoing call due to handover failure. The scheme employs a queuing discipline, and the priority of queued is based on the residual time of the mobile user in the overlap region between two adjacent cells, assuming that the user's location and speed can be determined, then we applied the ascending priority; it means that the users having a shorter residual time join the head of the queue (i.e., high priority) while those having longer residual time at the end of the queue (i.e., low priority). Fixed channel allocation strategy (FCA) is employed and simulation results obtained concern: call blocking probability (CBP), handover failure probability, and average waiting time in the queue. Also simulation results are compared to those obtained by: non‐prioritized scheme (FCA), and FCA queuing with FIFO discipline. Results show that our proposed method decreases significantly handover failure probability compared with other two schemes. Copyright © 2009 John Wiley & Sons, Ltd.     

TD-SCDMA无线接入网自主负载均衡管理方法

基于自主管理技术和博弈理论提出一种自主负载均衡管理方法——博弈分流自主负载均衡法。通过理论分析证明了其中的关键算法可以收敛到局部最优解。通过仿真验证了新方法在均衡负载以及提升系统容量方面的性能优于现有方法,并能解决现有方法中基站交叠面积不受控和切换机制阻碍均衡行为的问题。     

Low latency handover scheme for 5G dual-connectivity scenario

A novel handover scheme was proposed for the secondary node (SN) unchanged 5G dual-connectivity scenarios.In the proposed novel scheme,the SN connection was maintained for data packet transmission during the handover,however,both the main node (MN) and the SN were completely disconnected in the legacy scheme.The transmission delay during handover was decreased greatly by the proposed scheme.Firstly,the legacy handover scheme was analyzed and its deficiency was figured out.Then,the novel mechanism’s signaling interaction was elaborated and the time sequence models for the novel scheme and the legacy scheme were further established.Finally,based on the time sequence model,the performance evaluation processes were carried out in terms of mathematical modeling and experimental simulations.The analysis results demonstrate that the proposed novel scheme reduces the single packet transmission delay,the average transmission delay and the total transmission delay,and has good performance advantages.     

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     

An efficient handover decision method based on frame retransmission and data rate for multi-rate WLANs

To enhance the communication performance at handover between multi-rate WLANs, we propose a new handover decision method that can be applied to our previously reported handover management scheme, which handled a handover by utilizing two WLAN interfaces (IFs) through cross-layer collaboration between layer 2 and layer 4. It should be noted that we here propose a new handover decision scheme for traversing between multi-rate WLANs, while our previous decision scheme works only in fixed-rate WLANs. In this paper, to treat a handover between multi-rate WLANs, we employ two kinds of information: (1) the most frequently used data rate (MFDR) for assessing the stable communication performance of a multi-rate WLAN, and (2) the frame retransmission ratio (FRR) for assessing its exact communication performance. The MFDR enables us to estimate the area where we should start handover. If the MFDRs of two interfaces are same in the area, the FRR allows us to compare the wireless condition on the two interfaces precisely to give an optimal handover point. Through simulation experiments, we show that our proposed scheme certainly estimates an appropriate handover point as a result of multi-path transmission (s), thereby providing handover successfully. That is, the proposed method can determine handover at an optimal point depending on the various distances between access points, the mobile node (MN) velocity, and the MN moving pattern. Moreover, our proposed scheme prevents the redundant network load caused by multi-path transmission as much as possible, thereby providing the ideal TCP communication performance.     

基于强化学习的异构网络垂直切换方法

网络切换技术不仅可以保证用户的网络连接,同时能够以较强的信号传输网络数据。网络切换技术的性能对网络服务质量(quality of service, QoS)的影响至关重要。然而,现有的切换算法多数存在严重的乒乓效应,这不仅造成网络资源的严重浪费,还会损害用户的QoS。为此,提出了一种基于强化学习的异构网络垂直切换方案,主要从触发切换、网络选择及判决切换等方面进行优化。在触发切换时将垂直切换考虑成必要切换和择优切换,通过Q-Learning（QL）算法在选择网络时优化垂直切换;然后以QoS为条件,在判决切换时加入驻留定时器,从多角度减少用户切换次数,降低乒乓效应对异构网络垂直切换的影响。仿真结果表明,基于强化学习的异构网络垂直切换方法可以在保证QoS的条件下有效减少用户切换网络的次数,短时间内频繁切换的情况也有所改善,降低了乒乓效应的影响。     

Study and enhancement on buffer management for smooth handover in MIPv6

For improving Transfer Control Protocol (TCP) performance in mobile environment,smooth handover with buffer management has been proposed to realize seamless handovers. However in our simulation, even if smooth handover in Mobile IPv6 (MIPv6) is implemented, TCP can not always achieve better performance due to packets forwarding burst. Based on the study of buffer management for smooth handover, this paper proposes an enhanced buffer management scheme for smooth handover to improve TCP performance. In this scheme, a packet-pair probing technology is adopted to estimate the available bandwidth of the new path from Previous router (Prtr) to Mobile Node (MN), which will be used by Prtr to control the buffered packets forwarding. The simulation results demonstrate that smooth handover with this scheme can achieve better TCP performance than the original scheme.     

A center‐controlled dynamic rerouting scheme for fast and reliable handover in mobile ATM networks

This paper proposes a scheme for fast and reliable handover that uses dynamic rerouting controlled by a call setup control station (CCS) operating in mobile asynchronous transfer mode (ATM) networks. The CCS selects appropriate rerouted path and crossover switch (COS), and remotely controls the new path's setup. This omits crossover switch discovery process, and makes fast handover possible. The CCS can select the appropriate rerouted path because it directly and with little delay collects information about the state of links such as traffic loads, quality-of-service (QoS) parameters, and disconnection or restoration of links advertised from every ATM switch in its domain. This reduces blocking and congestion, and makes reliable handover possible. The CCS accepts a handover request message for either backward or forward handover, and can remotely control the new path's setup in the same manner for either handover. The scheme provides forward handover when the radio propagation conditions deteriorate unpredictably. This paper also shows sequences of call origination, connection pre-establishment, and route-change in our proposed scheme, and illustrates operation of the CCS and the ATM switches. This revised version was published online in June 2006 with corrections to the Cover Date.