The world of mobile devices is moving towards autonomous behaviour. This means that no central authority decides things like wireless channel allocation and transmission power level. Devices must behave according to rules which ensure peaceful co-operation. To design these rules is a hard challenge. We work by investigating experimentally (by computer simulation) the basic problem of choosing channels so that the whole system operates without interference. The overall theme is asynchronous distributed heuristics.

In 2010, James Evans did a good project in this area. Since his work, I have become aware of two possible directions for another project.

   1. I have proved a new theorem which says that any graph has a ?-coloring in which each node's color is at most its degree plus 1. This should allow us to reduce the size of the search space, and thus speed up the performance of the distributed heuristics, as well as making them more local. This needs to be researched.
   2. The paper http://front.math.ucdavis.edu/1011.5349 looks very interesting. Can we compare this method with some of our own?