# A clear statement of the research objectives of the project. To develop and compare algorithms (more precisely, heuristics) for graph coloring in the asynchronous distributed model of computing. # A discussion of why it is interesting. 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. Many variant heurstics are possible and we need to compare these. # A brief summary of the background to be assimilated and techniques required. Only elementary graph theory concepts are required; enough to understand why this is a hard problem. Programming will be done in python (for prototyping) and later in C or C++ (for speed), all under linux. We will start by investigating experimentally (by computer simulation) two basic problems: to choose channels so that the whole system operates without interference; and, if this is not possible, to choose channels so that total interference is minimized. # A list of prospective deliverables. A document summarizing results and a software platform suitable for further developement. # An indication of the relation to end/downstream users: who should benefit from this [line of] research? BT and other home-hub providers are very interested in this field in order to maximize performance and minimize interference of wifi users. Furthermore there is a major Ofcom consultation in progress on licensing of cognitive wireless devices (i.e. those which use spectrum intelligently). # A brief outline of avenues for a follow-up PhD project. If simulations are encouraging, there is great potential for theoretical analysis of complexity, speed of convergence, etc. of the methods. But I suspect that even simulation results alone can be developed a long way.