An Efficient Multicast Search Scheme under 2D Markov Walk Model

In order to improve the efficiency of paging management, various paging strategies have been proposed for tracking single mobile user in the wireless cellular network. However, most of the schemes have ignored the important problem of efficient search for multiple mobile users under delay and bandwidth constraints. Given the condition that the search is over only after all the users in the group are found, this problem is defined as the Conference Call Search (CCS) problem. As opposed to the single user tracking, for which one can always reduce the expected search cost, for a multicast search the dependency between the delay and the search cost is NP-hard. In this paper, we propose a non-optimal search method that yields a low search delay as well as a low search cost. The 2D Markov walk is used as the mobility model which describes a broad class of mobility patterns. The Weighted Bipartite Graph Matching is used to allocate paging bandwidth which keeps a total maximum location probability at each paging round. Experimental results show that our paging scheme also achieves a low paging cost and delay compared to other schemes proposed in the literature.