Counting in Mobile Networks: Theory and Experimentation
Lists
Only you see this
Abstract
In this work we study the problem of counting the number of mobile hosts in mobile networks. Mobile networks aim to provide continuous network connectivity to users regardless of their location. Host mobility introduces a number of new features and requirements for the distributed algorithms. In this case, the use of conventional distributed algorithms from mobile hosts results in a number of serious drawbacks. The two tier principle has been proposed (see [2]) to overcome these problems. The use of this principle for structuring distributed algorithms for mobile hosts means that the computation and communications requirements of an algorithm is borne by the static hosts to the maximum extend possible.
BibTeX
@inproceedings{hatzis1999counting,
author = {Kostas P. Hatzis and George P. Pentaris and Paul G. Spirakis and Basil Tampakas},
title = {{Counting in Mobile Networks: Theory and Experimentation}},
booktitle = {WAE},
year = {1999},
doi = {10.1007/3-540-48318-7\_10},
}Loading related content...