Study of the Minimum Spanning Hyper-Tree Routing Algorithm in Wireless Sensor Networks

Abstract

Designing energy-efficient routing protocols to effectively increase the networks lifetime and provide the robust network service is the important problem in the research of wireless sensor networks.Using the hypergraph theory,the paper represents the large-scale wireless sensor networks into the hypergraph model,which can effectively decrease the control messages in routing process.Based on the hypergraph model,the paper presents the minimum spanning hyper-tree routing algorithm in synchronous wireless sensor networks(MSHT-SN),which builds a minimum energy consumption tree for data collection.The validity of the algorithm is proved by the theatrical analysis.And the simulation presents the MSHT-SN algorithm is better than traditional shorting path tree routing algorithm.It can increase the transmitting success rate and effectively save the scarce energy.