Low-complexity set-membership channel estimation for cooperative wireless sensor networks

TY - JOUR

T1 - Low-complexity set-membership channel estimation for cooperative wireless sensor networks

AU - Wang, T.

AU - Lamare, R. C. de

AU - Mitchell, P. D.

PY - 2011/7

Y1 - 2011/7

N2 - In this paper, we consider a general cooperative wireless sensor network (WSN) with multiple hops and the problem of channel estimation. Two matrix-based set-membership (SM) algorithms are developed for the estimation of complex matrix channel parameters. The main goal is to significantly reduce the computational complexity, compared with existing channel estimators, and extend the lifetime of the WSN by reducing its power consumption. The first proposed algorithm is the SM normalized least mean squares (SM-NLMS) algorithm. The second is the SM recursive least squares (RLS) algorithm called BEACON. Then, we present and incorporate an error bound function into the two channel estimation methods, which can automatically adjust the error bound with the update of the channel estimates. Steady-state analysis in the output mean-square error (MSE) is presented, and closed-form formulas for the excess MSE and the probability of update in each recursion are provided. Computer simulations show good performance of our proposed algorithms in terms of convergence speed, steady-state mean square error, and bit error rate (BER) and demonstrate reduced complexity and robustness against time-varying environments and different signal-to-noise ratio (SNR) values.

AB - In this paper, we consider a general cooperative wireless sensor network (WSN) with multiple hops and the problem of channel estimation. Two matrix-based set-membership (SM) algorithms are developed for the estimation of complex matrix channel parameters. The main goal is to significantly reduce the computational complexity, compared with existing channel estimators, and extend the lifetime of the WSN by reducing its power consumption. The first proposed algorithm is the SM normalized least mean squares (SM-NLMS) algorithm. The second is the SM recursive least squares (RLS) algorithm called BEACON. Then, we present and incorporate an error bound function into the two channel estimation methods, which can automatically adjust the error bound with the update of the channel estimates. Steady-state analysis in the output mean-square error (MSE) is presented, and closed-form formulas for the excess MSE and the probability of update in each recursion are provided. Computer simulations show good performance of our proposed algorithms in terms of convergence speed, steady-state mean square error, and bit error rate (BER) and demonstrate reduced complexity and robustness against time-varying environments and different signal-to-noise ratio (SNR) values.

UR - http://www.scopus.com/inward/record.url?scp=79960369933&partnerID=8YFLogxK

U2 - 10.1109/TVT.2011.2153884

DO - 10.1109/TVT.2011.2153884

M3 - Article

SN - 0018-9545

VL - 60

SP - 2594

EP - 2607

JO - IEEE Transactions on Vehicular Technology

JF - IEEE Transactions on Vehicular Technology

IS - 6

M1 - 5766059

ER -