Geometric water filling algorithm for resource allocation in cognitive radio networks

Abstract

Water filling algorithm is a process of determining equalization strategies on channels in communication systems. This is a process of allocating power to the sub-channels depending on the amount of noise in that channel by a method of filling water in a vessel. In numerous designing issues, water-filling plays an important role in radio resource allocation (RRA). For communications, it originates from a class of the issues of maximizing the shared data between the input and the output of a channel with parallel autonomous sub-channels. With water-filling, more power is designated to the channels with higher additions to amplify the entire information rates or the capacity of all the channels. For RRA, a standout amongst the most normal issues is to illuminate power allocation utilizing the Conventional water filling (CWF). We are also going to use Recursive water filling algorithm to see its amount of wastage of power. In this paper, we are going to compare all the different types of water filling algorithms and find out which is more efficient and more reliable to use and work with.