Research And Design Of Data Query Processing Based On DCS Storage Policy In Wireless Sensor Network

This paper mainly studies how wireless sensor networks make efficient use of the nodes' limited energy to do data querying under data-centric storage policy (Data-Centric Storage, DCS). ZDDCS (Zone-Divided DCS) and a algorithm to select nodes that answer similar query with the lowest energy consumption—DCSA(Dynamic-Based Candidate Selection Algorithm) is proposed.We do research and analysis of the sensor network data storage method and give the best application situation that DCS storage strategy used. We analyze some existing data storage and index technique for wireless sensor network, then, point out the deficiency of relative algorithms and present some improvements. Traditional DCS system transmits data over long distances lead to excessive energy consumption and may generate hotspot problem. In order to solve these problems, this paper presents Zone-Divided DCS algorithm and gives corresponding storage algorithm and query plan. In order to reducing the distance from storage node to sensing node and the burden of storage node, ZDDCS limited data storage within the subregion. At the same time, algorithm use lazy storage mechanism to reduce the amount of store data. Aim at the deficiency of similar-aware query processing algorithm(SAQP), we improve the candidate selection algorithm in defining priorities of materialized node first, then proposed dynamic-based candidate selection algorithm to compute the most suitable node to answer similar query .We establish the simulation environment and write a large number of the simulation programs to simulate the improving algorithm. The experiment results show that that the larger the number of queries is and the larger network is, the better the effect of the improving algorithm is.