异构网络中基于终端决策的通用垂直切换算法

垂直切换是异构网络中的关键技术,目前已有的垂直切换算法大多是针对特定的网络或切换过程的某个环节,提出一种与网络类型无关的通用垂直切换算法,仿真结果表明该算法在支持多任务,有效利用能量方面比传统方法有很大的改进.     

A model for analyzing handoff algorithms [cellular radio]

A model for analyzing the performance of handoff algorithms based on signal strength measurements made by mobile stations in a lognormal fading environment is presented. This model enables one to evaluate the effect of averaging the hysteresis on the handoff process. Handoffs are related to level crossings of the difference between the received signal strengths from two base stations. The algorithm performance is derived by modeling the level crossings as Poisson processes with time-varying rate functions. The model is seen to yield results that agree with simulations over the range of algorithm parameters of practical interest. These results can be used to determine the averaging interval and hysteresis level that achieve the optimum tradeoff between the number of unnecessary handoffs and the delay in handing off     

一种新的无线异构网络的自适应垂直切换算法

针对当前无线异构网络融合技术中的垂直切换机制,提出了一种以平均接收信号强度为评价指标,并由此指标判断可能的运动趋势的自适应垂直切换算法。仿真结果表明:相比于传统的固定门限的平均接收信号强度垂直切换算法,提出的方法能较好地预测并提前触发该发生的切换,改善切换性能。     

Immune optimization algorithm for solving vertical handoff decision problem in heterogeneous wireless network

In heterogeneous wireless network environment, wireless local area network (WLAN) is usually deployed within the coverage of a cellular network to provide users with the convenience of seamless roaming among heterogeneous wireless access networks. Vertical handoffs between the WLAN and the cellular network maybe occur frequently. As for the vertical handoff performance, there is a critical requirement for developing algorithms for connection management and optimal resource allocation for seamless mobility. In this paper, we develop a mathematical model for vertical handoff decision problem, and propose a multi-objective optimization immune algorithm-based vertical handoff decision scheme. The proposed scheme can enable a wireless access network not only to balance the overall load among all base stations and access points but also maximize the collective battery lifetime of mobile terminals. Results based on a detailed performance evaluation study are also presented here to demonstrate the efficacy of the proposed scheme.     

Mobile ad hoc relaying for upward vertical handoff in hybrid WLAN/cellular systems

One of the main issues in hybrid wireless networks is vertical handoff. Dropping probability is one of the important parameters that must be considered in planning the wireless communication systems. However, there has not been much effort in dropping rate reduction in loosely coupled hybrid wireless networks. In loosely coupled WLAN/cellular systems the system administrator of the WLAN is different from the cellular one. Therefore, in these situations, reducing the dropping probability based on classical methods such as using reserved guard channels is difficult. A handoff from a WLAN to a cellular system occurs when a multi-mode device moves out of the WLANs coverage area. This is an upward vertical handoff in a hybrid network. In this paper, we propose to employ ad hoc relaying during the upward vertical handoff in a hybrid WLAN/cellular system. Two-hop and multi-hop relaying approaches, which we propose in this paper, improve the dropping probability regardless of the number of reserved channels. Simulation results support the effectiveness of the proposed methods. Also, practical routing protocols are proposed in order to implement the suggested relaying methods.     

A locally optimal handoff algorithm for cellular communications

The design of handoff algorithms for cellular communication systems based on mobile signal strength measurements is considered. The design problem is posed as an optimization to obtain the best tradeoff between the expected number of service failures and expected number of handoffs, where a service failure is defined to be the event that the signal strength falls below a level required for satisfactory service to the subscriber. Based on dynamic programming arguments, an optimal solution is obtained, which, though impractical, can be used as a benchmark in the comparison of suboptimal schemes. A simple locally optimal handoff algorithm is derived from the optimal solution. Like the standard hysteresis algorithm, the locally optimal algorithm is characterized by a single threshold. A systematic method for the comparison of various handoff algorithms that are akin to the receiver operating characteristic (ROC) curves of radar detection is presented. Simulation results show that the locally optimal algorithm outperforms the hysteresis algorithm, especially in situations where accurate prediction of signal strength is possible. A straightforward technique for adapting the locally optimal algorithm to changing environments is suggested. That natural adaptability is the algorithm's principle advantage over current approaches     

Prioritized channel assignment in a cellular radio network

Dimensioning procedures for prioritized channel assignment in a cellular radio network are considered. Under the cutoff priority discipline, the prioritized channel assignment procedures for a single cell and multicell system are formulated as nonlinear discrete capacity allocation problems. Exact incremental algorithms which efficiently solve the proposed problems are devised. They are based on the properties of the blocking probabilities of new calls and handoff calls. Given the number of available frequency channels together with the arrival rates and the grade of service (GOS) for both types of calls in each cell, algorithm SP1 generates an optimal channel assignment which ensures priority for handoff calls. Given the arrival rates and distinct GOSs for new and handoff calls, algorithm SP2 finds the minimum number of channels required in each cell. Algorithm MP extends algorithm SP1 to a multicell system and provides the prioritized channel assignment for all calls in the system. The algorithms are very fast and are appropriate for the fair allocation of frequency channels among cells     

A prioritized handoff dynamic channel allocation strategy for PCS

An analytical method is developed to calculate the blocking probability (p_b), the probability of handoff failure (p_h ), the forced termination probability (p_ft), and the probability that a call is not completed (p_nc) for the no priority (NPS) and reserved channel (RCS) schemes for handoff, using fixed channel allocation (FCA) in a microcellular system. Based only on the knowledge of the new call arrival rate, a method of assessing the handoff arrival rate for any kind of traffic is derived. The analytical method is valid for uniform and nonuniform traffic distributions and is verified by computer simulations. An extension (generalization) to the nonuniform compact pattern allocation algorithm is presented as an application of this analysis. Based on this extended concept, a modified version of a dynamic channel allocation strategy (DCA) called compact pattern with maximized channel borrowing (CPMCB) is presented. With modifications, it is shown that CPMCB is a self-adaptive prioritized handoff DCA strategy with enhanced performance that can be exploited in a personal communications service (PCS) environment leading either to a reduction in infrastructure or to an increase in capacity and grade of service. The effect of user mobility on the grade of service is also considered using CPMCB     

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     

Adaptive channel reservation for call admission control to support prioritized soft handoff calls in a cellular CDMA system

This paper proposes a prioritized call admission control (CAC) model to support soft handoff calls with quality of service (QoS) assurances for both the uplink and downlink connections in a CDMA system. CAC is formulated as a combinatorial optimization problem in which the problem objective is to minimize the handoff forced termination rate. The model, which is based on the adaptive channel reservation (ACR) scheme for prioritized calls, adapts to changes in handoff traffic where the associated parameters (reserved channels, and new and handoff call arrival rates) can be varied. To solve the optimization model, iteration-based Lagrangean relaxation is applied by allocating a time budget. We express our achievements in terms of the problem formulation and performance improvement. Computational experiments demonstrate that the proposed ACR scheme outperforms other approaches when there are fewer rather than more channels, and it reduces the handoff call blocking rate more efficiently when the handoff traffic is heavily loaded. Moreover, the model can be adapted to any kind of reservation service.     

Adaptive vertical handoff algorithm in heterogeneous networks

The integration of cellular network (CN) and wireless local area network (WLAN) is the trend of the next generation mobile communication systems, and nodes will handoff between the two kinds of networks. The received signal strength (RSS) is the dominant factor considered when handoff occurs. In order to improve the handoff efficiency, this study proposes an adaptive decision algorithm for vertical handoff on the basis of fast Fourier transform (FFT). The algorithm makes handoff decision after analyzing the signal strength fluctuation which is caused by slow fading through FFT. Simulations show that the algorithm reduces the number of handoff by 35%, shortens the areas influenced by slow fading, and enables the nodes to make full use of WLAN in communication compared with traditional algorithms.     

Soft handoff algorithms for CDMA cellular networks

This paper discusses the design of soft handoff algorithms for cellular communication systems. The handoff process is modeled as a hybrid system and handoff design is cast as an optimization problem based on such a model. Performance is evaluated in terms of call quality, average number of active base stations, average number of active set updates, and average amount of interference. A soft handoff algorithm, which achieves a tradeoff between these performance criteria, is obtained using principles of dynamic programming. One key feature of the algorithm is that it incorporates the effects of mobility and shadow fading in the handoff decision. Different diversity combining schemes are considered including selective combining, equal gain combining (EGC), and various optimized combining (OC) methods in the soft handoff mode. For EGC and OC, Wilkinson's and Schwartz and Yeh's methods are used to compute the statistics for the power sum of the signals. Simulation results indicate that the performance of the handoff algorithm is a function of the different combining schemes and of the different methods used to compute the statistics of the power sum. Moreover, it is observed that interference cancellation is important in order for the algorithm to be viable for cellular systems which experience interference due to using nonorthogonal multiple access.     

A neural network parallel algorithm for channel assignment problemsin cellular radio networks

The channel assignment problem involves not only assigning channels or frequencies to each radio cell. but also satisfying frequency constraints given by a compatibility matrix. The proposed parallel algorithm is based on an artificial neural network composed of nm processing elements for an n-cell-m-frequency problem. The algorithm runs not only on a sequential machine but also on a parallel machine with up to a maximum of nm processors. The algorithm was tested by solving eight benchmark problems where the total number of frequencies varied from 100 to 533. The algorithm found the solutions in nearly constant time with nm processors. The simulation results showed that the algorithm found better solutions than the existing algorithm in one out of eight problems     

An optimization technique for efficient channel allocation in cellular network

For today’s wireless mobile communication systems, efficient use of limited radio spectrum with minimum interferences is required. Itinvestigates an Optimal Genetic Algorithm approach (GA) for Hybrid Channel allocation (NP hard) focusing on reduction in interference in cellular Network. Obtained an interference graph based fitness function to enhance the performance of HCA for interference reduction. It is shown that the use of integer genetic representation for Crossover and mutation operation enhances the speed of GA leading to less computation time. Comparison of proposed method is done with reported literature for KUNZ 4 which results in less co-channel and co-site interference depicted by interfering edges and also number of generations required are less. The result for KUNZ 1, KUNZ 2 and KUNZ 3 are obtained with minimum interference along with computation time.     

一种基于紧耦合网络结构的终端垂直切换系统

随着移动终端无线数据业务的迅速发展,在异构无线网络间提供无缝连接和高速的多媒体服务将成为下一代无线网络[1]（4G网络）的重要特性。提出了一套基于紧密耦合网络结构的终端垂直切换系统。该系统利用核心网络的PCF切换机制,有效解决了IP移动问题。被设计成客户端的一个软件接口,易于在现实世界中快速实施。     

A learning approach for prioritized handoff channel allocation in mobile multimedia networks

An efficient channel allocation policy that prioritizes handoffs is an indispensable ingredient in future cellular networks in order to support multimedia traffic while ensuring quality of service requirements (QoS). In this paper we study the application of a reinforcement-learning algorithm to develop an alternative channel allocation scheme in mobile cellular networks that supports multiple heterogeneous traffic classes. The proposed scheme prioritizes handoff call requests over new calls and provides differentiated services for different traffic classes with diverse characteristics and quality of service requirements. Furthermore, it is asymptotically optimal, computationally inexpensive, model-free, and can adapt to changing traffic conditions. Simulations are provided to compare the effectiveness of the proposed algorithm with other known resource-sharing policies such as complete sharing and reservation policies     

Signal threshold adaptation for vertical handoff in heterogeneous wireless networks

The convergence of heterogeneous wireless access technologies has been envisioned to characterize the next generation wireless networks. In such converged systems, the seamless and efficient handoff between different access technologies (vertical handoff) is essential and remains a challenging problem. The heterogeneous co-existence of access technologies with largely different characteristics results in handoff asymmetry that differs from the traditional intra-network handoff (horizontal handoff) problem. In the case where one network is preferred, the vertical handoff decision should be carefully executed, based on the wireless channel state, network layer characteristics, as well as application requirements. In this paper, we study the performance of vertical handoff using the integration of 3G cellular and wireless local area networks as an example. In particular, we investigate the effect of an application-based signal strength threshold on an adaptive preferred-network lifetime-based handoff strategy, in terms of the signalling load, available bandwidth, and packet delay for an inter-network roaming mobile. We present an analytical framework to evaluate the converged system performance, which is validated by computer simulation. We show how the proposed analytical model can be used to provide design guidelines for the optimization of vertical handoff in the next generation integrated wireless networks. This article is the extended version of a paper presented in IFIP Networking 2005 Ahmed H. Zahran is a Ph.D. candidate at the Department of Electrical and Computer Engineering, University of Toronto. He received both his M.Sc. and B.Sc. in Electrical Engineering from Electronics and Electrical Communication Department in the Faculty of Engineering, Cairo University in 2002 and 2000 respectively, where he was holding teaching and research positions. Since September 2003, he has been working as a research assistant in the Department of Electrical and Computer Engineering, University of Toronto under the supervision of Professor Ben Liang. His research interest is wireless communication and networking with an emphasis on the design and analysis of networking protocols and algorithms. Ben Liang received honors simultaneous B.Sc. (valedictorian) and M.Sc. degrees in Electrical Engineering from Polytechnic University in Brooklyn, New York, in 1997 and the PhD degree in Electrical Engineering with Computer Science minor from Cornell University in Ithaca, New York, in 2001. In the 2001–2002 academic year, he was a visiting lecturer and post-doctoral research associate at Cornell University. He joined the Department of Electrical and Computer Engineering at the University of Toronto as an Assistant Professor in 2002. His current research interests are in the areas of mobile networking and wireless multimedia systems. He is a member of Tau Beta Pi, IEEE, and ACM and serves on the organization and technical program committees of a number of major conferences each year. Aladdin Saleh earned his Ph.D. degree in Electrical Engineering from London University, England. Since March 1998, Dr. Saleh has been working in the Wireless Technology Department of Bell Canada, the largest service provider of wireless, wire-line, and Internet in Canada. He worked as a senior application architect in the wireless data group working on several projects among them the wireless application protocol (WAP) and the location-based services. Later, he led the work on several key projects in the broadband wireless network access planning group including planning of the IEEE 802.16/ Wimax, the IEEE 802.11/ WiFi, and the integration of these technologies with the 3G cellular network including Mobile IP (MIP) deployment. Dr. Saleh also holds the position of Adjunct Full Professor at the Department of Electrical and Computer Engineering of Waterloo University, Canada since January 2004. He is currently conducting several joint research projects with the University of Waterloo and the University of Toronto on IEEE 802.16-Wimax, MIMO technology, interworking of IEEE 802.11 WLAN and 3G cellular networks, and next generation wireless networks. Prior to joining Bell Canada, Dr. Saleh worked as a faculty member at different universities and was Dean and Chairman of Department for several years. Dr. Saleh is a Fellow of IEE and a Senior Member of IEEE.     

A multistage self-organizing algorithm combined transiently chaotic neural network for cellular channel assignment

In this paper, a new multistage self-organizing channel assignment algorithm with a transiently chaotic neural network (MSSO-TCNN) is proposed as an optimization algorithm. The algorithm is used for assigning channels in cellular mobile networks to cells in the frequency domain. The MSSO-TCNN consists of a progressively initial channel assignment stage and the TCNN assignment stage. According to the difficulty measure of each cell, the first stage is executed to assign channels cell by cell inspired by the mechanism of bristle. If the optimum assignment solution is not obtained in the first stage, the TCNN stage is then applied to continue the channel assignment until the optimum assignment is made or a maximum number of iterations is reached. A salient feature of the TCNN model is that chaotic neurodynamics are temporarily generated for searching and self-organizing in order to escape local minima. Therefore, the neural network gradually approaches, through transient chaos, a dynamical structure similar to conventional models such as the Hopfield neural network and converges to a stable equilibrium point. A variety of testing problems are used to compare the performance of the MSSO-TCNN against existing heuristic approaches. Simulation results show that the MSSO-TCNN improves performance substantially through solving well-known benchmark problems within comparable numbers of iterations to most existing algorithms.     

Substream-based soft handoff in CDMA cellular networks

We present a new soft handoff scheme that enhances the reliability during soft handoff by increasing the signal distance (Euclidean and/or Hamming) in forward link code division multiple access cellular networks. Each base station participating in soft handoff sends a disjoint subset of the main data stream (called sub-stream) and the mobile receiver reassembles the sub-streams and restores the main data stream. This approach can reduce the data rate per base station by a factor of the number of participating base stations and thereby can increase the signal distance as opposed to the diversity gain. It is shown that the proposed soft handoff scheme is promising for high data rate applications which are the major interests in the next generation cellular networks.     

一种新型的网络隐蔽信道检测模型

由于隐蔽信道可以绕过传统的安全策略实现非正常的通信机制,所以隐蔽信道的存在给安全信息系统带来了极大的安全隐患。网络中存在的隐蔽信道种类繁多,如何高效、快速、准确地检测出信道中可能存在的多种隐蔽信道成为亟需解决的问题。针对此问题提出了一种新型的网络隐蔽信道检测模型,该检测模型可根据安全等级的要求,对网络信道做出不同程度的安全检测,同时,根据隐蔽信道出现的频率、危害程度等属性实时改变隐蔽信道的检测顺序,从而提高网络隐蔽信道的检测效率。