Search

Equal allocation of bandwidth and/or power may not be efficient for wireless multi-user networks with limited bandwidth and power resources. Optimal joint bandwidth and power allocation strategies for wireless multi-user networks with and without relaying are proposed in this paper for 1) the maximization of the sum capacity of all users; 2) the maximization of the worst user capacity; and 3) the minimization of the total power consumption of all users. It is shown that the proposed allocation problems are convex and, therefore, can be solved efficiently. Moreover, joint bandwidth and power allocation for admission control is considered. A suboptimal greedy search algorithm is developed to solve the admission control problem efficiently. Instructive analysis of the greedy search shows that it can achieve good performance, and the condition under which the greedy search is optimal is derived. The formal and in-depth analysis of the greedy search algorithm presented in this paper can serve as a benchmark for analyzing similar algorithms in other applications. The performance improvements offered by the proposed optimal joint bandwidth and power allocation are demonstrated by simulations. The advantages of the suboptimal greedy search algorithm for admission control are also shown in numerical results. [ABSTRACT FROM PUBLISHER]