Node counting in wireless ad-hoc networks
Joep H. M. Evers, D Kiss, Wojtek Kowalczyk · TU/e Research Portal · 2011
We study wireless ad-hoc networks consisting of small microprocessors with limited memory, where the wireless communication between the processors can be highly unreliable. For this setting, we propose a number of algorithms to estimate the number of nodes in the network, and the number of direct neighbors of each node. The algorithms are simulated, allowing comparison of their performance.