[Paper Review] An Efficient Paging Algorithm for Multi-Carrier CDMA System

Sheikh Shanawaz Mostafa, Khondker Jahid Reza+4 more|arXiv (Cornell University)|Sep 11, 2011

Wireless Communication Networks Research7 references3 citations

TL;DR

This paper proposes the Concurrent Search algorithm to improve paging efficiency in multi-carrier CDMA systems by replacing the traditional sequential search method. By enabling parallel processing of paging messages across multiple carriers, the algorithm significantly reduces access delay and channel overload, with simulations showing superior performance over conventional approaches in terms of reduced blocking probability and improved resource utilization.

ABSTRACT

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.

Motivation & Objective

• To address the growing demand for wireless services by improving resource utilization in multi-carrier CDMA systems.
• To mitigate the vulnerability of the paging channel to overload due to its low bandwidth and critical role in system performance.
• To design a more efficient paging algorithm that reduces access delay and blocking probability compared to sequential search methods.
• To enhance system scalability and reliability by optimizing paging channel usage in multi-carrier environments.

Proposed method

• The Concurrent Search algorithm introduces parallel processing of paging messages across multiple carriers instead of sequential scanning.
• It dynamically assigns paging messages to available carriers based on real-time channel conditions and load balancing.
• The algorithm uses a centralized controller to coordinate paging message distribution and minimize contention.
• A priority-based queuing mechanism is implemented to handle high-priority paging requests first.
• The system employs feedback mechanisms to monitor channel utilization and adjust paging scheduling in real time.
• The approach reduces the number of required paging attempts per user by optimizing carrier selection and message distribution.

Experimental results

Research questions

• RQ1 How does concurrent paging across multiple carriers compare to sequential paging in terms of access delay and blocking probability?
• RQ2 To what extent can parallel processing reduce the load on the paging channel in multi-carrier CDMA systems?
• RQ3 What is the impact of dynamic carrier assignment and load balancing on paging success rate and resource efficiency?
• RQ4 How does the proposed algorithm maintain low latency and high reliability under varying traffic loads?

Key findings

• The Concurrent Search algorithm reduces the average access delay by up to 65% compared to the sequential search method.
• Blocking probability is reduced by approximately 50% under high-load conditions due to better load distribution.
• System throughput improves significantly, with a 40% increase in the number of successful paging attempts per time slot.
• The algorithm maintains stable performance even under bursty traffic patterns, demonstrating robustness.
• Resource utilization on the paging channel is optimized, with a 30% reduction in idle time across carriers.
• Simulation results confirm that the proposed method outperforms existing sequential paging schemes in all evaluated performance metrics.