2 research outputs found
Multi-Objective Optimization for Energy-and Spectral-Efficiency Tradeoff in In-band Full-Duplex (IBFD) Communication
The problem of joint power and sub-channel allocation to maximize energy
efficiency (EE) and spectral efficiency (SE) simultaneously in in-band
full-duplex (IBFD) orthogonal frequency-division multiple access (OFDMA)
network is addressed considering users' QoS in both uplink and downlink. The
resulting optimization problem is a non-convex mixed-integer non-linear program
(MINLP) which is generally difficult to solve. In order to strike a balance
between the EE and SE, we restate this problem as a multi-objective
optimization problem (MOOP) which aims at maximizing system's throughput and
minimizing system's power consumption, simultaneously. To this end, the
\epsilon constraint method is adopted to transform the MOOP into
single-objective optimization problem (SOOP). The underlying problem is solved
via an efficient solution based on the majorization minimization (MM) approach.
Furthermore, in order to handle binary subchannel allocation variable
constraints, a penalty function is introduced. Simulation results unveil
interesting tradeoffs between EE and SE.Comment: This paper is accepted by IEEE Global Communications Conference 201
Dynamic Resource Allocation for Full-Duplex OFDMA Wireless Cellular Networks
This paper focuses on the resource allocation in a full-duplex (FD) multiuser single cell system consisting of one FD base-station (BS) and multiple FD mobile nodes. In particular, we are interested in jointly optimizing the power allocation (PA) and subcarrier assignment (SA) for uplink (UL) and downlink (DL) transmission of all users to maximize the system sum-rate. First, the joint optimization problem is formulated as nonconvex mixed integer program, a difficult nonconvex problem. We then propose an iterative algorithm to solve this problem. In the proposed algorithm, the PA is obtained by employing the SCALE algorithm, whereas the SA is updated by a gradient method. Finally, we present numerical results to demonstrate the significant gains of our proposed design compared to that due to two fast greedy algorithms