D. Angluin, Local and global properties in networks of processors, Proc. 12th ACM Symposium on Theory of Computation (STOC'81, pp.82-93, 1981.

H. Attiya, A. Bar-noy, D. Dolev, D. Peleg, and R. R. , Renaming in an asynchronous environment, Journal of the ACM, vol.37, issue.3, pp.524-548, 1990.
DOI : 10.1145/79147.79158

H. Attiya and F. Ellen, Impossibility Results for Distributed Computing, Synthesis Lectures on Distributed Computing Theory, vol.5, issue.1, p.2014
DOI : 10.2200/S00551ED1V01Y201311DCT012

L. Barenboim and M. Elkin, Deterministic distributed vertex coloring in polylogarithmic time, Journal of the ACM, vol.58, issue.5, p.23, 2011.

L. Barenboim and M. Elkin, Distributed Graph Coloring: Fundamentals and Recent Developments, Synthesis Lectures on Distributed Computing Theory, vol.4, issue.1, 2014.
DOI : 10.2200/S00520ED1V01Y201307DCT011

L. Barenboim, M. Elkin, and F. Kuhn, Distributed $(\Delta+1)$-Coloring in Linear (in $\Delta$) Time, SIAM Journal on Computing, vol.43, issue.1, pp.72-95, 2014.
DOI : 10.1137/12088848X

J. Blair and F. Manne, An efficient self-stabilizing distance-2 coloring algorithm, Proc. 16th Colloquium on Structural Information and Communication Complexity (SIROCCO'10), Springer LNCS 5869, pp.237-251, 2009.

D. Bozdag, U. V. Gebremedhin, A. H. Manne, F. Boman, E. G. et al., A Parallel Distance-2 Graph Coloring Algorithm for Distributed Memory Computers, Proc. Int'l Conference on High Performance Computing and Communications (HPCC'05), Springer LNCS 3726, pp.796-806, 2005.
DOI : 10.1007/11557654_90

D. Bozdag, A. S. Gebremedhin, F. Manne, G. Boman, C. et al., A framework for scalable greedy coloring on distributed-memory parallel computers, Journal of Parallel and Distributed Computing, vol.68, issue.4, pp.515-535, 2008.
DOI : 10.1016/j.jpdc.2007.08.002

A. Castañeda, S. Rajsbaum, and M. , The renaming problem in shared memory systems: An introduction, Computer Science Review, vol.5, issue.3, pp.229-251, 2011.
DOI : 10.1016/j.cosrev.2011.04.001

O. Chipara, C. Lu, J. Stankovic, and R. , Dynamic Conflict-Free Transmission Scheduling for Sensor Network Queries, IEEE Transactions on Mobile Computing, vol.10, issue.5, pp.734-748, 2011.
DOI : 10.1109/TMC.2010.209

R. Cole and U. Vishkin, Deterministic coin tossing with applications to optimal parallel list ranking, Information and Control, vol.70, issue.1, pp.32-53, 1986.
DOI : 10.1016/S0019-9958(86)80023-7

D. Dolev, M. Klawe, and R. M. , An O(n log n) unidirectional distributed algorithm for extrema finding in a circle, Journal of Algorithms, vol.3, issue.3, pp.245-260, 1982.
DOI : 10.1016/0196-6774(82)90023-2

S. C. Ergen and P. Varaiya, PEDAMACS: power efficient and delay aware medium access protocol for sensor networks, IEEE Transactions on Mobile Computing, vol.5, issue.7, pp.920-930, 2005.
DOI : 10.1109/TMC.2006.100

M. Gairing, W. Goddard, S. T. Hedetniemi, P. Kristiansen, and A. A. Mcrae, DISTANCE-TWO INFORMATION IN SELF-STABILIZING ALGORITHMS, Parallel Processing Letters, vol.14, issue.03n04, pp.3-04387, 2004.
DOI : 10.1142/S0129626404001970

M. R. Garey and D. S. Johnson, Computers and intractability: a guide to the theory of NP-completeness, p.340, 1979.

A. H. Gebremedhin, F. Manne, and A. Pothen, Parallel Distance-k Coloring Algorithms for Numerical Optimization, Proc. Euro-Par Parallel Processing, pp.912-921, 2002.
DOI : 10.1007/3-540-45706-2_130

A. Goldberg, S. Plotkin, and S. G. , Parallel Symmetry-Breaking in Sparse Graphs, SIAM Journal on Discrete Mathematics, vol.1, issue.4, pp.434-446, 1988.
DOI : 10.1137/0401044

T. Herman and S. Tixeuil, A Distributed TDMA Slot Assignment Algorithm for Wireless Sensor Networks, Proc. Int'l Workshop on Algorithmic Aspects of Wireless Sensor Networks (ALGOSENSORS'04), Springer LNCS 3121, pp.45-58, 2004.
DOI : 10.1007/978-3-540-27820-7_6

D. Imbs, S. Rajsbaum, and M. , The universe of symmetry breaking tasks, Proc. 18th Colloquium on Structural Information and Communication Complexity (SIROCCO'11), Springer LNCS 6796, pp.66-77, 2011.
URL : https://hal.archives-ouvertes.fr/inria-00560453

I. Jemili, D. Ghrab, A. Belghith, B. Derbel, and A. Dhraief, Collision aware coloring algorithm for wireless sensor networks, 2013 9th International Wireless Communications and Mobile Computing Conference (IWCMC), pp.1546-1553, 2013.
DOI : 10.1109/IWCMC.2013.6583786
URL : https://hal.archives-ouvertes.fr/hal-00808332

F. Kuhn and R. Wattenhofer, On the complexity of distributed graph coloring, Proceedings of the twenty-fifth annual ACM symposium on Principles of distributed computing , PODC '06, pp.7-15, 2006.
DOI : 10.1145/1146381.1146387

N. Linial, Locality in Distributed Graph Algorithms, SIAM Journal on Computing, vol.21, issue.1, pp.193-201, 1992.
DOI : 10.1137/0221015

N. A. Lynch, Upper bounds for static resource allocation in a distributed system, Journal of Computer and System Sciences, vol.23, issue.2, pp.254-278, 1981.
DOI : 10.1016/0022-0000(81)90015-5

S. Mahfoudh, G. Chalhoub, P. Minet, M. Misson, and I. Amdouni, Node Coloring and Color Conflict Detection in Wireless Sensor Networks, Future Internet, vol.2, issue.4, p.469, 2010.
DOI : 10.3390/fi2040469

D. Peleg, Distributed computing, a locally sensitive approach, SIAM Monographs on Discrete Mathematics and Applications, vol.343, 2000.

B. Prabhakar, E. Uysal-biyikoglu, E. Gamal, and A. , Energy-efficient packet transmission over awireless link, IEEE/ACM Transactions on Networking, vol.10, issue.4, p.487499, 2002.

M. Raynal, Algorithms for mutual exclusion. The MIT press, 1986.
URL : https://hal.archives-ouvertes.fr/inria-00075198

M. Raynal, Fault-tolerant Agreement in Synchronous Message-passing Systems, Synthesis Lectures on Distributed Computing Theory, vol.1, issue.1, p.2010
DOI : 10.2200/S00294ED1V01Y201009DCT003
URL : https://hal.archives-ouvertes.fr/inria-00543049

M. Raynal, Distributed algorithms for message-passing systems, 2013.
DOI : 10.1007/978-3-642-38123-2
URL : https://hal.archives-ouvertes.fr/hal-00922219

N. Santoro, Design and analysis of distributed algorithms, 2007.
DOI : 10.1002/0470072644