Random walk for self-stabilizing group communication in ad-hoc networks

Proceedings of the IEEE Symposium on Reliable Distributed Systems

Volumn , Issue , 2002, Pages 70-79

  Dolev, Shlomi ^a   Schiller, Elad ^a   Welch, Jennifer ^b  

^a BEN GURION UNIVERSITY OF THE NEGEV   (Israel)

^b TEXAS A AND M UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; COMPUTER NETWORKS; MULTICASTING; PROBABILITY; PROGRAM PROCESSORS; RESOURCE ALLOCATION; SYSTEMS ANALYSIS;

MOBILE AGENTS;

TELECOMMUNICATION NETWORKS;

EID: 0036446756     PISSN: 10609857     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (30)

1. D. Aldous and J.A. Fill, Reversible Markov Chains and Random Walks on Graphs (book draft), October 1999. http://www.stat.berkeley.edu/∼aldous/book.html.
2. Y. Amir, L. Moser, D. Agrawal, and P. Ciarfella, "Fast message ordering and membership using a logical token-passing ring", Proc. 13th IEEE International Conference on Distributed Computing Systems, Pittsburgh, PA, pp. 551-560, 1993.
3. J. Beauquier, T. Herault, and E. Schiller, "Easy Selfstabilization with an Agent" 5th Workshop on SelfStabilizing Systems, Lisbon, Portugal pp. 35-50,2001.
4. T. Chandra, V. Hadzilacos, S. Toueg, and B. Charron-Bost, "On the Impossibility of Group Membership", Philadelphia, PA Proc. ACM Symposium on Principles of Distributed Computing, pp. 322-330, 1996.
5. I. Chatzigiannakis, S. Nikoletseas, and P. Spirakis, "An Efficient Communication Strategy for Ad-Hoc Mobile Networks", Proc. 15th International Symposium on Distributed Computing, Lisbon, Portugal, pp. 285-299, 2001.
6. G.V. Chockler, I. Keidar, and R. Vitenberg, "Group Communication Specifications: A Comprehensive Study", ACM Computing Surveys, 33(4):1-43, December 2001.
7. M. Choy and A.K. Singh, "Efficient fault tolerant algorithms for distributed resource allocation," ACM Transactions on Programming Languages and Systems, 17(4):535-559, 1995.
8. D. Coppersmith, P. Tetali, and P. Winkler, "Collisions among Random Walks on a Graph," SIAM J. on Discrete Math., 6(3):363-374, August 1993.
9. F. Cristian and F. Schmuck, "Agreeing on processor group membership in asynchronous distributed systems," Technical Report CSE95-428, Department of Computer Science, University of California at San Diego, 1995.
10. R.A. Dayem, Mobile Data and Wireless LAN Technologies, Prentice Hall, 1997.
11. E.W. Dijkstra, "Hierarchical ordering of sequential processes," Acta Informatica, 1:115-138, 1971.
12. E.W. Dijkstra, "Self stabilizing systems in spite of distributed control" Communications of the ACM, 17:643-644, 1974.
13. S. Dolev, Self-stabilization, MIT Press, 2000.
14. S. Dolev and E. Schiller, "Communication Adaptive Self-Stabilizing Group Membership Service" Proc. 5th Workshop on Self-Stabilization, WSS'01, LNCS 2194, pp. 81-97, 2001 (also BGU TR-02, July 2000).
15. U. Feige, "A Tight Upper Bound on the Cover Time for Random Walks on Graphs," Random Structures and Algorithms, 6(4):51-54, 1995.
16. U. Feige, "A Tight Lower Bound on the Cover Time for Random Walks on Graphs" Random Structures and Algorithms, 6(4):433-438, 1995.
17. U. Feige "A Fast Randomized LOGSPACE Algorithm for Graph Connectivity", Theoretical Computer Science, 169:147-160, 1996.
18. A. Fekete, N. Lynch, and A. Shvartsman, "Specifying and Using a Partitionable Group Communication Service," Proc. 16th Annual ACM Symposium on Principles of Distributed Computing, Santa Barbara, CA, pp. 53-71, 1997.
19. S. Ghosh, "Agents, distributed algorithms, and stabilization," Computing and Combinatorics, Springer-Verlag LNCS: 1858, pp. 242-251, 2000.
20. K.P. Hatzis, G.P. Pentaris, P.G. Spirakis, V.T. Tampakas, and R.B. Tan, "Fundamental Control Algorithms in Mobile Networks," Proc. 11th ACM Symposium on Parallel Algorithms and Architectures, pp. 251-260, 1999.
21. T. Herman and T. Masuzawa, "Self-stabilizing Agent Traversal," Proc. 5th Workshop on Self-Stabilizing Systems, pp. 152-166, 2001.
22. IETF Mobile Ad-Hoc Networks (MANET) Working Group, http://www.ietf.org/html.charters/manetcharter.html.
23. T. Imielinski and H.F. Korth, Mobile Computing, Academic Publishers, 1996.
24. N.A. Lynch, "Fast allocation of nearby resources in a distributed system," Proc. 12th ACM Symposium on Theory of Computing, pp. 70-81, 1980.
25. G. Neiger, "A New Look at Membership Service," Proc. 15th ACM Symposium on Principles of Distributed Computing, 1996.
26. V.D. Park and M.S. Corson, "A Highly Adaptive Distributed Routing Algorithm for Mobile Wireless Networks," Proc. IEEE INFOCOM, April 1997.
27. B. Rajagopalan and P. MCKinley, "A Token-Based Protocol for Reliable, Ordered Multicast Communication," Proc. 8th IEEE Symposium on Reliable Distributed Systems, Seattle, WA, pp. 84-93, October 1989.
28. E. Steyer and G. Peterson, "Improved Algorithms for Distributed Resource Allocation," Proc. 7th Symposium on Principles of Distributed Computing, pp. 105-116, 1988.
29. J. Sussman, and K. Marzullo, "The Bancomat Problem: An Example of Resource Allocation in a Partitionable Asynchronous System," Proc. 12th International Symposium on Distributed Computing (DISC), 1998.
30. A.S. Tanenbaum, Computer Networks, Prentice Hall, 1996.