Sequential Joint Spectrum Sensing and Channel Estimation for Dynamic Spectrum Access

Sequential Joint Spectrum Sensing and Channel Estimation for Dynamic Spectrum Access

Abstract

Dynamic spectrum access under channel uncertainties is considered. With the goal of maximizing the secondary user (SU) throughput subject to constraints on the primary user (PU) outage probability we formulate a joint problem of spectrum sensing and channel state estimation. The problem is cast into a sequential framework since sensing time minimization is crucial for throughput maximization. In the optimum solution, the sensing decision rule is coupled with the channel estimator, making the separate treatment of the sensing and channel estimation strictly suboptimal. Using such a joint structure for spectrum sensing and channel estimation we propose a distributed (cooperative) dynamic spectrum access scheme under statistical channel state information (CSI). In the proposed scheme, the SUs report their sufficient statistics to a fusion center (FC) via level-triggered sampling, a nonuniform sampling technique that is known to be bandwidth-and-energy efficient. Then, the FC makes a sequential spectrum sensing decision using local statistics and channel estimates, and selects the SU with the best transmission opportunity. The selected SU, using the sensing decision and its channel estimates, computes the transmit power and starts data transmission. Simulation results demonstrate that the proposed scheme significantly outperforms its conventional counterparts, under the same PU outage constraints, in terms of the achievable SU throughput.

Index Terms: sensing-based dynamic spectrum access, sequential joint detection and estimation, cooperative dynamic spectrum access, level-triggered sampling

I Introduction

Addressing the well-known problem of spectrum utilization scarcity in current wireless networks, the cognitive radio (CR) technology employs a hierarchical spectrum access model consisting of primary users (PUs) and secondary users (SUs) [1]. In this model, both PUs and SUs are able to access a same band with a higher priority for PUs. The spectrum sharing between PUs and SUs can be realized in an underlay fashion, which allows SUs to coexist with PUs without sensing the spectrum band. Thus, SUs are blind to the idle state of PUs (spectrum holes), resulting in a worst-case assumption that PUs use the band all the time. As a result, SUs can coexist only with severe constraints on the transmission power in order to protect the quality of service (QoS) of PUs. Focusing on the analysis of underlay spectrum access, [2, 3, 4] derive fading channel capacities and optimum power allocation strategies for SUs. In contrast to underlay, the opportunistic access approach permits the existence of SUs only when PUs are idle, i.e., no coexistence. Hence, in this approach there is no harsh constraints on the SU transmission power. Instead, an effective spectrum sensing scheme is needed [5, 6, 7]. In [5, 6] the SU throughput is maximized while satisfying the PU QoS constraints.

Methods for combining the underlay and opportunistic access approaches have also been proposed, e.g., [8, 9, 10, 11]. In such combined methods, the SU senses the spectrum band, as in opportunistic access, and controls its transmit power using the sensing result, which allows SU to coexist with PU, as in underlay. While deriving the power control function, the average or peak constraints on SU transmit power and PU interference level are imposed [10, 11]. In this paper, we propose such a combined method under the peak interference and power constraints. In spectrum access methods it is customary to assume perfect channel state information (CSI) at the SU, e.g., [2, 3, 4, 8, 9, 10, 11]. That is, the perfect CSI of SU channels (and even PU channels) can be made available to the SU. The quantized CSI case is treated in [11]. However, how to obtain the CSI in the process of dynamic spectrum access has not been addressed. We consider the problem of joint spectrum sensing and channel estimation in this work.

For such a joint problem, a straightforward solution is to treat the two subproblems separately by using the optimum solution for each subproblem. More specifically, one can use the likelihood ratio test (LRT) for spectrum sensing and the minimum mean square error (MMSE) estimator for channel estimation to solve the joint problem. However, as shown in [12, 13], treating each subproblem separately and solving it optimally does not necessarily result in the optimum overall performance. In [12, 14, 15], optimum solutions to different formulations of the joint detection and estimation problem are given under the fixed-sample-size framework. More recently, in [13] a sequential joint detection and estimation problem is considered, and the optimum solution is given, where the decision rule is a function of the estimator, making the separate treatment strictly suboptimal. The sequential framework ideally suits the goal of maximizing the SU throughput in dynamic spectrum access. In particular, it is desirable to perform reliable sensing as soon as possible to let the SU transmit data as long as possible, leading to higher throughput. Indeed, in the sequential framework the sensing time is minimized. Here we propose a dynamic spectrum access method based on sequential joint spectrum sensing and channel estimation.

Pilot signals are often used in channel estimation, e.g., [16, 17], and also in spectrum sensing, e.g., [18, 19, 20]. We similarly propose to make use of the pilot signals transmitted for PU communications to jointly sense and estimate the channels linked to the SU. In a cognitive radio network, multiple SUs can cooperate to sense the spectrum by sharing their local information either over a fusion center (FC) or directly with other SUs. For such a decentralized system bandwidth and energy-efficient scheme is required for information transmission and processing. Recently, in a series of papers [21, 22, 23], it is shown that a nonuniform sampling technique called level-triggered sampling is an ideal fit for distributed information transmission and processing. This is because it enables highly accurate recovery at the FC by transmitting only a single bit per sample. Furthermore, it allows for complete asynchrony among SUs, a highly desirable feature in distributed systems, and censors uninformative local information. Due to its attractive features we use level-triggered sampling in the proposed dynamic spectrum access scheme to enable cooperation between SUs.

The remainder of the paper is organized as follows. In Section II, we formulate the problem and briefly discuss the conventional spectrum access methods. Then, in Section III the sequential joint spectrum sensing and channel estimation problem is introduced and the optimum solution is given. The proposed cooperative spectrum access scheme is given in Section IV, and simulation results comparing its performance with other schemes are provided in Section V. Finally, the paper is concluded in Section VI.

Ii System Descriptions

Consider a cognitive radio network consisting of a primary user (PU) pair, a secondary user transmitter (SU Tx) and receiver (SU Rx), and a fusion center (FC), as shown in Fig. 1, where the PU pair can simultaneously communicate to each other through full duplexing. Although no direct communication takes place between the PUs and the SUs, interference to the PU communications occurs through the cross links, represented by dashed lines in Fig. 1. The FC facilitates cooperation among the SUs, and it can be either a dedicated entity or one of the SUs. The channel, i.e., cross link, between PU and SU Tx is represented by a complex random coefficient, i.e., channel gain, . Similarly the complex random coefficient denotes the channel gain between the PU and SU Rx. We assume Rician fading channels, i.e., the real and imaginary parts of , and , are independent and identically distributed (i.i.d.) as , with corresponding to Rayleigh fading channels. Moreover, are assumed to be independent, but they are in general not identically distributed with different means and variances.

Fig. 1: The cognitive radio system under consideration.

Ii-a Problem Formulation

As a fundamental requirement in cognitive radio systems, the SUs should not cause degradation in the quality of service (QoS) to the PUs. In other words, the interference from the SUs to the PUs must be kept below some maximum tolerable levels. Under such interference constraints, a natural objective is to maximize the SU throughput, i.e., the average bit-rate of SU Tx. Hence, assuming Gaussian noise in channels between the PUs and also between the SUs we aim to solve the following optimization problem

(1)

where is the transmit power of SU Tx, constrained by the maximum power , and is a function of the channel gains between SU Tx and the PUs; and are the channel gain and the variance of the Gaussian noise, respectively, between SU Tx and SU Rx; and are the transmit powers for PUs; and and are the maximum tolerable interference powers at PUs, which are determined by the PU outage constraints. The null hypothesis and the alternative hypothesis correspond to the absence and presence of PU communication, respectively. More specifically, under , whereas under .

In (1), we in fact maximize the average capacity of a Gaussian channel, where the interference constraint is determined according to the outage constraint on another Gaussian channel

(2)

where is the variance of the Gaussian noise; and is the bit-rate of PU . The outage constraint in (2) yields the interference constraint in (1), given . The maximum interference value is written similarly. We assume and are available to SUs. In a careful design, there should be some safety margin between the probability on the left hand-side of (2) and while determining . This is because SUs may unintentionally exceed due to lack of information on the true hypothesis and the actual channel coefficients.

Ii-B Spectrum Access Methods

The conventional spectrum access methods for cognitive radio, namely the opportunistic access and underlay methods, provide simplistic solutions to (1). In particular, the opportunistic access method focuses only on the binary hypothesis test, i.e., spectrum sensing, and conforms to the interference constraints by simply turning off SU Tx, i.e., , when is declared. When is declared, SU Tx transmits at the maximum power, i.e., . On the other hand, the underlay method does not perform spectrum sensing and solves only the constrained optimization problem under . As a result, the constant power is transmitted under both and . It is seen that deep fades in the cross links are beneficial for the SU throughput.

In practice, the channels between the PUs, and the cross links are not known a priori. Hence, the PUs perform a preamble communication with duration at the beginning of each data transmission frame to estimate and . Specifically, for transmission frame , as shown in Fig. 2, PU estimates during using pilot symbols, and then data transmission takes place during , where is the frame duration. Assuming the SUs are synchronized with the PU frame timing and observe pilot signals, each SU can estimate its cross links during each preamble period.

Fig. 2: Frame structures for the PU communication and the SU communication.

As opposed to the naive solutions of the conventional spectrum access methods, an efficient solution to (1) should involve both spectrum sensing and channel estimation, hence it is a combination of the opportunistic access and underlay methods. For example, at a fixed time , we can employ the optimum detector, i.e., the likelihood ratio test (LRT) for spectrum sensing, and the optimum estimator, i.e., the minimum mean square error (MMSE) estimator for channel estimation. Once we obtain the spectrum sensing result ( or ) and the channel estimates , we can use them to solve (1) as follows: SU Tx transmits with when is declared, as in opportunistic access, and with when is declared, as in underlay.

As a more sophisticated example, instead of performing fixed-sample-size detection and estimation (at a fixed time ) we can determine the sample number based on the observed samples, resulting in a sequential method with a random sensing time . In particular, we can use the sequential probability ratio test (SPRT) [24], which is the optimum sequential detector for i.i.d. observations in terms of minimizing the average detection delay, for spectrum sensing, and then use the MMSE estimator at the random sensing time to estimate the unknown channel gains .

However, the above approaches based on separate detection and estimation in general may not yield the optimal solution. In the following section, we propose a new and powerful solution based on sequential joint detection and estimation.

Iii Sequential Joint Spectrum Sensing and Channel Estimation

In this section, we focus on SU Tx, to introduce the sequential joint spectrum sensing and channel estimation framework. Hence, the subscript denoting SU Tx is dropped.

Iii-a Motivation

In our system model, in each frame during the preamble period , the signal received by the SU from PU is given by

(3)

where is the complex additive white Gaussian noise; is the proper complex channel coefficient between PU and the SU; and is the complex random pilot signal used in the preamble. The processes and are independent and they are independent of the random variable . We assume the SU observes at time , e.g., the SU knows the seed of the random number generator that generates , for .

In (3), we would like to decide between and as soon as possible, and also estimate if we decide for . In other words, our objective is to have a reliable estimate of the channel coefficient every time we detect the presence of PU communication. Deciding as soon as possible is important because an early sensing time, i.e., small , enables the SU to transmit data for a longer period of time, i.e., large , increasing the SU throughput. On the other hand, the SU transmit power, which is a function of sensing decision and estimates of , should obey the PU maximum interference constraints. Small may increase the misdetection probability and decrease the estimation accuracy, leading to the violation of such constraints and PU outage. Hence, there is a tradeoff in selecting the value. Conventionally is selected offline, resulting in a fixed-sample-size test. Whereas in a sequential test is determined online, i.e., it depends on the observations, and thus it is random. Although sequential tests are more sophisticated than fixed-sample-size tests, they are much more powerful in minimizing the average sensing time, , hence suit better the cognitive radio application.

In the separate detection and estimation approach, the unknown channel gain is treated as a nuisance parameter while performing detection. However, channel estimation is an integral part of the problem of interest. Hence, formulating the problem as a joint detection and estimation problem is a more natural way to obtain better overall performance, i.e., SU throughput. Indeed it was shown in [13] that the combined optimum detector and optimum estimator do not produce the optimum overall detection and estimation performance.

Iii-B Problem Formulation

Since the results in [13] are obtained for real signals, for analytical convenience in our problem we will treat a complex observation (channel) as two real observations (channels). Specifically, we compute and , hence instead of (3) we use the following signal model

(4)

where , , , and . Note in (4) that ; and given , the noise , and are independent across channels (for different ) and time. Similar to (3), we want to sequentially decide between and , and also estimate when we decide on . To present the sequential joint detection and estimation (SJDE) problem and the optimum solution to it we first focus on a single channel case, i.e., the signal model in (4) for specific values. In particular, the SU, using its observations through the real channel linked to PU , wants to jointly detect the PU communication and estimate the channel coefficient when it decides on its presence.

In sequential methods, in general, the average sample number, which corresponds to the average sensing time in our context, is minimized subject to a set of constraints, e.g., false alarm and misdetection constraints for detection, and mean squared error constraint for estimation. In the proposed joint framework we use the following combined cost function

(5)

where is the decision function; is the unknown parameter; is the estimate of ; are nonnegative constants selected by the designer; and denote the probability measure and expectation under hypothesis ; and denote the probability measure and expectation under ; and denote the probability measure and expectation under with being marginalized; is the -algebra, that is, the accumulated history pertinent to the observed process ; and is the indicator of the event , taking the value if occurs and otherwise. Then, our constrained optimization problem is given by

(6)

where is a given constant, denoting the target accuracy level.

Our formulation in (5) and (6) is conditioned on the auxiliary statistic because using such extra information we can assess the accuracy of the detector and estimator more precisely than the unconditional formulation. More specifically, since , there is no need to use the expectation, e.g., , of an accuracy assessment term when the term itself, e.g., , is available. Moreover, with the conditional formulation used in (5) we do not need to specify the distribution of the pilot signal . Note that the constraint in (6) is required to hold for each realization of the process , hence is stricter than its unconditional counterpart, which is required to hold only on average with respect to .

In (5), the first two terms, which are related to the detection problem, correspond to the false alarm and misdetection probabilities ( and ), respectively. On the other hand, the last term, which is related to the estimation problem, depends on both the decision and estimation strategies. Without this term, i.e., for , the combined cost depends only on the decision function , implying that the joint problem reduces into a pure detection problem.

Similar to let denote the -algebra generated by the processes and , i.e., the complete observation history. Then, we have the corresponding filtrations and . In general, the solution we seek should use all available information, that is, we are looking for a triplet where is -adapted, and are -measurable. It is known in the pure estimation problem that with a -adapted stopping time , in most cases, finding an optimum sequential estimator is not tractable [25]. Instead, [26] considered using an -adapted stopping time, which was later shown to have a simple optimal solution for continuous-time and discrete-time observations in [27] and [23], respectively. Similarly, in the pure detection problem with a -adapted we have a two-dimensional optimal stopping problem, which is not tractable. Consequently, following the approach used for the pure estimation problem in [26, 27, 23] we consider -adapted stopping times for our joint problem. On the other hand, we are still interested in -measurable decision rule and estimator , which use all available information acquired up to stopping time . As a result, the problem in (6) takes the following form

(7)

Iii-C The Optimal Solution

The following theorem gives the optimum solution to the above problem.

Theorem 1.

Consider the observations obtained through the real channel . Then, the optimum triplet of stopping time, decision function, and estimator for the sequential joint detection and estimation (SJDE) problem in (7) is given by

(8)
(9)
(10)

where is the conditional Fisher information given in estimating under [cf. (4)]; ; is a constant threshold [13, Theorem 1]; and

(11)

is the conditional log-likelihood ratio (LLR) between the hypotheses and given with under being marginalized [13, Lemma 2].

Proof:

The proof closely follows [13], so omitting the details we only highlight the differences here. The main difference is that the noise in (4) is independent across time but has a time-varying variance, whereas i.i.d. noise is assumed in [13]. The common term in the variance and the mean of the observation given and under cancels while writing the estimator and the LLR . As a result, the definitions of the Fisher information term and its companion differ from their counterparts in [13]. However, the results in [13] still hold here with the new definitions of and the noise variance appearing without as since and accordingly other key terms maintain their properties, e.g., is increasing. ∎

The optimum stopping rule in (8) terminates getting new samples when the conditional Fisher information exceeds a threshold whose exact expression can be found in [13, Theorem 1]. Since the conditional Fisher information is increasing, it is guaranteed to have a finite stopping, i.e., sensing, time. The optimum decision function in (9) is a modification of the well-known likelihood ratio test (LRT). For , i.e., in the pure detection problem, it boils down to LRT. For the estimator is incorporated into LRT. The way it modifies LRT is quite intuitive. When the estimate is nonzero, the threshold is decreased, supporting a decision in favor of . The further the estimate is from zero, the easier to decide for . The estimate provides some side information about the true hypothesis, and the optimum solution to the joint problem uses it. Such a plausible modification appears in the decision function since the detection and estimation problems are formulated jointly. The optimum estimator, given in (10), is the minimum mean square error (MMSE) estimator, which is equivalent to the maximum a posteriori (MAP) estimator in the Gaussian case under consideration.

Iii-D Discussions

Comparing the optimum triplet in Theorem 1 with the combined SPRT & MMSE method, we see that there are fundamental differences in the stopping rule and decision function. In SPRT [28], the stopping time and detection decision are determined together through a common procedure. More specifically, two thresholds are used to jointly terminate the scheme and make a decision. When the scheme terminates, the decision is already clear as it is determined by the threshold that causes termination. As a result, the performance metrics , , , and also MSE are closely interrelated since they are all controlled by the two thresholds, which are the only system parameters. On the other hand, in SJDE the stopping time and decision are computed using two separate procedures. First the stopping time is found by performing a single-threshold-test, and then the decision is made via a modified LRT. In particular, and are controlled by only the stopping threshold , whereas and are controlled by , , , and . That is to say, and can be controlled independently from and through , and similarly and can be controlled independently from and through , , and . The latter set of parameters enables a trade-off between and without affecting and . For instance, we can trade false alarm probability for misdetection probability , which is crucial for complying with the outage constraints of PUs, by decreasing the ratio of to or without sacrificing early stopping or estimation quality. We obviously have a higher degree of freedom in SJDE than SPRT due to the number of parameters that control the system performance, which endows us with the ability to strike a right balance between our objectives of early stopping, and accurate detection and estimation.


Fig. 3: Average sensing time vs. combined cost for the SJDE in Theorem 1, and the SPRT & MMSE and the sequential LRT & MMSE equipped with the stopping rule of SJDE.

In Fig. 3, we numerically show the superior performance of SJDE over the combined SPRT & MMSE (SPRT&E) in terms of the combined detection and estimation cost in (5). We also compare SJDE with the sequential LRT & MMSE (SLRT&E) that is equipped with the stopping rule of SJDE to demonstrate the advantage of incorporating the estimate into the decision function. SLRT&E uses the unmodified (original) LRT to detect, hence can be seen as a separate-formulation-method. It outperforms SPRT&E since it enjoys the flexibility of SJDE to strike a desired balance for the specific problem of interest by employing two separate procedures, namely the stopping rule of SJDE and LRT, to terminate the scheme and make a decision respectively. In our problem of interest, it is crucial that SUs do not violate the maximum interference constraint, which in turn ensures an admissible PU outage probability. In case of misdetection the SU transmits with maximum power, which may cause the violation of outage constraint. Even when the SU correctly detects PU communication, poor channel estimate may still cause the SU to transmit with a non-admissible power. On the other hand, the false alarm, which corresponds to deciding on under , is not related to the outage constraint, but only degrades the SU throughput. Therefore, in the combined cost expression in (5) the second and third terms are more important than the first term. Accordingly, in Fig. 3 we use and . Since the second part of the third term in (5) already penalizes misdetection, we do not differentiate between the coefficients, and , of the detection error probabilities. In Fig. 3, referring to (4) we use , i.e., Rayleigh fading channel , and .

Iii-E SJDE for a Single SU with Multiple Channels

Here, following the optimum SJDE scheme in Theorem 1 for the single channel case we are interested in finding the optimum SJDE scheme for the SU observing the signals and through the channels from PU and PU . We first need to modify the cost function in (5) by adding the new MSE terms, i.e.,

(12)

The following theorem, whose proof is provided in the Appendix, gives the optimum SJDE scheme in this case.

Theorem 2.

With the cost function in (12), and the observations obtained through the channels from PU and PU , the optimum triplet of stopping time, decision function, and estimator for the sequential joint detection and estimation (SJDE) problem in (7) is given by

(13)
(14)
(15)

where is the conditional Fisher information given under ; is a constant threshold [cf. (8)]; and [cf. (11)] is the global LLR.

For systems with multiple SU pairs, in the next section we propose a distributed and cooperative spectrum access method which selects the SU with the maximum achievable throughput, and controls its transmit power.

Iv Distributed Spectrum Access Based on SJDE

In the previous section we formulated the joint spectrum sensing and channel estimation problem for a single SU and gave the optimal solution to it. In this section we consider SUs, i.e., SU transmitter-receiver pairs, where each SU observes signals through different real channels ( from each PU). All observations of SUs through channels are used to detect a single event, namely the PU communication. Hence, under the joint framework introduced in Section III, SUs can cooperate to detect the PU communication. We next propose a bandwidth and energy-efficient distributed spectrum access algorithm for the cognitive radio system under consideration.

Iv-a SJDE-based Spectrum Access with Multiple SUs

We now consider the multi-SU case for SJDE, and propose a dynamic spectrum access method (DSA-SJDE). From (12), we have the following cost function,

(16)

Note that all SUs observe the same pilot signals and . Hence, from (13) it is seen that they have the same stopping time, which in this case serves as a global stopping time. Each channel coefficient is again estimated using (15) for all because they are independent. Since the observations , across SUs, are independent given , the global LLR is written as , and as in (14) we sum the channel estimates to write the threshold. Then, substituting the global LLR and the global threshold in (14) we obtain the decision function for the multi-SU case.

Corollary 1.

In the multi-SU case with the cost function in (16), the optimum solution to (7) is given by

(17)
(18)
(19)

where is the conditional Fisher information given under ; is a constant threshold [cf. (8)]; [cf. (4)]; and [cf. (11)] is the global LLR.

It looks like the SJDE scheme for the multi-SU case simply follows from (13)–(15) in the single-SU case. However, in the multi-SU case the stopping time, detector, and estimator are computed at the FC, which requires some local information. Note that the FC can reasonably observe the pilot signals and in the same way SUs do. Then, the FC needs to know the local random variables at the stopping time . In a straightforward way SUs can quantize and send at time . However, this method has several disadvantages in practice. Firstly, it needs high bandwidth at time on each reporting channel between SUs and the FC. Moreover, the reporting channels are utilized inefficiently. They remain idle until time , and at time each SU sends a number of bits, which may cause congestion at the FC. To overcome these practical issues SUs can sequentially report . For sequential reporting level-triggered sampling, a non-uniform sampling technique, was shown to be much superior to the traditional uniform sampling in terms of bandwidth and energy requirements for detection and estimation purposes in [22] and [23], respectively. Therefore, we propose that SUs sequentially report using level-triggered sampling.

Iv-B Level-triggered Sampling

Each SU , via the same level-triggered sampling procedure, informs the FC whenever considerable change occurs in its four local processes . In other words, identical samplers run in parallel for different processes. Hence, we will describe the procedure for a single process . The level-triggered sampling is a simple form of event-triggered sampling, in which sampling (communication) times are not deterministic, but rather dynamically determined by the random process , i.e.,

(20)

The threshold parameter is a constant known by both SUs and the FC. At each sampling time , SU transmits bits, , to the FC. The first bit, , indicates the threshold crossed (either or ) by the incremental process , i.e.,

(21)

The remaining bits are used to quantize the over(under)shoot into . At each sampling time , the overshoot value cannot exceed the magnitude of the last sample in the incremental process . The quantization interval is uniformly divided into subintervals with the step size . The mid value of each subinterval is used as the corresponding quantization level, i.e., a mid-riser quantizer is used. When , the uppermost quantization level is used. The parameter is determined so that is sufficiently small. From [22, Section IV-B] we can set the threshold using

(22)

for the FC to receive messages with an average rate of messages per unit time under . In Fig. 4, the level-triggered sampling procedure is demonstrated on a sample path of .


Fig. 4: The level-triggered sampling procedure used at SUs.

The FC, upon receiving the bits from SU at time , recovers the quantized value of by computing

(23)

Then, it sequentially sums up , at the sampling (communication) times to obtain an approximation to the sufficient statistic , i.e.,

(24)

where is the number of messages that the FC receives from SU about the process up to time . During the times the FC receives no message, i.e., , is kept constant.

At the stopping time , given by (13), the FC estimates each channel coefficient using

(25)

and decides according to the following rule

(26)

where , and is computed from (11) by substituting for . After making a decision, the FC grants the transmission privilege to the SU Tx with the highest achievable throughput. When the decision is in favor of , i.e., , one of them is selected randomly (or in some specific order) since in this case any SU Tx can transmit with its maximum power . On the other hand, when , the FC selects SU Tx where

(27)

is the SU Tx index, and . The pseudocodes for the procedures at SU and the FC in the proposed SJDE-based dynamic spectrum access method (DSA-SJDE) are given in Algorithms 1 and 2, respectively. In Algorithm 1, an SU Rx never executes lines 17-23 since the FC reports to SU Tx (cf. line 20 in Algorithm 2).

1:  Initialization:
2:  while  and  do
3:     
4:     
5:     
6:     
7:  end while
8:  if  {for any then
9:     
10:     
11:     Send and quantization bits for to FC
12:     
13:  end if
14:  if  or  then
15:     
16:     if FC reports  then
17:         if  then
18:            
19:         else
20:            Compute as in (15) using and
21:            ,  {see (29) for }
22:         end if
23:         Start data transmission with power
24:     else
25:         Stop
26:     end if
27:  else
28:     Go to line 2
29:  end if
Algorithm 1 DSA-SJDE procedure at SU
1:  Initialization:
2:  while  or  do
3:     
4:     
5:     if  received {for any then
6:         Compute from
7:         
8:     end if
9:  end while
10:  
11:  Compute from (25) using and
12:  Compute from (11) using and
13:  
14:  Compute from (26) using and
15:  if  then
16:     Select randomly or in some specific order from SU transmitters
17:  else
18:     Find as in (27) using
19:  end if
20:  Report to SU Tx , and instruct the others to stop
Algorithm 2 DSA-SJDE procedure at FC

Iv-C Discussions

The procedures at SUs and the FC, given in Algorithms 1 and 2, restarts at the beginning of each frame with duration (see Fig. 2). Each SU performs the procedure in Algorithm 1. The stopping threshold is selected through offline simulations to maximize the average SU throughput in DSA-SJDE, given by

(28)

where