Interference Bound for Local Channel Allocation

Abstract

A lower bound of the total co-channel interference is proposed for the channel allocation problem when applied to a reduced set of nodes. The rest of the network nodes remain unaffected. This bound is independent of the particular channel allocation algorithm employed and no assumptions are made about the propagation model or the deployment scenario. Assuming that the bound is tight to the interference generated by the optimal channel allocation, its computation may help, for example, to estimate the minimum set of nodes for which channel allocation performs nearly-optimal while minimizing node reconfigurations. Another example of usage is the estimation of the minimum number of channels required for a given performance. The tightness of the proposed bound is evaluated through simulations, with a difference lower than 1 % in the conducted simulations. In addition, a sample use case—adaptive local channel allocation—is also provided.