A Virtual-Ring-Based Data Storage and Retrieval Scheme in Wireless Sensor Networks

Xingpo Ma,Jianxin Wang,Jianliang Gao,Weiping Wang

doi:10.1155/2012/763015

Abstract

In-network data storage and retrieval is one of the most important problems in wireless sensor networks. Many schemes have been proposed to solve this problem. However, most of them do not take the frequencies of event and query into consideration. In fact, the frequencies of event and query are very important factors in real applications of in-network data storage and retrieval. In this paper, we introduce a virtual-ring-based data storage and retrieval scheme, which is called VRS, to solve the problem. VRS divides the whole sensor network field into some virtual rings. According to the frequencies, one of the virtual rings is selected out as the rendezvous ring, which plays the role of a bridge between the information consumers and the information producers. Extensive experiments have been done to evaluate the performance of the proposed scheme, VRS. Simulation results show that VRS outperforms the existing work in load balance, delay of data storage and retrieval, and the lifetime of the sensor networks.

Highlights

In wireless sensor networks, full data collection [1, 2] is a traditional method for information consumers to get the useful information
The method leads to bad load balance performance, because sensor nodes around the sink node have to take much more load than other sensor nodes
We focus on the in-network data storage and retrieval problem in wireless sensor networks, where information consumers search for the desired event data produced by information producers

Summary

Introduction

Full data collection [1, 2] is a traditional method for information consumers to get the useful information. We focus on the in-network data storage and retrieval problem in wireless sensor networks, where information consumers (sinks, users) search for the desired event data produced by information producers (sources). We propose a novel in-network data storage and retrieval scheme based on the virtual ring model for wireless sensor networks, where the frequencies of event and query are considered. Simulation results show that VRS outperforms the existing work in load balance, delay of data storage and retrieval, and the lifetime of the sensor networks.

Related Work

Network Model and Assumptions

Virtual-Ring-Based In-Network Data Storage and Retrieval Scheme

Simulation Results and Analysis

Conclusion