Abstract

Storing, collecting and querying data across miniaturized battery powered Wireless Sensor Networks (WSN) is a key research focus today. Distributed Data-Centric Storage (DCS), an alternate to External Storage (ES) and Local Storage (LS), is thought to be a promising and efficient storage and search mechanism. There has been a growing interest in understanding and optimizing WSN DCS schemes in recent years, where the range query mechanism, similarity search, load balancing, multi-dimensional data search, as well as limited and constrained resources have driven this line of research. In this paper, an extensive state-of-the-art study is provided including the prime WSN DCS schemes, challenges that inspired these schemes, as well as drawbacks and shortcomings of existing solutions. In contrast to previous surveys that briefly discuss the contribution of a few WSN DCS mechanisms, we provide a thematic taxonomy in which schemes are classified according to the problems dealt with including range query, similarity search, data aggregation, sensor network field non-uniformity, multi-replication, load balancing and routing algorithm.

Highlights

  • Research into sensor networks has increased over the last twenty years

  • In this paper we provide a thematic classification that presents Data-Centric Storage (DCS) schemes in a different light

  • Liao, et al propose a grid-based Dynamic Load Balancing (DLB) approach that relies on two schemes: (1) A cover-up scheme to deal with the problem of a storage node whose memory space is depleted and (2) multi-threshold levels to achieve load balancing in each grid and all nodes get load balanced

Read more

Summary

Introduction

Research into sensor networks has increased over the last twenty years. A logical extension of the research carried out into sensor networks has been into the use of wireless transmission to form. The survey, did not cover the requirements and challenges involved in data storage and retrieval methods such as similarity search, data aggregation, range query, multi-replication, non-uniformity of the network, load balancing and so on, rather it briefly depicted different DCS schemes. This classification may be altered to present the DCS approaches according to the problems dealt with. Different DCS approaches in the current state-of-the-art are briefly described and analyzed in Section 3 while Section 4 presents the classification of the DCS schemes based on the challenges illustrated in Section 2 including range query, similarity search, data aggregation, sensor network field non-uniformity, multi-replication, load balancing and routing algorithm. Throughout the paper cost metrics is considered in terms of energy, and it is measured as the number of MAC-layer hops

Taxonomy and Design Drivers
Multi-Dimensional Attribute
Range versus Point Queries
Similarity Search
Data Aggregation
Non-Uniformity of Sensor Network Field
Multi-R
Load Baalancing
DCS Scheme Families
Geograpphic Hash Table
Similarity Search Algorithm
Dynamic Load Balancing
Load Balanced Data-Centric Storage
Tug-of-War
Quadratic Adaptive Replication
Double Rulings
Distributed Erasure Coding in DCS
3.10. Distributed Index for Features
3.11. Practical Data-Centric Storage
3.12. Hierarchical Voronoi Graph Based Routing
3.13. Data Storage and Range Query for Multidimensional Attribute
Range Query
Sensor Network Field Non-Uniformity
Multi-Replication
Load Balancing
Routing Algorithm
Findings
Conclusion
Full Text
Published version (Free)

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call