A self-stabilizing distributed algorithm for spanning tree construction in wireless ad hoc networks

Journal of Parallel and Distributed Computing

Volumn 63, Issue 1, 2003, Pages 97-104

  Baala, Hichem ^a   Flauzac, Oliver ^b   Gaber, Jaafar ^c   Bui, Marc ^d   El Ghazawi, Tarek ^e  

^a UNIVERSITÉ DE CERGY PONTOISE   (France)

^b UNIVERSITÉ DE REIMS CHAMPAGNE ARDENNE   (France)

^c UNIVERSITÉ DE TECHNOLOGIE DE BELFORT MONTBÉLIARD   (France)

^d UNIVERSITÉ PARIS 8   (France)

^e The George Washington University   (United States)

Author keywords

Ad hoc wireless networks; Distributed algorithms; Mobile agents; Mobile computing; Mobile networks; Random spanning tree; Random walks; Self stabilizing algorithms

Indexed keywords

EID: 0038286240     PISSN: 07437315     EISSN: None     Source Type: Journal    
DOI: 10.1016/S0743-7315(02)00028-X     Document Type: Article

References (22)

1. R.G. Gallager, P.A. Humblet, P.M. Spira, A distributed algorithm for minimum weight spanning trees, TOPLAS 5 (1) (1983) 66-77.
2. I. Lavallée, G. Roucairol, A fully distributed spanning tree algorithm, Inform. Process. Lett. 23 (2) (1986) 55-62.
3. J.A. Garay, S. Kutten, D. Peleg, A sub-linear time distributed algorithm for minimum-weight spanning trees, in: 34th Annual Symposium on Foundations of Computer Science, Palo Alto, CA, November 3-5, 1993, pp. 659-668.
4. A. Israeli, M. Jalfon, Token management schemes and random walks yields self-stabilizing mutual exclusion, in: Proceedings of the Ninth ACM Symposium on Principles of Distributed Computing, 1990.
5. E. Anagnostou, R. El-Yaniv, More on the power of random walks: uniform randomized algorithms, in: Proceedings of the Fifth International Workshop on Distributed Algorithms and Graphs, Delphi, Greece, 1991, pp. 31-51.
6. P. Tetali, P. Winkler, On a random walk problem arising in self-stabilizing token management, Proceedings of the 10th ACM Symposium on the Principles of Distributed Computing, Montreal, Quebec, Canada, July 1991, pp. 273-280.
7. M. Bui, A.K. Datta, O. Flauzac, D.T. Nguyen, Randomized adaptive routing based on mobile agents, in: Proceedings of the Fourth International Symposium on Parallel Architectures, Algorithms and Networks (ISPAN'99), Perth, Australia, June 23-25, 1999, pp. 380-385.
8. M. Bui, D.T. Nguyen, O. Flauzac, Routing tables maintenance with mobile agents, in: 15th Triennial Conference of the International Federation of Operational Research Societies (IFORS'99), Beijing, China, August 16-20, 1999, 67pp.
9. D. Deugo, Mobile agents for electing a leader autonomous decentralized systems, Proceedings of the Fourth International Symposium on Autonomous Decentralized Systems, Tokyo, Japan, March 20-23, 1999, pp. 324-327.
10. E. Chang, Echo algorithms: depth parallel operations on general graphs, IEEE Trans. Software Eng. 8 (4) (1982) 391-401.
11. A. Segall, Distributed network protocols, IEEE Trans. Inform. Theory 29 (1) (1983) 23-35.
12. G. Florin, C.R. Gomez, I. Lavallée, Recursive distributed programming schemes, in: Proceedings of ISADS'93, Kawazaki, Japan, March-April, 1993.
13. H. Baala. Vague Récursive Distribuée: application aux arbres de jeux et aux matrices, Thèse de Doctorat, Université Paris 8, Saint-Denis, Juin 1999.
14. K. Nakano, S. Olariu, Randomized initialization protocols for ad hoc networks, IEEE Trans. Parallel Distributed Systems 11 (7) (July 2000) 749-759.
15. E.W. Dijkstra, Self stabilizing systems in spite of distributed control, Commun. ACM 17 (1974) 643-644.
16. E. Korach, S. Kutten, S. Moran, A modular technique for the design of efficient distributed leader finding algorithms, ACM Trans. Programming Languages Systems 12 (1) (1990) 84-101.
17. E.W. Dijkstra, C.S. Scholten, Termination detection for diffusing computations, Inform. Process. Lett. 11 (1) (1980) 1-4.
18. P. Winkler, Dependent percolation and colliding random walks, Random Structures & Algorithms 16 (1) (2000) 58-84.
19. D. Aldous, L. Lovász, P. Winkler, Mixing times for uniformly ergodic Markov chains, Stochastic Process. Appl. 71 (1997) 165-185.
20. N.H. Bshouty, L. Higham, J. Warpechowska-Gruca, Meeting times of random walks on graphs, http://www.cpsc.ucalgary.ca/~higham/papers.html, 1995.
21. R. Motwani, P. Raghavan, Randomized Algorithms, Cambridge University Press, Cambridge, 1995.
22. P. Tetali, P. Winkler, Collisions among random walks on a graph, D. Coppersmith, SIAM J. Discrete Math. 6 (3) (1993) 363-374.