Abstract

Joint bandwidth and power allocation in wireless multi-user decode and forward relay networks is proposed in this paper for maximizing the number of admissible users. A suboptimal greedy search algorithm is developed to solve the admission control problem efficiently at low complexity. The condition under which the greedy search is optimal is found. The way we derive such optimality condition for the greedy search can serve as a benchmark for other applications of greedy search. The advantages of the suboptimal greedy search algorithm compared to exhaustive search algorithm are shown.

Talk to us

Join us for a 30 min session where you can share your feedback and ask us any queries you have

Schedule a call

Disclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.