A set-membership affine projection algorithm is proposed that can estimate a complex-valued channel matrix using a set of complex-valued pilots in the presence of additive white Gaussian noise. It is shown that the algorithm converges faster than the well-known set-membership normalized least mean square algorithm (SM-NLMS) while it resolves the high steady-state error value and the complexity issues in the regular affine projection algorithm. The fast convergence of the proposed algorithm means that a shorter training sequence inside each data block is required, which in turn improves the effective bit rate. This fast convergence is more pronounced when the pilot vectors are highly correlated. We incorporated the set-membership filtering framework into our study to reduce the computational complexity of the algorithm and preserve energy in the WSNs. Other studies have shown the superiority of the adaptive filtering algorithms, and in particular the NLMS algorithm, over other alternatives in various signal processing areas in WSNs, therefore, our proposed algorithm is a powerful substitute for a variety of algorithms. In other words, the implementation of various signal processing algorithms for different purposes can be replaced with the implementation of the proposed multipurpose algorithm. In this paper, we combine the results of our previous studies and prove the convergence of the algorithm. Furthermore, the steady-state analysis in the output mean square error is presented for two cases of pilot signals, and in the conducted simulations, the MSE performance of the algorithm is compared with the regular affine projection algorithm and the SM-NLMS algorithm.