Location Management in PCS Networks by Caching Two-Level Forwarding-Pointers

One of the challenging tasks in Personal Communication Services (PCS) is to efficiently maintain the location of PCS subscribers who move from one region to another (hereafter called mobile users). When a mobile user receives a call, the network has to quickly determine its current location. The existing location management scheme suffers from high signaling traffic in locating the mobile users. Two-level forwarding pointer scheme has been proposed from per-user forwarding pointer scheme to reduce the cost of signaling traffic. In this paper, we enhance the two-level forwarding pointer scheme. When a mobile user moves from its current Registered Area (RA), which is served by Mobile Switching Center (MSC), to another RA the local switch that acts as a parent of those two MSCs maintains this movement in its memory (hereafter called cache entry). A cache entry is used to locate rapidly the mobile user instead of querying the Home Location Register (HLR) and waiting for its reply. HLR is centralized in the network and far away from the mobile users so that the signaling traffic crossing it is expensive. Sometimes the cache entry may be failed to reach the mobile user then a two-level forwarding pointers will be created from the corresponding Visitor Location Register (VLR), attached to its MSC, through a correct path to locate the mobile user. Thus, there is a saving in cost of querying the underlying HLR. The analytical results indicate that such proposal efficiently reduces the signaling traffic cost for all values of Call to Mobility Ratio (CMR), this is especially considerable when CMR ≥1, without any increase in the call setup delay. Salah M. Ramadan (samohra@yahoo.com) received the BS and MS degrees from Computers Engineering Department, Al-Azhar University, Cairo, Egypt, in 1995 and 2002, respectively. From 2002, he was a Ph.D. student in Computers Engineering Department at Al-Azhar University and is currently pursuing the Ph.D. degree, where he is a research assistant in the Wireless Networks Branch. His research interests include traffic management in ATM networks, routing protocols, mobility management in PCS networks, and mobile computing. He is currently an instructor in Cisco Academy, Egypt. Ahmed M. El-Sherbini (Sherbini@mcit.gov.eg) received the Ph.D. in Electrical and Communication Engineering, Case Western University, U.S.A. March 1983 and M.Sc. in Communication Engineering, Cairo University, Giza, Egypt, June 1980. (M. Sc. Research Studies at the Ecole Nationale Superieure des Telecommunications (ENST), Paris, France). He is the Director, National Telecommunication Institute – Ministry of Communications and Information Technology, Egypt and Professor of Electrical and Communication Engineering Dept. Faculty of Engineering, Cairo University, Egypt. M. I. Marie received his B.Sc., M.Sc. and Ph.D. in electronic and communication engineering from Cairo University on 1972, 1981, 1985, respectively. Now he is a professor of communications at Computer and System Engineering department Al-Azhar University, Cairo, Egypt. His fields of interest includes digital communication, computer networks and protocols development. M. Zaki (azhar@mailer.scu.eun.eg) is the professor of software engineering, Computer and System Engineering Department, Faculty of Engineering, Al-Azhar University at Cairo. He received his B.Sc. and M.Sc. degrees in electrical engineering from Cairo University in 1968 and 1973 respectively. He received his Ph.D. degrees in computer engineering from Warsaw Technical University, Poland in 1977. His fields of interest include artificial intelligence, soft computing, and distributed system.     

Analysis and Comparison of Location Strategies for Reducing Registration Cost in PCS Networks

In mobile environments, a personal communication service (PCS) network must keep track of the location of each mobile user in order to correctly deliver calls. A basic scheme used in the standard IS-41 and GSM protocols is to always update the location of a mobile user whenever the mobile user moves to a new location. The problem with this approach is that the cost of location update operations is very high especially when the mobile user moves frequently. In recent years, various location management strategies for reducing the location update cost have been proposed. However, the performance issue of these proposed algorithms remains to be investigated. In this paper, we develop two Markov chains to analyze and compare the performance of two promising location update strategies, i.e., the two location algorithm (TLA) and the forwarding and resetting algorithm (FRA). By utilizing the Markov chain, we are able to quickly answer what-if questions regarding the performance of PCS networks under various workload conditions and also identify conditions under which one strategy can perform better than the others. Using the cost due to location update and search operations between two successive calls to a mobile user as a performance measure, we show that when the mobile user exhibits a high degree of locality and the mobile user's call-to-mobility ratio (CMR) is low, TLA can significantly outperform both FRA and IS-41. On the other hand, when CMR is high, FRA is the winner. Furthermore, unlike TLA which may perform worse than IS-41 at high CMR values, FRA at identified optimal conditions can always perform at least as good as IS-41, suggesting that FRA over TLA should be used as a generic scheme in reducing the location cost in the PCS network to cover all possible per-user CMR values.     

Dynamic Location Management for Mobile Computing

This paper presents a dynamic and individualized location update scheme that considers each user's mobility patterns. The mobility patterns are used to create individualized location areas for each user. The proposed scheme is flexible and can be used in network with arbitrary cell topologies. The scheme, along with other existing schemes is simulated using realistic users' mobility and call arrival patterns, and network topology. The simulated environment consists of 90 cells representing the geographical area of the San Francisco bay, and 66,550 mobile users representing the typical classes of users that are normally present in a real cellular network. Results show the proposed scheme gives lower overall signaling costs, resulting in savings on the limited radio bandwidth that may have otherwise been used for location updates and paging.     

低轨卫星系统中结合时间和移动的位置更新策略

低轨(LEO)卫星快速运动,移动终端(MT)相对于卫星的位置信息也在不断变化,如何有效地管理MT的位置信息,减小位置更新频率和寻呼开销是研究位置管理的主要目的。为此,提出一种低轨卫星系统中的动态位置管理策略,基于时间和移动相结合进行位置更新,在不增加寻呼开销的条件下,减小了位置更新频率,从而有效降低了位置管理的总开销。     

Implicit Deregistration with Forced Registration for PCS Mobility Management

Registration/deregistration with a mobility database called Visitor Location Registers (VLRs) is required in a PCS network when a mobile phone moves between registration areas. Several schemes were proposed to deregister a mobile phone after it moves out of a registration area. A simple scheme, called implicit deregistration, is studied in this paper, which does not specifically deregister any obsolete record in the VLR. If the VLR is full when a mobile phone arrives, a record in the VLR is deleted and the reclaimed storage is reassigned to the incoming mobile phone. It is possible that a valid record will be deleted. If so, the VLR record of a mobile phone may be deleted before a call to the mobile phone arrives. Our previous work assumed that the incoming call setup would be lost. In this paper, we propose forced registration to restore the VLR record before the call setup operation can proceed. With this modification, implicit deregistration totally eliminates the deregistration traffic at the cost of creating some forced registration traffic.We derive the record-missing probability and the portion of the network traffic saved by implicit deregistration. Our study indicates that implicit deregistration with forced registration may significantly reduce the deregistration traffic if the user mobility is high and the number of mobile phones in a registration area is not very large.     

LEO卫星网基于时间和距离的位置更新策略

针对LEO卫星网中的动态位置区划分提出的一种基于时间和距离的位置更新策略,不同以往的处理方式,提出的更新策略中动态位置区更新半径随着用户的运动速度和业务繁忙程度而改变,对高速用户和低速用户分别采用不同的更新半径,当系统的业务繁忙程度改变时更新半径也相应的改变,仿真结果表明文中提出的位置更新策略对于移动用户比较多并且业务突发情况,能有效的减少位置管理开销,节省了系统资源。     

多目标动态规划的神经网络方法

本文提出了求解多目标动态规划的神经网络方法,证明了该网络是Ｌｙａｐｕｎｏｖ稳定的,且在适当的条件下收敛于多目标动态规划的（局部）非劣解,最后,文中给出了算例及其模拟结果。     

一种基于动态规划的并行构件资源选择算法

当前,多种硬件体系结构并存,传统的并行构件资源管理却不能充分利用并行构件的属性以适应底层硬件的多样性,可扩展性比较差.在研究基于CCA规范的并行构件执行集成平台的基础上,本文提出了一种层次化并行构件资源管理模型,并提出了一种基于动态规划的并行构件资源选择算法.实验结果表明,相对于通常使用的CPU频率优先、CPU Cac...     

Load-Balanced Location Management for Cellular Mobile Systems Using Quorums and Dynamic Hashing

This paper presents a new distributed location management strategy for cellular mobile systems. Its salient features are fast location update and query, load balancing among location servers, and scalability. The strategy employs dynamic hashing techniques and quorums to manage location update and query operations. The proposed strategy does not require a home location register (HLR) to be associated with each mobile node. Location updates and queries for a mobile node are multicast to subsets of location servers, which change with time depending on the location of mobile node/querying node and load on the servers. Simulation experiments demonstrate that such dynamism prevents situations of heavy load on some location servers when mobile nodes are not uniformly distributed in space, or when some mobile nodes have their location updated or queried more often than others. Also, queries return the latest location information of a mobile node with a very high probability. The proposed scheme requires at most one unicast and two rounds of message multicasting for location update and query operations. All multicast messages have a small payload and are restricted to the high bandwidth wired part of the mobile network resulting in low communication overhead. Moreover, if a quorum of location servers gets overloaded, part of its load can be transferred to another lightly loaded quorum using dynamic hashing techniques.     

Effective Location Based Services with Dynamic Data Management in Mobile Environments

With the proliferation of mobile computing technologies, location based services have been identified as one of the most promising target application. We classify mobile information service domains based on feature characteristics of the information sources and different patterns of mobile information access. By carefully examining the service requirements, we identify the dynamic data management problem that must be addressed for effective location based services in mobile environments. We then devise a general architecture and cost model for servicing both location independent and location dependent data. Based on the architecture and cost model, we propose a set of dynamic data management strategies that employs judicious caching, proactive server pushing and neighborhood replication to reduce service cost and improve response time under changing user mobility and access patterns. Detail behavior analysis helps us in precisely capturing when and how to apply these strategies. Simulation results suggest that different strategies are effective for different types of data in response to different patterns of movement and information access. Shiow-yang Wu is an associate professor of the Department of Computer Science and Information Engineering at National Dong Hwa University, Hualien, Taiwan, R.O.C. He received the BS and MS degrees in computer engineering from National Chiao Tung University, Hsinchu, Taiwan, ROC, and the PhD degree in computer science from the University of Texas at Austin in 1984, 1986, and 1995, respectively. His research interests include data/knowledge bases, mobile computing, distributed processing, intelligence information systems, and electronic commerce. Kun-Ta Wu was born in Taipei, Taiwan, R.O.C., in 1976. He received the B.S. degree in computer science from Soochow University, Taipei, Taiwan, R.O.C., in 1999 and the M.S. degree in computer science and information engineering from National Dong Hwa University, Hualien, Taiwan, R.O.C., in 2001. Currently, he is an Assistant Researcher in the Domestic Division at Science and Technology Information Center, National Science Council, R.O.C., as a member of Information Gathering and Analysis Group of National Information and Communication Security Taskforce. His research interests include mobile computing, wireless network and information security.     

一种无格点动态规划检测前跟踪算法研究

目标的多样化和环境的复杂化,对现代雷达的探测能力与航迹处理提出了更高的要求。随着雷达技术的迅速发展, 弱目标的检测与跟踪也受到了更为广泛的关注。检测前跟踪技术可以减少虚假航迹,提高微弱目标的检测和跟踪性能。为改善传统的基于动态规划的检测前跟踪算法计算复杂的缺点,提出了一种无格点DP-TBD改进算法,分析了适用模型, 给出了运动及量测模型。仿真实验表明,该算法具有较好的检测跟踪性能。     

基于NLS的多机只测角误差配准算法

多机无源融合定位中的误差配准是目前多传感器误差配中的难点之一。当无源传感器获得的观测量存在系统误差却不进行配准时,多机融合定位的效果将受到严重影响。针对这一情况,在多机只测角无源定位问题中提出了一种基于非线性最小二乘（NLS）的误差配准算法。该算法将多机只测角误差配准问题转换为非线性最小二乘估计问题,并采用高斯–牛顿法求解,即先将非线性量测方程线性化并采用加权最小二乘进行估计,然后进行迭代直至收敛到最优估计值。仿真结果表明,与EKF配准算法相比,当观测时间足够长时,本文提出的NLS误差配准算法的定位误差可以接近克拉美罗限（CRLB）,并且对系统误差的估计精度非常高。      

遮挡检测/立体匹配中的分段动态规划法

 为了显式地在视差图上标记出遮挡区域,本文在计算视差空间的基础上,利用动态规划算法搜索出最佳视差曲线.计算所得的视差曲线上有三种状态标记:匹配状态和二种遮挡状态.为了保证视差曲线通过路径控制点,提出了一种分段式动态规划算法.算法将视差空间影像划分为路径控制区和非路径控制区.在路径控制区强制路径通过路径控制点,在非路径控制区采用动态规划进行路径最佳搜索.为保证路径控制点高度可靠,提出了选择路径控制点的4个准则.实验结果表明,新算法比传统的动态规划算法在遮挡检测和匹配精度上都有一定的提高,算法可靠性强,运算量小.     

Agent-Based Forwarding Strategies for Reducing Location Management Cost in Mobile Networks

An important issue in location management for dealing with user mobility in wireless networks is to reduce the cost associated with location updates and searches. The former operation occurs when a mobile user moves to a new location registration area and the network is being informed of the mobile user's current location; the latter operation occurs when there is a call for the mobile user and the network must deliver the call to the mobile user. In this paper, we propose and analyze a class of new agent-based forwarding schemes with the objective to reduce the location management cost in mobile wireless networks. We develop analytical models to compare the performance of the proposed schemes with existing location management schemes to demonstrate their feasibility and also to reveal conditions under which our proposed schemes are superior to existing ones. Our proposed schemes are particularly suitable for mobile networks with switches which can cover a large number of location registration areas.     

间断连接无线互联网络中路由问题的动态规划方法

在间断连接无线互联网络中，由于自然干扰或人为因素影响，节点之间无线链路通常在时间上具有间断特性，这就为间断连接无线互联网络的选路问题提出了新的挑战。丈章在链路统计特性的基础上，重点分析了运用动态规划方法求解该问题的基本思路。并且给出了该方法的基本方程，从理论上分析了该方法的正确性和有效性。     

一种改进的外推动态规划检测前跟踪算法

检测前跟踪(TBD)方法能够有效地检测弱小目标从而提高雷达作用距离,但其计算量较大,制约其在工程中的应用。针对上述问题,文中提出了一种改进的外推动态规划TBD方法。将数据先经过恒虚警处理来减少待处理的状态,在后面的递推积累阶段,对邻帧关联不上的状态进行隔帧搜索,以降低失跟的概率。经蒙特卡洛仿真表明,该方法在提高运算速度的同时能够保证检测性能。     

个人通信位置管理的计时双位置算法

提出了一种新的位置管理算法——计时双位置算法，从理论上导出了TTLA算法的总代价函数，给出了传统IS-41和双位置算法(TLA)的统～数学框架。通过性能分析可知，TTLA算法能根据用户的呼叫移动比，在IS-41和TLA两者之间进行选择，综合性能好，且在某些情况下，性能要超过另两种算法。     

一种基于动态规划的间断连接 无线互联网络选路算法

 在无线互联网络中,由于自然干扰或网络规划的需要,节点之间无线链路通常在时间上具有间断特性.我们将链路具有间断特性的无线互联网络称为间断连接无线互联网络.间断连接无线网络的路由优化问题需要联合考虑无线链路的时间和空间特性,这就为间断连接无线互联网络的选路问题提出了新的挑战.本文为这种网络提出了一种全新的选路算法——DPRA算法,该算法在链路统计特性的基础上,采用动态规划的方法,以转发时延为选路标准进行路由的选择.仿真结果表明,本文提出的算法可以有效得到间断连接无线互联网络中时延最短的路径.     

基于动态规划的激光雷达信号检测

为解决低信噪比下激光微弱回波的检测问题,提出了一种新的小目标检测算法。采用 动态规划方法克服了低信噪比下激光回波闪烁对目标检测的影响。仿真结果表明:该方法较传统的检测方法性能有很大提高。     

一种用于HPRF雷达的改进DPA弱目标检测算法

针对高重频雷达距离模糊可能会导致目标航迹不连续即发生跳变的问题,提出了一种改进的动态规划检测前跟踪算法,该方法在传统动态规划的基础上加入了后续状态估计并改进了动态规划搜索策略.它利用目标初始状态信息对目标后续状态进行估计并进行航迹跳变判决,再根据判决结果选择动态规划搜索策略,进而得到最优的目标试验航迹.文中利用改进的动态规划算法分别对距离模糊后跳变与未跳变两种情况的弱目标进行检测.仿真结果验证了该算法可以提高雷达回波中弱目标的检测性能,算法实际可行有效.