Reducing authentication signaling traffic in third-generation mobile network

In the Universal Mobile Telecommunication System (UMTS), authentication functions are utilized to identify and authenticate a mobile station (MS) and validate the service request type to ensure that the user is authorized to use the particular network services. The authenticating parties are the authentication center (AuC) in the home network and the MS. In the UMTS, the serving general packet radio service support node (SGSN) accesses the AuC to obtain the authentication data, and delegates the AuC to perform mutual authentication with the MS. Since the cost for accessing AuC is expensive, the SGSN may obtain an array of authentication vectors (AVs) at a time so that the number of accesses can be reduced. On the other hand, if the size K of the AV array is large, the AV array transmission from the AuC to the SGSN may be expensive. Thus, it is desirable to select an appropriate K value to minimize the authentication network signaling cost. We propose an analytic model to investigate the impact of K on the network signaling traffic, which is validated by simulation experiments. Then, we propose an automatic K-selection mechanism that dynamically selects the size of the AV array to reduce the network signaling cost. Our study indicates that the automatic K-selection mechanism effectively identifies appropriate size of the authentication vector array.     

Research on fuzzy neural network algorithms for nonlinear network traffic predicting

Neural networks provide massive parallelism,robust-ness ,and approxi mate reasoning,which are i mportantfor dealing with uncertain,inexact ,and ambiguous data,withill-defined problems and sparse data sets[1].It hasbeen proved that a neural network system …     

Adaptive control algorithms for decentralized optimal traffic engineering in the Internet

In this paper, we address the problem of optimal decentralized traffic engineering when multiple paths are available for each call. More precisely, given a set of possible paths for each call, we aim at distributing the traffic among the available paths in order to maximize a given utility function. To solve this problem, we propose a large family of decentralized sending rate control laws having the property that each of the members of this family "steers" the traffic allocation to an optimal operation point. The approach taken relies on the control theory concept of Sliding Modes. These control laws allow each ingress node to independently adjust its traffic sending rates and/or redistribute its sending rates among multiple paths. The only nonlocal information needed is binary feedback from each congested node in the path. The control laws presented are applicable to a large class of utility functions, namely, utility functions that can be expressed as the sum of concave functions of the sending rates. We show that the technique can be applied not only to usual rate adaptive traffic with multiple paths, but also to rate adaptive traffic with minimum service requirements and/or maximum allowed sending rate and to assured service with targeted rate guarantee, all allowing for multiple paths. It is also shown that these control laws are robust with respect to failures; i.e., they automatically reroute traffic if a link failure occurs. Finally, we provide some insight on how to choose the "right" control law. In particular, we provide a way of choosing a member of the family of control laws that reduces the sending rate oscillation caused by implementation constraints like delays and quantization. An example of application of the approach delineated in this paper is also presented. This example provides some insights on the implementation aspects and illustrates the robustness of the control laws developed in this paper.     

网络流量分析中的频繁项监测技术研究

无限数据流中频繁项监测问题定义为对给定输入数据流在任意时刻输出一个当前所有输入数据项中出现频率超过闽值的频繁数据类型及频率值的列表，它对于大规模网络流量分析具有重要意义。本文基于网络报文流分析的应用需求，归纳出一般意义上的报文流分析模型和频繁项监测问题抽象定义，并据此对当前典型的频繁项监测算法进行分析比较。本文还提出一种在有界存储中进行频繁项监测的高精度改进算法，实验结果表明该改进算法满足高速网络报文流的应用需求。     

Adaptive region-based location management for PCS systems

The personal communications services (PCSs) systems can provide ubiquitous and customized services. The key issue, which affects the performance of the whole system, is the location management. We propose a region-based location strategy by taking advantage of the user's movement behavior to improve the performance of the conventional systems. Each mobile user is associated with a set of regions, which are derived from the user's movement patterns. The registration processes in the same region can be eliminated such that the cost of location management can be significantly reduced. Several design issues are studied by considering the workload balance and the call-to-mobility ratio for a user. The proposed strategy can be dynamically adjusted based on different system parameters and user behavior. A performance analysis on the signaling cost and the database access cost is given to justify the benefits of this approach     

ATM-based TH-SSMA network for multimedia PCS

Personal communications services (PCS) promise to provide a variety of information exchanges among users with any type of mobility, at any time, in any place, through any available device. To achieve this ambitious goal, two of the major challenges in the system design are: (i) to provide a high-speed wireless subsystem with large capacity and acceptable quality-of-service (QoS) and (ii) to design a network architecture capable of supporting multimedia traffic and various kinds of user mobility. A time-hopping spread-spectrum wireless communication system called ultra-wide bandwidth (UWB) radio is used to provide communications that are low power, high data rate, fade resistant, and relatively shadow free in a dense multipath environment. Receiver-signal processing of UWB radio is described, and performance of such communications systems, in terms of multiple-access capability, is estimated under ideal multiple-access channel conditions. A UWB-signal propagation experiment is performed using the bandwidth in excess of 1 GHz in a typical modern office building in order to characterize the UWB-signal propagation channel. The experimental results demonstrate the feasibility of the UWB radio and its robustness in a dense multipath environment. A ATM network is used as the backbone network due to its high bandwidth, fast switching capability, flexibility, and well-developed infrastructure. To minimize the impact caused by user mobility on the system performance, a hierarchical network-control architecture is postulated. A wireless virtual circuit (WVC) concept is proposed to improve the transmission efficiency and simplify the network control in the wireless subsystem. The key advantage of this network architecture and WVC concept is that the handoff can be done locally most of the time, due to the localized behavior of PCS users     

Call performance for a PCS network

It is well known that, due to the mobility of a portable and limited channel availability, calls of portables may not be completed due to being blocked or terminated during the call initiation or the handover process. The characteristics of the call-completion and call-holding times for both a complete call and an incomplete call are of critical importance for establishing the actual billing process in the PCS network. We derive the call-completion probability (hence, call-dropping probability) and the effective call-holding time distributions for complete/incomplete calls with a general cell-residence time and a general call-holding time are analyzed, and general computable formulas are obtained. We show that when call-holding times are Erlang distributed, easy-to-compute formulas for the probability of a call completion and the expected effective call-holding times for both a complete call and an incomplete call can be derived     

AAA authentication for network mobility

Network mobility (NEMO) is a protocol proposed for the mobility management of a whole network.It offers seamless Internet connectivity to the mobile end users.However,the NEMO protocol has not been wid...     

Fast algorithms for measurement-based traffic modeling

This paper develops fast algorithms for the construction of a circulant modulated rate process to match with the two primary traffic statistical functions: rate distribution f(x) and autocorrelation R(τ). Using existing modeling techniques, f(x) has to be limited to certain forms such as Gaussian or binomial; R(τ) can only consist of one or two exponential terms which are often real exponentials rather than complex. In reality, these two functions are collected from real traffic traces and generally expressed in a very complicated form. We only consider the traffic whose correlation function can be approximated by the sum of complex exponentials. Our emphasis is placed on the algorithm design for matching complicated R(τ) in traffic modeling. The typical CPU time for traffic modeling with R(τ) consisting of five or six complex exponential terms is found to be in the range of a few minutes by the proposed algorithms. Our study further shows an excellent agreement between the original traffic traces and the sequences generated by the matched analytical model. The selection of the measurement-window in traffic statistics collection for queueing performance analysis is also discussed     

Mobility and traffic analyses in three-dimensional PCS environments

We need to solve various mobility/traffic problems in one-dimensional (1-D), two-dimensional (2-D), and three-dimensional (3-D) micro or picocell environments to efficiently plan future personal communications services (PCS). However, mobility/traffic problems have thus far primarily been studied in 1-D and 2-D cell structures. We extend the previous mobility modeling from 1-D or 2-D space to 3-D unbounded indoor building environments having staircase regions by analytically modeling the mobility to estimate the number of handoffs. We also characterize the blocking probability of each cell according to the mobility by predicting the equivalent input traffic per cell. Based on the blocking probability model, we obtain the required number of channels per cell under the given blocking probability constraint. For example, 13 channels per cell are required to be assigned in order to meet the requirement that the blocking probability does not exceed 0.02 in the case where the number of radio ports (RPs) (cells) is four and 180 users are moving with a mean velocity of 2 km/h (horizontal motion) and 2/3 km/h (vertical motion) on each floor. The computer simulation results are also close to the analytical ones. These results can be utilized in the network planning of future PCS     

Adaptive algorithms for interactive multimedia

Modeling multimedia content by identifying semantically meaningful entities can be arduous because it's difficult to simulate human perception. However, by creating an algorithm to respond interactively to user preference, content-retrieval systems can become more efficient and easier to use.     

Implicit deregistration in a PCS network

Registration/deregistration is required in a PCS network when a portable moves between registration areas. Several schemes were proposed to deregister a portable after it moves out of a registration area (RA). A simple scheme called implicit deregistration totally eliminates network traffic due to deregistration. However, this scheme may delete valid registration records. Thus, the size of a registration database must be sufficiently large to ensure low probability that a valid registration record is deleted. This paper describes an analytic model to determine the size k of the registration database for an RA in the implicit deregistration scheme. If the expected number of portables in an RA is N, then our study indicates that good performance can be achieved if k≃5N     

Channel reservation for handoff calls in a PCS network

Some new performance measures and channel reservation for handoff calls for maximizing the service provider's revenue in a personal communications service (PCS) network, with general cell residence time and general requested call holding time, are investigated. Here, each cell within the PCS network consists M channels, but only when at least m+1 (0⩽m<μ) channels are available will a new originating call be accepted. A handoff attempt is unsuccessful if no channel in the target cell is available. Some new performance measures of the system such as the modified offered load (MOL) approximations of the blocking probability of new and handoff calls, the distribution and the mean actual call holding time of a new call and related conditional distributions and the expectations, as well as the boundary of the mean of the actual call holding time of an incomplete call and a complete call are obtained. A necessary and sufficient condition for maximizing the provider's revenue is achieved for any general cost structure if it is an increasing function of the actual call holding time. In order to be fair to the customers with incomplete call and complete call, two different kinds of holding costs are considered for the different customers. In both situations, the optimal controlling value m of handoff priority is obtained by maximizing the service provider's revenue     

Statistical service assurances for traffic scheduling algorithms

Network services for the most demanding advanced networked applications which require absolute, per-flow service assurances can be deterministic or statistical. By exploiting the statistical properties of traffic, statistical assurances can extract more capacity from a network than deterministic assurances. We consider statistical service assurances for traffic scheduling algorithms. We present functions, so-called effective envelopes, which are, with high certainty, upper bounds of multiplexed traffic. Effective envelopes can be used to obtain bounds on the amount of traffic on a link that can be provisioned with statistical service assurances. We show that our bounds can be applied to a variety of traffic scheduling algorithms. In fact, one can reuse existing admission control functions for scheduling algorithms with deterministic assurances. We present numerical examples which compare the number of flows with statistical assurances that can be admitted with our effective envelope approach to those achieved with existing methods     

Efficient authentication scheme for double-layer satellite network

To solve the issue of networking authentication among GEO and LEO satellites in double-layer satellite network,a secure and efficient authenticated key agreement scheme was proposed.Based on symmetric encryption,the proposed scheme can achieve trust establishment and secure communication between satellites without the trusted third party.Meanwhile,considering characteristics of highly unified clock and predictable satellite trajectory in satellite networks,a pre-calculation method was designed,which can effectively improve the authentication efficiency of satellite networking.Moreover,formal proof and security analysis demonstrate that the scheme can satisfy various security requirements during satellite networking.Performance analysis and simulation results show that the scheme has low computation and communication overhead,which can achieve the authentication of satellite networking in resource-limited scenarios.     

适用于数字移动通信系统的用户认证方案

基于Schnorr签名，提出了一种适用于数字移动通信系统的用户身份认证方案。该方案能实现双方相互认证，抵抗各种攻击（包括网内攻击）。在用户端引入预计算，减少了用户端的计算量，满足了移动通信的实时要求。并对该方案的安全性及计算复杂性进行了分析，得出了该方案是一个安全性高，计算复杂性低，符合数字移动通信系统要求的结论。     

Adaptive algorithms for sparse system identification

In this paper, identification of sparse linear and nonlinear systems is considered via compressive sensing methods. Efficient algorithms are developed based on Kalman filtering and Expectation-Maximization. The proposed algorithms are applied to linear and nonlinear channels which are represented by sparse Volterra models and incorporate the effect of power amplifiers. Simulation studies confirm significant performance gains in comparison to conventional non-sparse methods.     

Adaptive array processing MLSE receivers for TDMA digitalcellular/PCS communications

Array processing is a promising approach for improving quality, coverage, and capacity in digital cellular communication systems. By combining array processing with maximum likelihood sequence estimation (MLSE), intersymbol interference (ISI) introduced by multipath propagation can be mitigated as well. Novel symbol-spaced and fractionally spaced adaptive array processing MLSE receivers are developed for both diversity and phased array antenna configurations. The practical issues of synchronization and channel estimation are addressed. A novel approach to automatic frequency error correction (AFC) is proposed and is shown to be critical when cancelling cochannel interference. Performance is evaluated for the reverse link of the IS-136 TDMA-based digital cellular system. Substantial improvements are obtained over conventional antenna configurations for receiver sensitivity (2.5-4 dB) and over traditional antenna combining when cochannel interference is present (0.5-25 dB)     

Intelligent network: a key platform for PCS interworking andinteroperability

The Tl and TIA standards committees in the United States have worked jointly on the development of the first phase of personal communication services (PCS) standards, which were approved in December 1995. PCS systems based on these standards are currently under development. As these systems are deployed, the variety of wireless systems will grow, making interworking and interoperability a key challenge. This article provides an overview of PCS standards and explores how the different types of wireless systems (PCS and cellular) will utilize the capabilities of the intelligent network to provide seamless roaming     

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

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