基于最小生成超树的无线传感器网络路由算法研究  

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

作　　者：杨挺[1] 孙雨耕[1] 田飞[1] 张志东[1] 

机构地区：[1]天津大学电气与自动化学院,天津300072

出　　处：《传感技术学报》2007年第4期903-907,共5页Chinese Journal of Sensors and Actuators

基　　金：国家教育部博士点基金(20030056007)~~

摘　　要：设计能量有效的路由协议以延长网络生存周期,提供健壮可靠的网络服务成为资源有限无线传感器网络研究的核心问题.研究并采用超图理论,将大规模,高连通度的无线传感器网络拓扑抽象为超图模型,从而有效减少网络控制消息.并基于超图模型提出同步无线传感器网络最小生成超树路由算法,以建立数据汇聚的最小能耗树.随后理论证明MSHT-SN算法的正确性和有效性.通过仿真,基于超图模型的MSHT-SN算法较优于基于最短路树策略路由算法,其能够有效的提高数据传输成功率,并节省网络总能耗,延长网络生存周期.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.

关 键 词：无线传感器网络 路由算法 超图模型 最小生成超树 同步网络 

分 类 号：TP212.9[自动化与计算机技术—检测技术与自动化装置]