Gesellschaft für Informatik e.V.

Lecture Notes in Informatics

10th International Conferenceon Innovative Internet Community Systems (I2CS) - Jubilee Edition 2010 - P-165, 63-78 (2010).

Gesellschaft für Informatik, Bonn

Copyright © Gesellschaft für Informatik, Bonn


Optimizing mobile networks connectivity and routing using percolation theory

Soufian Ben Amor , Marc Bui and Ivan Lavallée


Mobile Ad-hoc NETworks (MANETs) are complex systems presenting a phase transition phenomenon : an abrupt change in the behavior of the network around a critical value of a certain key parameter. The reliability and connectivity of MANETs depend on their size and on the efficiency of the routing protocol. In this paper we propose a new approach in MANETs modeling, combining percolation theory and epidemic algorithms. Using percolation theory we show the existence of a connectivity threshold (in a square lattice) needed to guarantee the communications in the network, in particular when the number of direct links are limited. Epidemic algorithms are used to provide a good propagation of information in the network wile minimizing the resources cost (energy, number of messages$\dots $).

Full Text: PDF

Gesellschaft für Informatik, Bonn
ISBN 978-3-88579-259-8

Last changed 04.10.2013 18:31:21