Skip to main navigation Skip to search Skip to main content

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 proceedingConference contributionAcademic

    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 Seventy-ninth European Study Group Mathematics with Industry
    EditorsBob Planqué
    Place of PublicationAmsterdam
    PublisherVrije Universiteit Amsterdam
    Pages49-73
    Number of pages25
    Publication statusPublished - 2012

    Bibliographical note

    79th European Study Group Mathematics with Industry

    Fingerprint

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

    Cite this