Deterministic gathering with crash faults
Andrzej Pelc · Networks · 2018
A team consisting of an unknown number of mobile agents, starting from different nodes of an unknown network, have to meet at the same node and terminate. This problem is known asgathering. We study deterministic gathering algorithms under the assumption that agents are subject tocrash faultswhich can occur at any time. Two fault scenarios are considered. Amotion faultimmobilizes the agent at a node or inside an edge but leaves intact its memory at the time when the fault occurred. A more severetotal faultimmobilizes the agent as well, but also erases its entire memory. Of course, we cannot require faulty agents to gather. Thus the gathering problem for fault prone agents calls for all fault‐free agents to gather at a single node, and terminate.