DocumentCode :
485273
Title :
Study of the minimum spanning hyper-tree routing algorithm in wireless sensor networks
Author :
Yang Ting ; Sun Yugeng ; Wang Zhaoxia ; Zhang Juwei ; Ding Yingqiang
Author_Institution :
Sch. of Electr. Eng. & Autom., Tianjin Univ., Tianjin
fYear :
2007
fDate :
12-14 Dec. 2007
Firstpage :
245
Lastpage :
248
Abstract :
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.
Keywords :
routing protocols; wireless sensor networks; Sink node; data collection; energy-efficient routing protocols; hyper-graph theory; minimum energy consumption tree; minimum spanning hyper-tree routing algorithm; multi-nodes; robust network service; synchronous wireless sensor networks; Routing Algorithm; Spanning Hyper-Tree; Synchronous Networks; Wireless Sensor Network;
fLanguage :
English
Publisher :
iet
Conference_Titel :
Wireless, Mobile and Sensor Networks, 2007. (CCWMSN07). IET Conference on
Conference_Location :
Shanghai
ISSN :
0537-9989
Print_ISBN :
978-0-86341-836-5
Type :
conf
Filename :
4786183
Link To Document :
بازگشت