摘要
传感器节点体积小、成本低、电池容量有限。为了尽可能延长无线传感器网络的生命期,应该将节能降耗放在首位。分簇作为一种提高网络可扩展性的方法,在无线传感器网络中有着广泛的应用。现有分簇算法大多关注能耗和延迟,却忽视了邻近节点在数据采集上高度冗余性。考虑事件监测的空间相关性,提出一种基于相邻节点数据相关的无线传感网分簇算法。仿真实验表明,新算法能有效降低网络数据量,显著延长网络生存时间,进一步均衡网络能耗和优化网络的整体性能。
The sensor node is of small volume, low cost and limited battery capacity. In order to prolong the lifetime of wireless sensor network as long as possible, energy saving should be put in first priority. As a way to improve the scalability of the network, clustering has been widely used in wireless sensor network. Existing clustering algorithms mainly focus on the energy consumption and network delay, but ignore the high redundancy in data acquisition the adjacent nodes have. Considering the spatial correlation of event monitoring, we propose a cluster algorithm of wireless sensor network, which is based on data correlation of the adjacent nodes. Simulation experiment shows that the new algorithm can effectively reduce the amount of network data, significantly prolong the survival time of network, and further balance network energy consumption as well as optimise the overall performance of network
出处
《计算机应用与软件》
CSCD
北大核心
2014年第6期108-110,126,共4页
Computer Applications and Software
基金
湖南省科技计划项目(2011FJ3074)
关键词
无线传感器网络
分簇算法
空间相关性
矢量量化
Wireless sensor networks Clustering algorithm Spatial correlation Vector quantification