Techniques and Challenges of Data Centric Storage Scheme in Wireless Sensor Network

Journal of Sensor and Actuator Networks

Khandakar Ahmed¹ 

[1] School of Electrical and Computer Engineering, RMIT University, Melbourne VIC 3001, Australia;

关键词: Greedy Perimeter Stateless Routing;    Distributed Hash Table;    Data Centric Storage;    spatial temporal similarity search;    range queries;    multi-replication;    non-uniformity of sensor network field;    Load Balanced Data Centric Storage;    Geographic Hash Table;   

DOI  :  10.3390/jsan1010059

来源: mdpi

【 摘 要 】

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.

【 授权许可】

CC BY   
© 2012 by the authors; licensee MDPI, Basel, Switzerland.