Reducing registration traffic for multitier personal communicationsservices

This paper presents an architecture for the multitier personal communications system (PCS) and intelligent algorithms for mobility management (specifically, the registration procedure). The multitier PCS system architecture considered in this study integrates three individual tiers: a high-tier system, a licensed low tier, and a unlicensed low tier. These three tiers are integrated into a single system by using a single home-location register (HLR) or the multitier HLR (MHLR). Under this architecture, we describe a registration protocol, where the mobile station (MS) is allowed to register to the MHLR on only one tier at any given time. We propose several intelligent algorithms for the MS to determine whether to perform registration or not in various situations to reduce the registration traffic     

Scalability and Performance Evaluation of Hierarchical Hybrid Wireless Networks

This paper considers the problem of scaling ad hoc wireless networks now being applied to urban mesh and sensor network scenarios. Previous results have shown that the inherent scaling problems of a multihop ldquoflatrdquo ad hoc wireless network can be improved by a ldquohybrid networkrdquo with an appropriate proportion of radio nodes with wired network connections. In this work, we generalize the system model to a hierarchical hybrid wireless network with three tiers of radio nodes: low-power end-user mobile nodes (MNs) at the lowest tier, higher power radio forwarding nodes (FNs) that support multihop routing at intermediate level, and wired access points (APs) at the highest level. Scalability properties of the proposed three-tier hierarchical hybrid wireless network are analyzed, leading to an identification of the proportion of FNs and APs as well as transmission range required for linear increase in end-user throughput. In particular, it is shown analytically that in a three-tier hierarchical network with nA APs, nF FNs, and nM MNs, the low-tier capacity increases linearly with nF, and the high-tier capacity increases linearly with nA when nA = Omega(radic{nF}) and n _A = O(nF). This analytical result is validated via ns-2 simulations for an example dense network scenario, and the model is used to study scaling behavior and performance as a function of key parameters such as AP and FN node densities for different traffic patterns and bandwidth allocation at each tier of the network.     

On optimal design of multitier wireless cellular systems

We present a general cell-design methodology for the optimal design of a multitier wireless cellular network. Multitier networks are useful when there are a multitude of traffic types with drastically different parameters and/or different requirements, such as different mobility parameters or quality-of-service requirements. In such situations, it may be cost-effective to build a multitude of cellular infrastructures, each serving a particular traffic type. The network resources (e.g., the radio channels) are then partitioned among the multitude of tiers. In general terms, we are interested in quantifying the cost reduction due to the multitier network design, as opposed to a single-tier network. Our study is motivated by the expected proliferation of personal communication services, which will serve different mobility platforms and support multimedia applications through a newly deployed infrastructure based on the multitier approach     

Wireless loops: What are they?

Several loop applications of wireless technology are aimed at reducing the cost of deploying communications services ranging from telephone to wideband video. In these applications, wireless links replace a portion of a wireline loop from a central location (a central office or cable headend) to a subscriber. The replacement of labor-intensive wireline technology by complex mass-produced integrated electronics in wireless transceivers is projected to reduce the overall cost of the resulting loop. These wireless loop applications attempt to provide existing communications services or small modifications to existing communications services. A different interpretation of a wireless loop makes use of low-power digital radio technology to provide the last thousand feet or so of a loop. Low-power low-complexity wireless loop technology in small base units can be integrated with network intelligence to provide the fixed-infrastructure network needed to support economical personal communications services (PCS) to small, lightweight, low-power personal voice and/or data communicators. Low-complexity communicators can provide many hours of “talk time” or data transmission time and perhaps several days of standby time from small batteries (≤ 1.5 oz). Because this application of wireless loop technology can reduce the inherent costs in several parts of a wireline loop, it has the potential to provide convenient widespread PCS at less costs than providing telephone services over conventional wireline loops. This low-power wireless loop application does not fit into any existing communications system paradigm. Wireless technology with tetherless access and wide-ranging mobility, e.g., the personal access communications system (PACS), does not fit the accumulated wisdom of the wireline telephony paradigm. It also does not fit the paradigm of existing cellular radio that has sparsely distributed expensive cell sites, and it is not targeted at fixed video services as is wireless cable. Because a significant change in thinking is required in addressing this new low-power low-complexity widespread wireless loop paradigm, its large economic advantages and service benefits have not yet been embraced by many of the existing communications providers, who appear to be more comfortable pursuing the better-known paradigms of video using wireless cable, or of cellular radio in the guise of high-tier PCS, or in the guise of rapid economical deployment of telephone services in developing nations. This paper discusses the inherent economic advantages and service benefits of low-power low-complexity wireless loop technology integrated with network intelligence aimed at providing economical low-tier PCS to everyone.     

Access Control Engine with Dynamic Priority Resource Allocation for Cognitive Radio Networks

An access control engine with dynamic priority resource allocation (ACE-DPRA) is proposed for unlicensed users to utilize free spectrum of wireless communication systems. A cognitive radio (CR) network with sensing and learning abilities is essential for unlicensed users to achieve ACE-DPRA. Three algorithms are included in ACE-DPRA to improve the spectral efficiency. While requesting to set up connection, unlicensed CR users generate excessive interferences to licensed users. The proposed ACE-DPRA with an admission control scheme allows the connection of unlicensed CR users without degrading the communication quality of licensed users. The priority algorithm for utilizing the unused spectrum is designed according to the location information of unlicensed users. A transmitted power control method is achieved by a fuzzy-learning mechanism. The spectral efficiency of wireless communication systems can be increased after adopting the proposed ACE-DPRA algorithm. Simulation results show that licensed users keep the advantages of high transmission data rate, low interference power, and low average outage probability after the connection of unlicensed CR users.     

An auxiliary user location strategy employing forwarding pointers to reduce network impacts of PCS

We propose an auxiliary strategy, calledper-user forwarding, for locating users who move from place to place while using Personal Communications Services (PCS). The forwarding strategy augments the basic location strategy proposed in existing standards such as GSM and IS-41, with the objective of reducing network signalling and database loads in exchange for increased CPU processing and memory costs. The key observation behind forwarding is that if users change PCS registration areas frequently but receive calls relatively infrequently, it should be possible to avoid registrations at the Home Location Register (HLR) database, by simply setting up a forwarding pointer from the previous Visitor Location Register (VLR). Calls to a given user will first query the user's HLR to determine the first VLR which the user was registered at, and then follow a chain of forwarding pointers to the user's current VLR. We use a reference PCS architecture and the notion of a user'scall-to-mobility ratio (CMR) to quantify the costs and benefits of using forwarding and classes of users for whom it would be beneficial. We show that under a variety of assumptions forwarding is likely to yield significant net benefits in terms of reduced signalling network traffic and database loads for certain classes of users. For instance, under certain cost assumptions, for users withCMR<0.5, forwarding can result in 20–60% savins over the basic strategy. This net benefit is due to the significant saving in location update compared to a penalty of moderately increased call setup times for the infrequent occasions when these users do receive calls.     

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     

认知 mesh 网络服务区分的动态频谱接入策略

动态频谱接入策略是实现认知无线电网络高效利用频谱的关键。与传统认知无线电网络不同,认知mesh网络中不同QoS需求的多类型业务共同接入,为适应这一特点,提出服务区分的动态频谱接入策略。策略依据业务的QoS需求确立优先级,针对不同优先级业务采取不同的信道接入方案,实时业务依据最优传输延迟期望选择接入信道集合,在减小传输延迟的同时降低数据传输过程授权用户出现的概率,普通业务选择最优理想传输成功概率的信道,降低信道切换概率。理论与实验结果表明,与传统的认知网络频谱接入策略相比,提出的策略能提供不同业务的服务区分,满足实时业务的低延迟需求,降低数据传输的中断率,同时在授权信道空闲率与网络负载较大时吞吐量性能较优。     

基于GSM网络的电梯五方通话技术研究

针对现有电梯通话系统布线麻烦,组装困难和维护成本高等缺点,以及对于停电时无法呼叫等不足,设计并实现了一种基于GSM无线通信的应急呼叫系统.该系统主要是用于在电梯出现故障、人员被困于电梯中时进行应急呼叫用的.它是用单片机STC 11 F05E作为核心处理和控制单元,通过I/O口来检测是否有呼救信号,通过串口发送AT命令给GSM无线通信模块(SIM900A)来实现无线应急呼叫;通过对SIM卡的设置可以进行对专用号码进行有优先级的有序呼救,确保一定有人能够接听到这个应急电话;通过I/O口实现对语音电路的控制,实时地接通和断开语音通路.系统采用UPS不间断电源来供电的,轿厢、机房、轿顶(井道顶)、底坑这四方都是采用馈电的方式来对分机进行供电;所以即使在停电状态下也可以进行呼救.实际与实验表明,这种通话呼救系统安装简单(不需要布线),无线通话稳定可靠(利用了现有的GSM基站),成本低,具有较高的应用价值和广阔的市场前景.     

基于阈值的两级指针推进的移动性管理策略

提出了基于阈值的两级指针推进策略(TPFT,two-level pointer forwarding with thresholds)将一部分VLR(visitor location register)中的移动用户选为移动代理(MA,mobile agent),在MA之间建立第一级指针链;在MA与VLR之间建立第二级指针链,两级指针链均设定长度阈值。将该策略与“基本位置管理策略”及“通行用户指针推进策略”和“带门槛的指针推进策略”的开销进行比较得出:选择适当的两级阈值,TPFT策略的开销优于上述策略。同时,TPFT策略是将系统中对HLR(home location register)的修改与查询的信号量分布到各个MA中,提高了系统效率。     

Exploiting cognitive wireless nodes for priority‐based data communication in terrestrial sensor networks

A priority‐based data communication approach, developed by employing cognitive radio capacity for sensor nodes in a wireless terrestrial sensor network (TSN), has been proposed. Data sensed by a sensor node—an unlicensed user—were prioritized, taking sensed data importance into account. For data of equal priority, a first come first serve algorithm was used. Non‐preemptive priority scheduling was adopted, in order not to interrupt any ongoing transmissions. Licensed users used a nonpersistent, slotted, carrier sense multiple access (CSMA) technique, while unlicensed sensor nodes used a nonpersistent CSMA technique for lossless data transmission, in an energy‐restricted, TSN environment. Depending on the analytical model, the proposed wireless TSN environment was simulated using Riverbed software, and to analyze sensor network performance, delay, energy, and throughput parameters were examined. Evaluating the proposed approach showed that the average delay for sensed, high priority data was significantly reduced, indicating that maximum throughput had been achieved using wireless sensor nodes with cognitive radio capacity.     

一种3G中基于三层数据库的呼叫建立机制研究

基于3G网络三层数据库结构中GLR (Gateway Location Register)服务区远大于VLR (Visitor Location Register)服务区的情况,考虑被呼业务本地化(即本地移动用户呼叫本地移动用户的比例占总呼叫数的比例大),通过在GLR中设置缓存的方法,给出了一种新的呼叫建立机制。建立分析模型得到新机制的总代价函数和总时间延迟函数,并同基本呼叫建立机制以及2G网络基于VLR缓存的呼叫建立机制进行了对比分析,验证了新呼叫建立机制的优越性。     

Wireless broadband applications: the teleservice model and adaptiveQoS provisioning

This article presents a teleservice model for wireless broadband applications based on an adaptive QoS paradigm. According to this, a multimedia broadband application is considered as a set of hierarchically ordered adaptable media streams, which accept varying degrees of network-level guarantees, depending on dynamic resource changes and user preferences. Some algorithms that match the proposed paradigm are designed for call and mobility management. Their performance is analyzed in a mobile multitier cellular system, including the satellite component     

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.     

LATS: a load-adaptive threshold scheme for tracking mobile users

Mobile user tracking is a major issue. We propose a novel approach for user tracking, in which the tracking activity is adapted to both user and system activity. The basic idea is to make the user-location update-rate dependent not only on the user activity (such as the call profile and mobility pattern). Rather, it is also made dependent on the signaling load, which reflects the actual cost of the update operation. Thus, at low-signaling load locations, the users are to transmit location update messages more frequently. To carry out this approach, we propose a load-adaptive threshold scheme (LATS): the network determines for each cell a registration threshold level (which depends on the cell load) and announces it, as a broadcast message, to the users. The user computes its own registration priority and then transmits a registration message only if its priority exceeds the announced threshold level. Thus, whenever the local load on the cell is low, the registration activity increases, while in loaded cells the registration activity decreases. Our analysis shows that the LATS reduces the paging cost, in comparison with other dynamic methods, without increasing the wireless cost of registration. Moreover, if higher user density is coupled with less mobility (e.g., consider vehicles), then the LATS strategy offers further performance improvement. The load-adaptive strategy can be used in addition to any other dynamic tracking strategy. Furthermore, the computational complexity imposed on the user is identical to that required by an equivalent load-insensitive scheme     

Location tracking with distributed HLR's and pointer forwarding

Location tracking operations in a personal communications service (PCS) network are expensive. A location tracking algorithm called pointer forwarding has been proposed to reduce the location update cost. The key observation behind forwarding is that if users change PCS registration areas (RAs) frequently, but receive calls relatively infrequently, it should be possible to avoid registrations at the home-location register (HLR) database by simply setting up a forwarding pointer from the previous visitor-location register (VLR). Calls to a given user will first query the user's HLR to determine the first VLR, which the user was registered at, and then follow a chain of forwarding pointers to the user's current VLR. To reduce the “find” cost in call delivery, the PCS provider may distribute HLR databases in the network. This paper integrates the concept of distributed HLRs with pointer forwarding, and the new scheme is referred to as the pointer forwarding with distributed HLR (PFDHLR). Since no registration to the HLR is performed in the pointer forwarding scheme when a user moves to the new locations, the cost of updating multiple HLRs is eliminated in PFDHLR. Our study indicates that PFDHLR may significantly reduce the mobility management cost compared with the single HLR approach     

Soft QoS in Call Admission Control for Wireless Personal Communications

In wireless multimedia communication systems, call admission control (CAC) is critical for simultaneously achieving a high resource utilization efficiency and maintaining quality-of-service (QoS) to mobile users. User mobility, heterogeneous nature of multimedia traffic, and limited radio spectrum pose significant challenges to CAC. QoS provisioning to both new calls and handoff calls comes with a cost of low resource utilization. This paper proposes a CAC policy for a wireless communication system supporting integrated voice and dataservices. In particular, soft QoS (or relaxed target QoS) is incorporated in the CAC policy to make compromises among different objectives.Numerical results are presented to demonstrate that (a) in dealing with the dilemma between QoS satisfaction and high resource utilization, how the resource utilization efficiency can be increased by introducing soft QoS; and (b) in accommodating different types of traffic, how the QoS of low priority traffic can be improved by specifying soft QoS to high priority traffic.     

Strategies for adaptive frequency hopping in the unlicensed bands

Mechanisms based on frequency hopping have been widely used to enable short-range wireless networks to use resources from the unlicensed spectrum without frequency planning. Bluetooth piconet is a prime example of an FH-based network with unlicensed operation. As a price for open access, the piconet may experience adverse interference from other collocated FH piconets or other wireless devices that are transmitting in the same unlicensed band. A basic approach to mitigate this interference is that the piconet applies adaptive FH (AFH) and attempts to hop over a set (hopset) of less interfered channels. On the other hand, the regulation of unlicensed operation sets constraints on possible hopset adaptations. In this article we present two novel AFH strategies: adaptive frequency rolling (AFR) and dynamic AFH (DAFH). AFR avoids self-interference while preserving the dynamics of spectrum usage as required by the current regulation. DAFH is a distributed mechanism by which collocated piconets select nonconflicting hopsets while trying to keep the hopset size as large as possible. DAFH is not completely compliant with current regulations, but the rationale given for its design contains new rules of behavior for the unlicensed spectrum. Both approaches significantly outperform the conventional AFH strategy     

移动网络中一种分布式GLR设计方案

UMTS核心网在访问网络处引入可选网元GLR来减少用户远离HLR漫游时的位置管理信令开销。传统GLR方案中,GLR一般在访问网络处集中设置,随着访问网络处漫游用户数的增多,GLR有可能成为系统瓶颈,且GLR的故障对系统是致命的。针对集中式GLR存在的问题,该文提出一种分布式GLR设置方案,使用户在访问网络处的首个访问VLR成为其GLR,从而提高系统对GLR故障的抗毁性,有效降低GLR潜在的瓶颈问题。分析结果表明,该文提出的分布式GLR方案在抗毁性,缓解瓶颈问题,降低入呼数据库查询开销及延迟等指标方面都优于传统GLR方案,同时,所提出的分布式GLR方案易于实现,只需相关网元软件升级即可。