Efficient Distributed Trigger Counting algorithms for dynamic network topology

The Distributed Trigger Counting (DTC) problem is o raise an alert while the number of riggers received by the whole system reaches a pre-defined amount. There have been several algorithms proposed to solve such a problem in the literature. However, these existing algorithms are all under the assumption that here is no even regarding process moving, leaving and joining in the network. In his paper, we propose a novel distributed algorithm to solve the DTC problem for dynamic networks, which is free of any global assumption. Moreover, in order to reduce he message complexity of our algorithm, we further propose a more message-efficient version. only with one additional requirement that all processes need to learn ahead the total number of processes in the system.