Distributed Algorithm for Multi-Channel Wireless Networks with Low Complexity

Equipping multi-channel in wireless networks brings not only an improved capacity region but also high challenge in designing joint channel-assignment and scheduling algorithms. With regard to the distributed and online strategies under multi- channel network systems, the implementation complexity is non-negligible and much higher than that of the single-channel cases. In this paper, we propose a low-complexity throughput guaranteed distributed policy, i.e., LDCSA, in multi- channel Ad hoc wireless networks, which has the property of low complexity, i.e., the computation time of the algorithm is low and increases neither with the size of network nor with the number of available channels. It is proved that the capacity region achieved by LDCSA can be arbitrarily close to that of other comparable maximal matching-based scheduling algorithms.