Partition Participant Detector with Dynamic Paths in MANETs

Abstract : Mobile ad-hoc networks, MANETs, are self-organizing and very dynamic systems where processes have no global knowledge of the system. Due to node failures, mobility, disconnection and new arrivals, the network is not fully connected and it is not always possible to statically establish end-to-end paths between nodes. 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. It is characterized by both the strong partition participant completeness and eventual strong partition participant accuracy properties.
Type de document :
[Research Report] RR-7002, INRIA. 2009, pp.18
Liste complète des métadonnées
Contributeur : Pierre Sens <>
Soumis le : lundi 27 juillet 2009 - 12:27:53
Dernière modification le : vendredi 31 août 2018 - 09:25:53
Document(s) archivé(s) le : mardi 15 juin 2010 - 21:25:01


Fichiers produits par l'(les) auteur(s)


  • HAL Id : inria-00407685, version 1


Luciana Arantes, Pierre Sens, Gaël Thomas, Denis Conan, Léon Lim. Partition Participant Detector with Dynamic Paths in MANETs. [Research Report] RR-7002, INRIA. 2009, pp.18. 〈inria-00407685〉



Consultations de la notice


Téléchargements de fichiers