Bloom-Filter Aided Two-Layered Structured Overlay for Highly-Dynamic Wireless Distributed Storage

In this letter, we propose a novel two-layered structured overlay, called a distributed Bloom filter table (DBFT), which is capable of substantially reducing overhead imposed by highly-dynamic peer-to-peer (P2P) distributed storage systems. More specifically, in our DBFT scheme, each node's ID remains unchanged, when the associated cluster changes due to the physical movement of the node. This provides us with an exclusive benefit of maintaining the rule of structured overlay without imposing any additional overhead to reconfigure index between saved information and its stored node, which cannot be achieved by the previous P2P techniques designed for mobile ad hoc networks. Moreover, another merit of the proposed scheme is that stored packets per node become more equally distributed than in the conventional schemes, because each node maintains to have its own addressing- and content-data when it moves within a storage area.