An Energy-Efficient Route Selection Using Optimum Deterministic Data Gathering Sub-Path Finding for Wireless Sensor Network

Wireless Sensor Networks of energy efficiency play an important role in determining the life of the network. Wireless Sensor Network (WSN) is known for its less energy consumption property and is known as a highly resource-constrained network. The advantage of using a mobile sink is to reduce the node's energy consumption and prevent the formation of Energy in the Wireless Sensor Network (WSN). Despite these advantages, all of the detected data must be collected in a given time limit, especially in the path of delay-sensitive applications. Data aggregation is necessary for wireless sensor networks that handle fields between base stations and sink nodes. In today's data collection agencies, nodes close to the sink share the sink with all other nodes and receive data from it. Data aggregation processing is used to improve the capacity and efficiency of existing systems. In previous results, the potential for data loss has impaired certain efficiencies and performance is reduced due to energy loss. To deal with this problem, a novel Optimum Deterministic Data Gathering Sub-Path Finding (ODDGSPF) algorithm Sensor and geometrical characteristics of the communication disc based on the data collection path have been proposed. This maximizes the data collection by optimizing the data for transferring data acquisition sub-route selection and route optimization jointly to reduce energy consumption. Mobile Sink (MS) is to analyses the Optimum Deterministic Data Gathering Sub-Path Finding (ODDGSPF) algorithm using neighbor path or sub-path. It provides an efficient route to data collected in conjunction with the MS with the center path of the routing. The proposed method is evaluated with the parameters like throughput performance, end to end delay performance, Energy consumption and network life time.