Please use this identifier to cite or link to this item: http://hdl.handle.net/10397/18977
Title: Paired-relay-selection schemes for two-way relaying with network coding
Authors: Jiang, Y
Lau, FCM 
Sattar, Z
Ho, IWH
Zhou, QF
Issue Date: 2015
Publisher: Institution of Engineering and Technology
Source: IET Communications, 2015, v. 9, no. 6, p. 888-896 How to cite?
Journal: IET Communications 
Abstract: To exchange information between two sources in a two-way relaying network with multiple potential relays, most researches focus on two-hop relay system with single-relay-selection (SRS) scheme. Comparing with SRS scheme, the authors first design a paired-relay-selection (PRS) scheme in which a pair of 'best' relays broadcast network-coded information to other nodes (source or relay). They propose an optimal selection algorithm and a suboptimal algorithm that selects the pair of 'best' relays in the PRS scheme and they describe how the nodes exchange information in a frame consisting of four timeslots. Both the analytical and simulation results show that when the pathloss exponent is large and/or there is a sufficient number of relays to choose from, using two relay nodes can provide a lower outage compared with using only one relay node even under the same total transmit power in uniformly distributed relay networks. In addition, to reduce the overhead of the PRS scheme, they propose an iterative-PRS (I-PRS) scheme in which the paired relay is selected in an iterative and opportunistic way. Simulation results show that the I-PRS scheme has nearly the same outage performance as the PRS scheme under time-invariant channels and significantly outperforms the PRS scheme under time-varying channels.
URI: http://hdl.handle.net/10397/18977
ISSN: 1751-8628
DOI: 10.1049/iet-com.2014.0726
Appears in Collections:Journal/Magazine Article

Access
View full-text via PolyU eLinks SFX Query
Show full item record

Page view(s)

33
Last Week
1
Last month
Checked on Aug 13, 2017

Google ScholarTM

Check

Altmetric



Items in DSpace are protected by copyright, with all rights reserved, unless otherwise indicated.