The mobility of phones in a cellular or Personal Communication Services (PCS) environment introduces the prob- lem of efficiently locating the called phone. In this paper, we present an analysis of the delay and number of messages transmitted in different sequential and parallel search strategies, considering for the first time the issue of queuing on radio paging channels. Our analysis shows that parallel search may not reduce the time to find a mobile phone if the parameters of the system are unfavorable. We also develop an efficient algorithm for searching with minimum expected number of messages when the location of the phone is given by a probability vector.