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

H. Attiya and J. Welch, Distributed computing: fundamentals, simulations and advanced topics, 2004.

L. Barenboim and M. Elkin, Distributed graph coloring, fundamental and recent developments, 2014.

L. Barenboim, M. Elkin, and F. Kuhn, Distributed (Delta+1)-coloring in linear (in Delta) time, SIAM Journal of Computing, vol.43, issue.1, pp.72-95, 2014.

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

L. Cowen, W. Goddard, and C. E. Jesurum, Defective coloring revisited, Journal of Graph Theory, pp.205-219, 1997.

O. Chipara, C. Lu, J. Stankovic, R. , and G. , Dynamic conflict-free transmission scheduling for sensor network queries, IEEE Transactions on Mobile Computing, vol.10, issue.5, pp.734-748, 2011.

C. Pettie, S. Su, and H. , Distributed Algorithms for the Lovász Local Lemma and Graph Coloring, Proc. 33th ACM Symposium Principles of Distributed Computing, 2014.

D. Frey, H. Lakhlef, and R. M. , Optimal collision/conflict-free distance-2 coloring in wireless broadcast/receive synchronous tree networks, Proc. 45th Conf. on Parallel Processing, pp.350-359, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01396940

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, pp.387-398, 2004.

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, pp.45-58, 2004.

H. Hind, H. Molloy, M. , and R. B. , Colouring a graph frugally, Combinatorica, vol.17, issue.4, pp.469-482, 1997.

I. Jemili, D. Ghrab, A. Belghith, B. Derbel, and D. A. , Collision aware coloring algorithm for wireless sensor networks, Proc. 9th Int'l Wireless Communication and Mobile Computing Conference (IWCMC'13), pp.1546-1553, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00808332

R. J. Kang and T. Müller, Frugal, acyclic and star colourings of graphs, Discrete Applied Mathematics, vol.159, pp.1806-1814, 2011.

H. Lakhlef, R. Raynal, and T. F. , Vertex Coloring with Communication and Local Memory Constraints in Synchronous Broadcast Networks, 12th International Symposium on Algorithms and Experiments for Wireless Sensor Networks, 2016.
URL : https://hal.archives-ouvertes.fr/hal-01300095

N. A. Lynch, Distributed algorithms, p.872, 1996.

S. Mahfoudh, G. Chalhoub, P. Minet, M. Misson, and A. I. , Node coloring and color conflict detection in wireless sensor networks, Future Internet, vol.2, issue.4, p.469, 2010.
URL : https://hal.archives-ouvertes.fr/hal-01593138

M. Molloy and B. R. , Graph colouring and the probabilistic method, Algorithms and combinatorics, vol.23, 2002.

M. Molloy and B. Reed, Asymptotically optimal frugal colouring, J. Comb. Theory Ser, vol.100, issue.2, pp.226-246, 2010.

L. Narayanan, Channel assignment and graph multicoloring. Handbook of wireless networks and mobile computing, 2002.

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

A. Raychaudhuri, Further results on T-coloring and frequency assignment problems, SIAM Journal on Discrete Mathematics, vol.7, pp.605-613, 1994.

M. Raynal, Fault-tolerant agreement in synchronous message-passing systems, 2010.
URL : https://hal.archives-ouvertes.fr/inria-00543049

M. Raynal, Distributed algorithms for message-passing systems, vol.500, 2013.
URL : https://hal.archives-ouvertes.fr/hal-00922219

I. Rhee, A. Warrier, J. Min, and L. Xu, Drand: Distributed randomized TDMA scheduling for wireless ad-hoc networks, IEEE Transactions on Mobile Computing, issue.8, pp.1384-1396, 2009.

X. Zhang, J. Hong, L. Zhang, X. Shan, and V. O. Li, CC-TDMA: Coloring-and coding-based multi-channel TDMA scheduling for wireless ad hoc networks, IEEE Wireless Communications and Networking Conference (WCNC), 2007.

, He obtained his Ph.D. degree from the University of Franche-Comté in 2014 in France. He obtained his Master's degree from the University of Picardie Jules Verne in 2011 in France. He served as a PC member for several conferences as IEEE, Hicham Lakhlef has been an Associate Professor, 2015.