oalib
Search Results: 1 - 10 of 100 matches for " "
All listed articles are free for downloading (OA Articles)
Page 1 /100
Display every page Item
A Buffer-aided Successive Opportunistic Relay Selection Scheme with Power Adaptation and Inter-Relay Interference Cancellation for Cooperative Diversity Systems  [PDF]
Nikolaos Nomikos,Themistoklis Charalambous,Ioannis Krikidis,Dimitrios Skoutas,Demosthenes Vouyioukas,Mikael Johansson
Mathematics , 2013,
Abstract: In this paper we consider a simple cooperative network consisting of a source, a destination and a cluster of decode-and-forward half-duplex relays. At each time-slot, the source and (possibly) one of the relays transmit a packet to another relay and the destination, respectively, resulting in inter-relay interference (IRI). In this work, with the aid of buffers at the relays, we mitigate the detrimental effect of IRI through interference cancellation. More specifically, we propose the min-power scheme that minimizes the total energy expenditure per time slot under an IRI cancellation scheme. Apart from minimizing the energy expenditure, the min-power selection scheme, also provides better throughput and lower outage probability than existing works in the literature. It is the first time that interference cancellation is combined with buffer-aided relays and power adaptation to mitigate the IRI and minimize the energy expenditure. The new relay selection policy is analyzed in terms of outage probability and diversity, by modeling the evolution of the relay buffers as a Markov Chain (MC). We construct the state transition matrix of the MC, and hence obtain the steady state with which we can characterize the outage probability. The proposed scheme outperforms relevant state-of-the-art relay selection schemes in terms of throughput, diversity and energy efficiency, as demonstrated via examples.
A Cooperative Network Coding Strategy for the Interference Relay Channel  [PDF]
Huyen-Chi Bui,Hugo Meric,Jerome Lacan,Marie-Laure Boucheret
Computer Science , 2012,
Abstract: In this paper, we study an interference relay network with a satellite as relay. We propose a cooperative strategy based on physical layer network coding and superposition modulation decoding for uni-directional communications among users. The performance of our solution in terms of throughput is evaluated through capacity analysis and simulations that include practical constraints such as the lack of synchronization in time and frequency. We demonstrate throughputs significantly larger than the classical time sharing case.
A Stochastic Geometry Approach to Energy Efficiency in Relay-Assisted Cellular Networks  [PDF]
Na Deng,Sihai Zhang,Wuyang Zhou,Jinkang Zhu
Computer Science , 2012,
Abstract: Though cooperative relaying is believed to be a promising technology to improve the energy efficiency of cellular networks, the relays' static power consumption might worsen the energy efficiency therefore can not be neglected. In this paper, we focus on whether and how the energy efficiency of cellular networks can be improved via relays. Based on the spatial Poisson point process, an analytical model is proposed to evaluate the energy efficiency of relay-assisted cellular networks. With the aid of the technical tools of stochastic geometry, we derive the distributions of signal-to-interference-plus-noise ratios (SINRs) and mean achievable rates of both non-cooperative users and cooperative users. The energy efficiency measured by "bps/Hz/W" is expressed subsequently. These established expressions are amenable to numerical evaluation and corroborated by simulation results.
High-Throughput Cooperative Communication with Interference Cancellation for Two-Path Relay in Multi-source System  [PDF]
Hao Lu,Peilin Hong,Kaiping Xue
Mathematics , 2013,
Abstract: Relay-based cooperative communication has become a research focus in recent years because it can achieve diversity gain in wireless networks. In existing works, network coding and two-path relay are adopted to deal with the increase of network size and the half-duplex nature of relay, respectively. To further improve bandwidth efficiency, we propose a novel cooperative transmission scheme which combines network coding and two-path relay together in a multi-source system. Due to the utilization of two-path relay, our proposed scheme achieves full-rate transmission. Adopting complex field network coding (CFNC) at both sources and relays ensures that symbols from different sources are allowed to be broadcast in the same time slot. We also adopt physical-layer network coding (PNC) at relay nodes to deal with the inter-relay interference caused by the two-path relay. With careful process design, the ideal throughput of our scheme achieves by 1 symbol per source per time slot (sym/S/TS). Furthermore, the theoretical analysis provides a method to estimate the symbol error probability (SEP) and throughput in additive complex white Gaussian noise (AWGN) and Rayleigh fading channels. The simulation results verify the improvement achieved by the proposed scheme.
Interference Cancellation at the Relay for Multi-User Wireless Cooperative Networks  [PDF]
Liangbin Li,Yindi Jing,Hamid Jafarkhani
Mathematics , 2010, DOI: 10.1109/TWC.2010.011111.100640
Abstract: We study multi-user transmission and detection schemes for a multi-access relay network (MARN) with linear constraints at all nodes. In a $(J, J_a, R_a, M)$ MARN, $J$ sources, each equipped with $J_a$ antennas, communicate to one $M$-antenna destination through one $R_a$-antenna relay. A new protocol called IC-Relay-TDMA is proposed which takes two phases. During the first phase, symbols of different sources are transmitted concurrently to the relay. At the relay, interference cancellation (IC) techniques, previously proposed for systems with direct transmission, are applied to decouple the information of different sources without decoding. During the second phase, symbols of different sources are forwarded to the destination in a time division multi-access (TDMA) fashion. At the destination, the maximum-likelihood (ML) decoding is performed source-by-source. The protocol of IC-Relay-TDMA requires the number of relay antennas no less than the number of sources, i.e., $R_a\ge J$. Through outage analysis, the achievable diversity gain of the proposed scheme is shown to be $\min\{J_a(R_a-J+1),R_aM\}$. When {\small$M\le J_a\left(1-\frac{J-1}{R_a}\right)$}, the proposed scheme achieves the maximum interference-free (int-free) diversity gain $R_aM$. Since concurrent transmission is allowed during the first phase, compared to full TDMA transmission, the proposed scheme achieves the same diversity, but with a higher symbol rate.
Joint Transmit Diversity Optimization and Relay Selection for Cooperative MIMO Systems using Discrete Stochastic Algorithms  [PDF]
P. Clarke,R. C. de Lamare
Computer Science , 2013,
Abstract: We propose a joint discrete stochastic optimization based transmit diversity selection (TDS) and relay selection (RS) algorithm for decode-and-forward (DF), cooperative MIMO systems with a non-negligible direct path. TDS and RS are performed jointly with continuous least squares channel estimation (CE), linear minimum mean square error (MMSE) receivers are used at all nodes and no inter-relay communication is required. The performance of the proposed scheme is evaluated via bit-error rate (BER) comparisons and diversity analysis, and is shown to converge to the optimum exhaustive solution.
A Stochastic Geometry Framework for Analyzing Pairwise-Cooperative Cellular Networks  [PDF]
Anastasios Giovanidis,Francois Baccelli
Computer Science , 2013, DOI: 10.1109/TWC.2014.2360196
Abstract: Cooperation in cellular networks has been recently suggested as a promising scheme to improve system performance, especially for cell-edge users. In this work, we use stochastic geometry to analyze cooperation models where the positions of Base Stations (BSs) follow a Poisson point process distribution and where Voronoi cells define the planar areas associated with them. For the service of each user, either one or two BSs are involved. If two, these cooperate by exchange of user data and channel related information with conferencing over some backhaul link. Our framework generally allows variable levels of channel information at the transmitters. In this paper we investigate the case of limited channel state information for cooperation (channel phase, second neighbour interference), but not the fully adaptive case which would require considerable feedback. The total per-user transmission power is further split between the two transmitters and a common message is encoded. The decision for a user to choose service with or without cooperation is directed by a family of geometric policies depending on its relative position to its two closest base stations. An exact expression of the network coverage probability is derived. Numerical evaluation allows one to analyze significant coverage benefits compared to the non-cooperative case. As a conclusion, cooperation schemes can improve system performance without exploitation of extra network resources.
On Cooperative Relay Networks with Video Applications  [PDF]
Donglin Hu,Shiwen Mao
Computer Science , 2012,
Abstract: In this paper, we investigate the problem of cooperative relay in CR networks for further enhanced network performance. In particular, we focus on the two representative cooperative relay strategies, and develop optimal spectrum sensing and $p$-Persistent CSMA for spectrum access. Then, we study the problem of cooperative relay in CR networks for video streaming. We incorporate interference alignment to allow transmitters collaboratively send encoded signals to all CR users. In the cases of a single licensed channel and multiple licensed channels with channel bonding, we develop an optimal distributed algorithm with proven convergence and convergence speed. In the case of multiple channels without channel bonding, we develop a greedy algorithm with bounded performance.
The Generalized Degrees of Freedom of the Interference Relay Channel with Strong Interference  [PDF]
Soheyl Gherekhloo,Anas Chaaban,Aydin Sezgin
Computer Science , 2013,
Abstract: The interference relay channel (IRC) under strong interference is considered. A high-signal-to-noise ratio (SNR) generalized degrees of freedom (GDoF) characterization of the capacity is obtained. To this end, a new GDoF upper bound is derived based on a genie-aided approach. The achievability of the GDoF is based on cooperative interference neutralization. It turns out that the relay increases the GDoF even if the relay-destination link is weak. Moreover, in contrast to the standard interference channel, the GDoF is not a monotonically increasing function of the interference strength in the strong interference regime.
Cooperative Relay Broadcast Channels  [PDF]
Yingbin Liang,Venugopal V. Veeravalli
Mathematics , 2006,
Abstract: The capacity regions are investigated for two relay broadcast channels (RBCs), where relay links are incorporated into standard two-user broadcast channels to support user cooperation. In the first channel, the Partially Cooperative Relay Broadcast Channel, only one user in the system can act as a relay and transmit to the other user through a relay link. An achievable rate region is derived based on the relay using the decode-and-forward scheme. An outer bound on the capacity region is derived and is shown to be tighter than the cut-set bound. For the special case where the Partially Cooperative RBC is degraded, the achievable rate region is shown to be tight and provides the capacity region. Gaussian Partially Cooperative RBCs and Partially Cooperative RBCs with feedback are further studied. In the second channel model being studied in the paper, the Fully Cooperative Relay Broadcast Channel, both users can act as relay nodes and transmit to each other through relay links. This is a more general model than the Partially Cooperative RBC. All the results for Partially Cooperative RBCs are correspondingly generalized to the Fully Cooperative RBCs. It is further shown that the AWGN Fully Cooperative RBC has a larger achievable rate region than the AWGN Partially Cooperative RBC. The results illustrate that relaying and user cooperation are powerful techniques in improving the capacity of broadcast channels.
Page 1 /100
Display every page Item


Home
Copyright © 2008-2017 Open Access Library. All rights reserved.