传感器网络中一种基于簇的路由算法的研究

Research on a Routing Algorithm Based on Clustering for Sensor Networks

为了降低无线传感器网络中节点的能量消耗,提高网络生存期,提出了一种基于簇的路由算法。该算法首先采用K均值动态聚类算法将网络分簇,靠近Sink节点处具有更多的簇;其次利用数据汇聚路由算法寻找从簇头节点到Sink节点的路由;最后由当前簇头根据节点剩余能量及邻居节点的位置重新选择下一轮的簇头,并由新簇头形成簇间路由。仿真计算证明该算法是合理有效的,达到簇内节点能量均衡消耗的目的,同传统分簇算法相比,具有更长的网络生存期和更低的通信能耗。

A routing algorithm based on clustering for wireless sensors networks（WSNs） was presented to reduce the energy consumption of nodes and prolong the network lifetime. Firstly, the algorithm uses K-means cluster to obstain clusters. Secondly, the algorithm searches for routing from cluster to Sink node by using data convergence routing algorithm. Finally, the current cluster-head chooses cluster-head independently according to the amount of energy left at the node and the situation of node. The simulation results show that the algorithm is rational and efficient, which balances the energy consumption in cluster, and obstains longer network lifetime than that of traditional cluster algorithm.