8 research outputs found
Resource Allocation for Energy-Efficient 3-Way Relay Channels
Throughput and energy efficiency in 3-way relay channels are studied in this
paper. Unlike previous contributions, we consider a circular message exchange.
First, an outer bound and achievable sum rate expressions for different
relaying protocols are derived for 3-way relay channels. The sum capacity is
characterized for certain SNR regimes. Next, leveraging the derived achievable
sum rate expressions, cooperative and competitive maximization of the energy
efficiency are considered. For the cooperative case, both low-complexity and
globally optimal algorithms for joint power allocation at the users and at the
relay are designed so as to maximize the system global energy efficiency. For
the competitive case, a game theoretic approach is taken, and it is shown that
the best response dynamics is guaranteed to converge to a Nash equilibrium. A
power consumption model for mmWave board-to-board communications is developed,
and numerical results are provided to corroborate and provide insight on the
theoretical findings.Comment: Submitted to IEEE Transactions on Wireless Communication
Low-complexity energy-efficient resource allocation for delay-tolerant two-way orthogonal frequency-division multiplexing relays
Energy-efficient wireless communication is important for wireless devices with a limited battery life and cannot be recharged. In this study, a bit allocation algorithm to minimise the total energy consumption for transmitting a bit successfully is proposed for a two-way orthogonal frequency-division multiplexing relay system, whilst considering the constraints of quality-of-service and total transmit power. Unlike existing bit allocation schemes, which maximise the energy efficiency (EE) by measuring ‘bits-per-Joule’ with fixed bidirectional total bit rates constraint and no power limitation, their scheme adapts the bidirectional total bit rates and their allocation on each subcarrier with a total transmit power constraint. To do so, they propose an idea to decompose the optimisation problem. The problem is solved in two general steps. The first step allocates the bit rates on each subcarrier when the total bit rate of each user is fixed. In the second step, the Lagrangian multipliers are used as the optimisation variants, and the dimension of the variant optimisation is reduced from 2N to 2, where N is the number of subcarriers. They also prove that the optimal point is on the bounds of the feasible region, thus the optimal solution could be searched through the bounds
Alternative techniques for the improvement of energy efficiency in cognitive radio networks.
Doctor of Philosophy in Electronic Energy. University of KwaZulu-Natal, Durban 2016.Abstract available in PDF file