Cyclostationarity-Based Decision Reporting Scheme For Cooperative Spectrum Sensing

You might also like

Download as pdf or txt
Download as pdf or txt
You are on page 1of 14

Wireless Pers Commun (2013) 68:697710

DOI 10.1007/s11277-011-0477-2

Cyclostationarity-Based Decision Reporting Scheme


for Cooperative Spectrum Sensing
Yonglei Jiang Jinfeng Tian Huaxia Chen
Honglin Hu

Published online: 24 December 2011


Springer Science+Business Media, LLC. 2011

Abstract Cooperative spectrum sensing has emerged as a promising solution to the hidden terminal problem in cognitive radio networks (CRNs). It could significantly promote
the sensing capability of CRNs by exploiting space diversity gains in a fading environment. However, owing to the decision reporting overhead, there exists a tradeoff between the
system throughput and performance of cooperative spectrum sensing. In this paper, we propose a cyclostationarity-based decision reporting scheme for cooperative spectrum sensing in
CRNs with cyclic delay diversity orthogonal frequency division multiplexing (CDD-OFDM).
Decision information would be embedded into the CDD-OFDM signals in terms of cyclostationary signatures and shared among cognitive radio (CR) users along with data transmissions.
As a result, satisfied system throughput could be achieved without additional spectral or temporal resources consumption when the number of cooperative users increases. Numerical
results are presented to show the system throughput enhancement.
Keywords Cognitive radio networks Cooperative spectrum sensing Decision reporting
Cyclostationarity CDD OFDM

Y. Jiang J. Tian H. Chen H. Hu (B)


Key Lab of Wireless Sensor Network and Communication, Shanghai Research Center for Wireless
Communications (WiCO), Graduate University of Chinese Academy of Sciences (CAS),
Shanghai Institute of Microsystem and Information Technologies (SIMIT), Shanghai, China
e-mail: hlhu@ieee.org
Y. Jiang
e-mail: yonglei.jiang@shrcwc.org
J. Tian
e-mail: jinfeng.tian@shrcwc.org
H. Chen
e-mail: huaxia.chen@shrcwc.org

123

698

Y. Jiang et al.

1 Introduction
Given the limited natural frequency spectrum, the increasing requirements of high data rate
wireless communication applications are gradually beyond what the current static frequency
allocation policies can accommodate. However, as reported by federal communications commission (FCC), a great number of spectrum bands around the world are underutilized [1].
Cognitive radio is then supposed to solve the spectrum scarcity problem in wireless communications. Accompanying with the emergence of the intelligent and reconfigurable cognitive
devices and dynamic spectrum access strategies, a new prototype termed as cognitive radio
network (CRN) is developed [2]. Generally, CRN is organized by the primary and CR users.
CR users, which possess cognitive capabilities of their surrounding radio environments, are
allowed to use those free white bands without making harmful interference to the primary
users. As an obligation, they should vacate those bands as soon as possible whenever the
primary users appear. Thus, spectrum sensing counts for much both in protecting the usage
of primary users and promoting the utilization of white space.
The major challenge of spectrum sensing involves the hidden terminal problem, which
is usually occurred due to the noise uncertainty, shadow and multipath fading. Apparently,
increasing observation duration could help to mitigate this problem; however, at the expense
of system throughput. Recent research has shown that the cooperative spectrum sensing is an
efficient strategy to solve this problem. It could considerably enhance the detection reliability
by exploiting the space diversity gains in a fading environment [3,4]. Generally, the procedure of cooperative spectrum sensing is implemented by a threefold step: first, each CR user
performs individual spectrum sensing based on local observation; then local sensing results
are forwarded to a fusion center or neighboring CR users, with a centralized or distributed
mode, respectively; finally, the ultimate decision would be made based on the associated
sensing results.
Since the space diversity gains are achieved by associating sensing information from distributed CR users, information fusion including information reporting among CR users and
individual sensing results combining is a challenging task [5]. Information fusion is constructed with two formats, i.e., data fusion and decision fusion. For data fusion, each CR
user shares its observation in a morphism manner without making a local decision; while
decision fusion integrates the local decision of each CR user to make a final decision. It is
proved that data fusion outperforms decision fusion [6]; however, the former consumes more
wireless resources. On the other hand, performance of decision fusion could be improved
remarkably by increasing the number of cooperative users [7]. Without loss of generality, we
only consider decision fusion in the following. Currently, a control channel with a dedicated
band is used to forward decision information among CR users [5]. However, this is realized
at the cost of bandwidth and throughput of CRNs, especially when a large amount of CR
users join in the cooperation. There exists a tradeoff between the system throughput of CRNs
and the performance of cooperative spectrum sensing.
In order to solve this dilemma, we propose an built-in decision reporting scheme based
on cyclostationary features. Cyclostationary features are induced by the inner periodicities
of sine wave carriers, pulse trains, repeating spreading codes, etc., that most of the digital
communication signals in use today contain [8]. Recently, it has been verified that specified cyclostationary features of orthogonal frequency division multiplexing (OFDM) signals
could be flexibly achieved through pilot inducing [9], subcarrier mapping [10], and cyclic
delay diversity (CDD) [11], etc. Significantly, the CDD-induced cyclostationary features
are exclusively determined by the cyclic delay intervals, and the procedure of CDD will
not cost any additional spectral bandwidth. A novel coordination algorithm based on the

123

Cyclostationarity-Based Decision Reporting Scheme

699

Fig. 1 Basic sensing model of cognitive radio network.

CDD-induced cyclostationary signatures for CRNs has been proposed in [11]. According
to this algorithm, each CDD-OFDM based CRN is pre-assigned with an individual cyclostationary signature. This inspires us to design a novel decision reporting scheme based
on the CDD-induced cyclostationary signatures. By constructing the mapping relationship
between decision information and cyclostationary signatures, decision information could be
embedded into the CDD-OFDM signals and delivered simultaneously with the common data
transmissions. It does not require additional spectral or temporal resources, thus would not
degrade the system throughput of CRNs.
The rest of this paper is outlined as follows. System model and fusion analysis would be
introduced in Sect. 2. Next, in Sect. 3, we present the proposed cyclostationarity-based decision reporting scheme. While in Sect. 4, the corresponding numerical results are provided.
Finally, we conclude our work in Sect. 5.

2 System Model and Fusion Analysis


In this section, the detailed system model is introduced, followed with a comprehensive
analysis of the conventional decision fusion approach.
2.1 System Model
This paper focuses on the reporting of decision information among CR users, in a scenario
with one primary user and multiple CR users. Figure 1 depicts the basic sensing model of the
CRN, where a distributed network analogous to the Ad Hoc is adopted. The primary user is
assumed to be far enough, that the signal-to-noise ratio (SNR) of each CR user is considered
to be the same. Detection of primary user is realized based on the energy estimation and
cooperative spectrum sensing. We employ a distributed decision fusion method in this paper.
Each CR user performs local spectrum sensing independently based on the measured signal
energy and then shares the sensing result with its neighboring CR users. After combining
local sensing result and those from neighbors under the AND or OR rule, CR user makes the
final decision and decides whether to occupy the available spectrum band or keep silent. There
would be several free bands; however, the CRN can only occupy one band each time. We
assume that CR users always occupy dedicated frequency bands for basic communication,
in order to maintain continuous transmission when lack of available free bands.
Moreover, we suppose that data transmissions among CR users are based on the CDDOFDM mechanism. Note that CDD-OFDM mechanism has been adopted by many wireless communication standards, e.g., long term evolution (LTE) and LTE-Advanced [13].

123

700

Y. Jiang et al.

Fig. 2 Transmitter architecture of CDD-OFDM system

Figure 2 shows the transmitter architecture of CR users with N T transmitter antennas. N


  N 1
data symbols cl,k k=0 are modulated by the OFDM entity using an N -point inverse fast
Fourier transform (IFFT). OFDM modulation signals are then shifted cyclically according to
the antenna-dependent cyclic delay intervals n T (n T = 1, 2, . . . , N T ), before inserting the
N G length cyclic prefix (CP). Thus, the corresponding CDD-OFDM signals at antenna
n T can be represented as
sn T (n)= 

+
N
1


kn T
1
k((l+1)Mn)
g(n l M) cl,k W N W N
,
N T N l=
k=0

(1)

(n)

where M = N + N G , W N = e j2/N and g(n) = G [0,M1] with



(n)
1 n = T1 , T1 + 1, . . . , T2
.
G [T ,T ] =
1 2
0 else

(2)

Data symbols are assumed to be statistically independent with each other, i.e.,
E{cl,k cl ,k  } = (l l  )(k k  ), where () and () represent the complex conjugate
and Delta function, respectively. The CDD-OFDM signals are received by a single receiver
antenna in each CR user. Let hl = [h 1 (l), h 2 (l), . . . , h NT (l) ] denote the discrete time impulse
response of the multiple-input single-output (MISO) channels. Without loss of generality,
we assume all the channels have the same L h taps. Thus the received CDD-OFDM signals
can be described as
r (n) =

Lh


hl s(n l) + v(n),

(3)

l=0
T
where s(n) = [s1 (n), s2 (n),
 . . . , s NT (n)] , and v(n) denotes the additive white Gaussian
noise with E v (n) v n  = v2 n n  . Besides, we also assume that the additive noise
is statistically independent from the data symbols.

2.2 Decision Fusion Analysis


As a promising technology, cooperative spectrum sensing expresses many explicit advantages, including hidden terminals avoidance, short sensing duration, little interference to the
primary users, etc., [14,15]. However, the conventional decision fusion approaches suffer
the tradeoff between detection performance and system throughput, which circumscribes the
applicability of cooperative spectrum sensing. In the following, we would have an analysis
of the traditional decision fusion method.

123

Cyclostationarity-Based Decision Reporting Scheme

701

Consider a simple scenario, where the primary user transmits a deterministic signal with
constant transmitting power assumed to be s2 = 1. Without loss of generality, channel fading
is not considered here. Thus, the local energy detection of the CR user i could be represented
as a NeymanPearson Lemma hypothesis problem, given by

H0 : ri = v;
(4)
H1 : ri = s + v.
By using the Q function, the local probabilities of detection and false alarm of the CR user
i could be given as


(5)
P if = Q i S N Ri ,



(6)
Pdi = Q Q 1 (P if ) S N Ri ,
where i is the threshold for the CR user i. Thus, for a CRN with N users, the corresponding
network probabilities of detection and false alarm, with  and  representing the AND and
OR combination rules, respectively, could be given by
 Nf =

P if ,

(7)

Pdi ,

(8)

i=1

dN =

N

i=1

 Nf = 1

(1 P if ),

(9)

i=1

and
dN = 1

(1 Pdi ).

(10)

i=1

Since the SNR level at each CR user is considered to be the same, a uniform threshold
could be utilized for all local energy detections. Hence, the local P f and Pd of each CR user
would be the same. Figure 3 illustrates the network probabilities of false alarm with different
numbers of cooperative users respectively, both for AND and OR rules, under the condition
that the network probability of detection is 0.9. As shown in Fig. 3, the network probability
of false alarm decreases as the number of cooperative users increases, which indicates more
cooperative users would result in better sensing performance.
Let the cognitive frame period TF = 100 ms, and sensing time Ts = 10 ms be constant for
all CR users. Decision information is associated through the time division multiple access
(TDMA) mode, keeping TE = 1 ms for each exchange time. Then, the system throughput
, termed as the ratio of the available transmission time TT and TF , could be obtained by
=

(1 P fN )(TF Ts N TE )
TT
=
.
TF
TF

(11)

Figure 4 depicts the system throughput with different numbers of cooperative users. As shown
in Fig. 4, the maximum system throughput can be achieved when 5 CR users participate the
cooperation, and throughput would degrade when more CR users join in.

123

702

Y. Jiang et al.

Probability of false alarm for the network

0.25
AND decision
OR decision

0.2

0.15

0.1

0.05
SNR=6dB

10

15

20

25

30

Number of cooperative users

Fig. 3 Network probabilities of conventional decision fusion methods

0.85
AND decision
OR decision

System throughput

0.8

0.75

0.7

0.65

0.6
SNR=6dB

0.55

10

15

20

25

30

Number of cooperative users

Fig. 4 System throughput with conventional decision fusion methods

Comparing Figs. 3 with 4, more cooperative CR users could significantly decrease the
probability of false alarm; however, at the cost of system throughput due to the exchange of
decision information among CR users. This inspires our work, and we consider designing an
built-in decision reporting scheme that does not consume any spectral or temporal resources.

3 Cyclostationarity-Based Decision Reporting Scheme


In this section, we first review the cyclostationary features in terms of cyclic autocorrelation
function (CAF), and then introduce the cyclostationarity-based decision reporting scheme.

123

Cyclostationarity-Based Decision Reporting Scheme

703

3.1 Cyclostationary Features of CDD-OFDM Signals


According to (3), the autocorrelation of the received CDD-OFDM signals can be given by
cr (n, ) = E {r (n) r (n + )}
Lh

+l

=
hl
Cs (n l, q)h+lk + cv ( ),
l=0

(12)

q= +lL h

E{v(n)v (n

+ )}, and Cs (n, q) is the time-dependent correlation matrix of


where cv ( ) =
the non-stationary random process vector s(n), defined as
Cs (n, ) = E{s(n)s H (n + )}.

(13)

It has been proved in [11] that r (n) is a scalar cyclostationary random process with a cyclostationary period M and its CAF can be achieved by expanding its autocorrelation function
into a Fourier series with respect to time domain as
cr (k, ) =

=
s (k, ) =
where C

1
M

s (k, )
C

M1

1
M

1
M

M1

n=0


i, j

n=0
Lh

kn
cr (n, )W M

l=0

kl
hl W M


+l
r = +lL h

(14)

s (k, r )h
C
+lr + cv ( ) (k) ,

kn with its (i, j) (i, j = 1, 2, . . . , N ) entity given by


Cs (n, )W M
T

1
NT
1
NT

Fk,Mm N  j,i ,

0 =m N + j,i M1;
k(m N  j,i )

Fk,Mm N + j,i W M
0,

M+1 =m N + j,i <0;

else;

(15)

for m = 0, 1, 2; k = 1, 2, . . . , M 1;
where
Fk,P =

M1
k(P1)
sin(k P/M)
W
1  (n)
kn
G [0,P1] W M
= 2M
.
M
sin(k/M)

(16)

n=0

As shown in (14) and (15), CAF of the CDD-OFDM signals has periodic components
at the cyclic frequency of 2k/M (k = 1, 2, . . . , M 1). Specifically, for each cyclic
frequency, there exists a sequence of lag-indexed spectrum lines indicated by the following indices set
= { | = m N  j,i (M + 1, M 1) for m = 0, 1, 2; i, j = 1, 2, . . . , N T }.
(17)
over which there are non-zero CAF components. Among all these lag indexes in , the cyclostationary features at = N are induced by CP, while the others are raised by CDD. It can
be obviously found from (17) that the CDD-induced cyclostationary features are exclusively
determined by the cyclic delay intervals  j,i =  j i . Thus, via tuning the cyclic delay
intervals, specified cyclostationary features could be achieved.
Take a CDD-OFDM system with 2 transmitting antennas for instance. Figure 5 shows the
CAFs of the CDD-OFDM signals with different cyclic delay intervals. The FFT size N = 32
and length of CP N G = 8. As illustrated in Fig. 5, the CP-induced CAF peaks are located at

123

704

Y. Jiang et al.

Fig. 5 Cyclostationarity of
CDD-OFDM signals
(N T = 2, N = 32, N G = 8)

(a)

(b)

the lag indices {32}; while the CAF peaks overlaid at the lag indices {5, 27, 37} and
{14, 18}, respectively, are induced by CDD.
3.2 Decision Reporting Scheme
As demonstrated in the previous sub-section, CDD-OFDM signals possess distinctive cyclostationary features. These cyclostationary features are exclusively controlled by the cyclic
delay intervals, and cyclostationary features with different cyclic delay intervals are linear

123

705

...

Cyclostationarity-Based Decision Reporting Scheme

Fig. 6 Transceiver architecture of CDD-OFDM system with decision information embedded

orthogonal with each other. Therefore, via tuning the cyclic delay intervals with the decision bits, decision information could be embedded into the CDD-OFDM signals and shared
among CR users when they communicate with each other. The procedure can be realized
as

N
bfusion n T 1 T cyclostationary signatures (CAF).
(18)
As shown in (17), for a CDD-OFDM system with FFT size N , there would be at least
N /2 distinguishable cyclostationary signatures. A set of cyclostationary signatures is preselected as carrier for decision information under the maximum distance rule. Non-zero
components of different cyclostationary signatures would have the maximum intervals with
each other over the lag domain. Size of the set is determined by the number of bits of decision information, i.e., two cyclostationary signatures are enough for the 1-bit hard decision
mode.
Note that, different cyclic delays would not make much impact to the performance of
CDD-OFDM receiver. It has been verified in [12], that there is saturation effect in terms of
cyclic delays, which guarantees wide margins to accommodate generating cyclostationary
signatures while maintaining the delay diversity gain. Generally, the delay diversity gain
could be achieved if the cyclic delay n T meets a mild condition [12]
nT

1
,
BTs

n T = 2, 3, . . . , N T ,

(19)

where B and Ts denote bandwidth and sampling time of the OFDM signal, respectively.
Figure 6 illustrates the modified transceiver architecture of the CDD-OFDM system with
decision information embedded. In the transmitter, fusion bits bfusion would be first mapped

N
into the antenna dependent cyclic delay vector  = n T n T=1 , based on which OFDM
T
symbols are shifted cyclically later. Referring to the receiver, fusion bits could be recaptured independently and simultaneously with the general multicarrier modulation signals.
We use a CAF detector based on the maximum likelihood rule to estimate the transmitted
cyclic delay intervals at each antenna. The detection is implemented based on the normalized
cross-correlation of the empirical and theoretical CAF of the received CDD-OFDM signals as
ym =

H
c r c r,
m

c r c rH

(20)

where c r = [cr (k1 , 1 ), cr (k1 , 2 ), . . . , cr (k Nk , N )] is the empirical CAF vector with


cr (ki , j ) (i = 1, . . . , Nk ; j = 1, . . . , N ) given by

123

706

Y. Jiang et al.

...

... ...

Fig. 7 Cognitive frame structure

cr (ki , j ) =

M L1
1 
ki n
r (n)r (n + j )W M
.
ML

(21)

n=0

Moreover, c r,m = [cr,m (k1 , 1 ), . . . , cr,m (k Nk , N )] is the theoretical CAF vector of the
CDD-OFDM signals with cyclic delay vector m where cr,m (ki , j ) is given by (14). Then,
could be given by
the maximum likely transmitted cyclic delay vector 
= arg max ym .

m

(22)

into binary bits, we get the


Finally, after demapping the estimated cyclic delay vector 

fusion bits bfusion .


Figure 7 illustrates the cognitive fame structure in this paper, which is constituted by the
sensing period and normal data period. Data period is divided into multiple tiny time slots
and allocated to CR users either with a fixed or competitive mode. Note that, only one CR
user can access into the free band per slot. For each cognitive frame, CR users first implement
local spectrum sensing independently at the sensing period. However, they are still allowed
to use the free band that the previous decision result indicated until the final cooperative
decision is made, even the local sensing result indicates the appearance of primary users.
Note that, there always exists dedicated frequency bands for CR users, in order to maintain
continuous transmission when lack of available free bands. During each time slot, the corresponding CR user embeds its local sensing result into CDD-OFDM signals in terms of
cyclostationary signature, while the other CR users listen and sense the signature to capture
the decision result. Without loss of generality, we assume the traffic load is heavy enough
and the first N slots are occupied by N different CR users. Thus, after at most N slots, each
CR user could perform the final decision fusion and decides whether to use the band or not.
Compared with the current decision reporting scheme, the proposed cyclostationarity-based
decision reporting method does not cost signaling overhead or occupy any temporal and
spectral resources.

4 Numerical Results
In this section, numerical results of the proposed cyclostationarity-based decision reporting scheme are provided. Since performance of different decision fusion modes has been
well testified, we mainly focus on the transmitting performance of the embedded decisions.
Table 1 provides the detailed simulation parameters. A Monte-Carlo method is used for this
simulation with 50,000 runs. Based on the simulation results, theoretical system throughput
as well as the ideal throughput is deduced. Without loss of generality, a hard decision fusion
mode with 1-bit decision information is examined in this paper. The cognitive frame period
TF = 100 ms, and sensing time of each CR user is fixed as Ts = 10 ms. For data period, the
time slot Tslot = 1 ms, and there are 14 OFDM symbols in each slot with FFT size N = 128.
Network load is assumed to be heavy enough that each time slot would be occupied by a user.

123

Cyclostationarity-Based Decision Reporting Scheme


Table 1 Simulation parameters

707

Parameter

Value

DFT size N

128

CP ratio N G /N
Modulation

QPSK

1/4

Channel coding

Convolutional code (5,7)

Coding rate

1/2

Antenna configuration

21

Channel model

Flat

Interleaver

Row-in column-out

10

L=3
L=5
L=9
L = 14

BER

10

10

10

10

12

14

16

18

20

SNR (dB)

Fig. 8 Transmitting performance of cyclostationarity-based decision reporting scheme

Let Pe denote the transmitting error rate of the decision information. Thus, the corresponding received probabilities of detection and false alarm from CR user i could be given by
Pr,i f = (1 Pe )P if + Pe (1 P if ),

(23)

i
= (1 Pe )Pdi + Pe (1 Pdi ).
Pr,d

(24)

and

Figure 8 illustrates the transmitting performance of the cyclostationarity-based 1-bit decision reporting scheme with different observation periods. As shown in Fig. 8, the transmitting
performance of the embedded decisions is promoted as the observation period L (in OFDM
symbols) increases. For S N R = 6 dB, Pe in terms of bit-error-rate (BER) in this case,
is reduced from about 0.01 to 0.0034 when observation period L increases from 3 to 14.
Substitute them into Eqs. (23) and (24), we can get the corresponding received detection
and false alarm probabilities. Since decision fusion based on the cyclostationary signature
doesnt take system rescources, system throughput could be rewrote as
=

(1 P fN )(TF Ts )
TF

(25)

123

708

Y. Jiang et al.
0.95

0.9

System throughput

0.85

0.8
0.75

0.7
AMD L = Inf
OR L = Inf
AMD L = 14
OR L = 14
AMD L = 9
OR L = 9
AMD L = 3
OR L = 3

0.65

0.6
0.55

0.5

10

15

20

25

30

Number of cooperative users

Fig. 9 System throughput with cyclostationarity-based decision reporting scheme

In accord with the analysis in Sect. 2.2, the network probability of detection is set to 0.9 and
the local P f and Pd of each CR user is assumed to be the same, too. Hence, the local and
network P f and Pd can be got according to Eqs. (5)(8).
Figure 9 depicts the system throughput of the cyclostationarity-based decision reporting
scheme. System throughput with different observation periods as well as the ideal throughput
is illustrated. Compared with Fig. 4, the ideal system throughput of the proposed decision
reporting scheme outperforms the conventional one. Significantly, by using the cyclostationarity-based decision reporting scheme, system throughput would not decrease as the number
of cooperative users increases. This is occurred because the proposed scheme doesnt cost
system resources or signaling overheads. Therefore, satisfied system throughput could be
achieved while decreasing the interference to primary users through multiplying cooperative
CR users. Note that, system throughput would be degraded especially for the AND mode due
to the transmission error of the built-in decisions. AND mode is more sensitive to decision
errors than OR mode. However, this could be avoided by increasing the observation period,
i.e., L = 14 is enough for the case in this paper.

5 Conclusions
In this paper, we proposed a cyclostationarity-based decision reporting scheme for cooperative sensing in CDD-OFDM based CRNs. By using the proposed reporting scheme, decision
information can be shared among CR users without requiring any additional temporal or
spectral resources. It would be an efficient solution for the tradeoff between the detection
performance of cooperative spectrum sensing and system throughput of CRNs. In addition,
the proposed cyclostationarity-based decision reporting scheme is compatible with the
current CDD-OFDM systems.
Acknowledgment This work is partially supported by the National NSFC under grant 61002017 and
61072076, and projects 10JC1414400, 10ZR1429200, 10220712000 from STCSM, Shanghai, China.

123

Cyclostationarity-Based Decision Reporting Scheme

709

References
1. FCC. (2002). Spectrum policy task force. Report of the spectrum efficiency working group, Nov.
2002 (Online). Available: http://www.fcc.gov/sptf/reports.html.
2. Devroye, N., Vu, M., & Tarokh, V. (2008). Cognitive radio networks: Highlights of information
theoretic limits, models, and design. IEEE Signal Processing Magazine, 25(6), 1223.
3. Ben Letaief, K., & Wei, Z. (2009). Cooperative communications for cognitive radio networks. Proceedings of the IEEE, 97(5), 878893.
4. Ganesan, G., & Li, Y. (2005). Agility improvement through cooperative diversity in cognitive radio.
In Proceedings of IEEE global telecommunications conference (Globecom), St. Louis, MO, USA,
pp. 25052509.
5. Yucek, T., & Arslan, H. (2009). A survey of spectrum sensing algorithms for cognitive radio
applications. IEEE Communications Surveys and Tutorials, 11(1), 116130.
6. Visotsky, E., Kuffher, S., & Peterson, R. (2005). On collaborative detection of TV transmissions in
support of dynamic spectrum sharing. In Proceedings of 1st IEEE international symposium on new
frontiers in dynamic spectrum access networks, Baltimore, MD, USA, pp. 338345.
7. Mishra, S. M., Sahai, A., & Brodersen, R. W. (2006). Cooperative spectrum sensing among cognitive
radios. In Proceedings of IEEE international conference on communications (ICC), Istanbul, Turkey,
pp. 16581663.
8. Gardner, W. A. (1988). Signal interception-a unifying theoretical framework for feature detection. IEEE
Transactions on Communications, 36(8), 897906.
9. Maeda, K., Benjebbour, A., Asai, T., & Furuno, T. et al. (2008). Cyclostationarity-inducing transmission
methods for recognition among OFDM-based systems. Eurasip Journal on Wireless Communications
and Networking, 14 pp (Article ID 586172).
10. Sutton, P. D., Nolan, K.E., & Doyle, L. E. (2008). Cyclostationary signatures in practical cognitive
radio applications. IEEE Journal on Selected Areas in Communications, 26(1), 1324.
11. Guo, H., Hu, H., & Yang, Y. (2009). Cyclostationary signatures in OFDM-based cognitive radios with
cyclic delay diversity. In Proceedings of IEEE international conference on communications (ICC),
Dresden, Germany, pp. 16.
12. Dammann, A., & Kaiser, S. (2001). Standard conformable antenna diversity techniques for OFDM and
its application to the DVB-T system. In Proceedings of IEEE global telecommunicatins conference
(Globecom), San Antonio, TX, United States, pp. 31003105.
13. 3GPP TS 36.211 V9.1.0 (2010). Evolved universal terrestrial radio access (E-UTRA): Physical channels
and modulation.
14. Ganesan, G., & Li, Y. (2007). Cooperative spectrum sensing in cognitive radio, part I: Two user
networks. IEEE Transactions on Wireless Communications, 6(6), 22042213.
15. Ganesan, G., & Li, Y. (2007). Cooperative spectrum sensing in cognitive radio, part II: Multiuser
networks. IEEE Transactions on Wireless Communications, 6(6), 22142222.

Author Biographies
Yonglei Jiang He received his bachelor degree from the department
of Electronic Engineering & Information Science at the University of
Science and Technology of China (USTC), Hefei, China, in 2007. He
is currently pursuing his Ph.D. degree of communications and information systems at the Shanghai Institute of Microsystem and Information Technology, Chinese Academy of Sciences, Shanghai, China. He
mainly focuses on the research of embedded signatures in cognitive
radio networks.

123

710

Y. Jiang et al.
Jinfeng Tian She received her M.S. degrees from the University
of Electronic Science and Technology of China (UESTC), Chengdu,
China, in 2005. From 2005 to 2008, she was with ZTE corporation in
Shanghai and mainly engaged in the research of radio resource management. She is currently pursuing her Ph.D. degree of communications and information systems at the Shanghai Institute of Microsystem
and Information Technology, Chinese Academy of Sciences. Meanwhile she is engaged in 3GPP standardization research with Shanghai
Research Center for Wireless Communications, Shanghai, China. Her
main research interests include synchronization and channel estimation
for OFDM systems.

Huaxia Chen He received his bachelor degree from the department


of Electronic Engineering & Information Science at the East China
University of Science and Technology (ECUST), Shanghai, China,
in 2009. She is currently pursuing his Ph.D. degree of communications and information systems at the Shanghai Institute of Microsystem
and Information Technology, Chinese Academy of Sciences, Shanghai,
China. She mainly focuses on the research of interference mitigation in
cognitive radio networks.

Honglin Hu He received his Ph.D. degree in communications and


information system in Jan. 2004, from the University of Science and
Technology of China (USTC). Then, he was with Future Radio, Siemens AG Communications in Munich, Germany. Since Jan. 2006,
he joined Shanghai Research Center for Wireless Communications
(WiCO) and now is the head of the 1st R&D department. Meanwhile,
he serves as a Professor at Shanghai Institute of Microsystem and Information Technology (SIMIT), Chinese Academy of Science (CAS). He
is the Vice Chair of IEEE Shanghai Section and served as a TPC member for IEEE ICC06-11, GlobeCom07-11. He has published over 50
international journal/conference papers. Moreover, he has co-edited 4
technical books published by the CRC Press, Taylor & Francis LLC,
USA, among which 3 have been translated into Chinese as well, and 1
book on 3GPP LTE in Chinese published by Publishing House of Electronics Industry (PHEI). Currently, he serves as an Associate Editor or
in the Editorial Board of 4 international journals, including Wireless
Communications and Mobile Computing (John Wiley), International
Journal of Communication Systems (John Wiley), Security and Communication Networks (John Wiley) and
Journal of Computer Systems, Networks and Communications (Hindawi Group).

123

You might also like