Efficient Data Gathering in Wireless Sensor Networks Based on Matrix Completion and Compressive Sensing

2013/02/09 by Jiping Xiong, Jian Zhao, Xiong, Jiping +3
Computer Science · Mathematics · #FOS: Computer and information sciences #Information Theory (cs.IT) #Networking and Internet Architecture (cs.NI) #cs.IT #cs.NI #math.IT

paper · pdf · doi:10.48550/arxiv.1302.2244

arxiv created 2013/02/09 · arxiv updated 2013/02/12

Abstract

Gathering data in an energy efficient manner in wireless sensor networks is an important design challenge. In wireless sensor networks, the readings of sensors always exhibit intra-temporal and inter-spatial correlations. Therefore, in this letter, we use low rank matrix completion theory to explore the inter-spatial correlation and use compressive sensing theory to take advantage of intra-temporal correlation. Our method, dubbed MCCS, can significantly reduce the amount of data that each sensor must send through network and to the sink, thus prolong the lifetime of the whole networks. Experiments using real datasets demonstrate the feasibility and efficacy of our MCCS method.

Related

• Application of Compressive Sensing Techniques in Distributed Sensor Networks: A Survey
• Spatio-Temporal Data Correlation with Adaptive Strategies in Wireless Sensor Networks
• Energy-Efficient Data Collection in Clustered Wireless Sensor Networks employing Distributed DCT
• Robust Detection of Random Events with Spatially Correlated Data in Wireless Sensor Networks via Distributed Compressive Sensing
• 1-bit Compressive Data Gathering for Wireless Sensor Networks