唐菁敏, 马社方, 曹操, 张晓颍. 基于数据压缩的无线传感器网络分簇路由算法[J]. 云南大学学报(自然科学版), 2016, 38(1): 37-43. doi: 10.7540/j.ynu.20150181
引用本文: 唐菁敏, 马社方, 曹操, 张晓颍. 基于数据压缩的无线传感器网络分簇路由算法[J]. 云南大学学报(自然科学版), 2016, 38(1): 37-43. doi: 10.7540/j.ynu.20150181
TANG Jing-min, MA She-fang, CAO Cao, ZHANG Xiao-ying. Research on clustering routing algorithm for Wireless Sensor Network based on data compression[J]. Journal of Yunnan University: Natural Sciences Edition, 2016, 38(1): 37-43. DOI: 10.7540/j.ynu.20150181
Citation: TANG Jing-min, MA She-fang, CAO Cao, ZHANG Xiao-ying. Research on clustering routing algorithm for Wireless Sensor Network based on data compression[J]. Journal of Yunnan University: Natural Sciences Edition, 2016, 38(1): 37-43. DOI: 10.7540/j.ynu.20150181

基于数据压缩的无线传感器网络分簇路由算法

Research on clustering routing algorithm for Wireless Sensor Network based on data compression

  • 摘要: 针对LEACH协议、HEED协议和TEEN协议在传输数据过程中消耗过多节点能量的问题,提出了对相关数据进行时空压缩的算法,推导了簇首选择和数据压缩的算法表达式.理论分析和仿真结果表明,与LEACH、HEED协议、EABGC算法相比,数据压缩算法可以有效减少WSN冗余数据传输和节点能耗,在相同的生存期内存活的节点数多,节点能量利用率有所提高,进而达到延长传感器网络生存周期的目的.

     

    Abstract: Due to consume too much energy of the sensor nodes for the LEACH,HEED and TEEN protocol in the process of transmitting data in the WSNs,the algorithm of compressing relevant data is proposed,and the expression of selecting cluster head and data compressing is derived.Theoretical analysis and simulation results show that compared with LEACH,HEED and EABGC,the proposed algorithm can avoid transmitting relevant data repeatedly and reduce the node energy consumption effectively.Using the proposed algorithm,more nodes can be survived in the same lifetime and it can keep a low energy consumption of the nodes,so the lifetime of WSNs is prolonged.

     

/

返回文章
返回