Compressed Sensing Algorithm Based on Data Fusion Tree in Wireless Sensor Networks
Huang Hai-ping①② Chen Jiu-tian①② Wang Ru-chuan①②③ Zhang Yong-can①②
①(College of Computer, Nanjing University of Posts and Telecommunications, Nanjing 210003, China) ②(Jiangsu High Technology Research Key Laboratory for Wireless Sensor Networks, Nanjing 210003, China) ③(Key Laboratory of Broadband Wireless Communication and Sensor Network Technology of Ministry of Education, Nanjing 210003, China)
摘要 针对无线传感器网络能量有限等特点，将路由策略考虑到投影矩阵的设计中，该文提出了基于数据融合树的压缩感知算法(Compressed Sensing algorithm based on Data Fusion Tree, CS-DFT)。该算法采用稀疏投影矩阵最小化通信消耗，在生成数据融合树的同时减小投影矩阵与稀疏基之间的相关度以保证数据的重构质量。仿真结果表明，该文提出的算法不仅在重构质量和能量消耗之间做到了很好的平衡，同时对于不同稀疏基下的数据也有较高的适应性。
Abstract：For the characteristic of energy-constrained in wireless sensor networks, considering routing strategy into the designing of the projection matrix, a Compressed Sensing algorithm based on Data Fusion Tree (CS-DFT) is proposed. It minimizes communication consumption by means of sparse random projection, and relevance between projection matrix and sparse basis is decreased in order to guarantee the data reconstruction quality while data fusion tree is generating. Simulation results show that, the proposed algorithm not only achieves a balance between reconstruction quality and energy consumption, but also has high adaptability to operate on a variety of data originated from different sparse basis.
2014, Vol. 36 
