A Novel Efficient Energy and Delay Balance Ensemble Scheduling Algorithm for Wireless Sensor Networks

The main aim of the present research is to propose and implement an efficient sleep scheduling procedure for wireless sensor networks (WSNs) using two popular search techniques such as breadth first search (BFS) and color connected dominated set (CCDS) for reducing energy consumption and delay, when message is broadcasted in WSN. Since, sensor nodes have battery life constraint sleep scheduling that is used to preserve energy and have a prolong life for sensor node for monitoring events. The novelty in the present research problem is ensemble of breadth first search algorithm and color connected dominated set (CCDS) algorithm which was not considered by earlier researchers. Breadth first search (BFS) is implemented to find the minimum distance path from a sensor node and reduce the delay in transmitting the message. Color connected dominated set (CCDS) is used to transmit messages to all nodes without collision and hence minimize the energy consumption. Analysis is made between two algorithms with the same set of nodes.