Pith. sign in

REVIEW

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

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2205.09378 v3 pith:O5G52BDD submitted 2022-05-19 cs.IT eess.SPmath.IT

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

classification cs.IT eess.SPmath.IT
keywords powercontrolrelayselectionsum-ratealgorithmmaximizingjoint
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
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.

discussion (0)

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