This Article 
 Bibliographic References 
 Add to: 
Random Walk for Self-Stabilizing Group Communication in Ad Hoc Networks
July 2006 (vol. 5 no. 7)
pp. 893-905
We introduce a self-stabilizing group communication system for ad hoc networks. The system design is based on a mobile agent, collecting and distributing information, during a random walk. Three possible settings for modeling the location of the mobile nodes (processors) in the ad hoc network are presented: slow location change, complete random change, and neighbors with probability. The group membership algorithm is based on a mobile agent collecting and distributing information. The new techniques support group membership and multicast, and also support resource allocation.

[1] D. Aldous and J.A. Fill, Reversible Markov Chains and Random Walks on Graphs, Oct. 1999, .
[2] N. Alfasi, “Cover Time Random Walk in Ad Hoc Networks,” Technical Report #03-02, Dept. of Computer Science, Ben-Gurion Univ. of the Negev, 2002.
[3] Y. Amir, L. Moser, P.M. Melliar-Smith, D. Agrawal, and P. Ciarfella, “Fast Message Ordering and Membership Using a Logical Token-Passing Ring,” Proc. 13th IEEE Int'l Conf. Distributed Computing Systems, pp. 551-560, 1993.
[4] J. Beauquier, T. Herault, and E. Schiller, “Easy Self-Stabilization with an Agent” Proc. Fifth Workshop Self-Stabilizing Systems, pp. 35-50, 2001.
[5] T. Chandra, V. Hadzilacos, S. Toueg, and B. Charron-Bost, “On the Impossibility of Group Membership,” Proc. ACM Symp. Principles of Distributed Computing, pp. 322-330, 1996.
[6] I. Chatzigiannakis, S. Nikoletseas, and P. Spirakis, “An Efficient Communication Strategy for Ad hoc Mobile Networks,” Proc. 15th Int'l Symp. Distributed Computing, pp. 285-299, 2001.
[7] G.V. Chockler, I. Keidar, and R. Vitenberg, “Group Communication Specifications: A Comprehensive Study,” ACM Computing Surveys, vol. 33, no. 4, pp. 1-43, Dec. 2001.
[8] M. Choy and A.K. Singh, “Efficient Fault Tolerant Algorithms for Distributed Resource Allocation,” ACM Trans. Programming Languages and Systems, vol. 17, no. 4, pp. 535-559, 1995.
[9] D. Coppersmith, P. Tetali, and P. Winkler, “Collisions among Random Walks on a Graph,” SIAM J. Discrete Math, vol. 6, no. 3, pp. 363-374, Aug. 1993.
[10] F. Cristian and F. Schmuck, “Agreeing on Processor Group Membership in Asynchronous Distributed Systems,” Technical Report CSE95-428, Dept. of Computer Science, Univ. of California, San Diego, 1995.
[11] R.A. Dayem, Mobile Data and Wireless LAN Technologies. Prentice Hall, 1997.
[12] E.W. Dijkstra, “Self Stabilizing Systems in Spite of Distributed Control,” Comm. ACM, vol. 17, pp. 643-644, 1974.
[13] S. Dolev, Self-Stabilization. MIT Press, 2000.
[14] S. Dolev and E. Schiller, “Communication Adaptive Self-Stabilizing Group Membership Service,” IEEE Trans. Parallel Distributed Systems, vol. 14, no. 7, pp. 709-720, 2003.
[15] U. Feige, “A Tight Upper Bound on the Cover Time for Random Walks on Graphs,” Random Structures and Algorithms, vol. 6, no. 4, pp. 51-54, 1995.
[16] U. Feige, “A Tight Lower Bound on the Cover Time for Random Walks on Graphs,” Random Structures and Algorithms, vol. 6, no. 4, pp. 433-438, 1995.
[17] U. Feige, “A Fast Randomized LOGSPACE Algorithm for Graph Connectivity,” Theoretical Computer Science, vol. 169, pp. 147-160, 1996.
[18] A. Fekete, N. Lynch, and A. Shvartsman, “Specifying and Using a Partitionable Group Communication Service,” ACM Trans. Computer Systems, vol. 19, no. 2, pp. 171-216, 2001.
[19] S. Ghosh, “Agents, Distributed Algorithms, and Stabilization,” Computing and Combinatorics, 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 Symp. Parallel Algorithms and Architectures, pp. 251-260, 1999.
[21] T. Herman and T. Masuzawa, “Self-Stabilizing Agent Traversal,” Proc. Fifth Workshop Self-Stabilizing Systems, pp. 152-166, 2001.
[22] IETF Mobile Ad hoc Networks (MANET) Working Group, , 2005.
[23] A. Israeli and M. Jalfon, “Token Management Schemes and Random Walks Yield Self-Stabilizing Mutual Exclusion,” Proc. Ninth Ann. ACM Symp. Principles of Distributed Computing, pp. 119-131, 1990.
[24] T. Imielinski and H.F. Korth, Mobile Computing. Academic Publishers, 1996.
[25] N.A. Lynch, “Fast Allocation of Nearby Resources in a Distributed System,” Proc. 12th ACM Symp. Theory of Computing, pp. 70-81, 1980.
[26] L. Lovasz, “Random Walks on Graphs: A Survey,” Combinatorics, Paul Erdos is Eighty, vol. 2, pp. 353-398, Budapest: Janos Bolyai Mathematical Society, 1996.
[27] M. Mihail and C.H. Papadimitriou, “On the Random Walk Method for Protocol Testing,” Proc. Conf. Computer Aided Verification, pp. 132-141, 1994.
[28] G. Neiger, “A New Look at Membership Service,” Proc. 15th ACM Symp. Principles of Distributed Computing, pp. 331-340, 1996.
[29] NS2 Network Simulator,, 1989.
[30] V.D. Park and M.S. Corson, “A Highly Adaptive Distributed Routing Algorithm for Mobile Wireless Networks,” Proc. IEEE INFOCOM Conf., pp. 1405-1413, Apr. 1997.
[31] B. Rajagopalan and P. McKinley, “A Token-Based Protocol for Reliable, Ordered Multicast Communication,” Proc. Eighth IEEE Symp. Reliable Distributed Systems, pp. 84-93, Oct. 1989.
[32] J. Sussman and K. Marzullo, “The Bancomat Problem: An Example of Resource Allocation in a Partitionable Asynchronous System,” Proc. 12th Int'l Symp. Distributed Computing (DISC), 1998.
[33] A.S. Tanenbaum, Computer Networks. Prentice Hall, 1996.
[34] B. Lange and Y. Aridor, “Agent Transfer Protocol— ATP/0.1,” 1999, .

Index Terms:
Ad hoc networks, group communication, self-stabilization, random walk.
Shlomi Dolev, Elad Schiller, Jennifer L. Welch, "Random Walk for Self-Stabilizing Group Communication in Ad Hoc Networks," IEEE Transactions on Mobile Computing, vol. 5, no. 7, pp. 893-905, July 2006, doi:10.1109/TMC.2006.104
Usage of this product signifies your acceptance of the Terms of Use.