Resource allocation for two source-destination pairs sharing a single relay with a buffer

In this paper, we obtain the optimal resource allocation scheme in order to maximize the achievable rate region in a dual-hop system that consists of two independent source-destination pairs sharing a single half-duplex relay. The relay decodes the received information and possesses buffers to enable storing the information temporarily before forwarding it to the respective destination. We consider both non-orthogonal transmission with successive interference cancellation at the receivers and orthogonal transmission. Also, we consider Gaussian block-fading channels and we assume that the channel state information is known and that no delay constraints are required. We show that, with the aid of buffering at the relay, joint user-and-hop scheduling is optimal and can enhance the achievable rate significantly. This is due to the joint exploitation of multiuser diversity and multihop diversity in the system. We provide closed-form expressions to characterize the average achievable rates in a generic form as functions of the statistical model of the channels. Furthermore, we consider sub-optimal schemes that exploit the diversity in the system partially and we provide numerical results to compare the different schemes and demonstrate the gains of the optimal one. © 2014 IEEE

Relay Selection with Network Coding in Two-Way Relay Channels

In this paper, we consider the design of joint network coding (NC)and relay selection (RS) in two-way relay channels. In the proposed schemes, two users first sequentially broadcast their respective information to all the relays. We propose two RS schemes, a single relay selection with NC and a dual relay selection with NC. For both schemes, the selected relay(s) perform NC on the received signals sent from the two users and forward them to both users. The proposed schemes are analyzed and the exact bit error rate (BER) expressions are derived and verified through Monte Carlo simulations. It is shown that the dual relay selection with NC outperforms other considered relay selection schemes in two-way relay channels. The results also reveal that the proposed NC relay selection schemes provide a selection gain compared to a NC scheme with no relay selection, and a network coding gain relative to a conventional relay selection scheme with no NC.Comment: 11 pages, 5 figure

Delay QoS Provisioning and Optimal Resource Allocation for Wireless Networks

Recent years have witnessed a significant growth in wireless communication and networking due to the exponential growth in mobile applications and smart devices, fueling unprecedented increase in both mobile data traffic and energy demand. Among such data traffic, real-time data transmissions in wireless systems require certain quality of service (QoS) constraints e.g., in terms of delay, buffer overflow or packet drop/loss probabilities, so that acceptable performance levels can be guaranteed for the end-users, especially in delay sensitive scenarios, such as live video transmission, interactive video (e.g., teleconferencing), and mobile online gaming. With this motivation, statistical queuing constraints are considered in this thesis, imposed as limitations on the decay rate of buffer overflow probabilities. In particular, the throughput and energy efficiency of different types of wireless network models are analyzed under QoS constraints, and optimal resource allocation algorithms are proposed to maximize the throughput or minimize the delay. In the first part of the thesis, the throughput and energy efficiency analysis for hybrid automatic repeat request (HARQ) protocols are conducted under QoS constraints. Approximations are employed for small QoS exponent values in order to obtain closed-form expressions for the throughput and energy efficiency metrics. Also, the impact of random arrivals, deadline constraints, outage probability and QoS constraints are studied. For the same system setting, the throughput of HARQ system is also analyzed using a recurrence approach, which provides more accurate results for any value of the QoS exponent. Similarly, random arrival models and deadline constraints are considered, and these results are further extended to the finite-blocklength coding regime. Next, cooperative relay networks are considered under QoS constraints. Specifically, the throughput performance in the two-hop relay channel, two-way relay channel, and multi-source multi-destination relay networks is analyzed. Finite-blocklength codes are considered for the two-hop relay channel, and optimization over the error probabilities is investigated. For the multi-source multi-destination relay network model, the throughput for both cases of with and without CSI at the transmitter sides is studied. When there is perfect CSI at the transmitter, transmission rates can be varied according to instantaneous channel conditions. When CSI is not available at the transmitter side, transmissions are performed at fixed rates, and decoding failures lead to retransmission requests via an ARQ protocol. Following the analysis of cooperative networks, the performance of both half-duplex and full-duplex operations is studied for the two-way multiple input multiple output (MIMO) system under QoS constraints. In full-duplex mode, the self-interference inflicted on the reception of a user due to simultaneous transmissions from the same user is taken into account. In this setting, the system throughput is formulated by considering the sum of the effective capacities of the users in both half-duplex and full-duplex modes. The low signal to noise ratio (SNR) regime is considered and the optimal transmission/power-allocation strategies are characterized by identifying the optimal input covariance matrices. Next, mode selection and resource allocation for device-to-device (D2D) cellular networks are studied. As the starting point, ransmission mode selection and resource allocation are analyzed for a time-division multiplexed (TDM) cellular network with one cellular user, one base station, and a pair of D2D users under rate and QoS constraints. For a more complicated setting with multiple cellular and D2D users, two joint mode selection and resource allocation algorithms are proposed. In the first algorithm, the channel allocation problem is formulated as a maximum-weight matching problem, which can be solved by employing the Hungarian algorithm. In the second algorithm, the problem is divided into three subproblems, namely user partition, power allocation and channel assignment, and a novel three-step method is proposed by combining the algorithms designed for the three subproblems. In the final part of the thesis, resource allocation algorithms are investigated for content delivery over wireless networks. Three different systems are considered. Initially, a caching algorithm is designed, which minimizes the average delay of a single-cell network. The proposed algorithm is applicable in settings with very general popularity models, with no assumptions on how file popularity varies among different users, and this algorithm is further extended to a more general setting, in which the system parameters and the distributions of channel fading change over time. Next, for D2D cellular networks operating under deadline constraints, a scheduling algorithm is designed, which manages mode selection, channel allocation and power maximization with acceptable complexity. This proposed scheduling algorithm is designed based on the convex delay cost method for a D2D cellular network with deadline constraints in an OFDMA setting. Power optimization algorithms are proposed for all possible modes, based on our utility definition. Finally, a two-step intercell interference (ICI)-aware scheduling algorithm is proposed for cloud radio access networks (C-RANs), which performs user grouping and resource allocation with the goal of minimizing delay violation probability. A novel user grouping algorithm is developed for the user grouping step, which controls the interference among the users in the same group, and the channel assignment problem is formulated as a maximum-weight matching problem in the second step, which can be solved using standard algorithms in graph theory

Outage analysis of superposition modulation aided network coded cooperation in the presence of network coding noise

We consider a network, where multiple sourcedestination pairs communicate with the aid of a half-duplex relay node (RN), which adopts decode-forward (DF) relaying and superposition-modulation (SPM) for combining the signals transmitted by the source nodes (SNs) and then forwards the composite signal to all the destination nodes (DNs). Each DN extracts the signals transmitted by its own SN from the composite signal by subtracting the signals overheard from the unwanted SNs. We derive tight lower-bounds for the outage probability for transmission over Rayleigh fading channels and invoke diversity combining at the DNs, which is validated by simulation for both the symmetric and the asymmetric network configurations. For the high signal-to-noise ratio regime, we derive both an upperbound as well as a lower-bound for the outage performance and analyse the achievable diversity gain. It is revealed that a diversity order of 2 is achieved, regardless of the number of SN-DN pairs in the network. We also highlight the fact that the outage performance is dominated by the quality of the worst overheated link, because it contributes most substantially to the network coding noise. Finally, we use the lower bound for designing a relay selection scheme for the proposed SPM based network coded cooperative communication (SPM-NC-CC) system.<br/

Maximizing Expected Achievable Rates for Block-Fading Buffer-Aided Relay Channels

© 2002-2012 IEEE. In this paper, the long-term average achievable rate over block-fading buffer-aided relay channels is maximized using a hybrid scheme that combines three essential transmission strategies, which are decode-and-forward, compress-and-forward, and direct transmission. The proposed hybrid scheme is dynamically adapted based on the channel state information. The integration and optimization of these three strategies provide a more generic and fundamental solution and give better achievable rates than the known schemes in the literature. Despite the large number of optimization variables, the proposed hybrid scheme can be optimized using simple closed-form formulas that are easy to apply in practical relay systems. This includes adjusting the transmission rate and compression when compress-and-forward is the selected strategy based on the channel conditions. Furthermore, in this paper, the hybrid scheme is applied to three different models of the Gaussian block-fading buffer-aided relay channels, depending on whether the relay is half or full duplex and whether the source and the relay have orthogonal or non-orthogonal channel access. Several numerical examples are provided to demonstrate the achievable rate results and compare them to the upper bounds of the ergodic capacity for each one of the three channel models under consideration

Esquemas de retransmissão baseados no protocolo decodifica-e-encaminha em redes cognitivas do tipo underlay

Orientador: José Cândido Silveira Santos FilhoTese (doutorado) - Universidade Estadual de Campinas, Faculdade de Engenharia Elétrica e de ComputaçãoResumo: O conceito de compartilhamento de espectro do tipo underlay tem sido proposto como uma técnica promissora para contornar o problema da escassez e da subutilização do espectro, permitindo que usuários não licenciados, chamados de usuários secundários, possam acessar simultaneamente uma banda licenciada, alocada aos usuários primários, desde que o nível de interferência sobre os mesmos seja mantido abaixo de um dado limiar aceitável. Entretanto, isso implica que a potência de transmissão na rede secundária deve ser restringida, comprometendo assim a confiabilidade e a cobertura da comunicação. A fim de contornar esse problema, técnicas de retransmissão cooperativa, as quais proveem um novo tipo de diversidade espacial, podem ser exploradas como um meio eficaz para melhorar o desempenho da rede secundária. De fato, a utilização conjunta de ambas as técnicas ¿ compartilhamento de espectro do tipo underlay e retransmissão cooperativa ¿ em redes cooperativas e cognitivas tem recebido especial atenção, já que a eficiência espectral do sistema e o desempenho da rede secundária podem ser melhorados significativamente. Esta tese apresenta quatro contribuições principais na referida área. Em particular, estuda-se o efeito conjunto de duas restrições de potência importantes sobre o desempenho de outage de redes cooperativas e cognitivas, especificamente, o nível máximo de potência interferente tolerada pelo receptor primário e o valor máximo de potência transmitida nos usuários secundários. Foca-se em esquemas de retransmissão baseados no protocolo decodifica-e-encaminha, abordando cenários em que o enlace direto entre fonte e destino está disponível para transmitir informação útil. Como uma primeira contribuição, analisa-se o desempenho de dois esquemas baseados no protocolo de retransmissão half-duplex incremental, os quais exploram a diversidade espacial dos enlaces diretos em redes cooperativas e cognitivas multiusuário. A segunda contribuição investiga o impacto de estimativas desatualizadas do canal sobre o mecanismo de seleção de destino para um desses esquemas anteriores, focando-se apenas no aspecto cooperativo da rede, ou seja, desconsiderando-se o uso de compartilhamento espectral. A terceira contribuição estuda o desempenho de redes cooperativas e cognitivas baseadas no modo full-duplex. Para esse cenário, avalia-se o impacto tanto da autointerferência residual, que é inerente ao modo full-duplex, bem como das restrições de potência que caracterizam o compartilhamento de espectro do tipo underlay. Como contribuição final, motivada pelo compromisso entre a perda de eficiência espectral e o problema da autointerferência residual, próprios dos modos half-duplex e full-duplex, respectivamente, propõe-se e analisa-se um esquema de transmissão adaptativo para redes cooperativas e cognitivas, através do qual, antes de cada processo de comunicação, um dos seguintes modos de transmissão é selecionado: retransmissão half-duplex, retransmissão full-duplex ou transmissão direta. Para todos os cenários considerados, expressões analíticas exatas para a probabilidade de outage são obtidas. Adicionalmente, uma análise assintótica é realizada a fim de caracterizar a ordem de diversidade e o comportamento de outage da rede secundária no regime assintótico de alta relação sinal-ruído. Simulações de Monte Carlo validam os resultados analíticos apresentadosAbstract: Underlay spectrum sharing has been proposed as a promising technique to alleviate the problem of spectrum scarcity and underutilization, by enabling secondary (unlicensed) users to concurrently access a licensed band, provided that the resulting interference on the primary (licensed) users remains below a given acceptable level. However, such a technique implies that the transmit power at the secondary network must be constrained, thereby compromising the communication reliability and coverage. To counteract this, cooperative relaying techniques, which provide a new form of spatial diversity, can be exploited as an effective means to boost the performance of the secondary network. Indeed, the joint use of both techniques¿underlay spectrum sharing and cooperative relaying¿in cognitive relaying networks has drawn special attention, since the overall spectral efficiency and the secondary-network performance can be significantly improved. This dissertation comprises four main contributions in this field. In particular, we examine the combined effect of two crucial power constraints on the outage performance of cognitive relaying networks, namely, the maximum tolerable interference power at the primary receiver and the maximum transmit power at the secondary users. We focus on relaying schemes operating under the decode-and-forward protocol, for scenarios in which the direct link between source and destination is available to convey useful information. As a first contribution, we analyze the performance of two incremental half-duplex relaying schemes, which exploit the spatial diversity of the direct links in a multiuser scenario. Our second contribution investigates the impact of outdated channel estimates on the destination-scheduling mechanism of one of those incremental schemes, from the perspective of a cooperative network only, that is, in the absence of spectrum sharing. The third contribution addresses cognitive full-duplex relaying networks. More specifically, we assess the system performance as a function of both the residual self-interference, which is inherent to the full-duplex relaying mode, and the underlay spectrum-sharing power constraints. As a final contribution, driven by the tradeoff between the spectral-efficiency loss and the residual self-interference problem, intrinsic to the half- and full-duplex relaying modes, respectively, we propose and analyze an adaptive transmission scheme whereby, before each communication process, one out of the following transmission modes is selected: half-duplex relaying, full-duplex relaying, or direct transmission. For all the considered scenarios, exact analytical expressions for the outage probability are derived. In addition, an asymptotic analysis is performed to obtain further insights on the diversity order and outage behavior of the secondary network at the high signal-to-noise ratio regime. Monte Carlo simulations corroborate the accuracy of the presented mathematical analysisDoutoradoTelecomunicações e TelemáticaDoutor em Engenharia ElétricaCAPE