The MIIS Eprints Archive

Node counting in wireless ad-hoc networks

Evers, J and Kiss, D and Kowalczyk, W (2011) Node counting in wireless ad-hoc networks. [Study Group Report]



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.

Item Type:Study Group Report
Problem Sectors:Discrete
Information and communication technology
Study Groups:European Study Group with Industry > ESGI 79 (Amsterdam, Netherlands, Jan 24-28, 2011) (SWI 2011)
Company Name:Chess
ID Code:587
Deposited By: Mark Curtis
Deposited On:29 Oct 2012 16:22
Last Modified:29 May 2015 20:12

Repository Staff Only: item control page