A maximum dispersion approach for rate feasibility problems in SINR model

Abstract

In this paper, we propose a maximum dispersion based approach for the problem of determining the feasibility of a set of single-hop rates in SINR model. Recent algorithmic work on capacity maximization has focused on maximizing the number of simultaneously scheduled links. We show that such an approach is not suitable for the problem. We present a polynomial time algorithm to determine the feasibility. We present several simulation results to evaluate the proposed approach. The results confirm that maximum dispersion-based approach is well suited for the problem and that such an approach performs significantly better than the existing work.