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 |
Bibliographical note
79th European Study Group Mathematics with IndustryFingerprint
Dive into the research topics of 'Node counting in wireless ad-hoc networks'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver