Year: 2011
Type: conference-paper
Abstract: 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.
Source: TU/e Research Portal
Authors: Joep H. M. Evers, D Kiss, Wojtek Kowalczyk
Language: English
Topic: Mobile Ad Hoc Networks
Subfield: Computer Networks and Communications
Field: Computer Science
Domain: Physical Sciences
Open Access status: green
OpenAlex ID: W2139766320
