Admission control-based joint bandwidth and power allocation in multi-user DF relay networks

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.