eprintid: 587
rev_number: 11
eprint_status: archive
userid: 10
dir: disk0/00/00/05/87
datestamp: 2012-10-29 16:22:46
lastmod: 2015-05-29 20:12:35
status_changed: 2012-10-29 16:22:46
type: report
metadata_visibility: show
item_issues_count: 0
creators_name: Evers, J
creators_name: Kiss, D
creators_name: Kowalczyk, W
title: Node counting in wireless ad-hoc networks
ispublished: pub
subjects: discrete
subjects: telecom
studygroups: esgi79
companyname: Chess
full_text_status: public
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.
date: 2011
citation:   Evers, J and Kiss, D and Kowalczyk, W  (2011) Node counting in wireless ad-hoc networks.  [Study Group Report]     
document_url: http://miis.maths.ox.ac.uk/miis/587/1/Amst112.pdf