The Weakest Failure Detector to Solve the Fault Tolerant Mutual Exclusion Problem in an Unknown Dynamic Environment

Many traditional distributed algorithms are unadapted to the new dynamic architectures that have emerged, such as mobile ad-hoc networks. Mutual exclusion is one of the fundamental problems in distributed computing, and cannot be solved in an asynchronous message passing systems where processes can crash. Existing solutions include the use of (T +Σ^l), which is the weakest failure detector to solve mutual exclusion in known, static distributed systems. In this paper, we introduce the (T +Σ^l)^d failure detector and prove that it is the weakest failure detector to solve mutual exclusion in unknown dynamic systems with partial memory losses.