Title of article
An efficient data-centric storage method using time parameter for sensor networks
Author/Authors
Yonghun Park، نويسنده , , Dongmin Seo، نويسنده , , Jonghyeon Yun، نويسنده , , Christopher T. Ryu، نويسنده , , Jun Kim، نويسنده , , Jaesoo Yoo، نويسنده ,
Issue Information
روزنامه با شماره پیاپی سال 2010
Pages
12
From page
4806
To page
4817
Abstract
In wireless sensor networks, various schemes have been proposed to efficiently store and process sensed data. Among them, the data-centric storage (DCS) scheme is one of the most well-known. The DCS scheme distributes data regions and stores the data in the sensor that is responsible for the region. The DCS based scheme was proposed to reduce the communication cost for transmitting data and to efficiently process exact queries and range queries. Recently, a KDDCS scheme was proposed to overcome storage hot-spots by dynamically readjusting the distributed data regions to sensors based on the K-D tree. However, the existing DCS based schemes including KDDCS suffer from query hot-spots that are formed when query regions are not uniformly distributed. As a result, it reduces the lifetime of the sensor network.In this paper, we propose a new DCS based scheme, called Time-Parameterized Data-Centric Storage (TPDCS), that avoids the problems of storage hot-spots and query hot-spots. To decentralize the skewed data and queries, the data regions are assigned by a time dimension as well as data dimensions in our proposed scheme. Therefore, TPDCS extends the lifetime of sensor networks. It is shown through various experiments that our scheme outperforms the existing schemes.
Keywords
sensor network , Storage hot-spot , DCS , Query hot-spot
Journal title
Information Sciences
Serial Year
2010
Journal title
Information Sciences
Record number
1214151
Link To Document