论文部分内容阅读
分簇式路由是无线传感器网络路由协议研究的重点,本文提出一种新的基于最小生成树的非均匀分簇路由算法,该算法利用EECS路由协议产生大小非均匀的簇,簇内结点通过单跳的方式将数据发送给簇首结点,所有簇首结点构成最小生成树路由网络,并通过树内结点的多跳通信,最终将数据发送给sink结点.实验证明,本文算法与EECS相比能够更加有效地降低整个网络的能量消耗,延长网络的生命周期.
Clustering routing is the research focus of wireless sensor networks routing protocols. In this paper, we propose a new non-uniform clustering routing algorithm based on minimum spanning tree. This algorithm uses EECS routing protocol to generate heterogeneous clusters, One-hop way to send data to the cluster head node, all the cluster head nodes constitute the minimum spanning tree routing network, and through multi-hop communication within the tree nodes, the final data will be sent to the sink node.Experiments show that this algorithm Compared with EECS can more effectively reduce the energy consumption of the entire network to extend the life cycle of the network.