Skip to Main content Skip to Navigation

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.
Complete list of metadata
Contributor : Pierre Sens Connect in order to contact the contributor
Submitted on : Monday, July 27, 2009 - 12:27:53 PM
Last modification on : Tuesday, March 22, 2022 - 11:10:10 AM
Long-term archiving on: : Tuesday, June 15, 2010 - 9:25:01 PM


Files produced by the author(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⟩



Record views


Files downloads