An Adaptive Hard Handoff Algorithm for Mobile Cellular Communication Systems

In this letter, we propose an adaptive hard handoff algorithm with a dynamic hysteresis value based on the received signal strength from the serving base station, for mobile cellular communication systems. A discrete‐time method is presented to evaluate handoff algorithms analytically. Performance is evaluated in terms of the average number of handoffs, the probability of link degradation, and the average handoff delay. Numerical results and simulations demonstrate that the proposed algorithm outperforms the handoff algorithm with fixed hysteresis values and the handoff algorithm using both threshold and hysteresis.     

Variations on optimal and suboptimal handoff control for wirelesscommunication systems

The design of handoff algorithms for cellular communication systems based on signal-strength measurements is addressed. The system is modeled using a hybrid framework: a mixture of continuous state and discrete event systems. The handoff problem is formulated as an optimization problem to control the switchings within the discrete event system. Performance is evaluated as a function of the expected number of handoffs, the expected handoff delay, and the expected number of signal degradations. A signal degradation occurs when the signal level falls below a threshold. The cost of handoff delay is explicitly specified, in contrast to prior work. Various optimization problems are posed to trade off between these quantities. Based on the optimal solutions which are obtained through dynamic programming, suboptimal versions are proposed for ease of implementation. The performance of the suboptimal algorithm which trades off between the expected number of handoffs and the expected number of signal degradations is improved through the use of signal averaging; however, this algorithm suffers from excessive handoff delay. Therefore, the tradeoff between handoff delay and number of handoffs is considered. The corresponding suboptimal algorithm provides nearly one handoff and almost no delay, which is ideal if call quality is also good. Finally, an algorithm which is a combination of the two previous algorithms is explored     

Performance analysis of path rerouting algorithms for handoffcontrol in mobile ATM networks

This paper studies the effects of user mobility and handoff path rerouting on the traffic distributions in a mobile network environment. In mobile ATM networks, extra traffic load may be added to network links due to user mobility and handoff path rerouting. This requires higher network link capacity and possible topology reengineering in order to support the same quality of service (QoS) for mobile services. To capture the dynamic variations in mobile ATM networks, we propose to use a flow model. The model represents the mobile-generated traffic as a set of stochastic flows over a set of origin-destination (OD) pairs. The user mobility is defined by transfer probabilities of the flows and the handoff path rerouting algorithm is modeled by a transformation between the routing functions for traffic flows. The analysis shows that user mobility may cause temporal variations as well as smoothing effects on the network traffic. Using the flow network model, typical handoff path rerouting algorithms are evaluated through both analytical and experimental approaches. The evaluation methodology can be used for either redesigning the network topology for a given path rerouting algorithm or selecting a path rerouting algorithm for a given network topology under a specific mobile service scenario     

A Simple Heuristic for Assignment of Cells to Switches in a PCS Network

This work deals with a design problem for a network of Personal Communication Services (PCS). The goal is to assign cells to switches in a PCS Network (PCSN) in an optimum manner so as to minimize the total cost which includes two types of cost, namely handoff cost between two adjacent cells, and cable cost between cells and switches. The design is to be optimized subject to the constraint that the call volume of each switch must not exceed its call handling capacity. In the literature, this problem has been conventionally formulated as an integer programming problem. However, because of the time complexity of the problem, the solution procedures are usually heuristic when the number of cells and switches are more. In this paper, we have proposed an assignment heuristic which is faster and much simpler than the existing algorithms. Despite its simplicity, experimental results show that it performs equally well in terms of solution quality, and, at the same time, it is faster than its predecessors. We present the algorithm as well as comparative results to justify our claim.     

An efficient handoff algorithm based on received signal strength and wireless transmission loss in hierarchical cell networks

Compared with the macrocell systems, the femtocell systems allow users to obtain broadband service with high data rate by using lower costs of transmit power, operation and capital expenditure. Traditional handoff algorithms used in macrocells cannot well satisfy the mobility of users efficiently in hierarchical macro/femto cell networks. In this paper based on the received signal strength (RSS) and wireless transmission loss, a new handoff algorithm in hierarchical cell networks called RWTL-HO is proposed, which considers the discrepancy in transmit power between macrocell and femtocell base stations. The simulation results show that compared with the conventional algorithm, the proposed algorithm improves the utilization of femtocells by doubling the number of handoffs; and in comparison with the handoff algorithm based on combining the RSSs from both macro and femto cell base stations, reduces half the number of redundant handoffs.     

Modeling techniques for large-scale PCS networks

There has been rapid growth in the demand for mobile communications that has led to intensive research and development of complex PCS (personal communication services) networks. Capacity planning and performance modeling are necessary to maintain a high quality of service to the PCS subscriber while minimizing costs. Effective and practical performance models for large-scale PCS networks are available. Two new performance models are presented in this article which can be solved using analytical techniques. The first is the so-called portable population model, based on the flow equivalent assumption (the rate of portables into a cell equals the rate of portables out of the cell). The model provides the steady-state portable population distribution in a cell that is independent of the portable residual time distribution, which can be used by simulations to reduce the necessary execution time by reaching the steady state more rapidly. Additionally, this model can be used to study the blocking probability of a low (portable) mobility PCS network and the performance of portable deregistration strategies. The second model is the so-called portable movement model which can be used to study location tracking and handoff algorithms. The model assumes that the arriving calls to a portable form a Poisson process, and portable residual times have a general distribution. This model can be used to study location-tracking algorithms and handoff algorithms. It is shown that under some assumptions, the analytic techniques are consistent with the simulation model     

A constrained MDP-based vertical handoff decision algorithm for 4G heterogeneous wireless networks

The 4th generation wireless communication systems aim to provide users with the convenience of seamless roaming among heterogeneous wireless access networks. To achieve this goal, the support of vertical handoff is important in mobility management. This paper focuses on the vertical handoff decision algorithm, which determines the criteria under which vertical handoff should be performed. The problem is formulated as a constrained Markov decision process. The objective is to maximize the expected total reward of a connection subject to the expected total access cost constraint. In our model, a benefit function is used to assess the quality of the connection, and a penalty function is used to model the signaling incurred and call dropping. The user’s velocity and location information are also considered when making handoff decisions. The policy iteration and Q-learning algorithms are employed to determine the optimal policy. Structural results on the optimal vertical handoff policy are derived by using the concept of supermodularity. We show that the optimal policy is a threshold policy in bandwidth, delay, and velocity. Numerical results show that our proposed vertical handoff decision algorithm outperforms other decision schemes in a wide range of conditions such as variations on connection duration, user’s velocity, user’s budget, traffic type, signaling cost, and monetary access cost.     

LEO卫星通信系统覆盖时间和切换次数分析

针对近地轨道(LEO)卫星移动通信系统,该文提出一种分析不同用户覆盖时间及切换次数的方法。在充分考虑地面用户随机分布特性的基础上,建立了卫星和波束对随机用户的覆盖时间统计模型,推导了星间切换及波束间切换平均次数下限值的计算方法。最后通过铱星通信系统模型(包括铱星星座参数,地面站参数和阵列天线波束模型)对该方法进行了仿真分析,结果显示该方法能很好地近似用户随机覆盖时间统计特性及平均切换次数的下限值。     

Distributed Online Algorithms for the Agent Migration Problem in WSNs

The mobile agent paradigm has been adopted by several systems in the area of wireless sensor networks as it enables a flexible distribution and placement of application components on nodes, at runtime. Most agent placement and migration algorithms proposed in the literature, assume that the communication rates between agents remain stable for a sufficiently long time to amortize the migration costs. Then, the problem is that frequent changes in the application-level communication may lead to several non-beneficial agent migrations, which may actually increase the total network cost, instead of decreasing it. To tackle this problem, we propose two distributed algorithms that take migration decisions in an online fashion, trying to deal with fluctuations in agent communication. The first algorithm is more of theoretical value, as it assumes infinite storage to keep information about the message exchange history of agents, while the second algorithm is a refined version that works with finite storage and limited information. We describe these algorithms in detail, and provide proofs for their competitive ratio vs. an optimal oracle. In addition, we evaluate the performance of the proposed algorithms for different parameter settings through a series of simulated experiments, also comparing their results with those achieved by an optimal static placement that is computed with full (a posteriori) knowledge of the execution scenarios. Our theoretical and experimental results are a strong indication for the robustness and effectiveness of the proposed algorithms.     

Artificial Neural Network Based Vertical Handoff Algorithm for Reducing Handoff Latency

One of the most challenging topics for next generation wireless networks is vertical handoff concept since several wireless technologies are assumed to cooperate. Plenty of parameters related to user preferences, application requirements, and network conditions, such as; data rate, service cost, network latency, speed of mobile, battery level, interference ratio and etc. must be considered in vertical handoff process along with traditional RSSI information. In this study, a new artificial neural network based handoff decision algorithm is proposed in order to reduce the handoff latency of smart terminal deployed in aforementioned wireless heterogeneous infrastructures. The prominent parameters data rate, monetary cost and RSSI information are taken as inputs of the developed vertical handoff decision system. Performance results of the proposed system are also compared with those of classical Multiple Attribute Decision Making method Simple Additive Weighting, and of some other artificial intelligence based algorithms. According to the results obtained, the proposed neural network based vertical handoff decision algorithm is able to determine whether a handoff is necessary or not properly, and selects the best candidate access network considering the abovementioned parameters. The results also show that, the neural network based algorithm developed significantly reduces the handoff latency while the number of handoffs, which is another vital performance metric, is still reasonable.     

Mobility management in next-generation wireless systems

This paper describes current and proposed protocols for mobility management for public land mobile network (PLMN)-based networks, mobile Internet protocol (IP) wireless asynchronous transfer mode (ATM) and satellite networks. The integration of these networks will be discussed in the context of the next evolutionary step of wireless communication networks. First, a review is provided of location management algorithms for personal communication systems (PCS) implemented over a PLMN network. The latest protocol changes for location registration and handoff are investigated for mobile IP followed by a discussion of proposed protocols for wireless ATM and satellite networks. Finally, an outline of open problems to be addressed by the next generation of wireless network service is discussed     

Microcellular handoff using fuzzy techniques

In order to manage the high call density expected in future cellular systems, microcell must be used. The size of the microcell will cause a dramatic increase in the number of handoffs. In addition, the small size of the microcell will require handoff algorithms to respond faster than those in todays systems. The problems are further exacerbated by the corner effect phenomenon which causes the signal level to drop by 20–30 dB in 10–20 m. Thus, in order to maintain reliable communication in a microcellular system new and better handoff algorithms must be developed. The use of hysteresis and averaging window in classical handoff techniques reduces unnecessary handoffs, but causes delays which may result in the calls being dropped. A fuzzy based handoff algorithm is proposed in this paper as a solution to this problem. The performance of fuzzy based handoff algorithm was also compared to that obtained using the classical handoff algorithms.     

Mobility management in wireless ATM networks

Mobile ATM offers a common wired network infrastructure to support mobility of wireless terminals, independent of the wireless access protocol. In addition, it allows seamless migration to future wireless broadband services, such as wireless ATM, by enabling mobility of end-to-end ATM connections. In spite of the diversity in mobile networking technologies (e.g., cellular telephony, mobile-IP, packet data services, PCS), all of them require two fundamental mechanisms: location management and handoff. This article describes different schemes for augmenting a wired ATM network to support location management of mobile terminals and handoff protocols for rerouting a connection data path when the endpoint moves. A prototype implementation of mobile ATM integrating mobility support with ATM signaling and connection setup, is presented. It shows how mobile ATM may be used to provide mobility support to an IP terminal using non-ATM wireless access     

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.     

Soft handoff algorithm with variable thresholds in CDMA cellularsystems

Traffic nonuniformity degrades the performance of CDMA cellular systems. The authors present a new algorithm called the variable threshold soft handoff (VTSH) which reduces the performance degradation due to traffic nonuniformity in CDMA cellular systems. Unlike the conventional fixed handoff thresholds, the proposed algorithm allows the handoff thresholds (T ADD and T DROP) to vary dynamically according to the traffic density of each cell. This algorithm has been implemented by means of computer simulation and the results show that VTSH improves the overall CDMA system performance in terms of outage probability. The VTSH algorithm can easily be applied to CDMA cellular systems without any modification     

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.     

Mobility management architectures based on joint mobile IP and SIP protocols

In the all-IP wireless networks beyond the third generation, mobility management can be effectively achieved by applying mobile IP (MIP) and the session initiation protocol (SIP) jointly. Nevertheless, an efficient combination of both protocols remains an open research issue. Conventional hybrid MIP-SIP mobility architectures operate MIP and SIP almost independently, resulting in significant redundant costs. This article investigates the representative hybrid MIP-SIP architectures and explores the joint optimizations between MIP and SIP for a more cost-efficient mobility support whilst utilizing their complementary power. Two novel design approaches are presented. The first approach culminates in a tightly integrated architecture, which merges the redundant mobility entities in MIP and SIP to yield maximum system efficiency. The other approach leads to a loosely integrated architecture, where necessary interactions are introduced between MIP and SIP mobility servers while their physical entities are kept intact. Major mobility procedures, including location update, session setup and handoff, are discussed in these architectures. The analytical results demonstrate that both proposed architectures outperform typical hybrid MIP-SIP architectures in terms of clear-cut reduced signaling costs     

Network architecture and signaling for wireless personalcommunications

A distributed microcellular architecture based on the IEEE 802.6 Metropolitan Area Network (MAN) is proposed, and is shown to meet anticipated personal communications service (PCS) needs. A method is presented to calculate MAN coverage in urban areas, and is used to demonstrate coverage of approximately 50 city blocks per MAN. A distributed subscriber database architecture is proposed to facilitate call setup, tracking of roamers and handoffs. To fully utilize MAN bandwidth, a quick method for the heat stations to switch on/off isochronous slots is proposed to facilitate adaptation to PCS traffic level variations. Call setup and handoff procedures are detailed. The PCS signaling overhead is calculated to be 15% of the capacity required to carry voice traffic     

Design of an ATM switch for handoff support

In a wireless ATM system, a network must provide seamless services to mobile users. To support this, mobility function should be added to existing ATM networks. Through a handoff operation, a mobile user can receive a service from the network without disconnecting the communication. A handoff results in connection path rerouting during an active connection. To avoid cell loss during a handoff, cell buffering and rerouting are required in the network. A handoff switch is a connection breakdown point on an original connection path in the network from which a new connection sub‐path is established. It performs cell buffering and rerouting during a handoff. Cell buffering and rerouting can introduce a cell out‐of‐sequence problem. In this paper we propose a handoff switch architecture with a shared memory. The architecture performs cell buffering and rerouting efficiently by managing logical queues of virtual connections in the shared memory and sorting head‐of‐line cells for transmission, thus achieving in‐sequence cell delivery during a handoff. We also present simulation results to understand the impacts of handoffs on switch performance. This revised version was published online in July 2006 with corrections to the Cover Date.     

A call quality performance measure for handoff algorithms

This paper proposes a new approach for performance evaluation and comparison between existing handoff algorithms taking into consideration signal levels, call dropping, and handoff cost. Using the new approach, existing handoff algorithms are then compared in terms of signal quality and number of handoffs required to achieve a desired overall signal quality. We also provide in this paper a method to estimate handoff cost and to optimize handoff sequences for retrial (where repeated call attempts are made after a call is lost) and non‐retrial models based on the proposed approach. We observe that the Threshold with Hysteresis method performs better than other known methods including the one used in the GSM standard. Our results indicate that the Threshold with 4 dB Hysteresis method performs well for urban areas although with a high dropping probability, whereas the Threshold with 6 dB Hysteresis method suits for suburban areas with a low dropping probability. We find that handoff sequences obtained by existing handoff methods are less efficient than the optimal handoff sequence given in the paper by a margin of 29–45% for retrial model, and by 34–77% for non‐retrial model. The paper also suggests some specific parameter values to improve the performance of currently used handoff methods based on our findings. Copyright © 2010 John Wiley & Sons, Ltd.