Radio resource allocation problems for OFDMA cellular systems

https://doi.org/10.1016/j.cor.2008.02.018Get rights and content

Abstract

Orthogonal frequency division multiple-access (OFDMA) manages to efficiently exploit the inherent multi-user diversity of a cellular system by performing dynamic resource allocation. Radio resource allocation is the technique that assigns to each user in the system a subset of the available radio resources (mainly power and bandwidth) according to a certain optimality criterion on the basis of the experienced link quality. In this paper we address the problem of resource allocation in the downlink of a multi-cellular OFDMA system. The allocation problem is formulated with the goal of minimizing the transmitted power subject to individual rate constraint for each user. Exact and heuristic algorithms are proposed for the both the single-cell and the multi-cell scenario. In particular, we show that in the single-cell scenario the allocation problem can be efficiently solved following a network flow approach. In the multi-cell scenario we assume that all cells use the same frequencies and therefore the allocation problem is complicated by the presence of strong multiple access interference. We prove that the problem is strongly NP-hard, and we present an exact approach based on an MILP formulation. We also propose two heuristic algorithms designed to be simple and fast. All algorithms are tested and evaluated through an experimental campaign on simulated instances. Experimental results show that, although suboptimal, a Lagrangian-based heuristic consisting in solving a series of minimum network cost flow problems is attractive for practical implementation, both for the quality of the solutions and for the small computational times.

Introduction

Wireless cellular networks provide mobile radio access to an ever-increasing number of users with seamless coverage for voice and data services. Nonetheless, the great commercial success of mobile services has pushed to the limit the capacity of existing networks and poses great demands on the deployment of future systems based on new technologies. As a result, regulator bodies are undergoing an active standardization phase [1], [2], [3], [4] to define next generation cellular networks, which are expected to provide rich and diverse multimedia services with very high data rates, possibly greater than 100 Mbps. Most of the candidate technologies of future generation broadband wireless networks employ a multi-carrier multiple access scheme based on the orthogonal frequency division modulation (OFDM) [5], [6]. Among the attractive features of multi-carrier technology [7], there is its robustness to channel distortions and its granular resource allocation capability [8], [9], [10], [11]. In a multi-carrier system the transmitted data flow is divided into several substreams that are modulated over different sub-channels, called sub-carriers. Typically, the system is designed so that the sub-carriers remain orthogonal also when the propagation channel is severely frequency selective.

In an OFDMA system a different subset of sub-carriers is assigned to each user in a cell. If the transmitter possesses full knowledge of the propagation channel, an intrinsic advantage of OFDMA over other multiple access methods is its capability to exploit the multi-user diversity embedded in diverse frequency-selective channels. In recent years resource allocation has been envisaged as one of the most efficient techniques to increase the performance of multi-carrier systems. In fact, propagation channels are independent for each user and thus the sub-carriers that are in a deep fade for one user may be good ones for another. Following the path open by the seminal article by Wong et al. [12], many resource allocation algorithms have been proposed to take advantage of both the frequency selective nature of the channel and the multi-user diversity. Most of the works in literature follow either the margin adaptive approach, formulating dynamic resource allocation with the goal of minimizing the transmitted power with a rate constraint for each user [13], [14] or the rate adaptive approach aiming at maximizing the overall rate with a power constraint [15], [16], [17]. In this latter case, the optimal solution for resource allocation in the downlink is often found as an application of the well-known water-filling algorithm. In particular, in [16] the authors show that OFDMA is the optimal multiple access scheme in a multiuser multi-carrier downlink system. Capacity is maximized by assigning each subcarrier to the user with the maximum channel gain on it and distributing the power over subcarriers using the water-filling solution with respect to the allocated channel gains. In such scenarios, enforcing some sort of fairness among users might become a critical issue and therefore some authors consider the joint scheduling-allocation problem following a cross-layer approach [18], [19]. All these works only consider allocation in a single cell. Because of its complexity, resource allocation in multi-cellular systems has not been fully studied yet and only few works tackle the problem [20], [21], [22], [25].

In this paper we focus on the downlink of both a single-cell and a multi-cellular system with universal frequency reuse. Allocation is performed following a margin adaptive approach so as to minimize the overall transmission power while providing a given transmission rate to each user. One of the major advantages of implementing an efficient resource allocation strategy in the multi-cellular scenario is the mitigation of multiple-access interference (MAI). Since the frequency reuse factor is set to one, all cells transmit on same spectrum and minimizing the overall transmission power results also in a minimization of interference. To simplify the allocation problem we follow the same assumptions made in [19] and adopt just one transmission format per user. The performance loss due to the use of a single transmission format is partially compensated by the so called multi-user diversity. In fact, as a consequence of resource allocation, the mean value of the gains of the assigned channels is larger than in the case of channel-independent allocation. The larger the number of users, the larger is the set of channels over which to perform the allocation and the larger is the multi-user diversity gain. Thus, link adaptation becomes progressively a less effective measure. For the given allocation problem, exact and heuristic algorithms are proposed. Performance of the proposed allocation algorithms are given in terms of requested transmission power for a given system throughput, and comparisons with an approach from the literature is given as well. Even if we focus on the allocation problem without tailoring specific applications, the proposed schemes may have many and important practical implementations in real systems, e.g., in WiMAX OFDMA point to multi-point (PMP) broadband wireless access networks [23], as it will be discussed in the next section.

The paper is organized as follows. Section 2 describes the system model. Section 3 introduces the single-cell scenario, i.e., a scenario where no extra cell interference is present, and proposes a polynomial algorithm which is based on a network flow formulation. Section 4 introduces the multi-cell scenario and addresses the computational complexity of the problem. In particular, we show that the multi-cell sub-carrier allocation problem is strongly NP-hard. In 5 A MILP formulation for MCRRAP, 6 Heuristic algorithms for MCRRAP, a MILP formulation and heuristic algorithms are, respectively, presented for the multi-cell case. In Section 7, experimental results are presented and discussed. Finally, Section 8, provides conclusive remarks.

Section snippets

System model

We consider the downlink of an OFDMA system, in which the overall frequency bandwidth of a block of transmission, i.e., a radio frame, is divided into m sub-carriers. The propagation channel is frequency selective and quasi static, i.e., it does not vary within a block of transmission. Moreover, the coherence bandwidth of the channel is larger than the bandwidth spanned by each sub-carrier. In this way, each sub-carrier is affected by flat fading, i.e., it is not distorted by the channel but

Single-cell scenario

The problem in the single-cell scenario is formally described in the following. We are given a set of sub-carriers M={1,,m}, a set of users U={1,,n} in the cell. Transmission requirements for a given user i set the corresponding rate Ri. Due to interference phenomena, users cannot share sub-carriers.

Given a certain signal-to-interference ratio (SIR), the ideal rate achievable on a channel that spans a bandwidth B is R=Bη, where η=log2(1+SIR) is the channel spectral efficiency in bit/s/Hz.

Multi-cell scenario

In this section, the problem of sub-carrier allocation in OFDMA cellular systems for downlink transmissions in the Multi-cell scenario is considered. In particular, we address the problem of allocating sub-carriers among users, in such a way that users transmission requirements, in terms of transmission quality and throughput, are satisfied. The objective is of minimizing the overall transmission power.

The problem in the multi-cell scenario is formally described in the following. We are given a

A MILP formulation for MCRRAP

Let xij be a binary variable equal to 1 if user i is assigned sub-carrier j (and 0 otherwise), and let pi(j) be a positive real variable denoting the transmission power allocated for user i on sub-carrier j. The MCRRAP can be formulated as follows:miniU,jMpi(j),iUk,jMpi(j)pmaxkk,pi(j)Qxiji,j,Gi(j)pi(j)-h,b(h)b(i)SIRiGib(h)(j)ph(j)SIRiBN0(1-Q(1-xij))i,j,iUkxij1k,j,jxij=rii,pi(j)SIRi(j)BN0Gi(j)xiji,j,pi(j)0i,j,xij{0,1}i,j.The objective function accounts for the overall

Heuristic algorithms for MCRRAP

Since small computational times are required for solving MCRRAP, as pointed out in Section 2, different heuristic approaches have been developed for the problem. In particular, two algorithms are proposed. Namely, an iterative procedure based on solving several single cell assignment problems, called Multi-Assign, and a multi-start algorithm, based on a greedy procedure, in the following referred to as Multi-Start.

Multi-Assign is based on a network flow approach, and it consists in iteratively

Computational experiments

We test the heuristic algorithms presented in Section 6 on randomly generated problems, and compare their performances with algorithm Dec. [19], and with the solution provided by a truncated branch and bound algorithm solving the MILP formulation of Section 5. All algorithms have been coded in C, CPLEX 9.1 has been used for solving the formulation, and all the experiments have been performed on a 1.6 GHz Pentium M laptop equipped with 1 GB RAM.

To test the algorithms, two sets of instances,

Conclusion and future research

In this paper the radio resource allocation in an OFDMA cellular system has been addressed. In particular, both the single-cell and the multi-cell scenario have been addressed, and exact and heuristic algorithms for sub-carriers allocation in the downlink transmissions have been proposed. An extensive experimental campaign on random instances has shown the practical implementation of some of the proposed approaches. Future research directions include the development and testing of new

Acknowledgments

The authors thank one anonymous referee for the constructive comments and suggestions that enhanced the quality of the paper.

References (25)

  • IEEE Std 802.16e-2005 and IEEE Std 802.16-2004/Cor 1-2005. IEEE standard for local and metropolitan area networks—Part...
  • IEEE 802.11 working group. IEEE P80211n/D0.02 Wireless LAN medium access control (MAC) and physical layer (PHY)...
  • S. Parkvall et al.

    Evolving 3G mobile systems: broadband and broadcast services in WCDMA

    IEEE Communications Magazine

    (2006)
  • G. Liu et al.

    Evolution map from TD-SCDMA to future B3G TDD

    IEEE Communications Magazine

    (2006)
  • D. Astely et al.

    A future radio-access framework

    IEEE Journal on Selected Areas of Communication

    (2006)
  • J. Bingham

    Multicarrier modulation for data transmission: an idea whose time has come

    IEEE Communications Magazine

    (1990)
  • T. Keller et al.

    Adaptive modulation techniques for duplex OFDM transmissions

    IEEE Transactions in Vehicular Technology

    (2000)
  • Knopp R, Humblet PA. Information capacity and power control in single-cell multiuser communications. In: Proceedings of...
  • G.J. Pottie

    System design choices in personal communications

    IEEE Personal Communication

    (1995)
  • Tse D. End-to-end bandwidth guarantees through fair local spectrum share in wireless ad-hoc networks. In: Proceedings...
  • C.Y. Wong et al.

    Multiuser OFDM with adaptive sub-carrier, bit, and power allocation

    IEEE Journal on Selected Areas of Communication

    (1999)
  • Cited by (27)

    • Optimal radio resources and transmission formats assignment in OFDMA systems

      2013, Computers and Operations Research
      Citation Excerpt :

      Moreover, the authors use the NP-hardness result to show that the resource allocation problem cannot be approximated within a constant factor, and identify the worst-case situations where heuristics are likely to yield poor quality solutions. In [3], an OFDMA multi-cellular system is considered, and exact and heuristic resource assignment approaches are presented for the case in which a single transmission format exists. When the transmission powers are as in (3), we prove that MF-RAP is strongly NP-hard even when the set of the transmission formats consists of only two consecutive integers (Theorem 4.1).

    • Energy efficient spatial TDMA scheduling in wireless networks

      2012, Computers and Operations Research
      Citation Excerpt :

      The reduction proposed by the authors (from the graph coloring problem) can be trivially shown not to depend on a constant power profile and thus the MFLSP with variable power is in NP-complete as well. In [28] the authors show that assigning transmissions to orthogonal channels (in their case frequency division) in order to minimize power consumption in a single hop system (i.e., a node is either the end point of requests or the start point) is in NP-hard. The single hop case is a special case of the multi-hop case thus the minimum power scheduling problem in multi-hop networks considered in this paper is at least in NP-hard.

    • Adaptive priority-based fair-resource allocation for MIMO-OFDM multicast networks

      2019, International Journal of Networking and Virtual Organisations
    • Minmax multi-period resources allocation problem with weighted substitutable resources

      2015, International Journal of Agricultural Resources, Governance and Ecology
    View all citing articles on Scopus
    View full text