全分布式位置管理策略的负载和位置更新性能研究

分布式位置管理策略及其分布式数据库结构与传统位置管理策略和HLR－VLR结构有显著区别，本文基于一种对DDB结构新的性能估计方法，从用户的移动性概率分布出发，对DDB结构下的数据库负载和位置更新性能进行了研究。     

智能网与先验位置信息在呼叫连接中的应用

在个人通信以及联网寻呼中，怎样能够以最小的网络负载和最少的费用最快地期望的用户，最值得研究的问题。本文基于智能网提出了先验位置信息的概念，并给出了这种信息在位置登记器中的应用算法。计算机性能模拟显示它使原有的位置登记器中的智能网性能得到了改善。     

基于可变位置区的动态位置管理算法

针对当前基于静态位置区的位置管理算法不能根据用户的呼叫和运动模式调整位置区大小的缺点,提出了动态位置区管理算法,它可以根据用户的运动速度和呼叫到达率动态优化位置区的大小。基于二维六边形多级位置区蜂窝网络结构以及液体流动运动模型假设,分别给出动态位置区算法和基于运动的动态位置区算法的优化位置区大小。理论分析和数值仿真结果表明,所提算法比静态位置区算法节省了大量的系统资源。     

一种新型永磁同步电机用无位置传感器控制算法

目前在永磁电机控制领域中，使用无位置传感器的电机调速方式获得了广泛的应用与发展。通过过去几十年的不懈研究，出现了多种无位置感应器控制算法，通常这些算法可以被归为两类，即仅适合于电机高速区使用的算法以及仅适合于电机低速区使用的算法，但是到目前为止，没有任何一种算法能够在电机的整个调速范围内都有效。本文提出了一种新型的融合了高速算法和低速算法优点的混合算法，该算法在电机的整个调速范围内都能有效的估算转子位置。     

Ad hoc网中基于位置信息的QoS路由算法

在分析ad hoc网络的单播QOS路由问题的基础上，本文提出了一种新的分布式QoS路由算法-LMLAR(local multicasting location-aided routing)算法。LMLAR算法最关键的思想是利用了“本地多播”机制和位置信息选择路由。仿真结果表明：LMLAR算法能够以较小的路由消息开销取得较高的路由成功率，具有比TBP算法更好的性能，适合于adhoc网的高度动态的环境。     

基于三角形与位置指纹识别算法的WiFi定位比较

WiFi的定位实现主要基于三角形算法和位置指纹识别,文章首先分别对这两方面从理论上作了介绍,然后通过在校园和市内两种室外环境的现场实验,证实了基于WiFi无线定位的可能性,也表明了在室外环境下基于位置指纹识别的定位性能远优于基于三角形算法。     

带门槛的环形搜索移动性管理策略中移动台所 越过的位置区环数

位置管理或移动性管理是移动计算研究领域的一个具有挑战性的问题.我国及其他国家目前正在使用的个人通信网络如GSM、IS-41中,用两层数据库HLR/VLR支持位置管理.在这些网络中,每当移动台从一个位置区LA(Location area)移动到另一个位置区,其基本的位置管理策略(简称"基本策略")不管是否必要均立即进行位置更新操作,因而造成系统资源的极大浪费,降低了系统的性能.本文给出一种带门槛的环形搜索策略(简称"门槛环形策略")——将位置区分成环,设定一个门槛(整数),当移动台越过的位置区的环数没有达到门槛时,系统不进行位置更新操作,以减少位置管理的费用.在假定移动台的呼入是一个泊松过程,移动台在各个位置区的逗留时间是符合一般概率分布的随机变量的条件下,推导出在两次呼入之间移动台处于各位置区环的概率及移动台所越过的位置区环数公式,给出了"门槛环形策略"的位置管理费用小于"基本策略"的条件.     

位置辅助的UWB网络路由协议

UWB无线通信网络是未来无线通信最具潜力的技术之一。选择高速稳定的路径进行通信十分重要。文章在常用位置辅助（LAR）路由算法的基础上,提出了一种新的位置辅助路由算法（LASSR）。该算法在利用UWB技术精确定位功能的基础上,引入信号稳定因子,并以此作为路径选择的依据,从而增强了所选择路径的稳定性,减少了因为路径失效带来的重新路由次数。仿真结果表明,LASSR算法比LAR算法具有更好的性能。     

阵元位置误差对MMUSIC算法测向性能的影响

首先对MMUSIC算法进行了分析和仿真,然后重点讨论了阵元位置误差对MMUSIC算法测向性能的影响,并以均匀直线阵为例进行了仿真实验。从理论推导和仿真结果可以看出,天线阵阵元位置误差严重影响着MMUSIC算法测向性能,得出了有用结论。     

噪声点位置已知的自适应滤波算法比较研究

高效滤除图像中椒盐噪声的方法大多采用先检测被污染图像中椒盐噪声的位置,再有针对性地对椒盐噪声进行处理的方法。噪声检测算法精度均较高,滤波质量与后续采用的自适应开关滤波算法息息相关。文中在图像椒盐噪声位置已知的情况下,比较研究了应用较为广泛的3种自适应开关滤波算法的去噪性能。     

Reducing location update cost in a PCS network

Location tracking operations in a personal communications services (PCSs) network are expensive. Several strategies have been proposed to reduce the location update cost. This paper studies a special case of a location tracking algorithm called the alternative location algorithm. This special case is referred to as the two location algorithm (TLA). An analytical model is proposed to compare the performance of the TLA and the IS-41 protocol. Our study indicates that the performance of the TLA is significantly affected by the user moving patterns and the call traffic. If the user mobility is higher than the call frequency or the user tends to move back to the previously visited registration areas, then the TLA may significantly outperform IS-41. We also observe that the variance of the portable residence times in registration areas has an impact on the performance of the TLA (i.e., better performance is expected for larger variance)     

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.     

Group location management for mobile subscribers on transportation systems in mobile communication networks

We propose a new location tracking scheme for subscribers on transportation systems (TSs) in which a large number of fast-moving users have the same location as the TS. The group location tracking (GLT) scheme in which a group location update is performed instead of the IS-41's individual location update has been proposed. We propose a distributed GLT (DGLT) scheme based on several virtual visitor location registers (VVLRs) and representative identities. We analyze the GLT and DGLT schemes in view of the database (DB) access cost as well as the signaling cost under one-dimensional network architecture. Compared with the IS-41 scheme, the schemes based on group management generally have a lower signaling cost and a lower DB access cost due to a significant reduction in the number of location updates. As user mobility increases or the number of users on a TS increases, the performance of the group management schemes improves. The DGLT scheme, in which a corresponding home location register selects a closest VVLR among several possible VVLRs, generally has a lower signaling cost although a DB access cost is increased slightly compared with the GLT scheme. We also obtain the regions in which the DGLT is more efficient than the IS-41 and the GLT scheme. The DGLT scheme is an appropriate solution for high signaling cost systems and the GLT scheme is useful for high DB access cost systems.     

Group location tracking based on representative identity andvirtual VLR for transportation systems

A location tracking scheme known as group location tracking (GLT) is proposed to reduce the location update cost for terrestrial transportation systems (TSs) in personal communication networks. When a TS moves into a new registration area, the GLT scheme, based on a representative identity of the TS and a virtual visitor location register, updates location information by a group location update request message instead of individual location update of users. Compared with the IS-41, the GLT scheme significantly reduces signaling load     

On optimizing the location update costs in the presence of database failures

This paper studies the database failure recovery procedure for cellular phone networks as part of the Electronic Industries Association/Telecommunications Industry Association Interim Standard 41 (EIA/TIA IS-41). Before the location information of the database is recovered, phone calls may be lost. The restoration process can be sped up by having the mobile phones to periodically confirm their existence by radio contact with the cellular network. We show that, under some cost assumptions, periodic update interval should be chosen to be approximately equal to the call interarrival time, with more frequent updates for more unreliable system. We also show that the cost of an optimized system is relatively small and stable, if the system is even moderately reliable. Finally, if the system is at least moderately reliable, the effects of call origination rate and the rate at which Location Areas are crossed, are rather small, assuming that the periodic update interval was chosen as stated above. Thus, in such cases, optimization of the size of the Location Area can be made independent of the optimization of the periodic update process.     

Failure restoration of mobility databases for personal communication networks

This paper studies failure restoration of mobility databases for personal communication networks (specifically, VLRs and HLRs). We model the VLR restoration with and without checkpointing. The optimal VLR checkpointing interval is derived to balance the checkpointing cost against the paging cost. We also model GSM periodic location updating (location confirmation) to quantify the relationship between the location confirmation frequency and the number of lost calls. The HLR failure restoration procedures for IS-41 and GSM are described. We show the number of lost calls in a HLR failure. Both the procedures in IS-41 and GSM cannot identify the VLRs that need to be accessed by the HLR after a failure. An algorithm is proposed to identify the VLRs, which can be used to aggressively restore a HLR after its failure.     

Local anchor scheme for reducing signaling costs in personalcommunications networks

A personal communications network (PCN) location tracking scheme called local anchoring is introduced which reduces the signalling cost as compared to the location management strategy proposed in the IS-41 standard. Local anchoring reduces the number of location registration messages between the home location register (HLR) and the visitor location registers (VLRs) in a way that location change is reported to a nearby VLR called the local anchor (LA) instead of to the HLR. This method successfully reduces the cost for location tracking when the call arrival rate is low relative to the mobility rate and the cost for location registration is high. A dynamic local anchoring mechanism is then introduced which dynamically selects the LA such that the expected cost for location registration and call delivery can be further reduced. It is demonstrated that the cost of dynamic local anchoring is always lower than or equal to that of the IS-41 scheme     

One-step pointer forwarding strategy for location tracking indistributed HLR environment

One of the main challenges in personal communication service (PCS) is to locate many mobiles that may move frequently from place to place. Such a system operation is called location tracking. Many network signals flow, and database queries are required to achieve such a task. In addition to the two-level hierarchical strategy in IS-41 and GSM, several strategies have been proposed to improve the efficiency of location tracking. Pointer forwarding was used to reduce the expensive home location register (HLR) accesses. Previously, the distributed HLR scheme was proposed to prevent the HLR from becoming a bottleneck in the signaling network. However, the length of a forwarding pointer chain may be lengthened in a distributed HLR environment. We propose a more efficient strategy to overcome this potential problem. This strategy attempts to migrate the locating chains in a distributed HLR system when a mobile issues a registration operation. As a consequence, the length of any forwarding pointer chain does not exceed one in our strategy. Simulation results indicate that our strategy significantly decreases the locating cost. In fact, this strategy provides an upper bound of location tracking time owing to the fact that the length of any locating path does not exceed one. Furthermore, obsolete entries in local databases visitor location registers can be reclaimed in this strategy     

Comparing the PCS location tracking strategies

The cache scheme has been proposed to reduce the location tracking overhead of a personal communications services (PCS) network. In the previous papers, we studied the cache scheme under the assumptions that the home location register (HLR) access time is constant and the portable residence times have an exponential distribution. This paper compares the cache scheme with a basic scheme (such as IS-41). We generalize the previous models by considering the queueing effect of the HLR (i.e., we model the HLR by an M/G/1 queue) and by considering an arbitrary distribution for the portable residence times. Our study shows that the cache scheme is likely to outperform the basic scheme when (1) the net traffic to the HLR in the basic scheme saturates and the hit ratio in the cache scheme is larger than zero, (2) the portable mobility is low with respect to the call arrival rate, and (3) the variance of the HLR service time distribution is large (for a fixed mean service time). We also indicate an intuitive result that the cache hit ratio is high for a high call arrival rate and low portable mobility. For a fixed mean portable residence time, we show that a higher cache hit ratio is expected for a portable residence distribution with larger variance     

Determination of the Registration Point for Location Update by Dynamic Programming in PCS

Location management is important to effectively keep track of mobile terminals with reduced signal flows and database queries. Even though dynamic location management strategies are known to show good performance, we in this paper consider the static location management strategy which is easy to implement. A system with single home location register and pointer forwarding is assumed. A mobile terminal is assumed to have memory to store the IDs of visitor location registers (VLRs) each of which has the forwarding pointer to identify its current location. To obtain the registration point which minimizes the database access and signaling cost from the current time to the time of power-off probabilistic dynamic programming formulation is presented. A Selective Pointer Forwarding scheme is proposed which is based on one-step dynamic programming. The proposed location update scheme determines the least cost temporary VLR which point forwards the latest location of the mobile. The computational results show that the proposed scheme outperforms IS-41, pure Pointer Forwarding, and One-step Pointer Forwarding at the expense of small storage and a few computations at the mobile terminals.