Skip to main content

Tight Bounds for Stabilizing Uniform Consensus in Mobile Networks

  • Conference paper
Stabilization, Safety, and Security of Distributed Systems (SSS 2014)

Part of the book series: Lecture Notes in Computer Science ((LNTCS,volume 8756))

Included in the following conference series:

  • 542 Accesses

Abstract

This paper addresses the problem of solving stabilizing uniform consensus in mobile networks. In this problem, the input of nodes may change multiple times before they eventually stabilize. However, when the system stabilizes all correct nodes output a value and there are no two non-crashed nodes (whether faulty or not) that output different values. In contrast to stabilizing consensus, stabilizing uniform consensus is not solvable with Byzantine faults. So we consider here weaker kinds of faults, namely crash faults and omission faults. We show that for crash and send-omission faults, n > 2t is a necessary and sufficient condition for solving stabilizing uniform consensus, where n is the total number of mobile nodes, out of which t may be faulty. Interestingly, when the input of nodes are fixed, stabilizing uniform consensus is solvable with crash faults for n > t and with send-omission faults for n > 2t (for t > 1). When considering general omission faults, we show that stabilizing uniform consensus is not solvable, even for fixed inputs and t = 1.

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

Access this chapter

Chapter
USD 29.95
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
eBook
USD 39.99
Price excludes VAT (USA)
  • Available as PDF
  • Read on any device
  • Instant download
  • Own it forever
Softcover Book
USD 54.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. Angluin, D., Fischer, M.J., Jiang, H.: Stabilizing consensus in mobile networks. In: Gibbons, P.B., Abdelzaher, T., Aspnes, J., Rao, R. (eds.) DCOSS 2006. LNCS, vol. 4026, pp. 37–50. Springer, Heidelberg (2006)

    Chapter  Google Scholar 

  2. Attiya, H., Welch, J.: Distributed Computing: Fundamentals, Simulations and Advanced Topics. John Wiley & Sons (2004)

    Google Scholar 

  3. Basile, C., Killijian, M.-O., Powell, D.: A survey of dependability issues in mobile wireless networks. Technical report (2003)

    Google Scholar 

  4. Bonnet, F., Ezhilchelvan, P., Vollset, E.: Quiescent consensus in mobile ad-hoc networks using eventually storage-free broadcasts. In: Proc. of the 21st ACM SAC, Dijon, France, pp. 670–674 (2006)

    Google Scholar 

  5. Chockler, G., Demirbas, M., Gilbert, S., Newport, C., Nolte, T.: Consensus and collision detectors in wireless ad hoc networks. In: Proc. of the 24th ACM PODC, Las Vegas, NV, USA, pp. 197–206 (2005)

    Google Scholar 

  6. Dijkstra, E.: Self-stabilizing systems in spite of distributed control. Commun. ACM 17(11), 643–644 (1974)

    Article  MATH  Google Scholar 

  7. Doerr, B., Goldberg, L., Minder, L., Sauerwald, T., Scheideler, C.: Stabilizing consensus with the power of two choices. In: Proc. of the 23rd ACM SPAA, San Jose, California, USA, pp. 149–158 (2011)

    Google Scholar 

  8. Fischer, M., Lynch, N., Paterson, M.: Impossibility of distributed consensus with one faulty process. Journal of the ACM 32(2), 374–382 (1985)

    Article  MATH  MathSciNet  Google Scholar 

  9. Guerraoui, R.: Revisiting the relationship between non-blocking atomic commitment and consensus. In: Helary, J.-M., Raynal, M. (eds.) WDAG 1995. LNCS, vol. 972, pp. 87–100. Springer, Heidelberg (1995)

    Chapter  Google Scholar 

  10. Guerraoui, R., Rodrigues, L.: Introduction to Reliable Distributed Programming. Springer-Verlag (2006)

    Google Scholar 

  11. Hadzilacos, V.: On the relationship between the atomic commitment and consensus problems. In: Simons, B., Spector, A. (eds.) Fault-Tolerant Distributed Computing. LNCS, vol. 448, pp. 201–208. Springer, Heidelberg (1990)

    Chapter  Google Scholar 

  12. Lamport, L., Shostak, R., Pease, M.: The Byzantine generals problem. ACM Transactions on Programming Languages and Systems 4(3), 382–401 (1982)

    Article  MATH  Google Scholar 

  13. Lynch, N.: Distributed Algorithms. Morgan Kaufmann Publishers Inc., San Francisco (1996)

    MATH  Google Scholar 

  14. Moniz, H., Neves, N., Correia, M.: Byzantine fault-tolerant consensus in wireless ad hoc networks. IEEE Transactions on Mobile Computing 99(PrePrints), 1 (2012)

    Google Scholar 

  15. Neiger, G., Toueg, S.: Automatically increasing the fault-tolerance of distributed algorithms. J. Algorithms 11(3), 374–419 (1990)

    Article  MATH  MathSciNet  Google Scholar 

  16. Pease, M., Shostak, R., Lamport, L.: Reaching agreement in the presence of faults. Journal of the ACM 27(2), 228–234 (1980)

    Article  MATH  MathSciNet  Google Scholar 

Download references

Author information

Authors and Affiliations

Authors

Editor information

Editors and Affiliations

Rights and permissions

Reprints and permissions

Copyright information

© 2014 Springer International Publishing Switzerland

About this paper

Cite this paper

Tran-The, H., Rodrigues, L. (2014). Tight Bounds for Stabilizing Uniform Consensus in Mobile Networks. In: Felber, P., Garg, V. (eds) Stabilization, Safety, and Security of Distributed Systems. SSS 2014. Lecture Notes in Computer Science, vol 8756. Springer, Cham. https://doi.org/10.1007/978-3-319-11764-5_23

Download citation

  • DOI: https://doi.org/10.1007/978-3-319-11764-5_23

  • Publisher Name: Springer, Cham

  • Print ISBN: 978-3-319-11763-8

  • Online ISBN: 978-3-319-11764-5

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics