I Introduction
Cooperative communications have been an important building block for communication systems, in which the communication between a source node and a destination node is accomplished via the help of a number of relay nodes [1]. With the help of relays, alternative and independent transmission paths are offered, and the diversity gain of the network can be obtained. Also, distributed beamforming gain can be expected [2].
To better utilize the benefits provided by multiple relays, various relay selection schemes have been proposed. The conventional relay selection (CRS) scheme selects single relay that provides the strongest end-to-end path between the source and destination [3]. The selected relay forwards the received data immediately in the next time slot to the destination and therefore the ability of the relays to store at least a limited number of data packets is not elaborated. This relay selection policy is considered as the optimal selection scheme for conventional relaying system without buffers. The adoption of buffer-aided relays can provide both throughput and diversity gain by adaptive link selection [4], [5]. Storing packets and transmitting them in favorable wireless conditions increases the network’s resiliency, throughput and diversity. A max-max relay selection (MMRS) scheme was proposed in [6], which selects the relay with the best source-relay link and the best relay-destination link for data reception and transmission, respectively. And space full-duplex max-max relay selection (SFD-MMRS) scheme was introduced in [7], which mimics full-duplex (FD) relaying with half-duplex (HD) relays via link selection. A new relay selection scheme called max-link relay selection scheme was suggested in [8], which selects the strongest link for transmission among all the available links at each time slot. In addition, a modified max-link relay selection scheme has also been proposed, in which the direct link between the source and destination was exploited to achieve a significant performance gain in terms of diversity and delay [9]. And a general relay selection factor including the weight of the link and the link quality was defined in [10]. It is worth noting that the relay selected with the adaptive link selection policies varies with the instantaneous channel state information (CSI), which may introduce more complexities in practical implement.
Note that a relay usually operates in either FD or HD mode. In FD relaying, the relays transmit and receive at the same time, and this operation will increase the hardware complexity [11], [12]. We consider HD relays in this paper. In HD relaying, relays are incapable of transmitting and receiving simultaneously, thus leading to reduced capacity of the whole network. In order to recover the HD loss, several successive relaying schemes have been proposed [13]-[15], the main idea of which is to adopt two relays acting as the receiving and transmitting relay simultaneously. In [13], a two-way relaying protocol and a two-path relaying protocol were proposed. It was shown that both protocols recover a significant portion of the HD loss for different relaying strategies. Both inter-relay interference (IRI) and a direct link between source and destination were considered in [14]. In [15], the authors considered a two-relay network with multiple antennas at the destination. The infrastructure-based relays with highly directional antennas were used to avoid IRI. Note however that a two-relay network is assumed in most of the aforementioned works with successive relaying.
Inspired by the decode-and-forward [2] and fixed scheduling [16], in this paper, we propose a novel relaying protocol named alternate distributed beamforming (ADB), where the receiving and transmitting relays are predetermined in each time slot by grouping the relays. We consider the half-duplex buffer-aided multiple-relay systems. We assume that there is no direct link between the source and the destination. We analyze the achievable throughput of the proposed scheme in Rayleigh fading channels and derive the closed-form expressions. Numerical results in accordance with theoretical analysis show the superiority of ADB.
The reminder of this paper is organized as follows. The system model and several existing protocols are briefly introduced in Section II. In Section III, the operation of ADB is described in detail, and comprehensive analysis of the achievable throughput is presented and the approximate closed-form expressions are derived. Numerical results are provided in Section IV. Finally, conclusions are drawn in Section V with some lengthy proofs in Appendix.
Ii Preliminaries
Ii-a System Model
We consider a relay network consisting of one source node , a set of decode-and-forward (DF) relays , and one destination node , as shown in Fig. 1. We assume that all nodes are equipped with a single antenna and operate in the HD mode, i.e., they cannot transmit and receive data simultaneously. We assume that there is a buffer of infinite length at each relay such that each relay can store the information received from the source and transmit it in later time.
We assume that there is no direct link between the source and destination, and the communications can be established only via relays. We use and for to denote the channel coefficients of and links, respectively. The channel is assumed to be stationary and ergodic. We consider the block fading, in which the channel coefficients remain constant during one time slot and vary independently from one to the other. In addition to fading, all wireless links are impaired by additive white Gaussian noise (AWGN). The instantaneous received signal-to-noise ratio (SNR) at relay is given by , and the instantaneous received SNR at the destination from relay is given by , where is the transmit power of the source, is the transmit power of each relay, and is the noise power at the relays and destination.
We assume Rayleigh fading for the channel coefficients and the variances of
and are assumed to be and , respectively. Throughout this paper, we consider the case of independent and identically distributed (i.i.d.) fading for both and the links, i.e. and , which is a typical assumption to facilitate analysis [7].Ii-B Existing Relaying Protocols
In this part, we review several existing relaying protocols. It is assumed that CSI is known at the transmitter of each link.
Ii-B1 Conventional Relay Selection (CRS)
The conventional relay selection protocol selects the relay which provides the strongest end-to-end path between the source and destination [3]. The source transmits in the first time slot and the selected relay forwards the data received from the source towards the destination in the second time slot. The best relay is selected based on
(1) |
The instantaneous end-to-end capacity for the overall system is given by
(2) |
Then, the achievable throughput is given by , where denotes the expectation. Throughout this text, the unit for the throughput is bps/Hz.
Ii-B2 Space Full-Duplex Max-Max Relay Selection (SFD-MMRS)
This protocol chooses different relays for reception and transmission, according to the quality of the channels, so that the relay selected for reception and the relay selected for transmission can receive and transmit at the same time [7]. The best relay for reception and the best relay for transmission are selected respectively based on
(3) |
(4) |
The second best relay for reception and the second best relay for transmission are selected respectively according to
(5) |
(6) |
Then, in SFD-MMRS, the relays selected for reception and transmission are chosen as
(7) |
Let and denote the instantaneous capacities of the and links, respectively, i.e.,
(8) |
The achievable throughput is given by .
Ii-B3 Decode and Forward (DF)
In DF [2], each relay must decode the common message transmitted by the source node and beamform their transmissions to the destination, which is also performed in two time slots. Then, the instantaneous rate for the overall system is given by
(9) |
The achievable throughput is given by .
Iii Alternating Decode-and-Forward Protocol
Iii-a The transmission policy
The operation of the ADB can be seen in Fig. 2, which has two patterns. Time is slotted into discrete equal-size time slots. We divide relays into two groups, i.e., group 1 with relays, and group 2 with relays, ^{2}^{2}2Due to the i.i.d. assumption, the relays can be divided arbitrarily. In case of different fading statistics, the relay grouping will be another interesting problem.. The source broadcasts messages to the relays in group for each -th time slot while at the same time, the relays in group beamform the data available in their buffers to the destination. It is assumed that the relays are synchronized through signaling. Similarly, during the -th time slot, the relays in group must decode the message transmitted by the source node and stores the packet in their buffers while the relays in group beamform the previously received packets to the destination. Denote , as the set of time indices for the relays in group 1 and 2 receiving data from the source, respectively. Note that , where is the total number of time slots. We assume that the cardinality of and is .
In this strategy, the benefits of both DF and fixed scheduling are enjoyed. It is obvious that with this protocol, the HD loss of conventional relays can be recovered [7] and distributed beamforming gain can be expected. And it is worth noting that compared with the selective protocols CRS and SFD-MMRS, the receiving and transmitting relays in the proposed policy do not vary with the instantaneous CSI and are predetermined at the beginning of transmissions, which makes it easier to implement in practice.
Iii-B Achievable Throughput Analysis
In this section, we analyze the achievable throughput performance of the proposed ADB scheme and derive the approximate closed-form expressions. Due to the assumption of no inter-relay links [7], [15], we assume that there is no inter-relay interference when the receiving relays and transmitting relays are active in the same time-slot. In practice, this assumption is valid if the relays are located far away from each other or if fixed infrastructure-based relays with directional antennas are used. Note that fixed relays are of practical interest since they are low-cost and low-transmit power devices (see, e.g., [15], [17], and [18]). Without loss of generality, we assume that the noise power at the receiving nodes are equal to one, i.e., . First, we have the following results.
Proposition 1
Given the transmit power levels and , the achievable throughput of the proposed scheme can be expressed as
(10) |
Proof: Consider each group of relays, we know that the achievable throughput of the data flow passing through group is given by [19]
(11) |
where and denote the channel coefficients of the and links in the -th and -th time slot, respectively, and the last equality comes from the fact that each transmission modes occupies half of the whole transmission time slots, i.e., . The computation of is similar to that of . Therefore, the achievable throughput of ADB can be calculated as
as shown in (10).
Remark 1
The mode switching frequency , i.e., the relays selected to receive data in every consecutive time slots, does not change the throughput. It is obvious that as increases, the queue length increases and the average delay increases as well. Without loss of generality, we consider the case that while throughout this paper, i.e., the two different transmission modes alternates every time slot.
Denote
(12) | |||
(13) | |||
(14) | |||
(15) |
Proposition 2
Given and , the approximate closed-form expressions for the achievable throughput of ADB in Rayleigh fading channels are given by
(16) |
where
(17) | |||
(18) | |||
(19) |
(20) |
where
and , is the exponential integral function.
Proof: Please see Appendix -A.
Given the total power constraint SNR of the network, we can allocate the total power to the source and relays to achieve the best performance.
For ADB, the receiving and transmitting relays for each time slot have been determined before the system starts its normal operation. The source transmits in every time slot, while either relays in group or relays in group transmits in one time slot. Note also that . Therefore, we should have . Regarding SFD-MMRS, we allocate transmit power to the source and relays to enable each relay to be capable of being selected for transmission. Again, the sources works for all time slots. So we should have . With CRS, similarly, we should allocate transmit energy to the source and relays, albeit the data transmission occupies two time slots. Therefore, we should have . With regard to DF, each relay must decode the common message transmitted by the source node and beamform their transmissions to the destination, obviously we need to allocate transmit energy to source and relays. It is also performed in two time slots, so we should have .
Consider the achievable throughput in (10), once given the total power SNR, it is obvious that when is small, the throughput is limited by the source-relay link. On the other hand, when is small, the relay-destination link will be the bottleneck of the system. Therefore, there is always an optimal power allocation that maximizes the achievable throughput.
Definition 1
The maximum achievable throughput of ADB is given by
(21) |
Similarly, we can define the maximum achievable throughput for DF, CRS, and SFD-MMRS.
Iv Numerical Results
In this section, we evaluate the proposed ADB scheme and compare it with that of CRS [3], SFD-MMRS [7], and DF [2]. We assume that , unless specified otherwise.
Fig. 3 plots the achievable throughput versus for each scheme. We assume dB, and . We can find that the achievable throughput always has a peak value as varies, and the proposed scheme achieves the largest throughput. We also note that the analytical results obtained based on the derivation in Section III match the simulation results, which verifies the approximate closed-form expressions.
In Fig. 4, we compare the maximum achievable throughput of the proposed ADB scheme with that of two relay selection schemes and the traditional DF scheme as SNR varies. We assume , and . We can find that the proposed scheme achieves great performance gain especially in high SNR. We can see that the HD loss is recovered and a beamform gain can be achieved through power allocation.
In Fig. 5, we compare the maximum achievable throughput of the ADB scheme versus SNR for different , i.e., different grouping modes. We assume . It is interesting that, the symmetric allocation of relays achieves the best performance with the given setting. This is generally because that beamforming gain can be attained within each group.
In Fig. 6, we plot the maximum achievable throughput of each scheme versus the number of relays for SNR = 10 dB. We assume . We can find that the proposed scheme achieves the best performance in all cases. It is interesting that for a given SNR, the proposed scheme achieves the largest maximum throughput when , and the DF strategy achieves the best throughput performance when
. This is probably due to the tradeoff between the reduction in the power allocated to relays and the increased possibility of selecting channels with better channel conditions as
increases considering the total power constraint.V Conclusion
In this paper, we have proposed a new relay policy named ADB for buffer-aided multiple relay systems, in which the relays are divided into two groups, with one group receiving the signals transmitted by the source node while at the same time, the other group beamform the previously received data to the destination. In this policy, the relays used for reception and transmission are determined without the need of channel state information (CSI). We have obtained the closed-form expressions of the achievable throughput in Rayleigh fading channels. Through numerical results, we have found that the proposed scheme achieves significant improvement over the existing schemes in terms of the maximum achievable throughput. In addition, for a given total power constraint SNR, the proposed scheme achieves the best throughput performance at a mediate number of relays.
-a Proof of Proposition 2
To compute the achievable throughput of ADB in (16), we need to find , , , and .
: In this case, we denote . Therefore, to derive
, we first compute the probability density function (PDF) of
. The cumulative distribution function (CDF) of
is given by(22) |
Take the derivative of (22), the PDF of can be computed as . Then can be obtained as
(23) |
where is the exponential integral function. The computation of is similar to that of , it is given by
(24) |
: In this case, let be a sum of
i.i.d. Rayleigh random variables (RV’s). Note that the distribution of an arbitrary sum of Rayleigh RV’s is not exist in closed-form, as a result, numerical evaluations and approximations must be used
[20]. A relatively simple and widely used small argument approximation (SAA) for the sum PDF was derived in [21]. Then the SAA to the PDF of is(25) |
where and is the normalized argument. Integration of (25) yields a SAA to the CDF of a Rayleigh sum given by
(26) |
Then the can be computed as
(27) |
where Eq. 3.353.5 in [22] is used to obtain the final equality. The computation of is similar to that of , it is given by
(28) |
where . Finally, is obtained by substituting (23), (24), (27), and (28) into (16).
References
- [1] J. N. Laneman, D. N. C. Tse, and G. W. Wornell, “Cooperative diversity in wireless networks: efficient protocols and outage behavior,” IEEE Trans. Inf. Theory, vol. 50, no. 12, pp. 3062-3080, Dec. 2004.
- [2] F. Parvaresh and R. H. Etkin, “Using superposition codebooks and partial decode-and-forward in low-SNR parallel relay networks,” IEEE Trans. Inf. Theory, vol. 59, no. 3, pp. 1704-1723, Mar. 2013.
- [3] A. Bletsas, A. Khisti, D. Reed, and A. Lippman, “A simple cooperative diversity method based on network path selection,” IEEE J. Sel. Areas Commun., vol. 24, no. 3, pp. 659-672, Mar. 2006.
- [4] N. Zlatanov, A. Ikhlef, T. Islam, and R. Schober, “Buffer-aided cooperative communications: opportunities and challenges,” IEEE Commun. Mag., vol. 52, no. 4, pp. 146-153, Apr. 2014.
- [5] N. Zlatanov, R. Schober, and P. Popovski, “Buffer-aided relaying with adaptive link selection,” IEEE J. Sel. Areas Commun., vol. 31, no. 8, pp. 1530-1542, Aug. 2013.
- [6] A. Ikhlef, D. S. Michalopoulos, and Robert Schober, “Max-max relay selection for relays with buffers,” IEEE Trans. Wireless Commun., vol. 11, no. 3, pp. 1124-1135, Mar. 2012.
- [7] A. Ikhlef, J. Kim, and R. Schober, “Mimicking full-duplex relaying using half-duplex relays with buffers,” IEEE Trans. Veh. Technol., vol. 61, no. 7, pp. 3025-3037, Sep. 2012.
- [8] I. Krikidis, T. Charalambous, and J. S. Thompson, “Buffer-aided relay selection for cooperative diversity systems without delay constraints,” IEEE Trans. Wireless Commun., vol. 11, no. 5, pp. 1957-1967, May. 2012.
- [9] T. Charalambous, N. Nomikos, I. Krikidis, D. Vouyioukas, and M. Johansson, “Modeling buffer-aided relay selection in networks with direct transmission capability.” IEEE Commun. Lett., vol. 19, no. 4, pp. 649-652, Apr. 2015.
- [10] W. Raza, N. Javaid, H. Nasir, N. Alrajeh, and N. Guizani, “Buffer-aided relay selection with equal-weight links in cooperative wireless networks.” IEEE Commun. Lett., vol. 22, no. 1, pp. 133-136, Jan. 2018.
- [11] M. Jain et al., “Practical, real-time, full duplexing wireless,” in Proc. ACM Mobile Comput. Netw. (MobiCom), Sep. 2011, pp. 301 C312.
- [12] D. Bharadia, E. McMilin, and S. Katti, “Full duplex radio,” in Proc. ACM SIGCOMM Conf. Appl. Technol., Archit., Protocols Comput. Commun., Hong Kong, Aug. 2013, p. 1.
- [13] B. Rankov and A. Wittneben, “Spectral efficient protocols for half-duplex fading relay channels,” IEEE J. Sel. Areas Commun., vol. 25, no. 2, pp. 379-389, Feb. 2007.
- [14] Y. Fan, C. Wang, J. Thompson, and H. V. Poor, “Recovering multiplexing loss through successive relaying using repetition coding,” IEEE Trans. Wireless Commun., vol. 6, no. 12, pp. 4484-4493, Dec. 2007.
- [15] D. S. Michalopoulos and G. K. Karagiannidis, “Bypassing orthogonal relaying transmissions via spatial signal separation,” IEEE Trans. Commun., vol.58, no. 10, pp. 3028-3038, Oct. 2010.
- [16] D. Qiao, “Fixed versus selective scheduling for buffer-aided diamond relay systems under statistical delay constraints,” IEEE Trans. on Commun., vol. 65, no. 7, pp. 2838-2851, July 2017.
- [17] S. Wang, M. Xia, K. Huang, and Y. Wu, “Wirelessly powered two-way communication with nonlinear energy harvesting model: rate regions under fixed and mobile relay,” IEEE Trans. Wireless Commun., vol. 16, no. 12, pp. 8190-8204, Oct. 2017.
- [18] C. B. Chae, T. Tang, R.W.Heath, Jr., and S.Cho, “MIMO relaying with linear processing for multiuser transmission in fixed relay networks,” IEEE Trans. Signal Process., vol. 56, no. 2, pp. 727-738, Feb. 2008.
- [19] B. Xia, Y. Fan, J. Thompson, H. Vincent Poor, “Buffering in a three-node relay network,” IEEE Trans. on Wireless Commun., vol. 7, no. 11, pp. 4492-4496, Nov. 2008.
- [20] J. Hu and N. O. Beaulieu, “Accurate simple closed-form approximations to rayleigh sum distributions and densities,” IEEE Commun. Lett., vol. 9, no. 2, pp. 109-111, Feb. 2005.
- [21] M. Schwartz, W. R. Bennett, and S. Stein, Communication Systems and Techniques. New York: McGraw-Hill, 1966.
- [22] I. S. Gradshteyn and I. M. Ryzhik, Tables of Integrals, Series, Products., 6th ed. San Diego, CA, USA: Academic, 2004.
Comments
There are no comments yet.