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:Inproceedings
Entered by:ichatz
TitleOn the Average and Worst-case Efficiency of Some New Distributed Communication and Control Algorithms for Ad-hoc Mobile Networks
Bibtex cite IDRACTI-RU1-2001-7
Booktitle 1st ACM International Workshop on Principles of Mobile Computing (POMC)
Year published 2001
Month August
Pages 1-19
Publisher ACM Press
Location Rhode Island, USA
Note Invited Paper
Keywords Mobile Adhoc Networks
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 dynamic 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 behaviour of protocols for such networks, based on the assumption that mobile hosts (whose motion is not guided by the protocol) conduct concurrent random walks in their motion space. Our work examines some fundamental problems such as pair-wise communication, election of a leader and counting, and proposes distributed algorithms for each of them. We provide their proofs of correctness, and also give rigorous analysis by combinatorial tools and also via experiments.
Chatzigiannakis, Ioannis
Nikoletseas, Sotiris
Spirakis, Paul
pomc01ichatz.pdf (main file)
Publication ID238