Spectrum Allocation in Wireless Networks with Duplexing Constraints

A new spectrum allocation scheme is developed to satisfy the fundamental duplexing constraint in wireless networks. A feasible spectrum allocation is achieved through dividing the whole spectrum into multiple sub-bands and activating conflict-free links on each sub-band. It is found that the minimum number of sub-bands needed to yield a feasible spectrum allocation grows asymptotically at a logarithmic rate with the chromatic number. We design a simple distributed and asynchronous algorithm which yields a feasible spectrum allocation given enough sub-bands.