ArticlePDF Available

Impact of Opportunistic Scheduling on Cooperative Dual-Hop Relay Networks

Authors:

Abstract and Figures

This letter advocates the performance of a multiuser relay network (MRN) equipped with a single amplify-and-forward (AaF) relay over Rayleigh fading environments. We derive new expressions for the cumulative distribution function (CDF) of the highest instantaneous end-to-end signal-to-noise ratio (SNR) taking into consideration the two cases of fixed gain relays and variable gain relays. Relying on these statistical results, we derive new expressions for the outage probability and symbol error rate (SER), both of which are obtained in exact closed form. Furthermore, we derive simple asymptotic outage probability and SER. Our asymptotic results confirm that opportunistic scheduling has no impact on the diversity order. We further prove that the array gain is what determines the SNR advantage of opportunistic scheduling over the single user scenario.
Content may be subject to copyright.
IEEE TRANSACTIONS ON COMMUNICATIONS, VOL. 59, NO. 3, MARCH 2011 689
Impact of Opportunistic Scheduling on
Cooperative Dual-Hop Relay Networks
Nan Yang, Student Member, IEEE, Maged Elkashlan, Member, IEEE, and Jinhong Yuan, Member, IEEE
Abstract—This letter advocates the performance of a multiuser
relay network (MRN) equipped with a single amplify-and-
forward (AaF) relay over Rayleigh fading environments. We
derive new expressions for the cumulative distribution function
(CDF) of the highest instantaneous end-to-end signal-to-noise
ratio (SNR) taking into consideration the two cases of xed
gain relays and variable gain relays. Relying on these statistical
results, we derive new expressions for the outage probability
and symbol error rate (SER), both of which are obtained in
exact closed form. Furthermore, we derive simple asymptotic
outage probability and SER. Our asymptotic results conrm that
opportunistic scheduling has no impact on the diversity order.
We further prove that the array gain is what determines the
SNR advantage of opportunistic scheduling over the single user
scenario.
Index Terms—Cooperative transmission, fading channels, op-
portunistic scheduling.
I. INTRODUCTION
DEPLOYMENT of wireless relays in cooperative trans-
mission has recently appeared as an efcient alterna-
tive to extend coverage and combat multipath impairment
in wireless networks [1–3]. Among the proposed cooperative
strategies [3,4], amplify-and-forward (AaF) attracts consid-
erable attention due to its ease of implementation and low
power consumption. In AaF, the relay simply amplies the
received signal from the source and retransmits a scaled copy
of the signal to the destination. As a further categorization,
AaF relays can be classied into two subcategories based
on the channel state information (CSI) available at the relay:
namely variable gain relays and xed gain relays. Driven by
the potential application of such wireless relays, some seminal
works have examined the end-to-end performance of point-to-
point dual-hop links (i.e., single source and single destination
with single relay usage) [5, 6].
In point-to-multipoint multiuser applications, for example
the case of a cellular system, the base station can select the
mobile user with the strongest channel in a time/frequency
Paper approved by W. Yu, the Editor for Cooperative Communications and
Relaying of the IEEE Communications Society. Manuscript received June 2,
2010; revised October 8, 2010.
N. Yang is with the School of Information and Electronics, Beijing Institute
of Technology, Beijing 100081, China, and with the School of Electrical En-
gineering and Telecommunications, University of New South Wales, Sydney,
NSW 2052, Australia (e-mail: nan.yang@student.unsw.edu.au).
M. Elkashlan is with the Wireless Technologies Laboratory, CSIRO ICT
Centre, Marseld, NSW 2122, Australia, and with the School of Electrical
Engineering and Telecommunications, University of New South Wales, Syd-
ney, NSW 2052, Australia (e-mail: maged.elkashlan@csiro.au).
J. Yuan is with the School of Electrical Engineering and Telecommu-
nications, University of New South Wales, Sydney, NSW 2052, Australia,
and with CSIRO ICT Centre, Marseld, NSW 2122, Australia (e-mail:
j.yuan@unsw.edu.au).
Digital Object Identier 10.1109/TCOMM.2011.122110.100133
Fig. 1. Illustrative system model for point-to-multipoint dual-hop links.
bin to schedule data transmission. This strategy, which has
come to be known as opportunistic scheduling [7–9], can
provide a potentially large performance improvement if ef-
ciently utilized. More recently, the concept of cooperative
dual-hop transmission has been applied to multiuser wireless
downlinks [10, 11]. One example of this is point-to-multipoint
dual-hop links where a source (or equivalently base station)
communicates with many remote and/or geographically scat-
tered destinations (or equivalently mobile users) via a single
or multiple relays, as shown in Fig. 1. A few works have been
conducted on this architecture [12–15], the results from which
have focused only on the capacity and/or throughput perfor-
mance from the information-theoretic perspective. Despite the
demonstrated promised gains of wireless relay networks, the
impact of opportunistic scheduling on these networks has not
been thoroughly investigated and is not fully understood.
Motivated by this, we focus our attention on the bene-
ts conferred by opportunistic scheduling in relay-assisted
networks. In this letter, we refer to the system architecture
depicted in Fig. 1 as a multiuser relay network (MRN).
Assuming Rayleigh fading channels, we derive new closed-
form expressions for the outage probability and symbol error
rate (SER) for xed and variable gain relays. In doing so, exact
expressions are derived for the cumulative distribution func-
tion (CDF) of the highest end-to-end SNR link associated with
the strongest destination. We further derive simple closed-form
expressions for the diversity order and array gain. We prove
that opportunistic scheduling does not affect the diversity
order, rather it increases the array gain and hence reduces
the SER. Finally, we demonstrate that increasing the number
of destinations shifts the optimal relay location towards the
source. In particular, we nd that the shift in the optimal relay
location is considerable for variable gain relaying, however,
less noticeable for xed gain relaying.
II. PRELIMINARIES AND SYSTEM MODEL
Consider a wireless relay-assisted communication system
shown in Fig. 1. A source communicates with 𝐾destinations
0090-6778/11$25.00 c
2011 IEEE
690 IEEE TRANSACTIONS ON COMMUNICATIONS, VOL. 59, NO. 3, MARCH 2011
with the aid of a single AaF relay. The source has no direct
link with the destinations and the transmission is performed
only via the relay in a time-division multiple access (TDMA)
fashion with two signaling intervals. The source transmits its
data signal to the relay in a signaling interval, and in the
following signaling interval, the relay retransmits the amplied
signal to only one destination which has the most favorable
end-to-end channel quality.
Let the modulated signal transmitted by the source denoted
as 𝑠(𝑡). The received signal at the 𝑘th destination is given by
𝑦𝑘(𝑡)=𝐸RD𝑑𝜂
RD𝑔𝑘𝐺𝐸SR 𝑑𝜂
SRℎ𝑠(𝑡)+𝑛𝑟+𝑛𝑑𝑘,
(1)
where 𝐸SR and 𝐸RD denote the average symbol energies at
the source and the relay, respectively, and and 𝑔𝑘represent
the channel complex fading coefcients between the source
and relay, and between the relay and the 𝑘th destination,
respectively. The symbols 𝑛𝑟and 𝑛𝑑𝑘represent the additive
white Gaussian noise (AWGN) components with one-sided
power spectral density 𝑁0at the relay and the 𝑘th destination,
respectively. 𝐺is dened as the scaling gain applied at the
relay. In this letter, the path loss is incorporated in the signal
propagation, where 𝑑SR is the distance between the source
and the relay, 𝑑RD is the distance between the relay and the
destinations, and 𝜂is the path loss exponent. Here we assume
that all destinations are equidistant from the relay, and hence
𝑑RD is constant for all destinations. The instantaneous end-to-
end SNR of the 𝑘th destination, 𝛾eq,𝑘, can be written as [5]
𝛾eq,𝑘 =𝛾1𝛾2,𝑘
𝛾2,𝑘 +1
𝐺2𝑁0
,(2)
where 𝛾1=2𝑑𝜂
SR𝐸SR/𝑁0and 𝛾2,𝑘 =𝑔𝑘2𝑑𝜂
RD𝐸RD /𝑁0
are the per-hop instantaneous SNRs associated with the chan-
nels and 𝑔𝑘. Correspondingly, the per-hop average SNR is
given by 𝛾1=E[𝛾1]and 𝛾2,𝑘 =E[𝛾2,𝑘], respectively, where
E[]is the expectation.
It is obvious from (2) that the choice of the relay gain
determines the instantaneous end-to-end SNR. Note that the
channel estimation error is inversely proportional to the input
SNR [16]. As such, when the source-relay link has a low
SNR, a xed gain constraint of 𝐺2=1/(𝐶𝑁0)is applied at
the relay, where 𝐶=𝛾1+1 is a positive constant [6]. This
xed gain relaying alleviates the requirement of full CSI while
offering a comparable performance to variable gain relaying.
The instantaneous end-to-end SNR of the 𝑘th destination
employing a xed gain relay can be rewritten as
𝛾eq,𝑘,Fix =𝛾1𝛾2,𝑘
𝛾2,𝑘 +𝐶.(3)
Another choice of the relay gain is variable gain relaying,
which is applied for the case when the source-relay link fading
coefcients are precisely estimated at the relay. When the
relay does not account for the statistical noise, the variable
gain constraint is given by 𝐺2=1/2𝑑𝜂
SR𝐸SR[5, 17].
The instantaneous end-to-end SNR of the 𝑘th destination
employing a variable gain relay can be rewritten as
𝛾eq,𝑘,Var =𝛾1𝛾2,𝑘
𝛾1+𝛾2,𝑘
.(4)
We assume that all the destinations are located in a ho-
mogeneous environment. In such an environment, the signals
from the relay to the 𝐾destinations experience independent
identically distributed (i.i.d.) Rayleigh fading where all the
destinations have the same per-hop average SNR, i.e., 𝛾2,𝑘 =
𝛾2. We also retain the practical consideration that the dual-
hop transmission is subject to independent but not necessarily
identically distributed (i.n.d.) Rayleigh fading, i.e., 𝛾1=𝛾2.
As a result, the per-hop instantaneous SNR, 𝑍={𝛾1,𝛾
2,𝑘},
follows an exponential distribution, with probability density
function (PDF) given by
𝑓𝑍(𝛾)= 1
𝛾𝑖
𝑒𝛾
𝛾𝑖,(5)
where 𝑖=1,2. The corresponding CDF of 𝑍can be written
as
𝐹𝑍(𝛾)=1𝑒𝛾
𝛾𝑖.(6)
III. EXACT PERFORMANCE ANALYSIS
Opportunistic scheduling in MRN is achieved by selecting
the destination with the highest end-to-end instantaneous SNR
out of 𝐾destinations, at any particular point in time. The
highest instantaneous end-to-end SNR of the selected user
(i.e., strongest user), denoted as 𝛾𝑠, is determined by
𝛾𝑠=max
1𝑘𝐾{𝛾eq,𝑘}.(7)
It is assumed that CSI knowledge of the relay-destination links
of the 𝐾users are available at the relay. At the relay, channel
estimation is conducted based on a pilot sequence sent by the
𝐾users. The relay identies and selects the strongest user.
The relay then feeds back the index of the strongest user to
the source.
A common metric for assessing the error performance is
the SER. In this letter, we adopt a CDF-based approach and
express the SER expression directly in terms of the CDF of
𝛾𝑠as [18]
𝑃𝑠=𝑎
2𝑏
𝜋
0
𝑒𝑏𝛾
𝛾𝐹𝛾𝑠(𝛾)𝑑𝛾. (8)
Our results in this section, apply for all general modulation
schemes that have an SER expression of the form 𝑃𝑠=
E𝑎𝑄 2𝑏𝛾,whereE[]is the statistical average operator.
Such modulation schemes include binary PSK (BPSK): 𝑎=1
and 𝑏=1, and quadrature PSK (QPSK): 𝑎=1and 𝑏=0.5.
A. Fixed Gain MRN
The outage probability 𝑃out is an important quality of
service measure, dened as the probability that 𝛾𝑠drops below
a certain specied SNR threshold 𝛾th. Considering MRN
equipped with a xed gain relay, we can write its outage
probability 𝑃out,Fix as
𝑃out,Fix =Pr[𝛾𝑠,Fix <𝛾
th]=𝐹𝛾𝑠,Fix (𝛾th),(9)
where 𝐹𝛾𝑠,Fix (𝛾th)is the CDF of the highest instantaneous
end-to-end SNR of the strongest user for xed gain relaying,
evaluated at 𝛾=𝛾th. To calculate the outage probability of
xed gain MRN, we rst obtain the CDF of 𝛾𝑠,Fix.
YANG et al.: IMPACT OF OPPORTUNISTIC SCHEDULING ON COOPERATIVE DUAL-HOP RELAY NETWORKS 691
Theorem 1: Since the CDF of each hop is given by (6), the
CDF of 𝛾𝑠,Fix can be expressed as
𝐹𝛾𝑠,Fix (𝛾)=1+2
𝐶𝛾
𝛾1𝛾2
𝑒𝛾
𝛾1
𝐾1
𝑖=0 𝐾
𝑖(1)𝐾𝑖
×𝐾𝑖𝐾12(𝐾𝑖)𝐶𝛾
𝛾1𝛾2,(10)
where 𝐾𝑣(𝑥)denotes the 𝑣th-order modied Bessel function
of the second kind.
Proof: See Appendix A.
Using (9) and (10), the outage probability of MRN with
xed gain relaying, 𝑃out,Fix, is obtained. In the special case
of single user dual-hop links, 𝑃out,Fix can be found by setting
𝐾=1in (10). This yields the same expression as that in [6,
eq. (9)].
Substituting (10) into (8), and using [19, eq. (6.614.5)], the
SER of xed gain MRN is obtained in closed form as
𝑃𝑠,Fix =𝑎
2+𝑎
2𝑏𝛾1
1+𝑏𝛾1
𝐾1
𝑖=0 𝐾
𝑖(1)𝐾𝑖𝑒𝜉
×𝜉(𝐾1(𝜉)𝐾0(𝜉)) ,(11)
where 𝜉=𝐶(𝐾𝑖)/2𝛾2(1 + 𝑏𝛾1). For the single user
scenario, the closed-form expression for 𝑃𝑠,Fix is found by
setting 𝐾=1in (11). Note that this result for single user
dual-hop links can also be derived using [6, eq. (10)]. Hence,
our result in (11) stands for a generalization of the single user
scenario.
By normalizing the total distance between the source and
the destinations to unity with 𝑑SR +𝑑RD =1and representing
𝛾1and 𝛾2with 𝑑SR,wend that 𝑃𝑠,Fix in (11) is a convex
function of 𝑑SR. As such, the optimal relay location aiming at
minimizing the SER can be found by setting the derivative of
𝑃𝑠,Fix with respect to 𝑑SR to zero. Although it is intractable
to nd a closed-form solution for this optimization problem,
the optimal relay location can be obtained via a simple line
search.
B. Variable Gain MRN
In this subsection, we analyze the performance of variable
gain MRN. The outage probability in this case is given by
𝑃out,Var =𝐹𝛾𝑠,Va r (𝛾th),(12)
where 𝐹𝛾𝑠,Var (𝛾)is the CDF of the highest instantaneous end-
to-end SNR of the strongest user for variable gain relaying.
Theorem 2: The CDF of each hop is shown in (6), and
consequently the CDF of 𝛾𝑠,Va r can be expressed as
𝐹𝛾𝑠,Var (𝛾)=1+ 2𝛾
𝛾1𝛾2
𝐾1
𝑖=0 𝐾
𝑖(1)𝐾𝑖𝐾𝑖
×𝑒𝛾(1
𝛾1+𝐾𝑖
𝛾2)𝐾12𝛾𝐾𝑖
𝛾1𝛾2.(13)
Proof: Following the algebraic steps specied in Ap-
pendix A, the nal result in (13) is derived.
The outage probability can be obtained by substituting (13)
into (12). Moreover, 𝑃out,Var for single user scenario can be
further simplied by setting 𝐾=1in (12). This result is the
same as that in [5, eq. (27)].
Substituting (13) into (8) and applying [20, eq. (2.16.1.3)],
the closed-form SER expression of variable gain MRN is
derived after some manipulations as
𝑃𝑠,Var =𝑎
2+𝑎
4𝑏𝛾1𝛾2
2Γ1
2Γ5
2𝐾1
𝑖=0 𝐾
𝑖(1)𝐾𝑖
×𝜏1
22𝐹11
4,3
4;2;14(𝐾𝑖)𝛾1𝛾2
𝜏2,(14)
where 𝜏=𝛾2(1 + 𝑏𝛾1)+𝛾1(𝐾𝑖),Γ(𝑥)represents the
gamma function, and 2𝐹1(𝑎, 𝑏;𝑐;𝑧)denotes the Gauss hy-
pergeometric function. For the single user scenario, 𝑃𝑠,Var
is obtained by substituting 𝐾=1into (14). We note that
this result for single user dual-hop links can also be derived
using [5, eq. (13)]. This demonstrates the accuracy and the
generality of our result in (14). Similar to xedgainMRN,
we can nd the optimal relay location for variable gain MRN.
IV. ASYMPTOTIC PERFORMANCE ANALYSIS
In this section, we derive asymptotic expressions for the
outage probability and SER. The new and relatively simple
expressions obtained are important to examine the effect of
opportunistic scheduling on the diversity order and array gain.
It was shown in [21] that the asymptotic SER can be derived
using the asymptotic outage probability. As such, we start our
analysis by characterizing the asymptotic outage probability,
followed by the asymptotic SER.
A. Fixed Gain MRN
To derive the asymptotic outage probability of xed gain
relaying, we rst note that 𝐶=1+𝛾1𝛾1as 𝛾1, 𝛾2→∞.
As such, at high SNRs, by setting 𝛾2=𝜅𝛾1and 𝛾1=𝛾th /𝜆
in (9), 𝑃out,Fix can be rewritten as
𝑃out,Fix =𝑃(𝜆)
=1+𝑒𝜆
𝐾1
𝑖=0 𝐾
𝑖(1)𝐾𝑖𝜔𝐾1(𝜔),(15)
where 𝜔=2
((𝐾𝑖)𝜆/𝜅)and 𝜆, 𝜅 +. By comparing
(9) and (15) we nd that the behavior of 𝑃out,Fix for large 𝛾1
and 𝛾2is equivalent to the behavior of 𝑃(𝜆)around 𝜆=0.
To proceed with our analysis we express the exponential and
Bessel functions in (15) in terms of the Taylor series expansion
around 𝜆=0. After further algebraic calculations, we obtain
𝑃(𝜆)=𝐴(𝜆)+𝐵(𝜆),(16)
where
𝐴(𝜆)=1+
𝐾1
𝑖=0 𝐾
𝑖(1)𝐾𝑖
𝑝=0
(𝜆)𝑝
𝑝!,(17)
and
𝐵(𝜆)=
𝐾1
𝑖=0 𝐾
𝑖(1)𝐾𝑖
𝑝=0
𝑞=0
(1)𝑝𝐾𝑖
𝜅𝑞+1
𝑝!𝑞!(𝑞+1)!
×𝜆𝑝+𝑞+1 ln (𝐾𝑖)𝜆
𝜅𝜓(𝑞+1)𝜓(𝑞+2)
,(18)
692 IEEE TRANSACTIONS ON COMMUNICATIONS, VOL. 59, NO. 3, MARCH 2011
where 𝜓(𝑥)is the psi function dened in [19, eq. (8.36.1)].
We next nd the rst nonzero derivative order of 𝐴(𝜆)and
𝐵(𝜆)and discard the higher order terms. After performing
some algebraic manipulations, we have
𝐴(𝜆)=𝜆+𝑜(𝜆),(19)
and
𝐵(𝜆)=𝜆
𝜅Ξ[𝐾]1+𝑜(𝜆),(20)
where Ξ[𝐾]1=𝐾1
𝑖=0 𝐾
𝑖(1)𝐾𝑖(𝐾𝑖)ln((𝐾𝑖)𝜆/𝜅).
By substituting 𝜆=𝛾th /𝛾1into (19) and (20), the asymp-
totic outage probability is derived as
𝑃
out,Fix =𝛾th
𝛾11+ 1
𝜅Ξ[𝐾]2+𝑜𝛾1
1,(21)
where Ξ[𝐾]2=𝐾1
𝑖=0 (𝐾
𝑖)(1)𝐾𝑖(𝐾𝑖)ln((𝐾𝑖)𝛾th /𝛾2)
and 𝜅=𝛾2/𝛾1.
Using (21), we perform some basic algebraic manipulations
to obtain the asymptotic SER expression given by
𝑃
𝑠,Fix =(𝐺𝑎,Fix𝛾1)𝐺𝑑,Fix +𝑜𝛾𝐺𝑑,Fix
1,(22)
where the diversity order is 𝐺𝑑,Fix =1and the array gain is
𝐺𝑎,Fix =𝑎
4𝑏+𝑎
4𝑏𝜅Ξ[𝐾]31,(23)
where Ξ[𝐾]3=𝐾1
𝑖=0 𝐾
𝑖(1)𝐾𝑖(𝐾𝑖)ln((𝐾𝑖)/𝛾2).
It is evident from (22) that for xed gain relaying, the diversity
order is not inuenced by opportunistic scheduling. However,
noting that Ξ[𝐾]3Ξ[𝐾+1]
3>0for any 𝐾,weverify
that Ξ[𝐾]3is a monotonically decreasing function of 𝐾.As
such, the effect of opportunistic scheduling is to improve
the array gain, thereby reducing the SER. In Section V, we
demonstrate that an SNR improvement of at least 10 dB is
achieved with opportunistic scheduling.
B. Variable Gain MRN
To derive the asymptotic outage probability of variable gain
relaying, we rst substitute 𝛾2=𝜅𝛾1and 𝛾1=𝛾th/𝜆 into
(12) to yield
𝑃out,Var =𝑄(𝜆)
=1 +
𝐾1
𝑖=0 𝐾
𝑖(1)𝐾𝑖𝑒𝜆𝜒
4𝜆𝜒𝐾1(𝜒),(24)
where 𝜒=2𝜆(𝐾𝑖/𝜅). Using the Taylor series expansion
of the exponential and Bessel functions, and following the
same algebraic steps as described in Section IV-A, we derive
the asymptotic outage probability as
𝑃
out,Var =𝛾th
𝛾11+ 1
𝜅+𝑜𝛾1
1,𝐾=1,
𝛾th
𝛾1+𝑜𝛾1
1,𝐾2,(25)
where 𝜅=𝛾2/𝛾1. By inserting (25) into (8), we derive the
asymptotic SER expression as
𝑃
𝑠,Var =(𝐺𝑎,Va r 𝛾1)𝐺𝑑,Var +𝑜𝛾𝐺𝑑,Va r
1,(26)
where the diversity order is 𝐺𝑑,Var =1and the array gain is
𝐺𝑎,Var =4𝑏𝜅
𝑎(1+𝜅),𝐾=1,
4𝑏
𝑎,𝐾2.(27)
The result in (26) conrms that for variable gain relaying,
opportunistic scheduling has no impact on the diversity order.
However, by inspecting (27), we see that the effect of oppor-
tunistic scheduling is to increase the array gain. This array
gain is as high as 18 dB, as we will show in Section V.
C. Fixed versus Variable Gain Relaying
We now compare the asymptotic SER of xed gain relaying
with that of variable gain relaying. We rst remark that both
xed gain relaying and variable gain relaying achieve the same
diversity order. The main fundamental difference between the
two relaying protocols lies in the array gain, which is indicated
by (23) and (27). To characterize this difference, we present
the ratio of their array gains as
𝐺𝑎,Fix
𝐺𝑎,Var
=𝛾1+𝛾2
𝛾2+𝛾1ln𝛾2,𝐾=1
𝛾2
𝛾2+𝛾1Ξ[𝐾]3,𝐾2.(28)
By observing (28), we nd that when 𝐾=1, the performance
gap between xed and variable gain relaying is determined by
the values of 𝛾1and 𝛾2.When𝐾2, the ratio tends towards
one for large 𝐾. This reveals that the performance of xed
gain relaying approaches that of variable gain relaying in the
large 𝐾limit.
V. N UMERICAL RESULTS
Numerical examples and simulations are carried out to
demonstrate the accuracy of our proposed analysis and the
effectiveness of opportunistic scheduling in Rayleigh fading
conditions. Throughout this section, we normalize the total
distance between the source and the destinations to unity such
that 𝑑SR +𝑑RD =1. The variance of the fading coefcients is
also normalized to unity with E2=1and E𝑔𝑘2=1.
Moreover, equal average energies are assumed at the source
and the relay, i.e., 𝐸SR =𝐸RD. Therefore, the rst hop and the
second hop average SNR attenuates by 𝑑𝜂
SR and (1 𝑑SR)𝜂,
respectively. In this section our results concentrate on 𝜂=4.
In addition, BPSK modulation is considered in all the gures.
Fig. 2 presents the outage probability for both xed and
variable gain relaying as a function of 𝛾th. The curves
are plotted for 𝐾=1 and 𝐾=5.Wend that the points
generated via Monte Carlo simulations match precisely with
the analytic curves, highlighting the accuracy of our analysis.
As expected, selecting the highest end-to-end SNR link in a
multiuser scenario (i.e., 𝐾=5) yields superior performance
compared to that of a single user scenario (i.e., 𝐾=1).
Fig. 3 presents the exact SER against 𝑑SR to investigate
the impact of the relay placement on the error performance.
For the single user scenario with 𝐾=1, we observe that the
optimal relay location for variable gain relaying is halfway
between the source and the destinations at 𝑑SR =0.5.
However, the optimal relay location for xed gain relaying
is at 𝑑SR =0.6. This can be explained by the fact that the
instantaneous end-to-end SNR of xed gain relaying given by
YANG et al.: IMPACT OF OPPORTUNISTIC SCHEDULING ON COOPERATIVE DUAL-HOP RELAY NETWORKS 693
0 10 20 30 40 50 60
0
0.1
0.2
0.3
0.4
0.5
0.6
0.7
0.8
0.9
1
Variable gain (from (12))
Fixed gain (from (9))
Simulation points
γ
K = 1
K = 5
P
out
th
Fig. 2. Outage probability of MRN for xed and variable gain relays:
𝐸SR/𝑁0=0dB,𝑑SR =0.4,and𝑑RD =0.6.
0.1 0.2 0.3 0.4 0.5 0.6 0.7 0.8 0.9
10−4
10−3
10−2
10−1
100
10−5
Variable gain (from (14))
Fixed gain (from (11))
Simulation points
dSR
P
s
K = 1, 2, 3
Fig. 3. Exact SER of MRN for xed and variable gain relays: 𝐸SR /𝑁0=
10 dB.
(3) is asymmetric caused by the constant 𝐶in the denominator.
For the multiuser scenario, we observe that the optimal relay
location is shifted towards the source. For example when
𝐾=3, the optimal relay location is shifted towards the source
at 𝑑SR =0.22 for variable gain relaying, and 𝑑SR =0.49
for xed gain relaying. It is evident that with the increasing
number of users, the shift in the optimal relay location is more
salient in variable gain relaying than xed gain relaying.
Figs. 4 and 5 present the SER of xed gain and variable
gain relaying, respectively, versus 𝐸SR/𝑁0for various 𝐾.
The exact SER and the asymptotic SER are compared. As
expected, the asymptotic expressions well approximate the
exact expressions in the high SNR regime. As predicted from
the asymptotic expressions in (22) for xed gain relaying
and (26) for variable gain relaying, we see that the diversity
order is unaffected by opportunistic scheduling. However, we
conrm that opportunistic scheduling has an obvious SNR
advantage over the single user scenario for both xed and
variable gain relaying, which is explicitly indicated by the
−20 −10 0 10 20 30 40 50 60
10−8
10−7
10−6
10−5
10−4
10−3
10−2
10−1
100
E
SR
/
N0
P
s
K = 1, 2, 3, 4
Exact performance (from (11))
Asymptotic performance (from (22))
10 dB
Fig. 4. Exact and asymptotic SER of MRN for xed gain relays: 𝑑SR =0.3
and 𝑑RD =0.7.
−20 −10 0 10 20 30 40 50 60
10−8
10−7
10−6
10−5
10−4
10−3
10−2
10−1
100
E
SR
/
N0
P
s
Exact performance (from (14))
Asymptotic performance (from (26))
K = 1, 2, 3, 4
18 dB
Fig. 5. Exact and asymptotic SER of MRN for variable gain relays: 𝑑SR =
0.3and 𝑑RD =0.7.
array gain expressions in (23) and (27). At the SER of 106,
Fig. 4 shows that for xed gain relaying, 𝐾=2outperforms
the single user scenario by 10 dB. Further increasing 𝐾brings
marginal benets to the array gain. On the other hand, Fig. 5
shows that for variable gain relaying, 𝐾=2is superior by
18 dB to the single user scenario. However, further increasing
𝐾leads to array gain saturation.
VI. CONCLUSION
The performance gains offered by opportunistic scheduling
in a multiuser relay network have been examined for both
xed and variable gain relays. Capitalizing on our new exact
closed-form expressions for the CDF of the strongest end-to-
end SNR link in a multiuser scenario, exact expressions for the
SER have been derived in closed form by following a unied
CDF-based approach. It has been shown that our analysis can
be viewed as a generalization of the single user dual-hop link.
Furthermore, by utilizing the behavior of the CDF, asymptotic
SER expressions have been derived in the high SNR regime
694 IEEE TRANSACTIONS ON COMMUNICATIONS, VOL. 59, NO. 3, MARCH 2011
to explicitly reveal the impact of opportunistic scheduling on
the SER. We have proved that opportunistic scheduling has no
effect on the diversity order but leads to a noticeable increase
in the array gain.
APPENDIX A
PROOF OF THEOREM 1
We now calculate the CDF of 𝛾𝑠, Fix. Assuming that the 𝐾
relay-destination links undergo i.i.d. Rayleigh fading, the CDF
of 𝛾𝑠,Fix is given by
𝐹𝛾𝑠,Fix (𝛾)=
0
Pr [𝛾eq,𝑘,Fix <𝛾𝛾1]𝐾𝑓𝛾1(𝛾1)𝑑𝛾1
=
0
Pr 𝛾1𝛾2,𝑘
𝛾2,𝑘 +𝐶<𝛾𝛾1𝐾
𝑓𝛾1(𝛾1)𝑑𝛾1
=𝛾
0
Pr 𝛾2,𝑘 >𝐶𝛾
𝛾1𝛾𝛾1𝐾
𝑓𝛾1(𝛾1)𝑑𝛾1
+
𝛾
Pr 𝛾2,𝑘 <𝐶𝛾
𝛾1𝛾𝛾1𝐾
𝑓𝛾1(𝛾1)𝑑𝛾1
=𝐼1+𝐼2,(29)
where
𝐼1=𝛾
0
1
𝛾1
𝑒𝛾1
𝛾1𝑑𝛾1=1𝑒𝛾
𝛾1,(30)
and
𝐼2=
𝛾1𝑒𝐶𝛾
𝛾2(𝛾1𝛾)𝐾1
𝛾1
𝑒𝛾1
𝛾1𝑑𝛾1.(31)
Using the binomial expansion in [19, eq. (1.111)], 𝐼2can
be evaluated as
𝐼2=1
𝛾1
𝐾
𝑖=0 𝐾
𝑖(1)𝐾𝑖
𝛾
𝑒(𝐾𝑖)𝐶𝛾
𝛾2(𝛾1𝛾)𝑒𝛾1
𝛾1𝑑𝛾1
=𝑒𝛾
𝛾1+1
𝛾1
𝐾1
𝑖=0 𝐾
𝑖(1)𝐾𝑖
𝛾
𝑒(𝐾𝑖)𝐶𝛾
𝛾2(𝛾1𝛾)𝑒𝛾1
𝛾1𝑑𝛾1
=𝑒𝛾
𝛾1+1
𝛾1
𝐾1
𝑖=0 𝐾
𝑖(1)𝐾𝑖𝐼3.(32)
By setting 𝜆=𝛾1𝛾, we reexpress the integral 𝐼3as
𝐼3=𝑒𝛾
𝛾1
0
𝑒(𝐾𝑖)𝐶𝛾
𝛾2𝜆𝑒𝜆
𝛾1𝑑𝜆. (33)
Applying [19, eq. (3.324.1)] to (33), the integral 𝐼3can be
solved as
𝐼3=2𝑒𝛾
𝛾1(𝐾𝑖)𝐶𝛾1𝛾
𝛾2
𝐾12(𝐾𝑖)𝐶𝛾
𝛾1𝛾2,(34)
and thus 𝐼2is obtained by inserting (34) into (32).
Finally, substituting (30) together with (32) into (29) leads
to 𝐹𝛾𝑠,Fix (𝛾)presented in (10) which is the desired result.
ACKNOWLEDGMENT
This paper is in part supported by Australian Research
Council (ARC) discovery Project (DP0987944).
REFERENCES
[1] D. Soldani and S. Dixit, “Wireless relays for broadband access," IEEE
Commun. Mag., vol. 46, pp. 58-66, Mar. 2008.
[2] Q. Zhang, J. Jia, and J. Zhang, “Cooperative relay to improve diversity
in cognitive radio networks," IEEE Commun. Mag., vol. 47, pp. 111-
117, Feb. 2009.
[3] J. N. Laneman, D. N. C. Tse, and G. W. Wornell, “Cooperative diversity
in wireless networks: efcient protocols and outage behavior," IEEE
Trans. Inf. Theory, vol. 50, pp. 3062-3080, Dec. 2004.
[4] G. Kramer, M. Gastpar, and P. Gupta, “Cooperative strategies and
capacity theorems for relay networks," IEEE Trans. Inf. Theory,vol.
51, pp. 3037-3063, Sep. 2005.
[5] M. O. Hasna and M.-S. Alouini, “End-to-end performance of transmis-
sion systems with relays over Rayleigh-fading channels," IEEE Trans.
Wireless Commun., vol. 2, pp. 1126-1131, Nov. 2003.
[6] M. O. Hasna and M.-S. Alouini, A performance study of dual-hop
transmissions with xed gain relays," IEEE Trans. Wireless Commun.,
vol. 3, pp. 1963-1968, Nov. 2004.
[7] P. Viswanath, D. N. C. Tse, and R. Laroia, “Opportunistic beamforming
using dumb antennas," IEEE Trans. Inf. Theory, vol. 48, pp. 1277-1294,
June 2002.
[8] X. Liu, E. Chong, and N. Shroff, “A framework for opportunistic
scheduling in wireless networks," Computer Netw., vol. 41, pp. 451-
474, Mar. 2003.
[9] L. Yang and M.-S. Alouini, “Performance analysis of multiuser selection
diversity," IEEE Trans. Veh. Technol., vol. 55, pp. 1848-1861, Nov. 2006.
[10] L. Erwu, W. Dongyao, L. Jimin, S. Gang, and J. Shan, “Performance
evaluation of bandwidth allocation in 802.16j mobile multi-hop relay
networks," in Proc. IEEE Veh. Tech. Conf. (VTC’07), Dublin, Ireland,
Apr. 2007, pp. 939-943.
[11] A. Pollard, J. von Hafen, M. Döttling, D. Schultz, R. Pabst, and
E. Zimmerman, “WINNER–towards ubiquitous wireless access," in
Proc. IEEE Veh. Tech. Conf. (VTC’06), Melbourne, Australia, May 2006,
pp. 42-46.
[12] Z. Lin and B. Vucetic, “Power and rate adaptation for wireless network
coding with opportunistic scheduling," in Proc. IEEE Int. Symp. Inf.
Theory (ISIT’08), Toronto, Canada, July 2008, pp. 21-25.
[13] Y. Shi, W. Zhang, and K. B. Letaief, “Cooperative multiplexing and
scheduling in wireless relay networks," in Proc. IEEE Int. Conf. Com-
mun. (ICC’08), Beijing, China, May 2008, pp. 3034-3038.
[14] C. K. Sung and I. B. Collings, “Cooperative multiplexing with interfer-
ence suppression in multiuser wireless relay networks," in Proc. IEEE
Veh. Tech. Conf. (VTC’09-Spring), Barcelona, Spain, Apr. 2009, pp. 1-5.
[15] Ö. Oyman and M. Z. Win, “Power-bandwidth tradeoff in multiuser relay
channels with opportunistic scheduling," in Proc. 46th Annual Allerton
Conf. Commun., Control Comput., Monticello, IL, Sep. 2008, pp. 72-78.
[16] M. K. Tsatsanis and Z. Xu, “Performance analysis of minimum variance
CDMA receivers," IEEE Trans. Signal Process., vol. 46, pp. 3012-3022,
Nov. 1998.
[17] R. H. Y. Louie, Y. Li, H. Suraweera, and B. Vucetic, “Performance
analysis of beamforming in two hop amplify and forward relay networks
with antenna correlation," IEEE Trans. Wireless Commun.,vol.8,pp.
3132-3141, June 2009.
[18] M. R. McKay, A. J. Grant, and I. B. Collings, “Performance analysis of
MIMO-MRC in double-correlated Rayleigh environments," IEEE Trans.
Commun., vol. 55, pp. 497-507, Mar. 2007.
[19] I. S. Gradshteyn and I. M. Ryzhik, Table of Integrals, Series and
Products, 7th edition. San Diego, CA: Academic Press, 2007.
[20] A. P. Prudinikov, Y. A. Brychkov, and O. I. Marichev, Integrals and
Series, Vol. 2. Gordon and Breach Science Publishers, 1986.
[21] Z. Wang and G. B. Giannakis, “A simple and general parameterization
quantifying performance in fading channels," IEEE Trans. Commun.,
vol. 51, pp. 1389-1398, Aug. 2003.
... Currently, many papers have addressed the analysis of MUD in cooperative networks [7]- [12]. However, despite the practical importance, the deployment of beamforming techniques [13] in multiuser relay networks (MRNs) has never been investigated in the literature up to now. ...
... However, despite the practical importance, the deployment of beamforming techniques [13] in multiuser relay networks (MRNs) has never been investigated in the literature up to now. For example, the benefits acquired in [12] can be further improved by inserting beamforming techniques in the system model under consideration. Therefore, in order to partly fill this gap, this paper analyzes the outage performance of MRNs in which the source and each one of the destinations are equipped with multiple antennas and employ beamforming techniques. ...
... We consider a system model similar to [12], i.e., one source S communicates with one out of L destinations by using a half-duplex AF relay R and an opportunistic scheduling algorithm is employed for selecting the best destination (i.e., the one with the highest end-to-end signal-to-noise ratio (SNR)). The basic difference between our system model and [12] is that here the source and each one of the L destinations are equipped with N t and N r antennas, respectively, as shown in Fig. 1. ...
... Many papers in the literature (e.g., [14,15] and references therein) studied the dual-hop multi-destination relay network with opportunistic user scheduling. Opportunistic user scheduling technique achieves a maximum overall system capacity despite the fact that it ignores the fairness among destinations. ...
... It is well known that the opportunistic user scheduling is diversity-optimal in conventional multi-user cooperative networks [14,15]. Take a DF network with one source, one relay, and N destinations as an example, it was easily illustrated in [14,15], and in other papers on the same system model that the opportunistic user scheduling can achieve a maximal diversity order of N . ...
... It is well known that the opportunistic user scheduling is diversity-optimal in conventional multi-user cooperative networks [14,15]. Take a DF network with one source, one relay, and N destinations as an example, it was easily illustrated in [14,15], and in other papers on the same system model that the opportunistic user scheduling can achieve a maximal diversity order of N . ...
Article
In this paper, we propose a new time-switching relaying (TSR) protocol for dual-hop relay networks with simultaneous wireless information and power transfer (SWIPT) technique. The proposed protocol maintains the same receiver complexity of the conventional TSR protocol with the ability for implementing them using the same hardware. We study the performance of the proposed TSR protocol and compare it with the conventional TSR and power-splitting relaying protocols. Unified analytical expressions are derived for the outage probability, achievable throughput, and the ergodic channel capacity, in addition to studying the performance at high signal-to-noise ratio values where a unified approximate expression for the outage probability and expressions for the diversity order and coding gain are provided. The results show that the proposed TSR protocol outperforms the conventional TSR protocol in terms of outage probability and throughput. Also, findings illustrate that applying the SWIPT technique in multi-destination relay networks results in a unity diversity order. In contrast to conventional relaying networks, results show that the best location for the relay node in SWIPT relay networks is either near the source or the destinations but not in between.
... In the proposed structure, M and N users are affected from both shadowing and fading effects. Specifically, we assume that all users send pilot sequences to the R, so that R can select the strongest user pairs [21] which maximize the e2e SNR based on the shadowing information. It is important to note that quantized shadowing information can be used in user selection to reduce the overhead of the feedback 1 . ...
... By substituting f κA (γ) and F λA (η A γ/z) into (21) and with the aid of [25, eqn. ...
Article
Full-text available
This work investigates the performance of opportunistic multi-user scheduling for next generation cognitive two-way relay networks, where the communication between two secondary source terminals is affected by both fast fading and shadowing. In this approach, all users send pilot signals to the secondary relay terminal and the latter selects the best users based on the shadowing information. To quantify the performance of the proposed scheme, user and system outage probabilities, overall error probability and ergodic sum rate expressions are derived. Moreover, asymptotic analysis is performed to obtain the overall diversity gain and the effects of key parameters including fading/shadowing severity and the number of users in the system. The analytical results, which are validated through the simulations, show that the proposed scheme can be a preferable user scheduling approach for next generation wireless systems.
... Only few works have been conducted based on this architecture. The impact of opportunistic scheduling on multiuser networks has been analyzed in [10], but the system contains only one relay, which is somewhat impractical in the real environment. In this paper, we extend the system model in [10] to multi-relay multiuser networks. ...
... The impact of opportunistic scheduling on multiuser networks has been analyzed in [10], but the system contains only one relay, which is somewhat impractical in the real environment. In this paper, we extend the system model in [10] to multi-relay multiuser networks. Sun et al. [11] and Chen et al. [12] presented a joint source-relay selection scheme in multi-source multi-relay networks, and this joint selection scheme could be used in our system model. ...
Article
In this paper, we analyze average capacity of an amplify-and-forward (AF) cooperative communication system model in multi-relay multiuser networks. In contrast to conventional cooperative networks, relays in the considered network have no embedded energy supply. They need to rely on the energy harvested from the signals broadcasted by the source for their cooperative information transmission. Based on this structure, a two-step selection scheme is proposed considering both channel state information (CSI) and battery status of relays. Assuming each relay has infinite or finite energy storage for accumulating the energy, we use the infinite or finite Markov chain to capture the evolution of relay batteries and certain simplified assumptions to reduce computational complexity of the Markov chain analysis. The approximate closed-form expressions for the average capacity of the proposed scheme are derived. All theoretical results are validated by numerical simulations. The impacts of the system parameters, such as relay or user number, energy harvesting threshold and battery size, on the capacity performance are extensively investigated. Results show that although the performance of our scheme is inferior to the optimal joint selection scheme, it is still a practical scheme because its complexity is much lower than that of the optimal scheme.
... The above analytical results are only applicable to the single user case. In the point-to-multipoint wireless network, the channel fluctuations can be utilized to schedule the channel resources to the user with the best channel condition thereby generating a multiuser diversity gain, which can be realized by the opportunistic scheduling algorithms [57][58][59]. Regarding the principle of the multiuser diversity, please refer to [60] for more details. Thus, in this work we also consider the sensor selection to exploit the channel fluctuations among the different sensor-R channels. ...
Article
Full-text available
In this work, a mixed underwater acoustic/optical wireless transmission system under both amplify-and-forward (AF) and decode-and-forward (DF) relaying protocols is proposed. Assuming pointing errors and both heterodyne detection (HD) as well as intensity modulation/direct detection (IM/DD) techniques in the underwater optical link, we deduce the exact analytical formulas for the outage probability (OP), average bit error rate (ABER), and average capacity of the system under consideration. Also, we further derive the corresponding asymptotic expressions to gain intuitive physical insights about the system and channel models under consideration. Additionally, we extend the analysis to a more general multi-sensor system. Finally, we check the analytical results by Monte Carlo simulations.
... Cooperative relaying is an effective technique for extending the coverage and enhancing the cell-edge user performance of wireless systems [1], [2], [3], [4]. It was recently shown that the performance can be further improved by exploiting buffers at relay nodes [5], [6], [7]. ...
Article
In this paper, we investigate buffer-aided cooperative relaying schemes using full-duplex (FD) relay nodes with flow control. We show that incorporating various transmission options combined with proper successive interference cancellation can better exploit the opportunism of fading channels, leading to improved achievable rates. We analytically derive the optimal policy for node selection and link scheduling. To deal with the delay incurred at relay nodes, we propose flow control using a threshold-based policy on relays' queues. For performance analysis, we develop a novel technique to derive a delay estimate of the controlled queues with general arrival and service statistics. Numerical results show that the proposed scheme achieves higher throughputs than conventional relaying schemes without FD relaying, and that the proposed estimate closely approximates the actual delay. For the delay-constrained case, our scheme is shown to achieve an improved tradeoff between throughput and delay.
Article
In this correspondence, detection performance of an energy detector is evaluated in multi-user relay networks equipped with single amplify-and-forward (AF) relay. The relay network is assumed to be operating over independent and identically distributed, flat Rayleigh fading channels. New expressions for average detection probability are derived for both fixed-gain and variable-gain AF relays. Furthermore, truncation error bounds are also evaluated for the respective expressions because the derived average detection probability expressions were in the form of infinite summation series. In the end, the accuracy of the derived expressions is validated with the help of simulations .
Article
We design novel transmission strategies to maximize the energy efficiency (EE) of the uplink multi-user MIMO relay channel. In this channel, K multi-antenna users communicate with a multi-antenna base station (BS) through a multi-antenna relay. To achieve the goal of EE maximization, we propose new iterative algorithms to jointly optimize the multi-user precoder and the relay precoder under transmit power constraints for two cases. In the first case, the perfect global channel state information (CSI) is available, while in the second case, the CSI between the relay and the BS is imperfect. To surmount the nonconvexity of our formulated EE optimization problems in both cases, we introduce the parameter subtractive function into the proposed algorithms. Then the EE parameter in the parameter subtractive function is updated by the Dinkelbach’s algorithm in the perfect CSI case, and by the bisection method in the imperfect CSI case. Moreover, in the perfect CSI case the relay precoder is optimized by the diagonalization operation and the multi-user precoder is optimized based on the weighted minimum mean square error method. Differently, in the imperfect CSI case we apply the sign-definiteness lemma to promote the semidefinite programming formulation of the EE optimization problem. Furthermore, we present numerical results to demonstrate that our proposed iterative algorithms have a good convergence rate in both cases. In addition, we show that our proposed iterative algorithms achieve a higher EE performance than the existing algorithms in both CSI cases.
Article
A joint cooperative jamming and opportunistic scheduling (CJOS) scheme is proposed for a downlink multiuser relay network (MRN) with an untrusted fixed-gain amplify-And-forward relay. Specifically, the source's confident message is protected by employing CJ at the destinations and multiuser diversity is harvested via OS. Unified tight approximation and asymptotic expressions for the system secrecy outage probability with perfect/outdated channel state information (CSI) are derived. Our results explicitly show that with perfect CSI, CJOS scheme can improve the secrecy diversity order from 1/2 in single-user networks up to full diversity of 1 in MRNs. However, the outdated CSI degrades the secrecy diversity order from 1 to 1/2.
Article
In this paper, we investigate the effects of lineof- sight (LOS) path and opportunistic scheduling on dual-hop energy harvesting (EH) relay systems, where the LOS path exists between source and EH relay. We first study a single-destination case and show that the system diversity order is one and the outage behavior decays as log(SNR)/SNR, with SNR denoting the transmit signal-to-noise ratio (SNR) at the source. In the presence of a strong LOS path, asymptotic results reveal that the easing-off factor log(SNR) can be eliminated and a faster decay rate, 1/SNR, is achieved. Afterwards, the opportunistic scheduling (OS) of the second hops (N destinations) is considered, and its separate as well as joint effects on the system outage behavior are examined. In addition, the choice of power-splitting factor is discussed and the impacts of EH constraint on the performance limit compared to conventional relay system are investigated, showing that under the same transmit-power consumption from the fixed energy supply, the EH relay system could achieve the same performance with that of conventional relay system if the wireless power transfer in the first hop is lossless and the energy conversion efficiency at EH relay tends to be unity.
Article
Full-text available
We consider multiple-input multiple-output (MIMO) transmit beamforming systems with maximum ratio combining (MRC) receivers. The operating environment is Rayleigh fading with both transmit and receive spatial correlation. We present exact expressions for the probability density function (pdf) of the output signal-to-noise ratio, as well as the system outage probability. The results are based on explicit closed-form expressions which we derive for the pdf and cumulative distribution function of the maximum eigenvalue of double-correlated complex Wishart matrices. For systems with two antennas at either the transmitter or the receiver, we also derive exact closed-form expressions for the symbol-error rate. The new expressions are used to prove that MIMO-MRC achieves the maximum available spatial diversity order, and to demonstrate the effect of spatial correlation. The analysis is validated through comparison with Monte Carlo simulations
Conference Paper
Full-text available
In [1], the author presented a 1+N protection strategy against single link failures using a network coding approach on p-Cycles. In this paper, we extend this approach to protect against multiple link failures. For the network to be protected against M link failures, M p-Cycles are used. The connections sharing a certain cycle must have link disjoint paths, and they encode their transmitted and received data units on two counter rotating half cycles on each of the two cycles. To recover from m link failures using M cycles, where 1 les m les M , the data units are encoded on the cycles in such a way that each node affected by failures should recover m linearly independent combinations of the m units affected by the failures. To illustrate the concept, we show how to protect against two link failures, and describe in detail the encoding and decoding processes.
Article
Full-text available
p-cycles have been proposed for preprovisioned 1:N protection in optical mesh networks. Although the protection circuits are preconfigured, the detection of failures and the rerouting of traffic can be a time consuming operation. Another survivable mode of operation is the 1+1 protection mode, in which a signal is transmitted to the destination on two link disjoint circuits, hence recovery from failures is expeditious. However, this requires a large number of protection circuits. In this paper, we introduce a new concept in protection: 1+N protection, in which a p-cycle, similar to FIPP p-cycles, can be used to protect a number of bidirectional connections, which are mutually link disjoint, and also link disjoint from all links of the p-cycle. However, data units from different circuits are combined using network coding, which can be implemented in a number of technologies, such as next generation SONET (NGS), MPLS/GMPLS, or IP-over-WDM. The maximum outage time under this protection scheme can be limited to no more than the p-cycle propagation delay. It is also shown how to implement a hybrid 1+N and 1:N protection scheme, in which on-cycle links are protected using 1:N protection, while straddling links, or paths, are protected using 1+N protection. Extensions of this technique to protect multipoint connections are also introduced. A performance study based on optimal formulations of the 1+1, 1+N and the hybrid scheme is introduced. Although 1+N speed of recovery is comparable to that of 1+1 protection, numerical results for small networks indicate that 1+N is about 30% more efficient than 1+1 protection, in terms of the amount of protection resources, especially as the network graph density increases.
Article
Opportunistic beamforming was discussed using dumb antennas. The focus was on the downlink of a cellular system. Multiple antennas were used at the base-station to transmit the same signals from each antenna modulated by a gain whose phase and magnitude is changing in time in a controlled but pseudo random fashion. The scheme can be interpreted as performing opportunistic beamforming: the transmit powers and phases are randomized and transmission is scheduled to the user which is close to being in the beamforming configuration.
Article
This article reviews the current status and technologies of all-optical XOR gates. Various schemes with semiconductor optical amplifiers, particularly those associated with interferometric structures, are discussed and compared. Finally, the applications of all-optical XOR gates to emerging networks are explored, and the future direction is outlined.
Article
We give a survey up to 1989 on the Steiner tree problems which include the four important cases of euclidean, rectilinear, graphic, phylogenetic and some of their generalizations. We also provide a rather comprehensive and up-to-date bibliography which covers more than three hundred items.
Conference Paper
Being an evolution of IEEE 802.16e, IEEE 802.16j mobile multi-hop relay (MMR) is proposed to gain coverage extension and throughput enhancement. This research conducts theoretical analysis and performance evaluation on the on-demand bandwidth allocation in IEEE 802.16j MMR networks. Theoretical analysis shows that such systems using conventional bandwidth allocation will seriously suffer from low bandwidth utilization. We then develop a new, spectrum efficiency based adaptive resource allocation algorithm. Simulation results verified that, compared with conventional on-demand bandwidth allocation method, the proposed method is more bandwidth efficient and exhibits better fairness in such networks. In terms of throughput, packet loss rate and delay, the performance of SEBARA algorithm is further evaluated in an OPNET-based 802.16j MMR simulation platform. Both theoretical analysis and simulation indicate the novel method provides an attractive solution for bandwidth allocation in 802.16j MMR networks.
Conference Paper
The huge growth in wireless communication has led to a wide range of technologies each addressing a particular scenario or need. The goal of the WINNER project is to develop a single new ubiquitous radio access system concept to address the whole spectrum of mobile communications scenarios. This paper surveys the challenge of providing ubiquitous operation and introduces the key technologies investigated in WINNER to meet these needs