Research for Cluster Channel Assignment in WIA-PA

In wireless resource assigning, WIA-PA adopts the combination of distributed method and centralized method with which the intra-cluster and inter-cluster communication resources are assigned centralizedly. The problem of intra-cluster resources (that is, the cluster channel) assigning is actually the problem of graph coloring, which can be solved by the proposed algorithm based on set theory to satisfy the real time requirement of WIA-PA cluster channel assigning. Every set maintains the vertexes that is not adjacent and can be colored the same color. It assigned new accessing router and at the same time it reserved the original assigned policy which can save the time for updating information. Through the analysis of the algorithm, it implements good capability used to solve the problem of cluster channel assigning.