License: 
Creative Commons Attribution 4.0 International license (CC BY 4.0)
When quoting this document, please refer to the following
DOI: 10.4230/DagSemProc.05031.30
URN: urn:nbn:de:0030-drops-580
URL: http://dagstuhl.sunsite.rwth-aachen.de/volltexte/2005/58/
|
Go to the corresponding Portal |
Epstein, Leah ;
Levin, Asaf
Tracking mobile users
Abstract
Cellular telephony systems, where locations of a mobile users may be unknown at some times, are becoming more common. Mobile users are roaming in a zone. A user reports its location only if it leaves the zone entirely. We consider cellular zones 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. The Conference Call Search problem (CCS) deals with tracking a set of mobile users, in order to establish a call between all of them. The search is performed in a limited number of rounds, and the goal is to minimize the expected search cost. In the "unit cost model", a single query for a cell outputs a list of users located in that cell. The "bounded bandwidth" model allows a query for a single user per cell in each round. We discuss three types of protocols; oblivious, semi-adaptive and adaptive search protocols. An oblivious search protocol decides on all requests in advance, and stops only when all users are found. A semi-adaptive search protocol decides on all the requests in advance, but it stops searching for a user once it is found. An adaptive search protocol stops searching for a user once it has been found (and its search strategy may depend on the subsets of users that were found in each previous round). We establish the differences between the distinct protocol types and answer some open questions which were posed in previous work on the subject.
BibTeX - Entry
@InProceedings{epstein_et_al:DagSemProc.05031.30,
author = {Epstein, Leah and Levin, Asaf},
title = {{Tracking mobile users}},
booktitle = {Algorithms for Optimization with Incomplete Information},
pages = {1--3},
series = {Dagstuhl Seminar Proceedings (DagSemProc)},
ISSN = {1862-4405},
year = {2005},
volume = {5031},
editor = {Susanne Albers and Rolf H. M\"{o}hring and Georg Ch. Pflug and R\"{u}diger Schultz},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/opus/volltexte/2005/58},
URN = {urn:nbn:de:0030-drops-580},
doi = {10.4230/DagSemProc.05031.30},
annote = {Keywords: mobile users , PTAS}
}
|
Keywords: |
|
mobile users , PTAS |
|
Collection: |
|
05031 - Algorithms for Optimization with Incomplete Information |
|
Issue Date: |
|
2005 |
|
Date of publication: |
|
30.05.2005 |
