Expand this Topic clickable element to expand a topic
Skip to content
Optica Publishing Group

Exploiting the relays’ backup RF antennas for enhanced FSO cooperative communications

Open Access Open Access

Abstract

This paper investigates a novel method for boosting the performance of parallel-relaying decode-and-forward (DF) cooperative free space optical (FSO) networks. The proposed solution takes advantage from the presence of the radio frequency (RF) links that are often established to backup the FSO links in practical systems. In this context, the low speed RF links are used for carrying the information packets that have not been delivered along the direct FSO link for the sake of sharing these packets among the relays in a simple and efficient manner. This packet sharing enhances the chances for correct detection at the relays thus increasing the number of relays that will participate in the relay-destination transmission phase. An exact outage probability analysis is carried out in the case of gamma-gamma FSO fading channels with pointing errors and of Rician/Rayleigh RF fading channels. At a second time, the cut-set method is applied for deriving a simple and tractable upper-bound that is useful for evaluating the asymptotic performance and diversity gain.

© 2017 Optical Society of America

1. Introduction

Commercially available Free Space Optics (FSO) transceivers are often equipped with a Radio Frequency (RF) backup system to be used when the FSO link is inoperative [1]. In fact, while FSO links advantageously provide high data rates, they become practically unavailable under severe weather conditions like fog or snow where the attenuation reaches the order of hundreds dB/km [2]. This renders hybrid RF/FSO solutions particularly appealing since they take advantage from the high data rate of the FSO links and the high reliability of the RF links [2–5]. A hard-switching hybrid RF/FSO system was analyzed in [3] where preference is given to the high speed FSO link as long as the link quality is above a certain threshold; if the quality of the FSO link falls below acceptable levels, the system resorts to the lower speed RF link. While hard-switching involves the transmission along a single channel at a time, a soft-switching technique was proposed in [4] where packets are transmitted simultaneously over both links. In this case, a channel coding scheme that adapts to the conditions along the FSO and RF links is used to coordinate data transmission. A similar solution was considered in [5] where a single rate-less code is applied at the transmitter side followed by de-multiplexing the encoded bits into two streams to be communicated simultaneously along the FSO and RF links.

In addition to the hybrid RF/FSO point-to-point communication systems [3–5], dual-hop mixed RF/FSO relaying systems attracted an increased attention recently [6–8]. For such systems, an intermediate relay ensures the wireless connectivity between communicating nodes with no direct Line-of-Sight (LOS). In this case, the relay communicates with a number of users along RF links and forwards the information to the destination along an FSO link. Dual-hop mixed RF/FSO systems constitute very powerful solutions for bridging the connectivity gap between a backbone network and a last-mile network where the information from a number of users can be multiplexed along a high speed FSO link. Single-relay and multi-relay Amplify-and-Forward (AF) mixed RF/FSO systems were analyzed in [6] and [7], respectively. Multiuser single-relay Decode-and-Forward (DF) systems were analyzed in [8] where the last-mile links are RF while the backbone link is a hybrid RF/FSO link.

On the other hand, FSO cooperative diversity was investigated extensively where a group of relays (R’s) assist a source (S) in its communication with a destination (D). The cooperative solutions include the two-phase (S-R and R-D) parallel-relaying AF and DF schemes [9, 10] and the three-phase (S-R, R-R and R-D) DF strategies [11].

In this paper, we propose and analyze a novel three-phase mixed RF/FSO scheme where communications take place along the S-D, S-R and R-D FSO links and along the R-R RF links. The proposed approach is motivated by the observation that the RF links operating at lower data rates can be used to communicate the packets that are not delivered along the S-D link. In other words, the RF links are used as a backup system for the sake of sharing the packets between the relays and establishing the inter-relay cooperation phase. The main differences between the proposed scheme and the inter-relay cooperation strategies in [11] are as follows. (i): In [11], the R-R links are FSO while in this work they are RF links. (ii): The implication of establishing FSO R-R links in [11] is that only subsequent relays can be connected; therefore, the R-R communications take place along a total of N − 1 links where N is the number of relays. Since RF transmissions have a broadcast nature, the packet transmitted by one relay can be overheard by all other relays. Consequently, any two relays are interconnected resulting in a total of (N2) RF R-R links that can be exploited. This not only alters the cooperation protocol, but also complicates the outage analysis of the network. (iii): While in [11] all packets are transmitted along the R-R links, only a fraction of these packets are shared in our case. This is motivated by the fact that the FSO and RF systems operate at different data rates. Finally, an additional contribution of the paper resides in applying the cut-set method for deriving a tight upper-bound on the network outage probability.

2. System model

2.1. Cooperation strategy

Consider a cooperative FSO system where N relays denoted by R1, …,RN assist the communications between a source node S and a destination node D. As in conventional cooperative FSO systems, FSO links are assumed to be established between S and D, between S and the relays as well as between the relays and D. In addition to these 2N + 1 FSO links, the proposed system takes advantage from the presence of the backup RF links for the sake of establishing RF communications between the relays. A cooperative FSO network with RF inter-connected relays is shown in Fig. 1 in the case of N = 3. In this context, a message broadcasted by the RF antenna of a certain relay will be overheard by all remaining relays. This results in establishing additional (N2) RF links between the relays that can be further exploited to enhance the system performance. Finally, the communication between any two nodes in the network involves the ACK/NACK mechanism where the receiver informs the transmitter about the packet’s reception status.

 figure: Fig. 1

Fig. 1 A cooperative FSO network with three RF inter-connected relays.

Download Full Size | PDF

The proposed scheme can be perceived as an opportunistic protocol that can be implemented as follows.

  • S-D phase: S transmits an information packet to D along the direct S-D FSO link.
  • S-R phase: In case of a positive acknowledgement (ACK), S proceeds to the transmission of a new packet to D. Otherwise, S transmits the packet to the relays along the N FSO links S-R1,…,S-RN.
  • R-R phase: All relays that have successfully decoded the packet proceed to broadcasting this packet along the RF links. In order to avoid interference, it is assumed that different RF frequency bands are allocated to each one of the relays.
  • R-D phase: All relays that successfully received the packet proceed to retransmitting this packet along the corresponding R-D links. In this context, the involved relays could have received the packet either from S (along the FSO link) or from another relay (along the RF links).

It is extremely important to highlight that the proposed scheme can be implemented despite the fact that the FSO links and RF links operate at different data rates as is explained in what follows. Assume that the data rate of the FSO links is M times larger than the data rate of the RF links implying that the R-R phase is M times slower than the remaining transmission phases. In other words, in the time needed to share a single packet among the relays along the R-R RF links, S would have proceeded to the transmission of M packets along the S-D FSO link. On the other hand, denote by Pe the average packet error rate along the direct S-D link. In this context, two packets with erroneous detection (resulting in a NACK) will be separated by 1/Pe packet durations on average.

Therefore, the proposed strategy can be put in place if 1/Pe > M. Typical values of M range between 10 and 100 [1, 2, 4] where, for example, in [4] a 1 Gbps FSO link was combined with a 96 Mbps WiMAX RF link in the context of hybrid RF/FSO communications. In this context, while the bandwidth of RF links is smaller, the data rate of these links is positively impacted by the fact that higher order modulations are often applied compared to the binary On-Off-Keying (OOK) modulation that is often used with FSO links. Consequently, Pe must be roughly smaller than 10−2 that does not constitute a limiting constraint since FSO systems are designed to operate at low error rates (typically below 10−6). In other words, the relation MPe < 1 can be easily satisfied in practical scenarios where the signal-to-noise ratio (SNR) is not very low. This renders the proposed scheme suitable for the average-to-high SNR range which does not constitute an exception to the conventional cooperative-diversity fading-mitigation techniques that are typically designed to achieve the highest performance gains at high SNRs.

While 1/Pe corresponds to an average value, additional packets might still be erroneously detected (along the S-D link) in the time span of M packet durations even though this event occurs with low probability. A practical solution that avoids dropping such packets consists of equipping S with a buffer (data queue) where the relation MPe ≪ 1 ensures that very small buffer sizes are sufficient in practice.

2.2. FSO S-D, S-R and R-D links

2.2.1. Channel model

In what follows, S and D will be denoted by R0 and RN+1, respectively. Denote by Ii,j the irradiance along the FSO link Ri-Rj. In this work, we adopt a channel model that takes into account the combined effects of path loss, atmospheric turbulence-induced scintillation and misalignment-induced fading caused by pointing errors. The probability density function (pdf) of Ii,j was derived in [12] assuming a gamma-gamma turbulence model and a Gaussian spatial intensity profile falling on a circular aperture at the receiver:

fIi,j(I)=αi,jβi,jξi,j2Ai,jIi,j(l)Γ(αi,j)Γ(βi,j)G1,33,0[αi,jβi,jAi,jIi,j(l)I|ξi,j2ξi,j21,αi,j1,βi,j1]
where Γ(.) is the Gamma function and Gp,qm,n[.] is the Meijer G-function. In (1), αi,j and βi,j stand for the distance-dependent parameters of the gamma-gamma distribution:
αi,j=[exp(0.49σR,i,j2/(1+1.11σR,i,j12/5)7/6)1]1
βi,j=[exp(0.51σR,i,j2/(1+0.69σR,i,j12/5)5/6)1]1
where σR,i,j2=1.23Cn2k7/6di,j11/3 is the Rytov variance where di,j stands for the length of the link Ri-Rj, k is the wave number and Cn2 denotes the refractive index structure parameter.

In (1), the parameters Ai,j and ξi,j are related to the pointing errors. Ai,j is given by Ai,j = [erf(νi,j)]2 where erf(.) stands for the error function with νi,j=π/2(ai,j/ωz,i,j) where ai,j is the radius of the receiver and ωz,i,j is the beam waist along the link Ri-Rj. ξi ,j=ωzeq ,i,j/2σs ,i,j where σs,i,j stands for the pointing error displacement standard deviation at the receiver and ωzeq,i,j2=ωz,i,j2πerf(νi,j)/[2νi,jeνi,j2]. Finally, the atmospheric loss is given by Ii,j(l)=eσdi,j where σ is the attenuation coefficient.

2.2.2. Outage probability

Consider a non-coherent FSO system based on Intensity-Modulation and Direct-Detection (IM/DD). The system outage probability will be reported in terms of the optical power margin PM=γ¯0,N+1γth where γ¯0,N+1 stands for the average electrical SNR along the direct link S-D while γth denotes the threshold SNR below which an outage event occurs.

The instantaneous electrical SNR γi,j along the link Ri-Rj is related to the average electrical SNR γ¯0,N+1 by the following relation [11]:

γi,j=γ¯0,N+1(ξ0,N+12+1A0,N+1I0,N+1(l)ξ0,N+12)2(Ii,jNlink)2
where Nlink = 2N + 1 stands for the total number of optical links in the FSO network.

Based on (4), the outage probability pi,jPr(γi,j<γth) along the link Ri-Rj can be written as:

pi,j=FIi,j(NlinkPMA0,N+1I0,N+1(l)ξ0,N+12ξ0,N+12+1)
where FIi,j(.) stands for the cumulative distribution function (cdf) associated with the pdf in (1) [12]:
FIi,j(I)=ξi,j2Γ(αi,j)Γ(βi,j)G2,43,1[αi,jβi,jAi,jIi,j(i)I|1,ξi,j2+1ξi,j2,αi,j,βi,j,0]

2.3. RF R-R links

The RF links between the relays are assumed to follow either the Rician or the Rayleigh fading models depending on the presence or absence of a direct LOS between the communicating nodes, respectively. In what follows, Ω¯i,j stands for the average SNR along the RF link Ri-Rj while Ωth = 22R − 1 stands for the threshold SNR where R is the number of bits transmitted per channel use.

For Rayleigh fading, the outage probability along the RF link Ri-Rj can be written as:

pi,j=1exp(ΩthΩi,j)

In the case of Rician fading [13]:

pi,j=1Q1(2Ki,j,2(Ki,j+1)ΩthΩ¯i,j)
where Q1(., .) stands for the first-order Marcum Q function. Ki,j is the Rician factor defined as the ratio of the power in the LOS component to the power in the non-LOS components.

Finally, following from the reciprocity of the RF channels, the relation pi,j = pj,i holds for any pair of relay nodes.

3. Performance analysis

3.1. Exact system outage probability

The outage probability of the network can be separated into two terms as follows:

PNet=p0,N+1Pout
where, evidently, the network will not suffer from outage if the direct link S-D (or, equivalently, R0-RN+1) is not in outage.

The probability Pout (related to the indirect links) will be evaluated based on the conditional probability method where the system will be reduced into simpler subsystems comprising simple series or parallel connections. The system of indirect S-R, R-R and R-D links will be referred to as “system” in what follows. Links in series will not suffer from outage only if all constituents sub-links are not in outage while links in parallel will suffer from outage only if all constituents sub-links are in outage:

(1P(RiRj) (RjRk))=(1pi,j)(1pj,k)
P(RiRj) (RiRk)=pi,jpj,k
where ⇌ and ∥ stand for the series and parallel connections, respectively. In (10)-(11), P… stands for the outage probability of the equivalent series or parallel subsystem.

In what follows, conditioning will be performed on the status of the RF inter-relay links. As illustrative examples, we first consider the cases N = 2 and N = 3 before tackling the general case of systems with an arbitrary number of relays.

3.1.1. N = 2 relays

Two cases will arise. (i): The inter-relay link is in outage with probability p1,2 (that is derived according to (7) or (8)). In this case, the system reduces to the parallel connection between two constituent subsystems as follows: [(R0-R1)⇌(R1-R3)]∥[(R0-R2)⇌(R2-R3)]. Invoking (11) followed by (10) results in the following expression of the system outage probability:

Pout(1)=[1(1p0,1)(1p1,3)][1(1p0,2)(1p2,3)]

(ii): The inter-relay link is not in outage with probability 1 −p1,2 implying that the two relays are interconnected by the RF link. In other words, R1 and R2 can be combined into a single node and the system reduces to the series connection between two parallel subsystems: [(R0-R1)∥(R0-R2)]⇌[(R1-R3)∥(R2-R3)]. Invoking (10) followed by (11), the system outage probability can be written as:

Pout(2)=1(1p0,1p0,2)(1p1,3p2,3)

Combining (12) and (13) results in Pout=p1,2Pout(1)+(1p1,2)Pout(2).

3.1.2. More convenient representation

The reduced systems’ outage probabilities Pout(1) and Pout(2) (and all subsequent similar probabilities) can be written in a more convenient and unified manner as follows. Let S be a subset of {1, …, N} containing the indices of the relays that are successfully (with no outage) interconnected via the RF links. In other words, the availability of the information packet at any relay in S will imply the availability at all remaining relays of this set. In this case, relays RS1, RS2,,RS|S| can be combined into a single node (where Sn denotes the n-th element of S with |S| standing for the cardinality of S). Therefore, relays in S will form a reduced system that corresponds to the series connection of two parallel subsystems as follows:

[(R0RS1)(R0RS|S|)][(RS1RN+1)(RS|S|RN+1)]

The reduced system in (14) will be parallel to other similar reduced systems corresponding to other disjoint subsets of {1, …, N }. Consequently, the contribution of S to the system outage probability can be captured by the following probability:

QS1[1nSp0,n][1nSpn,N+1]
where (10) was invoked followed by (11).

Based on the notation in (15), the probabilities in (12) and (13) can be written as Pout(1)=Q{1}Q{2} and Pout(2)=Q{1,2}, respectively.

3.1.3. N = 3 relays

Conditioning on the three RF inter-relay links R1-R2, R1-R3 and R2-R3, the system outage probability can be expanded as follows:

Pout=p1,2p1,3p2,3Pout(1)+(1p1,2)p1,3p2,3Pout(2)+p1,2(1p1,3)p2,3Pout(3)+p1,2p1,3(1p2,3)Pout(4)+(1p1,2)(1p1,3)p2,3Pout(5)+(1p1,2)p1,3(1p2,3)Pout(6)+p1,2(1p1,3)(1p2,3)Pout7+(1p1,2)(1p1,3)(1p2,3)Pout(8)

(i) Pout(1): In this case, all inter-relay links are in outage (the system reduces to the conventional parallel-relaying system). Consequently, the system will be in outage if the three parallel links R0-R1-R4, R0-R2-R4 and R0-R3-R4 are in outage implying that Pout(1)=Q{1}Q{2}Q{3} based on (15). (ii) Pout(2): In this case, R1 and R2 can be combined into a single node and the system can be broken down into two parallel subsystems: {[(R0-R1)∥(R0-R2)]⇌[(R1-R4)∥(R2-R4)]} ∥[(R0-R3)⇌(R3-R4)] implying that Pout(2)=Q{1,2}Q{3}. Similarly, Pout(3)=Q{1,3}Q{2} and Pout(4)=Q{2,3}Q{1}. (iii) Pout(5): In this case, the links R1-R2 and R1-R3 are not in outage. In other words, if an information packet is successfully received at R1 from S, then this packet will be successfully forwarded to R2 and R3 along the links R1-R2 and R1-R3. On the other hand, if the packet is available at R2, then it will be successfully forwarded to R1 and R3 along the links R2-R1 and subsequently R1-R3. Finally, a packet available at R3 will be available to all other relays through the links R3-R1 and R1-R2. Therefore, all relays can be combined into a single node implying that Pout(5)=Q{1,2,3}. Similarly, Pout(6)=Pout(7)=Pout(8)=Q{1,2,3} since, in all of the corresponding cases, all of the relays are interconnected and, hence, can be combined into a single node.

3.1.4. Any number of relays

The N relays are interconnected by the (N2) RF links Rn-Rn for (n, n′) ∈ {1, …, N}2 with n < n′. We define the (N2)-dimensional vector F as follows:

F[f1,2,,f1,N,f2,3,,f2,N,,fN1,N]
where fn,n indicates the status of the RF inter-relay link Rn-Rn with:
fn,n={0,link Rn-Rnin outage;1,link Rn-Rnnot in outage.

Based on the above notation, the system outage probability can be expanded as follows:

Pout=F{0,1}(2N)π(F)m=1MQSm(F)
where the probability QSm(F) is given in (15) while π(F) = [π(f1,2),…, π(f1,N),…, π(fN−1,N)] with:
π(fn,n)={pn,n,fn,n=0;1pn,n,fn,n=1.
where pn,n is the outage probability of the RF link Rn-Rn that can be determined from (7) or (8).

In (19), the sets S1(F),,SM(F) correspond to a partitioning of the set {1, …, N. This partitioning depends on the value of the vector F and is determined such that:

(n,n)Sm(F)×Sm(F)(withmm):fn,n=0
implying that all RF links connecting elements of Sm(F) to elements of Sm(F) are in outage. In an equivalent way, elements n and n′ of the same subset Sm(F) satisfy the following relation:
(n,n)Sm(F)×Sm(F)(withnn):KSm(F)|fn,K1=fK1,K2==fK|K|,n=1
implying that Rn and Rn are successfully connected through the |K| intermediate relays RK1,,RK|K|where Ki is the i-th element of K.

Based on the above partitioning, all relays whose indices fall in Sm(F)can be combined into a single node resulting in the outage probability QSm(F). In this context, depending on the specific value of F, the system can be reduced into M parallel systems whose outage probabilities can be multiplied.

  • Example-1: For evaluating Pout(4) in (16), F = [0, 0, 1] implying that the set {1, 2, 3} is partitioned as {1} ∪ {2, 3} in this case since f1,2 = f1,3 = 0.
  • Example-2: Consider the case N = 8 where the nonzero elements of F are given by: f1,2 = f1,3 = f2,5 = f4,6 = 1. In this case, the set {1, …, 8} must be partitioned as S1(F)={1,2,3,5}, S2(F)={4,6}, S3(F)={7} and S4(F)={8}. Consider the two elements (n, n′) of S1(F). (i): For (n, n′) = (1, 2), f1,2 = 1 implying that the link R1-R2 is not in outage and that these relays are directly connected. The same holds for (n, n′) = (1, 3) and (n, n′) = (2, 5). (ii): For (n, n′) = (1, 5), f1,2 = f2,5 = 1 implying that R1 and R5 are connected through R2 even though the link R1-R5 is in outage (f1,5 = 0). The same holds for (n, n′) = (2, 3) where R2 and R3 are connected though R1: f2,1 = f1,3 = 1 (note that fi,j = fj,i following from the reciprocity of the channel). (iii): For (n, n′) = (3, 5), f3,1 = f1,2 = f2,5 = 1 implying that R3 and R5 are successfully connected to each other through the pair of relays R1 and R2.
  • Example-3: If F contains more than (N12) nonzero elements, then all relays can be combined in one node implying that the last term in (19) simplifies to Q{1,…,,N}. For example, for N = 3, Pout(5)=Pout(6)=Pout(7)=Q{1,2,3} in (16) since the corresponding F vectors contain 2 nonzero elements each while Pout(8)=Q{1,2,3} since the corresponding F vector contains 3 nonzero elements.

3.2. Upper-bound on the system outage probability

While (19) provides the exact system outage probability, it suffers from the limitation of expressing the outage probability as the summation of 2(N2) terms. In this context, the number of summands increases very rapidly with N resulting in intractable outage probability expressions. Moreover, these summands can not be evaluated in a straightforward manner since they involve the partitioning of the N relays. This motivates providing a simpler expression that serves as an upper-bound to Pout. As will be explained later in Section 3.3, the proposed bound will be particularly useful for carrying out an asymptotic analysis and evaluating the diversity gain.

One of the most popular methods for the reliability evaluation of complex systems is the cut-set method [14]. In reliability theory, a cut-set is defined as “the set of components whose failure alone will cause the system failure” [14]. For the communication problem at hand, a cut-set can be equivalently defined as the set of links whose outage alone will cause the system outage. A cut-set is said to be minimal if it does not contain any subset of links whose outage alone will cause the system outage. Once the minimal cut-sets denoted by C1, …, Cm are identified, the union bound can be invoked and the system outage probability Pout = Pr ((C1 in outage) ∪ ⋯ ∪ (Cm in outage)) can be upper-bounded as:

PoutPU.B.i=1mPr(Ciin outage)

For simple systems, a visual inspection is sufficient for identifying the minimal cut-sets. For example, for N = 2, the minimal cut-sets are given by {R0-R1,R0-R2}, {R1-R3,R2-R3}, {R0-R1,R1-R2,R2-R3} and {R0-R2,R1-R2,R1-R3} implying that:

PU.B.=p0,1p0,2+p1,3p2,3+p0,1p1,2p2,3+p0,2p1,2p1,3

For complex systems (in our case, networks with large number of relays), several algorithms exist for computing the minimal cut-sets; the most famous among these is probably the MOCUS algorithm [15]. An efficient implementation of MOCUS that is based on data-structures was discussed in [16].

Based on the cut-set algorithm, the sought upper-bound can be expressed as:

PU.B.=n=0Ni=1(Nn)[jn,ipj,N+1][j¯n,ip0,j][jn,i;j¯n,ipj,j]
where n,1,,n,( nN) are all possible subsets of {1, …, N} having n elements each while ¯n,i={1,,N}\n,i.

The expression in (25) originates from identifying the 2N possible minimal cut-sets as follows. Consider the minimal cut-set comprising the links {Rj-D}jn,i for a certain subset n,i of the relays. Evidently, being elements of a cut-set, these links must be in outage resulting in the first term in (25). Now since the links {Rj-D}j¯n,i are not in outage (by construction), then the corresponding S-R links must in outage; otherwise, the information packet can be delivered along the corresponding two-hop S-R-D optical link resulting in no outage. Therefore, the links {S-Rj}j¯n,i must incontestably be included in the cut-set resulting in the second term in (25). Similarly, since the links {Rj-D}j¯n,i are not in outage, then the corresponding relays must not be able to successfully receive the packet from any other relay (along the RF links); otherwise, this packet will eventually reach D along the R-D optical link. Following from the failure of the links {S-Rj}j¯n,i (second term in (25)) the packet can reach Rj (forj¯n,i) only from the relay Rj for jn,i. Consequently, the links {Rj-Rj}jn,i;j¯n,i must be included in the cut-set resulting in the last term in (25).

Finally, the outage probability of the conventional parallel-relaying systems can be obtained by setting the third term in (25) to 1. In other words, this third term results from implementing the inter-relay cooperation along the RF links. Given that this term is the product of some outage probabilities and is hence less than or equal to 1, then it contributes to decreasing the system outage probability.

For example, for N = 4, while the exact outage probability in (19) comprises 2( 2N)=64 terms, the upper-bound in (25) comprises the 2N = 16 terms having the lowest orders and can be readily written as:

PU.B.=PU.B.(0)+PU.B.(1)+PU.B.(2)+PU.B.(3)+PU.B.(4)
where PU.B.(0)=p0,1p0,2p0,3p0,4 and PU.B.(4)=p1,5p2,5p3,5p4,5 while PU.B.(1), PU.B.(2), and PU.B.(3) take the following expressions:
PU.B.(1)=p1,5(p0,2p0,3p0,4)(p1,2p1,3p1,4)+p2,5(p0,1p0,3p0,4)(p2,1p2,3p2,4)+p3,5(p0,1p0,2p0,4)(p3,1p3,2p3,4)+p4,5(p0,1p0,2p0,3)(p4,1p4,2p4,3)
PU.B.(2)=(p1,5p2,5)(p0,3p0,4)(p1,3p1,4p2,3p2,4)+(p1,5p3,5)(p0,2p0,4)(p1,2p1,4p3,2p3,4)+(p1,5p4,5)(p0,2p0,3)(p1,2p1,3p4,2p4,3)+(p2,5p3,5)(p0,1p0,4)(p2,1p2,4p3,1p3,4)+(p2,5p4,5)(p0,1p0,3)(p2,1p2,3p4,1p4,3)+(p3,5p4,5)(p0,1p0,2)(p3,1p3,2p4,1p4,2)
PU.B.(3)=(p1,5p2,5p3,5)p0,4(p1,4p2,4p3,4)+(p1,5p2,5p4,5)p0,3(p1,3p2,3p4,3)+(p1,5p3,5p4,5)p0,2(p1,2p3,2p4,2)+(p2,5p3,5p4,5)p0,1(p2,1p3,1p4,1)

3.3. Asymptotic analysis and diversity gain

From (25), the cardinalities of the sets n,i and ¯n,i are equal to n and Nn, respectively. Therefore, the summands in (25) correspond to the product of N + n (Nn) outage probability terms for the values of n ranging between 0 and N. Moreover, N of these terms correspond to the S-R and R-D optical links while the remaining n(Nn terms correspond to the R-R RF links.

Therefore, the dominant terms in the summation correspond to n = 0 and n = N comprising the product of N outage probabilities each. For n = 0, the set n,i=ϕ (the empty set) implying, from (25), that the corresponding probability is n=1Np0,n (since ¯n,i={1,,N} in this case). On the other hand, for n = N, n,i={1,,N} implying that the corresponding probability is n=1Npn,N+1 (since ¯n,i=ϕ in this case).

On the other hand, the remaining terms corresponding to n ∉ {0, N} contain at least N − 1 additional multiplicands that originate from the last product in (25). These multiplicands comprise the outage probabilities along the inter-relay RF links and result from the implementation of the proposed cooperation strategy. For large values of the SNR along the FSO and RF links, all of these additional terms can be ignored implying that the upper-bound in (25) can be approximated by n=1Np0,n+n=1Npn,N+1 which, from (9), results in:

PNetP0,N+1[n=1NP0,n+n=1NPn,N+1]
for large values of PM in (15) and of {Ω¯i,j}i,j=1i<jN in (7)(8).

In the absence of inter-relay cooperation, the last product in (25) is always equal to 1 implying that each summand comprises exactly N outage probability terms and, hence, non of these summands can be ignored. Following from [10], (25) can be factorized as:

PNet(0)p0,N+1n=1N[p0,n+pn,N+1]
where the superscript 0 refers to the conventional parallel-relaying scheme.

From [11], the FSO outage probability in (5) behaves asymptotically as PMζi,j showing that the diversity order along the FSO link Ri-Rj is equal to ζi,j=min{βi,j,ξi,j2} where βi,j and ξi,j are the parameters of the pdf in (1) that are related to the scintillation and pointing errors, respectively. Therefore, from (30), the diversity order that can be achieved by the proposed strategy is given by:

ζNet=ζ0,N+1+min{n=1Nζ0,n,n=1Nζn,N+1}
while, from (31), the diversity order of the parallel-relaying scheme is:
ζNet(0)=ζ0,N+1+n=1Nmin{ζ0,n,ζn,N+1}

Following from the fact that ζ0,n ≥ min { ζ0,n, ζn,N+1} and ζn,N+1 ≥ min {ζ0,n, ζn,N+1}, then n=1Nζ0,nn=1Nmin{ζ0,n,ζn,N+1} and n=1Nζn,N+1n=1Nmin{ζ0,n,ζn,N+1} implying that ζNetζNet(0).This highlights the capability of the proposed scheme in enhancing the network diversity order.

In this context, it is worth noting that no diversity gains are obtained only under the two following scenarios. (i):min {ζ0,n, ζn,N+1 } = ζ0,n for n = 1, …, N implying that all relays are closer to D and/or the pointing errors along all R-D links are small. In this case, ζNet=ζNet(0)=ζ0,N+1+n=1Nζ0,n. min {ζ0,n, ζn,N+1 } = ζn,N+1 for n = 1, …, N implying that all relays are closer to S and/or the pointing errors along all S-R links are small. In this case, ζNet=ζNet(0)=ζ0,N+1+n=1Nζn,N+1.

4. Numerical results

The refractive index structure constant and the attenuation constant are set to Cn2=1×1014 m−2/3 and σ = 0.44 dB/km. We also fix λ = 1550 nm and R = 1 bit per channel use (bpcu). all scenarios, the distance between S and D is d0,N+1 = 3 km. We assume that the SNRs along the RF links are the same: Ω¯i,jΩ for all i, j ∈ {1, …, N } with i < j. Regarding the FSO links, the receiver radius, beam waist and pointing error displacement standard deviation are assumed to be the same for all links and they will be denoted by a, ωz and σs, respectively. In what follows, we set σs/a = 3. The values of ωz/a will be varied in the simulations where large values of this ratio indicate less pointing errors. For simplicity of notation, we define dn(d0,n,dn,N+1) where all distances are expressed in km.

Fig. 2 shows the performance with 2, 4 and 6 relays in the absence of pointing errors (ωz/a → ∞). We assume that all RF links are subject to Rayleigh fading and we highlight the impact of changing the RF SNR Ω. For N = 2, the relays are placed at d1 = (1.5, 2.5) and d2 = (2.5, 1.5). For N = 4, two additional relays are added at d3 = (1.25, 2.25) and d4 = (2, 1). For N = 6, two extra relays are placed at d5 = (1.5, 1.5 and d6 = (2.25, 1.25). Results highlight the enhanced performance levels and diversity orders that are achieved by the proposed scheme for different numbers of relays. For N = 2 at an outage probability of 10−10, the proposed cooperation strategy outperforms parallel-relaying [9, 10] by about 0.88 dB, 2.25 dB and 3.15 dB for Ω = 10 dB, Ω = 20 dB and Ω = 30 dB, respectively. For N = 4 and N = 6, results show that the performance does not improve by increasing Ω beyond 20 dB and 10 dB, respectively. This is justified by the fact that at least N − 1 RF outage probability terms multiply each FSO outage probability term as highlighted in Section 3.3. In this context, even if the individual RF outage probabilities are not very small, their multiplication will result in a (N – 1)-fold decrease which is more significant for large values of N. In this scenario, small RF SNRs are sufficient for attaining the full potential of the inter-relay RF links.

 figure: Fig. 2

Fig. 2 Performance of the proposed scheme with 2, 4 and 6 relays. Solid lines correspond to the exact outage probability while the associated dotted lines correspond to the upper-bound. The same markers are used for both the exact outage probability and its corresponding upper-bound.

Download Full Size | PDF

As highlighted in Fig. 2, activating the RF links results in significant diversity gains even with 6-relay systems that initially profit from high diversity orders with parallel-relaying. As predicted by (32) and (33), the diversity order increases from 18.95 to 25.75 by fully exploiting the presence of the RF links according to the proposed cooperation strategy. Finally, results highlight the accuracy of the upper-bound in (25) in predicting the performance for average-to-large values of the SNR. In fact, the proposed bound is extremely close to the exact outage probability and, under the different scenarios, the approximate and exact curves are barely distinguishable for outage probabilities below 10−3.

Fig. 3 shows the performance with 3 and 5 relays in the cases ωz/a = 12 and ωz/a = 25. The SNR along all RF links is fixed to Ω = 20 dB. For N = 3, the relays are placed at d1 = (1.5, 2.5), d2 = (1, 2) and d3 = (2.5, 1.5). In this case, all RF links are assumed to be subject to Rayleigh fading. For N = 5, two relays are added at d4 = (1.45, 2.55) and d5 = (2.55, 1.45). Given the proximity between R1 and R4 on one hand and between R3 and R5 on the other hand, the channel gains of the RF links R1-R4 and R3-R5 are taken to follow the Rician distribution with K1,4 = K3,5 = 10. Results show that significant performance gains can be obtained under different misalignment-fading conditions. For N = 5 at an outage probability of 10−10, the performance gains with respect to the parallel-relaying scheme are in the order of 1.8 dB and 2 dB for ωz/a = 12 and ωz/a = 25, respectively. As in Fig. 2, results highlight the close match between the exact outage probability and the proposed upper-bound. For N = 3, the diversity order is enhanced from 8.2 in the absence of inter-relay cooperation to 9.78 and 10.88 in the presence of inter-relay cooperation for ωz/a = 12 and ωz/a = 25, respectively.

 figure: Fig. 3

Fig. 3 Performance of the proposed scheme with 3 and 5 relays. Solid lines correspond to the exact outage probability while the associated dotted lines correspond to the upper-bound. The same markers are used for both the exact outage probability and its corresponding upper-bound.

Download Full Size | PDF

5. Conclusion

The presence of the backup RF links constitutes an additional degree of freedom that can be exploited for enhancing the performance of relay-assisted FSO systems. In this work, the RF links are used for establishing R-R communications and reducing the system outage probability in a simple and efficient manner. Both exact and asymptotic performance evaluations reflected the significant gains that can be achieved by the proposed cooperation strategy.

References and links

1. S. Bloom and W. S. Hartley, “The last-mile solution: hybrid FSO radio,” Whitepaper, AirFiber Inc, (2002).

2. A. Akbulut, H. G. Ilk, and F. Ari, “Design, availability and reliability analysis on an experimental outdoor FSO/RF communication system,” in Proc. 7th IEEE Int. Conf. on Transparent Optical Networks (ICTON), 403–406 (2005).

3. M. Usman, H.-C. Yang, and M.-S. Alouini, “Practical switching-based hybrid FSO/RF transmission and its performance analysis,” IEEE Photonics J. 6(5), 1–13 (2014) [CrossRef]  .

4. W. Zhang, S. Hranilovic, and C. Shi, “Soft-switching hybrid FSO/RF links using short-length raptor codes: design and implementation,” IEEE J. Sel. Areas Commun. 27(9), 1698–1708 (2009) [CrossRef]  .

5. A. AbdulHussein, A. Oka, T. T. Nguyen, and L. Lampe, “Rateless coding for hybrid free-space optical and radio-frequency communication,” IEEE Trans. on Wireless Commun. 9(3), 907–913 (2010) [CrossRef]  .

6. E. Zedini, H. Soury, and M.-S. Alouini, “On the performance analysis of dual-hop mixed FSO/RF systems,” IEEE Trans. on Wireless Commun. 15(5), 3679–3689 (2016) [CrossRef]  .

7. M. I. Petkovic, A. M. Cvetkovic, G. T. Djordjevic, and G. K. Karagiannidis, “Partial relay selection with outdated channel state estimation in mixed RF/FSO systems,” J. Lightwave Technol. 33(13), 2860–2867 (2015) [CrossRef]  .

8. V. Jamali, D. S. Michalopoulos, M. Uysal, and R. Schober, “Link allocation for multiuser systems with hybrid RF/FSO backhaul: Delay-limited and delay-tolerant designs,” IEEE Trans. on Wireless Commun. 15(5), 3281–3295 (2016) [CrossRef]  .

9. M. Safari and M. Uysal, “Relay-assisted free-space optical communication,” IEEE Trans. on Wireless Commun. 7(12), 5441–5449 (2008) [CrossRef]  .

10. C. Abou-Rjeily, “Performance analysis of FSO communications with diversity methods: Add more relays or more apertures?” IEEE J. Sel. Areas Commun. 33(9), 1890–1902 (2015) [CrossRef]  .

11. C. Abou-Rjeily and Z. Noun, “Impact of inter-relay cooperation on the performance of FSO systems with any number of relays,” IEEE Trans. on Wireless Commun. 15(6), 3796–3809 (2016) [CrossRef]  .

12. H. Sandalidis, T. Tsiftsis, and G. Karagiannidis, “Optical wireless communications with heterodyne detection over turbulence channels with pointing errors,” J. Lightwave Technol. 27(20), 4440–4445 (2009) [CrossRef]  .

13. W. Limpakom, Y.-D. Yao, and H. Man, “Outage probability analysis of wireless relay and cooperative networks in Rician fading channels with different K-factors,” in Proc. 69th IEEE Vehicular Tech. Conf. (VTC-Spring), 1–5 (2009).

14. R. Billinton and R. N. Allan, Reliability evaluation of power systems. Springer Science & Business Media, 2nd ed. (Springer, 2013).

15. J. Fussell and W. Vesely, “New methodology for obtaining cut sets for fault trees,” Trans. Amer. Nucl. Soc. 15, 262–263 (1972).

16. A. Rauzy, “Toward an efficient implementation of the MOCUS algorithm,” IEEE Trans. on Reliability 52(2), 175–180 (2003) [CrossRef]  .

Cited By

Optica participates in Crossref's Cited-By Linking service. Citing articles from Optica Publishing Group journals and other participating publishers are listed here.

Alert me when this article is cited.


Figures (3)

Fig. 1
Fig. 1 A cooperative FSO network with three RF inter-connected relays.
Fig. 2
Fig. 2 Performance of the proposed scheme with 2, 4 and 6 relays. Solid lines correspond to the exact outage probability while the associated dotted lines correspond to the upper-bound. The same markers are used for both the exact outage probability and its corresponding upper-bound.
Fig. 3
Fig. 3 Performance of the proposed scheme with 3 and 5 relays. Solid lines correspond to the exact outage probability while the associated dotted lines correspond to the upper-bound. The same markers are used for both the exact outage probability and its corresponding upper-bound.

Equations (33)

Equations on this page are rendered with MathJax. Learn more.

f I i , j ( I ) = α i , j β i , j ξ i , j 2 A i , j I i , j ( l ) Γ ( α i , j ) Γ ( β i , j ) G 1 , 3 3 , 0 [ α i , j β i , j A i , j I i , j ( l ) I | ξ i , j 2 ξ i , j 2 1 , α i , j 1 , β i , j 1 ]
α i , j = [ exp ( 0.49 σ R , i , j 2 / ( 1 + 1.11 σ R , i , j 12 / 5 ) 7 / 6 ) 1 ] 1
β i , j = [ exp ( 0.51 σ R , i , j 2 / ( 1 + 0.69 σ R , i , j 12 / 5 ) 5 / 6 ) 1 ] 1
γ i , j = γ ¯ 0 , N + 1 ( ξ 0 , N + 1 2 + 1 A 0 , N + 1 I 0 , N + 1 ( l ) ξ 0 , N + 1 2 ) 2 ( I i , j N link ) 2
p i , j = F I i , j ( N link P M A 0 , N + 1 I 0 , N + 1 ( l ) ξ 0 , N + 1 2 ξ 0 , N + 1 2 + 1 )
F I i , j ( I ) = ξ i , j 2 Γ ( α i , j ) Γ ( β i , j ) G 2 , 4 3 , 1 [ α i , j β i , j A i , j I i , j ( i ) I | 1 , ξ i , j 2 + 1 ξ i , j 2 , α i , j , β i , j , 0 ]
p i , j = 1 exp ( Ω t h Ω i , j )
p i , j = 1 Q 1 ( 2 K i , j , 2 ( K i , j + 1 ) Ω t h Ω ¯ i , j )
P Net = p 0 , N + 1 P out
( 1 P ( R i R j )   ( R j R k ) ) = ( 1 p i , j ) ( 1 p j , k )
P ( R i R j )   ( R i R k ) = p i , j p j , k
P out ( 1 ) = [ 1 ( 1 p 0 , 1 ) ( 1 p 1 , 3 ) ] [ 1 ( 1 p 0 , 2 ) ( 1 p 2 , 3 ) ]
P out ( 2 ) = 1 ( 1 p 0 , 1 p 0 , 2 ) ( 1 p 1 , 3 p 2 , 3 )
[ ( R 0 R S 1 ) ( R 0 R S | S | ) ] [ ( R S 1 R N + 1 ) ( R S | S | R N + 1 ) ]
Q S 1 [ 1 n S p 0 , n ] [ 1 n S p n , N + 1 ]
P out = p 1 , 2 p 1 , 3 p 2 , 3 P out ( 1 ) + ( 1 p 1 , 2 ) p 1 , 3 p 2 , 3 P out ( 2 ) + p 1 , 2 ( 1 p 1 , 3 ) p 2 , 3 P out ( 3 ) + p 1 , 2 p 1 , 3 ( 1 p 2 , 3 ) P out ( 4 ) + ( 1 p 1 , 2 ) ( 1 p 1 , 3 ) p 2 , 3 P out ( 5 ) + ( 1 p 1 , 2 ) p 1 , 3 ( 1 p 2 , 3 ) P out ( 6 ) + p 1 , 2 ( 1 p 1 , 3 ) ( 1 p 2 , 3 ) P out 7 + ( 1 p 1 , 2 ) ( 1 p 1 , 3 ) ( 1 p 2 , 3 ) P out ( 8 )
F [ f 1 , 2 , , f 1 , N , f 2 , 3 , , f 2 , N , , f N 1 , N ]
f n , n = { 0 , link R n - R n in outage ; 1 , link R n - R n not in outage .
P out = F { 0 , 1 } ( 2 N ) π ( F ) m = 1 M Q S m ( F )
π ( f n , n ) = { p n , n , f n , n = 0 ; 1 p n , n , f n , n = 1 .
( n , n ) S m ( F ) × S m ( F ) ( with m m ) : f n , n = 0
( n , n ) S m ( F ) × S m ( F ) ( with n n ) : K S m ( F ) | f n , K 1 = f K 1 , K 2 = = f K | K | , n = 1
P out P U . B . i = 1 m Pr ( C i in outage )
P U . B . = p 0 , 1 p 0 , 2 + p 1 , 3 p 2 , 3 + p 0 , 1 p 1 , 2 p 2 , 3 + p 0 , 2 p 1 , 2 p 1 , 3
P U . B . = n = 0 N i = 1 ( N n ) [ j n , i p j , N + 1 ] [ j ¯ n , i p 0 , j ] [ j n , i ; j ¯ n , i p j , j ]
P U . B . = P U . B . ( 0 ) + P U . B . ( 1 ) + P U . B . ( 2 ) + P U . B . ( 3 ) + P U . B . ( 4 )
P U . B . ( 1 ) = p 1 , 5 ( p 0 , 2 p 0 , 3 p 0 , 4 ) ( p 1 , 2 p 1 , 3 p 1 , 4 ) + p 2 , 5 ( p 0 , 1 p 0 , 3 p 0 , 4 ) ( p 2 , 1 p 2 , 3 p 2 , 4 ) + p 3 , 5 ( p 0 , 1 p 0 , 2 p 0 , 4 ) ( p 3 , 1 p 3 , 2 p 3 , 4 ) + p 4 , 5 ( p 0 , 1 p 0 , 2 p 0 , 3 ) ( p 4 , 1 p 4 , 2 p 4 , 3 )
P U . B . ( 2 ) = ( p 1 , 5 p 2 , 5 ) ( p 0 , 3 p 0 , 4 ) ( p 1 , 3 p 1 , 4 p 2 , 3 p 2 , 4 ) + ( p 1 , 5 p 3 , 5 ) ( p 0 , 2 p 0 , 4 ) ( p 1 , 2 p 1 , 4 p 3 , 2 p 3 , 4 ) + ( p 1 , 5 p 4 , 5 ) ( p 0 , 2 p 0 , 3 ) ( p 1 , 2 p 1 , 3 p 4 , 2 p 4 , 3 ) + ( p 2 , 5 p 3 , 5 ) ( p 0 , 1 p 0 , 4 ) ( p 2 , 1 p 2 , 4 p 3 , 1 p 3 , 4 ) + ( p 2 , 5 p 4 , 5 ) ( p 0 , 1 p 0 , 3 ) ( p 2 , 1 p 2 , 3 p 4 , 1 p 4 , 3 ) + ( p 3 , 5 p 4 , 5 ) ( p 0 , 1 p 0 , 2 ) ( p 3 , 1 p 3 , 2 p 4 , 1 p 4 , 2 )
P U . B . ( 3 ) = ( p 1 , 5 p 2 , 5 p 3 , 5 ) p 0 , 4 ( p 1 , 4 p 2 , 4 p 3 , 4 ) + ( p 1 , 5 p 2 , 5 p 4 , 5 ) p 0 , 3 ( p 1 , 3 p 2 , 3 p 4 , 3 ) + ( p 1 , 5 p 3 , 5 p 4 , 5 ) p 0 , 2 ( p 1 , 2 p 3 , 2 p 4 , 2 ) + ( p 2 , 5 p 3 , 5 p 4 , 5 ) p 0 , 1 ( p 2 , 1 p 3 , 1 p 4 , 1 )
P Net P 0 , N + 1 [ n = 1 N P 0 , n + n = 1 N P n , N + 1 ]
P Net ( 0 ) p 0 , N + 1 n = 1 N [ p 0 , n + p n , N + 1 ]
ζ Net = ζ 0 , N + 1 + min { n = 1 N ζ 0 , n , n = 1 N ζ n , N + 1 }
ζ Net ( 0 ) = ζ 0 , N + 1 + n = 1 N min { ζ 0 , n , ζ n , N + 1 }
Select as filters


Select Topics Cancel
© Copyright 2024 | Optica Publishing Group. All rights reserved, including rights for text and data mining and training of artificial technologies or similar technologies.