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 |
Fingerprint
Keywords
- Average Consensus
- L2 Norm
- Node Counting
ASJC Scopus subject areas
- Computer Networks and Communications
- Signal Processing
Cite this
Node counting in wireless sensor networks. / Zhang, Sai; Tepedelenlioglu, Cihan; Spanias, Andreas; Banavar, Mahesh K.
Conference Record - Asilomar Conference on Signals, Systems and Computers. Vol. 2016-February IEEE Computer Society, 2016. p. 360-364 7421147.Research output: Chapter in Book/Report/Conference proceeding › Conference contribution
}
TY - GEN
T1 - Node counting in wireless sensor networks
AU - Zhang, Sai
AU - Tepedelenlioglu, Cihan
AU - Spanias, Andreas
AU - Banavar, Mahesh K.
PY - 2016/2/26
Y1 - 2016/2/26
N2 - 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.
AB - 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.
KW - Average Consensus
KW - L2 Norm
KW - Node Counting
UR - http://www.scopus.com/inward/record.url?scp=84969780681&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=84969780681&partnerID=8YFLogxK
U2 - 10.1109/ACSSC.2015.7421147
DO - 10.1109/ACSSC.2015.7421147
M3 - Conference contribution
AN - SCOPUS:84969780681
SN - 9781467385763
VL - 2016-February
SP - 360
EP - 364
BT - Conference Record - Asilomar Conference on Signals, Systems and Computers
PB - IEEE Computer Society
ER -