This paper proposes a novel heuristic approach to the infeasible power control problem [i.e., no power allocation can provide users with specified quality of service (QoS)] in wireless communication systems. In such infeasible cases, it has been in great demand to increase the number of accepted users (i.e., users provided with the specified QoS) by certain distributed algorithms, which require no communication among base stations (BSs). The number of accepted users is often suppressed by a small number of users in severe environments, hence removing such users obviously helps many other users be accepted. The proposed algorithm, which is fully distributed, detects and removes such users based on simple criteria including: (a) the QoS is below the necessary level, and (b) the BS is already transmitting with the maximum possible power to the user. Simulation results demonstrate that the proposed algorithm significantly increases the number of accepted users with low computational complexity.