Attribute Allocation and Retrieval Scheme for Large-Scale Sensor Networks |
| |
Authors: | Ratnabali Biswas Kaushik Chowdhury Dharma P Agrawal |
| |
Institution: | (1) OBR Research Center for Distributed and Mobile Computing, Department of ECECS, University of Cincinnati, Cincinnati, OH 45221-0030, USA;(2) OBR Research Center for Distributed and Mobile Computing, Department of ECECS, University of Cincinnati, Cincinnati, OH 45221-0030, USA |
| |
Abstract: | Wireless sensor network is an emerging technology that enables remote monitoring of large geographical regions. In this paper, we address the problem of distributing attributes over such a large-scale sensor network so that the cost of data retrieval is minimized. The proposed scheme is a data-centric storage scheme where the attributes are distributed over the network depending on the correlations between them. The problem addressed here is similar to the Allocation Problem of distributed databases. In this paper, we have defined the Allocation Problem in the context of sensor networks and have proposed a scheme for finding a good distribution of attributes to the sensor network. We also propose an architecture for query processing given such a distribution of attributes. We analytically determine the conditions under which the proposed architecture is beneficial and present simulation results to demonstrate the same. To the best of our knowledge, this is the first attempt to determine an allocation of attributes over a sensor network based on the correlations between attributes. |
| |
Keywords: | Data-centric storage allocation problem storage node control node correlation tree aggregation tree hard threshold soft threshold update epoch |
本文献已被 SpringerLink 等数据库收录! |
|