Name
Abstract | ||
|---|---|---|
We consider the problem of tracking a mobile user moving through a cellular network using node queries that provide information as to last time the user visited the node. Queries are executed in rounds, each round may involve queries to many nodes simultaneously, and the user may move at the same time that queries are performed. The cost measures considered are the number of rounds required to find the user and the total number of queries made during the execution of the algorithm. We present a number of algorithms for general networks, as well as upper and lower bounds for specific network topologies. |
Year | DOI | Venue |
|---|---|---|
2008 | 10.5555/1737763.1737766 | Nord. J. Comput. |
Keywords | Field | DocType |
specific network topology,mobile user,general network,total number,query,round,trac king,last time,lower bound,cellular network,timing information,node query,cellular networks | Computer science,Upper and lower bounds,Network topology,Theoretical computer science,Cost Measures,Cellular network | Journal |
Volume | Issue | Citations |
14 | 3 | 0 |
PageRank | References | Authors |
0.34 | 13 | 3 |
Name | Order | Citations | PageRank |
|---|---|---|---|
| Evangelos Kranakis | 1 | 3107 | 354.48 |
| Danny Krizanc | 2 | 1778 | 191.04 |
| Sunil Shende | 3 | 80 | 8.54 |