Proceedings of the 18th ACM International Conference on Modeling, Analysis and Simulation of Wireless and Mobile Systems 2015
DOI: 10.1145/2811587.2811609
|View full text |Cite
|
Sign up to set email alerts
|

A Bloom Filter-Based Algorithm for Routing in Intermittently Connected Mobile Networks

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
1

Citation Types

0
1
0

Year Published

2017
2017
2018
2018

Publication Types

Select...
2
1

Relationship

0
3

Authors

Journals

citations
Cited by 3 publications
(1 citation statement)
references
References 20 publications
0
1
0
Order By: Relevance
“…After that, Bonomi et al [36] presented an enhanced version of CBF depending on d-left hashing. BFs or any of their considerable variants have been used in a great number of applications for distributed systems such as peer-to-peer networks, forwarding and routing, caching, measurement and monitoring [37]. Fig.…”
Section: Deep Pimentioning
confidence: 99%
“…After that, Bonomi et al [36] presented an enhanced version of CBF depending on d-left hashing. BFs or any of their considerable variants have been used in a great number of applications for distributed systems such as peer-to-peer networks, forwarding and routing, caching, measurement and monitoring [37]. Fig.…”
Section: Deep Pimentioning
confidence: 99%