A log-star distributed maximal independent set algorithm for growth-bounded graphs

Proceedings of the Annual ACM Symposium on Principles of Distributed Computing

Volumn , Issue , 2008, Pages 35-44

  Schneider, Johannes ^a   Wattenhofer, Roger ^a  

^a ETH ZURICH   (Switzerland)

Author keywords

Ad hoc networks; Coloring; Connected dominating sets; Dominating sets; Growth bounded graphs; Local algorithms; Maximal independent sets; Parallel algorithms; Radio networks; Sensor networks; Symmetry breaking; Unit disk graphs

Indexed keywords

AD HOC NETWORKS; COLORING; DISTRIBUTED COMPUTER SYSTEMS; MOBILE TELECOMMUNICATION SYSTEMS; PARALLEL ALGORITHMS; SENSOR NETWORKS;

CONNECTED DOMINATING SET; DOMINATING SETS; LOCAL ALGORITHM; MAXIMAL INDEPENDENT SET; RADIO NETWORKS; SYMMETRY-BREAKING; UNIT DISK GRAPHS;

GRAPHIC METHODS;

EID: 57549109279     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1145/1400751.1400758     Document Type: Conference Paper

References (19)

1. N. Alon, L. Babai, and A. Itai. A fast and simple randomized parallel algorithm for the maximal independent set problem. J. Algorithms, 7(4):567-583, 1986.
2. K. Alzoubi, X. Li, Y. Wang, P. Wan, and O. Frieder. Geometric Spanners for Wireless Ad Hoc Networks. IEEE Transactions on Parallel and Distributed Systems, 14(5), 2003.
3. A. Andersson, T. Hagerup, S. Nilsson, and R. Raman. Sorting in Linear Time. Journal of Computer and System Sciences, 57:74-93, 1998.
4. B. Awerbuch, A. V. Goldberg, M. Luby, and S. A. Plotkin. Network decomposition and locality in distributed computation. In Proceedings of the 30 th Symposium on Foundations of Computer Science (FOCS), pages 364-369, 1989.
5. G. V. B Awerbuch. Distributed program checking: a paradigm for buildingself-stabilizing distributed protocols. In Proceedings of the 32nd Annual Symposium on Foundations of Computer Science (FOCS), 1991.
6. R. Cole and U. Vishkin. Deterministic Coin Tossing with Applications to Optimal Parallel List Ranking. Inf. Control, 70(1):32-54, 1986.
7. th ACM Symposium on Principles of Distributed Computing (PODC), 2007.
8. A. Goldberg, S. Plotkin, and G. Shannon. Parallel Symmetry-Breaking in Sparse Graphs. SIAM Journal on Discrete Mathematics (SIDMA), 1(4):434-446, 1988.
9. A. Israeli and A. Itai. A Fast and Simple Randomized Parallel Algorithm for Maximal Matching. Information Processing Letters, 22:77-80, 1986.
10. th Int. Symposium on Distributed Computing (DISC), 2005.
11. rd ACM Joint Workshop on Foundations of Mobile Computing (DIALM-POMC), 2005.
12. th ACM Symp. on Principles of Distributed Computing (PODC), pages 60-68, 2005.
13. F. Kuhn, T. Moscibroda, and R. Wattenhofer. What Cannot Be Computed Locally! In Proc. of the 23rd ACM Symp. on Principles of Distributed Computing (PODC), pages 300-309, 2005.
14. C. Lenzen and R. Wattenhofer. Leveraging lineal's locality limit. In Submission.
15. N. Linial. Locality in Distributed Graph Algorithms. SIAM Journal on Computing, 21(1):193-201, 1992.
16. M. Luby. A Simple Parallel Algorithm for the Maximal Independent Set Problem. SIAM Journal on Computing, 15:1036-1053, 1986.
17. th ACM Symp. on Principles of Distributed Computing (PODC), pages 148-157, 2005.
18. A. Panconesi and A. Srinivasan. Improved distributed algorithms for coloring and network decomposition problems. In Proc. of the 24th annual ACM symposium on Theory of computing (STOC), pages 581-592. ACM Press, 1992.
19. J. Schneider and R. Wattenhofer. An Asymptotically Optimal Distributed Maximal Independent Set Algorithm for Wireless Networks with Collision Detection. In Submission.