A Faster Counting Protocol for Anonymous Dynamic Networks

摘要

We study the problem of counting the number of nodes in a slotted-time communication network, under the challenging assumption that nodes do not have identifiers and the network topology changes frequently. That is, for each time slot links among nodes ca