Efficient Data Gathering Methods in Wireless Sensor Networks Using GBTR Matrix Completion
AbstractTo 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. View Full-Text
Share & Cite This Article
Wang, D.; Wan, J.; Nie, Z.; Zhang, Q.; Fei, Z. Efficient Data Gathering Methods in Wireless Sensor Networks Using GBTR Matrix Completion. Sensors 2016, 16, 1532.
Wang D, Wan J, Nie Z, Zhang Q, Fei Z. Efficient Data Gathering Methods in Wireless Sensor Networks Using GBTR Matrix Completion. Sensors. 2016; 16(9):1532.Chicago/Turabian Style
Wang, Donghao; Wan, Jiangwen; Nie, Zhipeng; Zhang, Qiang; Fei, Zhijie. 2016. "Efficient Data Gathering Methods in Wireless Sensor Networks Using GBTR Matrix Completion." Sensors 16, no. 9: 1532.
Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.