Abstract

A distributed consensus algorithm for estimating the number of nodes in a wireless sensor network in the presence of communication noise is proposed. The idea is based on estimating the norm of available samples at nodes. Each node generates its own random initial measurements and updates its state by only communicating with its neighbors: the algorithm is fully distributed with no assumptions about the structure of the network. We also show that there is a trade-off between the estimation error and the storage at each node.

Original languageEnglish (US)
Title of host publicationConference Record - Asilomar Conference on Signals, Systems and Computers
PublisherIEEE Computer Society
Pages360-364
Number of pages5
Volume2016-February
ISBN (Print)9781467385763
DOIs
StatePublished - Feb 26 2016
Event49th Asilomar Conference on Signals, Systems and Computers, ACSSC 2015 - Pacific Grove, United States
Duration: Nov 8 2015Nov 11 2015

Other

Other49th Asilomar Conference on Signals, Systems and Computers, ACSSC 2015
CountryUnited States
CityPacific Grove
Period11/8/1511/11/15

Keywords

  • Average Consensus
  • L2 Norm
  • Node Counting

ASJC Scopus subject areas

  • Computer Networks and Communications
  • Signal Processing

Fingerprint Dive into the research topics of 'Node counting in wireless sensor networks'. Together they form a unique fingerprint.

  • Cite this

    Zhang, S., Tepedelenlioglu, C., Spanias, A., & Banavar, M. K. (2016). Node counting in wireless sensor networks. In Conference Record - Asilomar Conference on Signals, Systems and Computers (Vol. 2016-February, pp. 360-364). [7421147] IEEE Computer Society. https://doi.org/10.1109/ACSSC.2015.7421147