Partition Participant Detector with Dynamic Paths in Mobile Networks

Luciana Arantes (1) , Pierre Sens (1) , Gaël Thomas (1) , Denis Conan (2) , Léon Lim (2)

1 Regal - Large-Scale Distributed Systems and Applications
2 TSP - Télécom SudParis

Mobile ad-hoc networks, MANETs, are self-organized and very dynamic systems where processes have no global knowledge of the system. In this paper, we propose a model that characterizes the dynamics of MANETs in the sense that it considers that paths between nodes are dynamically built and the system can have infinitely many processes but the network may present finite stable partitions. We also propose an algorithm that implements an eventually perfect partition participant detector PD which eventually detects the participant nodes of stable partitions.

Mots clés: Participant detector; MANET; Partitionable networks; Models for dynamic systems

Domaines: Réseaux et télécommunications [cs.NI]

Luciana Arantes, Pierre Sens, Gaël Thomas, Denis Conan, Léon Lim. Partition Participant Detector with Dynamic Paths in Mobile Networks. IEEE International Symposium on Networking Computing and Applications (NCA 2010), IEEE, Jul 2010, Cambridge, MA, United States. pp.224-228, ⟨10.1109/NCA.2010.40⟩. ⟨hal-01293847⟩