Quicker solution for interference reduction in wireless networks

Abstract

In this study, a closed-form solution is presented for the constrained water-filling problem (CWFP) where in powers allocated to the user resources maximise the user's capacity under an interference constraint and a total power constraint. Total power constraint in CWFP is to save the energy in wireless network. To solve CWFP, erstwhile algorithms compute powers for all the resources iteratively. Unlike existing algorithms, the proposed method calculates the number of resources that gets positive (or non-zero) powers using the concepts of traditional water-filling problem. Later, powers are allocated to the resolved resources (that gets positive powers) alone using the closed-form solution, which reduces the number of computations. It can be discerned that the computational complexity of the given solution is of the order of , where is the total number of resources; which is remarkably lower than that of the prior algorithms specified by an order of .