Study of the minimum spanning hyper-tree routing algorithm in wireless sensor networks

• Main Authors: YANG, Ting, SUN, Yugeng, WANG, Zhaoxia, ZHANG, Juwei, DING, Yingqiang
• Format: text
• Language: English
• Published: Institutional Knowledge at Singapore Management University 2007
• Subjects: Routing algorithm; Spanning hyper-tree; Synchronous networks; Wireless sensor network; Operations Research, Systems Engineering and Industrial Engineering; Theory and Algorithms
• Online Access: https://ink.library.smu.edu.sg/sis_research/6695; https://ink.library.smu.edu.sg/context/sis_research/article/7698/viewcontent/2007C_Study_of_the_Minimum_Spanning_Hyper_Tree_Routing_Algorithm_in_Wireless_Sensor_Networks.pdf
• Institution: Singapore Management University

Designing energy-efficient routing protocols to effectively increase the networks' lifetime and provide the robust network service is one of the important problems in the research of wireless sensor networks. Using the hyper-graph theory, the paper represents large-scale wireless sensor networks into a hyper-graph model, which can effectively decrease the control messages in routing process. Based on this mathematic 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 from multi-nodes to Sink node. The validity of the algorithm is proved by the theatrical analysis. Finally, the simulation is proposed to prove the MSHT-SN algorithm is right and effective. It can increase the transmitting success rate and effectively save the scarce energy.