
This Article  
 
Share  
Bibliographic References  
Add to:  
Digg Furl Spurl Blink Simpy Del.icio.us Y!MyWeb  
Search  
 
ASCII Text  x  
Shlomi Dolev, Elad Schiller, Jennifer L. Welch, "Random Walk for SelfStabilizing Group Communication in Ad Hoc Networks," IEEE Transactions on Mobile Computing, vol. 5, no. 7, pp. 893905, July, 2006.  
BibTex  x  
@article{ 10.1109/TMC.2006.104, author = {Shlomi Dolev and Elad Schiller and Jennifer L. Welch}, title = {Random Walk for SelfStabilizing Group Communication in Ad Hoc Networks}, journal ={IEEE Transactions on Mobile Computing}, volume = {5}, number = {7}, issn = {15361233}, year = {2006}, pages = {893905}, doi = {http://doi.ieeecomputersociety.org/10.1109/TMC.2006.104}, publisher = {IEEE Computer Society}, address = {Los Alamitos, CA, USA}, }  
RefWorks Procite/RefMan/Endnote  x  
TY  JOUR JO  IEEE Transactions on Mobile Computing TI  Random Walk for SelfStabilizing Group Communication in Ad Hoc Networks IS  7 SN  15361233 SP893 EP905 EPD  893905 A1  Shlomi Dolev, A1  Elad Schiller, A1  Jennifer L. Welch, PY  2006 KW  Ad hoc networks KW  group communication KW  selfstabilization KW  random walk. VL  5 JA  IEEE Transactions on Mobile Computing ER   
[1] D. Aldous and J.A. Fill, Reversible Markov Chains and Random Walks on Graphs, Oct. 1999, http://www.stat.berkeley.edu/~aldousbook.html .
[2] N. Alfasi, “Cover Time Random Walk in Ad Hoc Networks,” Technical Report #0302, Dept. of Computer Science, BenGurion Univ. of the Negev, 2002.
[3] Y. Amir, L. Moser, P.M. MelliarSmith, D. Agrawal, and P. Ciarfella, “Fast Message Ordering and Membership Using a Logical TokenPassing Ring,” Proc. 13th IEEE Int'l Conf. Distributed Computing Systems, pp. 551560, 1993.
[4] J. Beauquier, T. Herault, and E. Schiller, “Easy SelfStabilization with an Agent” Proc. Fifth Workshop SelfStabilizing Systems, pp. 3550, 2001.
[5] T. Chandra, V. Hadzilacos, S. Toueg, and B. CharronBost, “On the Impossibility of Group Membership,” Proc. ACM Symp. Principles of Distributed Computing, pp. 322330, 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. 285299, 2001.
[7] G.V. Chockler, I. Keidar, and R. Vitenberg, “Group Communication Specifications: A Comprehensive Study,” ACM Computing Surveys, vol. 33, no. 4, pp. 143, 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. 535559, 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. 363374, Aug. 1993.
[10] F. Cristian and F. Schmuck, “Agreeing on Processor Group Membership in Asynchronous Distributed Systems,” Technical Report CSE95428, 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. 643644, 1974.
[13] S. Dolev, SelfStabilization. MIT Press, 2000.
[14] S. Dolev and E. Schiller, “Communication Adaptive SelfStabilizing Group Membership Service,” IEEE Trans. Parallel Distributed Systems, vol. 14, no. 7, pp. 709720, 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. 5154, 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. 433438, 1995.
[17] U. Feige, “A Fast Randomized LOGSPACE Algorithm for Graph Connectivity,” Theoretical Computer Science, vol. 169, pp. 147160, 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. 171216, 2001.
[19] S. Ghosh, “Agents, Distributed Algorithms, and Stabilization,” Computing and Combinatorics, pp. 242251, 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. 251260, 1999.
[21] T. Herman and T. Masuzawa, “SelfStabilizing Agent Traversal,” Proc. Fifth Workshop SelfStabilizing Systems, pp. 152166, 2001.
[22] IETF Mobile Ad hoc Networks (MANET) Working Group, http://www.ietf.org/html.chartersmanetcharter.html , 2005.
[23] A. Israeli and M. Jalfon, “Token Management Schemes and Random Walks Yield SelfStabilizing Mutual Exclusion,” Proc. Ninth Ann. ACM Symp. Principles of Distributed Computing, pp. 119131, 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. 7081, 1980.
[26] L. Lovasz, “Random Walks on Graphs: A Survey,” Combinatorics, Paul Erdos is Eighty, vol. 2, pp. 353398, 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. 132141, 1994.
[28] G. Neiger, “A New Look at Membership Service,” Proc. 15th ACM Symp. Principles of Distributed Computing, pp. 331340, 1996.
[29] NS2 Network Simulator, http://www.isi.edu/nsnamns/, 1989.
[30] V.D. Park and M.S. Corson, “A Highly Adaptive Distributed Routing Algorithm for Mobile Wireless Networks,” Proc. IEEE INFOCOM Conf., pp. 14051413, Apr. 1997.
[31] B. Rajagopalan and P. McKinley, “A TokenBased Protocol for Reliable, Ordered Multicast Communication,” Proc. Eighth IEEE Symp. Reliable Distributed Systems, pp. 8493, 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, http://www.trl.ibm.com/aglets/atpatp.htm .