International Journal of Computer Science and Mobile Computing (IJCSMC)
In this paper, the authors propose to concurrently search for a number of mobile users in a wireless cellular network based on the probabilistic information about the locations of mobile users. The concurrent search approach guarantees that all mobile users will be located within time slots. It is shown that even in the worst case when mobile users appear equally in all the cells of the network, the concurrent search approach is able to reduce the average paging cost by 25%. More importantly, this is achieved without an increase in the worst case paging delay or in the worst case paging cost.