一种新型的寻呼网络——虚拟寻呼网

随着无线寻呼的发展 ,寻呼联网成为寻呼业发展热点之一。本文介绍了一种新型寻呼网络—虚拟寻呼网 ,它组建、管理及扩容都很简便 ,同时建网成本低     

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

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

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

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

一种新型无线语音寻呼系统

该新型语音寻呼系统是根据我国国情和市场需求而研究开发的，适用于寻呼流动人员及向其单方向传送语音信息．其语音寻呼控制中心台应用先进的微机控制技术实现全自动有／无线转接，具有单呼、组呼、紧急全呼、电脑统计、管理等功能．语音寻呼机采用数字语音合成技术，可提供三条共计３０秒的语音信息存储及重放．系统具有信息容量大、传输方式简洁迅速，用户无需复机等优点，这在电话普及率较低的我国尤有特殊意义．该系统目前已通过鉴定，即将投入批量生产，具有良好的应用前景，可用于建立中小容量专用寻呼网及小容量公众网，为我国移动通信的发展提供一种新的尝试和探索．     

一种先进,实用的寻呼发射系统

本文详细介绍了电子部七所的寻呼发射系统的组成、性能、主要设备设计和应用，读者可以通过此系统的析，了解现有POCSAG码150／280MHz频段寻呼系统。     

一种新的无线寻呼编码器优化排队算法

本文提出一种新的基于最佳匹配理论无线寻呼编码器优化排队算法，该法采用向前预测μ步的方法寻找最优解，利用分支限界的原理，剪除不能找到最优解的分支，提高运算速度。     

一种高效率的POCSAG寻呼编码器

本文从POCSAG寻呼编码原理提出提高编码效率的方法，讲述ET－1840高效寻呼编码器的原理及实现。     

3种无线寻呼系统的由来

无线寻呼系统,按ＣＣＩＲ的定义是一种传送呼叫信号的单向个人选呼系统,它没有语音,在传输过程中也许不带任何信息,也许传输一些简单的报文。寻呼接收机小巧,携带方便且费用低廉,故发展极其迅速。 目前,寻呼信号无一例外地均采用数字编码信号。英国提出的ＰＯＣＳＡＧ码于１９８２年被ＣＣＩＲ推荐为“无线寻呼１号码”;我国也已将ＰＯＣＳＡＧ码用作我国公众无线寻呼的标准码;美国将格雷顺序码（ＧＳＣ）作为其１号寻呼码,ＰＯＣＳＡＧ码作为２号码。另外,还有一些其他的编码格式。所有这些编码方式的共同不足有以下几点。 （１…     

一种改进的增强寻呼突发及其仿真验证

在同步轨道卫星通信系统中,为了进一步提高用户终端在受到遮挡或其他情况导致信道质量恶化时仍能最大程度地正确接收寻呼的能力,提出一种可用于增强寻呼的逻辑信道突发改进方案。设计了一种运用RS编码与扩频技术的增强寻呼突发结构,方案以码元为单位将编码后的寻呼消息拆分,经过扩频调制后发送,可以纠正随机错误,充分利用了编码和扩频增益。利用仿真可以看出,与现有方法相比,改进方案可以有效地提升寻呼消息的接收性能,降低寻呼消息在高斯信道下的误码率。同样,在更贴近真实的莱斯衰落信道下的性能也有明显改善。     

PCS网络中一种改进的登记方法

该文综合了基于运动和基于距离两种登记方法的优点,提出一种改进的登记方法IDMBR。在IDMBR中,系统通过向移动终端(MT)传送登记处附近小区的相关信息,使MT能了解登记处附近小区的网络结构知识,从而解决了一般动态登记方法中,MT在附近小区来回移动所造成的频繁登记问题。该方法易于实现,具有很强的可行性。     

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.     

移动IP网络中基于遗传算法的多步寻呼策略及性能分析

在移动IP网络中,层次移动IP协议可降低移动IP位置管理的信令消耗。该文研究支持寻呼的HMIPv6,提出了时延限制下的多步寻呼策略以及基于遗传算法的多步寻呼方案——根据移动节点的位置概率分布,采用遗传算法对寻呼区域内的所有子网进行分组,每步寻呼一个组,使平均寻呼信令开销达到或接近最优。此外,对HMIPv6、单步寻呼的HMIPv6以及基于遗传算法的多步HMIPv6寻呼方案的信令开销进行了比较分析,得出寻呼节省信令开销的必要条件。最后,给出一组数值结果以说明所提出的寻呼策略的有效性。     

Optimal Sequential Paging in Cellular Wireless Networks

In a high-capacity cellular network with limited spectral resources, it is desirable to minimize the radio bandwidth costs associated with paging when locating mobile users. Sequential paging, in which cells in the coverage area are partitioned into groups and paged in a non-increasing order of user location probabilities, permits a reduction in the average radio costs of paging at the expense of greater delay in locating the users. We present a polynomial time algorithm for minimizing paging cost under the average delay constraint, a problem that has previously been considered intractable. We show the conditions under which cluster paging, a simple heuristic technique proposed for use with dynamic location update schemes, is optimal. We also present analytical results on the average delay and paging cost obtained with sequential paging, including tight bounds.     

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

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

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.     

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.     

无线寻呼系统的新进展

主要介绍无线寻呼技术的一些新进展，特别是高速寻呼、双向寻呼和语音寻呼，对三种高速寻呼协议ＦＬＥＸ，ＥＲＭＥＳ和ＡＰＯＣ进行了简单评述。     

LeZi-Update: An Information-Theoretic Framework for Personal Mobility Tracking in PCS Networks

The complexity of the mobility tracking problem in a cellular environment has been characterized under an information-theoretic framework. Shannon's entropy measure is identified as a basis for comparing user mobility models. By building and maintaining a dictionary of individual user's path updates (as opposed to the widely used location updates), the proposed adaptive on-line algorithm can learn subscribers' profiles. This technique evolves out of the concepts of lossless compression. The compressibility of the variable-to-fixed length encoding of the acclaimed Lempel–Ziv family of algorithms reduces the update cost, whereas their built-in predictive power can be effectively used to reduce paging cost.