An adaptive location management scheme using the velocity of mobile nodes

Many dynamic location update schemes such as time-based, movement-based, and distance-based have been studied in the location management of mobile communication. Also there are many studies that improve these schemes adaptively using mobile nodes' call and mobility patterns. These schemes usually use the prediction-based algorithms for mobile nodes' mobility patterns. However those need complicated computation such as heuristic algorithm. Those schemes' management costs are various for mobile nodes' diverse mobility patterns. In this paper we propose a novel approach in which the location management costs are rarely affected by mobile nodes' mobility patterns. The basic idea is to use the velocity of a mobile node, which is represented by the combination of two thresholds: time threshold T and distance threshold D. The update process is triggered by the change of mobile node's velocity, that is two thresholds. These values are adjusted by simple algorithm whenever a location update occurs. Also, we use stepwise paging scheme using the mobile node's velocity in order to reduce the paging cost. We compare our scheme. with the distance-based scheme through numerical analysis. Finally, we show that our proposed scheme is better than the distance-based scheme with an optimal distance threshold value for most mobility patterns.