ARP功能对寻呼信道的影响

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

低轨卫星网络中位置寻呼方法

在LE0卫星通信网络中,为了将呼叫传递到移动用户,必需知道用户当前的位置,即移动用户定位,包括位置更新和位置寻呼两个过程。由于LEO卫星覆盖区随时间变化迅速,造成传统位置寻呼方法的信令代价和寻呼时延性能不能满足系统要求。该文针对LEO网络的运动特点,提出了顺序概率位置寻呼(PP:Sequential Paging Based User’s Probability)方法,开通过仿真对SP和其它已有寻呼方法在寻呼时延和寻呼信令代价方面做了比较。     

寻呼容量的估算与分析

寻呼成功率是GSM网络中一项重要的指标。从寻呼信道的逻辑结构和帧结构着手分析,推导出寻呼信道的容量公式,从理论上对寻呼的容量进行了估算,并与实际的网络容量进行比较,提出了提高寻呼容量的方法。对寻呼成功率优化具有一定的指导意义。     

无线寻呼“黑洞”的查找和优化

致力于提高网络质量．从而保持用户的忠诚度和争取更高的市场份额是中国移动目前面临的重要课题。无论是GSM移动通信系统还是未来将要采用的3G甚至4G技术，移动用户的呼入业务都是建立在先通过无线寻呼寻找到移动用户，再分配所需的网络资源之上的。就目前而言，无线寻呼成功率也是一项重要的网络质量指标。而且，这项指标还直接影响来话接通率和短信接收成功率等其他网络质量指标的优劣。     

国际寻呼系统简介

国际寻呼系统简介＠曾晓延国际寻呼系统简介曾晓延无线电寻呼是一种普及型的大众化的移动通信方式。目前寻呼所能提供的服务品种已有音响寻呼、数字寻呼、文字寻呼、语音寻呼、双向寻呼、带寻呼提示的语音信箱、传真信箱、电子信箱、用户终端入网、Ｉｎｔｅｒｎｅｔ上网寻呼等众...     

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

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

GSM-R系统的寻呼容量评估

首先介绍了影响铁路GSM-R系统寻呼容量的参数,在此基础上利用一个假设的话务统计模型,给出了一种评估铁路GSM-R系统的寻呼容量的方法。最后为提高GSM-R系统的寻呼容量提出了建议。     

PCS网络中一种改进的寻呼算法

本文对PCS网络中用户处于归属LA时,提出了一种改进的寻呼算法:常驻小区寻呼法.通过对用户在归属LA各小区驻留时间的分析,系统首先寻呼用户常驻小区,若不成功再寻呼其它小区.与现有移动通信系统寻呼算法相比,它可使系统节省大量的寻呼开销、进一步提高无线资源利用率.本文的不足是用户在其非常驻小区时,有可能其首次被呼比现有移动通信系统的被呼要多一次寻呼延迟.     

TD寻呼原理及寻呼策略优化的方法

寻呼成功率是衡量网络性能的一个重要指标,同时对于所有手机用户是否能够成功作被叫来说十分重要。寻呼成功率主要取决于以下因素：位置区、寻呼方式、寻呼组设置和无线环境,本文主要讨论寻呼策略对寻呼成功率的影响,并提出优化建议。     

LAC区与寻呼关系浅析

LAC区用于标志不同的位置区域,随着网络的不断发展而进行LAC区的划分是必要的.LAC区的划分受寻呼次数的制约是很明显的.给出了寻呼原理、寻呼信令流程和寻呼参数设置,计算了在不同寻呼方式下的寻呼容量.结合现网情况分析了LAC区划分受寻呼制约的情况.根据话务模型给出了进行LAC区划分的合理方法.     

IP Paging Service for Mobile Hosts

In wireless networks, mobile hosts must update the network with their current location in order to get packets delivered. Paging facilitates efficient power management at the mobile host by allowing the host to update the network less frequently at the cost of providing the network with only approximate location information. The network determines the exact location of a mobile host through paging before delivering packets destined to the mobile host. In this paper, we propose the concept of paging as an IP service. IP paging enables a common infrastructure and protocol to support the different wireless interfaces such as CDMA, GPRS, wireless LAN, avoiding the duplication of several application layer paging implementations and the inter-operability issues that exist today. We present the design, implementation, and detailed qualitative and quantitative evaluation, using measurements and simulation, of three IP-based paging protocols for mobile hosts.     

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.     

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

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

P-MIP: Paging Extensions for Mobile IP

As the number of Mobile IP users grows, so will the signalling overhead associated with Internet mobility management in the core IP network. This presents a significant challenge to Mobile IP as the number of mobile devices scale-up. In cellular networks, registration and paging techniques are used to minimize the signalling overhead and optimize the mobility management performance. Currently, Mobile IP supports registration but not paging. In this paper, we argue that Mobile IP should be extended to support paging to improve the scalability of the protocol to handle large populations of mobile devices. To address this, we introduce P-MIP, a set of simple paging extensions for Mobile IP, and discuss the construction of paging areas, movement detection, registration, paging and data handling. We present analysis and simulation results for Mobile IP with and without paging extensions, and show that P-MIP can scale well supporting large numbers of mobile devices with reduced signalling under a wide variety of system conditions.     

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.     

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.     

Hash-Based Paging and Location Update Using Bloom Filters

We develop and analyze a hash-based paging and location update technique that reduces the paging cost in cellular systems. By applying a Bloom filter, the terminal identifier field of a paging message is coded to page a number of terminals concurrently. A small number of terminals may wake up and send what we call false location updates although they are not being paged. We compare the total number of paging and false location update messages with the cost of the standard paging procedure. Fortunately, the false location update probabilities can be made very small, and important bandwidth gains can be expected. The larger the size of the terminal identifier, the less probable are false location updates. Therefore, hash-based paging especially shows promise for IP paging in mobile IPv6 networks with 128-bit mobile host addresses.