Skip to Main Content
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.