Link Scheduling And Channel Assignment With A Graph Spectral Clustering Approach

We tackle the challenging problem of link scheduling and channel assignment in multi-channel, multi-hop wireless networks, aiming to achieve high network throughput. We adopt the signed graph spectral clustering algorithm to solve this problem heuristically, by jointly considering channel gain and mutual interference. The basic idea is to cluster links with smaller mutual interference and allocate channels with a higher gain. Simulation results demonstrate the advantages of our proposed algorithm over a benchmark scheme in terms of minimum link throughput and sum throughput.