Scientific Research

An Academic Publisher

Performance Analysis of an Adaptive Incremental Cooperative Relaying Scheme for Wireless Relay Networks

**Author(s)**Leave a comment

1. Introduction

In wireless relay networks, an efficient way of combating channel fading is cooperative diversity in which the source node transmits information to the destination not only through a direct-link but also through the use of relays [1] [2]. The basic idea of it results from the broadcasting property of wireless transmission so that other nodes in the same network can overhear the information from the source node and can then forward what is received to the destination. So, cooperative diversity can provide multiple independently-faded channels for the same information transmission so that the probability that all received signals at the destination suffer deep fading will be significantly reduced. A variety of low-complexity cooperative relaying scheme were proposed firstly in [3], which included fixed relaying (FR), selection relaying (SR) and incremental relaying (IR) schemes. However, both FR and SR schemes lead to a certain loss in spectral efficiency because it requires two time phase periods for half-duplex transmission. IR performs in full-duplex transmission when the direct transmission between the source and destination nodes is successful and in half-duplex transmission only when the direct transmission is not successful, so IR scheme can increase the system spectral efficiency over FR or SR scheme. More cooperative relaying schemes were studied and analyzed for various systems or channel models detailed in [4] [5] [6] [7].

However, all the aforementioned papers only consider fixed rate transmission in cooperative relaying system, which results in a deteriorated throughput performance over time-varying fading channels. Adaptive transmission at the transmitter based on adaptive modulation and coding (AMC) has been shown to be effective to enhance the system performance over time-varying fading channels [8]. To exploit the benefits of rate adaptation over the relay channel, recently, several studies have been reported in [9] [10] [11].

It is known that multimedia application not only require wireless relay networks to support the higher transmission rate, but also need the much better packet-level quality of service (QoS) performance such as packet error rate (PER) at the data link layer. However, both the packet-level QoS requirement in wireless relay networks and the effect of cooperative relaying on the higher layer aren’t considered in [9] [10] [11]. Designing cooperative relaying schemes suitable for QoS constrained multimedia applications in wireless relay networks is still an open problem.

Motivated by these researches, in order to enhance the system throughput over time-varying fading channels, we propose an adaptive incremental decode-and-forward cooperative relaying (AIR) scheme based on AMC for the single-relay transmission system, which implements adaptive rate transmission of the source and relay nodes according to channel state information. The AIR system throughput is defined as the data rate successfully received at the destination node in this paper. We firstly derive expressions for the AIR system throughput, and then give a gradient-based search algorithm to find the optimized adaptive solution for the AIR system by maximizing throughput subject to the constraint of packet error rate at the data link layer. In addition, throughput of the traditional IR system is also deduced and compared with that of the AIR system.

Different from researches in [9] [10] [11], the design objective of the AIR scheme is maximizing the system throughput while satisfying the packet-level QoS requirement (the constraint of packet error rate). Moreover, in the AIR system, both source and relay node can employ different adaptive modulation coding modes or transmission rate at physical layer and the relay node only retransmits the packet erroneously received at the destination in order to enhance the system spectral efficiency over the adaptive FR schemes proposed in [9] and [10]. At last, the AIR scheme is easier to implement than the adaptive relaying scheme based on distributed space-time codes proposed in [11], as the later requires synchronization between the spatially separated relays performing the distributed space-time code [12] [13].

2. System Model and Adaptive Incremental Relaying Scheme

Consider three relevant nodes in a wireless relay network, represented respectively by S (source node), R (relay node) and D (destination node), and assume that S wants to sent data to D, as illustrated in Figure 1. At S, packets are stored in a transmit buffer, grouped into frames, and then transmitted over the wireless channel on a frame by frame basis. Assume that the cyclic redundancy check (CRC) bits of each packet facilitate perfect error detection at the receiving nodes. The time is slotted, and the length of a time slot can satisfy the transmission latency and spread latency of the data frame. The proposed AIR scheme acts as follows. S node firstly transmits a data frame in the current time slot. For one case, upon successful reception of all packets in this frame at D, it sends back an ACK message, then S transmits a new data frame in the next time slot and the R node just idles. For the other case, if the D receives a packet in error, it broadcasts a NACK message identifying the corrupted packet. If R has received the source packet successfully, it retransmits it to the D and D drops the corrupted packets and only decodes based on the retransmitted packet. If D still fails to receive the retransmitted packet, this packet will be dropped. Moreover, if the R fails to receive the source packet, this packet will be also dropped.

Adopting the block fading channel model for the S-D, R-D and S-R links, the channel gains remain constant over a time slot, but vary from one time slot to another. AMC is employed for both the S-D and R-D links in order to implement the adaptive rate transmission. Based on the perfect channel state information (CSI) acquired at the D node, the AMC selector determines the AMC mode

Figure 1. System model.

which is fed back to the S or R node through the feedback channel without error and latency. Then, the AMC controller of the S or R node updates the transmission mode and transmits the new data frame.

Let N denote the total number of transmission mode available and define instantaneous SNR of the S-D and R-D links as γ_{1} and γ_{2} respectively. The system partitions the entire SNR range into N + 1 nonoverlapping consecutive intervals with the SNR thresholds denoted as

(1)

where m = 1, 2 refers to the S-D and R-D links respectively and n = 0, 1, ・・・, N is the mode index.

Specifically, mode n is chosen for the S node when SNR

(2)

Then the S node transmits the data frame in the corresponding rate R_{n} bit/symbol.

Similarly, when SNR

(3)

R node retransmits the corrupted packet to D node in the rate R_{n−}_{1} bits/sym- bol.

To avoid deep channel fades, no data frame will be sent when γ_{m} < γ_{m}_{,0}.

If the symbol rate of the system is constant, R_{n} can stand for the data rate. We define throughput of the AIR system as the average data rate successfully received at the D node, so throughput can be expressed by

(4)

where E[] stands for expected operation, E[R_{n}] represents the expected data rate, L is the length of one packet, C is the length of CRC bits and PER_{a} is the average packet error rate (PER) of the system. To derive expression of throughput, we need to deduce expressions of the average PER and expected data rate respectively in the next section.

3. Performance Analysis

3.1. The Average Packet Error Rate

Let PER_{SD}_{−a}, PER_{RD}_{−a} and PER_{SR}_{−a} denote the average PER of the S-D, R-D and S-R links respectively, so the average PER of the system can be expressed by

(5)

where the first term corresponds to the event that the source packet is received in error at both the D and R nodes and the second term corresponds to the event that the packet is received in error at the D node but successfully at the R nodes, and the R node’s retransmission to the D node is still in error. The expressions of PER_{SD}_{−a}, PER_{RD}_{−a} and PER_{SR}_{−a} will be deduced in the following.

All the channels are modeled as a Rayleigh block fading channel and AWGN with variance N_{0}. Assume that the transmit power is constant for all nodes, denoted by P_{t}, d_{1}, d_{2} and d_{3} denote the distance of S-D, R-D, and S-R links respectively and path loss exponent is represented by α, so the probability distribution function (PDF) of the received SNR for the S-D and R-D links can be written as respectively

(6)

where m = 1, 2, 3 refers to the S-D, R-D and S-R links respectively and , and stand for the average received SNR of links.

According to the AMC rule in (2) and (3), each mode n for the S and R nodes will be chosen with probability

(7)

Noting that the instantaneous PER depends on the received SNR γ, in order to simplify the analysis, we approximate the instantaneous PER for the AMC mode n as [8]

(8)

where the parameters {a_{n}, g_{n}, γ_{pn}} are obtained by fitting (8) to the exact PER of mode n.

Let PER_{m}_{,n} denote the average PER for mode n. Combining (6), (7) and (8), the average PER of the S-D and R-D links for mode n can be written as

(9)

where m = 1, 2 refers to the S-D and R-D links respectively.

So, the PER of the S-R link for mode n can be expressed by

(10)

The average PER of links can be computed as the ratio of the average number of incorrectly received packets over the total average number of transmitted packets. So, we have

(11)

(12)

(13)

Substituting expression (11), (12) and (13) into (5), we can derive expression of the average PER of the system.

3.2. The Expected Data Rate

We define the expected data rate E[R_{n}] as the average number of accepted information bits per symbol at the D node. Let R_{1,n} denotes that S node transmits data packets with data rate R_{n} and R_{2,n} denotes that R node retransmits the corrupted data packet with data rate R_{n}, so, the expected data rate can be expressed as

(14)

where the first term corresponds to the event that a packet transmitted by the S node with data rate R_{1,n} is received successfully by D or received erroneously by both the D and R nodes and the second term corresponds to the event that the R node retransmit the corrupted packet with data rate R_{2,n}.

Considering that the total number of AMC modes is N, using (6) and (14), (14) can be rewritten as

(15)

3.3. The Optimum of Throughput

Substituting (5) and (15) into (4), we can derive expression of the system throughput. The design objective of the AIR scheme is to maximize the system throughput, while satisfying the packet error rate requirement. So, we need to determine the optimized SNR thresholds {γ_{m}_{,n}} for the AMC mode of AIR system in order to maximize system throughput.

So, the desired optimized problem can be formulated as follows

(16)

which means that the average PER of the system is not greater than the threshold of PER (PER_{t}).

Firstly, we formulate the total PER constraint in (16) into two separate PER constraints for the S-D and R-D links as follows

(17)

(18)

where PER_{SD}_{−t} and PER_{RD}_{−t} are the threshold of PER for the S-D and R-D links respectively.

Combing (5), (16), (17) and (18), we have

(19)

(20)

Using (8) and (17), we can derive expressions of the SNR threshold of AMC mode for the S-D link as follows

(21)

Combining (8) and (20), we can derive expressions of the SNR threshold of AMC mode for the R-D link as follows

(22)

Using (16), (21) and (22), the optimized problem in (16) can be rewritten as

(23)

In the following, we give a gradient-based search algorithm to find the optimized the SNR threshold of AMC mode. Let PER_{SD−t} = M, T(M) denotes the corresponding throughput, ƏT(M)/ƏM is the derivative of T(M), M_{o} represents the optimum value of M and T_{max} denotes the corresponding maximal value of throughput. Moreover, let ε to be a finite small positive real number.

The pseudo code of the gradient-based search algorithm is as follows.

4. Numerical and Simulation Results

In this section, we provide results to compare the performance of AIR system with that of CRIR system. Without the loss of the generality, we assume that the average SNR of the S-R link is 25 dB and the S-D link and the R-D link have the same average SNR. In addition, transmit power P_{t} is normalized to unity. In the simulation, we use the AMC mode of HYPERLAN/2 standard with packet length L = 1080 bits and mode 4 is employed by CRIR system.

Figure 2 shows the average PER performances of the AIR and CRIR system. From the figure, we can see that AIR system performance outperforms the CRIR system for any SNR value. This is because that AMC is introduced in AIR system, in which no data frame will be sent in order to avoid deep channel fades. Moreover, the average PER of the AIR system is below the threshold of PER at the data link layer (PER_{t} = 0.01) and the packet-level QoS requirement of the system is satisfied.

As shown in Figure 3, the AIR system throughput is a concave function of the

Figure 2. The average PER of AIR system vs. the average PER of CRIR system (PER_{t} = 0.01).

Figure 3. Throughput of AIR system vs. the threshold PER of S-D link (PER_{t} = 0.01).

Figure 4. Throughput of AIR system vs. throughput of CRIR system (PER_{t} = 0.01).

PER threshold of S-D link and there are different optimized throughput values of AIR system for different average SNR of S-D link. The optimized throughput value of AIR system becomes larger and larger as the SNR increases. So, the gradient-based search algorithm proposed in Section III. 3 can find the optimized throughput.

Figure 4 compares the throughput of AIR system with that of CRIR system. Due to AMC introduced in AIR scheme, throughput of AIR system exceeds that of CRIR system for any SNR value. The simulation results are very close to the theory results, which verify the theory analysis in Section 3.

5. Conclusions and Future Work

In this paper, we propose an adaptive incremental cooperative relaying (AIR) scheme in order to enhance throughput of the cooperative relaying system. We derive expression for the AIR throughput and give a gradient-based search algorithm to find the optimized adaptive solution for AIR system by maximizing throughput subject to the constraint of PER at the data link layer. The numerical and simulation results indicate that throughput of AIR system outperforms that of traditional incremental relaying system greatly for any SNR value. The AIR scheme proposed in the paper establishes the theory foundation for the QoS constrained multimedia applications in wireless relay networks.

We plan to extend our work to the multi-relay selection scenario. If there are multiple relays nodes chosen for the source node, one can select the best relay to retransmit the packet erroneously received by the destination node according to the corresponding relay selection standard such as the best harmonic mean selection method [12]. Moreover, the constant transmit power is adopted at all the nodes in this paper. In future, the power control scheme can be integrated into our research.

Conflicts of Interest

The authors declare no conflicts of interest.

Cite this paper

*International Journal of Communications, Network and System Sciences*,

**10**, 48-57. doi: 10.4236/ijcns.2017.108B006.

[1] | Sendonaris, A., Erkip, E. and Aazhang, B. (2003) User Cooperation Diversity-Part I: System Description. IEEE Transactions on Communications, 51, 1927-1938. https://doi.org/10.1109/TCOMM.2003.818096 |

[2] | Sendonaris, A., Erkip, E. and Aazhang, B. (2003) User Cooperation Diversity-Part II: Implementation Aspects and Performance Analysis. IEEE Transactions on Com- munications, 51, 1939-1948. https://doi.org/10.1109/TCOMM.2003.819238 |

[3] | Laneman, J.N., Wornell, G.W. and Tse, D.N.C. (2004) Cooperative Diversity in Wireless Networks: Efficient Protocols and Outage Behavior. IEEE Transactions on Information Theory, 50, 3062-3080. https://doi.org/10.1109/TIT.2004.838089 |

[4] | Bletsas, A., Khisti, A., Reed, D.P. and Lippman, A. (2006) A Simple Cooperative Diversity Method Based on Network Path Selection. IEEE Journal on Selected Areas in Communications, 24, 659-672. https://doi.org/10.1109/JSAC.2005.862417 |

[5] | Ikki, S. and Ahmed, M.H. (2007) Per-formance Analysis of Cooperative Diversity Wireless Networks over Nakagami-m Fading Channel. EEE Communications Let-ters, 11, 334-336. https://doi.org/10.1109/LCOM.2007.348292 |

[6] | Cai, J., Alfa, A.S., Ren, P., Shen, X. and Mark, J.W. (2008) Packet Level Performance Analysis in Wireless User-Relaying Networks. IEEE Transactions on Wireless Com- muni-cations, 7, 5336-5345. https://doi.org/10.1109/T-WC.2008.070960 |

[7] | Ikki, S.S. and Ahmed, M.H. (2009) Performance of Cooperative Diversity Using Equal Gain Combining (EGC) over Nakagami-m Fading Channels. IEEE Transactions on Wire-less Communications, 8, 557-562. https://doi.org/10.1109/TWC.2009.070966 |

[8] | Liu, Q., Zhou, S. and Giannakis, G. (2005) Queuing with Adaptive Mod-ulation and Coding over Wireless Links: Cross-Layer Analysis and Design. IEEE Transactions on Wireless Communications, 4, 1142-1152. https://doi.org/10.1109/TWC.2005.847005 |

[9] | Ahmed, N. and Aazhang, B. (2007) Throughput Gains Using Rate and Power Control in Cooperative Relay Networks. IEEE Transactions on Communications, 55, 645-656. https://doi.org/10.1109/TCOMM.2007.894121 |

[10] | Dai, L. and Letaief, K.B. (2008) Throughput Maximization of Ad-Hoc Wireless Net- works Using Adaptive Cooperative Diversity and Truncated ARQ. IEEE Transactions on Communications, 56, 1907-1918. https://doi.org/10.1109/TCOMM.2008.041164 |

[11] | Nechiporenko, T., Phan, K.T., Tellambura, C. and Nguyen, H.H. (2009) On the Capacity of Rayleigh Fading Cooperative Systems under Adaptive Transmission. IEEE Transactions on Wire-less Communications, 8, 1626-1631. https://doi.org/10.1109/T-WC.2008.071098 |

[12] | Laneman, J.N. and Wornell, G.W. (2003) Distributed Space-Time-Coded Protocols for Exploiting Cooperative Diversity in Wireless Networks. IEEE Transactions on Information Theory, 49, 2415-2425. https://doi.org/10.1109/TIT.2003.817829 |

[13] | Liu, K.J.R., Sadek, A.K., Su, W. and Kwasinski, A. (2008) Cooperative Communications and Networking. U. K. Cambridge University Press, Cambridge. |

Copyright © 2018 by authors and Scientific Research Publishing Inc.

This work and the related PDF file are licensed under a Creative Commons Attribution 4.0 International License.