DocumentCode :
2637853
Title :
A Routing Based on Dynamic Tree Algorithm in WSNs
Author :
Jiang, Xinchun ; Deng, Yaping
Author_Institution :
Chongqing Univ. of Posts & Telecommun., Chongqing
fYear :
2008
fDate :
18-20 June 2008
Firstpage :
378
Lastpage :
378
Abstract :
Wireless sensor networks are widely used in different fields. Because of its distinguished characteristics, we must take account of a factor of energy consumed when designing routing protocol. The routing protocols of the wireless sensor networks have mainly two types: flat routing protocol such as directed diffusion and SPIN, and hierarchical routing protocol such as LEACH and its variations. In this paper, we present a routing based on dynamic tree for solving LEACH problems of both scalability and uneven distribution of cluster-heads. The simulation proves that the algorithm is able to solve these problems.
Keywords :
routing protocols; trees (mathematics); wireless sensor networks; LEACH; SPIN; directed diffusion; dynamic tree algorithm; flat routing protocol; hierarchical routing protocol; wireless sensor network; Clustering algorithms; Energy consumption; Energy efficiency; Heuristic algorithms; Military computing; Numerical analysis; Performance analysis; Routing protocols; Scalability; Wireless sensor networks;
fLanguage :
English
Publisher :
ieee
Conference_Titel :
Innovative Computing Information and Control, 2008. ICICIC '08. 3rd International Conference on
Conference_Location :
Dalian, Liaoning
Print_ISBN :
978-0-7695-3161-8
Electronic_ISBN :
978-0-7695-3161-8
Type :
conf
DOI :
10.1109/ICICIC.2008.617
Filename :
4603567
Link To Document :
بازگشت