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

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 proceeding › Conference contribution › Academic

123 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 language	English
Title of host publication	Proceedings of the 79th European Study Group Mathematics with Industry, January 24-28, 2011
Editors	B. Planqué, S. Bhulai, J. Hulshof, W. Kager, T. Rot
Place of Publication	Amsterdam
Publisher	Vrije Universiteit Amsterdam
Pages	49-73
Publication status	Published - 2012
Event	79th European Study Group with Industry, January 24-28, 2011, Amsterdam, The Netherlands - Amsterdam, Netherlands Duration: 24 Jan 2011 → 28 Jan 2011

Conference

Conference	79th European Study Group with Industry, January 24-28, 2011, Amsterdam, The Netherlands
Country/Territory	Netherlands
City	Amsterdam
Period	24/01/11 → 28/01/11
Other	European Study Group with Industry

Access to Document

publishers versionFinal published version, 330 KB

Cite this

Evers, J. H. M., Kiss, D., Kowalczyk, W., Navilarekallu, T., Renger, D. R. M., Sella, L., Timperio, V., Viorel, A., Wijk, van, A. C. C., & Yzelman, A. J. (2012). Node counting in wireless ad-hoc networks. In B. Planqué, S. Bhulai, J. Hulshof, W. Kager, & T. Rot (Eds.), Proceedings of the 79th European Study Group Mathematics with Industry, January 24-28, 2011 (pp. 49-73). Vrije Universiteit Amsterdam.

@inproceedings{6c389ba68cdc4467957fd95a8960e44f,

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 = "J.H.M. Evers and D. Kiss and W. Kowalczyk and T. Navilarekallu and D.R.M. Renger and L. Sella and V. Timperio and A. Viorel and {Wijk, van}, A.C.C. and A.J. Yzelman",

year = "2012",

language = "English",

pages = "49--73",

editor = "B. Planqu{\'e} and S. Bhulai and J. Hulshof and W. Kager and T. Rot",

booktitle = "Proceedings of the 79th European Study Group Mathematics with Industry, January 24-28, 2011",

publisher = "Vrije Universiteit Amsterdam",

note = "79th European Study Group with Industry, January 24-28, 2011, Amsterdam, The Netherlands ; Conference date: 24-01-2011 Through 28-01-2011",

}

Evers, JHM, Kiss, D, Kowalczyk, W, Navilarekallu, T, Renger, DRM, Sella, L, Timperio, V, Viorel, A, Wijk, van, ACC & Yzelman, AJ 2012, Node counting in wireless ad-hoc networks. in B Planqué, S Bhulai, J Hulshof, W Kager & T Rot (eds), Proceedings of the 79th European Study Group Mathematics with Industry, January 24-28, 2011. Vrije Universiteit Amsterdam, Amsterdam, pp. 49-73, 79th European Study Group with Industry, January 24-28, 2011, Amsterdam, The Netherlands, Amsterdam, Netherlands, 24/01/11.

Node counting in wireless ad-hoc networks. / Evers, J.H.M.; Kiss, D.; Kowalczyk, W. et al.
Proceedings of the 79th European Study Group Mathematics with Industry, January 24-28, 2011. ed. / B. Planqué; S. Bhulai; J. Hulshof; W. Kager; T. Rot. Amsterdam: Vrije Universiteit Amsterdam, 2012. p. 49-73.

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

TY - GEN

T1 - Node counting in wireless ad-hoc networks

AU - Evers, J.H.M.

AU - Kiss, D.

AU - Kowalczyk, W.

AU - Navilarekallu, T.

AU - Renger, D.R.M.

AU - Sella, L.

AU - Timperio, V.

AU - Viorel, A.

AU - Wijk, van, A.C.C.

AU - Yzelman, A.J.

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 79th European Study Group Mathematics with Industry, January 24-28, 2011

A2 - Planqué, B.

A2 - Bhulai, S.

A2 - Hulshof, J.

A2 - Kager, W.

A2 - Rot, T.

PB - Vrije Universiteit Amsterdam

CY - Amsterdam

T2 - 79th European Study Group with Industry, January 24-28, 2011, Amsterdam, The Netherlands

Y2 - 24 January 2011 through 28 January 2011

ER -

Node counting in wireless ad-hoc networks

Abstract

Conference

Access to Document

Fingerprint

Cite this