A modified GADIA-based upper-bound to the capacity of Gaussian general N-relay networks

In this paper, we present a general Gaussian N-relay network by allowing relays to communicate to each other and allowing a direct channel between source and destination as compared to the standard diamond network in Nazaroğlu et al. (IEEE Trans Inf Theory 60:6329–6341, 2014) at the cost of extra channel uses. Our main focus is to examine the min-cut bound capacities of the relay network. Very recently, the results in Uykan (IEEE Trans Neural Netw Learn Syst 31:3294–3304, 2020) imply that the GADIA in Babadi and Tarokh (IEEE Trans Inf Theory 56:6228–6252, 2010), a pioneering algorithm in the interference avoidance literature, actually performs max-cut of a given power-domain (nonnegative) link gain matrix in the 2-channel case. Using the results of the diamond network in Nazaroğlu et al. (2014) and the results in Uykan (2020), in this paper, we (i) turn the mutual information maximization problem in the Gaussian N-relay network into an upper bound minimization problem, (ii) propose a modified GADIA-based algorithm to find the min-cut capacity bound and (iii) present an upper and a lower bound to its min-cut capacity bound using the modified GADIA as applied to the defined “squared channel gain matrix/graph”. Some advantages of the proposed modified GADIA-based simple algorithm are as follows: (1) The Gaussian N-relay network can determine the relay clusters in a distributed fashion and (2) the presented upper bound gives an insight into whether allowing the relays to communicate to each other pays off the extra channel uses or not as far as the min-cut capacity bound is concerned. The simulation results confirm the findings. Furthermore, the min-cut upper bound found by the proposed modified-GADIA is verified by the cut-set bounds found by the spectral clustering based solutions as well.


Introduction and motivation
Cover and El Gamal stated, in their pioneering paper in 1979, that the full understanding of the relay channel would yield the capacity of the single sender single receiver general relay network (in Fig. 7 in [3]). They anticipated that this unknown capacity would be an information theoretic generalization of the well-known max-flow mincut theorem. However, as of 2021, i.e., after 42 years, we are very far from this ''foreseen'' goal: The capacity of the relay channel, even the simplest Gaussian relay network with a single source, single destination and a relay, is still unknown [4], and the interference channel's capacity region-even without a relay-is still an open problem [5]. In short, except for the simplest networks like Gaussian SIMO and MISO channels, the capacity region of most Gaussian networks is still unknown [4,5].
Speaking strictly, the only available upper bound on the capacity of the Gaussian relay channel is the cut-set bound developed by Cover and El Gamal in 1979 [3]. The cut-set bound has been consistently used as a benchmark for performance of various relay networks (see e.g. [5][6][7][8][9][10][11][12][13][14][15][16][17]) since 1970s. In order to turn the challenging Gaussian networks capacity problems into mathematically tractable frameworks, various simplifications have been

Main contributions of this paper
Our main contributions in this paper are as follows: Using the results of the diamond network in [24] and the recent results in [1], we (i) present a Gaussian N-relay network by allowing relays to communicate to each other and allowing a direct channel between source and destination. The standard N-Relay diamond network [24] is a special case of the presented N-Relay general network. (ii) propose a modified GADIA-based algorithm to find the min-cut capacity bound of the Gaussian Nrelay network. The proposed modified GADIAbased simple algorithm enables the N-relay network to determine the relay clusters in a distributed manner. (iii) present an upper and a lower bound to its min-cut capacity using the modified basic GADIA algorithm. The proposed bounds are relatively tight to the min-cut capacity bound. (iv) show that the modified GADIA-based capacity upper bounds give an insight into whether allowing the relays to communicate to each other pays off the extra channel uses or not.
The manuscript is arranged as follows: Related work in [24] and the basic GADIA [2] is summarized in Sect. 2. We present our main results, i.e., the upper bound and the modified-GADIA, in Sect. 3. Simulation results are shown in Sect. 4, followed by the conclusions in Sect. 5.

Related work
The traditional Gaussian N-Relay diamond network [24] is shown in Fig. 1. The received signals are obtained in terms of the transmitted signal and the channel gains as follows: where h i;s represents the complex coefficient from the source to the relay node i; and h di denotes the complex channel gain from the node i to the destination node d. Z i t ½ ;i ¼ 1; Á Á Á ; N, and Z t ½ are independent and identically distributed circularly symmetric Gaussian random variables of variance r 2 . Without loss of generality and for the sake of brevity, we assume that the transmit powers of all nodes are the same and equal to P, and SNR ¼ P=r 2 [24].
Capacity of the Gaussian N-Relay diamond network in Fig. 1 is investigated in [24] and [25]. A cut divides the network into two sets s; K f gand f K; dg where s represents source, d is destination, set K includes the indices of the relays in the first set, and set K includes the indices of the other relays which are in the second set. For any cut, the maximization of the mutual information can be upper bounded by the capacities of the SIMO (single input multiple output) channel between source and relays in set K and MISO (multiple input single output) channel between relays in K and destination d [24]. Therefore From [24], Eq. (9) on p.6333, we write the upper bound for the network in Fig. 1.
Naturally the simplest case is 1-relay network (i.e. N = 1). Obviously, this 1-relay scenario has two possible meaningful cuts: These two cuts include some well-known results like the upper-bound in [16], Eq. (18), and the achievable rate R DF in [8], Appendix A, page 1897, and the upper bound in [13], Eq. (11), page 2022 (taking zero correlation between the source and relay outputs X 1 and X 2 , i.e. taking b ¼ 0 [13]), among others. Considering the relays-receive period aD and relays-transmit period 1 À a ð ÞD in Time Division mode in [13], two possible cuts are given in [13], Eqs. (10) and (11), page 2022, as follows both of which are special cases of (3). A very similar result in Frequency Division mode is presented in [8].
On the other hand, the GADIA [2] has been one of the pioneering algorithms in the wireless interference avoidance literature. In this paper, in Sect. 3, we will propose a modified simple GADIA for determining the min-cut capacity bound for the general relay network. Therefore, for the readers' convenience, in what follows we first summarize how the basic GADIA [2] works for 2-channel case.

Basic GADIA [2] with 2-channel case
Definition Total Co-channel (Intra-Set) Interference for 2-Channel Case: Putting the relays into sets K t and K t at time t, we define the Total Co-channel (Intra-Set) Interference I tot K;K as follows: where h ii ¼ 0: Let's assume there are N transmitters to be allocated to 2 channels only (and N [ 2). The deterministic basic GADIA for 2-set case is given by Table 1. Representing the co-channel interference of channel 1 and channel 2 for node n at time t as I n K t ð Þ and I n K t ð Þ, respectively, where n = 1,2, …, N, the deterministic basic GADIA [2] assigns the node n to the following channel where channel index x n t þ 1 ð Þ2 K; K È É . From the analysis in [2], each time a node changes its channel by Eq. (7) the total co-channel interference is further decreased: For the details of the proof, see [2]. The basic GADIA performs in a distributed fashion in such a way that each node is allocated only using its interference measurements. How the basic GADIA [2] works for relay n at arbitrary step number t in a 2-channel case is illustrated in Fig. 3. It is very recently shown in [1] (Proposition 5 and Corollary 4) that the basic GADIA [2] actually performs the max-cut of the corresponding graph for the 2-channel case. For further details, see [1]. An extension to the complex graph case has very recently been presented in [33].

Network model
Our model is based on the model in [24]. The main difference is as follows: In the traditional Gaussian N-Relay diamond network in [24] (see Fig. 1) the source only transmits to the relays and the relays transmit only to the destination (and there is no direct channel between the source and destination). However, in our network model, relays can also transmit to each other if/when needed and direct channel between the source and destination also exists as seen in Fig. 2. Our motivation for this extension is twofold: (i) to unleash the potential of the unused channels in full-duplex relay networks, and (ii) to generalize the network in [24]. Using the model and notation in [24] for the general relay network in Fig. 2, the received signals are obtained in terms of the transmitted signal and the channel gains as follows: where T i represents the set of indices of the transmitting relays when the relay node i is the receiver, and T i s; 1; 2; Á Á Á ; N f g , and h is represents the complex channel gain from the source to the relay node i; and h di denotes the complex channel gain from the node i to the destination node d. Z i t ½ ;i ¼ 1; Á Á Á ; N, and Z t ½ are independent and identically distributed circularly symmetric Gaussian random variables of variance r 2 . Without loss of generality and for the sake of brevity, we assume that the transmit powers of all nodes are the same and equal to P, and we define SNR ¼ P=r 2 as in [24]. We examine the maximum reliable communication rate C in bits/channel use that can be achieved between the source node and the destination node in a generalized Gaussian N-relay network. First we define ''squared channel gain matrix/graph'' for the N-relay general network.
Definition For the standard N-relay diamond network (which does not allow relays to communicate to each other), the following (N ? 2) 9 (N ? 2) dimensional (partially full) matrix is called ''diamond squared channel gain matrix''.
Most of the entries in matrix A d in (11) are zero because relays cannot transmit to each other in the traditional Nrelay diamond network [24]. Step (1): Initially, at time t = 0, any relay is randomly assigned to one of the sets K 0 and K 0 Step (2): For relay n, measure the channel interferences I n K t ð Þ and I n K t ð Þ and assign the relay to the following channel Step (3): Update K t and K t according to step 2. Increase time step number: t = t ? 1 Step (4): Continue steps (1) to (3) sequentially for each relay until there is no channel (set) update any more, reaching a local minima Fig. 2 Gaussian N-relay general network (allows relays to communicate to each other) Definition The following (N ? 2) 9 (N ? 2) dimensional matrix is called ''squared channel gain matrix'' for N-Relay general network: i.e., Definition Cut of Interference matrix is defined as follows

Modified GADIA
A very recent paper [1] shows that the deterministic basic GADIA [2] with the interference matrix A g in (12) performs max-cut of the corresponding graph. However, we need min-cut for determining the relay network's cut-set capacity bound. How can we modify the basic GADIA in [2] so that it performs min-cut instead of max-cut? In what follows, we present a modified and constrained simple GADIA to perform the min-cut of the interference matrix A g in (12).
In the proposed modified GADIA (14), we have the negative sign to turn the max-cut problem into the min-cut problem. If we do not introduce any constraints, then this change would eventually give us the trivial solution where the cut would finally vanish, i.e., all relays would be assigned to the same set, which is practically meaningless. To avoid this trivial solution, we need to introduce the constraint that N K 6 ¼ 0 and N K 6 ¼ 0 and N K and N K are close to each other, i.e., the number of relays in set K and the number of relays in set K are close to each other. Fig. 2 with the channel gains in (12), the proposed modified algorithm in Table 2 minimizes the cut J K;K t ð Þ in (13).

Proposition 1 For a given general relay network in
Proof From (6), (12) and (13), where A g 1 represents the 1-norm of matrix A g , which is constant. Now let's take an arbitrary relay n in set K. The total intra-set interference in K and K, i.e., I tot K , and I tot K , respectively, at an arbitrary time t is equal to Fig. 3. If relay n is allocated from set K to K, then (6), (14), (16) and (17), the proposed modified GADIA gives Similarly, it is straightforward to show that if a relay in K is assigned to K by the proposed algorithm (14), then the total interference is strictly further increased, i.e., is finite, we conclude that the proposed modified GADIA in Table 2 minimizes the cut J K;K t ð Þ in (13), which completes the proof. h

Comparison of the basic GADIA [2] and the Modified GADIA
It is recently shown in [1] that the basic GADIA [2] in (9) performs max-cut for the positive interference matrix A g in (12). So, the GADIA [2] yields the minimum total interference (min ofI tot K;K t ð Þ in (6)) in the relay network. However, the proposed modified and constraint GADIA does exactly the opposite: The modified GADIA in Table 2 aims at temporarily maximizing the total interference in the relay network for a short time duration just in order to determine the sets K and K which are needed to find the min-cut capacity bound. In summary, the proposed modified GADIA fully loads the relay network by maximizing the total network interference (I tot K;K t ð Þ in (6)) so that the cut-set bound of the relay network is ''discovered'' in a distributed fashion.

Low SNR case
Proposition 2 In the low-SNR regime, the proposed simple modified-GADIA algorithm in Table 2 for the ''squared channel gain matrix'' in (12) yields an upper bound to the mutual information between the source and destination in the Gaussian N-relay network in Fig. 2.
Proof Applying the max-flow min-cut theorem to the Gaussian general N-relay network in Fig. 2, and following the steps in [24], Appendix A, page 6338, we obtain Unlike the diamond network in [24], allowing the relays to transmit to each other results in extra N K SIMO channels as seen from Fig. 2. We allocate these inter-relay SIMO channels in N K orthogonal sub timeslots/frequencies so that during each sub timeslot/frequency we realize one interference-free SIMO channel. This results in N K extra channel uses as compared to that in [24]. From Fig. 2.
From (20) and (21), we have where L is the total number of channel uses. Allowing inter-relay N K SIMO channels yields extra N K channel uses, and therefore L ¼ N K þ 2, where 2 represents the channel use of SIMO from source to K and the channel use of MISO from K to destination. Considering the low SNR regime, i.e. log 1 þ x ð Þ%x in Eq. (11), we obtain Examining the upper bound in (23), we see that the capacity upper bound (23) is equal to the min-cut of the graph represented by the matrix A g in (12), i.e., Step (1): Initially, at time t = 0, any relay is randomly assigned to one of the sets K 0 and K 0 Step (2): For relay n, determine (i.e. measure the set (channel) interferences I n K t ð Þ and I n K t ð Þ and assign the relay to the following set under the constraint that N K and N K are close to each other. In (14), index x n t þ 1 ð Þ2 1; 2 f g. If x n t þ 1 ð Þ¼ 1, then it means n 2 K; otherwise, if x n t þ 1 ð Þ¼2, it means n 2 K at time t þ 1 ð Þ Step (3): Update K t and K t according to step 2. Increase time step number: t = t ? 1 Step (4): Continue steps (1) to (3) sequentially for each relay until there is no set update any more, reaching a local minima Fig. 3 An illustration of the basic GADIA [2] for relay n at arbitrary step number t in a 2-set case From Proposition 1 above, Eqs. (19) and (24), we conclude that the proposed simple modified-GADIA algorithm in Table 2 for the ''squared channel gain matrix'' in (12) yields an upper bound to the mutual information between the source and destination in the Gaussian N-relay general network in Fig. 2, which completes the proof. h In summary, the min-cut capacity bound in (3) for the standard diamond relay network is obtained by two channel uses (timeslots/frequencies), and thus On the other hand, the min-cut capacity upper bound in (19) for the proposed general relay network is Comparing (25) and (26), there is a trade-off between the increased channel uses (because L ! 3) and the min-cut capacity bound. Do the extra channel uses pay off or not?
The answer is that it depends on the inter-relay channel gains as follows (for the low SNR case). From (25), (26) and (24), we have Using 1 2 ¼ 1 L þ LÀ2 2L and the SIMO channels among the relays (from each relay in set K to all relays in set K) in the right side of (27), we obtain the following result: If or equivalently, if then the min-cut capacity bound is increased. As long as the min-cut capacity bound is concerned, this shows that allowing the relays to communicate to each other pays off the extra channel uses if the condition in (29) is met. The left side of (29) is a portion of the standard diamond relay network's min-cut capacity bound and the right side of (29) is due to the inter-relay channels which are not used in the diamond network. As an example, for the Gaussian generalized 3-relay network in Fig. 5 then the min-cut capacity bound is further increased in the low SNR case.

High SNR case
Proposition 3 In the high-SNR regime, the mutual information between the source and destination in the Gaussian general N-relay network in Fig. 2 admits an upper bound obtained by the proposed modified-GADIA algorithm in Table 2 for the ''squared channel gain matrix'' in (12).
Proof We observe the following tight upper bound to the sum of two log's.
for any x i ; x j ! 2. In (33) the maximum difference, which is 1, is obtained if and only if x i ¼ x j . 1 The presented bound in (32)-(33) plays a critical role in our derivations below for the high SNR case because (1) the proposed bound is tight and (2) it allows us to replace the sum of two log's by the log of two sums. In order to give an insight into how tight the bound in (32) is, without loss of generality and the for the sake of brevity, we present an illustrative example with an arbitrary argument x 1 ¼ 2 9 ¼ 512 in Fig. 4. The argument of the other log function varies in the range 2 x 2 10000. Figure 4 confirms that 1 In order to upper bound the sum of log's by the log of sums as in (32), we may use some other inequalities like log x ð Þ xÀ0:52 ffiffi x p , x i ; x j ! 2. However, the reason why we chose the one in (32) is because it is a tight upper bound for the entire regime. the proposed bound in (32)-(33) is indeed tight for any arguments x 1 and x 2 because in (32)- (33) what matters is the difference between the arguments x 1 and x 2 and not the absolute values of x 1 and x 2 . The plots of Fig. 4(a, b) are the same, where argument x 2 is in linear scale and log scale in Fig. 4(a, b), respectively, for the sake of clarity. This is because the term log min x i ; x j È É À Á strictly decreases and vanishes as the difference between the arguments x 1 and x 2 increases.
Let's define the following terms: for SIMOs and for MISO G d; s;K f g ¼ P Using (26), (32), (34) and (35), we are able to upper bound the sum of log's in (22) by the log of sums as follows: where K has (N K þ 1) log terms, which are obtained by applying Eq. (32) N K þ 1 ð Þ times when we upper bound the sum of N K þ 2 ð Þlog's by log of N K þ 2 ð Þsums. From (34), (35) and (36), we obtain From Proposition 1 above, (19) and (37), we conclude that the mutual information between the source and destination in the Gaussian general N-relay network in Fig. 2 admits an upper bound obtained by the proposed modified-GADIA algorithm in Table 2 for the ''squared channel gain matrix'' in (12), which completes the proof. h In order to elaborate more about the constant K in (19), we give the following example: If N = 5, K ¼ 1; 3 f g, and K ¼ 2; 4; 5 f g, then K in (36) is equal to the following:  In what follows, we ask the same question as before: Does allowing the relays to communicate to each other pay off the extra channel uses or not for high SNR case? The answer is that it depends on the channel gains as shown below: (20)- (22) and using (34) and (35) yields the following result: If or equivalently, if then the min-cut capacity bound is increased. This shows that as long as the min-cut capacity bound is concerned, allowing the relays to communicate to each other pays off the extra channel uses for high SNR regime if Eq. (40) holds.

Lower bound
A lower bound is straightforwardly obtained by the best link in each transmission of the relay min-cut capacity bound. So, for the low SNR regime, replacing the sum operation by a max operation in the min-cut capacity bound in (23) yields the lower bound in (41). In other words, (41) is a lower bound in the low SNR regime simply because it is a subset of the min-cut capacity bound itself.
Similarly, for the high SNR regime, replacing the sum operation by a max operation in the min-cut capacity bound in (37) yields the lower bound in (42).

Simulation results
The proposed method can be applied to any Gaussian Nrelay network where the number of relays N is arbitrary. In what follows, without loss of generality and for the sake of brevity, we examine two networks with 3 relays (in Fig. 5) and 20 relays (in Fig. 12) in Example 1 and 2, respectively. Furthermore, without loss of generality, in both Example 1 and 2 below, we model the channel gains as in e.g. [36,37] where the attenuation factor is 3, the log-normally distributed slow fading is generated according to the model in [36], and the lognormal variance is 6 dB. The transmit powers vary from 1 mW to 1 W. A unit variance Gaussian noise is added to the received signal at each node. The min-cut capacity bound of the proposed method is verified by the cut-set bounds found by the spectral clustering and using (37) (which was obtained by Eqs. (32)- (33)). For the spectral clustering formulation as applied to the channel allocation problem, see e.g. [38,39,43]. Let's define a discrete-value vector . . .N: [ [40][41][42], for details) minCut C 1 ;::: Relaxing the optimization in (43) such that x 2 R NÂ1 (instead of being integers), it's well-known that the optimum solution which maximizes h T Lh with unit norm constraint is equal to where L is the Laplacian matrix and e min is its 2nd minimum eigenvector because the minimum eigenvector gives a trivial solution which is not practical (for details and for further information and references see e.g., [40][41][42]).

Example 1 A 3-Relay network is represented by the following squared channel gain matrix A g as follows
A 3ÀRelay In order to give an insight into how min-cut capacity bounds change with respect to relay locations, we examine three cases in Figs. 6a, 7a and 8a, which represents the scenario where the relay locations are relatively closer to each other in the middle, the scenario where relay locations are slightly closer to the source and the scenario where relay locations are slightly closer to the destination, respectively. The proposed modified-GADIA (in Table 2) yields source s and relay 3 in one set (shown as yellow diamonds in Fig. 5) and relays 1 and 2 and destination in the other set (shown as red circles in Fig. 5). This means . So, we have 3 channel uses (i.e.,L ¼ 3) because there are two SIMO channels from (34) and one MISO channel in Fig. 5.
For the relay locations shown in Fig. 6a, the total interference in the relay network (i.e., I tot K;K t ð Þ in (6)), the cut of interference matrix (i.e., J K;K t ð Þ in (13)), and the min-cut capacity bounds of the modified-GADIA solution are shown in Fig. 6b-d, respectively, in the high SNR regime. The results of the other two cases (called case 2 and 3) with different relay locations are shown in Figs. 7 and 8. In order to examine if allowing the relays to communicate to each other pays off the extra channel uses or not, we define a relative increase in the min-cut capacity bound with respect to that of the diamond relay network: These gains are shown in Fig. 9 for cases 1, 2, and 3. As seen from Fig. 9, the percentage gains for cases 1, 2 and 3 are positive, varying between ? 4 and ? 18% depending on the transmit powers (SNRs) and relay locations. In low-SNR regime, for the relay locations shown in Figs. 6a, 7a and 8a, the cut of interference matrix (i.e., J K;K t ð Þ in (13)), and the min-cut capacity bounds of the modified-GADIA solution are shown in Fig. 10a-c respectively. The relative min-cut capacity gains are shown in Fig. 11 for cases 1, 2, and 3 for low SNR. As seen from Fig. 11, the percentage gains for the cases 1, 2 and 3 are positive, varying between ? 13% and ? 160% depending on the transmit powers (SNRs) and relay locations. Figures 6b, 7b and 8b confirm that the proposed modified GADIA fully loads the relay network by strictly increasing the total network interference so that the min-cut of the relay network is found in a distributed fashion. Figures 6c,  7c, 8c and 10a confirm that the cut of the interference matrix is minimized by the proposed modified simple GADIA in Table 2. In short, all the results (min-cut capacities, modified-GADIA based min-cut capacity bounds, modified simple GADIA evolution, total interference evolution in the relay network, etc.) in Figs. 6, 7, 8, 10 and 11 confirm the findings in Sect. 3.

Example 2
In this example, we increase the number of relays to 20 as seen in Fig. 12(a). For the relay locations shown in Fig. 12a, the total interference in the relay network (i.e., I tot K;K t ð Þ in (6)), the cut of interference matrix (i.e., J K;K t ð Þ in (13)), and the min-cut capacity bounds of the modified-GADIA solution are shown in Fig. 12b-d, respectively, in the high SNR regime. The results for low SNR case are presented in Fig. 13. All the results (min-cut capacities, modified-GADIA based min-cut capacity bounds, modified simple GADIA evolution, total interference evolution in the relay network, etc.) in Figs. 12 and 13 confirm that the upper bound in (37) (which is obtained by using Eqs. (32)- (33)) is tight to the min-cut capacity bound and confirm the findings in Sect. 3. Furthermore, we verify the modified simple GADIA based solution with the spectral clustering based solution. The cut bounds obtained by the spectral clustering together with Eq. (37) are Fig. 10 In the low SNR regime, the cut evolution of the relay network by the modified GADIA for the case when transmit power is 1 mW, and the min-cut capacity bounds and the upper bound of the relay network as transmit power increases from 0.1 to 1 mW: a case 1, b case 2 and c case3 presented in Fig. 14. Comparing Fig. 12d and Fig. 14(b), the capacity bounds found by the proposed method are comparable to those of the spectral clustering based capacity bounds obtained by Eq. (37), which verifies the proposed solution.

Conclusions
In this paper, we present a Gaussian N-relay general network by allowing relays to communicate to each other and allowing a direct channel between source and destination in the standard diamond network in [24] at the cost of extra channel uses. The standard N-Relay diamond network [24] is a special case of the presented general N-Relay network. Our investigations yield various novel results some of which are as follows: We (i) propose a modified simple GADIA-based algorithm to find the min-cut capacity upper bound of the Gaussian N-relay network. The proposed modified GADIA-based simple algorithm enables the N-relay general network to determine the relay clusters in a distributed manner. (ii) present a capacity upper bound and a lower bound to its min-cut capacity bound using the modified simple GADIA algorithm. The proposed upper bound is relatively tight to the min-cut capacity bound. These results also highlight the importance of unleashing the interference avoidance theory for addressing the challenging wireless relay networks capacity problems.
In this paper we focus only on the min-cut capacity upper bounds of the relay networks, and thus we do not consider any particular relay transmission schemes (such as amplitude-and-forward relaying, compute-and-forward, etc.). To examine and design various relay transmission schemes for the Gaussian general N-relay networks would be an interesting future research subject.
Funding Open access funding provided by Aalto University.
Open Access This article is licensed under a Creative Commons Attribution 4.0 International License, which permits use, sharing, adaptation, distribution and reproduction in any medium or format, as long as you give appropriate credit to the original author(s) and the source, provide a link to the Creative Commons licence, and indicate if changes were made. The images or other third party material in this article are included in the article's Creative Commons licence, unless indicated otherwise in a credit line to the material. If material is not included in the article's Creative Commons licence and your intended use is not permitted by statutory regulation or exceeds the permitted use, you will need to obtain permission directly from the copyright holder. To view a copy of this licence, visit http://creativecommons. org/licenses/by/4.0/.
Data availability The datasets generated during and/or analysed during the current study are available from the corresponding author on reasonable request. Fig. 13 a Case 5: In the low SNR regime, a the cut evolution of the relay network by the modified GADIA for the case when transmit power is 10 mW, and b the min-cut capacity bounds and the upper bound of the relay network as transmit power increases from 1 to 10 mW