๐”– Bobbio Scriptorium
โœฆ   LIBER   โœฆ

Concurrently searching for mobile users in cellular networks

โœ Scribed by Rung-Hung Gau; Haas, Z.J.

Book ID
117885380
Publisher
IEEE
Year
2003
Tongue
English
Weight
264 KB
Volume
7
Category
Article
ISSN
1089-7798

No coin nor oath required. For personal study only.

๐Ÿ“œ SIMILAR VOLUMES

Fairness in cellular mobile networks
Fairness in cellular mobile networks
โœ Sarkar, S.; Sivarajan, K.N. ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› IEEE ๐ŸŒ English โš– 427 KB
A tabu search approach for assigning cel
A tabu search approach for assigning cells to switches in cellular mobile networks
โœ Samuel Pierre; Fabien Houรฉto ๐Ÿ“‚ Article ๐Ÿ“… 2002 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 291 KB

This paper proposes a tabu search approach for assigning cells to switches in wireless cellular networks. This problem is NP-hard and consequently cannot be practically solved by exact methods for real size networks. We ยฎrst establish a new mathematical equivalence between the assignment problem and

Searching with mobile agents in networks
Searching with mobile agents in networks with liars
โœ Nicolas Hanusse; Evangelos Kranakis; Danny Krizanc ๐Ÿ“‚ Article ๐Ÿ“… 2004 ๐Ÿ› Elsevier Science ๐ŸŒ English โš– 261 KB

We present deterministic algorithms to search for an item s contained in a node of a network, without prior knowledge of its exact location. Each node of the network has a database that will answer queries of the form "how do I get to s?" by responding with the รฟrst edge on a shortest path to the no