- Research Article
- Open Access
Opportunistic Relay Selection with Cooperative Macro Diversity
© Chia-Hao Yu et al. 2010
- Received: 27 August 2009
- Accepted: 25 February 2010
- Published: 12 April 2010
We apply a fully opportunistic relay selection scheme to study cooperative diversity in a semianalytical manner. In our framework, idle Mobile Stations (MSs) are capable of being used as Relay Stations (RSs) and no relaying is required if the direct path is strong. Our relay selection scheme is fully selection based: either the direct path or one of the relaying paths is selected. Macro diversity, which is often ignored in analytical works, is taken into account together with micro diversity by using a complete channel model that includes both shadow fading and fast fading effects. The stochastic geometry of the network is taken into account by having a random number of randomly located MSs. The outage probability analysis of the selection differs from the case where only fast fading is considered. Under our framework, distribution of the received power is formulated using different Channel State Information (CSI) assumptions to simulate both optimistic and practical environments. The results show that the relay selection gain can be significant given a suitable amount of candidate RSs. Also, while relay selection according to incomplete CSI is diversity suboptimal compared to relay selection based on full CSI, the loss in average throughput is not too significant. This is a consequence of the dominance of geometry over fast fading.
- Channel State Information
- Outage Probability
- Relay Node
- Relay Selection
- Cooperative Diversity
The concept of cooperative diversity [1–5] utilizes relaying transmissions as a mean of harvesting spatial diversity to overcome severely faded links between a transmission pair. In [1, 2], a distributed beamforming method was proposed where two received signals are coherently summed at the receiver, one from the direct path and the other one through a relay node (or Relay Station, RS). In , a variety of low complexity cooperative protocols are considered information theoretically under the framework of diversity-multiplexing tradeoffs, with an extension to multiple RSs studied in . In , the outage behavior of general cooperative diversity systems is analyzed. However, as pointed out in , the design of distributed space-time coding algorithms for exploiting cooperative diversity is very different from the link level space-time codes. The number of virtual antenna elements (i.e., relay nodes) may differ from time to time, and information is input to the virtual antenna elements through a possibly noisy channel. Besides, the formation of a virtual antenna array requires significant amounts of coordination for both signaling and synchronization.
On the other hand, system performance can be improved by simply selecting one relay node while achieving spatial diversity in the order of the number of total available relay nodes in the network [6–11]. In , a distributed relay selection method utilizing instantaneous channel information was proposed. It was proved to be optimal in the sense that it achieves the same diversity-multiplexing tradeoffs as . In , power allocation between the source node and the selected relaying node is further studied. The outage behavior also shows that full diversity is maintained.
An extension to selecting multiple relay nodes was investigated in [12–14]. In , simple multinode selection schemes have been shown to yield some coding gain in addition to full diversity. In , the tradeoff between decreasing energy consumption for data transmission and decreasing overhead energy consumption for Channel State Information (CSI) acquisition is analyzed. The results show that a correct amount of local cooperation should be used to maximize energy savings. In , the problem of multiple relay selection is related to knapsack problems . The relay selection is optimized both by minimizing an error probability subject to total energy consumption and by the dual approach, minimizing total energy consumption subject to error probability constraints.
In this paper, we analyze opportunistic relay selection in a wireless network with stochastic geometry [16, 17]. A wireless network is characterized by path loss due to the large-scale geometry, in addition to the statistics of fast fading. The latter is considered as a random process characterizing the instantaneous channel gain, around the mean gain characterized by the large-scale geometry.
In the context of cooperative diversity, stochastic geometry gives rise to amacro diversity component [18–20] in addition to the micro diversity component considered in the literature. If micro diversity is harvested to combat fast fading like in traditional single-hop transmissions, the channel is described by an average power gain and fast fading. However, spatial diversity discussed in the context of cooperative diversity should be generalized to include both micro- and macro diversity, according to the spatial distribution of the relay nodes. Here we consider opportunistic relaying in the setting of a mobile communication system, where idle mobile users are considered as potential relay nodes (instead of fixed relay nodes). The stochastic geometry of the network is characterized by a 2D Poisson point process of the location of the mobile users, where average path loss is characterized by the Euclidean distance, together with a realization of a shadow fading field. Accordingly, we use a complete channel model capable of taking into account path loss, shadow fading, and fast fading. Assuming that the distance between the mobile users is longer than the shadow fading correlation distance, both fast fading and shadowing fading appear as random variables.
As shown in [18–20], macro diversity is an efficient tool for improving the Signal-to-Noise Ratio (SNR) since it helps to avoid deep shadow fades. This helps the average signal level directly, which applies to any instantaneous channel state. Furthermore, a log-normal distribution (which is often used to model shadow fading) is known to be a heavier tailed distribution than an exponential distribution (which is used to model Rayleigh fading). When combined, geometric path loss and shadowing dominates the system outage performance and results obtained considering fast fading only do not apply anymore.
The system considered in this article is fully selection based in that a selection between the best relaying path and the direct path is also made. We model this fully opportunistic relay selection and express the received signal power analytically. The derived distribution functions are expressed as integrals, which are numerically integrated. This semianalytical work complements prior art in which the complete channel model is usually considered only in simulation-based work, while most analytic work simply assumes a fast fading channel.
To understand how much we may gain from relay selection in practical systems, we study fully opportunistic relay selection under different assumptions on available CSI. In addition to full CSI, we consider partial CSI, where relay selection is based on CSI on the access links only, as well as an intermediate scenario, where the angular directions of the links in 2D are used to enhance partial CSI. In the literature it has been shown that relay selection with partial CSI is to be diversity suboptimal, with a diversity degree of 1 [12, 21, 22]. We observe that despite this, relaying based on partial CSI provides significant gains when the geometry of the network is taken into account in addition to fast fading.
The remainder of this article is organized as follows. In Section 2, we describe the system model and the approximation to the complete channel model. In Section 3, we start the discussion of relaying gain, which is defined as the gain from relaying paths compared to the single-hop transmission, under full CSI situation and a one-dimensional geometry with fixed Euclidean distances. In Section 4, we extend the discussion to a stocahastic geometry in two dimensions. We discuss the optimality of opportunistic relaying in a variable rate system when Decode-and-Forward (DF) RSs and the lack of cooperation between RSs and Mobile Stations (MS) are assumed. In Section 5 we formulate the statistics of the received signal power under different CSI situations, according to fully opportunistic relay selection. The statistics is to be averaged over a single-cell environment for an overview. In Section 6, we derive the outage probability in the full CSI situation using our complete channel model. It is shown that the outage behavior is very different from that in the literature because of the dominant shadow fading effect. In Section 7, we present numerical results to compare the performance of fully opportunistic relay selection under different CSI assumptions.
where and are complex channel coefficients of access link and relaying link, respectively. Among two-hop paths, the best connection is the one with the best inferior link. Thus, assuming unit transmission power at the MSs we use the received signal power of the inferior link as the performance measure for an end-to-end two-hop path. This measure enables the discussion for maximizing throughput in a variable rate system. Accordingly, balanced relaying and access links are more desirable.
To construct a comparable performance metric for the direct path, we first note that half-duplexing is not required in the direct transmission. In the time occupied by one relaying transmission there is time for two direct transmissions. We base the selection between the best relaying path and the direct path on a low-SNR approximation of Shannon law in the linear domain; one gets twice the capacity with twice the power. Based on this, the duplexing gain of 2 for the direct link translates to a power gain of 2, when comparing the direct link to the power characterizing a relaying path. It appears that the received power is not the best metric for selecting between a relaying path and a direct path (e.g., throughput would be a better metric). However, it does facilitate the discussion later.
Here characterizes fast fading and is distributed according to a zero mean, unit variance circular complex Gaussian distribution. Shadow fading is induced by the log normally distributed variable . The variable is thus Gaussian, and we denote its mean by and standard deviation by . For convenience, we shall denote below. We assume single-slope path loss, so that the average received power is , where is the transmission power, is the path loss exponent, and is the Euclidean distance between the transmitter and the receiver.
where is the received power in linear domain. In (4), the integrand consists of two distribution functions. Due to Rayleigh fading the received power is exponentially distributed, with mean value . The latter, as discussed, is log normally distributed. The Probability Density Function (PDF) of is obtained by averaging out the mean of the exponential distribution with respect to its log-normal PDF.
While the Suzuki distribution is extremely challenging from the perspective of analysis, it is known from  that a log-normal distribution provides a good approximation of the Suzuki distribution. According to , a good fit between log-normal and Suzuki distributions can be obtained by matching the two first moments of the distributions. This approximation is justified by the fact that a log-normal distribution is a heavier tailed than an exponential distribution. This implies that the log-normal part of (4) is dominant.
With this approximation, the channel is characterized only by distance dependent path loss and modified shadow fading, so that the received power expressed in decibel domain, , is a Gaussian random variable.
Equation (5) may be counter intuitive since the mean value is also modified, while it is believed that fast fading will only change the variance of the received power. Conventionally, it is considered that in a local area wherein a mobile station is moving during short-time scales, the mean power of the received signal (determined by shadow fading) is not changing, and the received signal power is characterized by fast fading. Whereas here, the distribution of power is for an area that is large enough so that the shadow fading value is changing, as expressed in (4). This difference makes that both the mean and the variance values are modified in (5).
We treat hops with different departure positions and different destinations to be statistically independent related to their channel fading states. This means that all MSs are separated by a distance larger than the shadow fading correlation distance. With cell ranges in the order of hundreds of meters or kilometers, and shadowing correlation distances of tens of meters, this assumption is well founded when the number of MSs is ten, which is the average number considered here. Thus, all links admit independent channel conditions given the position of the transmitting MS. In addition, since we assume the same spatial distribution of all candidate RSs, the relaying path provided by different candidate RSs admits i.i.d. channel states and can be viewed as independent trials of the same random variable.
The relaying gains are the largest when the source MS, the relay and the destination BS are all on the same line. Therefore, one-dimensional geometry can be used to investigate the upper limit of the relaying gain. In this section, we investigate this upper limit in the case that there is one potential relay station with a fixed position.
where is the CDF of and is the PDF of . All individual link powers, and , are distributed according to (6). The CDF of Gaussian distribution is given by an error function. Thus if we consider the signal powers in the dB domain, after combining (9) and (10) it is found that integration needs to be carried out over a product of two error functions and a Gaussian PDF. Such an integral does not admit a closed-form expression and thus we have to use numerical integration.
When illustrating performance we normalize the system so that unit transmission power is used and the distance for the direct hop is one. We assume shadow fading standard deviation [dB] and the path loss exponent . Two different channel models are considered: one without fast fading and one with fast fading. As stated earlier, the received power in both cases is modeled by the log-normal distribution. The only difference is that the values of the average received power and the standard deviation are modified according to (5) when fast fading is taken into account.
From this we conclude that by providing a suitable amount of candidate RSs, there almost always exist RSs which may provide a large relaying gain. Furthermore, as observed from Figure 2(b), fast fading broadens the distribution of the relaying gain, which implies that the experienced power gain from relaying may be even larger than without fast fading. Also, fast fading narrows down the difference between curves with different values, implying that there is potential for relaying gain independently of the position of the RS, as long as it is between the MS and BS.
In Section 3 the potential of relaying in a setting with a complete channel model was seen. The CDF of power gain of relaying, defined by (8) and (10), shows the upper limit under a one-RS scenario for a fixed MS position. In practice we may have more than one RS and therefore selection diversity can be reached. On the other hand, the constraint that the BS, the RSs, and the MS would lie on a straight line overestimates the relaying gain. Therefore we assume in this section a two-dimensional stochastic geometry with multiple candidate RSs.
4.1. Motivation for Selecting a Single RS
We assume that there are multiple potential RSs to be used for DF relaying, and that the direct link is not used for decoding. For a DF RS, the received signal from a source must be decoded correctly before it can reencode and transmit the signal. In  a certain spectral efficiency is required for the signal before an RS can successfully detect. Only those RSs that fulfill this requirement are considered in the relay selection procedure. This approach favors RSs with better relaying link than access link. Besides, it inherently implies that we may not be using the channel in the most efficient way since, if all the considered RSs can decode the signal, there is a possibility for all but the worst RS to support a higher spectral efficiency than .
Accordingly, when we are interested in maximizing throughput by using a variable rate, it is possible that we do not gain by using all the candidate RSs for relaying in a multinode relaying system. In the relaying link, the transmission rate would be limited by the worst relaying link, as in , if a subset of candidate RSs are used to relay the transmitted signal from the MS. In this case, the transmission rate for the relaying links should be selected according to the worst relaying link.
On the other hand, on the access links, the BS benefits from combining all the relayed signals from the RSs, so that the access links are less constrained. This generates a highly asymmetric situation where the second hop is mostly stronger than the first hop. Compared to opportunistic relay selection where we create a symmetric relaying link and access link, this multinode relaying scenario, with its performance limited to the worst relaying link, is in general suboptimal in terms of the transmission rate. Note that this argument does not apply to a fixed rate system where multiple RSs can reduce the outage probability.
The discussion above suggests that adaptive selection on the number of active RSs would give higher throughput in general. As discussed in , this is indeed the case. However, the discussion in  assumes the same average channel gain in relaying and access links, making the results not directly applicable to our case. In the scope of stochastic geometry, we need a high user density for RSs with similar channel gains of relaying and access links to exist. With reasonable user density, the optimal number of RSs is quite limited. This part of discussion is out of the scope of this article. We will use single relay selection for the discussion.
Selecting a single relaying link also makes sense from the system perspective, if we consider an interference limited multicellular system. When selecting a single relay, the number of transmitting MSs per cell stays constant irrespectively of relaying. In contrast, if multiple MSs are used for relaying, and their power is not reduced, more interference is created during the access hop with relaying than without. This will have an adverse effect of system performance.
4.2. Statistics inside Isolated Cell
This implies a circular region around the BS inside which relay enhanced communication is not considered. This matches the basic concept used for fixed relay deployment that relaying is for serving the MSs located farther away from the BS. As we do not assume location information of the MSs, this restriction should be taken with a pinch of salt. The relaying protocol automatically disfavours relaying for source MSs that are close to the BS. This restriction can be easily removed by setting .
Note that the distribution of is not uniformly distributed because the relay region is fixed to a specific sector, but not a sector centered at the MS. The probability of having a smaller angle separation is higher than a larger one, as observed from (14).
4.3. Alternative CSI Scenarios
Acquiring CSI to be used for relay selection requires significant amounts of measurements and signaling. In  a centralized system is assumed where the receiver has access to all CSI needed to select the best relay node. This will be called a full CSI scenario hereafter.
In the UL of a traditional cellular communication system, CSI for all the access links is easily available at the Base Station (BS). The situation where there exists CSI only related to the access links will be called a partial CSI scenario. To get from partial CSI to full CSI would require each relay node (idle mobile station in our model) to transmit the CSI of its corresponding relay link to the BS.
In addition, a scenario is studied where, in additional to partial CSI, Angle of Arrival (AoA) information of the direct path and the relaying paths is available at the BS. Based on this, the BS can construct a distribution of the power of the relay links and use that to enhance the decision compared to partial CSI.
In what follows, we will proceed to calculate the distributions of relaying gains, assuming different levels of available CSI. The principle of selecting the transmission path is to minimize the required transmission power for the delivery of a data packet with unit received signal power, or alternatively, to maximize the received signal power under a unit transmission power. The two normalizations give the same result and can be transformed easily to each other. Depending on different CSI assumptions, it may be easier to solve the problem using one than the other. We will use the normalization which makes it easier to find a solution. For unified presentation of the results, we always show them with a normalization to unit transmission power.
The channel models with and without fast fading have the same form except that the mean and the standard deviation differ. For ease of discussion, we consider the channel model without fast fading from now on. Whenever needed, it is straightforward to add fast fading by changing the mean value and the standard deviation.
5.1. Full CSI Relay Selection
In this subsection, we consider a full CSI scenario where the CSI of all involved links is used for selecting the best relaying path.
We follow the same notation as in Section 3 for the received power and the distance corresponding to direct link, relaying links, and access links. We assume that all transmitters use unit transmission power. The received signal power is therefore , where is a realization of a zero-mean Gaussian random variable, , modeling log-normal shadow fading. Since there are candidate RSs for the MS, an additional index is used to denote different candidate RSs. Therefore, for the relaying path, we denote the received power of the inferior of the access link and the relaying link by .
Out of candidate relaying paths, we select the one with maximum as the final candidate relaying path and denote it as . Due to the independence assumption between MSs, the statistics of 's conditioned on the position of the MS, , is i.i.d. We express this quantity by .
The received signal power distribution with full CSI, , is obtained by integrating over and weighted by their corresponding PDFs. Note that these integrations give the cumulative distribution of the received power with the considered relaying protocol, taking the stochastic geometry and the complete channel model into account.
5.2. Partial CSI Relay Selection
In this subsection, we assume that only the CSI of the links ending at the BS is known to the BS, that is, the CSI of the direct link and the access links. In a modern cellular network, this CSI information is typically available at the BS for all active MSs, so that no extra effort is required for collecting it.
Now we require unit received signal power at the BS and derive the distribution of the required transmission power. The transmission power with unit-received power is expressed as , where is the required transmission power, and is as defined below (16). Similar to the notation in Subsection 5.1, we denote the transmission power with respect to the direct link by , the transmission power with respect to the relaying link by and the transmission power with respect to the access link by . Since we do not have information of , the RS with the best channel condition in its access link is chosen. We denote the chosen relay by so that . The joint distribution of the transmission power set is needed before we can investigate the transmission power distribution.
5.3. Partial CSI with AoA Assistance Relay Selection
The relaying gain provided by totally ignoring the channel condition on the relaying link is degraded compared to the full CSI scenario. To compensate for this deterioration without requiring significant amounts of feedback information as in the full CSI scenario, we incorporate Angle of Arrival (AoA) information into the path selection. Thus we assume that the BS knows the angles shown in Figure 3. In a macrocellular environment, this is possible to estimate if there is an antenna array at the BS. Requiring unit-received signal power, the path selection is made based on , , and .
A distribution of the relaying link power can be derived based on AoA information and an assumed channel statistic. This distribution provides information about the channel condition of the relaying link and can be used for the decision making. For any given realization , , we may calculate the conditional distributions and . Since is determined by the realization of , , and through (13), the conditional distribution and thus, can be obtained.
The estimation of above involves inverting the conditional CDF , which is nonalgebraic. To proceed with formulating the statistics of would require dealing with complicated nonlinear functions. Therefore, a semi-numerical approach, where we calculate according to (22) for each channel realization and collect the numerical samples of according to the path selection strategy (23) for the CDF distribution, is more efficient.
One might reckon that the similarity of the full CSI relay selection used here with approaches analyzed in the literature (e.g., ) would imply a similar outage probability. Yet, the different nature of the considered channel statistics will lead to very different asymptotic behavior of the outage probability. The discussion of outage probability in the literature assumes mostly a Rayleigh fading channel or, equivalently, an exponentially distributed SNR. Many commonly used concepts defined for this specific channel are not applicable for a complete channel model. For instance, the definitions of diversity order and multiplexing gain  require the outage probability to be of exponential order in average SNR, which is not the case of the channel model used here.
Since a log-normal distribution is heavier tailed than an exponential distribution, the outage behavior of a complete channel model is dominated by the log-normal part. However, a log-normal distribution is not of exponential order, and therefore, the diversity order and multiplexing gain are not well-defined quantities in a complete channel model.
We have discussed the transmission strategies in a two-hop relaying cellular system under different CSI assumptions. In the full CSI scenario, the channel information with respect to all the links is assumed available at the BS. It provides us an upper limit on the gain from the mobile relaying with selection diversity. We also consider practical scenarios with channel uncertainty, namely, the scenarios with partial CSI and partial CSI with AoA assistance. In this section, we examine the performance gain of these mobile relaying scenarios relative to a single-hop transmission. Within the established framework, it is straightforward to derive the analytical expression of the received power distribution of the single-hop transmission system, which is thus omitted here.
Compared to the curve of partial CSI scenario, we gain at the higher end and lose at the lower end of the curve of AoA-assisted partial CSI scenario. Observing the relay selection strategies of partial CSI and AoA-assisted partial CSI scenarios (19) and (23), the difference is on the estimation of 's. In our numerical results, the estimates are constructive in the higher end and destructive in the lower end of the curve.
It has been shown [12, 21, 22] that relay selection with partial channel information leads to a diversity suboptimal cooperative system with diversity order of . Our results show that relay selection based on partial CSI still provides significant gain in terms of the received signal power and, therefore, also in terms of average throughput. This is one of the main observations to be made in the context of stochastic geometry—compared to the power gain arising from the geometry, diversity gain is of secondary importance in most of the operational range of the system.
From Figure 5, it may be observed that we start to suffer from incomplete CSI when the received signal power is reduced. This is where the higher diversity order comes to play for reducing the outage probability so as to increase the throughput. However, one should notice that in terms of average throughput, the loss due to incomplete CSI is not devastating.
In the 1D case, we observe, in Figure 2(a), a 10–15 dB relaying gain at outage probability . On average, 1 out of 10 candidate RSs should be able to provide us with this amount of relaying gain. In Figure 5, we assume that there is on the average candidate RSs inside the relaying region and this results in around dB relaying gain in middle range of outage probability. Considering the fact that one-dimensional geometry is an optimistic scenario, the results in Figure 5 and Figure 2(a) match each other well.
In this paper, we studied fully opportunistic relay selection as a method for reaching cooperative diversity. The method applied is fully selection based so that there is no need for any kind of signal combining at the receiver. Relay selection was considered in a setting of stochastic geometry, where a geometric distribution of the positions of the relay stations is taken into account. A complete channel model, with distance-dependent path loss, shadow, and fast fading, was used.
First we analyzed a one-dimensional model with fixed geometry where a single RS resides on the line between the transmitter and the receiver. This scenario can be understood as the projection of the RS position onto the line between the transmitter and the receiver. This minimizes the physical lengths of the access link and the relaying link, and the results provide an upper bound for the power gain of relaying. It is found that in a fading channel there is a significant potential for relaying gain, with the highest probability of gain when the relay node is half-way between the source and destination.
In two-dimensional geometry, we formulated the received signal power statistics in a stochastic geometry where the RSs followed a Poisson point process, and accordingly, the number of potential RSs followed the Poisson distribution. In this scenario, opportunistic relay selection was applied. The statistics under different CSI assumptions were formulated to account for both optimistic and practical situations. The statistics were averaged over an isolated cell. The relaying gain observed under this framework was consistent with the gain obtained in the one-dimensional geometry. Results showed that the performance loss due to incomplete CSI is smaller when the transmitter is closer to the receiver. This loss can be reduced by utilizing AoA information of the transmitter and the RSs. We also argued that by allowing multiple RSs to relay the data, the performance of a variable rate system cannot be improved when the RSs follow DF protocol and there is no cooperation between the transmitter and the RSs.
The outage probability of the fully opportunistic relay selection scheme using full CSI was analyzed and derived with a complete channel model that includes a log-normal shadowing and Rayleigh fading effect. Because the fading statistics of this complete channel model is dominated by the log-normal shadowing, the outage behavior differs known outage characteristics of systems with Rayleigh fading only. The conventional definition of diversity order does not apply since it requires the outage probability expression to be of exponential order. According to our closed form expression of the outage probability, diversity appears in the form of a product of error probabilities contributed by different transmission branches.
Due to the underlying stochastic geometry and shadow fading, the relaying gain over single-hop transmissions is significant in all the considered CSI scenarios. This is due to the fact that in the analyzed scenario, the dominant effect from relaying is a selection of the path with least average attenuation, and the gains are visible in the CDF of the received signal power.
where the symbol " " denotes logical OR. In (A.4), the first equality is the definition of a CDF, the second equality follows directly from (15), and the last equality is the result of applying Bayes' rule.
This work is done with partial funding from Nokia Research Center.
- Sendonaris A, Erkip E, Aazhang B: User cooperation diversity—part I: system description. IEEE Transactions on Communications 2003, 51(11):1927-1938. 10.1109/TCOMM.2003.818096View ArticleGoogle Scholar
- Sendonaris A, Erkip E, Aazhang B: User cooperation diversity—part II: implementation aspects and performance analysis. IEEE Transactions on Communications 2003, 51(11):1939-1948. 10.1109/TCOMM.2003.819238View ArticleGoogle Scholar
- Laneman JN, Tse DNC, Wornell GW: Cooperative diversity in wireless networks: efficient protocols and outage behavior. IEEE Transactions on Information Theory 2004, 50(12):3062-3080. 10.1109/TIT.2004.838089MathSciNetView ArticleMATHGoogle Scholar
- Laneman JN, Wornell GW: Distributed space-time-coded protocols for exploiting cooperative diversity in wireless networks. IEEE Transactions on Information Theory 2003, 49(10):2415-2425. 10.1109/TIT.2003.817829MathSciNetView ArticleMATHGoogle Scholar
- Ribeiro A, Cai X, Giannakis GB: Symbol error probabilities for general cooperative links. IEEE Transactions on Wireless Communications 2005, 4(3):1264-1273.View ArticleGoogle Scholar
- Bletsas A, Khisti A, Reed DP, Lippman A: A simple cooperative diversity method based on network path selection. IEEE Journal on Selected Areas in Communications 2006, 24(3):659-672.View ArticleGoogle Scholar
- Ikki SS, Ahmed MH: Performance of multiple-relay cooperative diversity systems with best relay selection over rayleigh fading channels. EURASIP Journal on Advances in Signal Processing 2008, 2008:-7.Google Scholar
- Zhao Y, Adve R, Lim TJ: Symbol error rate of selection amplifyand-forward relay systems. IEEE Communications Letters 2006, 10(11):757-759.View ArticleGoogle Scholar
- Zhao Y, Adve R, Teng JL: Improving amplify-and-forward relay networks: optimal power allocation versus selection. IEEE Transactions on Wireless Communications 2007, 6(8):3114-3123.Google Scholar
- Ibrahim AS, Sadek AK, Su W, Liu KJ: Relay selection in multi-node cooperative communications: when to cooperate and whom to cooperate with? In Proceedings of the IEEE Global Telecommunications Conference (GLOBECOM '06), November-December 2006, San Francisco, Calif, USA. IEEE;Google Scholar
- Tsiftsis TA, Karagiannidis GK, Mathiopoulos PT, Kotsopoulos SA: Nonregenerative dual-hop cooperative links with selection diversity. EURASIP Journal on Wireless Communications and Networking 2006, 2006:-8.Google Scholar
- Jing Y, Jafarkhani H: Single and multiple relay selection schemes and their diversity orders. Proceedings of the IEEE International Conference on Communications (ICC '08), May 2008, Beijing, China 349-353.Google Scholar
- Madan R, Mehta NB, Molisch AF, Zhang J: Energy-efficient cooperative relaying over fading channels with simple relay selection. IEEE Transactions on Wireless Communications 2008, 7(8):3013-3025.View ArticleGoogle Scholar
- Michalopoulos DS, Karagiannidis GK, Tsiftsis TA, Mallik RK: An optimized user selection method for cooperative diversity systems. In Proceedings of the IEEE Global Telecommunications Conference (GLOBECOM '06), November-December 2006, San Francisco, Calif, USA. IEEE;Google Scholar
- Kellerer H, Pferschy U, Pisinger D: Knapsack Problems. 1st edition. Springer, Berlin, Germany; 2004.View ArticleMATHGoogle Scholar
- Baccelli F, Klein M, Lebourges M, Zuyev S: Stochastic geometry and architecture of communication networks. Telecommunication Systems 1997, 7(1–3):209-227.View ArticleGoogle Scholar
- Haenggi M, Andrews JG, Baccelli F, Dousse O, Franceschetti M: Stochastic geometry and random graphs for the analysis and design of wireless networks. IEEE Journal on Selected Areas in Communications 2009, 27(7):1029-2009.View ArticleGoogle Scholar
- Wong PB, Cox DC: Low-complexity cochannel interference cancellation and macroscopic diversity for high-capacity PCS. IEEE Transactions on Vehicular Technology 1998, 47(1):124-132. 10.1109/25.661039View ArticleGoogle Scholar
- Bornkamp B, Kegel A, Prasad R: Macro and micro diversity in land-mobile cellular radio telephony networks with discontinuous voice transmission. Proceedings of the 4th IEEE International Conference on Universal Personal Communications, November 1995 590-594.View ArticleGoogle Scholar
- Whang K-C, Kim K-J, Cho B-J, Kang B-G: Performance evaluation of a direct-sequence spread-spectrum multiple-access system with microscopic and macroscopic diversity in mobile radio environment. Proceedings of the 43rd IEEE Vehicular Technology Conference, May 1993 803-806.Google Scholar
- Krikidis I, Thompson J, McLaughlin S, Goertz N: Amplify-andforward with partial relay selection. IEEE Communications Letters 2008, 12(4):235-237.View ArticleGoogle Scholar
- Sadek AK, Han Z, Liu KJR: A distributed relay-assignment algorithm for cooperative communications in wireless networks. Proceedings of the IEEE International Conference on Communications (ICC '06), June 2006 4: 1592-1597.Google Scholar
- Suzuki H: A statistical model for urban radio propagation. IEEE Transactions on Communications 1977, 25(7):673-680. 10.1109/TCOM.1977.1093888View ArticleGoogle Scholar
- Turkmani AMD: Probability of error for M-branch macroscopic selection diversity. IEE Proceedings, Part I 1992, 139(1):71-78.Google Scholar
- Ban TW, Jung BC, Sung DK, Choi W: Performance analysis of two relay selection schemes for cooperative diversity. Proceedings of the 18th IEEE International Symposium on Personal, Indoor and Mobile Radio Communications (PIMRC '07), September 2007Google Scholar
- Nam TVS, Vu M, Tarokh V: Relay selection methods for wireless cooperative communications. Proceedings of the 42nd Annual Conference on Information Sciences and Systems (CISS '08), March 2008 859-864.Google Scholar
- Zheng L, Tse DNC: Diversity and multiplexing: a fundamental tradeoff in multiple-antenna channels. IEEE Transactions on Information Theory 2003, 49(5):1073-1096. 10.1109/TIT.2003.810646View ArticleMATHGoogle Scholar
This article is published under license to BioMed Central Ltd. This is an open access article distributed under the Creative Commons Attribution License, which permits unrestricted use, distribution, and reproduction in any medium, provided the original work is properly cited.