Throughput optimization of cooperative non orthogonal multiple access

Telecommunication Systems - This paper derives the outage and packet error probabilities of Non Orthogonal Multiple Access (NOMA) systems. In the first time slot, the Base Station transmits a...     

Resource allocation scheme for orthogonal frequency division multiple access networks based on cooperative game theory

Cooperative game theory can be applied to orthogonal frequency division multiple access (OFDMA) networks for fair resource allocation. In this work, we consider a comprehensive cross‐layer framework including physical and medium access control layer requirements. We apply two cooperative games, nontransferable utility (NTU) game and transferable utility (TU) game, to provide fairness in OFDMA networks. In NTU game, fairness is achieved by defining appropriate objective function, whereas in TU game, fairness is provided by forming the appropriate network structure. For NTU game, we analyze the Nash bargaining solution as a solution of NTU game taking into account channel state information and queue state information. In a TU game, we show that coalition among subcarriers to jointly provide rate requirements leads to better performance in terms of power consumption. The subcarrier's payoff is determined according to the amount of payoff which that subcarrier brings to the coalition by its participation. We show that although NTU and TU games are modeled as rate adaptive and margin adaptive problems, respectively, both solutions provide a fair distribution of resources with minimum fairness index of 0.8. Copyright © 2012 John Wiley & Sons, Ltd.     

Performance analysis of cooperative spectrum sharing using non‐orthogonal multiple access

This paper presents a cooperative spectrum sharing protocol using non‐orthogonal multiple access in cognitive radio networks. A 2‐phase protocol comprising of a primary transmitter‐receiver pair and a secondary transmitter‐receiver pair is considered. In the proposed protocol, 3 data symbols can be transmitted during the 2 phases; this is unlike the traditional decode‐and‐forward relaying where 1 data symbol can be transmitted and the conventional superposition coding–based overlay spectrum sharing and the cooperative relaying system using non‐orthogonal multiple access where 2 data symbols can be transmitted, under a single‐relay scenario. We have investigated performance of our proposed protocol in terms of ergodic sum capacity and outage probability along with analytical derivations over independent Rayleigh fading channels. We also compared our proposed protocol with the traditional decode‐and‐forward relaying, conventional superposition coding–based overlay spectrum sharing, and the cooperative relaying system using non‐orthogonal multiple access schemes to demonstrate efficacy of the proposed protocol. The simulation and analytical results are presented to confirm efficiency of the proposed spectrum sharing protocol.     

Media access control for Ethernet passive optical networks: an overview

Medium access control is one of the crucial issues in the design of Ethernet passive optical networks. To ensure efficient transmission, an EPON system must employ a MAC mechanism to arbitrate access to the shared medium in order to avoid data collisions in the upstream direction and at the same time efficiently share the upstream transmission bandwidth among all ONUs. The purpose of this article is to provide a good understanding of the MAC issue, discuss the major problems involved (e.g., multiple access, bandwidth allocation, transmission scheduling, and quality of service support), and present an overview of the state-of-the-art solutions proposed thus far to the problems. It is also our purpose to motivate further studies on the problems described in this article     

Dual busy tone multiple access (DBTMA)-a multiple access controlscheme for ad hoc networks

In ad hoc networks, the hidden- and the exposed-terminal problems can severely reduce the network capacity on the MAC layer. To address these problems, the ready-to-send and clear-to-send (RTS/CTS) dialogue has been proposed in the literature. However, MAC schemes using only the RTS/CTS dialogue cannot completely solve the hidden and the exposed terminal problems, as pure "packet sensing" MAC schemes are not safe even in fully connected networks. We propose a new MAC protocol, termed the dual busy tone multiple access (DBTMA) scheme. The operation of the DBTMA protocol is based on the RTS packet and two narrow-bandwidth, out-of-band busy tones. With the use of the RTS packet and the receive busy tone, which is set up by the receiver, our scheme completely solves the hidden- and the exposed-terminal problems. The busy tone, which is set up by the transmitter, provides protection for the RTS packets, increasing the probability of successful RTS reception and, consequently, increasing the throughput. This paper outlines the operation rules of the DBTMA scheme and analyzes its performance. Simulation results are also provided to support the analytical results. It is concluded that the DBTMA protocol is superior to other schemes that rely on the RTS/CTS dialogue on a single channel or to those that rely on a single busy tone. As a point of reference, the DBTMA scheme out-performs FAMA-NCS by 20-40% in our simulations using the network topologies borrowed from the FAMA-NCS paper. In an ad hoc network with a large coverage area, DBTMA achieves performance gain of 140% over FAMA-NCS and performance gain of 20% over RI-BTMA     

Resource allocation with proportional rate fairness in orthogonal frequency division multiple access relay networks

We address the problem of subchannel and transmission power allocation in orthogonal frequency division multiple access relay networks with an aim to maximize the sum rate and maintain proportional rate fairness among users. Because the formulated problem is a mixed‐integer nonlinear optimization problem with an extremely high computational complexity, we propose a low‐complexity suboptimal algorithm, which is a two‐step separated subchannel and power allocation algorithm. In the first step, subchannels are allocated to each user, whereas in the second step, the optimal power allocation is carried out on the basis of the given subchannel allocation and the nonlinear interval Gauss–Seidel method. Simulation results have demonstrated that the proposed algorithm can achieve a good trade‐off between the efficiency and the fairness compared with two other existing relevant algorithms. In particular, the proposed algorithm can always achieve 100% fairness under various conditions. Copyright © 2012 John Wiley & Sons, Ltd.     

Leakage rate analysis with imperfect channel state information for cooperative nonorthogonal multiple access networks

This paper investigates the imperfect channel state information that is caused by the channel estimation error and feedback delay effects on the leakage rate analysis for the cooperative nonorthogonal multiple access networks. The investigation considers a dual hop one‐/two‐way nonorthogonal multiple access‐based information exchange process with the aid of half‐/full‐duplex untrustworthy wireless relaying network for the leakage rate analysis. The channel estimation error causes system coding gain losses while the feedback delay does not have any effect on the users' outage performance at untrustworthy relay terminal in low signal‐to‐noise ratio regimes. Conversely, the channel estimation error effects become negligible while the feedback delay causes system coding gain losses on the users' outage performance at untrustworthy relay terminal in high signal‐to‐noise ratio. Results also reveal that the untrustworthy relay terminal, which is under the effect of the channel estimation error and feedback delay, is being active between and ‐  dB. Beyond ‐  dB, the untrustworthy relay terminal becomes out of order and saturates. The Monte Carlo–based simulation results are in agreement with the analytical and asymptotic derivations.     

Channel-independent synchronization of orthogonal frequencydivision multiple access systems

We develop synchronization algorithms for both the downlink and the uplink of quasi-synchronous and asynchronous orthogonal frequency division multiple access systems. Unlike existing alternatives, the proposed time- and carrier-offset estimators do not require the transmission of known sequences and exhibit performance independent of the underlying channel zero locations. The only necessary assumption is that there are virtual subcarriers which are not occupied by any user. We derive a closed-form variance expression for the carrier-offset estimator at high signal-to-noise ratio (SNR), as a function of the number of active users and the SNR. We compare our method with alternative ones and validate our theoretical derivations with simulation results     

Reducing code wastage in orthogonal variable spreading factor‐based wideband code division multiple access networks

Most third‐generation and beyond wideband code division multiple access networks use the orthogonal variable spreading factor code tree for channelization codes. The codes in this code tree are limited and the performance of a wireless network depends upon the code assignment for new calls. In this paper, we introduce a term called ‘wastage capacity’, which gives us the amount of wastage caused when a code (single or multiple) with a data rate higher than the rate of the incoming call is assigned to it. We suggest two methods to keep wastage capacity below an arbitrary threshold value or zero. In the first method, we devised an algorithm in which wastage up to a certain threshold would be tolerated and the minimum rakes to get this wastage capacity were identified. In the second approach, we reduced the wastage capacity to zero irrespective of the number of rakes at the expense of higher cost and complexity. Copyright © 2011 John Wiley & Sons, Ltd.