Soft handoff algorithms for cdma cellular networks

Abstract

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.