Node counting in wireless ad-hoc networks

Joep Evers; D. Kiss; W. Kowalczyk; T. Navilarekallu; M. Renger; L. Sella; V. Timperio; A. Viorel; Sandra van Wijk; A.N. Yzelman

Node counting in wireless ad-hoc networks

Joep Evers, D. Kiss, W. Kowalczyk, T. Navilarekallu, M. Renger, L. Sella, V. Timperio, A. Viorel, Sandra van Wijk, A.N. Yzelman

extern

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution › Academic

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 language	English
Title of host publication	Proceedings of the Seventy-ninth European Study Group Mathematics with Industry
Editors	Bob Planqué
Place of Publication	Amsterdam
Publisher	Vrije Universiteit Amsterdam
Pages	49-73
Number of pages	25
Publication status	Published - 2012

Cite this

@inproceedings{f157d05cb4dc48489135b2251d1d18ec,

title = "Node counting in wireless ad-hoc networks",

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.",

author = "Joep Evers and D. Kiss and W. Kowalczyk and T. Navilarekallu and M. Renger and L. Sella and V. Timperio and A. Viorel and {van Wijk}, Sandra and A.N. Yzelman",

note = "79th European Study Group Mathematics with Industry",

year = "2012",

language = "English",

pages = "49--73",

editor = "Bob Planqu{\'e}",

booktitle = "Proceedings of the Seventy-ninth European Study Group Mathematics with Industry",

publisher = "Vrije Universiteit Amsterdam",

}

TY - GEN

T1 - Node counting in wireless ad-hoc networks

AU - Evers, Joep

AU - Kiss, D.

AU - Kowalczyk, W.

AU - Navilarekallu, T.

AU - Renger, M.

AU - Sella, L.

AU - Timperio, V.

AU - Viorel, A.

AU - van Wijk, Sandra

AU - Yzelman, A.N.

N1 - 79th European Study Group Mathematics with Industry

PY - 2012

Y1 - 2012

N2 - 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.

AB - 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.

M3 - Conference contribution

SP - 49

EP - 73

BT - Proceedings of the Seventy-ninth European Study Group Mathematics with Industry

A2 - Planqué, Bob

PB - Vrije Universiteit Amsterdam

CY - Amsterdam

ER -

Node counting in wireless ad-hoc networks

Abstract

Fingerprint

Cite this