Memory and communication efficient algorithm for decentralized counting of nodes in networks
Memory and communication efficient algorithm for decentralized counting of nodes in networks
Node counting on a graph is subject to some fundamental theoretical limitations, yet a solution to such problems is necessary in many applications of graph theory to real-world systems, such as collective robotics and distributed sensor networks. Thus several stochastic and naïve deterministic algorithms for distributed graph size estimation or …