ARP功能对寻呼信道的影响

CDMA移动通信系统是干扰受限的系统,而且系统容量是软容量,因此优化网络,改善网络性能、提高网络运行效率是发展的必然.寻呼成功率是一项衡量网络性能,直接影响网络系统接通率的重要指标.开通接入功能组件(ARP:Access Robustness Package)对寻呼成功率及寻呼信道有一定的影响,对提升系统指标、提高网络服务质量具有一定的实际意义.     

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

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

CDMA寻呼信道负荷的计算(上)

首先分析了寻呼信道的特性和帧结构；然后通过分析寻呼信道发送的各种消息的内容，对每个内容的长度进行了计算，并得出了每种消息相对于寻呼信道总容量的寻呼信道占用率；最后给出了在一定假设条件下，一个寻呼区域中BHCA值和寻呼信道负荷的关系。     

CDMA寻呼信道负荷的计算(下)

首先分析了寻呼信道的特性和帧结构；然后通过分析寻呼信道发送的各种消息的内容，对每个内容的长度进行了计算，并得出了每种消息相对于寻呼信道总容量的寻呼信道占用率；最后给出了在一定假设条件下，一个寻呼区域中BHCA值和寻呼信道负荷的关系。     

启用CDMA网络中的智能化分区寻呼

寻呼信道的容量是整个网络的容量瓶颈,本文介绍克服寻呼信道容量瓶颈目前最有效的智能化分区寻呼打开的方法、注意事项及实施后的效果。     

移动GSM网络寻呼成功率参数优化

移动通信的网络质量越来越受到关注,运营商对网络性能指标的稳定性要求越来越高,尤其是涉及到用户感知的指标,例如寻呼成功率、接通率、掉话率等,都提出了很高的要求。文章对影响用户感知的重要指标寻呼成功率进行了分析。从分析影响GSM网络寻呼成功率的原因人手,找到寻呼成功率的参数优化方法。通过无线寻呼参数的优化,使寻呼成功率明显提高,达到预期的目的,提高用户感知。     

LTE网络下的寻呼消息及其监听算法

介绍了LTE网络下寻呼消息的用途以及用于承载寻呼消息的逻辑信道、传输信道和物理信道之间的映射关系,同时对其寻呼周期的非连续监听算法做了详细的分析。     

GSM网络位置区规划研究

GSM网络位置区的合理规划对移动网络的寻呼成功率、切换成功率和位置更新成功率起关键的作用。文章分析了GSM移动通信网位置区的规划原则、及2G和3G共存时的位置区规划,并给出GSM网络中BTS的寻呼容量和位置区的大小的计算方法。     

寻呼信道负荷过高的问题研究

寻呼信道的高负荷已成为阻碍中国电信cDMA网络长远发展的因素之一,如何降低CDMA网络的寻呼信道负荷是中国电信网络优化的重要研究课题。文章主要研究了阿尔卡特朗讯CDMA网络中开销消息所产生的寻呼信道负荷,并以阿尔卡特朗讯业务区某大型城市为例,就如何降低寻呼信道负荷提出了几点建议。     

广域无线电寻呼的趋势

近二十年来，广域无线电寻呼一直用来通知人们，有人需要提供服务。如今，新技术正在特广域寻呼改变成一种通过信息中心提供全面信息的业务。无线电频率的资源匮乏，业务的扩展需要更有效地使用可资使用的信道，这些业务使用欧洲通信标准协会制订的大容量广域寻呼泛欧寻呼系统（ＥＲＭＥＳ）标准，或增强型ＰＯＣＳＡＧ网络用的ＡＰＯＣ码。不久，使用返回信道确认的双向寻呼将成为现实。作者介绍了广域寻呼业务在世界各地的预计渗透率和如何满足容量增长要求     

GSM系统中的寻呼重发优化与实现

主要研究GSM系统中的寻呼性能,根据现行GSM寻呼系统提出寻呼四次重发方案,将MSC重发方案和BTS重发方案进行对比讨论,选择BTS重发方案,详细介绍寻呼方案实现过程并给出测试结果,能够提高GSM系统的寻呼成功率,特别适用于无线信号差的环境。     

寻呼指标提升中容易忽略的问题剖析

文章重点剖析了寻呼成功率指标提升中容易忽略的寻呼时间间隔、RACH重发次数、T3101计时器、RACH最小接入电平,MS最小接入电平等参数设置,同时给出了相关的容量门限.将寻呼成功率成功提升到98%的良好工作实践,说明该指标的提升即使在山地丘陵环境中也是可行的,而且随着电信重组工作的铺开,从用户导向的角度考虑,这种探索也是必要的.     

关于TMSI寻呼与IMSI寻呼性能分析

随着移动用户的持续增长和手机新业务的不断推广,移动通信系统的寻呼负荷日益加重。以移动用户漫游被叫时的呼叫流程为例,分析IMSI寻呼和TMSI寻呼的原理,对比两种寻呼方式对网络性能影响,提出一种评估寻呼方式的量化计算方法。通过对寻呼容量较为紧张网元的试验证明,该方法可以科学指导寻呼方式的优化工作,提高移动通信网络的系统寻呼容量,改善移动通信系统寻呼性能。     

GSM网寻呼成功率优化方法

本文专门针对寻呼成功率指标偏低的问题进行专项优化研究,并举例介绍寻呼成功率专项优化的流程和方法.     

Internet寻呼业务应用前景可观

随着Ｉｎｔｅｒｎｅｔ网络技术的发展,Ｉｎｔｅｒｎｅｔ用户和寻呼业务用户日益增多,Ｉｎｔｅｒｎｅｔ寻呼业务应运而生,Ｉｎｔｅｒｎｅｔ寻呼业务按使用方法可分为万维网寻呼和电子邮件寻呼两大类,目前提供电子邮件寻呼业务的公司较多。     

User Independent Paging Scheme for Mobile IP

Multi-step paging has been widely proposed in personal communications services (PCS) systems to reduce the signaling overheads. Similar ideas can be applied to Mobile IP to provide IP paging services. However, current proposed multi-step paging schemes are user dependent under which the partition of paging areas and the selection of paging sequence are different for each user. The performance of a user dependent paging scheme for individual users may be affected by many factors. It is often difficult to achieve perfect performance for each user. In addition, when multiple users are paged at the same time, user dependent paging schemes may consume significant system resources. This paper introduces a user independent paging scheme where the paging criterion is not based on individual user information. The goal of user independent paging is to provide satisfactory overall performance of the whole system, when personalized optimal performance for each user is hard to obtain. The user independent paging scheme is proposed for IP mobility for its easy implementation and convenient combination with paging request aggregation. The paging criterion adopted is the mobility rate of each subnet determined by the aggregated movements of all mobile users. In order to implement the proposed scheme, a concept of “semi-idle state” is introduced and the detailed solution for obtaining mobility rate is presented. Analytical results show that when paging one user at a time, the performance of the proposed user independent paging scheme is comparable to that of the paging schemes based on perfect knowledge of user movement statistics. When paging multiple users simultaneously and when the knowledge on individual user behavior is not perfectly accurate, the proposed scheme has remarkable advantages in terms of reducing the overall paging cost. Jiang Xie received her B.E. degree from Tsinghua University, Beijing, China, in 1997, M.Phil. degree from Hong Kong University of Science and Technology in 1999, and M.S. and Ph.D. degrees from Georgia Institute of Technology in 2002 and 2004, respectively, all in electrical engineering. She is currently an assistant professor with the Department of Electrical and Computer Engineering at the University of North Carolina-Charlotte. Her current research interests include resource and mobility management of wireless networks,QoS provisioning, and next-generation Internet. She is a member of IEEE and ACM.     

An Efficient Two‐Step Paging Strategy Using Base Station Paging Agents in Mobile Communication Networks

An effective paging strategy is essential for improving the utility of radio channels. This paper proposes a two‐step paging strategy which involves using base station paging agents to page a single cell at each paging. An analytical model is used to evaluate the performance of the proposed strategy. The proposed strategy is compared with the traditional simultaneous paging strategy and a recent proposal using the base station paging agents. The numerical results showed that the proposed strategy proficiently reduces paging cost on radio channels compared with other paging strategies.     

安徽国信公司高速寻呼网设计

分析了寻呼网的现状，介绍了安徽国信FLEX高速寻呼网的建设概况，并对高速寻呼网的设计作了一些具体的阐述。     

Effective Paging Schemes with Delay Bounds as QoS Constraints in Wireless Systems

In this paper new paging schemes are presented for locating mobile users in wireless networks. Paging costs and delay bounds are considered since paging costs are associated with bandwidth utilization and delay bounds influence call setup time. In general, location tracking schemes require intensive computation to search for a mobile terminal in current PCS networks. To reduce the paging costs, three new paging schemes, reverse, semi-reverse and uniform, are introduced to provide a simple way of partitioning the service areas and decrease the paging costs based on each mobile terminal's location probability distribution. Numerical results demonstrate that our approaches significantly reduce the paging costs for various probability distributions such as uniform, truncated discrete Gaussian, and irregular distributions.