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:Inbook
Entered by:ADM
TitleCommunication Algorithms for Ad Hoc Mobile Networks Using Random Walks
Bibtex cite IDRACTI-RU1-2008-35
Series Encyclopedia of Algorithms
Year published 2008
Pages 161-165
Publisher Springer Verlag
ISBN 978-0-387-30770-1
DOI 10.1007/978-0-387-30162-4_77
The problem of communication among mobile nodes is one of the most fundamental problems in ad hoc mobile networks and is at the core of many algorithms, such as for counting the number of nodes, electing a leader, data processing etc. For an exposition of several important problems in ad hoc mobile networks. The work of Chatzigiannakis, Nikoletseas and Spirakis focuses on wireless mobile networks that are subject to highly dynamic structural changes created by mobility, channel fluctuations and device failures. These changes affect topological connectivity, occur with high frequency and may not be predictable in advance. Therefore, the environment where the nodes move (in three-dimensional space with possible obstacles) as well as the motion that the nodes perform are \textitinput to any distributed algorithm.
Chatzigiannakis, Ioannis
encyalgo07-ichatz.pdf (main file)
Publication ID6