Stabilizing consensus in mobile networks

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics)

Volumn 4026 LNCS, Issue , 2006, Pages 37-50

  Angluin, Dana ^a   Fischer, Michael J ^a   Jiang, Hong ^a  

^a YALE UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

AUTONOMOUS AGENTS; FAULT TOLERANT COMPUTER SYSTEMS; NETWORK PROTOCOLS; PROBLEM SOLVING;

AD HOC SYSTEMS; BYZANTINE FAULTS; CRASH FAULTS; SYNCHRONOUS MODEL;

MOBILE TELECOMMUNICATION SYSTEMS;

EID: 33746062866     PISSN: 03029743     EISSN: 16113349     Source Type: Book Series    
DOI: 10.1007/11776178_3     Document Type: Conference Paper

References (31)

1. Lamport, L., Shostak, R., Pease, M.: The byzantine generals problem. In: Advances in Ultra-Dependable Distributed Systems, N. Suri, C. J. Walter, and M. M. Hugue (Eds.). IEEE Computer Society Press (1995)
2. Pease, M., Shostak, R., Lamport, L.: Reaching agreement in the presence of faults. Journal of the ACM 27 (1980) 228-234
3. Dolev, D.: The byzantine generals strike again. Journal of Algorithms 3(1) (1982) 14-30
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 (1982) 401-407
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) (1982) 257-274
6. Fischer, M.J., Lynch, N.A., Paterson, M.S.: Impossibility of distributed consensus with one faulty process. Journal of the ACM 32(2) (1985) 374-382
7. Fischer, M.J.: The consensus problem in unreliable distributed systems (a brief survey). Technical Report YALEU/DCS/TR-273, Yale University (1983)
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 (1995) 1226-1229
9. Jadbabaie, A., Lin, J., Morse, A.: Coordination of groups of mobile autonomous agents using nearest neighbor rules. IEEE Transactions on Automatic Control (2002)
10. Chandra, T.D., Toueg, S.: Unreliable failure detectors for reliable distributed systems. Journal of the ACM 43(2) (1996) 225-267
11. Chandra, T.D., Hadzilacos, V., Toueg, S.: The weakest failure detector for solving consensus. Journal of the ACM 43(4) (1996) 685-722
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 (1983) 27-30
13. Rabin, M.O.: Randomized byzantine generals. In: 24th Annual Symposium on Foundations of Computer Science, IEEE, Los Alamitos, California, United States (1983) 403-409
14. Feldman, P.N.: Optimal Algorithms for Byzantine Agreement. PhD thesis, Massachusetts Institute of Technology (1988)
15. Chaudhuri, S.: More choices allow more faults: Set consensus problems in totally asynchronous systems. Information and Computation 105(1) (1993) 132-158
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) (1986) 499-516
17. Lamport, L.: The part-time parliament. ACM Transaction on Computer Systems 16(2) (1998) 133-169
18. Beraldi, R., Baldoni, R. The Electrical Engineering Handbook Series. In: The handbook of ad hoc wireless networks. CRC Press, Inc. Boca Raton, FL, USA (2003) 127-148
19. Royer, E., Toh, C.: A review of current routing protocols for ad-hoc mobile wireless networks. IEEE Personal Communications (1999) 46-55
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. (2002) 194-205
21. Barbara, D.: Mobile computing and databases - a survey. Knowledge and Data Engineering 11(1) (1999) 108-117
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)
23. Pitoura, E., Bhargava, B.K.: Data consistency in intermittently connected distributed systems. Knowledge and Data Engineering 11(6) (1999) 896-915
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)
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)
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. (2000) 96-103
27. Walter, J.E., Welch, J.L., Vaidya, N.H.: A mutual exclusion algorithm for ad hoc mobile networks. Wireless Networks 7(6) (2001) 585-600
28. Angluin, D., Aspnes, J., Fischer, M.J., Jiang, H.: Self-stabilizing population protocols. In: Ninth International Conference on Principles of Distributed Systems. (2005) 79-90
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)
30. Dolev, D., Strong, H.R.: Authenticated algorithms for byzantine agreement. SIAM Journal of Computing 12(4) (1983) 656-666
31. Fischer, M.J., Lynch, N.A., Merritt, M.: Easy impossibility proofs for distributed consensus problems. Distributed Computing 1(1) (1986) 26-39