Analysis of quantization effects on the performance of cooperative MIMO techniques in wireless networks

The most successful achievable schemes for ad hoc wireless networks are those based on establishing cooperative multiple-input and multiple-output links. In this article, we analyze one of the important design parameters of such schemes, namely the number of quantization bits. Due to the digital architecture of these schemes, the received signal at nodes should become quantized before further processing. The scheme’s aggregate throughput highly depends on the resolution of the quantization process. We demonstrate that there is an optimum number of quantization bits which maximizes the network throughput. We show that the optimum number of quantization bits scales as β log2(SNR), for any strictly positive β independent of SNR, for the high SNR regime. Furthermore, we derive the optimum scaling of network throughput in such a regime. It is concluded that a good management of the number of quantization bits as a design parameter has a significant impact on the network performance.


Introduction
Many applications in the wireless communication technology involve ad hoc deployment of a large number of wireless nodes. Due to the broadcast and superposition nature of the wireless medium, we face the interference phenomenon in such networks. The throughput of the network is the end-to-end rate that all the sourcedestination nodes can communicate with, in the presence of interference. In order to analyze the performance of such ad hoc wireless network architectures, one can think of the wireless network as a graph. In this graph, the vertices are the wireless nodes, and the edges are wireless links. As a result, by using graph-theoretic tools, the information flow properties of the network can be analyzed [1][2][3].
However, as graph models cannot capture all properties of wireless networks, the graph-theory-based approach has serious limitations. One of such limitations is that a graph cannot properly model broadcast and superposition nature of wireless channels. Therefore, other works Zamudio, Spain Full list of author information is available at the end of the article address the problem from a semi-information-theoretic perspective. Based on this approach, the first successful attempt at deriving the scaling properties of the network capacity was presented by Gupta and Kumar [4]. Their result shows aggregate throughput scaling of order ( √ n) for arbitrary networks of n nodes. The article by Franceschetti et al. [5] extends the above result to random networks. A number of other articles, such as [6,7], also verified the ( √ n) aggregate throughput limitation, which results in (1/ √ n) throughput per node. These results indicate that the throughput per node does not scale with the number of nodes, which seems unsatisfying. However, almost all the aforementioned articles are based on multihop routing of information. The main reason for the (1/ √ n) limitation is that each block of information should pass through a large number of hops before reaching its destination.
The network performance, however, is not always so disappointing if we do not bound ourselves to the multihop transmission technology. Based on this fact, the work of Aeron and Saligrama [8] andÖzgür et al. [9] proposes schemes employing cooperative multiple-input and multiple-output (MIMO) techniques as their main strategy. In such schemes each source node cooperates with the nearby nodes to form a virtual MIMO transmitter. In addition, local nodes at the receive side form a virtual MIMO receiver. Upon transmission of the MIMO signal, the received signals at the receive nodes should become quantized. After quantization and further cooperation, the data are sent to and decoded at the destination node.
The scheme proposed in [9] achieves aggregate throughput of order n, which is superior comparing with the multihop-based results. This superior performance is due to the cooperative nature of the scheme. Consequently, it has sparked a new wave of interest in the researchers to investigate the role of cooperative MIMO schemes in ad hoc networks (e.g., see [10][11][12]).
However, in order to make such schemes practical and usable in real-life protocols, there is still a large number of issues to be addressed. For example, there is the question whether the scaling-based analysis results (as n → ∞) in [8,9] are reliable for finite size networks. In other words, how large should n be for the results to be valid? Similarly, many design parameters in [9] are still not addressed in the literature. While optimizing these parameters has a great impact on proper operation of the network, it is not clear what the optimum values for such design parameters are as functions of network characteristics.
In this article a , we focus on one of the key design parameters of such schemes. As mentioned earlier, the nodes who act as the virtual MIMO receiver should quantize the received signal before sending these quantized data to the destination node for decoding. We focus on this quantization process, as this process is critical for the cooperative MIMO operation. The main questions we address in this article are: Does optimization of the number of quantization bits have a great effect on network throughput? How many number of bits each receive node should use for the quantization process? At high signalto-noise ratios (SNR), what is the optimum choice for the number of quantization bits? How does the network throughput behave in high SNR regime?
In order to address the above issues, we analyze an inherent trade-off in determining the "proper" number of quantization bits. By increasing the number of quantization bits, the capacity of the virtual MIMO link is increased. However, the amount of data that the receive nodes should send to the destination node is increased as well. These two phenomena have competing effects on the network throughput. For analyzing this trade-off, we formulate the problem and find the optimum number of quantization bits maximizing the network throughput.
In order to clarify contributions of this article compared with [9,10], it should be noted that our focus in this article is on the optimization of the quantization process, rather than on proposing a new network communication scheme. In fact, the issue of optimization of number of quantization bits is not addressed in [9,10] while as will be shown, intelligent management of this issue results in significant throughput enhancement.
The structure of the article is as follows. In "Network model" section, we state our network model. In "Managing the number of quantization bits" section, we investigate the role of quantization bits and the resulting inherent trade-off. "Numerical illustrations" section contains helpful numerical illustrations. Finally, the article ends with conclusion.
At last, we review the notations used throughout the article. We use Knuth's asymptotic notation as follows [13]: f (n) = O(g(n)) if there exists positive constants c 0 and n 0 such that for all n ≥ n 0 we have 0 ) and f (n) = (g(n)). Also, matrices and vectors are indicated in boldface, (·) H is the Hermitian operator, the expression

Network model
In this section, we describe the network model used in this article. First, general assumptions about the network and the wireless channel model are described. Then, the model used for establishing cooperative MIMO links in the network is described.

General assumptions
Consider a wireless network consisting of n nodes capable of both transmitting and receiving signals. The nodes are uniformly distributed in area A in a random manner. Each node intends to transmit information to exactly one other node, and is also the receiver of information from one other node, through a uniform random mapping. If the set of transmitting nodes at each time slot is called S, then the signal received by the ith node at time slot m is given by where X k [ m] is the signal transmitted by node k at the time slot m, and Z i [ m] denotes noise at the receiver. The wireless channel between nodes i and k at time slot m is modeled as where r ik is the distance between nodes i and k, α is the path loss exponent, θ ik is the random phase change between nodes i and k which is uniformly distributed in the range [ 0, 2π), and G denotes antenna gain. This channel model has broadly been used in the literature, e.g., see [9,10]. Network throughput is defined as the rate at which all the source nodes send their information to destination http://jwcn.eurasipjournals.com/content/2012/1/290 nodes and depends on the spatio-temporal transmission strategies used in the network as discussed later.

Establishing cooperative MIMO links
The scheme considered in this article is based on cooperative MIMO transmission introduced in [9] and consists of the following three phases. In the first phase, each node shares its data between nearby nodes, such that these nodes can help in transmitting the data. In the second phase, those nearby nodes form virtual MIMO transmitters and transmit MIMO signals toward their destinations. In the last phase, upon reception of the signals transmitted in the second phase, the nearby nodes at the destination side form a virtual MIMO receiver and cooperate with each other to decode the original data at the destination node. As an example of such strategy, we continue our discussion based on the framework developed in [10]. In the network, each node is a source of data for exactly one other node, and also, it is destination of data for exactly one other node. Now, we describe the transmission procedure through which all source nodes transmit their data to the corresponding destinations in three phases. According to [10], the three transmission phases can be detailed as follows: • Phase 1: Partition the network area into equal clusters such that each cluster contains M nodes. Suppose that every source node has ML bits to transmit to its destination. Let us focus on one source node s. Node s distributes its ML bits among other nodes inside its cluster, L bits for each. In order to do this, node s maps a data block of length L to a Gaussian codeword of length C 0 , and transmits this codeword to another node inside its cluster. This action takes C 0 time slots. Then, s repeats the same action for all other nodes in the cluster in a round robin manner to distribute all the ML bits. Accordingly, such process takes (M − 1)C 0 time slots. Since all the nodes in this cluster are source for some other nodes in the network, each node inside the cluster should repeat the whole procedure described above, as s did, one-by-one. This results in M(M − 1)C 0 time slots needed for this specific cluster. This intra-cluster activity is done simultaneously in one-fourth of the clusters by a 4-TDMA spatial reuse scheme. (The k -TDMA spatial reuse strategy was first proposed in [4] and is a widely known concept in the literature. For details refer to [4,9,10].) Thus, the total time needed for all the source nodes in the network (which are, in fact, all the nodes in the network) to distribute their data inside their clusters is where the rate of each transmission-i.e., the number of bits per slot-is R 0 L/C 0 . In this phase, the transmission from node i to node j is with transmission power Pr α ij . It should be noted that by increasing transmit power P, R 0 cannot be made arbitrarily large, and it reaches a saturation value due to inter-cluster interference.
• Phase 2: Consider the source node s. Its destination is located in some other cluster called the receive cluster. After completing phase 1, ML bits of s is distributed among M nodes inside its cluster. Thus, each node in the cluster has L bits of s. In this phase, every node maps L bits of s to a C 1 -long Gaussian codeword. Then, all nodes transmit their codewords simultaneously similar to a virtual MIMO transmitter. Each node transmits with power P r α SD M , where r SD is the distance between the centers of the transmit cluster and the receive cluster. We denote the transmission rate of each node by R 1 L C 1 . Each source node in the network needs a MIMO transmission shot as explained above, in order to deliver its data. Since we have a total of n source nodes in the network, an order of n MIMO shots, and accordingly, n time slots is required for this phase. Thus, the total number of time slots for this phase is b • Phase 3: Consider a given receive cluster with M nodes. Each receive cluster, in phase 2, has acted as a virtual MIMO receiver. However, since the received signals at each virtual MIMO receiver (each cluster) are not collocated (and are distributed among the nodes in the cluster), we cannot decode the message. Thus, in phase 3 we should gather these distributed signals at the destination, which will then decode the original message. Consider a specific destination node named d which we assume to be the destination of source node s. As described earlier, in the second phase the nodes in the cluster of s send the information belonging to s in C 1 time slots in a MIMO fashion. Thus, after the second phase, every node in the receive cluster has received C 1 real numbers. These real numbers are the MIMO observations received at the antenna of each node in the receive cluster. Since we have to gather all these analog signals at the destination nodes d for the decoding process, we first have to quantize the analog observations. Thus, every node quantizes each observation with Q bits. Therefore, each node in the receive cluster has QC 1 bits which should be passed to d. Consequently, every node passes QC 1 bits to d in a TDMA manner using codewords of length C 0 exactly as in phase 1, providing the total of http://jwcn.eurasipjournals.com/content/2012/1/290 (M − 1)C 0 codewords for destination d. Finally, from these (M − 1)C 0 codewords (along with the analog data already received at the second phase in d), node d decodes the whole ML bits of s. This procedure should be repeated for all destination nodes in receive cluster. Since, there are M destination nodes in the receive cluster, each one should get its (M − 1)QC 1 bits from other nodes, one-by-one. Considering the 4-TDMA spatial reuse strategy between clusters (as in the first phase), the total time slots needed for this phase is given by Consequently, the total time required for this scheme for large values of M is Since the total of nML bits is delivered, the effective throughput will be T = nML Accordingly, by optimizing M with respect to the achievable throughput T, as [10]: the optimum throughput will be It is useful to note that the receive power at each of the nodes is bounded in the third phase as [10] where The above framework is sufficient for our purposes in this article. However, an interested reader can find more detailed explanation of the scheme by referring to [10]. In the next section, we use this simple scheme to begin analyzing the quantization effects in the second and third phases described above.

Managing the number of quantization bits
The quantization process in the cooperative MIMO strategy is a critical operation before any further action for decoding. That is due to the fact that in order to pass the received information-carrying signal to the destination node (the decoder), these signals should first become quantized. These quantized signals constitute the information based on which the original data are recovered as will be discussed in this section.

Two stage cooperative MIMO network
Our goal is to study the effect of choosing a proper value for the number of quantization bits, on the performance of the network in terms of throughput. Thus, here we analyze a trade-off between the number of quantization bits, and the achieved throughput of the virtual MIMO channel. In fact, by decreasing Q, each node has to represent its received analog signal with more ambiguity. The distortion due to quantization, acts as an added noise and makes the MIMO decoding at the destination node more difficult. Consequently, the capacity of the virtual MIMO link is decreased. In other words, by decreasing the number of quantization bits, Q, R 1 in Equation (9) is decreased.
In addition, as our goal is to achieve a low traffic load in the third phase, we have to decrease the number of quantization bits. In other words, by decreasing Q, the denominator of (9) is decreased. These are two competing effects which shape the trade-off behavior inherent in the problem.
As it is clear from Equation (9), optimizing Q will result in improvement in the pre-constant value of the throughput. Thus, the best Q can be found by solving the following optimization problem: To this end, we need to understand how R 1 increases as Q is increased. R 1 is proportional to the MIMO capacity between the clusters in the second phase, i.e., where C MIMO is the capacity of the cooperative MIMO link. The second phase signal model results in [9] where X i is the transmitted signal vector by the nodes in the transmit cluster, and Y j is the received signal vector at the nodes in the receive cluster. Also, H ij is the channel matrix of the cooperative MIMO setup, and N j is the additive noise-plus-distortion vector added at the receive nodes. The noise-plus-distortion vector consists of two parts, namely the thermal noise (Z), and the quantization distortion (D) We consider the thermal noise of receiving nodes to be independent from each other. The thermal noise at http://jwcn.eurasipjournals.com/content/2012/1/290 different nodes are assumed to have power σ 2 . The quantization distortion of the receive node i depends on Q, and based on the rate-distortion theory [14] is equal to where P rec i is the power of the received signal at the node i. The received power for node i is the sum of the transmitted signals' power, diminished by the path loss effect. Given the fact that the power of each transmit node in the second phase is P r α SD M , we will have that [9] By considering the quantization distortion as noise, the channel model represented in (14) will be a MIMO channel with unequal noise power at the receive antennas. Obviously, this is not the best strategy since the distortion vector contains information about the transmitted signal and is not useless noise. However, with this assumption, we can note that R 1 will be (The detailed derivation of (18) is presented in the Appendix.) where SNR is defined to be and the expectation is with respect to the random channel phases. Also, we define the entries of the matrix F as (F) ik γ ik exp(jθ ik ), where γ ik ( r SD r ki ) α/2 . Also, from the geometry of the problem, we have that In addition, N is the noise-plus-distortion covariance matrix given by where the expectation is with respect to X and Z. Therefore, it is diagonal with diagonal entries It should be noted that due to the normalized values of distances in equation (22), the distance of the transmit and receive clusters is not important, and consequently the value of R 1 for all the cluster pairs is almost the same c . Now we are in a position to note how decreasing Q decreases R 1 . By decreasing Q, the diagonal elements of the noise-plus-distortion covariance matrix stated in (22) (i.e., ( N ) ii ) will be increased. This results in a decreased value for R 1 . By understanding these two competing effects, we have evaluated the trade-off mentioned above, which suggests that there is an optimum number of quantization bits. As will be shown later, proper management of this trade-off has a great effect on enhancing the network throughput.

Extension to hierarchical cooperation schemes
The scheme explained in "Establishing cooperative MIMO links" section is a simple form of a more general scheme named Hierarchical Cooperation [9]. Consider a typical transmit cluster as explained in the previous sections. In the first phase, each node inside the cluster should distribute different data between other nodes inside the cluster. One can note that the process in phase 1 is very similar to the original problem in a smaller scale (by the original problem we mean: n nodes randomly distributed each having data for another node in the network). That is because the process in phase 1 and the original problem both consist of uniform traffic demand between the nodes of an specific area. Thus, we can divide the phase 1 into three sub-phases similar to the above-mentioned approach. The same story is true for the phase 3. Therefore, we can divide the phase 3 into three sub-phases too. This concept is illustrated in Figure 1. The big rectangles in Figure 1 illustrate the three phases at the first level (top level) of the hierarchy. The first and third phases of the first level are divided again into another three phases which are shown by small rectangles. These small rectangles constitute the second level of the hierarchy. Consequent levels of hierarchy are built in the same manner up to h levels. The hierarchical cooperation with h stages has been analyzed in [9,10] in detail. By this approach, the network throughput is [10] As it is clear from Equation (23), optimizing Q will result in improvement in the pre-constant value of the throughput. Consequently, the optimization problem becomes arg max This optimization problem reduces to (12) by putting h = 2.
In [11,12], it has been observed that phases 1 and 3 can be manipulated in a more effective way in terms of delay. http://jwcn.eurasipjournals.com/content/2012/1/290 Figure 1 Illustration of the hierarchical cooperation concept. The whole operation is divided into three consecutive phases (the big rectangles). Then, in a hierarchical manner, the first and third phases are again divided into three phases (the small rectangles). This hierarchy is repeated h times.
It has been shown that this modified scheme achieves the throughput e given by [12] For this delay-effective scheme, the optimization problem becomes arg max In order to analyze the above optimization problems ((24) and (26)), we need to have more understanding of the behavior of R 1 as a function of Q. The exact expression for R 1 is the solution to the quantized MIMO channel capacity problem (Equation 18), which is very difficult to work with.
Therefore, by some simple observations, we propose a simple approximation for the behavior of R 1 as a function of Q as follows. Consider a typical MIMO transmission between two clusters. By varying the value of Q, the observed quantization noise in the diagonal elements of N in Equation (22) varies accordingly. By substituting the covariance matrix N in Equation (18), we can quantify the functionality of R 1 as a function of Q. Figure 2 shows a typical numerical example of R 1 as a function of Q derived by Equation (18). This figure shows that at small values of Q, the rate grows almost linearly with Q, until it gets a saturation value. In this saturation point, increasing Q does not help improving R 1 . Let R s be the saturation value for R 1 . Then we have We can roughly say that this happens when the quantization distortion is negligible comparing with the thermal noise. Also, we see that until we reach this saturation point, it makes sense to approximate the curve with a linear one. Thus, we approximate R 1 (Q) by a piecewise linear function as depicted in Figure 3. The first parameter of this approximation is R s which is the saturation capacity. The second parameter is the number of bits required for getting closed to this saturation capacity, namely Q s . However, it should be noted that there are also some limitations for this kind of approximation. First, it should be noted that at low values of Q, Equation (18) is not valid and apparently the value of R 1 at Q = 0 is zero. Second, it should be noted that Equation (18) is not the capacity, and is just a lower bound, since we have assumed the quantization distortion to be just noise.
In order to find the optimum value of Q for the hierarchical cooperation scheme, we have to solve the problem (24). It is clear that the optimum value for Q happens before or at the saturation point (i.e., Q s ). By assuming Q ≤ Q s in Equation (24), we will have the following quantity to be maximized: which is maximized by putting Q = Q s . This results in the following pre-constant value According to the above result, we should use the number of quantization bits needed to get near optimal MIMO capacity at saturation. But, further bit allocation will result in throughput loss, due to the extra load for the third phase.
In a similar way, we can analyze the optimization problem for the variant of the hierarchical cooperation scheme, proposed in [11]. By analyzing (26) we see that any Q ≤ Q s maximizes the throughput pre-constant. Thus, the modified hierarchical cooperation scheme proposed in [11] is very insensitive to the choice of the number of quantization bits, as long as, we do not choose a number larger than Q s . The corresponding pre-constant will be The above discussions show that, in the hierarchical cooperation scheme and its variant, it is best to allocate enough quantization bits to have a near-optimal MIMO link in the second phase.

Analysis in the high SNR regime
One important issue is the behavior of the optimum number of quantization bits, and the network throughput pre-constant in the high SNR regime (i.e., ρ → ∞). In this section, we carry out this analysis, and prove that the optimum number of quantization bits scales as (log 2 (ρ)). With this optimum scaling, the optimum throughput preconstant scaling is of order (log 2 (ρ) 1

−1/h ).
In order to understand this issue, first, we should analyze R 1 in the high SNR regime. Equation (18) is very difficult to work with. Thus, we derive upper and lower bounds for (18) which are easier to work with. To do so, we put where by using P rec min and P rec max from (10) we will get Also, we have from (20) where the entries of the matrix G are defined to be (G) ik exp(jθ ik ). Now that we have bounds for the elements of the matrices N and F in (32) and (33), respectively, by inserting them into (18) the following bounds will result In other words, for deriving (34) we have used Equation (18), where, we need using the bounds for the received signal powers at different nodes stated in (10) and the inequalities in (20), both originally derived in [9].
The above bounds on R 1 demonstrate an interesting fact. If we do not increase Q as SNR increases, for R 1 we will have and consequently, the pre-constant for the two-stage system (9) is bounded f as In (37) and (38), λ i 's are singular values of G which are independent of ρ. Also, in the case of β > 1, by similar calculations, we will have Finally, for β = 1: A similar analysis holds for the lower bound. Thus, by choosing Q = β log 2 (ρ), for any β > 0, where C 1 and C 2 are two constant values independent of SNR. The inequalities in (41) indicate that R 1 is of the order log 2 (ρ), and accordingly the pre-constant for the two-stage scheme (9) will increase as Also, by a similar approach, we see that for the h-stage hierarchical cooperation scheme, with the throughput indicated in (23), the pre-constant scaling is of order In addition, for the modified h-stage scheme, with the throughput stated in (25), the pre-constant will be independent of ρ in the scaling sense.
Finally, we prove that the scaling choice of Q = (log 2 (ρ)) is order-optimal. First, we show that no scaling order larger than this results in higher throughput. We have observed that by the scaling of Q = (log 2 (ρ)), the scaling of R 1 is as R 1 = (log 2 (ρ)). Choosing a larger scaling than Q = (log 2 (ρ)) for Q, does not help improving the scaling order of R 1 . That is because R 1 = (log 2 (ρ)) is the best achievable scaling even in the case of Q = ∞. Thus, increasing the scaling order of Q does not help improving the scaling order of R 1 . On the other hand, this action will deteriorate the pre-constant factor by increasing the third phase load. Consequently, no scaling larger than (log 2 (ρ)) is the optimum scaling order. Now, we prove that no scaling smaller than (log 2 (ρ)) is the optimum choice. Suppose we scale Q as Q = (f (ρ)), in which lim ρ→∞ Therefore, by similar calculations as in (37), and using (44), for the lower bound in (34) we will have Similar analysis holds for the upper bound in (34), and thus, we will have R 1 = (f (ρ)). Accordingly, the preconstant scaling for the hierarchical cooperation scheme is which has become worse when compared with (43). Thus, the optimal scaling for Q is

Numerical illustrations
In this section, with the help of numerical illustrations, we investigate the above-discussed results and facts. The system considered in this section is the cooperative MIMO scheme explained in "Establishing cooperative MIMO links" section. Consider based on the upper bound in (34). This figure shows some interesting facts. The first fact is that there is an optimum choice of Q which maximizes the pre-constant value of the throughput. This Q is the optimal choice for handling the trade-off discussed in "Managing the number of quantization bits" section. The second fact is that the evaluation based on the lower and upper bound relations also shows the existence of an optimal value, but with a slightly different value for the optimum Q. The optimum Q derived based on these curves are 5.75, 10, and 15.25 bits at this specific SNR value. The next issue is about the behavior of the optimum value of Q at different SNR levels. This issue is investigated in Figure 5  the same way as in Figure 4, with the difference that the upper curve is associated with the lower bound for R 1 and the lower curve is associated with the upper bound. In this figure, we note that all the three curves have almost equal slopes. This provides the answer to the question that why the bounds stated in (34) are very useful to work with, when considering the high SNR regime analysis. Finally, Figure 6 shows the pre-constant of the network throughput when the optimum number of quantization bits derived in Figure 5 is used. Again, in this figure we note the same slope for the three curves. This fact, again, illustrates the reason for the advantage of using bounds in the high SNR regime analysis.
It should be noted that the analysis in "Analysis in the high SNR regime" section is tailored to the high SNR case. That is because the model we have considered is a dense wireless network which is interference-limited in nature and not power-limited. However, extending the analytical results of this article to non-high SNR situations is an interesting problem for future work. However, we can examine the problem in that situation from the numerical viewpoint which are shown in Figures 7 and 8.
The numerical results presented in this section are very helpful to understand the inherent trade-off in the optimization problem.

Conclusion
In this article, we have analyzed one of the key practical design parameters of cooperative MIMO schemes in ad hoc networks. We have considered the role of the number of quantization bits used at the nodes acting as the virtual MIMO receiver. By increasing this number, we will have a better virtual MIMO link, at the expense of a higher traffic load for cooperation at the receive nodes. We have analyzed this trade-off and have shown there is an optimum number of quantization bits. Also, we have shown that if we do not increase this number as SNR increases, the throughput reaches a saturation value. We have shown that the optimum scaling of the number of quantization bits with SNR is as log 2 (SNR). By this optimal scaling, the pre-constant of the hierarchical cooperation method increases by order (log 2 (SNR)) 1−1/h , in which h is the number of hierarchy stages. The discussions are supported with numerical illustrations.

Endnotes
a An earlier version of this article was accepted at the 36th IEEE Conference on Local Computer Networks (LCN 2011) as a poster presentation. b In fact, just the scaling is important which is linear with n. However, to understand why we have put 2nC 1 , and not nC 1 , refer to [9,10]. c The reason is that in the second phase, the transmit power of the MIMO transmission is proportional to r α SD where r SD is the distance between the centers of the source and destination clusters. On the other hand, the path loss between any two nodes in these two clusters can be approximated by the distance between the centers of the clusters. Thus, these two terms cancel the difference between different cluster pairs and we can treat them equally. Therefore, for the sake of analytical traceability, we have used this approximation and concluded that R 1 is almost the same for all the cluster pairs. d The calculations are the same as [10], with the difference that we have not put R 1 = R 0 . e The calculations are the same as [12], with the difference that we have not put R 1 = R 0 . f It should be noted that there is an intrinsic saturation for R 0 due to interference in the 4-TDMA spatial reuse scheme as mentioned earlier (i.e., lim ρ→∞ R 0 < ∞).