An efficient call delivery algorithm in hierarchical cellular networks

The multiple registration scheme can reduce the location update cost in hierarchical cellular networks; however, it leads to the increased call setup latency to find out the current location of a mobile terminal. In this paper, we propose an efficient call delivery algorithm that employs a timer estimating the low-tier cell residence time. Analytical and simulation results demonstrate that the proposed algorithm outperforms high-tier cell first and low-tier cell first algorithms in terms of call setup latency.