Title :
Clustered balanced minimum spanning tree for routing and energy reduction in wireless sensor networks
Author :
Khamforoosh, Keyhan
Author_Institution :
Dept. of Comput. Eng., Islamic Azad Univ., Sanandaj, Iran
Abstract :
Wireless sensor networks are thousands micro sensor nodes that energy consumption is one of the most important constraints about them. These nodes have very small dimensions so for producing their energy; we can only use batteries with limited power. We know that the problem of energy reduction is always challenging in these networks. Routing is one of the issues that can reduce energy reduction. We proposed a new method for routing in wireless sensor networks in this paper that attempts to add nodes which have the minimum distances from each other instead of using the traditional routing methods. In our method, we divide nodes to some clusters according to LEACH algorithm then cluster heads create minimum spanning tree according to Prim algorithm. Continuously the tree is balanced according to AVL algorithm. Simulation results show that our proposed algorithm is very well for big area.
Keywords :
telecommunication network routing; trees (mathematics); wireless sensor networks; AVL algorithm; LEACH algorithm; Prim algorithm; cluster heads; clustered balanced minimum spanning tree; energy reduction; microsensor nodes; routing reduction; wireless sensor networks; Base stations; Clustering algorithms; Energy consumption; Routing; Vegetation; Wireless communication; Wireless sensor networks; LEACH; PEGASIS; energy consumption; network; routing; sensor; wireless;
Conference_Titel :
Wireless Technology and Applications (ISWTA), 2011 IEEE Symposium on
Conference_Location :
Langkawi
Print_ISBN :
978-1-4577-1496-2
DOI :
10.1109/ISWTA.2011.6089553