Space/time trade-offs in hash coding with allowable errors
Communications of the ACM
Probabilistic routing in intermittently connected networks
ACM SIGMOBILE Mobile Computing and Communications Review
Indexing textual XML in P2P networks using distributed bloom filters
DASFAA'07 Proceedings of the 12th international conference on Database systems for advanced applications
Pocket switched networking: challenges, feasibility and implementation issues
WAC'05 Proceedings of the Second international IFIP conference on Autonomic Communication
Mobile social networks: state-of-the-art and a new vision
International Journal of Communication Systems
| Hi-index | 0.00 |
Pocket Switched Networks (PSN) [3] have become a promising approach for providing communication between scarcely connected human-carried devices. Such devices, e.g. mobile phones or sensor nodes, are exposed to human mobility and can therewith leverage inter-human contacts for store-and-forward routing. Efficiently routing in such delay tolerant networks is complex due to incomplete knowledge about the network, and high dynamics of the network. In this work we want to develop an extension of Bloom filters for resource-efficient routing in pocket switched networks. Furthermore, we argue that PSNs may become densely populated in special situations. We want to exploit such situations to perform collaborative calculations of forwarding-decisions. In this paper we present a simple scheme for distributed decision calculation using overlays and a DHT-based distributed variant of Bloom filters.