A Power Allocation Algorithm Based on Variational Inequality Problem for Cognitive Radio Networks

Ming-Yue Zhou and Xiao-Hui Zhao
Volume: 13, No: 2, Page: 417 ~ 427, Year: 2017
10.3745/JIPS.03.0068
Keywords: Cognitive Radio, Power Allocation, Variational Inequality
Full Text:

Abstract
Power allocation is an important factor for cognitive radio networks to achieve higher communication capacity and faster equilibrium. This paper considers power allocation problem to each cognitive user to maximize capacity of the cognitive systems subject to the constraints on the total power of each cognitive user and the interference levels of the primary user. Since this power control problem can be formulated as a mixed-integer nonlinear programming (NP) equivalent to variational inequality (VI) problem in convex polyhedron which can be transformed into complementary problem (CP), we utilize modified projection method to solve this CP problem instead of finding NP solution and give a power control allocation algorithm with a subcarrier allocation scheme. Simulation results show that the proposed algorithm performs well and effectively reduces the system power consumption with almost maximum capacity while achieve Nash equilibrium.

Article Statistics
Multiple requests among the same broswer session are counted as one view (or download).
If you mouse over a chart, a box will show the data point's value.


Cite this article
IEEE Style
Ming-Yue Zhou and Xiao-Hui Zhao, "A Power Allocation Algorithm Based on Variational Inequality Problem for Cognitive Radio Networks ," Journal of Information Processing Systems, vol. 13, no. 2, pp. 417~427, 2017. DOI: 10.3745/JIPS.03.0068.

ACM Style
Ming-Yue Zhou and Xiao-Hui Zhao, "A Power Allocation Algorithm Based on Variational Inequality Problem for Cognitive Radio Networks ," Journal of Information Processing Systems, 13, 2, (2017), 417~427. DOI: 10.3745/JIPS.03.0068.