Distributed node coloring in the SINR model

Proceedings - International Conference on Distributed Computing Systems

Volumn , Issue , 2010, Pages 708-717

  Derbel, Bilel ^a   Talbi, El Ghazali ^a  

^a UNIV LILLE   (France)

Author keywords

[No Author keywords available]

Indexed keywords

COLORING ALGORITHMS; DISTRIBUTED ALGORITHM; DISTRIBUTED NODES; DISTRIBUTED SCHEDULING; GRAPH-BASED MODELS; MAC PROTOCOL; MAXIMUM DEGREE; MESSAGE PASSING ALGORITHM; NODE UNITS; PHYSICAL MODEL; RADIO NETWORKS; RUNNING TIME; SIGNAL TO INTERFERENCE PLUS NOISE RATIO; TIME SLOTS;

ALGORITHMS; COLOR; COMPUTER SIMULATION; MESSAGE PASSING; NETWORK PROTOCOLS;

COLORING;

EID: 77955913775     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: 10.1109/ICDCS.2010.35     Document Type: Conference Paper

References (29)

1. T. Moscibroda and R. Wattenhofer, "Coloring unstructured radio networks," Distributed Computing, vol. 21, no. 4, pp. 271-284, 2008.
2. th Symposium on Principles of Distributed Computing (PODC'09), 2009, pp. 210-219.
3. P. Gupta and P. R. Kumar, "The capacity of wireless networks," Transactions on Information Theory, vol. 46, no. 2, pp. 388-404, 2000.
4. th International Parallel and Distributed Processing Symposium (IPDPS'06), 2006.
5. st Symposium on Theory of Computing (STOC'89), 1989, pp. 274-285.
6. A. Panconesi and A. Srinivasan, "On the complexity of distributed network decomposition," Journal of Algorithms, vol. 20, no. 2, pp. 356-374, 1996.
7. M. Luby, "A simple parallel algorithm for the maximal independent set problem," SIAM Journal on Computing, vol. 15, no. 4, pp. 1036-1053, 1986.
8. N. Linial, "Locality in distributed graphs algorithms," SIAM Journal on Computing, vol. 21, no. 1, pp. 193-201, 1992.
9. th Symposium on Principles of Distributed Computing (PODC'08), 2008, pp. 35-44.
10. F. Kuhn, "Local multicoloring algorithms: Computing a nearly-optimal tdma schedule in constant time," in Symposium on Theoretical Aspects of Computer Science (STACS'09), 2009, pp. 613-624.
11. D. Peleg, Distributed Computing: A Locality-Sensitive Approach. SIAM Monographs on Discrete Mathematics and Applications, 2000.
12. K. Kothapalli, C. Scheideler, M. Onus, and C. Schindelhauer, "Distributed coloring in o(√log n) bit rounds," in International Parallel and Distributed Processing Symposium (IPDPS'06), 2006, p. 24.
13. th Symposium on Principles of Distributed Computing (PODC'06), 2006, pp. 7-15.
14. A. Goldberg and S. Plotkin, "Parallel (δ + 1)-coloring of constant-degree graphs," Information Processing Letters, vol. 25, no. 4, pp. 241-245, 1987.
15. th Symposium on Parallelism in Algorithms and Architectures (SPAA'05), 2005, pp. 39-48.
16. th Workshop on Foundations of mobile computing, 2008, pp. 45-54.
17. th Symposium on Mobile ad hoc networking and computing, 2007, pp. 100-109.
18. th Conference on Mobile Computing and Networking, 2006, pp. 2-13.
19. th Symposium on Mobile ad hoc networking and computing, 2006, pp. 310-321.
20. th Symposium on Mobile ad hoc networking and computing, 2008, pp. 91-100.
21. O. Goussevskaia, T. Moscibroda, and R. Wattenhofer, "Local broadcasting in the physical interference model," in Workshop on Foundations of Mobile Computing, 2008, pp. 35-44.
22. th Workshop on Algorithmic Aspects of Wireless Sensor Networks, 2009, pp. 116-127.
23. th Conference on Mobile Computing and Networking, 2006, pp. 262-273.
24. rd International Parallel and Distributed Processing Symposium (IPDPS'09), 2009, pp. 1-8.
25. th Symposium on Principles of Distributed Computing (PODC'09), 2009, pp. 200-209.
26. th Conference on Mobile Computing and Networking, 2003, pp. 66-80.
27. J. Grönkvist and A. Hansson, "Comparison between graph-based and interference-based stdma scheduling," in Symposium on Mobile ad-hoc Netorking and Computing, 2001, pp. 255-258.
28. J. Grönkvist, Interference-Based Scheduling in Spatial Reuse TDMA. PhD thesis, 2005.
29. th International Conference on Distributed Computing and Networking (ICDCN'10), 2010, pp. 155-166.