Adaptive Quality-Aware Replication in Wireless Sensor Networks

Typical sensor network deployments are usually built for long-term usage. Additionally, the sensor nodes are often exposed to harsh environmental influences. Due to these constraints, it is mandatory for applications to be able to compensate the failure of nodes. Providing a persistent storage even in the presence of failing nodes demands for replication within the sensor network. However, recent work in the field of replication in sensor networks often does not consider the suitability of the sensor nodes to store replicas in terms of e.g. available storage, energy or connectivity. In this paper, we envision an adaptive quality-aware replication scheme which enables the storage of replicas based on a scoring system reflecting the suitability of a replica node. Furthermore, we propose an adaptable data migration strategy using a weighting function to achieve an adequate placement for the replicas. A resilient storage strategy enables the survival of replicas after migration despite unpredictable node failures. We expect that our replication scheme highly increases the availability of sensor network data despite of node failures and network partitioning requiring only a small number of replicas within the network.

[1]  Samuel Madden,et al.  Scoop: An Adaptive Indexing Scheme for Stored Data in Sensor Networks , 2007, 2007 IEEE 23rd International Conference on Data Engineering.

[2]  Deborah Estrin,et al.  GHT: a geographic hash table for data-centric storage , 2002, WSNA '02.

[3]  R. Govindan,et al.  Rebalancing Distributed Data Storage in Sensor Networks , 2005 .

[4]  Jon Feldman,et al.  Growth codes: maximizing sensor network data persistence , 2006, SIGCOMM.

[5]  Emina Soljanin,et al.  Fountain Codes Based Distributed Storage Algorithms for Large-Scale Wireless Sensor Networks , 2008, 2008 International Conference on Information Processing in Sensor Networks (ipsn 2008).

[6]  Peter Langendörfer,et al.  tinyDSM: A highly reliable cooperative data storage for Wireless Sensor Networks , 2009, 2009 International Symposium on Collaborative Technologies and Systems.

[7]  Sándor P. Fekete,et al.  Shawn: A new approach to simulating wireless sensor networks , 2005, ArXiv.

[8]  Kirk Pruhs,et al.  Decomposing Data-Centric Storage Query Hot-Spots in Sensor Networks , 2006, 2006 Third Annual International Conference on Mobile and Ubiquitous Systems: Networking & Services.

[9]  James Newsome,et al.  GEM: Graph EMbedding for routing and data-centric storage in sensor networks without geographic information , 2003, SenSys '03.

[10]  Baochun Li,et al.  Differentiated Data Persistence with Priority Random Linear Codes , 2007, 27th International Conference on Distributed Computing Systems (ICDCS '07).

[11]  Prasun Sinha,et al.  On Improving Data Accessibility in Storage Based Sensor Networks , 2007, 2007 IEEE Internatonal Conference on Mobile Adhoc and Sensor Systems.

[12]  Wei Hong,et al.  TinyDB: an acquisitional query processing system for sensor networks , 2005, TODS.

[13]  Prashant J. Shenoy,et al.  Rethinking Data Management for Storage-centric Sensor Networks , 2007, CIDR.