Geometric Water filling Algorithm For Resource Allocation In Cognitive Radio Networks
C.S. Preetham1, G. Srikanth2, Jinkala Anil Kumar3, Sean Savio Harper4, Shaik Ashiq5, C.Sriram6
1Dr.C.S. Preetham Reddy, Electronic and Communication Engineering, K.L Educational Foundation, Guntur , (Andhra Pradesh), India.
2G. Srikanth, Electronics and Communication Engineering, K.L Educational Foundation, Guntur , (Andhra Pradesh), India.
3Jinkala Anil Kumar, Electronic and Communication Engineering, K.L Educational Foundation, Guntur , (Andhra Pradesh), India.
4Sean Savio Harper, Electronic and Communication Engineering, K.L Educational Foundation, Guntur, (Andhra Pradesh), India.
5Shaik Ashiq, Electronic and Communication Engineering, K.L Educational Foundation, Guntur, I(Andhra Pradesh), India.
6Sriram Chitturi, Electronic and Communication Engineering, K.L Educational Foundation, Guntur , (Andhra Pradesh), India.
Manuscript received on 23 March 2019 | Revised Manuscript received on 30 March 2019 | Manuscript published on 30 March 2019 | PP: 1697-1701 | Volume-7 Issue-6, March 2019 | Retrieval Number: F2188037619/19©BEIESP
Open Access | Ethics and Policies | Cite | Mendeley | Indexing and Abstracting
© The Authors. Blue Eyes Intelligence Engineering and Sciences Publication (BEIESP). This is an open access article under the CC-BY-NC-ND license (http://creativecommons.org/licenses/by-nc-nd/4.0/)
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.
Keywords: Conventional water filling, Geometric water filling, Power allocation, Recursive water filling, Water Filling.
Scope of the Article: Adhoc and Sensor Networks