Mimicking Full-Duplex Relaying Using Half-Duplex Relays With Buffers

Ikhlef, Aïssa; Kim, Junsu; Schober, Robert

doi:10.1109/tvt.2012.2201189

Cited by 107 publications

(125 citation statements)

References 27 publications

Supporting

Mentioning

125

Contrasting

Order By: Relevance

“…Average normalized end-to-end energy dissipation (J/packet) as defined in (12) when the pathloss factor is α = 2 and M = 1, 2, 3. The theoretical curve was evaluated from (10).…”

Section: Performance Resultsmentioning

confidence: 99%

“…Correspondingly, the energy dissipation ESD of the SD hop may be formulated as: Recalculate all activation probabilities and energy 11 dissipations based on (5) and (7); end 12 where Ei is defined in [17](8.211.1). Similarly to the SD hop, the activation probability and energy dissipation of all other hops can be calculated using a similar procedure.…”

Section: A Multi-dimensional Transmission Activation Probability Spacementioning

confidence: 99%

“…Both our simulation results and theoretical analysis demonstrated that MHD transmissions are capable of achieving a substantial selection diversity gain. Very recently, a relayrelation scheme was proposed in [11], while full-duplex relaying was discussed in [12]. As a further advance, adaptive link selection was proposed in [13].…”

Section: Introductionmentioning

confidence: 99%

See 2 more Smart Citations

On Buffer-Assisted Opportunistic Routing Relying on Linear Transmission Activation Probability Space Partitioning for Relay-Aided Networks

Dong

Zuo

Yang

et al. 2014

2014 IEEE 80th Vehicular Technology Conference (VTC2014-Fall)

View full text Add to dashboard Cite

Abstract-In this paper buffer-aided Opportunistic Routing (OR) was designed with the aid of the novel concept of linear Transmission Activation Probability Space (TAPS) partitioning invoked for relayassisted networks, which combines the benefits of both OR [1] and of buffer-aided transmissions [2]. More specifically, a packet may be transmitted from the Source Node (SN) to the Destination Node (DN) either directly or indirectly via one of the M Relay Nodes (RNs), depending on the instantaneous channel qualities. The above-mentioned linear multi-dimensional TAPS partitioning concept is proposed for partitioning the transmission space into (2M + 1) transmission regions plus an outage region, while ensuring that the number of input packets is equal to the number of output packets at each RN's buffer. The benefit of having a buffer and tolerating the associated delay is that the best channel is activated for transmission based on our linear TAPS partitioning method.

show abstract

“…Average normalized end-to-end energy dissipation (J/packet) as defined in (12) when the pathloss factor is α = 2 and M = 1, 2, 3. The theoretical curve was evaluated from (10).…”

Section: Performance Resultsmentioning

confidence: 99%

Section: A Multi-dimensional Transmission Activation Probability Spacementioning

confidence: 99%

See 1 more Smart Citation

On Buffer-Assisted Opportunistic Routing Relying on Linear Transmission Activation Probability Space Partitioning for Relay-Aided Networks

Dong

Zuo

Yang

et al. 2014

2014 IEEE 80th Vehicular Technology Conference (VTC2014-Fall)

View full text Add to dashboard Cite

show abstract

“…This requires a brief initialization process prior to each transmission phase in order for the CSI to be fed back to the source. Compared to other state-of-the-art works such as [9], an additional overhead is introduced due to the acquisition of the inter-relay links' CSI. However, this loss can be recovered through the possibility of interference cancellation due to the optimal relay-pair selection.…”

Section: System Modelmentioning

confidence: 99%

“…Ikhlef et al [8] propose a novel criterion based on the max − max relay selection (MMRS), in which the relay with the best SR link is selected for reception and the relay with the best RD link is selected for transmission. Another work that adopts the MMRS is the one in [9] which aims to recover the half-duplex loss of relaying by having different relays selected in the same time slot to receive and transmit. Krikidis et al [10] proposed the max − link protocol which allows for all the SR and RD links to enter the competition for the best one through which a signal will be transmitted, thus providing additional freedom in the scheduled transmissions in each time slot.…”

Section: Introductionmentioning

confidence: 99%

Buffer-aided successive opportunistic relaying with inter-relay interference cancellation

Νομικός

Charalambous

Krikidis

et al. 2013

2013 IEEE 24th Annual International Symposium on Personal, Indoor, and Mobile Radio Communications (PIMRC)

View full text Add to dashboard Cite

Abstract-In this paper we consider a simple cooperative network consisting of a source, a destination and a cluster of decode-and-forward relays characterized by the half-duplex constraint. At each time-slot the source and (possibly) one of the relays transmit a packet to another relay and the destination, respectively. When the source and a relay transmit simultaneously, inter-relay interference is introduced at the receiving relay. In this work, with the aid of buffers at the relays, we mitigate the detrimental effect of inter-relay interference through either interference cancellation or mitigation. More specifically, we propose the min − power opportunistic relaying protocol that minimizes the total energy expenditure per time slot under an inter-relay interference cancellation scheme. The min − power relay-pair selection scheme, apart from minimizing the energy expenditure, also provides better throughput and lower outage probability than existing works in the literature. The performance of the proposed scheme is demonstrated via illustrative examples and simulations in terms of outage probability and average throughput. I. INTRODUCTIONRelaying cooperation is an efficient technique to combat fading and path-loss effects in wireless systems. It enables multiple nodes to create virtual multiple-input multiple-output (MIMO) configurations in order to provide transmit and/or receive spatial diversity to single-antenna destinations [1]. Traditional cooperative systems are characterized by the halfduplex constraint and thus relay nodes cannot receive and transmit data simultaneously resulting in bandwidth loss. In order to overcome this limitation, several techniques have been proposed in the literature [2]. Among them, the successive relaying scheme in [3] incorporates two relays and proposes a transmission overlap (source-relay (SR), relay-destination (RD)) which mimics full-duplex transmission. On the other hand, for networks with multiple relay nodes, relay selection has been introduced as a promising solution that exploits the available channel diversity degrees by keeping the implementation complexity low. In earlier works, relays were assumed to lack data buffers and selection was based on the maxmin criterion and its variations (see, for example, [4]-[6] and references therein). As a result, the relay that received the

show abstract

A full‐duplex relay selection strategy based on potential game in cognitive cooperative networks

Cheng

Huang

et al. 2018

Concurrency and Computation

View full text Add to dashboard Cite

Summary In this paper, we study the full‐duplex relay selection strategy based on a potential game in a cognitive cooperative network under the interference power constraint from secondary users to the primary receivers, the total available transmission power constraint for the secondary system, and the self‐interference constraint at each secondary relay. The relay selection problem is modeled as a non‐cooperative game where the total rate of a cognitive cooperative network has common utility. Then, we prove that the game is a potential game that has at least a pure strategy Nash equilibrium (NE), and the optimal strategy set that able to maximize cognitive cooperative system rate is also a pure strategy NE of the proposed game model. On the premise of having no information of infeasible strategy sets, we solve the feasibility conditions of the pure NE in the proposed game. Furthermore, we propose a cognitive full‐duplex relay iterative algorithm that can achieve a pure strategy NE, and the complexity and the convergence of the proposed algorithm are studied. Simulation results show that the proposed algorithm can achieve optimal or near optimal rate performance with low complexity and offers significant performance gain compared with the traditional half‐duplex mode.

show abstract

Mimicking Full-Duplex Relaying Using Half-Duplex Relays With Buffers

Cited by 107 publications

References 27 publications

On Buffer-Assisted Opportunistic Routing Relying on Linear Transmission Activation Probability Space Partitioning for Relay-Aided Networks

On Buffer-Assisted Opportunistic Routing Relying on Linear Transmission Activation Probability Space Partitioning for Relay-Aided Networks

Buffer-aided successive opportunistic relaying with inter-relay interference cancellation

A full‐duplex relay selection strategy based on potential game in cognitive cooperative networks

Contact Info

Product

Resources

About