The Conference Call Search Problem in Wireless Networks

Cellular telephony systems, where locations of mobile users are unknown at some times, are becoming more common. In such systems, mobile users are roaming in a zone and a user reports its location only if it leaves the zone entirely. The Conference Call Search problem (CCS) deals with tracking a set of mobile users in order to establish a call. To find a single roaming user, the system may need to search each cell where the user may be located. The goal is to identify the location of all users, within bounded time, satisfying some additional constraints on the search scheme. We consider cellular systems with n cells and m mobile users (cellular phones). The uncertain location of users is given by m probability distribution vectors. Whenever the system needs to find the users, it conducts a search operation lasting at most d rounds. A request for a single search step specifies a user and a cell. In this search step, the cell is asked whether the given user is located there. In each r...

• Type: Conference
• Year: 2005
• Where: WAOA
• Authors: Leah Epstein, Asaf Levin
• Keywords: Mobile Users, Search Protocol, Search Step, WAOA 2005