In a 1-fair alternator of a network of concurrent processors, no processor executes the critical step twice when one or more other processors have not executed the critical step yet. In this paper, two algorithms are proposed to solve the coloring (1-fair alternator design) problem on the de Bruijn network. The first one uses 2\left\lceil {\log _n k} \right\rceil +1 colors to color the k-ary de Bruijn graph with two digits, while the second one uses p + 1 only colors, where \left( {\mathop {p - 1}\limits_{\left\lfloor {(p - 1)/2} \right\rfloor } } \right) \le k \leqslant \left( {\mathop p\limits_{\left\lfloor {p/2} \right\rfloor } } \right). The second coloring method is optimal when k = \left( {\mathop p\limits_{\left\lfloor {p/2} \right\rfloor } } \right). Furthermore, the extension of our coloring method can be applied to the k-ary de Bruijn graph with three or more digits.