An Algorithm for Efficient Resource Allocation in Realistic Wide Area Cellular Networks
Resource reuse at the system level is introduced for the realistic urban cellular environment. The authors' proposal for reuse is presented, and they give a mathematical requirement for allowing resources to be shared: specifically, they find the minimum distance which must separate all active links in order for a minimum SINR to be guaranteed. This sharing proposal results in an NP-hard scheduling problem. An algorithm is then given which allows resources to be shared in linear time, permitting their proposals to be implemented in today's deployed networks. Numerical results confirm the dual benefits of their reuse scheme, in terms of both throughput increases and decreased power consumption.