Dynamic resource allocation algorithm in multi-user cooperative OFDMA systems: considering QoS and fairness constraints

Wireless transmission systems are constrained by several parameters such as the available spectrum bandwidth, mobile battery energy, transmission channel impairments and users’ minimum quality-of-service. In this paper, a new strategy is investigated that aims at improving the allocation of resource...

Full description

Saved in:
Bibliographic Details
Published in:Wireless networks Vol. 18; no. 4; pp. 365 - 380
Main Authors: Banizaman, Hamed, Almodarresi, Seyed Mohammad Taghi
Format: Journal Article
Language:English
Published: Boston Springer US 01.05.2012
Springer Nature B.V
Subjects:
Algorithms
Allocations
Channels
Communications Engineering
Computer Communication Networks
Cooperation
Dynamical systems
Dynamics
Electrical Engineering
Engineering
IT in Business
Mathematical models
Network management systems
Networks
Optimization
Performance evaluation
Quality of service
Spectrum allocation
Studies
Wireless communications
Wireless networks
Dynamic resource allocation
Cooperative relaying
Multi-user orthogonal frequency division multiplexing
Fairness
Quality of service
ISSN:1022-0038, 1572-8196
Online Access:Get full text
Tags: Add Tag
No Tags, Be the first to tag this record!
Description
Summary:Wireless transmission systems are constrained by several parameters such as the available spectrum bandwidth, mobile battery energy, transmission channel impairments and users’ minimum quality-of-service. In this paper, a new strategy is investigated that aims at improving the allocation of resources in a dual hop OFDMA cooperative network consisting in multi source–destination pairs and multiple decode-and-forward relays. First, the joint optimization of three types of resources: power, sub-channel and relay nodes, is formulated as a problem of subchannel-relay assignment and power allocation, with the objective of minimizing overall transmission power under the bit-error-rate and data rate constraints. However, the optimal solution to the optimization problem is computationally complex to obtain and may be unfair. Assuming knowledge of the instantaneous channel gains for all links in the entire network, an iterative three-step resource allocation algorithm with low complexity is proposed. In order to guarantee the fairness of users, several fairness criteria are also proposed to provide attractive trade-offs between network performance (i.e. overall transmission power, average network lifetime and average outage probability) and fairness to all users. Numerical studies are conducted to evaluate the performance of the proposed algorithm in two practical scenarios. Simulation results show that the proposed allocation algorithm achieves an efficient trade-off between network performance and fairness among users.
Bibliography:SourceType-Scholarly Journals-1
ObjectType-Feature-1
content type line 14
ObjectType-Article-2
content type line 23
ISSN:1022-0038
1572-8196
DOI:10.1007/s11276-011-0405-0