Distributed Saturation Degree Methods for Code Assignment in Multihop Radio Networks

We present a new distributed algorithm for code assignment in a multihop radio network. The algorithm is based on the Saturation-Degree coloring scheme proposed in [1], which has proved better than earlier attempts at solving the problem. A crucial parameter of the proposed algorithm is the depth of the neighborhood that must be considered when a local decision must be taken. By tuning this parameter one can obtain a tradeoff between the quality of the solution and the number of parallel passes and exchanged messages. We analyze the results of our simulation programs where the proposed algorithm is compared with its sequential version and with competitive schemes proposed in the literature.