移动GSM网寻呼成功率的优化

移动通信的网络质量越来越受到关注,运营商在确保网络性能指标稳定提高的同时,还要兼顾新技术、新业务的发展对网络优化提出的新要求。网络优化是一项复杂的系统工程,也是一项不断反复循环和深化的过程。文章从分析影响GSM网络寻呼成功率的原因入手,找到寻呼成功率的交换优化方法。通过交换寻呼参数的优化,使寻呼成功率明显提高,达到预期的目的。     

移动网络寻呼成功率的分析与提高

寻呼成功率是评价一个移动网络优劣的重要指标之一,也是目前中国三大运营商KPI考评指标体系的重要组成部分。寻呼成功率的高低直接影响着手机做被叫的接通率,同时也影响着用户的感知。笔者通过在交换侧对寻呼的流程进行分析,寻找改善寻呼成功率的各方面因素,从而解决移动通信寻呼成功率低的问题,以便提高移动通信质量、进而提高用户满意度。     

空中接口寻呼负荷对寻呼成功率的影响

对于GSM网络来说,无线寻呼成功率是反映网络性能的重要指标之一。无线寻呼成功率的高低直接影响用户呼叫时的主观感受。因此分析影响寻呼成功率高低的各个环节并采取措施改善,在网络优化工作中显得尤为重要。     

移动交换网寻呼参数优化

以寻呼模型为研究对象,对移动交换网寻呼响应时长分布数据进行详细分析,综合考虑寻呼成功率、用户感知等重要因素,提出寻呼参数优化建议。     

移动交换网寻呼参数优化

以寻呼模型为研究对象,对移动交换网寻呼响应时长分布数据进行详细分析,综合考虑寻呼成功率、用户感知等重要因素,提出寻呼参数优化建议。     

GSM网小区寻呼丢弃优化方法

小区寻呼丢弃数量不仅是衡量网络性能的重要指标之一,同时与用户感受密切相关。GSM网寻呼丢弃量与网络寻呼策略、LA（位置区）寻呼容量、寻呼组设置、业务分担参数设置等因素息息相关。主要针对造成寻呼丢弃的多种原因分析,并结合实际优化案例说明通过LA分裂、对MFRMS（寻呼信道复帧数）参数及T3314参数调整均能够有效改善小区寻呼拥塞从而降低寻呼丢弃数量,对全网寻呼成功率的提高也有一定效果。     

基于大数据的5G寻呼成功率优化研究与实践

随着5G网络的规模化,用户对5G网络质量要求逐步提高,对SA网络的优化势在必行。文章介绍了5G SA寻呼优化的框架,深入研究了寻呼的流程,对寻呼流程进行分解,找出关键点,基于XDR话单,提出了寻呼成功率的大数据分析方法。根据寻呼成功率优化框架,针对寻呼因素进行分析研究,找出影响寻呼的因素包括寻呼策略、无线因素、接入因素、其他因素等,并根据对实际网络进行优化实践,提出优化建议及改进方案,对5G SA的核心网优化提供了经验指导。     

CDMA网络接入参数优化对提高寻呼成功率的影响研究

寻呼成功率的高低直接反映了一个网络的寻呼能力的优劣,寻呼性能的高低也反映了网络的接通性能,是网络的一项重要性能指标。改善无线寻呼成功率是无线网优人员比较棘手的地方,本文结合该指标的内涵及优化成果,运用接入参数调整手段,总结了影响无线寻呼成功率的方法和经验。     

辽宁GSM网寻呼成功率分析及处理

寻呼成功率用来考核各地无线覆盖情况、网络运行维护优化的质量等．这项指标的高低反映了,网络的覆盖质量。通常,网络优化的目的是尽可能地使寻呼成功率达到工程设计应该达到的水平。BSS是这项指标的理想跟踪对象,可以将大的系统指标分解到各个小区来定点分析．通过对各个小区或基站的障碍清除、参数调整、高度调整及俯仰角变换等手段来达到无线的最佳覆盖．从而优化寻呼成功率。其次在NSS侧也有一些优化手段可以提高这项指标。本文主要讲述NSS侧的一些优化方法．并对BSS的优化手段做简单介绍。     

移动网寻呼成功率优化提升分析

寻呼成功率是移动用户作为被叫接入移动网络的成功率指标,寻呼成功率低,将造成呼叫移动用户失败,降低用户感受。寻呼成功率主要受无线网络覆盖、质量和规划影响,MSC的配置也会影响寻呼成功率。     

CDMA网络移动交换机系统间短消息寻呼技术研究及应用

研究并提出了CDMA网络移动交换机系统间短消息寻呼的技术要求,主要描述了CDMA网络移动交换机系统间短消息寻呼对服务交换机、相邻交换机技术的要求、呼叫流程等,并对该技术在现网的实际应用效果进行了评估。本文所述的CDMA网络短消息系统间寻呼技术能明显改善CDMA网络MT短消息的首发寻呼成功率。     

Intelligent paging strategies for third generation mobiletelecommunication systems

Location management procedures, in conjunction with the millions of users expected to subscribe to third generation mobile telecommunication systems, will generate a huge signaling load. In this paper, we propose a method which aims at the reduction of signaling overhead on the radio link produced by the paging procedure. The key idea is the application of a multiple step paging strategy which operates as follows: at the instance of a call terminating to a mobile user who roams within a certain location area, paging is initially performed in a portion of the location area (the paging area) that the so-called “paging related information” indicates. On no paging response, the mobile user is paged in the complementary portion of the location area-this phase can be completed in more than one (paging) step. Various “paging related information” elements (e.g. recent interaction information, high mobility flag, etc.) can be used and several “intelligent” paging strategies can be defined. Representative paging strategies are analyzed in terms of network performance and quality of service (paging signaling, paging delay, processing power requirements), via a simulation tool which models a realistic city area environment     

Distributed paging and registration in wireless networks

The success of current and future wireless networks depends on their ability to provide connections to mobile terminals anywhere and at any time. It is therefore of crucial importance that wireless networks are able to quickly and efficiently locate mobile users at the time of an incoming call, which is achieved in current networks through a combination of paging and registration. In this article we present novel distributed paging and registration procedures that are naturally suited to future distributed wireless network architectures. In addition, the distributed nature of these strategies allows us to effectively balance the paging and registration traffic and the required signal processing throughout the network and alleviate any potential overloads of individual base stations.     

Modeling and performance evaluation of a cellular mobile network

An analytic model of cellular mobile communications networks with instantaneous movement is investigated in this paper. This cellular mobile network is showed to be equivalent to a queueing network and furthermore the equilibrium distribution of this cellular mobile network is proved to have a product form. The explicit expressions for handoff rates of calls from one cell to another, the blocking probability of new calls and handoff calls are then obtained. Actual call connection time (ACCT) of a call in this cellular mobile network is characterized in detail, which is the total time a mobile user engages in communications over the network during a call connection and can be used to design appropriate charging schemes. The average ACCT for both complete call and incomplete call, as well as the probability for a call to be incomplete or complete, are derived. Our numerical results show how the above measures depend on the new call arrival process for some specific reserved channels numbers in each cell. The results presented in this paper are expected to be useful for the cost analysis for updating location and paging in cellular mobile network.     

Mobile user location update and paging under delay constraints

Wireless personal communication networks (PCNs) consist of a fixed wireline network and a large number of mobile terminals. These terminals are free to travel within the PCN coverage area without service interruption. Each terminal periodically reports its location to the network by a process calledlocation update. When a call for a specific terminal arrives, the network will determine the exact location of the destination terminal by a process calledterminal paging. This paper introduces a mobile user location management mechanism that incorporates a distance based location update scheme and a selective paging mechanism that satisfies predefined delay requirements. An analytical model is developed which captures the mobility and call arrival pattern of a terminal. Given the respective costs for location update and terminal paging, the average total location update and terminal paging cost is determined. An iterative algorithm is then used to determine the optimal location update threshold distance that results in the minimum cost. Analytical results are also obtained to demonstrate the relative cost incurred by the proposed mechanism under various delay requirements.     

A Combination of Optimal Partitioning and Location Prediction to Assist Paging in Mobile Cellular Networks

The correlated both in space and time user mobility behavior can aid significantly in the localization of a moving terminal in the network coverage area. However, there is always some uncertainty in mobile user position and a network-wide search cannot be done. Therefore, a predictive paging scheme must always be combined with a location update strategy and a compatible algorithm to conduct the search. In this paper, we introduce a new strategy that combines an optimal partitioning of the location area (LA) with a model to predict user movements, based on the additional information of the cell where the last interaction between the network and the terminal took place. We study the performance of the strategy under delay bounds and different mobility and call arrival characteristics. It is found that the new scheme further minimizes signaling costs and enhances previous sequential paging algorithms.     

On optimum timer value of area and timer-based locationregistration scheme

In typical mobile communication systems, mobile station (MS) location information is updated when the MS crosses the location area boundary or the registration timer is expired. When a call attempt occurs, sequential paging rather than blanket paging is used to reduce the paging cost. We propose a new location update scheme in which to increase the paging accuracy, timer-based location update is performed within a location area. In this work, the optimum timer value of the area and timer-based location registration scheme with intelligent paging is derived. In case of a fixed location area, the optimum registration timer value depends on the speed and call arrival rate of the MS. If the speed or call arrival rate of the MS is high, location registration based on timer value should be performed frequently. Otherwise, location registration based on the crossing of location area is sufficient     

LTE高话务场景通信保障方法研究及应用

【】 随着VoLTE技术引入,LTE网络高话务场景的通信保障从数据业务为主转变为兼顾数据及话音的双重保障。该场景下4G用户及业务种类众多,大量用户同时发起语音呼叫,集中并发图片和视频的上传,导致无线接通率急剧下降,严重影响用户感知。本文基于百余场保障经验,创建了完整的保障机制,搭建了精准的评估体系,制定了保障的参数方案,应用整体方案圆满完成了各类通信保障,有效保证了网络运行安全及用户感知良好。     

A parallel shuffled paging strategy under delay bounds in wireless systems

In sequential paging schemes, the paging process is considered on per user basis. When an incoming call arrives to a mobile terminal (MT), the associated location area is divided into several paging areas (PAs) and PAs are paged one by one until the MT is found. Even though sequential paging algorithms can reduce the paging cost compared to the blanket-paging scheme, they introduce extra and unnecessary delay due to the fact that, during each paging cycle, unpaged cells are idle and unused in terms of paging. In this letter, a simple parallel shuffled paging strategy is proposed to reduce delay and improve performance. In the proposed scheme, multiple MTs can be paged in difference PAs in parallel. Our study shows that the proposed scheme outperforms both the sequential paging and the blanket paging in terms of discovery rate and queueing delay.