arXiv subjects

Ata Khalili

Publications and source records attributed to Ata Khalili.

31 records · Page 2Linked to original sources

arXiv2021

Multi-objective Resource Allocation for D2D and Enabled MC-NOMA Networks by Tchebycheff Method

This paper considers a resource allocation problem in device-to-device (D2D) communications sharing the same frequency spectrum. In particular, the CUs utilize non-orthogonal multiple access (NOMA) while DUs adopt the orthogonal frequency division multiple access (OFDMA). A multi-objective optimization problem (MOOP) is formulated, which jointly maximizes the sum rate of D2D and CUs (CUs) in uplink communications while taking into account the maximum transmit power budget and minimum data rate requirement for D2D and CUs. This MOOP is handled by the weighted Tchebycheff method, which converts it into a single-objective optimization (SOOP). Then, the monotonic optimization approach is employed to solve this SOOP optimally. Numerical results unveil an interesting tradeoff between D2D and CUs.

cs.IT↗

arXiv2021

Robust Energy-Efficient Resource Management, SIC Ordering, and Beamforming Design for MC MISO-NOMA Enabled 6G

This paper studies a novel approach for successive interference cancellation (SIC) ordering and beamforming in a multiple antennas non-orthogonal multiple access (NOMA) network with multi-carrier multi-user setup. To this end, we formulate a joint beamforming design, subcarrier allocation, user association, and SIC ordering algorithm to maximize the worst-case energy efficiency (EE). The formulated problem is a non-convex mixed integer non-linear programming (MINLP) which is generally difficult to solve. To handle it, we first adopt the linearizion technique as well as relaxing the integer variables, and then we employ the Dinkelbach algorithm to convert it into a more mathematically tractable form. The adopted non-convex optimization problem is transformed into an equivalent rank-constrained semidefinite programming (SDP) and is solved by SDP relaxation and exploiting sequential fractional programming. Furthermore, to strike a balance between complexity and performance, a low complex approach based on alternative optimization is adopted. Numerical results unveil that the proposed SIC ordering method outperforms the conventional existing works addressed in the literature.

eess.SP↗

arXiv2020

Joint Transmission in QoE-Driven Backhaul-Aware MC-NOMA Cognitive Radio Network

In this paper, we develop a resource allocation framework to optimize the downlink transmission of a backhaul-aware multi-cell cognitive radio network (CRN) which is enabled with multi-carrier non-orthogonal multiple access (MC-NOMA). The considered CRN is composed of a single macro base station (MBS) and multiple small BSs (SBSs) that are referred to as the primary and secondary tiers, respectively. For the primary tier, we consider orthogonal frequency division multiple access (OFDMA) scheme and also Quality of Service (QoS) to evaluate the user satisfaction. On the other hand in secondary tier, MC-NOMA is employed and the user satisfaction for web, video and audio as popular multimedia services is evaluated by Quality-of-Experience (QoE). Furthermore, each user in secondary tier can be served simultaneously by multiple SBSs over a subcarrier via Joint Transmission (JT). In particular, we formulate a joint optimization problem of power control and scheduling (i.e., user association and subcarrier allocation) in secondary tier to maximize total achievable QoE for the secondary users. An efficient resource allocation mechanism has been developed to handle the non-linear form interference and to overcome the non-convexity of QoE serving functions. The scheduling and power control policy leverage on Augmented Lagrangian Method (ALM). Simulation results reveal that proposed solution approach can control the interference and JT-NOMA improves total perceived QoE compared to the existing schemes.

eess.SP↗

arXiv2020

Multi-Objective Energy Efficient Resource Allocation and User Association for In-band Full Duplex Small-Cells

In this paper, we develop a framework to maximize the network energy efficiency (EE) by optimizing joint user-base station~(BS) association,~subchannel assignment, and power control considering an in-band full-duplex (IBFD)-enabled small-cell network. We maximize EE (ratio of network aggregate throughput and power consumption) while guaranteeing a minimum data rate requirement in both the uplink and downlink. The considered problem belongs to the category of mixed-integer non-linear programming problem (MINLP), {\color{black} and thus is NP-hard}. To cope up with this complexity and to derive a trade-off between system throughput and energy utilization, we first restate the considered problem as a multi-objective optimization problem (MOOP) aiming at maximizing system's throughput and minimizing system's energy consumption, simultaneously. This MOOP is then tackled by using $ε$-constraint method. To do so, we first transform the binary subchannel and BS assignment variables into continuous ones without altering the feasible region of the problem and then approximate the non-convex rate functions through majorization-minimization (MM) approach. Simulation results are presented to demonstrate the effectiveness of our proposed algorithm in improving network's EE compared to the existing literature.~Furthermore, simulation results unveil that by employing the IBFD capability in OFDMA networks, our proposed resource allocation algorithm achieves a $69\%$ improvement in the EE as compared to the half-duplex system for practical values of residual self-interference.

eess.SP↗

arXiv2020

Performance Trade-off Between Uplink and Downlink in Full-Duplex Communications

In this paper, we formulate two multi-objective optimization problems (MOOPs) in orthogonal frequency-division multiple access (OFDMA)-based in-band full-duplex (IBFD) wireless communications.~The aim of this study is to exploit the performance trade-off between uplink and downlink where a wireless radio simultaneously transmits and receives in the same frequency.~We consider maximizing the system throughput as the first MOOP and minimizing the system aggregate power consumption as the second MOOP between uplink and downlink,~while taking into account the impact of self-interference~(SI)~and quality of service provisioning.~We study the throughput and the transmit power trade-off between uplink and downlink via solving these two problems.~Each MOOP is a non-convex mixed integer non-linear programming~(MINLP)~which is generally intractable. In order to circumvent this difficulty, a penalty function is introduced to reformulate the problem into a mathematically tractable form.~Subsequently,~each MOOP is transformed into a single-objective optimization problem~(SOOP)~via the weighted Tchebycheff method which is addressed by majorization-minimization~(MM)~approach. Simulation results demonstrate an interesting trade-off between the considered competing objectives.

cs.IT↗

arXiv2020

Energy and Spectral Efficiency Tradeoff in OFDMA Networks via Antenna Selection Strategy

In this paper, we investigate the joint resource allocation and antenna selection algorithm design for uplink orthogonal frequency division multiple access (OFDMA) communication system. We propose a multi-objective optimization framework to strike a balance between spectral efficiency (SE) and energy efficiency (EE). The resource allocation design is formulated as a multi-objective optimization problem (MOOP), where the conflicting objective functions are linearly combined into a single objective function employing the weighted sum method. In order to develop an efficient solution, the majorization minimization (MM) approach is proposed where a surrogate function serves as a lower bound of the objective function. Then an iterative suboptimal algorithm is proposed to maximize the approximate objective function. Numerical results unveil an interesting tradeoff between the considered conflicting system design objectives and reveal the improved EE and SE facilitated by the proposed transmit antenna selection in OFDMA systems.

cs.IT↗

arXiv2019

Joint User Association and Resource Allocation in the Uplink of Heterogeneous Networks

This letter considers the problem of joint user association (UA), sub-channel assignment, antenna selection (AS), and power control in the uplink (UL) of a heterogeneous network such that the data rate of small cell users can be maximized while the macro-cell users are protected by imposing a threshold on the cross-tier interference. The considered problem is a non-convex mixed integer non-linear programming (MINLP). To tackle the problem, we decompose the original problem into two sub-problems: (i) joint UA, sub-channel assignment, and AS, and (ii) power control. Then, we iteratively solve the subproblems by applying the tools from majorization-minimization (MM) theory and augmented Lagrange method, respectively, and obtain locally optimal solutions for each sub-problem. Simulation results illustrate that our proposed scheme outperforms existing schemes. Complexity analysis of the proposed algorithm is also presented.

cs.NI↗

arXiv2019

Energy Efficiency Maximization Via Joint Sub-Carrier Assignment and Power Control for OFDMA Full Duplex Networks

In this paper, we develop an energy efficient resource allocation scheme for orthogonal frequency division multiple access (OFDMA) networks with in-band full-duplex (IBFD) communication between the base station and user equipments (UEs) considering a realistic self-interference (SI) model. Our primary aim is to maximize the system energy efficiency (EE) through a joint power control and sub-carrier assignment in both the downlink (DL) and uplink (UL), where the quality of service requirements of the UEs in DL and UL are guaranteed. The formulated problem is non-convex due to the non-linear fractional objective function and the non-convex feasible set which is generally intractable. In order to handle this difficulty, we first use fractional programming to transform the fractional objective function to the subtractive form. Then, by employing Dinkelbach method, we propose an iterative algorithm in which an inner problem is solved in each iteration. Applying majorization-minimization approximation, we make the inner problem convex. Also, by introducing a penalty function to handle integer sub-carrier assignment variables, we propose an iterative algorithm for addressing the inner problem. We show that our proposed algorithm converges to the locally optimal solution which is also demonstrated by our simulation results. In addition, simulation results show that by applying the IBFD capability in OFDMA networks with efficient SI cancellation techniques, our proposed resource allocation algorithm attains a 75% increase in the EE as compared to the half-duplex system.

cs.IT↗

arXiv2019

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 ε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.

cs.IT↗

arXiv2019

Rate Balancing in Full-Duplex MIMO Two-Way Relay Networks

Maximizing the minimum rate for a full-duplex multiple-input multiple-output (MIMO) wireless network encompassing two sources and a two-way (TW) relay operating in a two hop manner is investigated. To improve the overall performance, using a zero-forcing approach at the relay to suppress the residual self-interference arising from full-duplex (FD) operation, the underlying max-min problem is cast as an optimization problem which is non-convex. To circumvent this issue, semidefinite relaxation technique is employed, leading to upper and lower bound solutions for the optimization problem. Numerical results verify that the upper and lower bound solutions closely follow each other, showing that the proposed approach results in a close-to-optimal solution. In addition, the impact of residual self-interference upon the overall performance of the network in terms of the minimum rate is illustrated by numerical results, and for low residual self-interference scenarios the superiority of the proposed method compared to an analogous half-duplex (HD) counterpart is shown.

eess.SP↗

arXiv2018

Joint Resource Allocation and Antenna Selection In the Uplink of OFDMA Networks

The problem of joint sub-channel, power control and antenna selection in the uplink of OFDMA networks is investigated. The corresponding optimization problem is a non convex mixed integer non-linear problem(MINLP). To tackle the problem, an iterative two-step optimization problem is devised. First,~Having fixed the selected antenna as well as the associated power of each user,~a sub-channel assignment problem using the so-called Hungarian method is proposed. Second, the joint power and antenna selection problem is extended into a more elegant form through adding a penalty term to the objective function forcing the relaxed boolean variables associated with antenna selection problem to take binary values. To this end, the problem is restated as a difference of two concave function (DC programming) and is effectively solved in an iterative manner. The foregoing procedure is iteratively repeated until approaching a fixed network throughput. Simulation results demonstrate the superiority of the proposed method w.r.t. the exhaustive search with fixed power control mechanism.

cs.IT↗

arXiv2018

Power Control and Scheduling In Low SNR Region In The Uplink of Two Cell Networks

In this paper we investigate the sub-channel assignment and power control to maximize the total sum rate in the uplink of two-cell network. It is assumed that there are some sub-channels in each cell which should be allocated among some users. Also, each user is subjected to a power constraint. The underlying problem is a non-convex mixed integer non-linear optimization problem which does not have a trivial solution. To solve the problem, having fixed the consumed power of each user, and assuming low co-channel interference region, the sub-channel allocation problem is reformulate into a more mathematically tractable problem which is shown can be tackled through the so-called Hungarian algorithm. Then, the consumed power of each user is reformulated as a quadratic fractional problem which can be numerically derived. Numerical results demonstrate the superiority of the proposed method in low SNR region as compared to existing works addressed in the literature

eess.SP↗

arXiv2017

Asymptotic Close To Optimal Joint Resource Allocation and Power Control in the Uplink of Two-cell Networks

In this paper, we investigate joint resource allocation and power control mechanisms for two-cell networks, where each cell has some sub-channels which should be allocated to some users. The main goal persuaded in the current work is finding the best power and sub-channel assignment strategies so that the associated sum-rate of network is maximized, while a minimum rate constraint is maintained by each user. The underlying optimization problem is a highly non-convex mixed integer and non-linear problem which does not yield a trivial solution. In this regard, to tackle the problem, using an approximate function which is quite tight at moderate to high signal to interference plus noise ratio (SINR) region, the problem is divided into two disjoint sub-channel assignment and power allocation problems. It is shown that having fixed the allocated power of each user, the subchannel assignment can be thought as a well-known assignment problem which can be effectively solved using the so-called Hungarian method. Then, the power allocation is analytically derived. Furthermore, it is shown that the power can be chosen from two extremal points of the maximum available power or the minimum power satisfying the rate constraint. Numerical results demonstrate the superiority of the proposed approach over the random selection strategy as well as the method proposed in [3] which is regarded as the best known method addressed in the literature.

cs.IT↗