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 language | English (US) |
---|---|
Title of host publication | Conference Record - Asilomar Conference on Signals, Systems and Computers |
Publisher | IEEE Computer Society |
Pages | 360-364 |
Number of pages | 5 |
Volume | 2016-February |
ISBN (Print) | 9781467385763 |
DOIs | |
State | Published - Feb 26 2016 |
Event | 49th Asilomar Conference on Signals, Systems and Computers, ACSSC 2015 - Pacific Grove, United States Duration: Nov 8 2015 → Nov 11 2015 |
Other
Other | 49th Asilomar Conference on Signals, Systems and Computers, ACSSC 2015 |
---|---|
Country | United States |
City | Pacific Grove |
Period | 11/8/15 → 11/11/15 |
Keywords
- Average Consensus
- L2 Norm
- Node Counting
ASJC Scopus subject areas
- Computer Networks and Communications
- Signal Processing