一种基于图N重着色理论的信道冲突模型

Channel Conflict Model Based on Graph N Multiple Coloring Theory

无线网络的信道分配问题是网络规划的重点,而信道冲突模型是信道分配的基础。通过对信道冲突模型的分析,可以估计该网络信道分配问题的规模,并得出理想条件下信道分配的结果。针对当前的信道冲突模型无法完整描述多射频多信道网络信道冲突情况的问题,提出图N重着色理论,以及基于图N重着色理论的信道冲突模型,并在图论运算基础上给出了模型建立和求解的方法。理论分析与仿真结果表明,该模型可完整描述多射频网络的信道冲突情况,突出了多个射频接口间的信道冲突问题,并将信道分配问题抽象为图N重着色问题,进而转化为一般的图着色问题,以便于信道分配问题的分析和求解。

Channel allocation problem is one of the key problems of wireless network planning. Meanwhile, channel conflict model is the basis of channel allocation. Through the analysis of the channel conflict model, can estimate the scale of the network channel allocation problem can be estimated, the channel allocation scheme in the ideal condition can be abtained. As the current channel conflict model can＇ t describe the collision on channel comprehensively, the graph N multiple coloring theory, the corresponding channel conflict model and the methods for establishing and solving model based on the graphics are proposed. The theoretical analysis and simulation results show that this model can describe the collision on channel comprehensively, prominent the channel allocation problem and transform it into coloring problem in order to analysis and solve the channel allocation problem.