research unit 1

This site is powered by Aigaion - A PHP/Web based management system for shared and annotated bibliographies. For more information visit


Type of publication:Article
Entered by:ichatz
TitleDistributed Communication Algorithms for Ad-hoc Mobile Networks
Bibtex cite IDRACTI-RU1-2004-29
Journal Journal of Parallel and Distributed Computing
Year published 2004
Volume 63
Number 1
Pages 58-74
DOI 10.1016/s0743-7315(02)00034-5
An ad hoc mobile network is a collection of mobile hosts, with wireless communication capabilities, forming a temporary network without the aid of any established fixed infrastructure. In such networks, topological connectivity is subject to frequent, unpredictable change. Our work focuses on networks with high rate of such changes to connectivity. For such dynamically changing networks we propose protocols which exploit the co-ordinated (by the protocol) motion of a small part of the network. We show that such protocols can be designed to work correctly and efficiently even in the case of arbitrary (but not malicious) movements of the hosts not affected by the protocol. We also propose a methodology for the analysis of the expected behavior of protocols for such networks, based on the assumption that mobile hosts (those whose motion is not guided by the protocol) conduct concurrent random walks in their motion space. In particular, our work examines the fundamental problem of communication and proposes distributed algorithms for it. We provide rigorous proofs of their correctness, and also give performance analyses by combinatorial tools. Finally, we have evaluated these protocols by experimental means.
Chatzigiannakis, Ioannis
Nikoletseas, Sotiris
Spirakis, Paul
ichatz.pdf (main file)
Publication ID268