Study on channel assignment algorithm in multi-radio sensor networks

For the sake of reducing communication conflicts and channel interference furthest, this paper studies the upper-bounds of channels and radios of conflict-free communication in Multi-Radio Multi-Channel sensor networks. We prove theoretically that when the networks communication radius NCR > 3 × Dis(P_K) and the Sensor Size of the networks is greater than 2K+1, the upper-bound of channels of conflict-free communication is Δ(CG), in which K is the power levels of the networks, Dis(P_K) is the communication radius of the largest power P_K of the networks and Δ(CG) is the largest degree of the conflict graph of the networks. Based on the above upper-bound, a channel assignment algorithm is proposed. Theoretical analysis and experimental results indicate that the channel assignment algorithm this paper proposed can improve the communication efficiency of sensor networks significantly, and then increase the networks throughput.