Precise localization has attracted considerable interest in Wireless Sensor Networks (WSNs) localization systems. Due to the internal or external disturbance, the existence of the outliers, including both the distance outliers and the anchor outliers, severely decreases the localization accuracy. In order to eliminate both kinds of outliers simultaneously, an outlier detection method is proposed based on the maximum entropy principle and fuzzy set theory. Since not all the outliers can be detected in the detection process, the Maximum Entropy Function (MEF) method is utilized to tolerate the errors and calculate the optimal estimated locations of unknown nodes. Simulation results demonstrate that the proposed localization method remains stable while the outliers vary. Moreover, the localization accuracy is highly improved by wisely rejecting outliers.
To obtain efficient data gathering methods for wireless sensor networks (WSNs), a novel graph based transform regularized (GBTR) matrix completion algorithm is proposed. The graph based transform sparsity of the sensed data is explored, which is also considered as a penalty term in the matrix completion problem. The proposed GBTR-ADMM algorithm utilizes the alternating direction method of multipliers (ADMM) in an iterative procedure to solve the constrained optimization problem. Since the performance of the ADMM method is sensitive to the number of constraints, the GBTR-A2DM2 algorithm obtained to accelerate the convergence of GBTR-ADMM. GBTR-A2DM2 benefits from merging two constraint conditions into one as well as using a restart rule. The theoretical analysis shows the proposed algorithms obtain satisfactory time complexity. Extensive simulation results verify that our proposed algorithms outperform the state of the art algorithms for data collection problems in WSNs in respect to recovery accuracy, convergence rate, and energy consumption.
To adapt to sense signals of enormous diversities and dynamics, and to decrease the reconstruction errors caused by ambient noise, a novel online dictionary learning method-based compressive data gathering (ODL-CDG) algorithm is proposed. The proposed dictionary is learned from a two-stage iterative procedure, alternately changing between a sparse coding step and a dictionary update step. The self-coherence of the learned dictionary is introduced as a penalty term during the dictionary update procedure. The dictionary is also constrained with sparse structure. It’s theoretically demonstrated that the sensing matrix satisfies the restricted isometry property (RIP) with high probability. In addition, the lower bound of necessary number of measurements for compressive sensing (CS) reconstruction is given. Simulation results show that the proposed ODL-CDG algorithm can enhance the recovery accuracy in the presence of noise, and reduce the energy consumption in comparison with other dictionary based data gathering methods.
A310-resistant localization in the presence of malicious nodes is an important issue in wireless sensor networks (WSNs). In this paper, an attack-resistant localization algorithm based on L1 regularization is proposed. By introducing unknown perturbations into the traditional path loss model, attack model is built and the sparsity of malicious attacks is exploited to formulate the secure localization problem as a nonlinear constrained optimization problem. This model allows estimating locations and recognizing attacks simultaneously. To solve the problem, the projected gradient search algorithm with Backtracking-Armijo line search is adopted. Finally, the simulation results show that the proposed algorithms can achieve higher localization accuracy than nonlinear least square method in the presence of malicious nodes, and the proposed method or the improved one can be adaptively chosen in terms of energy and accuracy requirements.
To enable efficient and accurate secure localisation in wireless sensor networks, a sparsity‐incorporated localisation algorithm is proposed. Unlike most of the existing schemes, the localisation problem is solved in an L1 minimisation framework which is based on the attack sparsity and the linearisation of a distance measurement model including the bogus data from malicious anchors. The localisation errors, speed and detection rates of the scheme are analysed in the simulations. Results demonstrate that the method can simultaneously achieve target localisation and malicious anchor identification in an efficient and accurate way.