Time orient LEAD based polling point selection algorithm for efficient data aggregation in wireless sensor networks

Data collection is a problem of which a detailed and indepth study has been made. It is known for numerous approaches and a variety of measures and methods that have the objective of validation. The efficacy of data collection still remains a baffling issue and a challenging task. Algorithms do exist in this area, but each considers only either a single feature or few thereof. This paper presents a time orient location energy availability data rate (LEAD) based scheduling algorithm for the improvements of the performance of data collection in wireless sensor networks. The salient feature of this method is its scheduling the sensors for the polling point on the basis of energy and location of the sensor. The method involves the identification of sensors of a small number of which one of which is chosen as the polling point. Computation of the LEAD weight for the sensors of any region is made and a tiny set with higher LEAD weight is selected. The mobile collector selects the polling point based on the LEAD weight and only one visit is done for the polling point when it has enough score and that too in a periodic manner. Data collection is done on a route whose selection is based on energy, hop, reliable routing. This scheme has the specific advantage of improving data aggregation and network lifetime maximization.