Scheduling Sensor Nodes for Enhancing Energy Savings in a Wireless Sensor Network

Energy and delay are critical issues to any WSN. Among the many solutions till date, intelligent data forwarding has been extensively researched. This grounds us to consider a query routing tree to analyze the impact of schedule-based data transmissions to the sink. On the assumption of a hierarchical topology, our algorithm analyses and compares the route tree structure generated based on a pre-schedule to the usually adopted minimum spanning tree and Dijkstra algorithm-based routing trees. Our approach also analyses the impact of considering residual energy of the nodes. We apply both residual energies as well a pre-determined schedule to transmit data and observe that the energy conservation of the nodes is increased manifold.