Skip to main content

Advertisement

Springer Nature Link
Log in

Impact of Bloom Filter on Infection Rate in Epidemic Forwarding for ICNs

  • Published:
Wireless Personal Communications Aims and scope Submit manuscript

Abstract

Mobile ad hoc routing protocols fails in intermittently connected networks (ICN) (i.e. characterized by short-range communication and absence of connected path from source to destination). However, Epidemic routing techniques ensures eventual message delivery from source to destination even where there is never a connected path or when a network partition exists at the origin of message. Epidemic Routing uses random pair-wise messages exchanges between nodes with goals to maximize message delivery rate, minimize message latency, and the total resources consumed in message delivery. Epidemic routing uses summary vector to avoid useless transmission and redundancy. Further,to make summery vector efficient, epidemic routing can use bloom filter to significantly reduce the useless transmissions associated with the summary vector. However, the challenge for epidemic routing remains opens is to optimal design of summary vector size for finite buffer while keeping the benefits of infinite buffer space. This paper proposes an improved scheme of Bloom filter (named it modified bloom filter MBLF), which is tailored according to epidemic routing. We performed simulation to support our clam and observed that delivery ratio of MBLF with epidemic routing is 19 % higher then the traditional bloom filter. In this paper, we have proposed a bloom filter based epidemic forwarding for ICNs.

This is a preview of subscription content, log in via an institution to check access.

Access this article

Log in via an institution

Subscribe and save

Springer+ Basic
$34.99 /Month
  • Get 10 units per month
  • Download Article/Chapter or eBook
  • 1 Unit = 1 Article or 1 Chapter
  • Cancel anytime
Subscribe now

Buy Now

Price excludes VAT (USA)
Tax calculation will be finalised during checkout.

Instant access to the full article PDF.

Institutional subscriptions

Fig. 1
Fig. 2
Fig. 3
Fig. 4
Fig. 5
Fig. 6
Fig. 7
Fig. 8
Fig. 9
Fig. 10

Similar content being viewed by others

References

  1. Vahdat, A., & Becker, D. (2000). Epidemic routing for partially-connected ad hoc networks. Duke University Technical, Report CS-200006.

  2. Lindgren, A., Doria, A., & Schelen, O. (2004). Probabilistic routing in intermittently connected networks. In Proceedings of the first international workshop on assurance with partial and intermittent resources (SAPIR). Fortaleza, Brazil.

  3. Groenevelt, R., Koole, G., & Nain, P. (2005). The message delay in mobile ad hoc networks. Performance Evaluation, 62(1–4) (presented at Performance 2005 conference, Juan-les-Pins).

  4. Zhang, X., Neglia, G., Kurose, J., & Towsley, D. (2005). Performance modeling of epidemic routing. University of Massachusetts Technical Report CMPSCI 05–44.

  5. Tower, J. P., & Thomas L. D. (2008) A proposed scheme for epidemic routing with active curing for opportunistic networks. In Advanced information networking and applications-workshops, 2008. AINAW 2008. 22nd international conference on. IEEE.

  6. Spyropoulos, T., Psounis, K., & Raghavendra, C. S. (2008). Efficient routing in intermittently connected mobile networks: The multiple-copy case. Networking, IEEE/ACM Transactions on, 16(1), 77–90.

    Article  Google Scholar 

  7. Matsuda, T., & Takine, T. (2008). (p, q)-Epidemic routing for sparsely populated mobile ad hoc networks. Selected Areas in Communications, IEEE Journal on, 26(5), 783–793.

    Article  Google Scholar 

  8. Bloom, B. H. (1970). Space/time trade-offs in hash coding with allowable errors. Communications of the ACM, 13(7), 422–426.

    Article  MATH  Google Scholar 

  9. Fan, L., Cao, P., Almeida, J., & Broder, A. Z. (1998). Summary cache: A scalable wide-area web cache sharing protocol. SIGCOMM Computer Communications Review, 28(4), 254–265.

    Article  Google Scholar 

  10. Mitzenmacher, M. (2002). Compressed bloom filters. IEEE/ACM Transactions on Networking (TON), 10(5), 604–612.

    Article  Google Scholar 

  11. Zhu, Y., Jiang, H., & Wang, J. (2004). Hierarchical bloom filter arrays (hba): a novel, scalable metadata management system for large cluster-based storage. In Cluster computing, 2004 IEEE international conference on. IEEE.

  12. Laufer, R. P., Velloso, P. B., & Duarte, O. C. M. B. (2005). Generalized bloom filters. In Electrical engineering program, COPPE/UFRJ, Tech. Rep. GTA-05-43.

  13. Bruck, J., Gao, J., & Jiang, A. (2006). Weighted bloom filter. In Information theory, 2006 IEEE international symposium on. IEEE.

  14. Almeida, P. S., et al. (2007). Scalable bloom filters. Information Processing Letters, 101(6), 255–261.

    Article  MATH  MathSciNet  Google Scholar 

  15. Bruck, J., Gao, J., & Jiang, A. A. (2006). Adaptive bloom filter.

  16. Guo, D., et al. (2010). The dynamic bloom filters. Knowledge and Data Engineering, IEEE Transactions on, 22(1), 120–133.

    Article  Google Scholar 

  17. Zhao, Y., Wu, J. (2010). B-sub: A practical bloom-filter-based publish-subscribe system for human networks. In Distributed computing systems (ICDCS), 2010 IEEE 30th international conference on. IEEE.

  18. Small, T., & Haas, Z. J. (2003). The shared wireless infostation model: A new ad hoc networking paradigm(or where there is a whale, there is a way). In International symposium on mobile ad hoc networking & computing: proceedings of the 4 th ACM international symposium on mobile ad hoc networking & computing (Vol. 1., No. 03).

  19. Groenevelt, R. (2005). Stochastic models in mobile ad hoc networks. Sophia Antipolis: University of Nice.

  20. Apple by, Austin. Murmurhash 2.0. (2008).

  21. Jenkins, B. (1997). Hash functions. Dr Dobbs Journal, 22(9), 107.

    Google Scholar 

  22. Bacon, D. F., Fink, S. J., & Grove, D. (2002). Space-and time-efficient implementation of the Java object model. ECOOP. Vol. 2. minutes.

  23. Kernen, A., Jrg, O., & Teemu, K. (2009). The ONE simulator for DTN protocol evaluation. In Proceedings of the 2nd international conference on simulation tools and techniques. ICST (Institute for Computer Sciences, Social-Informatics and Telecommunications Engineering).

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science and Engineering, Indian Institute of Technology Patna, Patna, India

    Shailendra Shukla & Rajiv Misra

  2. Microsoft IDC Gachibowli, Hyderabad, India

    Nishant Kumar

Authors
  1. Shailendra Shukla
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Nishant Kumar
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Rajiv Misra
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Shailendra Shukla.

Rights and permissions

Reprints and permissions

About this article

Cite this article

Shukla, S., Kumar, N. & Misra, R. Impact of Bloom Filter on Infection Rate in Epidemic Forwarding for ICNs. Wireless Pers Commun 75, 2165–2180 (2014). https://doi.org/10.1007/s11277-013-1461-9

Download citation

  • Published:

  • Issue Date:

  • DOI: https://doi.org/10.1007/s11277-013-1461-9

Keywords