Recently, joint subchannel allocation and (transmission) power control problems for multi-cell orthogonal frequencydivision multiple access (OFDMA) systems have been actively studied. However, since the problems are notoriously difficult and complex, only heuristic approaches are mainly used to study them instead of the optimal approach for achieving the maximum system capacity. In this paper, we study this problem from the point of the optimal subchannel allocation and power control aiming at maximizing the sum-rate of the multi-cell OFDMA system. By using a monotonic optimization approach, we develop an algorithm for the optimal subchannel allocation and power control that achieves the maximum sum-rate of the system. In addition, we also develop an algorithm that provides both upper and lower bounds on the maximum sum-rate of the system with lower computational complexity. To evaluate the tightness of the upper and lower bounds, we also study the conditions when the two bounds are close to each other so that they can be good approximations to the maximum sum-rate of the system. Through numerical results, we show that the bounds provide good approximations to the maximum sum-rate of the multi-cell OFDMA system in most cases.Index Terms-Multi-cell systems; OFDMA; subchannel allocation; power control; sum-rate maximization.0018-9545 (c)
In this paper, we propose a unified framework for opportunistic fair scheduling in wireless systems. We consider a TDMA type of multiple access scheme, in which only one user can be scheduled in each time-slot. For opportunistic fair scheduling in such a system, some nice frameworks have been developed in the previous works, such as this paper, we consider a more general problem that can accommodate more general types of fairness, and more general types of utility functions than those in the previous works. In addition to those generalizations, we develop a new framework for opportunistic fair scheduling based on the duality theory, which is different from those in the previous works. The duality theory is a well-defined theory in the mathematical optimization area. Hence, it can provide a unified framework for many different types of problems. In fact, we show that two different frameworks in Agrawal 41 (4): 2003) are special cases of ours. In addition, by using the unified framework developed in this paper, we can not only develop various opportunistic fair scheduling schemes but also analyze the developed algorithm more rigorously and systematically.
In this paper, we study an opportunistic scheduling problem in an OFDMA system, in which sub-carriers of the system are allocated to each user in each time slot considering the time-varying channel condition and QoS requirement of each user. We consider two different classes of services that are represented with different types of utility functions. The utility function for a user in one class is defined as a function of its average data rate, which can be applicable to best-effort services and the utility function for a user in the other class is defined as a function of its instantaneous data rate, which can be applicable to rate-sensitive services. Those two types of utility functions have been extensively considered in opportunistic scheduling in wireless networks. However, in most of the previous work, they are considered separately in different problems. In this paper, we formulate a stochastic optimization problem that can treat those two types of utility functions in a single problem, which enables us to implement an opportunistic scheduling algorithm that can consider those two classes of services in a single system in a unified way. Through simulations, we first show that our algorithm provides a good approximation to the optimal solution. In addition, we also verify the appropriateness of our utility models.
scite is a Brooklyn-based organization that helps researchers better discover and understand research articles through Smart Citations–citations that display the context of the citation and describe whether the article provides supporting or contrasting evidence. scite is used by students and researchers from around the world and is funded in part by the National Science Foundation and the National Institute on Drug Abuse of the National Institutes of Health.
customersupport@researchsolutions.com
10624 S. Eastern Ave., Ste. A-614
Henderson, NV 89052, USA
This site is protected by reCAPTCHA and the Google Privacy Policy and Terms of Service apply.
Copyright © 2025 scite LLC. All rights reserved.
Made with 💙 for researchers
Part of the Research Solutions Family.