Routing Algorithm for Dynamic Clustering Based on Rapid Spanning Tree

摘要

Wireless sensor networks consist of the sensor nodes with computing and wireless communication capabilities. Because the features that its own, energy' efficiency has become a key issues in wireless sensor network design. In order to improve energy efficiency, cluster and multi-hop method has been widely applied to the design of routing algorithm. In this paper, we propose a hybrid routing algorithm MRST (minimum rapid spanning tree) based on Rapid Spanning Tree-based (RST, Rapid spanning tree) by previous ideas. Based on clustering, the all cluster head be constructed a minimum rapid spanning tree. The multi-hop network based on Rapid Spanning Tree, can effectively reduce the transmission path, saving energy consumption, and ultimately reach the goal to extend the network lifetime. Through two simulation experiments show that MRST algorithm has reduced the tree convergence time, and extend the network lifetime.