Research Article
A Joint Optimal Algorithm Based on Relay Nodes Selection and Power Allocation
512 downloads
@INPROCEEDINGS{10.1007/978-3-642-30493-4_31, author={Zhao Shen and Daiyu Fu and Yu Jin}, title={A Joint Optimal Algorithm Based on Relay Nodes Selection and Power Allocation}, proceedings={Wireless Internet. 6th International ICST Conference, WICON 2011, Xi’an, China, October 19-21, 2011, Revised Selected Papers}, proceedings_a={WICON}, year={2012}, month={10}, keywords={Relay convex optimization nodes selection power allocation}, doi={10.1007/978-3-642-30493-4_31} }- Zhao Shen
Daiyu Fu
Yu Jin
Year: 2012
A Joint Optimal Algorithm Based on Relay Nodes Selection and Power Allocation
WICON
Springer
DOI: 10.1007/978-3-642-30493-4_31
Abstract
In this paper, we proposed a joint optimal algorithm based on relay nodes selection and power allocation, which utilizes the theory utility maximization modeling system by adopting convex optimization, and obtains the optimal power allocation between source node and relay nodes by applying the Karush-Kuhn-Tucker (KKT) condition. In addition, the relay nodes allocated with power unequal to zero are the selected relay nodes, therefore, the selection of relay nodes is realized. Moreover, the optimal number of relay nodes is discussed. Simulation results show that the proposed algorithm achieves a better performance than the traditional equal power allocation algorithm.
Copyright © 2011–2025 ICST
