A Cover-Up Scheme for Data-Centric Storage in Wireless Sensor Networks

In many data-centric storage techniques, each event type is stored at a corresponding hashed location. Most of them fail to deal with storage memory space due to high percentage of the load is assigned to a relatively small portion of the sensor nodes. These nodes could become a hotspot, both for communication and storage. In this paper, we propose a cover-up scheme for data-centric storage. The main idea is to generate a virtual coordinate for a storage node which is overload. The virtual coordinate will cover-up original coordinate of the storage node. Hence, GPSR routing algorithm will ignore the old storage node. Our scheme can spread storage into different sensor nodes. Simulations have shown that the cover-up scheme can reduce the energy consumption while there are a vast number of the events in sensor network or the network size is very large.