无线传感网中基于卡尔曼预测的自适应压缩感知

Adaptive Compressed Sensing Based on Kalman Prediction in Wireless Sensor Networks

  • 摘要: 针对无线传感网中节点间相关性较弱但节点内相关性较强的情况,本文提出了基于卡尔曼预测的自适应压缩感知算法。在中继传输模型下,通过卡尔曼预测来决定观测节点是否发送数据,减少发送节点来构建空间稀疏性,同时在融合中心采用自适应选择中继数量的序贯重构算法,降低中继节点的传输能耗。仿真结果表明,和其他基于预测的压缩感知算法相比,本算法观测节点的计算复杂度和中继节点的传输能耗大大降低而不会带来误差的增加。

     

    Abstract: Aiming at the situation that the inter-node correlation is weak but the inner-node correlation is strong, an adaptive compressed sensing algorithm based on Kalman predictor is proposed. In a system model with relays, each sensing node selects Kalman prediction to decide whether to be active, so that the number of active nodes decreases and is sparse in the spatial domain. Morever, a sequential reconstruction algorithm which chooses the number of relays adaptively is proposed in the fusion center to reduse the energy consumption of the relays. Simulation results demonstrate that, compared with other compressed sensing algorithm based on predictors, the calculation complexity of the sensing nodes and the energy consumption of the relays of the proposed algorithm are much lower without any additional error.

     

/

返回文章
返回