Date Added: Dec 2010
Judiciously assigning channels to a wireless mesh network can substantially enhance capacity of the network. One particular flavor of mesh network is that with a tree topology, which has the property that all traffic passes through one central point. Usually the allocation problem is linked to problems of routing, load, and measurements of interference. In this paper, the authors take advantage of the restrictions on the routing, and on potential load imposed by the topology, to present an allocation algorithm that is tailored for wireless trees.