Balanced Energy Efficient Spanning Tree Approaches for Wireless Sensor Network with Sleep Scheduling Algorithm

Abstract

We Propose Balanced, Localized, Robust, Dynamic state changing and energy efficient spanning tree approaches for Wireless sensor networks which we call Balanced energy Efficient Spanning Tree with Sleep scheduling(BEESP-SS). They are based on the topologies. It is constructed using RNG. Localized Minimum Spanning tree is constructed based on these topologies(LMST).The actual routing tree is constructed based on the transmitter and receiver residual energy. We also consider different parent selection strategies while constructing routing tree and select the best among them. Our solution also involves the load balancing by measuring the energy level of the nodes in the spanning tree, because energy is drain out when large number of messages travelling through the particular node by limiting the messages travelled through the sensor nodes we can improve the lifetime of the spanning tree, it is done by partitioning the messages based on the energy level of the node in the spanning tree and redirect the messages to the some other nodes in the spanning tree. The proposed solution also adapted the Sleep Scheduling Algorithm, it wake up the sensor nodes in the network when it is needed. This paper also handles the route maintenance it includes node insertion and node deletion.

Keywords

Wireless Sensor network, Partitioning, sleep scheduling algorithm, Localized Minimum spanning tree (LMST),Relative Neighborhood Graph (RNG)

Full Text: