Previous [ 1] [ 2] [ 3] [ 4] [ 5] [ 6] [ 7] [ 8] [ 9] [ 10] [ 11] [ 12] [ 13] [ 14] [ 15] [ 16] [ 17] [ 18] [ 19]


Journal of Information Science and Engineering, Vol. 25 No. 5, pp. 1525-1537 (September 2009)

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

Department of Information Management
Tatung University
Taipei, 104 Taiwan
+Department of Computer Science and Information Engineering
Tamkang University
Tamsui, 251 Taiwan

One critical problem in wireless sensor networks is how to make the effective use of the vast amount of data by providing sensor and sink nodes with efficient data storing and retrieving, respectively. Several data-centric storage techniques had been proposed to exploit data storing and retrieving, but all of them failed to effectively deal with hotspot storage due to irregular sensor deployments or data distribution. In this paper, we propose a cover-up scheme for data-centric storage in wireless sensor networks. In our scheme, the storage node generates a virtual coordinate to feign that it is far away from the hash location. A geographic routing protocol forwarding an event data to a storage node will ignore the original storage node and find a new storage node whose coordinate is the closest to the hash location. Our cover-up mechanism can adjust to another storage node dynamically when a storage node is full. Simulations have shown that our cover-up scheme can reduce the energy consumption and achieve better quality of data.

Keywords: data-centric storage, energy efficiency, hash location, load balancing, quality of data, wireless sensor networks

Full Text () Retrieve PDF document (200909_13.pdf)

Received November 14, 2007; revised March 11, 2008; accepted April 3, 2008.
Communicated by Makoto Takizawa.
*A preliminary version of the paper has been published in IEEE Symposium on Computers and Communications (ISCC07), Aveiro, Portugal, July 1-4, 2007, and was supported in part by Tatung University, under grant No. B96-N05-048.