A Non-Cooperative Approach to the Joint Subcarrier and Power Allocation Problem in Multi-Service SCFDMA Networks

E E Tsiropoulou,S Papavassiliou,I Ziras

doi:10.4108/eai.20-6-2016.151515

E E Tsiropoulou, S Papavassiliou + Show 1 more

Open Access

https://doi.org/10.4108/eai.20-6-2016.151515

Copy DOI

Abstract

In this paper a joint resource allocation problem is studied in a multi-service Single Carrier FDMA (SC-FDMA) wireless network. Mobile users request various services with different Quality of Service (QoS) characteristics and they determine in a distributed and non-cooperative manner a joint subcarr

Highlights

Demands for media rich wireless services have brought much attention to high speed broadband mobile wireless techniques in recent years
Distributed non-cooperative BArgaining model for Resource allocation problem (MUD-BAR problem) in Section 2.2, for completeness purposes in the following we present user’s adopted utility function, as well as the corresponding Quality of Service (QoS) requirements imposed by the different type of services
The results reveal that users’ uplink transmission power is decreased (Fig. 10) in the distributed FDMA (D-FDMA) scenario and their utility is increased (Fig. 11) due to the fact that each subcarrier is allocated to the user that presents the highest channel gain for the specific subcarrier

Summary

Introduction

Demands for media rich wireless services have brought much attention to high speed broadband mobile wireless techniques in recent years. Aiming at overall system’s throughput optimization, a greedy algorithm has been proposed in [5], which determines the subcarrier with the highest channel gain among all available subcarriers and allocates it to the user. In MA, a matrix is created containing the actual transmission rate for each user per each subcarrier. The pair (user, subcarrier) with the highest actual transmission rate is determined and the specific subcarrier is allocated to the corresponding user. Considering the STBA, it creates a matrix containing the achievable rate for each user at each subcarrier and at each iteration selects the two best pairs, i.e. For each pair deletes the corresponding row and column, till all elements are eliminated (i.e. the matrix becomes of size 1x1). The subcarrier allocation with the highest sum achievable rate is selected. All the above subcarrier allocation algorithms adopt EBEP allocation with respect to power, i.e. user’s uplink maximum transmission power is distributed among user’s occupied subcarriers [4]

Objectives

Results

Conclusion