Partition Participant Detector with Dynamic Paths in Mobile Networks - Archive ouverte HAL Access content directly
Conference Papers Year : 2010

Partition Participant Detector with Dynamic Paths in Mobile Networks

Pierre Sens
Gaël Thomas
Denis Conan
Léon Lim
  • Function : Author

Abstract

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.
Fichier principal
Vignette du fichier
2010_nca.pdf (93.89 Ko) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-01293847 , version 1 (12-06-2023)

Identifiers

Cite

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⟩
82 View
3 Download

Altmetric

Share

Gmail Facebook Twitter LinkedIn More