基于深度数据包检测(DPI)及R平方值的数据承载网规划方法的研究

流量模型法通过深度数据包检测技术精准提取特定时间段内各种互联网用户的流量模型参数,根据市场发展目标,计算流量预测值;曲线拟合法通过对特定时间段内的流量数据作曲线拟合,选取R平方值接近1的函数对未来做预测。对两种方法得到的结果进行加权处理,得到相对准确的预测值,是数据城域网规划的目标。     

基于终端采样数据AOA的方位角预测方法研究

方位角作为最重要的天线参数,目前主要通过人工勘测获得,耗时耗力,还存在一定安全隐患,无法满足网络优化工作的高效进行.本文提出一种基于网络终端采样数据AOA(信号到达角度)的方位角自动化预测方法,在福建省宁德市随机抽取256个样本小区,利用MDT(最小化路测)数据、资管工参,建立终端上报的AOA、用户经纬度和基站经纬度之间的数学关系模型,实现天线方位角的自动化实时预测,并利用AOA偏差指标实现高精度预测小区筛选.将预测结果与人工勘测方位角进行比较发现:(1)此方法可以高效实现天线方位角的准确预测,10°、20°和30°内预测精度分别为65.23％、85.55％和92.97％;(2)高精度筛选效果较好,筛选精度较高,筛选数量也很可观.     

移动台定位估计数据融合增强模型及其仿真研究

为了提高蜂窝网中对移动台(MS)的定位精度，在文献[1]中，Kleine-Ostmann提出了一种对电波到达时间(TOA)和到达时间差(TDOA)测量值进行融合的模型。本文对该模型进行了改进，增加了AOA测量值的使用，提出了融合度更高的增强型数据融合模型。分析和仿真结果表明，只要AOA测量值达到一定精度要求，该模型就能取得更好的定位性能。     

基于多向次序关联的AOA量测数据关联

利用到达角(Angel Of Arrival,AOA)进行目标定位是被动监测领域广泛采用的技术之一.然而,在多基站多目标环境中,通常难以直接获得AOA量测数据间的关联关系,因此需要在目标定位前进行有效的量测数据关联.本文针对AOA量测数据的关联问题,提出了一种基于多向次序关联的AOA量测数据关联方法.该方法首先构建了一种用于描述数据间关联程度的代价函数,并利用雅克比方法估计误差分量的方差.其次结合分配算法和寻优思想,分别计算局部关联方向和基站的关联次序,最终得到关联结果.实验验证了本文方法对密集目标和随机目标量测数据关联的有效性.     

基于时间差和角度的数据融合定位算法研究

定位系统中大部分现在存在的算法通常没有考虑综合利用空域、时域信息,而只选择了少量的测量信息.为了克服这个缺陷,提出了一种新的TDOA/AOA数据融合定位算法,这种算法充分利用了来自多个传感器的冗长信息,其中包括到达时间、到达方向.仿真实验结果表明与传统的算法相比,这种算法具有更好的定位精度和收敛速度,进一步改进了系统的可靠性,是一种有效、可行的定位算法.     

弱小目标跟踪中利用样条曲线逼近的数据处理算法

弱小目标检测获得的量测数据由于各种不可预知因素的影响,包含了大量的误差和野值.同时由于系统和算法的敏感,微小的数据跳变就可以对目标信息的预测结果造成严重影响,引起跟踪偏差.针对这个问题,提出了一种利用样条逼近的分段多项式拟合思想和目标运动连续性的递推差分更新预测方法.首先根据样条函数和目标运动模型对已有数据进行平滑和预测,然后利用预测结果处理后续数据.这种方法能够实时地对目标信息数据的变化趋势进行更新,削弱误差和野值的影响,并根据此趋势预测后续数据.实验结果表明:此方法对存在突变的目标坐标数据具有很好的修正预测效果.     

基于大数据的航班调度优化模型与算法初探

为了提高服务质量和降低运营成本,所有的航空公司都在不断寻找各种方法来合理安排航线,降低航班延误。本文主要讨论如何利用大数据来更准确地预测飞机时空位置和航班到达（跑道、登机口）时间,从而更有效地实时优化航班,使得总的延误时间与消耗燃油最小。在此过程中,研究细化航班调度涉及的目的与问题,在此基础上建立数学模型,最终通过机器学习技术求解此模型,提出合理的调度方法。     

基于数据同化的飞机尾流行为预测

飞机尾流是飞机飞行时在其后方产生的一对反向旋转的强烈湍流,对后续飞机飞行以及机场安全起降影响极大,其演化趋势的预测已成为空中交通安全管制的瓶颈,亟需发展基于实时探测数据的飞机尾流行为预测技术。在雷达探测反演得到的尾流涡心位置和速度环量等特征参数基础上,开展飞机尾流行为预测分析,能够预知飞机尾流危害区域,为机场安全起降动态间隔标准制定提供技术支撑。该文结合风场线性切变和最小二乘拟合方法构建了参数化尾流行为预测模型,解决了经典尾流预测模型气象环境参数未随时间演化实时调整的问题。该文根据复杂风场非线性演化特点,设计了基于无迹卡尔曼滤波的数据同化模型,利用雷达探测数据对尾流行为预测进行实时修正。数值仿真验证和实测数据验证结果表明,基于数据同化的飞机尾流行为预测方法能够根据实时探测数据对尾流行为预测轨迹进行修正,得到更加贴近实测的飞机尾流行为预测轨迹。      

基于张量分解的卫星遥测缺失数据预测算法

卫星健康状况监测是卫星安全保障的重要基础,而卫星遥测数据又是卫星健康状况分析的唯一数据来源。因此,卫星遥测缺失数据的准确预测是卫星健康分析的重要前瞻性手段。针对极轨卫星多组成系统、多仪器载荷以及多监测指标形成的高维数据特点,该文提出一种基于张量分解的卫星遥测缺失数据预测算法(TFP),以解决当前数据预测方法大多面向低维数据或只能针对特定维度的不足。所提算法将遥测数据中的系统、载荷、指标以及时间等多维因素作为统一的整体进行张量建模,以完整、准确地表达数据的高维特征;其次,通过张量分解计算数据模型的成分特征,通过成分特征可对张量模型进行准确重构,并在重构过程中对缺失数据进行准确预测;最后,提出一种高效的优化算法实现相关的张量计算,并对算法中最优参数设置进行严格的理论推导。实验结果表明,所提算法的预测准确度优于当前大部分预测算法。     

一种基于突发长度预测的光突发汇聚机制

提出了一种基于突发长度预测的固定时间汇聚方法.边缘节点在监测时间段内对到达的数据流进行监测,并且根据监测的结果预测在固定的汇聚时间内完成汇聚的突发包长度,提前将控制分组转发到核心网络中进行资源预留.通过理论分析及计算机仿真表明,这种汇聚方法能够有效地降低光突发交换网络中的端到端延迟.     

Heuristic RAT selection policy to minimize call blocking probability in next generation wireless networks

In next generation wireless network (NGWN) where multiple radio access technologies (RAT) co‐exist, a joint call admission control (JCAC) algorithm is needed to make a RAT selection decision for each arriving call. RAT selection policy has a significant effect on the overall new call blocking probability in the network. We propose a heuristic RAT selection policy to minimize new call blocking probability in NGWN. The proposed JCAC scheme measures the arrival rate of each class of calls in the heterogeneous wireless network. Based of the measured values of the arrival rates and using linear programming technique, the JCAC scheme determines the RAT selection policy that minimizes overall call blocking probability in the heterogeneous wireless network. Using Markov decision process, we develop an analytical model for the JCAC scheme, and derive new call blocking probability, handoff call dropping probability (HCDP), and call incompletion probability (CIP). Performance of the proposed scheme is compared with the performance of other JCAC scheme. Simulation results show that the proposed scheme reduces new call blocking probability, HCDP, and CIP in the heterogeneous wireless network. Copyright © 2009 John Wiley & Sons, Ltd.     

Call Level QoS Performance under Variable User Mobilities in Wireless Networks

The concept of adaptive admission control in cellular wireless networks ensures quality of service by reserving bandwidth for handoff calls. It is equally important in current second generation wireless systems as well as in the future IMT-2000 and UMTS systems. In order to ensure bounded call level QoS we propose to track the changes of the handoff call arrival rate and integrate this information in the admission algorithm. However, the handoff call arrival rate can vary when the new call arrival rate and/or user mobility vary. In our previous work we have analysed bandwidth reservation techniques needed to maintain a stable call level QoS when new call arrival rate is changing in a group, or groups, of wireless cells. This paper analyses bandwidth reservation techniques that are adaptive to the user mobility as well as to the changing new call arrival rate, and which can ensure stable call level QoS over a range of user mobilities. We also propose the technique to derive bandwidth reservation policy when the QoS characteristics over a range of user mobilities are given.     

A Call-Admission Control (CAC) Algorithm for Providing Guaranteed QoS in Cellular Networks

Future broadband wireless access systems are expected to integrate various classes of mobile terminals (MTs), each class with a different type of quality of service (QoS) requirement. When the load on a wireless network is high, the guarantee of QoS for each class of MTs is a challenging task. This study considers two classes of MTs—profiled MTs and nonprofiled or regular MTs. It is assumed that profiled users require a guaranteed QoS. The measure of QoS is the probability of forced termination of a call that was allowed to access the network. Two previous handoff prioritization schemes—(i) prerequest scheme and (ii) guard channel scheme—decrease handoff failure (and hence forced termination). In this work, we compare and contrast both the schemes through extensive simulation and we find that neither guard channel nor channel prerequest scheme can guarantee a desired level of QoS for the profiled MTs. We then propose a novel call-admission control (CAC) algorithm that can maintain any desired level of QoS, while the successful call completion rate is very high. In the proposed algorithm, the new call arrival rate is estimated continuously, and when the estimated arrival rate is higher than a predetermined level, some new calls are blocked irrespective of the availability of channels. The objective of this new call preblocking is to maintain a cell's observed new call arrival rate at no more than the predetermined rate. We show that the proposed method can guarantee any desired level of QoS for profiled users.     

Optimizing the Use of Random Access Channels in GSM-GPRS

The random access channels and traffic channels are utilized, respectively, for call establishment and information transmission in the uplink direction (from mobile to base station) of the Global System for Mobile communications (GSM) networks. A call is either rejected or blocked depending on its inability to succeed either in the random access channels or in the traffic channels. The optimum number of random access slots is directly proportional to the average call arrival rate, being independent of the average channel holding time and the number of traffic channels. The number of slots occupied by a given call can be changed dynamically in the newly developed General Packet Radio Service (GPRS) systems. A complete analysis is executed for the traffic channel utilization and call blocking probability with the exact number of random access slots that provide almost zero call rejection probability. The overall call success probability is derived considering call rejection and call blocking probabilities.     

Comparison of call gapping and percent blocking for overloadcontrol in distributed switching systems and telecommunications networks

Two overload control techniques are compared. A percent blocking throttle blocks and rejects an arrival with a given probability. A call gapping throttle closes the gap size for a deterministic time interval; after this interval, the next job to arrive passes through and the throttle again closes for the deterministic time interval. The comparison of the throttle schemes is based on nine criteria, seven of which concern robustness. The key strengths of call gapping are shown to be a greater robustness to changes in total arrival rate, and higher goodput, the throughput times the probability of it being good. For varying arrival rate, where the control setting is fixed, call gapping maintains reasonable goodput over regions where percent blocking has allowed goodput to fall to zero. The strengths of percent blocking are shown to be robustness to changes in number of active sources and robustness to unbalanced loads. The optimal control setting for percent blocking is shown to be a function of the total arrival rate and not a function of the number of active sources or the individual arrival rates     

异构分层无线网络中基于逗留时间的动态流量均衡算法研究

为使异构分层无线网络能服务更多的移动用户,提出了一种基于逗留时间的动态流量均衡算法.该算法首先根据用户移动模型计算其在小区内的逗留时间,然后基于小区呼叫到达率和重叠覆盖小区的流量状态来确定一个周期内呼叫转移的数量,最后依据逗留时间门限值将重负载小区中满足条件的呼叫转移到轻负载的重叠覆盖小区中.为降低切换呼叫掉线率,还对异构网间的呼叫切换策略做了改进.仿真实验结果表明,本算法在新呼叫阻塞率和切换呼叫掉线率等性能指标上比传统方法有显著的提高.     

MIMO ARIMA models for handoff resource reservation in multimedia wireless networks

This paper presents a new approach to prediction of resource demand for future handoff calls in multimedia wireless IP networks. Our approach is based on application of multi‐input‐multi‐output (MIMO) multiplicative autoregressive‐integrated‐moving average (ARIMA) (p,d,q)x(P,D,Q)_S models fitted to the traffic data measured in the considered cell itself and on the new call admission control (CAC) algorithm that simultaneously maximizes the system throughput while keeping the handoff call dropping probability (CDP) below the targeted value. The main advantages of the proposed approach are the following: first, the proposed multi‐variable prediction method gives on average better predictions (i.e. narrower prediction confidence interval) for realistic traffic situations, which results in lower new call blocking probability (CBP) at the targeted handoff CDP and second, the model is simple to implement since it does not require communication among the adjacent cells. Simulation results show the superiority of the proposed MIMO prediction approach combined with the proposed call admission control algorithm for some typical nonstationary situations in comparison with univariate models. Copyright © 2004 John Wiley & Sons, Ltd.     

A Homogeneous PCS network with Markov Call Arrival Process and Phase Type Cell Residence Time

In this paper, the arrival of calls (i.e., new and handoff calls) in a personal communications services (PCS) network is modeled by a Markov arrival process (MAP) in which we allow correlation of the interarrival times among new calls, among handoff calls, as well as between these two kinds of calls. The PCS network consists of homogeneous cells and each cell consists of a finite number of channels. Under the conditions that both cell's residence time and the requested call holding time possess the general phase type (PH) distribution, we obtain the distribution of the channel holding times, the new call blocking probability and the handoff call failure probability. Furthermore, we prove that the cell residence time is PH distribution if and only if the new call channel holding time is PH distribution; or the handoff call channel holding time is PH distribution; or the call channel holding time is PH distribution;provided that the requested call holding time is a PH distribution and the total call arrival process is a MAP. Also, we prove that the actual call holding time of a non-blocked new call is a mixture of PH distributions. We then developed the Markov process for describing the system and found the complexity of this Markov process. Finally, two interesting measures for the network users, i.e., the duration of new call blocking period and the duration of handoff call blocking period, are introduced; their distributions and the expectations are then obtained explicitly.     

Approximation models of wireless cellular networks using momentmatching

In this paper we present an analytical model for micro- and pico-cell wireless networks for any arbitrary topology in a high mobility feedforward environment. We introduce an approximation technique which uses a single-cell decomposition analysis which incorporates moment matching of handoff processes into the cell. The approximation technique can provide close approximations for non-Poisson arrival traffic and it is easily parallelized. Performance measures such as new calls blocked, handoff calls lost, and forced termination are derived for any general independent call arrival distribution in a heterogeneous traffic environment. We produce some numerical examples for some simple topologies with varying mobility for several call arrival distributions and compare our results to those from simulation studies     

OFDMA系统随机服务模型及呼叫接纳控制策略的研究

该文在分析OFDMA系统容量的基础上,提出了适用于自适应OFDMA系统的随机服务模型,即M| M| m| n马尔可夫排队模型,根据这个模型,我们提出了基于系统吞吐量和用户QoS要求的呼叫接纳控制策略。理论分析和仿真结果表明,当系统中只有FTP业务时,M| M| m| n模型与自适应OFDMA系统的随机服务特征非常相似,应用这个模型对系统的阻塞概率和文件的服务时间进行定量分析,其结果与实际系统的性能基本吻合。