By Topic

Design of Low-Overhead Cooperative Beamforming for Information Relaying in Wireless Sensor Networks Under Imperfect Quantized SNR of Source-to-Relay Links

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$33 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

4 Author(s)
Jwo-Yuh Wu ; Department of Electrical and Computer Engineering, National Chiao Tung University, Taiwan ; Chung-Hsuan Hu ; Tsang-Yi Wang ; Shang-Ho Tsai

We consider a wireless sensor network employing cooperative beamforming for information relaying. To reduce the signaling overhead, each relay node quantizes the SNR of the source-to-relay (S-R) link into one bit, which is then transmitted through a binary symmetric channel (BSC) with a known crossover probability to the destination. Given the set of the error-corrupted one-bit messages received at the destination, the beamforming design criterion is the maximization of the expected receive SNR, averaged over the conditional bit-flipping distributions of BSCs. We derive an analytic expression for the considered SNR metric, which is a complicated function of the beamforming weights. To facilitate analysis, we further derive a tractable lower bound for the conditional average SNR. By conducting maximization with respect to this lower bound, a closed-form sub-optimal beamformer can be obtained as a solution to a generalized eigenvalue problem. Computer simulations are used to illustrate the performance of the proposed scheme.

Published in:

IEEE Transactions on Signal Processing  (Volume:61 ,  Issue: 6 )