Skip to main content
SpringerLink
Log in

Stabilizing Consensus in Mobile Networks

  • Conference paper
Distributed Computing in Sensor Systems (DCOSS 2006)

Part of the book series: Lecture Notes in Computer Science ((LNCCN,volume 4026))

Included in the following conference series:

Abstract

Inspired by the characteristics of biologically-motivated systems consisting of autonomous agents, we define the notion of stabilizing consensus in fully decentralized and highly dynamic ad hoc systems. Stabilizing consensus requires non-faulty nodes to eventually agree on one of their inputs, but individual nodes do not necessarily know when agreement is reached. First we show that, similar to the original consensus problem in the synchronous model, there exist deterministic solutions to the stabilizing consensus problem tolerating crash faults. Similarly, stabilizing consensus can also be solved deterministically in presence of Byzantine faults with the assumption that n > 3f where n is the number of nodes and f is the number of faulty nodes. Our main result is a Byzantine consensus protocol in a model in which the input to each node can change finitely many times during execution and eventually stabilizes. Finally we present an impossibility result for stabilizing consensus in systems of identical nodes.

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 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. Lamport, L., Shostak, R., Pease, M.: The byzantine generals problem. In: Suri, N., Walter, C.J., Hugue, M.M. (eds.) Advances in Ultra-Dependable Distributed Systems, IEEE Computer Society Press, Los Alamitos (1995)

    Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  3. Dolev, D.: The byzantine generals strike again. Journal of Algorithms 3(1), 14–30 (1982)

    Article  MATH  MathSciNet  Google Scholar 

  4. Dolev, D., Strong, H.R.: Polynomial algorithms for multiple processor agreement. In: Proceedings of the 14th annual ACM symposium on Theory of computing, San Francisco, California, United States, pp. 401–407 (1982)

    Google Scholar 

  5. Dolev, D., Fischer, M.J., Fowler, R., Lynch, N.A., Strong, H.R.: An efficient algorithm for byzantine agreement without authentication. Information and Control 52(3), 257–274 (1982)

    Article  MATH  MathSciNet  Google Scholar 

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

    Article  MATH  MathSciNet  Google Scholar 

  7. Fischer, M.J.: The consensus problem in unreliable distributed systems (a brief survey). Technical Report YALEU/DCS/TR-273, Yale University (1983)

    Google Scholar 

  8. Vicsek, T., Czirók, A., Ben-Jacob, E., Cohen, I., Shochet, O.: Novel Type of Phase Transition in a System of Self-Driven Particles. Physical Review Letters 75, 1226–1229 (1995)

    Article  Google Scholar 

  9. Jadbabaie, A., Lin, J., Morse, A.: Coordination of groups of mobile autonomous agents using nearest neighbor rules. IEEE Transactions on Automatic Control (2002)

    Google Scholar 

  10. Chandra, T.D., Toueg, S.: Unreliable failure detectors for reliable distributed systems. Journal of the ACM 43(2), 225–267 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  11. Chandra, T.D., Hadzilacos, V., Toueg, S.: The weakest failure detector for solving consensus. Journal of the ACM 43(4), 685–722 (1996)

    Article  MATH  MathSciNet  Google Scholar 

  12. Ben-Or, M.: Another advantage of free choice: Completely asynchronous agreement protocols. In: Proceedings of the Second Annual ACM Synmposium on Principles of Distributed Computing, Montreal, Quebec, Canada, pp. 27–30 (1983)

    Google Scholar 

  13. Rabin, M.O.: Randomized byzantine generals. In: 24th Annual Symposium on Foundations of Computer Science, pp. 403–409. IEEE, Los Alamitos (1983)

    Chapter  Google Scholar 

  14. Feldman, P.N.: Optimal Algorithms for Byzantine Agreement. PhD thesis, Massachusetts Institute of Technology (1988)

    Google Scholar 

  15. Chaudhuri, S.: More choices allow more faults: Set consensus problems in totally asynchronous systems. Information and Computation 105(1), 132–158 (1993)

    Article  MATH  MathSciNet  Google Scholar 

  16. Dolev, D., Lynch, N.A., Pinter, S.S., Stark, E.W., Weihl, W.E.: Reaching approximate agreement in the presence of faults. Journal of the ACM 33(3), 499–516 (1986)

    Article  MathSciNet  Google Scholar 

  17. Lamport, L.: The part-time parliament. ACM Transaction on Computer Systems 16(2), 133–169 (1998)

    Article  Google Scholar 

  18. Beraldi, R., Baldoni, R.: The handbook of ad hoc wireless networks. In: The handbook of ad hoc wireless networks, pp. 127–148. CRC Press, Inc., Boca Raton (2003)

    Google Scholar 

  19. Royer, E., Toh, C.: A review of current routing protocols for ad-hoc mobile wireless networks. In: IEEE Personal Communications, pp. 46–55 (1999)

    Google Scholar 

  20. Williams, B., Camp, T.: Comparison of broadcasting techniques for mobile ad hoc networks. In: ACM International Symposium on Mobile Ad Hoc Networking and Computing, pp. 194–205 (2002)

    Google Scholar 

  21. Barbara, D.: Mobile computing and databases - a survey. Knowledge and Data Engineering 11(1), 108–117 (1999)

    Article  Google Scholar 

  22. Bobineau, C., Pucheral, P., Abdallah, M.: A unilateral commit protocol for mobile and disconnected computing. In: 12th International Conference on Parallel and Distributed Computing Systems (2000)

    Google Scholar 

  23. Pitoura, E., Bhargava, B.K.: Data consistency in intermittently connected distributed systems. Knowledge and Data Engineering 11(6), 896–915 (1999)

    Article  Google Scholar 

  24. Briesemeister, L.: Group Membership and Communication in Highly Mobile Ad Hoc Networks. PhD thesis, School of Electrical Engineering and Computer Science, Technical University of Berlin, Germany (2001)

    Google Scholar 

  25. Dolev, S., Schiller, E., Welch, J.: Random walk for self-stabilizing group communication in ad-hoc networks. In: 21st Symposium on Reliable Distributed Systems (2002)

    Google Scholar 

  26. Malpani, N., Welch, J.L., Vaidya, N.H.: Leader election algorithms for mobile ad hoc networks. In: Proc. Fourth International Workshop on Discrete Algorithms and Methods for Mobile Computing and Communications, pp. 96–103 (2000)

    Google Scholar 

  27. Walter, J.E., Welch, J.L., Vaidya, N.H.: A mutual exclusion algorithm for ad hoc mobile networks. Wireless Networks 7(6), 585–600 (2001)

    Article  MATH  Google Scholar 

  28. Angluin, D., Aspnes, J., Fischer, M.J., Jiang, H.: Self-stabilizing population protocols. In: 9th International Conference on Principles of Distributed Systems, pp. 79–90 (2005)

    Google Scholar 

  29. Basile, C., Killijian, M.O., Powell, D.: A survey of dependability issues in mobile wireless networks. Technical report, Laboratory for Analysis and Architecture of Systems, National Center for Scientific Research, Toulouse, France (2003)

    Google Scholar 

  30. Dolev, D., Strong, H.R.: Authenticated algorithms for byzantine agreement. SIAM Journal of Computing 12(4), 656–666 (1983)

    Article  MATH  MathSciNet  Google Scholar 

  31. Fischer, M.J., Lynch, N.A., Merritt, M.: Easy impossibility proofs for distributed consensus problems. Distributed Computing 1(1), 26–39 (1986)

    Article  MATH  Google Scholar 

Download references

Author information

Authors and Affiliations

  1. Department of Computer Science, Yale University,  

    Dana Angluin, Michael J. Fischer & Hong Jiang

Authors
  1. Dana Angluin
    View author publications

    You can also search for this author in PubMed Google Scholar

  2. Michael J. Fischer
    View author publications

    You can also search for this author in PubMed Google Scholar

  3. Hong Jiang
    View author publications

    You can also search for this author in PubMed Google Scholar

Editor information

Editors and Affiliations

  1. Intel Research/CMU, 4720 Forbes Avenue, Suite 410, PA 15213, Pittsburgh, USA

    Phillip B. Gibbons

  2. Department of Computer Science, University of Illinois at Urbana Champaign,  

    Tarek Abdelzaher

  3. Department of Computer Science, Yale University,  

    James Aspnes

  4. University of California at San Diego, 9500 Gilman Drive, La Jolla, 92093-0436, CA, USA

    Ramesh Rao

Rights and permissions

Reprints and permissions

Copyright information

© 2006 Springer-Verlag Berlin Heidelberg

About this paper

Cite this paper

Angluin, D., Fischer, M.J., Jiang, H. (2006). Stabilizing Consensus in Mobile Networks. In: Gibbons, P.B., Abdelzaher, T., Aspnes, J., Rao, R. (eds) Distributed Computing in Sensor Systems. DCOSS 2006. Lecture Notes in Computer Science, vol 4026. Springer, Berlin, Heidelberg. https://doi.org/10.1007/11776178_3

Download citation

  • DOI: https://doi.org/10.1007/11776178_3

  • Publisher Name: Springer, Berlin, Heidelberg

  • Print ISBN: 978-3-540-35227-3

  • Online ISBN: 978-3-540-35228-0

  • eBook Packages: Computer ScienceComputer Science (R0)

Publish with us

Policies and ethics

Search

Navigation