Distributed Database Management Techniques for Wireless Sensor Networks

Abstract

Abstract-In sensor networks, the large amount of data nsor reWireless Se composed of a large nu activities are sometimes not negligible in energy consumption generated by sensors greatly influences the lifetime of the network. In order to manage this amount of sensed data in an energy-efficient way, new methods of storage and data query are needed. In this way, the distributed database approach for sensor networks is proved as one of the most energy-efficient data storage and query techniques. This paper surveys the state of the art of the techniques used to manage data and queries in wireless sensor networks based on the distributed paradigm. A classification of these techniques is also proposed. The goal of this work is not only to present how data and query management techniques have advanced nowadays, but also show their benefits and drawbacks, and to identify open issues providing guidelines for further contributions in this type of distributed architectures.

An Observation Task Chain Representation Model for Disaster Process-Oriented Remote Sensing Satellite Sensor Planning: A Flood Water Monitoring Application

“…In the sensor network stage, several sensors are deployed in various application domains of sensor networks to obtain environmental information. Planning the distribution of these sensors across different networks is critical because of the relatively complicated observation tasks in this stage [12]. However, this stage only focuses on planning the distribution of sensors among protocol-inclusive sensor networks [13].…”

A Novel Approach for Real-Time Data Management in Wireless Sensor Networks

“…In distributed data management systems, there are several methods such as in-network processing, acquisition query processing, cross-layer optimization, data-centric data or query dissemination has been proposed [7]. In case of in-network processing, Tiny DB and COUGAR [1] were the first optimization techniques for reducing the data transmission in WSNs.…”

Energy-Efficient Node Selection Algorithms with Correlation Optimization in Wireless Sensor Networks

“…For the example in Figure 1(c), CS 3 = { 1 , 7 , 8 }, 3 is the active node, and 1 , 7 , and 8 are covered nodes.…”

“…Figure 1(c) demonstrates the result as { 3 , 5 , 10 , 13 } with the proposed CSB algorithm in this paper. { 1 , 7 , 8 } is a cover set for node 3 and each node in the set is a feasible candidate regarding 3 .…”