28 May 2019 in IEEE Transactions on Communications
In this paper, a novel dynamic multiple access technology selection among orthogonal multiple access (OMA) and non-orthogonal multiple access (NOMA) techniques is proposed. For this setup, a joint resource allocation problem is formulated in which a new set of access technology selection parameters along with power and subcarrier are allocated for each user based on each user’s channel state information. Here, a novel utility function is defined to take into account the rate and costs of access technologies. This cost reflects both the complexity of performing successive interference cancellation and the complexity incurred to guarantee a desired bit error rate. This utility function can inherently capture the tradeoff between OMA and NOMA. Due to non-convexity of the proposed resource allocation problem, a successive convex approximation is developed in which a two-step iterative algorithm is applied. In the first step, called access technology selection, the problem is transformed into a linear integer programming problem, and then, in the second step, a nonconvex problem, referred to power allocation problem, is solved via the difference-of-convex-functions (DC) programming. Moreover, the closed-form solution for power allocation in the second step is derived. For diverse network performance criteria such as rate, simulation results show that the proposed new dynamic access technology selection outperforms single-technology OMA or NOMA multiple access solutions.
28 April 2016 in IEEE Access
In this paper, we consider the down-link dynamic resource allocation in multi-cell virtualized wireless networks (VWNs) to support the users of different service providers (slices) within a specific region by a set of base stations (BSs) through orthogonal frequency division multiple access (OFDMA). In particular, we develop a joint BS assignment, sub-carrier, and power allocation algorithm to maximize the network sum rate, while satisfying the minimum required rate of each slice. Under the assumption that each user at each transmission instance can connect to no more than one BS, we introduce the user-association factor to represent the joint sub-carrier and BS assignment as the optimization variable vector in the problem formulation. Sub-carrier reuse is allowed in different cells, but not within one cell. As the proposed optimization problem is inherently non-convex and NP-hard, by applying the successive convex approximation (SCA) and complementary geometric programming (CGP), we develop an efficient two-step iterative approach with low computational complexity to solve the proposed problem. For a given problem, Step 1 derives the optimum user-association and subsequently, and for an obtained user-association, Step 2 finds the optimum power allocation. Simulation results demonstrate that the proposed iterative algorithm outperforms the traditional approach in which each user is assigned to the BS with the largest average value of signal strength, and then, joint sub-carrier and power allocation is obtained for the assigned users of each cell. Simulation results reveal a coverage improvement, offered by the proposed approach, of 57% and 71% for uniform and non-uniform users distribution, respectively, leading to higher spectrum efficiency for VWN.
12 December 2011 in IEEE Transactions on Wireless Communications
This paper proposes efficient cooperative cyclostationary spectrum sensing schemes in which each secondary-user (SU) performs single-cycle (SC) cyclostationary detection for fast and simple implementation, while collaboration between SUs in final decision on the presence or absence of the primary-user (PU) is explored to improve its performance. As the SUs simultaneously measure the spectral correlation functions at different cycle-frequencies (CF) and exchange their information regarding the measured results, a sufficient number of CFs are effectively examined with parallel searching, which makes the proposed cooperative spectrum sensing more reliable. This paper presents another look at performance evaluation of cyclostationary detectors in terms of deflection coefficients. Outage probability of deflection coefficient is defined as a measure to compare the performance of different cyclostationary detectors in a fading channel. Furthermore, performance of the proposed schemes in terms of false-alarm and detection probabilities is evaluated by analysis and simulation in AWGN and fading channels. Illustrative and analytical results show that the proposed schemes outperform both SC and multi-cycle (MC) cyclostationary detectors, especially in fading channels.
6 June 2017 in IEEE Transactions on Vehicular Technology
This paper considers the uplink dynamic resource allocation in a cloud radio access network (C-RAN) serving users belonging to different service providers (called slices) to form virtualized wireless networks (VWN). In particular, the C-RAN supports a pool of base-station (BS) baseband units (BBUs), which are connected to BS radio remote heads (RRHs) equipped with massive massive multiple input multiple output (MIMO), via fronthaul links with limited capacity. Assuming that each user can be assigned to a single RRH-BBU pair, we formulate a resource allocation problem aiming to maximize the total system rate, constrained on the minimum rates required by the slices and the maximum number of antennas and power allocated to each user. The effects of pilot contamination error on the VWN performance are investigated and pilot duration is considered as a new optimization variable in resource allocation. This problem is inherently nonconvex, NP-hard and, thus, computationally inefficient. By applying the successive convex approximation and complementary geometric programming approach, we propose a two-step iterative algorithm: one to adjust the RRH, BBU, and fronthaul parameters, and the other for power and antenna allocation to users. Simulation results illustrate the performance of the developed algorithm for VWNs in a massive-MIMO-aided and fronthaul-limited C-RAN, and demonstrate the effects of imperfect channel state information estimation due to pilot contamination error, and the optimal pilot duration.
2 November 2017 in IEEE Communications Letters
SLSangarapillai Lambotharan
Sangarapillai Lambotharan
We propose a tractable expression for the outage probability in single-cell uplink non-orthogonal multiple access (NOMA) systems serving an arbitrary number of users. The expression is obtained by approximating the inter-user interference using a shifted-gamma distributed random variable. We then formulate and propose an efficient iterative algorithm for the outage-constrained min-max power allocation problem for the NOMA system. To give a rigorous comparison, we solve the outage-constrained min-max power allocation problem for the orthogonal multiple access (OMA) counterpart where both the user power allocation and the radio resource division pattern are optimized. Simulations confirm the accuracy of the derived outage probability expression for the NOMA system. Also, we demonstrate that fairness among users in terms of transmission power can be achieved by NOMA. Moreover, NOMA can bring significant power savings to the users as compared to OMA.