Quick resource allocation in heterogeneous networks

In this paper, an innovative technique is given to reduce the implementation time taken for doing the seamless communication in heterogeneous networks. When a new user arrives into the locality of one of the heterogeneous networks, resource allocation is to be done fastly by that heterogeneous network so as not to interrupt the data transfer to the newly arrived user. To do this, heterogeneous network allots optimal powers to S channels for maximizing the capacity of the newly arrived user while confirming to the interference bounds of the other users of the heterogeneous network and at the same time preserving the power (to save the energy) in heterogeneous network. To resolve this power allocation problem, the proposed algorithm finds out the tight lower bound and tight upper bound to the number of positive powers (\(=N\)) first and then finds out the indices of positive power allotted channels thereby discerning N itself (so as to calculate N powers exclusively). This is the unprecedented method as existing algorithms are iterative algorithms that deal with all of the assigned S channels. Hence, the proposed algorithm reduces the worst-case computational complexity of the erstwhile algorithms by the factor of \(O(S^2)\).