Clustered balanced minimum spanning tree for routing and energy reduction in wireless sensor networks
Keyhan Khamforoosh · 2011
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.