作者投稿和查稿 主编审稿 专家审稿 编委审稿 远程编辑

计算机工程 ›› 2010, Vol. 36 ›› Issue (10): 118-120. doi: 10.3969/j.issn.1000-3428.2010.10.040

• 网络与通信 • 上一篇    下一篇

一种适用于移动节点的事件驱动分簇算法

何 璇,宋 勇,郝 群   

  1. (北京理工大学光电学院,北京 100081)
  • 收稿日期:1900-01-01 修回日期:1900-01-01 出版日期:2010-05-20 发布日期:2010-05-20

Event Driven Clustering Algorithm Suitable for Mobile Nodes

HE Xuan, SONG Yong, HAO Qun   

  1. (School of Optoelectronics, Beijing Institute of Technology, Beijing 100081)
  • Received:1900-01-01 Revised:1900-01-01 Online:2010-05-20 Published:2010-05-20

摘要: 提出一种适用于移动无线传感器网络节点的事件驱动分簇算法,使用簇头间能量筛选法选举簇头,并加入事件驱动机制,能够使节点在有突发事件发生的情况下,对网络中的簇进行基于事件区域的重组,以减少数据冗余。建立相应的仿真实验模型,对运动节点的分簇情况进行动态跟踪及分析。实验结果表明,该算法能够满足事件驱动分簇的要求,能量消耗比经典算法更均衡。

关键词: 无线传感器网络, 移动节点, 分簇

Abstract: This paper proposes an event driven clustering algorithm for Wireless Sensor Network(WSN) via choosing the cluster-head with a head-power-tradeoff algorithm and joining the event driven mechanism. The event driven algorithm can rebuild clusters in the random event areas when sudden event happens, and can reduce data redundancy and improve network efficiency. It builds a simulation model for analyzing the trace and dynamic clustering situation of nodes. Experimental results show that the algorithm can require the demands of the event driven clustering, it consumes balanced energy compared with traditional algorithms.

Key words: Wireless Sensor Network(WSN), mobile node, clustering

中图分类号: