Pith

open record

sign in

arxiv: 2205.09378 · v3 · pith:O5G52BDD · submitted 2022-05-19 · cs.IT · eess.SP· math.IT

Joint Relay Selection and Power Control that aims to Maximize Sum-Rate in Multi-Hop Networks

Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:O5G52BDDrecord.jsonopen to challenge →

classification cs.IT eess.SPmath.IT
keywords powercontrolrelayselectionsum-ratealgorithmmaximizingjoint
0
0 comments X
read the original abstract

Focusing on the joint relay selection and power control problem with a view to maximizing the sum-rate, we propose a novel sub-optimal algorithm that iterates between relay selection and power control. The relay selection is performed by maximizing the minimum signal-to-interference-plus-noise-ratio (as opposed to maximizing the sum-rate) and the power control is performed using a successive convex approximation. By comparing the proposed algorithm with existing solutions via extensive simulations, we show that the proposed algorithm results in significant sum-rate gains. Finally, we analyze the two-user multi-hop network and show that optimum transmit power of at least for two transmitting nodes can be found using binary power allocation.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.