JOURNAL ARTICLE

Dynamic resource allocation with finite buffer constraint in broadband OFDMA networks

Abstract

This paper presents a dynamic resource allocation scheme for OFDMA-based wireless broadband networks. The problem of maximizing the total packet throughput subject to individual user's outage probability constraint is formulated. The proposed algorithm assumes a finite buffer for the arrival packets and dynamically allocates the radio resource based on users' channel characteristics, traffic patterns and QoS requirements. By performing the radio resource allocation into two steps, namely bandwidth allocation and channel assignment, efficient admission control is realized with low complexity. Specifically, the number of channels to be assigned to each user is first determined based on its traffic requirement and the average SNR. The second stage of the algorithm finds the best channel allocation for the users. Simulations show that the algorithm yields significant lower outage probability and higher throughput than existing multiple access methods.

Keywords:
Computer science Computer network Throughput Resource allocation Network packet Quality of service Channel allocation schemes Max-min fairness Broadband networks Channel (broadcasting) Bandwidth (computing) Frequency-division multiple access Wireless network Resource management (computing) Wireless Broadband Orthogonal frequency-division multiplexing Telecommunications

Metrics

75
Cited By
8.26
FWCI (Field Weighted Citation Impact)
13
Refs
0.98
Citation Normalized Percentile
Is in top 1%
Is in top 10%

Citation History

Topics

Advanced Wireless Network Optimization
Physical Sciences →  Engineering →  Electrical and Electronic Engineering
Wireless Communication Networks Research
Physical Sciences →  Computer Science →  Computer Networks and Communications
Advanced MIMO Systems Optimization
Physical Sciences →  Engineering →  Electrical and Electronic Engineering

Related Documents

© 2026 ScienceGate Book Chapters — All rights reserved.