TY - GEN
T1 - Distributed demodulation using consensus averaging in wireless sensor networks
AU - Zhu, Hao
AU - Cano, Alfonso
AU - Giannakis, Georgios B.
PY - 2008
Y1 - 2008
N2 - This paper deals with demodulation of space-timetransmissions from a multi-antenna access point to a network of spatially distributed wireless sensors. Distributed demodulation algorithms are developed by achieving network-wide consensus on the average of (cross-) covariances of locally available per sensor received data vectors with the channel matrix, which constitute sufficient statistics for maximum likelihood demodulation. By reaching consensus on such average terms, each sensor can attain demodulation performance as if all the information was available at a centralized unit. Different from existing distributed hypotheses testing schemes whose complexity grows exponentially with the problem dimension, the novel consensusbased demodulator incurs quadratic complexity. Inter-sensor link imperfections due to additive noise and random link failures are also accounted for. Consensus in these cases is achieved in the mean sense with bounded variance, and in the mean-square error sense, respectively. Simulated tests verify the analytical claims. Interestingly, only a few consensus iterations suffice for the novel distributed demodulator to approach the performance of its centralized benchmark.
AB - This paper deals with demodulation of space-timetransmissions from a multi-antenna access point to a network of spatially distributed wireless sensors. Distributed demodulation algorithms are developed by achieving network-wide consensus on the average of (cross-) covariances of locally available per sensor received data vectors with the channel matrix, which constitute sufficient statistics for maximum likelihood demodulation. By reaching consensus on such average terms, each sensor can attain demodulation performance as if all the information was available at a centralized unit. Different from existing distributed hypotheses testing schemes whose complexity grows exponentially with the problem dimension, the novel consensusbased demodulator incurs quadratic complexity. Inter-sensor link imperfections due to additive noise and random link failures are also accounted for. Consensus in these cases is achieved in the mean sense with bounded variance, and in the mean-square error sense, respectively. Simulated tests verify the analytical claims. Interestingly, only a few consensus iterations suffice for the novel distributed demodulator to approach the performance of its centralized benchmark.
KW - Consensus averaging
KW - Distributed demodulation
KW - Wireless sensor networks (WSNs)
UR - http://www.scopus.com/inward/record.url?scp=70349687122&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=70349687122&partnerID=8YFLogxK
U2 - 10.1109/ACSSC.2008.5074599
DO - 10.1109/ACSSC.2008.5074599
M3 - Conference contribution
AN - SCOPUS:70349687122
SN - 9781424429417
T3 - Conference Record - Asilomar Conference on Signals, Systems and Computers
SP - 1170
EP - 1174
BT - 2008 42nd Asilomar Conference on Signals, Systems and Computers, ASILOMAR 2008
T2 - 2008 42nd Asilomar Conference on Signals, Systems and Computers, ASILOMAR 2008
Y2 - 26 October 2008 through 29 October 2008
ER -