基于空间相关性的事件驱动无线传感器网络分簇算法  

An Event Driven Clustering Algorithm Based on Spatial Correlation in Wireless Sensor Networks

作　　者：王天荆[1] 杨震[1] 胡海峰[1] 

机构地区：[1]南京邮电大学信息与信号处理研究所

出　　处：《电子与信息学报》2008年第3期699-702,共4页Journal of Electronics & Information Technology

基　　金：江苏省教育厅重点科技项目(06KJA51001)资助课题

摘　　要：分簇算法是传感器网络中减少能量消耗的一种关键技术,它能够增强网络的扩展性和延长网络的生存时间。针对传感器节点数据的空间相关性,该文提出了一种新的基于空间相关性的事件驱动传感器网络分簇算法。算法根据用户要求的误差门限及结合节点数据的空间相关性马尔可夫模型,将事件感知区域划分成虚拟极坐标等价层。每个等价层选取层内当前剩余能量最大的节点作为簇头,网络通过移动代理收集簇头感知信息,该方法减少了传输数据量,有效节省了网络能量。Clustering algorithm is a kind of key technique used to reduce energy consumption, which can increase network scalability and lifetime. Considering spatial data correlation of sensor nodes, a novel Event Driven Clustering Algorithm （EDCA） based on spatial correlation in wireless sensor networks is proposed. According to the user-provided error-tolerance threshold and spatial data correlation Markovian model, the algorithm divides the event sensing range into dummy polar coordinate equal layer. Only one node per equal layer is selected as cluster-head by present maximal remainder energy. Mobile agent collects sensing information of cluster-heads. The mechanism reduces the number of transmission and saves energy efficiently.

关 键 词：无线传感器网络 分簇算法 空间相关性 

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