Distributed Information Storage and Collection for WSNs

Distributed data storage is an important component of wireless sensor networks, which protects the mission critical information from unexpected node failures or malicious destruction of parts of the network. In this paper we present DISC, a protocol for distributed information storage and collection. The two major mechanisms in DISC which make our solution distinct from the related approaches are probabilistic choice of storing nodes and a search engine based on the usage of Bloom filters. In comparison to the deterministic choice of the backup node, the random selection strategy makes it virtually impossible for an attacker to determine and destroy the exact node keeping a particular piece of information. The usage of Bloom filters in the information search engine makes the navigation to a specific data fast and efficient. We show that with DISC the amount of recovered information is more than two times higher than that in deterministic storage schemes.

[1]  Imrich Chlamtac,et al.  A distance routing effect algorithm for mobility (DREAM) , 1998, MobiCom '98.

[2]  Donald E. Eastlake,et al.  US Secure Hash Algorithm 1 (SHA1) , 2001, RFC.

[3]  Gyula Simon,et al.  The flooding time synchronization protocol , 2004, SenSys '04.

[4]  Deborah Estrin,et al.  Data-Centric Storage in Sensornets with GHT, a Geographic Hash Table , 2003, Mob. Networks Appl..

[5]  Vana Kalogeraki,et al.  Data dissemination in mobile peer-to-peer networks , 2005, MDM '05.

[6]  Sanjay Jha,et al.  Wireless Sensor Networks for Battlefield Surveillance , 2006 .

[7]  Bruce H. Krogh,et al.  Energy-efficient surveillance system using wireless sensor networks , 2004, MobiSys '04.

[8]  P. Hebden,et al.  Bloom filters for data aggregation and discovery: a hierarchical clustering approach , 2005, 2005 International Conference on Intelligent Sensors, Sensor Networks and Information Processing.

[9]  Levente Buttyán,et al.  PANEL: Position-based Aggregator Node Election in Wireless Sensor Networks , 2007, 2007 IEEE Internatonal Conference on Mobile Adhoc and Sensor Systems.

[10]  David E. Culler,et al.  Hood: a neighborhood abstraction for sensor networks , 2004, MobiSys '04.

[11]  S.M. Jafar Rizvi,et al.  Comparison of Hash Table Verses Lexical Transducer Based Implementations of Urdu Lexicon , 2004, Student Conference On Engineering, Sciences and Technology.

[12]  Dirk Westhoff,et al.  Tinypeds: Tiny Persistent Encrypted Data Storage 3 in Asynchronous Wireless Sensor Networks 4 , 2006 .

[13]  K.B. Lee,et al.  Open standards for homeland security sensor networks , 2005, IEEE Instrumentation & Measurement Magazine.

[14]  Deborah Estrin,et al.  Directed diffusion for wireless sensor networking , 2003, TNET.

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

[16]  Brad Karp,et al.  GPSR: greedy perimeter stateless routing for wireless networks , 2000, MobiCom '00.

[17]  Vana Kalogeraki,et al.  Speculative routing and update propagation: a kundali centric approach , 2003, IEEE International Conference on Communications, 2003. ICC '03..

[18]  Andrei Broder,et al.  Network Applications of Bloom Filters: A Survey , 2004, Internet Math..

[19]  Nael B. Abu-Ghazaleh,et al.  Collaborative storage management in sensor networks , 2004, Int. J. Ad Hoc Ubiquitous Comput..

[20]  Karl Aberer,et al.  Databases, Information Systems, and Peer-to-Peer Computing , 2003, Lecture Notes in Computer Science.

[21]  Tim Tau Hsieh.  Using sensor networks for highway and traffic applications , 2004, IEEE Potentials.

[22]  Paolo Bellavista,et al.  Mobeyes: smart mobs for urban monitoring with a vehicular sensor network , 2006, IEEE Wireless Communications.

[23]  Deborah Estrin,et al.  Data-centric storage in sensornets , 2003, CCRV.

[24]  John Kubiatowicz,et al.  Probabilistic location and routing , 2002, Proceedings.Twenty-First Annual Joint Conference of the IEEE Computer and Communications Societies.