摘要
针对无线传感器网络中传感器节点能量有限的特点,本文介绍了一种基于极大权的极小支配集的分簇组网算法,考虑到能量有效性,算法由SINK节点发起,泛洪网络中每个节点,优先选取剩余能量高的节点作为簇头节点与中继节点,最终得到以SINK节点为树根的簇树.并周期性轮换簇头,从而能够形成一个高效的通信骨干网,有效延长网络的生存期.仿真结果表明了算法的有效性.
Because of the energy finity of wireless sensor networks,in this paper, we describe a clustering algorithm based on maximal weighted minimal domaining set for it. thinking of the energy efficiency, The algorithm begin with the SINK node, and broadcasts messages in the network. The nodes with more energy will be selected as cluster head or relay node preferentially, finally, we can get a cluster tree, the SINK node is the boot. On the side, the algorithm is executed periodically, so a highly efficient communication backbone networks can be constructed, and the survivability can he prolonged. The simulation result proves the effectivity of the algorithm.
出处
《传感技术学报》
CAS
CSCD
北大核心
2007年第2期377-381,共5页
Chinese Journal of Sensors and Actuators
基金
教育部博士学科点基金项目资助(20030056007)
关键词
无线传感器网络
分簇
簇树
生成树
极小支配集
wireless sensor networks
clustering
cluster tree
created tree
minimal domaining set