JOURNAL ARTICLE

Distributed LCMV beamforming in wireless sensor networks with node-specific desired signals

Abstract

We consider distributed linearly constrained minimum variance (LCMV) beamforming in a wireless sensor network. Each node computes an LCMV beamformer with node-specific constraints, based on all sensor signals available in the network. A node has a local sensor array, and compresses its sensor signals to a signal with fewer channels, which is then shared with other nodes in the network. The compression rate depends inversely on the total number of linear constraints. Even though a significant compression is obtained, each node is able to generate the same outputs as a centralized LCMV beamformer, as if all sensor signals are available to every node. Since the distributed LCMV algorithm exploits a similar parametrization as previously developed distributed unconstrained MMSE signal estimation algorithms, it has similar dynamics and convergence properties. We provide simulation results to demonstrate the optimality and convergence of the algorithm. © 2011 IEEE.

Keywords:
Beamforming Wireless sensor network Node (physics) Computer science Sensor node Convergence (economics) SIGNAL (programming language) Wireless Algorithm Brooks–Iyengar algorithm Wireless network Key distribution in wireless sensor networks Computer network Telecommunications Engineering

Metrics

5
Cited By
1.42
FWCI (Field Weighted Citation Impact)
8
Refs
0.82
Citation Normalized Percentile
Is in top 1%
Is in top 10%

Citation History

Topics

Advanced Adaptive Filtering Techniques
Physical Sciences →  Engineering →  Computational Mechanics
Direction-of-Arrival Estimation Techniques
Physical Sciences →  Computer Science →  Signal Processing
Speech and Audio Processing
Physical Sciences →  Computer Science →  Signal Processing

Related Documents

© 2026 ScienceGate Book Chapters — All rights reserved.