Energy-Aware Relay Selection and Power Allocation for Multiple-User Cooperative Networks
Sabyasachi Gupta, Ranjan Bose

TL;DR
This paper proposes novel relay selection and power allocation strategies for multi-user cooperative networks, optimizing network lifetime under SER constraints with algorithms balancing performance and complexity.
Contribution
Introduces a minimum bottleneck matching algorithm and a suboptimal relay selection method for improved network lifetime in cooperative networks.
Findings
MBM algorithm achieves maximum network lifetime.
SRS algorithm offers near-optimal performance with lower complexity.
GLM policy outperforms MWTP policy in network lifetime.
Abstract
This paper investigates the relay assignment and power allocation problem for two different network power management policies: group lifetime maximization (GLM) and minimum weighted total power (MWTP), with the aim of lifetime maximization in symbol error rate (SER) constrained multipleuser cooperative network. With optimal power allocation solution obtained for each policy, we show that the optimal relay assignment can be obtained using bottleneck matching (BM) algorithm and minimum weighted matching (MWM) algorithm for GLM and MWTP policies, respectively. Since relay assignment with BM algorithm is not power efficient, we propose a novel minimum bottleneck matching (MBM) algorithm to solve the relay assignment problem optimally for GLM policy. To further reduce the complexity of the relay assignment, we propose suboptimal relay selection (SRS) algorithm which has linear complexity in…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
