IP-based protocols for mobile internetworking
SIGCOMM '91 Proceedings of the conference on Communications architecture & protocols
Impact of mobility on distributed computations
ACM SIGOPS Operating Systems Review
Power efficient filtering of data on air
EDBT '94 Proceedings of the 4th international conference on extending database technology: Advances in database technology
Introduction to distributed algorithms
Introduction to distributed algorithms
Distributed dynamic channel allocation for mobile computing
Proceedings of the fourteenth annual ACM symposium on Principles of distributed computing
Fundamental distributed protocols in mobile networks
Proceedings of the eighteenth annual ACM symposium on Principles of distributed computing
Fundamental control algorithms in mobile networks
Proceedings of the eleventh annual ACM symposium on Parallel algorithms and architectures
Distributed Algorithms
Competitive Call Control in Mobile Networks
ISAAC '97 Proceedings of the 8th International Symposium on Algorithms and Computation
UNIX for nomads: making Unix support mobile computing
MLCS Mobile & Location-Independent Computing Symposium on Mobile & Location-Independent Computing Symposium
Agent-mediated message passing for constrained environments
MLCS Mobile & Location-Independent Computing Symposium on Mobile & Location-Independent Computing Symposium
Symmetry breaking in distributive networks
SFCS '81 Proceedings of the 22nd Annual Symposium on Foundations of Computer Science
| Hi-index | 0.00 |
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. The Distributed Systems Platform (DSP) is a software platform that has been designed for the implementation, simulation and testing of distributed protocols. It offers a set of subtools which permit the researcher and the protocol designer to work under a familiar graphical and algorithmic environment. The use of DSP gave us considerable input and permitted us to experimentally test the two tier principle for the counting problem of mobile hosts. Moreover it helped us to design new distributed algorithms for this problem, improve them and experimentally test them, validating their performance under various conditions.