An Efficient Algorithm for Retrieving the Updated Copy of Data Sited on Least Hops in Wireless Sensor Network

Abstract

Sensors as data producers, record and forward the observations to base stations for further processing within the resource constraints. Over a time period of almost decade, lot of work has been carried out on retrieval of data from wireless sensor network with different aspects. In this paper a technique is provided for retrieving Updated Copy of info (Data) situated on Least Hops (UCDSLH) in wireless sensor network. The technique works well for querying the global maxima (UCDSLH) as well from the specific data centric nodes. This retrieval is at searching cost of order one O (1). Based on time complexity and energy consumption factors, for retrieval of global maxima as compared to the existing techniques, our technique is significantly efficient. As it retrieves the interested UCDSLH without flooding in existence of metadata nodes. Parameter Refresh Protocol (PRP) populates the Metadata nodes and notifies the base station about priorities of the metadata nodes. Metadata nodes have data about the sensed data stored on the Data Centric Storage (DCS) nodes. DCS – a logical collection of multiple sensors; sited on the least hops having the UCDSLH get the high priority. Base station links to the nearest available Metadata node based on signal strength. This metadata node act as intermediate channel as it points out the DCS to retrieve the UCDSLH to satisfy the query. DCSs and metadata nodes are replicated to ensure robustness. Our algorithm shows complete procedure of our technique. We simulate and evaluate our approach with necessary query analyzer implemented in C++.