Partition Participant Detector with Dynamic Paths in Mobile Networks

Abstract

International audienceMobile 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

Mind the Gap: Autonomous Detection of Partitioned MANET Systems using Opportunistic Aggregation

“…In the following we review related work on partition detection, as well as on related problems, such as cut detection, partition prediction, and partition recovery. a) Membership and partition detection: The work of Arantes et al [9], [10] formalizes the notions of partition detector and partition participants detector in a manner similar to the classical formalization of failure detectors [20]. The two algorithms they propose accumulate information about broadcast propagation paths over epochs in order to construct local reachability information.…”

Taming uncertainty in distributed systems with help from the network

“…5 If the manager cannot use the network interface to install rules at any switch, 5 This failure can be detected via timeouts. These timeouts differ from endfunction handle backstop timeout(client, pid):…”

“…This service has a well-developed theory (e.g., [14]), including some extensions for network partitions [3,5], and a welldeveloped practice [9,15,34,67], based on timeouts ( §2.2). Unlike Albatross, this work does not leverage information and mechanisms in the network.…”

An Eventual alpha Partition-Participant Detector for MANETs

“…In a previous work [8], we have proposed an eventual partition-participant detector using dynamic paths which eventually detects the participant nodes of stable partitions in MANETs. Liveness is only guaranteed in completely stable partitions.…”

“…Partition-participant detectors are oracles associated with processes that give the set of stable processes that belong to a partition. Like failure detectors [14], a partition-participant detector can make mistakes, but it eventually computes the set of processes that belong to the partition [8]. Note that, unlike a failure detector, the specification of a partition-participant detector must be based on the ability of processes to communicate with each other rather than detecting correct processes.…”