Exact Resource Allocation for Fair Wireless Relay
Edgar Arribas, Vicent Cholvi, Vincenzo Mancuso

TL;DR
This paper presents an exact, low-complexity resource allocation scheme for relay-enabled cellular networks that ensures max-min fairness among users, significantly outperforming existing solutions.
Contribution
It introduces a novel linear-complexity scheme for fair resource allocation in relay networks, addressing the intertwined allocation challenges.
Findings
The scheme achieves max-min fairness across users.
It has linear complexity relative to users and relays.
It outperforms current resource allocation methods.
Abstract
In relay-enabled cellular networks, the intertwined nature of network agents calls for complex schemes to allocate wireless resources. Resources need to be distributed among mobile users while considering how relay resources are allocated, and constrained by the traffic rate achievable by base stations and over backhaul links. In this letter, we derive an exact resource allocation scheme that achieves max-min fairness across mobile users, found with a linear complexity with respect to the number of mobile users and relays. The results reveal that the proposed scheme remarkably outperforms current solutions.
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.
Taxonomy
TopicsCooperative Communication and Network Coding · Advanced Wireless Network Optimization · Mobile Ad Hoc Networks
