Skip to main content
SpringerLink
Log in

A Probabilistic Approach to the Count-To-Infinity Problem in Distance-Vector Routing Algorithms

  • Conference paper
New Results in Dependability and Computer Systems

Part of the book series: Advances in Intelligent Systems and Computing ((AISC,volume 224))

  • 783 Accesses

Abstract

Count-to-infinity problem is characteristic for routing algorithms based on the distributed implementation of the classical Bellman-Ford algorithm. In this paper a probabilistic solution to this problem is proposed. It is argued that by the use of a Bloom Filter added to the routing message the routing loops will with high probability not form. An experimental analysis of this solution for use in Wireless Sensor Networks in practice is also included.

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

Access this chapter

Log in via an institution
Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 169.00
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 219.99
Price excludes VAT (USA)
  • Compact, lightweight edition
  • Dispatched in 3 to 5 business days
  • Free shipping worldwide - see info

Tax calculation will be finalised at checkout

Purchases are for personal use only

Institutional subscriptions

Preview

Unable to display preview. Download preview PDF.

Unable to display preview. Download preview PDF.

References

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

    Article  MATH  Google Scholar 

  2. Chung, F., Horn, P., Lu, L.: Diameter of random spanning trees in a given graph. Journal of Graph Theory 69(3) (2012)

    Google Scholar 

  3. Czubak, A., Wojtanowski, J.: On Applications of Wireless Sensor Networks. In: Tkacz, E., Kapczynski, A. (eds.) Internet – Technical Development and Applications. AISC, vol. 64, pp. 91–99. Springer, Heidelberg (2009)

    Chapter  Google Scholar 

  4. Czubak, A., Wojtanowski, J.: Lifespan-Aware Routing for Wireless Sensor Networks. In: Jędrzejowicz, P., Nguyen, N.T., Howlet, R.J., Jain, L.C. (eds.) KES-AMSTA 2010, Part II. LNCS, vol. 6071, pp. 72–81. Springer, Heidelberg (2010)

    Chapter  Google Scholar 

  5. Ellis, R.B., Jia, X., Yan, C.: On random points in the unit disk. Random Struct. Algorithms 29(1), 14–25 (2006)

    Article  MathSciNet  MATH  Google Scholar 

  6. Mitzenmacher, M., Upfal, E.: Probability and Computing: Randomized Algorithms and Probabilistic Analysis. Cambridge University Press, New York (2005)

    Book  Google Scholar 

  7. Perkins, C.E., Bhagwat, P.: Highly dynamic Destination-Sequenced Distance-Vector routing (DSDV) for mobile computers. In: Proceedings of the Conference on Communications Architectures, Protocols and Applications, pp. 234–244. ACM, New York (1994), doi:10.1145/190314.190336

    Chapter  Google Scholar 

  8. Perkins, C.E., Royer, E.M.: Ad-hoc On-Demand Distance Vector Routing. In: Proceedings of the 2nd IEEE Workshop on Mobile Computing Systems and Applications, pp. 90–100 (1999), doi:10.1109/MCSA.1999.749281

    Google Scholar 

  9. Pettarin, A.: On the diameter of Bluetooth-based adhoc networks. Ph.D. Thesis, University of Padua, Italy (2008)

    Google Scholar 

  10. Ramakrishna, M.V.: Practical performance of Bloom filters and parallel free-text searching. Communications of the ACM 32, 1237–1239 (1989)

    Article  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Institute of Mathematics and Informatics, Opole University, ul. Oleska 48, 45-052, Opole, Poland

    Adam Czubak

Authors
  1. Adam Czubak
    View author publications

    You can also search for this author in PubMed Google Scholar

Corresponding author

Correspondence to Adam Czubak .

Editor information

Editors and Affiliations

  1. , Institute of Computer Engineering, Wrocław University of Technology, ul. Janiszewskiego 11/17, Wrocław, 50-372, Poland

    Wojciech Zamojski

  2. , Institute of Computer Engineering, Wrocław University of Technology, ul. Janiszewskiego 11/17, Wrocław, 50-372, Poland

    Jacek Mazurkiewicz

  3. , Institute of Computer Engineering, Wrocław University of Technology, ul. Janiszewskiego 11/17, Wrocław, 50-372, Poland

    Jarosław Sugier

  4. , Institute of Computer Engineering, Wrocław University of Technology, ul. Janiszewskiego 11/17, Wrocław, 50-372, Poland

    Tomasz Walkowiak

  5. , Systems Research Institute, Polish Academy of Sciences, ul. Newelska 6, Warszawa, 01-447, Poland

    Janusz Kacprzyk

Rights and permissions

Reprints and permissions

Copyright information

© 2013 Springer International Publishing Switzerland

About this paper

Cite this paper

Czubak, A. (2013). A Probabilistic Approach to the Count-To-Infinity Problem in Distance-Vector Routing Algorithms. In: Zamojski, W., Mazurkiewicz, J., Sugier, J., Walkowiak, T., Kacprzyk, J. (eds) New Results in Dependability and Computer Systems. Advances in Intelligent Systems and Computing, vol 224. Springer, Heidelberg. https://doi.org/10.1007/978-3-319-00945-2_10

Download citation

Publish with us

Policies and ethics

Search

Navigation