Node counting in wireless ad-hoc networks

J.H.M. Evers, D. Kiss, W. Kowalczyk, T. Navilarekallu, D.R.M. Renger, L. Sella, V. Timperio, A. Viorel, A.C.C. Wijk, van, A.J. Yzelman

Research output: Chapter in Book/Report/Conference proceedingConference contributionAcademic

108 Downloads (Pure)

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.
Original languageEnglish
Title of host publicationProceedings of the 79th European Study Group Mathematics with Industry, January 24-28, 2011
EditorsB. Planqué, S. Bhulai, J. Hulshof, W. Kager, T. Rot
Place of PublicationAmsterdam
PublisherVrije Universiteit Amsterdam
Pages49-73
Publication statusPublished - 2012
Event79th European Study Group with Industry, January 24-28, 2011, Amsterdam, The Netherlands - Amsterdam, Netherlands
Duration: 24 Jan 201128 Jan 2011

Conference

Conference79th European Study Group with Industry, January 24-28, 2011, Amsterdam, The Netherlands
Country/TerritoryNetherlands
CityAmsterdam
Period24/01/1128/01/11
OtherEuropean Study Group with Industry

Fingerprint

Dive into the research topics of 'Node counting in wireless ad-hoc networks'. Together they form a unique fingerprint.

Cite this