Next Article in Journal
Electronic Nose Testing Procedure for the Definition of Minimum Performance Requirements for Environmental Odor Monitoring
Next Article in Special Issue
Assessment of Data Fusion Algorithms for Earth Observation Change Detection Processes
Previous Article in Journal
Markov Task Network: A Framework for Service Composition under Uncertainty in Cyber-Physical Systems
Previous Article in Special Issue
Sensor Data Fusion with Z-Numbers and Its Application in Fault Diagnosis
Article Menu

Export Article

Open AccessArticle
Sensors 2016, 16(9), 1532; doi:10.3390/s16091532

Efficient Data Gathering Methods in Wireless Sensor Networks Using GBTR Matrix Completion

School of Instrumentation Science and Opto-Electronics Engineering, Beihang University, Beijing 100191, China
*
Author to whom correspondence should be addressed.
Academic Editor: Xue-Bo Jin
Received: 21 July 2016 / Revised: 8 September 2016 / Accepted: 13 September 2016 / Published: 21 September 2016
(This article belongs to the Special Issue Advances in Multi-Sensor Information Fusion: Theory and Applications)
View Full-Text   |   Download PDF [5355 KB, uploaded 21 September 2016]   |  

Abstract

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. View Full-Text
Keywords: wireless sensor networks; data gathering; compressive sensing; matrix completion; graph based transform; ADMM; A2DM2 wireless sensor networks; data gathering; compressive sensing; matrix completion; graph based transform; ADMM; A2DM2
Figures

Figure 1

This is an open access article distributed under the Creative Commons Attribution License which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited. (CC BY 4.0).

Scifeed alert for new publications

Never miss any articles matching your research from any publisher
  • Get alerts for new papers matching your research
  • Find out the new papers from selected authors
  • Updated daily for 49'000+ journals and 6000+ publishers
  • Define your Scifeed now

SciFeed Share & Cite This Article

MDPI and ACS Style

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.

Show more citation formats Show less citations formats

Note that from the first issue of 2016, MDPI journals use article numbers instead of page numbers. See further details here.

Related Articles

Article Metrics

Article Access Statistics

1

Comments

[Return to top]
Sensors EISSN 1424-8220 Published by MDPI AG, Basel, Switzerland RSS E-Mail Table of Contents Alert
Back to Top