Elements of information theory
Elements of information theory
Linear programs and related problems
Linear programs and related problems
Fair end-to-end window-based congestion control
IEEE/ACM Transactions on Networking (TON)
SCHEDULING IN A QUEUING SYSTEM WITH ASYNCHRONOUSLY VARYING SERVICE RATES
Probability in the Engineering and Informational Sciences
Maximizing Queueing Network Utility Subject to Stability: Greedy Primal-Dual Algorithm
Queueing Systems: Theory and Applications
Downlink scheduling and resource allocation for OFDM systems
IEEE Transactions on Wireless Communications
Efficient subcarrier, power, and rate allocation with fairness consideration for OFDMA uplink
IEEE Transactions on Wireless Communications - Part 1
Low complexity subcarrier and power allocation for utility maximization in uplink OFDMA systems
IEEE Transactions on Wireless Communications - Part 1
Fundamental design issues for the future Internet
IEEE Journal on Selected Areas in Communications
Downlink scheduling and resource allocation for OFDM systems
IEEE Transactions on Wireless Communications
Scheduling and resource allocation for SVC streaming over OFDM downlink systems
IEEE Transactions on Circuits and Systems for Video Technology
A block-based OFDM decode-and-forward relaying scheme for cooperative wireless networks
ISCIT'09 Proceedings of the 9th international conference on Communications and information technologies
Optimal feedback allocation algorithms for multi-user uplink
Allerton'09 Proceedings of the 47th annual Allerton conference on Communication, control, and computing
Efficient resource allocation with flexible channel cooperation in OFDMA cognitive radio networks
INFOCOM'10 Proceedings of the 29th conference on Information communications
On optimal feedback allocation in multichannel wireless downlinks
Proceedings of the eleventh ACM international symposium on Mobile ad hoc networking and computing
Utility-based power control with QoS support
Wireless Networks
A fast power allocation strategy for OFDM systems
IEEE Transactions on Communications
Optimal OFDMA downlink scheduling under a control signaling cost constraint
IEEE Transactions on Communications
Computer Networks: The International Journal of Computer and Telecommunications Networking
LTE uplink scheduling - flow level analysis
MACOM'11 Proceedings of the 4th international conference on Multiple access communications
A utility-based algorithm for joint uplink/downlink scheduling in wireless cellular networks
Journal of Network and Computer Applications
On distributed power control and transceiver optimization in wireless networks
Proceedings of the 5th International ICST Conference on Performance Evaluation Methodologies and Tools
Resource allocation via sum-rate maximization in the uplink of multi-cell OFDMA networks
Wireless Communications & Mobile Computing
A slot-based BS scheduling with maximum latency guarantee and capacity first in 802.16e networks
International Journal of Communication Systems
McPAO: A Distributed Multi-channel Power Allocation and Optimization Algorithm for Femtocells
Mobile Networks and Applications
International Journal of Communication Systems
Approaching throughput optimality with limited feedback in multichannel wireless downlink networks
IEEE/ACM Transactions on Networking (TON)
Hi-index | 0.00 |
Orthogonal Frequency Division Multiplexing (OFDM) with dynamic scheduling and resource allocation is a key component of most emerging broadband wireless access networks such as WiMAX and LTE (Long Term Evolution) for 3GPP. However, scheduling and resource allocation in an OFDM system is complicated, especially in the uplink due to two reasons: (i) the discrete nature of subchannel assignments, and (ii) the heterogeneity of the users' subchannel conditions, individual resource constraints and application requirements. We approach this problem using a gradient-based scheduling framework. Physical layer resources (bandwidth and power) are allocated to maximize the projection onto the gradient of a total system utility function which models application-layer Quality of Service (QoS). This is formulated as a convex optimization problem and solved using a dual decomposition approach. This optimal solution has prohibitively high computational complexity but reveals guiding principles that we use to generate lower complexity sub-optimal algorithms. We analyze the complexity and compare the performance of these algorithms via extensive simulations.