Studying the global implementation of the RRM model in the network. For interference mitigation suggests that at any time, one and only one, DFPC can be implemented in the network. This condition results in a conflict between the local optimal DFPC in each cell and the global optimal DFPC in the net- work which increases the importance of studying the network globally. Addressing the DFPCs dynamic behavior according to the network topology, load conditions, and user’s distribution by identifying the optimal DFPC periodical changes that aims to maximize the utilization of the network resources. Using a newly approach in formulating the problem as a joint optimization of the NSE and power consumption to increase the ROI from the network. The problem solution presented identifies the optimal DFPC that achieves the maximum central utility in the net- work. A comparison between the performance of the pro- posed scheme and other rate adaptive resource allocation schemes is conducted. The results show that the proposed scheme is capable of decreasing the amount of power consumed in the network while maintaining high values for the achievable NSE. The optimal solution demonstrates a high computation complexity. Thus, for practical implementation purposes a suboptimal greedy heuristic algorithm is proposed to reduce the complexity of the optimal solution. The computational complexity analysis for the proposed suboptimal greedy algorithm shows that it is a polynomial-time algorithm.