移动因特网半软切换的仿真研究

MobileIP协议中原有的硬切换算法产生的分组丢失和切换时延大大降低了用户的通信质量，半软切换算法是硬切换的改进算法，本文通过仿真比较了Mobile IP协议中硬切换和半软切换对TCP和UDP流量的影响，并进一步研究了影响半软换性能的因素。     

基于动态业务下的WDM网络阻塞率

本文生成分形布朗运动(FGN)过程产生动态的自相似流量的业务。在NSF网络拓扑下,结合P圈算法对自相似业务的WDM网络阻塞率和泊松业务的WDM网络阻塞率进行比较。仿真结果表明,泊松业务较平稳,自相似业务波动较大,较能表现出业务量的突发性,采用基于自相似业务流量的阻塞率高于差于基于泊松业务流量的阻塞率。     

基于OPNET的UMTS切换技术的建模与仿真

切换技术是通用移动通信系统(Universal Mobile Telecommunications System,UMTS)的主要关键技术之一,用于保证用户在移动通信网络中的移动性。对目前主要使用的2种切换技术———软切换和硬切换进行了简要介绍,而软切换是码分多址(Code Division Multiple Access,CDMA)系统所特有的。利用OPNET仿真软件搭建了UMTS网络切换模型,对软切换及硬切换技术进行仿真,并对结果进行了比较分析,得出结论,切换技术的优劣会直接影响到系统提供的服务质量。     

UMTS中切换的系统开销

本文首先建立了切换模型,并给出最常用的UMTS切换算法。在切换模型和切换算法的基础上,提出了UMTS硬切换和软切换的瞬时系统开销和平均系统开销的数学分析方法,推导出了两种切换的瞬时和平均系统开销的数学表达式。最后,通过仿真切换的系统开销的数学表达式,分析和对比了随着不同的切换门限变化和随着移动台在小区中不同空间位置变化,硬切换和软切换的瞬时系统开销的变化规律,并对比了UMTS硬切换和软切换的在整个切换过程中的平均系统开销的相对大小。     

基于RSS准则的CDMA软切换越区研究

硬切换技术中移动台在接收新基站信号之前中断与原基站的通信,通信中断的概率非常大。而软切换技术需要先建立与新基站之间的通信,等接收到原基站信号低于门限值时再切断与原基站的通信,故具有很高的可靠性。采用接收到的信号强度准则对软切换建立仿真模型,对两个小区之间的软切换进行了仿真,仿真结果表明,软切换的可靠性高于硬切换,采用软切换技术降低了系统的掉话率,提高了通信质量。然而,软切换也将使系统的复杂度和信道开销有所增加。     

CDMA系统中切换性能的界限和变动范围

该文提出了CDMA系统中切换性能的3个界限的数学表达式,以及建立在界限基础上的硬切换性能差异、软切换性能差异和软切换增益的变动范围的表达式,并通过这些公式对切换的性能空间做了划分和限定。作为上述分析的数学基础,该文推导了硬切换和软切换中断概率的表达式。最后,通过对WCDMA(FDD)系统的仿真,证明了切换的界限、变动范围和中断概率的公式的正确性,并且指出,使用它们刻划实际切换算法的性能将比Viterbi的估计更为准确和恰当。     

WCDMA的硬切换技术

WCDMA的切换可以分为软切换(包括更软切换)、硬切换、前向切换以及系统间切换。一个典型的切换过程包括测量控制、测量报告、切换判决和执行切换。详细介绍了WCDMA的硬切换技术、信令流程,以及在现网中的实现。建议设备厂商尽量支持各种硬切换触发方式,使运营商有更多的选择。希望在正式商用时,硬切换不成为影响网络质量的重要因素。     

CDMA的软切换与硬切换

文章简要介绍了移动通信中切换现象的成因，通过GSM系统与CDMA系统的对比，说明为什么CDMA系统能实现软切换，解释了软切换能提供比硬切换更佳用户感受的原因，详细介绍了CDMA系统软切换、更软切换、硬切换的流程，比较了其中异同点，最后提供了涉及第三方MSC硬切换的流程，使得读者对CDMA网络切换有更全面的了解。     

第三代移动通信系统UTRAN的移动性管理(续)

介绍了UTRAN的用户移动性管理中的小区更新、软切换和硬切换，给出了流程图，并对软切换和硬切换做了比较。最后，介绍了TD-SCDMA系统采用的新型越区切换方法——接力切换。     

WCDMA软切换的规划

概述了WCDMA网络中的软切换和硬切换,分析和探讨软切换的算法和规划,接着介绍同时列举了与切换相关的网络性能指标。     

LEO网络中卫星切换的动态概率路由优化策略

在LEO卫星网络中，卫星切换方案需要在保证最小切换延时的同时，合理地使用网络资源，因此应该合理选择卫星切换中路由优化的触发条件。本文在综合考虑卫星切换中消耗的网络资源，包括带宽资源和信令资源的前提下，提出动态概率路由优化方案。指出在卫星切换中，为了达到对网络资源的有效使用，路由优化概率应该随LEO星座结构，呼叫带宽，业务分布等网络参数不同而动态变化。     

Nonclassical traffic modeling and performance analysis of cellularmobile networks with and without channel reservation

We present a two-moment performance analysis of cellular mobile networks with and without channel reservation. Unlike classical analysis where handoff traffic is modeled as Poisson, we characterize handoff traffic as a general traffic process and represent it using the first two moments of its offered traffic. We empirically show that handoff traffic is a smooth process under negative exponential channel holding times. We also show how one may determine customer-oriented grade-of-service parameters such as new-call blocking, handoff call blocking, and forced termination probability under the two-moment representation of traffic offered to each cell. We present extensive results validating our analysis. We compare the performance of the proposed two-moment analysis with classical single-moment analysis and simulation results. Our simulation employs five different mobility models. We show that our proposed model outperforms the existing analytical method when compared to simulation results employing all five mobility models     

基于信道获益和业务实时性的频谱切换策略

为了尽可能地降低认知无线电频谱切换的次数,更加全面地考虑通信环境里的因素,引入模糊控制技术,提出一个可行的频谱切换策略。首先,认知用户接收方根据信噪比和主用户活动性估计信道获益,再通过信道反馈机制将结果值告知认知用户发送方;最后,认知用户发送方将业务分成两类：实时业务与非实时业务,并将信道获益与业务实时性作为两个新参数纳入频谱切换策略。仿真结果显示,与随机选择策略相比,根据信道获益选择信道可以明显降低认知用户的切换率。另外,将业务进行分类,非实时用户与实时用户相比有更低的切换可能性,这种差距可以达到32%。     

Adaptation of CDMA Soft Handoff Thresholds Using Fuzzy Inference System

This paper proposes a new procedure to adjust soft handoff thresholds dynamically by using fuzzy inference system. This algorithm is compared with IS-95A and IS-95B/cdma2000 soft handoffs. The aims are to increase the thresholds at high traffic loads in order to release the traffic channel for supporting more carried traffic, and to decrease the thresholds at low traffic loads in order to give high quality of traffic channel. The inputs of the proposed algorithm are the number of remaining channels of each base station and the number of active pilots in active set of each mobile station. The output is the new soft handoff thresholds. In the fuzzy inference module, the triangular membership function, the max-min composition, and the weighted average formula defuzzification are selected. By comparison of all performance indicators among three algorithms, soft handoff using fuzzy inference tends to give higher performance than those of IS-95A and IS-95B/cdma2000 soft handoffs at high traffic loads and at lower soft handoff thresholds while the quality of traffic channel is still acceptable. Moreover, the wider soft handoff window size of the proposed algorithm gives high carried traffic and low blocking probability but lower quality of traffic channels. In addition, the adaptive soft handoff window size can give lower blocking probability while still keep acceptable quality of traffic channels.     

The Complementary Use of 3G WCDMA and GSM/GPRS Cellular Radio Networks

The traffic performance of integrated 3G wide-band code division multiple access (WCDMA) and GSM/GPRS network is evaluated. This type of network links two cellular radio systems which have different set of frequency bands and the same coverage size. The base station of 3G WCDMA is installed on an existing GSM/GPRS site. Dual-mode mobile terminals use handoff to establish calls on the better system. The soft handoff or inter-frequency hard handoff occurs when mobile terminals of 3G WCDMA or GSM/GPRS move between two adjacent cells, respectively. The inter-system hard handoffs are used between 3G WCDMA and GSM/GPRS systems. The data rate conversions between different systems, soft handoff region size, multiple data rate multimedia services, and the effect of the mobile terminal mobility on the user mean dwell time in each system are considered in the study. The simulation results demonstrate that a great traffic performance improvement on the complementary use of 3G WCDMA and GSM/GPRS cellular radio networks compared with the use of GSM/GPRS cellular radio networks. When high-data rate transmission is chosen for low-mobility subscribers, both the handoff failure probability, and carried traffic rates increase with the new call generation rate. However, both rates decrease conversely with the increasing new call generation rate as soon as the new call generation rate exceeds a critical value. This causes the integrated networks saturation. The higher mean speed for the mobile terminals produces lower new call blocking probabilities and total carried traffic. The new call blocking probabilities and total carried traffic increase with the size of the soft handoff region.     

A Modified Distributed Call Admission Control Scheme and Its Performance

Call admission control is one of the key elements to guarantee the handoff call dropping probability in cellular networks. Among numerous proposals in the literature, the distributed call admission control policy (DCAC) seems to be promising, due to its simplicity and adaptability to changing traffic. However, one crucial assumption used in DCAC is that the actually admitted new calls has to obey a Poisson process to enter the network after the call admission control. Given the dynamic and distributed nature of the control process, this can neither be validated nor be easily implemented. In this paper, we will first discuss a generalized DCAC which eliminates the above assumption and can be used in general environments. Then, a mobility-aware DCAC is introduced, which considers the difference of handoff support between low and high mobility calls in making the CAC decision in order to improve channel utilization. The performance of the modified DCAC scheme is investigated through simulation studies.     

Efficient channel assignment method for multimedia traffic in wireless mesh networks

In wireless mesh networks, the availability of spectrum should be utilized efficiently because the exchanging of traffic rate of multimedia applications is increasing day to day. The traffic of multimedia content may degrade the network performance in terms of high packet loss and throughput degradation because of asynchronous behavior between the sender and the receiver. The proposed Efficient Channel Reservation and Assignment (EchRA) results in successful originating and handing off of multimedia call transmissions using the four dimensional Markov chain process. The EChRA algorithm, proposed in this paper, achieves the maximum throughput performance considering the parameters of blocking probability, dropping probability, and synchronized dwell time between the source and destination. The quality of service is guaranteed by sharing the available slots and by using efficient queuing model to service the incoming and handoff calls, and henceforth, the successful completion of handoff calls rate is increased. Copyright © 2015 John Wiley & Sons, Ltd.     

Dynamic Channel Allocation for Real-Time Connections in Highway Macrocellular Networks

The wide deployment of multimedia services in third generation wireless networks will require handoff designs that can simultaneously reduce the blocking probability of handoff requests and decrease the handoff delay. Reducing the handoff blocking probability is needed to prevent frequent call dropping of real-time VBR/VCR connections and decreasing the delay associated with handoff is needed to prevent QoS degradation for multimedia traffic. In this paper, we present a channel assignment/reassignment scheme for highway cellular networks that achieves both requirements. The scheme can be used to deliver real-time data to a large segment of global highways, namely, highways in which the radio channels used in a given cell cannot be simultaneously used in the two neighboring cells to its left and to its right. The scheme possesses the desirable features of real-time algorithms: the execution time per handoff request has a constant time complexity, the number of transmitted messages per request is small, and the space overhead is also O(1). The scheme uses a non-compact initial assignment of nominal channels to neighboring cells and utilizes a set of pointers in each base station to implement an efficient channel assignment and reassignment strategy. The resulting approach greatly simplifies the selection process and avoids the expensive computation and message exchanges typically needed by dynamic channel allocation schemes. The low communication overhead of the scheme can be further reduced via control thresholds. Performance simulation results show that the scheme achieves low blocking probability and is therefore suitable for handling handoffs of real-time connections in highway cellular networks.     

Optimizing the QoS of high speed moving terminals in cellular networks

This paper presents a dynamic guard channel assignment technique based on a two‐layer cellular architecture which optimizes the blocking probability performance of high‐speed moving terminals (HSMT) and handoff calls of low‐speed moving terminals (LSMT), in a congested urban area. The lower layer of the proposed architecture is based on a microcellular solution, for absorbing the traffic loads of LSMT. The higher layer is based on a macro‐cell umbrella solution, for absorbing the traffic load of the HSMT. The results show that using the optimum number of channels and adjusting dynamically the number of guard channels in each layer, the blocking probability of the HSMT and the handoff blocking probability of LSMT is optimized having the minimum bad effect on the new call blocking probability of LSMT. Copyright © 2003 John Wiley & Sons, Ltd.     

Queue Analysis and Multiplexing of Heavy-tailed Traffic in Wireless Packet Data Networks

Recent research based on traffic measurements shows that Internet traffic flows have a fractal nature (i.e., self-similarity property), which causes an underestimation of network engineering parameters when using the conventional Poisson model. Preliminary field measurements demonstrate that packet data traffic in wireless communications also exhibits self-similarity. In this paper, we investigate the queuing behavior of self-similar traffic flows for data applications in a packet-switching single-server wireless network. The traffic is generated by an on–off source with heavy-tailed on periods and exponentially distributed off periods. We extend previous analysis of a relation among the asymptotic distribution of loss probability, traffic specifications, and transmission rate for a wireline system to a wireless system, taking into account wireless propagation channel characteristics. We also investigate the multiplexing of heavy-tailed traffic flows with a finite buffer for the downlink transmission of a wireless network. Computer simulation results demonstrate that assumptions made in the theoretical analysis are reasonable and the derived relationships are accurate.