计算机与现代化 ›› 2020, Vol. 0 ›› Issue (09): 1-5.doi: 10.3969/j.issn.1006-2475.2020.09.001

• 数据库与数据挖掘 •    下一篇

WSN中基于压缩感知的分簇数据收集算法

  

  1. (扬州大学广陵学院机械电子工程系,江苏扬州225000)
  • 收稿日期:2020-02-07 出版日期:2020-09-24 发布日期:2020-09-24
  • 作者简介:张蕾(1991—),女,江苏扬州人,讲师,硕士,研究方向:机器学习,数据挖掘,E-mail: zhangleiyzu@163.com; 崔娟娟(1989—),女,讲师,硕士,研究方向:模式识别,E-mail: 873950185@qq.com; 李晶晶(1992—),女,助教,硕士,研究方向:密码学,E-mail: 1355563583@qq.com。
  • 基金资助:
    扬州大学广陵学院自然科学研究项目(ZKZD19001)

A Clustering Data Collection Algorithm in WSN Based on Compressed Sensing

  1. (Department of Mechanical and Electronic Engineering, Guangling Gollege, Yangzhou University, Yangzhou 225000, China)
  • Received:2020-02-07 Online:2020-09-24 Published:2020-09-24

摘要: 为减少无线传感器网络的数据通信量和能量消耗,基于WSN节点数据时空相关性的特性,提出一种将K-means均衡分簇和CS理论相结合的数据收集方法。首先,通过K-means聚类算法均匀划分网络成簇。然后,各簇首对采集到的数据进行基于时空相关性的压缩感知并传输至基站Sink节点。最后,Sink节点采用OMP算法对收集到的数据进行精准重构。仿真结果表明,该算法有效减少了无线传感器网络的数据通信量和压缩感知算法重构过程所需要的观测量。

关键词: 无线传感器网络, K-means均衡分簇, 压缩感知

Abstract: In order to reduce the wireless sensor network transmissions and its energy consumption, a data collection method combining K-means balanced clustering and Compressed Sensing (CS) theory is proposed based on the characteristics of spatio-temporal correlation of WSN node data. Firstly, K-means clustering algorithm is used to divide the network into clusters. Then, each cluster head node transfers the collected data to the Sink node of the base station based on the spatial-temporal CS. Finally, Sink node uses OMP algorithm to accurately reconstruct the collection data. The simulation results show that this algorithm effectively reduces the data traffic of wireless sensor network and measurement required in the reconstruction of compressed sensing algorithm.

Key words: wireless sensor network, K-means clustering algorithm, compressed sensing

中图分类号: