An Efficient Paging Algorithm for Multi-Carrier CDMA System

To cope with the increasing demand of wireless communication services multi-carrier systems are being used. Radio resources are very limited and efficient usages of these resources are inevitable to get optimum performance of the system. Paging channel is a low-bandwidth channel and one of the most important channels on which system performance depends significantly. Therefore it is vulnerable to even moderate overloads. In this paper, an efficient paging algorithm, Concurrent Search, is proposed for efficient use of paging channel in Multi- carrier CDMA system instead of existing sequential searching algorithm. It is shown by the simulation that the paging performance in proposed algorithm is far better than the existing system.

[1]  D. Munoz-Rodriguez Cluster paging for traveling subscribers , 1990, 40th IEEE Conference on Vehicular Technology.

[2]  Andrea Goldsmith,et al.  Wireless Communications , 2005, 2021 15th International Conference on Advanced Technologies, Systems and Services in Telecommunications (TELSIKS).

[3]  Roy D. Yates,et al.  Minimizing the average cost of paging under delay constraints , 1995, Wirel. Networks.

[4]  Charles M. Grinstead,et al.  Introduction to probability , 1999, Statistics for the Behavioural Sciences.

[5]  Rung-Hung Gau,et al.  Concurrent search of mobile users in cellular networks , 2004, IEEE/ACM Transactions on Networking.

[6]  Ian F. Akyildiz,et al.  Movement-based location update and selective paging for PCS networks , 1996, TNET.

[7]  Abbas Jamalipour,et al.  Wireless communications , 2005, GLOBECOM '05. IEEE Global Telecommunications Conference, 2005..

[8]  Dieter Plassmann Location management strategies for mobile cellular networks of 3rd generation , 1994, Proceedings of IEEE Vehicular Technology Conference (VTC).

[9]  E. D. Sykas,et al.  Intelligent paging strategies for third generation mobile telecommunication systems , 1995 .