Handover Analysis and Dynamic Mobility Management for Wireless Cellular Networks

Dynamic location of mobile users aims to deliver incoming calls to destination users. Most location algorithms keep track of mobile users through a predefined location area. The design of these location algorithms is focused to minimize the generated signaling traffic. There are three basic approaches to design location algorithms, namely distance-based, time-based and movement-based. In this Chapter we focus only on the movement-based algorithm since it achieves a good compromise between complexity and performance. We minimize a cost function for this dynamic movement-based location algorithm in order to find an optimum threshold in the number of updates. Counting the number of wireless cell crossing during inter-call times is a fundamental issue for our analysis. We use renewal theory to capture the probabilistic structure of this model, and it is general enough to include a variety of probability distributions for modeling cell residence times (CRT) in exponentially distributed location areas and hyperexponentially distributed intercall times. We present numerical results regarding some important distributions.