Local multicoloring algorithms: Computing a nearly-optimal TDMA schedule in constant time

Leibniz International Proceedings in Informatics, LIPIcs

Volumn 3, Issue , 2009, Pages 613-624

  Kuhn, Fabian ^a  

^a MASSACHUSETTS INSTITUTE OF TECHNOLOGY   (United States)

Author keywords

Distributed algorithms; Graph coloring; Local algorithms; Medium access control; Multicoloring; TDMA; Wireless networks

Indexed keywords

AD HOC AND SENSOR NETWORKS; DETERMINISTIC ALGORITHMS; DISTRIBUTED SYSTEMS; GRAPH COLORINGS; LOCAL ALGORITHM; MEDIUM ACCESS CONTROL PROTOCOLS; MULTICOLORING; WIRELESS AD HOC AND SENSOR NETWORKS;

ALGORITHMS; AUTONOMOUS AGENTS; COLOR; COMPUTER SCIENCE; FREQUENCY DIVISION MULTIPLE ACCESS; GRAPH THEORY; MEDIUM ACCESS CONTROL; OPTIMIZATION; PARALLEL ALGORITHMS; SENSOR NETWORKS; TIME DIVISION MULTIPLE ACCESS; WIRELESS NETWORKS;

CODE DIVISION MULTIPLE ACCESS;

EID: 84860109523     PISSN: 18688969     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (27)

1. B. Awerbuch, A. V. Goldberg, M. Luby, and S. A. Plotkin. Network decomposition and locality in distributed computation. In Proc. of 30th Symposium on Foundations of Computer Science (FOCS), pages 364-369, 1989.
2. B. Balasundaram and S. Butenko. Graph domination, coloring and cliques in telecommunications. In M. Resende and P. Pardalos, editors, Handbook of Optimization in Telecommunications, pages 865-890. Springer, 2006.
3. L. Barenboim and M. Elkin. Sublogarithmic distributed mis algorithm for sparse graphs using nash-williams decomposition. In Proc. of 27th ACM Symposium on Principles of Distributed Computing (PODC), 2008.
4. R. Cole and U. Vishkin. Deterministic coin tossing with applications to optimal parallel list ranking. Information and Control, 70(1):32-53, 1986.
5. A. Czygrinow, M. Hanćkowiak, and M. Karonski. Distributed O(δlogn)-edge-coloring algorithm. In Proc. of 9th Annual European Symposium on Algorithms (ESA), volume 2161 of LNCS, pages 345-355, 2001.
6. G. De Marco and A. Pelc. Fast distributed graph coloring with O(Δ) colors. InProc. of 12th ACM-SIAMSymposium on Discrete Algorithms (SODA), pages 630-635, 2001.
7. P. Erdos, P. Frankl, and Z. Füredi. Families of finite sets in which no set is covered by the union of r others. Israel Journal of Mathematics, 51:79-89, 1985.
8. C. Fortuin, J. Ginibre, and P. Kasteleyn. Correlation inequalities on some partially ordered sets. Comm. in Mathematical Physics, 22:89-103, 1971.
9. P. Fraigniaud, C. Gavoille, D. Ilcinkas, and A. Pelc. Distributed computing with advice: Information sensitivity of graph coloring. InProc. of 34th Int. Coll. on Automata, Languages and Programming, 2007.
10. S. Gandham, M. Dawande, and R. Prakash. Link scheduling in sensor networks: Distributed edge coloring revisited. In Proc. of 24th IEEE Conference on Computer Communications (INFOCOM), pages 2492-2501, 2005.
11. A. Goldberg, S. Plotkin, and G. Shannon. Parallel symmetry-breaking in sparse graphs. SIAM Journal on Discrete Mathematics, 1(4):434-446, 1988.
12. D. A. Grable and A. Panconesi. Nearly optimal distributed edge coloring in O(log log n) rounds. Random Structures and Algorithms, 10(3):385-405, 1997.
13. T. Herman and S. Tixeuil. A distributed TDMA slot assignment algorithm for wireless sensor networks. In Proc. of 1st Int. Workshop on Algorithmic Aspects of Wireless Sensor Networks, pages 45-58, 2004.
14. K. Kothapalli, M. Onus, C. Scheideler, and C. Schindelhauer. Distributed coloring in O(vlogn) bit rounds. In Proc. of 20th IEEE Int. Parallel and Distributed Processing Symposium (IPDPS), 2006.
15. F. Kuhn and R. Wattenhofer. On the complexity of distributed graph coloring. InProc. of 25th ACM Symposium on Principles of Distributed Computing (PODC), pages 7-15, 2006.
16. N. Linial. Locality in distributed graph algorithms. SIAM Journal on Computing, 21(1):193-201, 1992.
17. M. Luby. A simple parallel algorithm for the maximal independent set problem. SIAM Journal on Computing, 15:1036-1053, 1986.
18. S. Mecke. MAC layer and coloring. In D. Wagner and R. Wattenhofer, editors, Algorithms for Sensor and Ad Hoc Networks, pages 63-80, 2007.
19. T. Moscibroda and R. Wattenhofer. Coloring unstructured radio networks. InProc. of 17th ACM Symposium on Parallelism in Algorithms and Architectures (SPAA), pages 39-48, 2005.
20. M. Naor and L. Stockmeyer. What can be computed locally? In Proc. of 25th ACM Symposium on Theory of Computing (STOC), pages 184-193, 1993.
21. A. Panconesi and A. Srinivasan. On the complexity of distributed network decomposition. Journal of Algorithms, 20(2):581-592, 1995.
22. A. Panconesi and A. Srinivasan. Randomized distributed edge coloring via an extension of the chernoff-hoeffding bounds. SIAM Journal on Computing, 26(2): 350-368, 1997.
23. A. Pelc. Personal communication.
24. S. Ramanathan. A unified framework and algorithm for channel assignment in wireless networks. Wireless Networks, 5:81-94, 1999.
25. I. Rhee, A. Warrier, J. Min, and L. Xu. DRAND: Distributed randomized TDMA scheduling for wireless ad-hoc networks. In 7thACMSymp. on Mobile Ad Hoc Networking and Computing (MOBIHOC), pages 190-201, 2006.
26. J. Schneider and R. Wattenhofer. A log-star distributed maximal independent set algorithm for growth-bounded graphs. In Proc. of 27th ACM Symposium on Principles of Distributed Computing (PODC), 2008.
27. X. Zhang, J. Hong, L. Zhang, X. Shan, and V. Li. CP-TDMA: Coloring- and probability-based TDMA scheduling for wireless ad hoc networks. IEICE Transactions on Communication, E91-B(1):322-326, 2008.