## Abstract

A prevailing feature of mobile telephony systems is that the location of a mobile user may be unknown. Therefore, when the system is to establish a call between users, it may need to search, or page, all the cells that it suspects the users may be located in, in order to find the cells where the users currently reside. The search consumes expensive wireless links which motivates search techniques that page as few cells as possible. We consider cellular systems with n cells and m mobile users roaming among the cells. The location of the users is uncertain and is given by m probability distribution vectors. Whenever the system needs to find specific users, it conducts a search operation lasting at most d rounds. In each round the system may check an arbitrary subset of cells to see which users are located there. The problem of finding a single user is known to be polynomially solvable. Whereas the problem of finding any constant number of users (at least 2) in any fixed (constant) number of rounds (at least two rounds) is known to be NP-hard. In this paper we present a simple polynomial-time approximation scheme for this problem with a constant number of rounds and a constant number of users. This result improves an earlier e/e-1 ∼ 1.581977-approximation of Bar-Noy and Malewicz.

Original language | English |
---|---|

Pages (from-to) | 36-47 |

Number of pages | 12 |

Journal | Lecture Notes in Computer Science |

Volume | 3351 |

DOIs | |

State | Published - 2005 |

Externally published | Yes |

Event | Second International Workshop on Approximation and Online Algorithms, WAOA 2004 - Bergen, Norway Duration: 14 Sep 2004 → 16 Sep 2004 |

## ASJC Scopus subject areas

- Theoretical Computer Science
- General Computer Science