Loading [MathJax]/extensions/MathZoom.js
Swift Resource Allocation in Wireless Networks | IEEE Journals & Magazine | IEEE Xplore

Swift Resource Allocation in Wireless Networks


Abstract:

Multiple linear constraint water filling problem (MLWFP) is solved innovatively in this paper, in which powers allotted to the T resources of the transmitting user maximi...Show More

Abstract:

Multiple linear constraint water filling problem (MLWFP) is solved innovatively in this paper, in which powers allotted to the T resources of the transmitting user maximize the capacity of the transmitting user while controlling the interference to all the surrounded users of the wireless network. MLWFP is solved previously using iterative algorithms that take more number of iterations, thus, increasing the computational complexity. Unlike prior algorithms, the uniqueness of the proposed algorithm is in detecting the tight bounds for the number of nonzero powers S. Subsequently, S is calculated from its bounds. This makes it possible for the proposed algorithm to compute S nonzero powers alone (using the closed-form solution), whereas all the prior algorithms find powers iteratively for all T (> S) resources. Thus, the worst case computational complexity of the proposed algorithm is reduced manyfold and is considerably lower than that of the prior algorithms by a factor of O(T2). Simulation results justify the analysis of the proposed algorithm.
Published in: IEEE Transactions on Vehicular Technology ( Volume: 67, Issue: 7, July 2018)
Page(s): 5965 - 5979
Date of Publication: 14 February 2018

ISSN Information:

Funding Agency:


References

References is not available for this document.