一种压缩感知的异构传感网络分簇路由算法  

A Compressed Sensing Clustering Routing Algorithm for Heterogeneous Sensor Networks

作　　者：蒋文贤[1] 赖超[1] 

机构地区：[1]华侨大学计算机科学与技术学院,厦门361021

出　　处：《小型微型计算机系统》2015年第2期252-256,共5页Journal of Chinese Computer Systems

基　　金：福建省科技计划重点项目(2014H0030)资助;泉州市科技计划重点项目(2014Z102)资助

摘　　要：分簇路由算法对用于事件监测的无线传感器网络具有较好的节能性,压缩算法可以降低节点传输的数据量,但增加了分簇簇首的计算能耗和汇聚中心的时间复杂度,而由高端节点担任簇首可以实现能量均衡并提升服务性能.设计了一种适应多级能量异构网络的压缩感知算法,簇首当选的概率由异构节点的剩余能量大小确定,簇首负责收集簇内成员节点的数据,进行稀疏、压缩,减少传输的数据量,簇间路由采用多跳最小的代价函数传输,而汇聚中心通过重构算法将少量信息解码得出原始数据.仿真结果表明,该算法能有效解码目标源,减少死亡节点数量,并且能均衡异构节点的能耗.The clustering routing algorithm has better energy efficiency for event monitoring in wireless sensor networks （WSN）, com- pression algorithm can reduce the amount of data of nodes＇ communication, but increase the energy consumption calculation of cluster head and the time complexity of the fusion center in clustering hierarchy. While choosing high-end node as cluster head can achieve energy-balanced and improve service performance. We propose a compressed sensing clustering routing algorithm for the multilever energy of heterogeneous wireless sensor networks. The algorithm determines the probability of cluster head election according to the energy of heterogeneous nodes, then sparses and compress the gathering data of nodes in cluster to reduce the amount of communica- tion that needs to transmit data to the fusion center. , inter-cluster routing with the minimum cost function transmission. The fusion cen- ter can decode the original data from a few data of cluster head using reconstruction algorithm. Simulation results show that this algo- rithm effectively decode target source, reduce death number of nodes, but takes full advantage of heterogeneous node＇s energy balance.

关 键 词：异构无线传感器网络 路由算法 压缩感知 重构 

分 类 号：TP393[自动化与计算机技术—计算机应用技术]