Energy efficiency in cognitive radio network: study of cooperative sensing using different channel sensing methods

Size: px
Start display at page:

Download "Energy efficiency in cognitive radio network: study of cooperative sensing using different channel sensing methods"

Transcription

1 Graduate Teses and Dissertations Graduate College 2015 Energy efficiency in cognitive radio network: study of cooperative sensing using different cannel sensing metods Cenxuan Cui Iowa State University Follow tis and additional works at: ttp://lib.dr.iastate.edu/etd Part of te Electrical and Electronics Commons, and te Oil, Gas, and Energy Commons Recommended Citation Cui, Cenxuan, "Energy efficiency in cognitive radio network: study of cooperative sensing using different cannel sensing metods" (2015). Graduate Teses and Dissertations ttp://lib.dr.iastate.edu/etd/14749 Tis Tesis is brougt to you for free and open access by te Graduate College at Iowa State University Digital Repository. It as been accepted for inclusion in Graduate Teses and Dissertations by an autorized administrator of Iowa State University Digital Repository. For more information, please contact

2 Energy efficiency in cognitive radio network: Study of cooperative sensing using different cannel sensing metods by Cenxuan Cui A tesis for Master submitted to te graduate faculty in partial fulfillment of te requirements for te degree of MASTER OF SCIENCE Major: Electrical Engineering Program of Study Committee: Sang W. Kim, Major Professor Amed El-Sayed Kamal Natan Neiart Iowa State University Ames, Iowa 2015 Copyrigt Cenxuan Cui, All rigts reserved.

3 ii DEDICATION I dedicate my tesis work to my loving family, especially to my mom Ke Cen and my dad Jiancun Cui, wo ave been loving and supporting me since te beginning of my life. I dedicate my tesis work to all of my friends, we togeter ave created our best memories and we ave taken care of eac oter in ard times. I also dedicate my tesis work to my professor Sang Kim, wo as given me knowledge and always been patient wit me in my difficult time. Last but not least, I dedicate my tesis work to you, because someow we are all connected.

4 iii TABLE OF CONTENTS Page NOMENCLATURE AND NOTATION... ABSTRACT.... iv vi CHAPTER 1 INTRODUCTION... 1 CHAPTER 2 LITERATURE REVIEW ON CR ENERGY EFFICIENCY... 2 CHAPTER 3 SENSING SINGLE CHANNEL OF VARYING BANDWIDTH.. 5 Energy Detection Sceme and Error Probabilities... 5 Network Cannel Capacity and Energy Efficiency... 7 Cooperative Sensing and Data Fusion Rules... 9 Study on AND Fusion Rule wit Constrain on Misdetection Probability Case Study: Maximal Energy Efficiency Using AND Fusion Rule wit Misdetection Tresold CHAPTER 4 SENSING MULTIPLE CHANNELS OF SAME BANDWIDTH. 21 One Cognitive Radio wit Two Primary Users Cannel Capacities and Energy Efficiency wit Two PUs One Cognitive Radio wit Multiple Primary Users Cannel Capacities and Energy Efficiency wit Multiple PUs Setting Misdetection Tresold on CRs OR Fusion Rule wit k CRs and S PUs Case Study: AND Fusion Rule wit k CRs and S PUs CHAPTER 5 CONCLUSION AND FUTURE RESEARCH DIRECTIONS REFERENCES... 39

5 iv NOMENCLATURE AND NOTATION ADC CR FC PU SINR SNR SR SU Analog to Digital Converter Cognitive Radio Data Fusion Center Primary Users Signal to Interference plus Noise Ratio Signal to Noise Ratio Secondary Receiver Secondary User H 0 Hypotesis Test 0 H 1 Hypotesis Test 1 s(t) n(t) σ n 2 T s B λ γ P CS P P C ave E total Primary Signal Noise Signal Noise Variance Sensing Time Sensing Bandwidt Detection tresold SNR from PU and Measured at CR Signal Power Transmitted from CR and Measured at SR Signal Power Transmitted from PU and Measured at CR Average CR Cannel Capacity CR Network Total Energy Consumption

6 v P T P S T T T S E d E C K D FC P e P f n S k P m P m,r,k P m,r Q f Q m Q f,r Q m,r,k m m,cr CR Transmission Power CR Sensing Power CR Tranmission Time CR Sensing Time CR Decision Report Signal Energy Consumption CR Circuit Energy Consumption Number of Cooperative Sensing CR Sum of Decision Bits from CR to DFC Average Reporting Cannel Error Probability False Alarm Probability at Eac CR Decision Tresold Sensed Cannels Number of PU Tat Are Active (Transmitting) Misdetection Probability Misdetection Probability for r PUs Wen k of Tem Are Active Total Misdetection Probability for r PUs at CR Network False Alarm Probability Network Misdetection Probability Network False Alarm Probability for r PUs Network Misdetection Probability Wen k out of r PUs Are Active Network Misdetection Tresold Misdetection Tresold on Eac CR

7 vi ABSTRACT Wen cognitive radio (CR) operates, it starts by sensing spectrum and looking for idle bandwidt. Tere are several metods for CR to make a decision on eiter te cannel is occupied or idle, for example, energy detection sceme, cyclostationary detection sceme and matcing filtering detection sceme [1]. Among tem, te most common metod is energy detection sceme because of its algoritm and implementation simplicities [2]. Tere are two major metods for sensing, te first one is to sense single cannel slot wit varying bandwidt, wereas te second one is to sense multiple cannels and eac wit same bandwidt. After sensing periods, samples are compared wit a preset detection tresold and a decision is made on eiter te primary user (PU) is transmitting or not. Sometimes te sensing and decision results can be erroneous, for example, false alarm error and misdetection error may occur. In order to better control error probabilities and improve CR network performance (i.e. energy efficiency), we introduce cooperative sensing; in wic several CR witin a certain range detect and make decisions on cannel availability togeter. Te decisions are transmitted to and analyzed by a data fusion center (DFC) to make a final decision on cannel availability. After te final decision is been made, DFC sends back te decision to te CRs in order to tell tem to stay idle or start to transmit data to secondary receiver (SR) witin a preset transmission time. After te transmission, a new cycle starts again wit sensing. In tis tesis, we find metods to maximize total energy efficiency of te cognitive radio network using closed form expressions, and wit te consideration on misdetection tresold on eac CR or te CR network in order to protect PU. Furtermore, we derives te

8 vii optimal fusion rule for DFC in order to maximize energy efficiency in a cooperative sensing environment. Finally compare between two difference sensing scemes and find te one wic furter maximize te energy efficiency. Tis tesis report is organized as followed: Capter II review some of te papers on optimizing CR energy efficiency. In Capter III, we study ow to acieve maximal energy efficiency wen CR senses single cannel wit canging bandwidt and wit constrain on misdetection tresold in order to protect PU; furtermore, a case study is given and we calculate te energy efficiency. In Capter IV, we study ow to acieve maximal energy efficiency wen CR senses multiple cannels and eac cannel wit same bandwidt, also, we preset a misdetection tresold and calculate te energy efficiency. A comparison will be sown between two sensing metods at te end of te capter. Finally, Capter V concludes tis tesis.

9 1 CHAPTER I INTRODUCTION Te Federal Communication Commission as allocated radio spectrum from 9 KHz to 275 GHz [3], and wit increasing amount of wireless transceiver devices and networks, we will encounter difficulties in assigning and licensing new wireless users due to scarcity in available spectrum in te near future. On te oter and, according to a survey done in Dublin Ireland [14], more tan 80 percent of spectrum is underutilized, and similarly for some major cities in te United States. Terefore, tere is a low spectrum utilization rate. Josep Mitola III, from Stevens Institute of Tecnology, foresaw tis problem and developed te concept of cognitive radio in te late 1990s and tis tecnology as since attracted muc attentions among scolars all around te world. CR does not ave a license for any radio frequency band. It accesses to cannels opportunistically wen te licensed user (PU) is not transmitting its signal. And jumps out from tat cannel in 2 seconds (IEEE ) after PU restarts to transmit its signal. A similar scenario is tat imagine you are at a movie teatre on your own and you forget to purcase a ticket. You want to sit down to watc te movie but te teatre is full. One way to watc te movie wile sitting down is to wait by te entrance door until someone stands up to go to use te restroom or answer an important pone call. Ten you can run to is or er seat and sit for a wile until e or se comes back, and you ave to leave te seat and wait by te entrance for te next opportunity. Besides alleviating spectrum scarcity issue, CR can be used for secured communication, since CR searc for available spectrum on itself and it is a type of frequency opping radio, we can apply tis tecnology for secured communication suc as on te battlefields.

10 2 CHAPTER II LITERATURE REVIEW ON CR ENERGY EFFICIENCY In tis capter, we coose and review some of te papers [4] [5] [6] [7] on optimizing energy efficiency in cognitive radio network. Some papers are on optimizing energy efficiency in sensing period [4] [5], some on energy efficiency optimization in transmission period [6], and finally a paper on CR overall circuit energy consumption by studying te tradeoff between sensing and transmission of te cognitive radio [7]. Paper [4] proposed a metod on optimizing te energy efficiency (or opportunity cost, as described in te paper) in sensing period of te cognitive radio network. In te paper, sensing period is divided into R rounds, and at eac round, CR is able to make a local decision on eiter te PU is transmitting or in idle for a specific cannel. Eac round is consisted of tree parts, spectrum sensing, decision report, and cannel switcing. Terefore, CR is able to sense R cannels during sensing period. After all CRs report teir decision to DFC, te DFC use a specific data fusion rule to produce a final decision on eiter PU is transmitting or not. Te sensing energy efficiency is described using total energy consumption (sum of energy consumption in spectrum sensing, decision report and cannel switcing) divides te amount of available bandwidt found in R rounds. Te metrics of energy efficiency is in Joule per Hz. Te paper later optimized suc energy efficiency wit te consideration of preset misdetection and false alarm probability. Anoter paper to mention on sensing energy efficiency is [5]. Te autors proposed an energy efficiency sensing sceme by using adaptive spectrum sensing algoritm and sequential sensing policy [5]. Te adaptive spectrum sensing algoritm was introduced since PU s active and idle probability and periods can be studied [5], in order to allow CR to limit

11 3 sensing time and give more opportunity for transmission and reduce missed spectrum opportunities. On te oter and, sequential sensing policy is to constrain two error probability, namely false alarm probability and misdetection probability. Te autors set two tresold for detection, λ1 and λ2. If received signal energy is greater tan λ2, ten CR decides tat PU is transmitting, wereas if received signal energy is less tan λ1, CR decides PU is not transmitting. And finally if received signal energy is between two tresolds, CR will collect more signal samples. By optimizing tese two tresold, te paper sows tat we can minimizing false alarm probability, wic allow more transmission opportunities for CR, and minimizing misdetection probability below a certain tresold in order to protect PU. Paper [6] introduced a metod to optimize transmission energy efficiency by optimizing transmission duration and power allocation to eac cannel. First, te autors sowed te model for energy efficiency for CR in a frame cycle, and it was a function of transmission duration. Ten tey derived te derivative of suc energy efficiency wit respect to transmission time and set te function equals to zero to find te optimal transmission duration. Next, te autors moved to te oter topic, wic is to find te optimal power allocation for K cannels under a preset transmission power budget. By using gradient assisted binary searc and binary searc assisted ascent [8], te autors sowed tat tere exist an optimal power allocation in transmission period for cognitive radio. Last but not least, Paper [7] maximize te overall energy efficiency of cognitive radio (bot in sensing and transmission periods). Te autors assumed power consumption during sensing period is mainly caused by low noise amplifier and analog to digital converter. Power amplifier, low noise amplifier and analog to digital converter contributes to te power consumption in transmission periods. Later on, te autors sowed tat in order to maximize

12 4 energy efficiency, one sould maximize sensing time, te ratio of te power consumption for power amplifier and analog to digital converter, bit resolution of te ADC and te input backoff of te power amplifier [7]. Since tere is no close form expression for teir energy efficiency expression. Te autors used numerical simulation to find te maximal energy efficiency. In general, tis literature review sows tat on te topic of energy efficiency maximization for cognitive radio network, some researc as been done on energy efficiency maximization in sensing period, transmission period and overall energy efficiency wit te consideration in misdetection probability but witout close form expression for maximal energy efficiency. In tis tesis work, we analyze two different sensing metods for CR at eac sensing period: sensing single cannel wit canging bandwidt and sensing multiple cannels eac wit same bandwidt. After tis, we find te optimal fusion rule wit constrain on misdetection probability using misdetection tresold for eac sensing case. And finally, we simulate te performance of energy efficiency. Terefore, compare wit oter works on energy efficiency in cognitive radio network, wic only maximize sensing or transmission energy efficiency, or maximize overall energy efficiency but witout a close form expression; te contribution of tis work is to find metods to maximize total energy efficiency of te cognitive radio network using closed form expressions wit a misdetection tresold on eac CR or te CR network in order to protect PU. Furtermore, we derives te optimal fusion rule for DFC wic elps CR network to maximize its energy efficiency, and finally we compare between two difference sensing scemes and analyze teir performance on maximizing energy efficiency.

13 5 CHAPTER III SENSING SINGLE CHANNEL OF VARYING BANDWIDTH Energy Detection Sceme and Error Probabilities In tis section, we first derive te pdf and CDF of received input samples. Assume ypotesis test 1 (H 1 ) is wen PU is transmitting its signal, ypotesis test 0 (H 0 ) is wen PU is not transmitting its signal. Assume CR receives inputs witout PU signal (H 0 ) are Gaussian random process wit zero mean, x(t) = n(t): N (0, σ 2 n ). And Assume CR received inputs wit PU signal (H 1 ) present is Gaussian random process wit nonzero mean x(t) = α s(t) + n(t): N (μ s, σ 2 n ). Wit some cannel fading factor α. x(t) = { α s(t) + n(t) H 1 n(t) H 0 (1. 1) According to Claude Sannon s sampling teorem [9], for a signal wit bandwidt B and is sampled in a time T s, we need 2T s B samples in order to acquire knowledge of te received signal completely. Te sampled signals are: 2T s B x(t) = (α s i (t) + n i (t)) H 1 i=1 2T s B n i (t) { i=1 H 0 (1. 2) Assume noise is additive wite Gaussian noise wit zero mean and variance σ n 2, and eac sample is a random variable wit zero mean and variance σ 2 i,n = σ 2 n, we divide every samples by noise standard deviation σ n ; ten te normalized noise sample as distribution of N (0,1). For energy detection, we square and sum eac received signal sample wit unit variance, and result a sum of te squares of 2T S B i.i.d random variables:

14 6 y(t) = { 2T s B ( α s 2 i(t) + n i (t) ) σ n i=1 2T s B ( n i(t) ) 2 σ n i=1 H 1 H 0 (1. 3) For H 0, we ave squares of 2T s B standard normalized Gaussian random variables, eac wit zero mean and unit variance. Terefore, it follows central ci-squared distribution wit 2T s B degrees of freedom. Te pdf of suc distribution according to reference [10] is: f Y (y, H 0 ) = 1 2 TsB Γ(T S B) ytsb 1 e y 2 (1. 4) Te complimentary CDF of te distribution at point λ is te false alarm probability [10] : P f = 1 F Y (λ, H 0 ) = Γ(T sb, λ 2 ) Γ(T s B) (1. 5) In wic Γ(. ) is gamma function and Γ(., b) is upper incomplete gamma function at point b. In te case of PU transmitting, Assume primary signal and noise are independent. Sampled normalized signals ave means of μ s = μ s,i = 1 2T 2T s B (α s i (t) s B ) σ n 1 and variances of 0. Ten te received inputs are normal distributed N (μ s, 1). Wic follows non-central ci-squared distribution wit 2T s B degrees of freedom. And te pdf of suc distribution is: f Y (y, H 1 ) = 1 2 e y+φ 2 ( y T s B 1 φ ) 2 I Ts B 1( φy) (1. 6) In wic φ is te non-centrality parameter and I a 1 ( b c) is te modified Bessel s function. We ave te misdetection probability (P m ) of eac CR according to reference [10] : P m = 1 Q Ts B( 2γ, λ) (1. 7) In wic Q a ( b, c) is Marcum-Q function and γ is SNR from PU and measured at CR. For now, we ave derived pdf and CDF of received input samples. In detection teory,

15 7 we always measure te performance of detector using false alarm probability (probability of CR decides PU is transmitting, given PU is actually not transmitting: P f = P(H H 1 0 ); and misdetection probability (probability of CR decides PU is not transmitting, given PU is actually transmitting: P m = P(H H 0 1 )). Accordingly, given a preset detection tresold λ for 2T s B samples, wic CR decides PU is transmitting if te sum of received signal power is above te tresold, and decides PU is idle if te sum is below λ, we can easily find out P f and P m for eac CR using CDF derived in equations (1.5) and (1.7). P f = P(y > λ H 0 ) = 1 F Y (λ, H 0 ) = Γ(T sb, λ 2 ) Γ(T s B) { P m = P(y < λ H 1 ) = 1 Q Ts B( 2γ, λ) (1. 8) Network Cannel Capacity and Energy Efficiency In tis section, we want to finally derive energy efficiency (bits per Joule) of te CR network. But first, we calculate transmission capacity of CR under correct detection (H 0, H ) 0 and misdetection (H 1, H ); 0 given sensing bandwidt W, detection tresold λ, amount of CRs and oter parameters. Assume te signal power transmitted to SR from CR, and measured at SR is P CS wit cannel gain. Assume sensing bandwidt is B and noise spectrum power is N 0. CR transmission cannel capacity of correct detection is: C d = Blog 2 (1 + P CS N 0 B ) Given te probability of CR transmission under tis condition is P(H 0, H ) 0 = P(H H 0 0 )P(H 0 ), te weigted transmission capacity of correct detection is terefore:

16 8 C d(weigted) = Blog 2 (1 + P CS N 0 B ) P(H H 0 0 )P(H 0 ) (1. 9) Similarly, te transmission capacity of misdetection is: C md = Blog 2 (1 + P CS N 0 B + P ) P In wic P P is signal power from PU measured at secondary network (CR-SU network) and g is te cannel gain from PU to secondary network. Probability of transmission under misdetection is P(H 1, H ) 0 = P(H H 0 1 )P(H 1 ). Te weigted transmission capacity of misdetection is: C md(weigted) = Blog 2 (1 + P CS N 0 B + P ) P(H H 0 1 )P(H 1 ) P (1. 10) Assume in cooperative sensing case, Q f is network false alarm probability and Q m is network misdetection probability, we ave P(H H 0 0 ) = (1 Q f ), and P(H H 0 1 ) = Q m, and te average CR cannel capacity is: C ave = B [log 2 (1 + P CS N 0 B ) (1 Q P f)p(h 0 ) CS + log 2 (1 + N 0 B + P ) Q mp(h 1 )] P (1. 11) Next, we give te energy consumption of CR network. Te total energy consumption of te network in one frame cycle is: E total = P T T T + (P S T S + E d + E C )K (1. 12) Equation (1.12) sows te total energy consumption of cooperative sensing CR network, P S is sensing power; T S is sensing time; P T T T is transmission energy from CR to SR. E d is one bit decision report signal energy from every CR to DFC; and finally E C is circuit energy consumption of CR. Hence; average energy efficiency in bits per watt is: Average energy efficiency = T TC ave E total (1. 13)

17 9 In te next section, we look at some famous data fusion rules suc as AND fusion rule and OR fusion rule; ten we sow te fusion rule tat can acieve maximal energy efficiency given preset misdetection tresold, in order to protect PU. Cooperative Sensing and Data Fusion Rules In te first section, we derived probability of false alarm and misdetection of eac CR during sensing period. Next, we discuss about different data fusion rules and network false alarm and misdetection probability. Assume tere are K CRs nearby wic are able to join cooperative sensing network (Fig.1), and eac CR sends one bit decision K i (i = 1,2,, K; K i = 0 or 1) to DFC. Te DFC receives Kk binary decisions and ten make a final decision using tese binary data. Assume decision tresold is n, and summation of received bits add up to be D FC. If te summation of te received bits is less tan decision tresold n, DFC decides PU is not transmitting. If te summation of te received bits is greater tan or equals to decision tresold n, te DFC decides PU is transmitting. We ave: K K i < n, H 0 i=1 D FC = K (1. 14) K i n, H 1 { i=1 Figure 1.1 a: CR Cooperative Sensing Network Diagram

18 10 Figure 1.1 b: CR Cooperative Sensing Network Scematics From previous studies on data fusion rules introduced in [10] and [11], we generalize following commonly used fusion rules: OR Fusion Rule Te one bit data sent from eac CR to DFC can be eiter 0 (PU idle) or 1 (PU transmitting). OR fusion rule allows DFC to make final decisions of PU is transmitting if one or more CR out of Kk CRs decide(s) PU is transmitting [10]. Assume Q f and Q m are te false alarm and misdetection probability in DFC s final decisions; we ave: K Q f = 1 (1 P f,i ) = 1 (1 Γ (T sw, λ 2 ) Γ(T s W) ) i=1 K K Q m = (P m,i ) = (Q Ts W( 2γ, λ )) { i=1 i=1 K i=1 (1. 15) Assume reporting cannel from eac CR to DFC is also fading cannel wit error probability P e,i (imperfect reporting cannel), and reporting errors in all cannels are identical and independent. Ten we ave P e,i (for i = 1,2,, K) = P e (Average reporting cannel error probability) and assume eac CR as same P f and P m : let { P f e = P f (1 P e ) + P e (1 P f ) P m e = P m (1 P e ) + P e (1 P m )

19 11 we ave { Q f = 1 (1 P f e ) K Q m = (P m e ) K { Q f = 1 [ (1 P f ) ( Q m = [ P m (1 P e ) + AND Fusion Rule AND fusion rule allows DFC to make final decisions of PU is transmitting if and only if all of te CRs decide(s) PU is transmitting. If even one CR decides PU is idle, te DFC will make a final decision tat PU is idle [10]. AND fusion rule is described below: { Q f = (P f e ) K Q m = 1 (1 P m e ) K { Q f = [ P f (1 P e ) + P e (1 P f )] k Q m = 1 [ (1 P m ) (1 P e ) + P e P m ] k n Out of K Fusion Rule Wen te amount of CRs tat join cooperative sensing is K, and decision tresold is n, we ave te general expression of te network false alarm and misdetection probability for n out of K fusion rule as described in equation (1.18): { K Q f = K ( l ) l=n K (P f e ) l (1 P f e ) K l Q m = 1 K ( l ) e l (1 P m) (P e K l m) l=n (1. 18) Wic OR fusion rule is equivalent as letting n = 1 in equation (1.18), and AND fusion rule is same as letting n = K in equation (1.18). Study on AND Fusion Rule wit Constrain on Misdetection Probability Among above fusion rules, we want to find te one wic gives maximal energy efficiency. According to equation (1.13), given te number of coop CR, we want to minimize false alarm probability wile maximize misdetection probability in order to maximize energy efficiency. According to te general equations for Q f and Q m given in equation (1.18), we ave:

20 12 K Q f,(n=k) = ( K l ) (P e f ) l (1 P e f ) K l = (P e f ) K l=k K 1 Q f,(n<k) = (P e f ) K + ( K { l ) (P e f ) l (1 P e f ) K l l=n for n = K for n < K (1. 19) Clearly, Q f,(n<k) is always greater tan Q f,(n=k), since te second term on te rigt side of equation for Q f,(n<k) is always greater tan 0 (for nonzero false alarm probability at eac CR). Terefore, for given K, in order to minimize false alarm probability, we sould use AND fusion rule, in wic decision tresold is equal to number of coop CRs. Next, we want to maximize misdetection probability: Q m,(n=k) = 1 (1 P e m ) K for n = K K 1 { Q m,(n<k) = 1 (1 P e m ) K ( K l ) (1 P e m ) l (P e m ) K l for n < K l=n (1. 20) Clearly, Q m,(n<k) is always less tan Q m,(n=k), since te tird term on te rigt side of equation for Q m,(n<k) is always greater tan 0 (for nonzero misdetection probability at eac CR). In conclusion, for given K, in order to maximize misdetection probability, we sould let n = K, wic is equivalent as using AND fusion rule. Furtermore, Figure 1.2 below sows te decrease of false alarm probability and increase of misdetection probability as te number of CRs increase; by setting P e m = P e f = In real applications, we want to transmit using maximal energy efficiency wit preset tresold for misdetection probability m, in order to protect PU. Next, we study ow to acieve maximal energy efficiency using AND fusion rule given m.

21 13 Figure 1.2: False Alarm Probability and Misdetection Probability According to equation (1.17), in order to let te network misdetection probability less tan or equal to m, misdetection probability at eac CR sould satisfy: { m Q m = 1 (1 P m e ) K P m e 1 (1 m ) (1 K ) (1. 21) From page 8 we ave: P m = P m e P e 1 (1 m) ( 1 K ) P e (1. 22) 1 2P e 1 2P e And also from equation (1.7), we ave P m = 1 Q Ts B( 2γ, λ) = ncx2cdf(λ, T S B, T S Bγ) (1. 23) In wic ncx2cdf(a, b, c) = j=0 j ( (1 2 c) e c 2 2) Pr[x j! b+2j x] (1. 24)

22 14 Equation (1.24) computes te non-central ci square cumulative distribution function at a, using degrees of freedom b and non-centrality parameter c [12]. And P m increases as λ increases. Next, according to [13] we ave: λ = ncx2inv(p m, T S B, T S Bγ) (1. 25) Wic ncx2inv(p m, T S B, T S Bγ) is inverse non-central ci square cumulative distribution function. Notice tat λ increases as P m increases. Terefore; by substituting P m wit rigt and side of equation (1.18) we ave: λ ncx2inv ( 1 (1 m) ( 1 K ) P e, T 1 2P S B, T S Bγ) (1. 26) e Furtermore, in equation (1.5), false alarm probability decreases as detection tresold λ increases (in wic 1 P f increases as λ increases). Terefore, in AND fusion rule, in order to minimize false alarm probability and maximize misdetection probability at eac CR wile ensuring misdetection probability is below preset misdetection tresold m, we sould maximize detection tresold λ and te maximal value is: λ max = ncx2inv ( 1 (1 m) ( 1 K ) P e, T 1 2P S B, T S Bγ) (1. 27) e For now, we ave learned ow to maximize energy efficiency, wic is to use AND fusion rule, and derived te optimal detection tresold in order to maximize energy efficiency wile ensuring misdetection probability is below misdetection tresold, in order to protect PUs. Next, we provide a case study and calculate te maximal energy efficiency. Figure 1.3: Flow Cart on Steps to Calculate Energy Efficiency

23 15 Case Study: Maximal Energy Efficiency Using AND Fusion Rule wit Misdetection Tresold Setting-up te Parameters Table 1.1: Spectrum Occupancy in Dublin, Ireland [14] Table 1.1 is from te survey of spectral occupancy in Dublin, Ireland [14]. In te survey, te available bandwidt is divided into 31 slots, from 30MHz to 3GHz. According to te data, we first calculate te average spectral occupancy and set 1MHz as one unit of cannel bandwidt and unit increment: 31 i=1(bandwidt i %occupancy i ) total scanned bandwidt(mhz) = 14.47% (1. 28)

24 16 Terefore, te average 1MHz spectral active probability P(H 1 ) is 14.47%, and spectral idle probability P(H 0 ) is 85.53%. Assume noise spectrum power N 0 = Watt/Hz, received PU power P P = 10 6 Watt. Assume BPSK modulation is used for decision reports from eac CR to DFC, and we coose to implement a low power consumption XTend transceiver [15] for CR to transmit its signals. Tis type of transceiver operates at frequency range of MHz, and it is compatible for DigiMesTM networking topology. We set 9.6Kb/s as transmission rate in order to minimize reporting cannel error probability since it is te minimal transmission rate, and set transmission power from CR to FC (P d ) and transmission power from CR to SR to be 1W, or 30dBm. Terefore, we ave bit energy E D = 0.104mJ. Furtermore, according to survey on pat loss in German cities sown in Figure 1.4, we coose te pass loss exponent to be 2.7. Assume all te CRs are at 50 meters away from FC, and SR is 200 meters away from CR. we ave decision report error probability as: P e = Q ( 2 P d N 0 W ) = Q ( 2 P d distance 2.7 ) (1. 29) N 0 W = Q( ) ,000 According to Figure 1.5 from [16], wic sows te relation between power consumption and sampling rate of analog to digital converter (ADC), and since most of te sensing power is consumed by ADC, we can approximate sensing power consumption using power consumption of ADC. Wen samples are in N bits and f S = 2B, Sensing power can be terefore described as: P S = N ( 2B 10 3) (μw) (1. 30)

25 17 Figure 1.4: Pat Loss vs Distance in German Cities [17] Figure 1.5: ADC Power Consumption vs Sampling Rate [16] Simulation Results Using AND Fusion Rule wit Different Misdetection Tresold All simulations and plots in te tesis use te parameters given below, unless oterwise mentioned in te plots caption.

26 18 Table 1.2: Summary of Parameters Parameters Parameter Value Note P(H 0 ) P(H 1 ) P e N 0 Pat Loss Exponent P P P CS P S 85.53% Average spectral idle probability in Dublin Ireland [11] 14.47% Average spectral occupied probability in Dublin Ireland [11] Reporting cannel error probability (from CR to DFC) Noise power spectral density 2.7 Found in pat loss vs distance in German cities [17] Watt Received PU signal power measured at CR 1 Watt CR transmission power to DFC and SR (30dBm) ( 2B 10 3) CR sensing power consumption (ADC power consumption) T s 10µS CR sensing time T T 1 T s CR transmission time 100KHz Bandwidt for eac cannel wen CR senses multiple cannels B0 E d E C d CS N 104µWatt Decision report transmission energy consumption CR circuit energy consumption in one frame cycle 200 meters Distance between CR and secondary receiver (SR) 12 Number of bits for ADC to scale te samples As sown above in Figure 1.6 a, X-axis is te number of cooperative sensing CRs, Y- axis is sensing bandwidt in ertz, and Z-axis (illustrated in color) is energy efficiency. Tere exist maximal energy efficiency in AND fusion rule wit a preset misdetection tresold (labeled in eac subplot). In te simulation, we found out as we increase misdetection tresold, we can acieve iger maximal energy efficiency. Te optimal number of CR decreases and optimal sensing bandwidt increases as misdetection tresold increases.

27 19 Figure 1.6 a: Energy Efficiency (Z-axis) vs Number of CR (X-axis) vs Sensing Bandwidt (Yaxis) Using AND Fusion Rule wit Different m Figure 1.6 b: Energy Efficiency vs Number of CR Using AND Fusion Rule (B=1MHz)

28 20 Next, we let te primary user active probability P(H 1 ) as a variable, and find optimal number of coop CR for given different P(H 1 ). Finally, we plot te relation between P(H 1 ) and optimal number of coop CR. We set misdetection tresold to 0.1 and sensing bandwidt to 1MHz. Figure 1.6 c: Energy Efficiency vs Number of CR wit Canging P(H 1 ) ( m = 0.1) As we can see from above, energy efficiency increases as we decreases P(H 1 ).

29 21 CHAPTER IV SENSING MULTIPLE CHANNELS OF SAME BANDWIDTH In tis capter, we study energy efficiency in CR networks wen CR senses multiple cannels and eac cannel wit same bandwidt. We can visualize tis problem by assuming tere are several PUs nearby and eac of tem uses its own cannel wit no overlap wit eac oter. CR senses multiple cannels eac wit same bandwidt instead of single cannel wit canging bandwidt. For simplicity, we assume eac cannel as same bandwidt. One Cognitive Radio wit Two Primary Users Assuming tere are 2 PUs nearby, and eac wic probability of transmission P(H 1 ) = and probability of idle (no transmission) P(H 0 ) = 1 P(H 1 ) = Figure 2.1: CR Network wit 1 CR and 2 PUs Te tradeoff between number of PUs and CR transmission bandwidt can be described as below: wen CR increases its sensing and transmission bandwidt, te network will ave an increase of data transmission rate as described in paper [18]. However, increasing CR bandwidt will inevitably causing collision wit PU s transmission. Figure 2.2 illustrated tis scenario:

30 22 Figure 2.2: CR Transmission Interfere wit Primary Transmissions As sown in Fig.2, assume PU use different cannels and as CR transmission bandwidt increases, te transmission bandwidt of CR intersects (overlaps) wit primary transmission bandwidt. Next, we look at misdetection probability. In general, we ave misdetection probability described as: P m = P(H 0 H 1 ) = P(H 0, H 1 ) P(H 1 ) (2. 1) As sown in equation (2.1), H 0 is wen PU is inactive (idle) and H 1 is wen PU is active (busy). Ten, we extend tis representation for 2 PUs present: H 00 means wen PU1 and PU2 are bot idle, H 01 is wen PU1 is idle wile PU2 is active. And so on for S PUs, in wic te representation of teir activity is described in form of H 01 10, as we will discuss in te next section. Wen tere are two PUs, we ave misdetection probability: P m,2 = P(H 0 H 1 ) = P(H 0, H 1 ) P(H 1 ) = P(H 0 H 1 ) = P(H 0 (H 01 H 10 H 11 ) P(H 1 ) P(H 1 ) = P(H 0 H 01 ) + P(H 0 H 10 ) + P(H 0 H 11 ) P(H 0 H 01 H 10 ) P(H 1 ) P(H 0 H 01 H 11 ) + P(H 0 H 10 H 11 ) P(H 0 H 01 H 10 H 11 ) P(H 1 ) (2. 2a)

31 23 We assume primary users transmissions are independent from eac oter s wit disjoint cannels and same bandwidt B 0 ; and since H 01, H 10 and H 11 are mutually exclusive events, we ave: P(H 01 H 10 ) = P(H 01 H 11 ) = P(H 10 H 11 ) = 0, and eventually P m,2 = P ((H 0 H 01 ) + (H 0 H 10 ) + (H 0 H 11 )) P(H 1 ) P(H 0 H 01 ) = P(H 0 H 01 )P(H 01 ) Furtermore, we ave: { P(H 0 H 10 ) = P(H 0 H 10 )P(H 10 ) P(H 0 H 11 ) = P(H 0 H 11 )P(H 11 ) and we adopt following (2. 2b) notations: P(H 0 H 01 ) = P m,01 { P(H 0 H 10 ) = P m,10 P(H 0 H 11 ) = P m,11 misdetection probability wen PU1 is idle and PU2 is active misdetection probability wen PU1 is active and PU2 is idle misdetection probability wen PU1 and PU2 are bot active In wicp m,01 means PU 1 is idle and PU 2 is active. Ten te misdetection probability wen tere are 2 PU can be expressed as: P m,2 = P(H 0 H 01 )P(H 01 ) + P(H 0 H 10 )P(H 10 ) + P(H 0 H 11 )P(H 11 ) P(H 01 ) + P(H 10 ) + P(H 11 ) = P m,01p(h 01 ) + P m,10 P(H 10 ) + P m,11 P(H 11 ) P(H 01 ) + P(H 10 ) + P(H 11 ) (2. 2c) For misdetection probability, we ave from equation (1.7) wit bandwidt B 0 : P m = 1 P d = 1 Q TS B 0 ( 2γ, λ) (2. 3) In wic γ is SNR from primary user and received at CR; λ is detection tresold and T S is sensing time. In te case wen tere are 2 PUs, we ave different SNR from PU to CR, depend on ow many of te PU is active:

32 24 P P γ PC01 = (SNR from PU, received by CR; wen PU1 is idle and PU2 is active) 2N 0 B 0 P P γ PC10 = (SNR from PU, received by CR; wen PU1 is idle and PU2 is active) 2N 0 B 0 γ { PC11 = 2P P (SNR from PU, received by CR; wen bot PU are active) 2N 0 B 0 In wic P P is transmission power from PU and measured at CR. Te misdetection probability described in equation (2.2) can be detailed into: P m,2 = P m,01p(h 01 ) + P m,10 P(H 10 ) + P m,11 P(H 11 ) P(H 01 ) + P(H 10 ) + P(H 11 ) = P(H 0)P(H 1 )(P m,01 + P m,10 ) + P(H 1 ) 2 P m,11 1 P(H 0 ) 2 = P(H 0)P(H 1 )[1 Q 2TS B 0 ( 2γ PC01, λ) + 1 Q 2TS B 0 ( 2γ PC10, λ)] + P(H 1 ) 2 (1 Q 2TS B 0 ( 2γ PC11, λ)) 1 P(H 0 ) 2 And false alarm probability P f for 2 PU is: (2. 4) P f,2 = Γ(2T sb 0, λ 2 ) Γ(2T s B 0 ) (2. 5) Cannel Capacities and Energy Efficiency wit Two PUs Total Cannel Capacity can be derived as below: Cannel Capacity = 2B 0 log(1 + γ CS00 ) (1 P f,2 )P(H 0 ) + 2B 0 log(1 + γ CS01 ) P m,01 P(H 0 )P(H 1 ) + 2B 0 log(1 + γ CS10 ) P m,10 P(H 1 )P(H 0 ) + 2B 0 log(1 + γ CS11 ) P m,11 P(H 1 )P(H 1 ) (2. 6) Note tat in te first term of equation (2.6), te probability of correct sensing is P(H 0 ), since te idle probability for single cannel is P(H 0 ), and te average amount of

33 25 cannel available given te S cannels is SP(H 0 ). Notations γ CSxx are te signal to noise ratio from CR and received at secondary user (SU), x can to replace by digit 0 (PU inactive) or 1 (PU active). And te descriptions for SINR from CR to SR are sown below: P CS γ CS00 = (SNR from CR to SU wen bot PUs are idle) 2N 0 B 0 P CS γ CS01 = (SINR from CR to SU, interfered by te first PU. ) 2N 0 B 0 + P P P CS γ CS10 = (SINR from CR to SU, interfered by te second PU. ) 2N 0 B 0 + P P P CS γ CS11 = (SINR from CR to SU, interfered by 2 PU) { 2N 0 B 0 + 2P P Te first term on te rigt and side of equation (2.6) is te trougput under correct detection given bot PUs are idle. Te second term is te trougput under misdetection given PU1 is idle and PU2 is active. Te tird term is te trougput under misdetection given PU1 is active and PU2 is idle. And te last term is te trougput under misdetection given bot PUs are active. Assume frame time (T F ) is 1 second, and sensing time plus transmission time equals frame time: T F = T S + T T. Te energy efficiency wen tere are 2 PUs is: Energy Efficiency = transmission time cannel capacity energy consumption in one frame = T T (2B 0 log(1 + γ CS00 ) (1 P f,2 )P(H 0 ) + 2B 0 log(1 + γ CS01 ) P m,01 P(H 0 )P(H 1 )) P s T S + P T T T + P C (T S + T T ) + T T(2B 0 log(1 + γ CS10 ) P m,10 P(H 1 )P(H 0 ) + 2B 0 log(1 + γ CS11 ) P m,11 P(H 1 ) 2 ) P s T S + P T T T + P C (T S + T T ) (2. 7)

34 26 One Cognitive Radio wit Multiple PUs Wen tere are S PUs nearby and all PU uses disjoint cannel wit same bandwidt B 0. Ten in te case of misdetection, te status of PUs can be from one of tem is active to all of tem are active. Wic can be described as: H PU(1) PU(S 1) are idle, only PU(S) is active (1 PU active) H PU(1) PU(S 2), PU(r) are idle, only PU(S 1) is active (1 PU active) H PU(1) PU(S 2) are idle, PU(S 1) and PU(S) are active (2 PUs active) { H PU(1) PU(S)are all active (all PUs active) In general, te total amount of 1 PU active cases is ( S 1 ) = S! (S 1)!1! = n; in wic (a b ) represents b -combinations of a set n. Similarly, te total amount of 2 PUs active cases is ( S 2 ) = S! (S 2)!2!. And so on for n PUs are active, wic is (S S ) = 1. Next, we derive misdetection probability wen tere are S PUs nearby. Te general expression for misdetection probability wen tere are r PUs is: P m,s = P(H 0 H 1 ) = P(H 0,H 1 ) P(H 1 ), and for te numerator: P(H 0, H 1 ) = P(H 0 (H 0 01 H 0 11 H 1 11 )) = P[(H 0 H 0 01 ) + + (H 0 H 0 11 ) + + (H 0 H 1 11 )] Since te rest of te term contains mutually exclusive events, we ave (H 0 H 0 01 H 0 11 ) = = (H 0 H 0 01 H 0 11 H 1 11 ) = Tere are ( S 1 ) = S cases wen 1 PU is active, (S ) cases wen 2 PUs are active and in 2 general, ( S ) cases wen k PUs are active. We ten ave for k PUs active: k P (H 0 H 0 1 ) = (P (H 0 H P (H 0 k 1s k 1s) H k 1s )) P(H 0 ) S k P(H 1 ) k

35 27 Note tat: P (H 0 H = = P (H 0 k 1s) Terefore, we ave: H k 1s ) = 1 Q STS B 0 ( 2 kp P SN 0 B 0, λ) P (H 0 H 0 1 ) k 1s = P(H 0 ) S k P(H 1 ) k [ ( 1 Q STS B 0 ( 2 kp P SN 0 B 0, λ) ) + + ( 1 Q STS B 0 ( 2 kp P totally ( S ) terms and eac term is identical wit one anoter k SN 0 B 0, λ) ) ] = ( S k ) P(H 0) S k P(H 1 ) k [1 Q STS B 0 ( 2 kp P SN 0 B 0, λ)] Hence, wen tere are S PUs nearby, te numerator of equation (2.1) is: P(H 0, H 1 ) = ( S 1 ) P(H 0) S 1 P(H 1 ) [1 Q STS B 0 ( 2, λ)] SN 0 B 0 P P + ( S 2 ) P(H 0) S 2 P(H 1 ) 2 [1 Q STS B 0 ( 2 2P P SN 0 B 0, λ)] ( S S ) P(H 0) S S P(H 1 ) S [1 Q STS B 0 ( 2 P P N 0 B 0, λ)] S = ( S k ) P(H 0) S k P(H 1 ) k [1 Q STS B 0 ( 2 kp P k=1 SN 0 B 0, λ)]

36 28 We let: P m,s,k = 1 Q STS B 0 ( 2 kp P wen k out of S PU is (are) active. And Let: SN 0 B 0, λ), wic is te misdetection probability P(H 0, H 1,k ) = ( S k ) P(H 0) (S k) P(H 1 ) k [1 Q STS B 0 ( 2 kp P, λ)] SN 0 B 0 We ten ave for S PUs, misdetection probability can be described as: P m,s = P(H 0, H 1 ) = P(H 0, H 1,1 ) + P(H 0, H 1,2 ) + + P(H 0, H 1,S ) P(H 1 ) 1 P(H 0 ) S = S k=1 ( S k ) P m,s,kp(h 0 ) (S k) P(H 1 ) k 1 P(H 0 ) S (2. 8) Similarly to Equation (2.5), false alarm probability for r PUs is: P f,s = P(H 1 H 0 ) = Γ(ST sb 0, λ 2 ) Γ(ST s B 0 ) (2. 9) Cannel Capacities and Energy Efficiency wit Multiple PUs According to Equation (2.6) and Part 4, te total Cannel Capacity wen tere are S PUs is sown below: Cannel Capacity (S PUs) = SB 0 (log (1 + P CS ) (1 P SN 0 B f,s )P(H 0 ) 0 + ( S 1 ) log (1 + P CS SN 0 B 0 + P ) P m,s,1p(h 0 ) S 1 P(H 1 ) P + ( S 2 ) log (1 + P CS SN 0 B 0 + 2P ) P m,s,2p(h 0 ) S 2 P(H 1 ) 2 + P + ( S S ) log (1 + P CS S(N 0 B 0 + P P ) ) P m,s,sp(h 0 ) S S P(H 1 ) S )

37 29 = SB 0 (log (1 + P CS ) (1 P SN 0 B f,s )P(H 0 ) 0 S + ( S k ) log (1 + P CS SN 0 B 0 + kp ) P m,s,kp(h 0 ) S k P(H 1 ) k ) (2. 10) P k=1 In general, wen CR transmission time is T T, energy efficiency of te CR network, wen tere are S PUs, is: Energy Efficiency = = T T SB 0 ( T T cannel capacity power consumption of one frame P CS log (1 + SN 0 B ) (1 P f,s )P(H 0 ) + S ( S 0 l ) log (1 + P CS l=1 SN 0 B 0 + lp ) P m,s,lp(h 0 ) S l P(H 1 ) l P P s T S + P T T T + P C (T S + T T ) (2. 11) ) Setting Misdetection Tresold on CRs In order to protect PU transmission and avoid excessive interference by CR transmission, we need to set a misdetection tresold ε m. Wen tere are S PUs in te sensing environment, te misdetection tresold sould be able to protect eac PU, and we assume eac are protected wit same misdetection tresold. Terefore, we ave to make sure tat te no matter ow many PUs are active, misdetection probability as to always less tan or equals to te preset misdetection tresold ε m. Or: P m,s,1 ε m P { m,s,2 ε m P m,s,s ε m Next, we look at te misdetection for S PUs wen k of tem are active P m,s,k :

38 30 P m,s,k = 1 Q STS B 0 ( 2 kp P SN 0 B 0, λ) (2. 12) As we can see from above, wen te number of active PU (k) increases, term increases and Q SN 0 B STS B 0 ( 2 kp P, λ) increases, wic leads to decrease in 0 SN 0 B 0 2 kp P misdetection probability. Terefore; misdetection probability decreases as te amount of active PU increase: P m,s,k P m,s,k+1. Intuitively tinking, as more PU are active, CR will receive a stronger signal wic leads to a decrease in sensing error probability. Moreover, we can see tat for given S PUs, we can assure misdetection probability is below preset misdetection tresold ε m if te misdetection probability of 1 PU active is below ε m : ten: if: P m,s,1 = 1 Q STS B 0 ( 2 P P P m,s,k = 1 Q STS B 0 ( 2 kp P SN 0 B 0, λ) ε m SN 0 B 0, λ) ε m for k 1,2,..., S Next, we look at te simulation of ε m, wic is te misdetection probability of one PU active wile te rest are idle: As we can see from Figure 2.3 below, for given amount of PUs, misdetection probability increases as preset detection tresold of eac sample since it is more understandable, for example, λ 2T s B λ increases (we use λ 2T s B 2T s B = 1.5 means we set detection tresold to be 1.5 times noise power). Intuitively tinking, te decrease of detection tresold is equivalent to increase CR sensing sensitivity.

39 31 Figure 2.3: Misdetection Probability vs Detection Tresold of Eac Sample Next, we derive te relation between misdetection and detection tresold of eac sample. Following Capter II section 4 and considering cannel error probability, we ave: P P λ ncx2inv (ε m, ST S B, ST S B ) SN 0 B 0 (2. 13) Note tat K is te number of CR and k is te number of active PU. According to equation (2.9) and (2.11), for a given false alarm probability, in order to increase cannel capacity and energy efficiency, we need to increase misdetection probability. Furtermore, for a fixed misdetection probability, in order to increase cannel capacity and energy efficiency, we sould decrease false alarm probability. From equation (2.9), we can easily see tat in order to decrease false alarm probability, we sould maximize λ. Terefore, λ sould be maximized in order to maximize energy efficiency (in te meanwile, misdetection probability, as a function of λ, sould also equals to or less tan preset misdetection tresold ε m ).

40 32 In general; for a given number of PUs, maximal energy efficiency is acieved wen P P λ opt = ncx2inv (ε m, ST S B, ST S B ) SN 0 B 0 (2. 14) Figure 2.4: Misdetection Tresold vs Detection Tresold of Eac Sample Next, we generate and plot maximal energy efficiency for given misdetection tresold wit different number of sensing cannels (eac cannel wit 100 KHz bandwidt). As sown in Fig.8 below, we calculated maximal energy efficiency given numbers of PUs under te constraint of preset misdetection tresold, in order to protect PU.

41 33 Figure. 2.5: Maximal Energy Efficiency vs Sensing Bandwidt (single CR) Figure 2.5 above sows acievable Maximal Energy Efficiency for different amount of PUs. Furtermore, te figure sows tat amount 0 to 10 PUs, global maximal energy efficiency point is at wen tere are 4 PUs, wit igest misdetection tresold (in tis case, ε m = 0.4) OR Fusion Rule wit K CRs and S PUs Wen tere are K CRs in te network, assume tey are all identical and ave same misdetection and false alarm probability given in te same sensing environment, for OR rule we ave: Q f,s = 1 (1 P e f,s ) K (2. 15) e Q m,s,k = (P m,s,k ) K ϵ m

42 34 e e In wic P f,s is false alarm probability and P m,s,k is misdetection probability wen k out of S PU are active, and superscript e means we are considering reporting cannel error probability. In wic: { P f,s e = P f,s (1 P e ) + P e (1 P f,s ) e P m,s,k = P m,s,k (1 P e ) + P e (1 P m,s,k ) (2. 16) Correspondently, Q f,s is network false alarm probability; Q m,s,k is misdetection probability at DFC wen k out of S PU are active. ϵ m is misdetection tresold. Next, we ave te expression for energy efficiency of 1 PU under cooperative sensing environment: And te energy efficiency for suc network is: Energy Efficiency = = T T SB 0 ( P CS T T cannel capacity power consumption of one frame S l=1 log (1 + ) (1 Q SN 0 B f,s ) P(H 0 ) + ( S 0 l ) log (1 + P CS SN 0 B 0 + lp ) Q m,s,l P(H 0) S l P(H 1 ) l P P T T T + (P s T S + P C (T S + T T )) K Note tat sensing power in tis case is calculated using equation (2.18) below: (2. 17) ) P S = N ( 2SB ) (μw) (2. 18) Case Study: AND Fusion Rule wit k CRs and S PUs Similar as OR fusion rule, for AND fusion rule wit K CRs and S PUs, we ave: { Q f,s = (P e f,s ) K e Q m,s,k = 1 (1 P m,s,k ) K (2. 19) ϵ m And te energy efficiency expression for AND fusion rule is same as te energy efficiency for OR fusion rule.

43 35 Note tat wen we are using cooperative sensing, we only need to ensure tat te network misdetection probability to be equal or less tan misdetection tresold: Q m ϵ m, since te final decision is given by DFC. Refer to section 5 from tis capter, we ave: if: P m,s,1 = 1 Q STS B 0 ( 2 P P SN 0 B 0, λ) ε m ten: P m,s,k = 1 Q STS B 0 ( 2 kp P SN 0 B 0, λ) ε m for k 1,2,..., S e Similarly for cooperative sensing case, since Q m,s,k monotone increases as P m,s,k increases, we ave: ten: e if: Q m,s,1 = 1 (1 P m,s,1 ) K ε m e Q m,s,k = 1 (1 P m,s,k ) K ε m for k 2,..., S By using misdetection tresold on eac CR instead of for te network, we ave: P m,s,1 = P e m,s,1 P e 1 (1 m) ( 1 K ) P e (2. 20) 1 2P e 1 2P e In wic te rigtmost term is misdetection tresold at eac CR. And as we described above, by maximizing detection tresold λ, we can maximize misdetection probability wile minimize false alarm probability. In cooperative sensing case, we ave: λ opt = ncx2inv ( 1 (1 m) ( 1 K ) P e, ST 1 2P S B, ST S B P P ) e SN 0 B 0 (2. 21) After finding te optimal detection tresold, we can calculate network false alarm and misdetection probability using equation (2.9), (2.12), (2.16), and (2.19); and use equation (2.17) to calculate energy efficiency of te CR network.

44 36 By using te same parameters presented in capter II, we can plot energy efficiency vs number of sensing cannels vs number of coop CR in Figure 2.6 a and b: Figure 2.6a: Energy Efficiency vs Number of Sensing Cannels vs Number of CRs Figure 2.6b: Energy Efficiency vs Number of CRs (AND Fusion Rule, 10 cannels)

45 37 Figure 2.6 c: Energy Efficiency vs Number of CR wit Canging P(H 1 ) ( m = 0.1, S = 5) Note tat sensing bandwidt equals to number of cannels times 100 KHz, in wic eac cannel is 100 KHz. By comparing figure 2.6 a and b above wit figure 1.5 a and b from capter 2, we can see tat cannel sensing metod does affects overall energy efficiency of te network. Te comparison sows tat sensing single cannel wit canging bandwidt can acieve iger energy efficiency tan sensing multiple cannels tat eac wit same bandwidt. Moreover, as we increase misdetection tresold, bot sensing metod sows tere is an increase in energy efficiency. In Capter II and III, we studied different fusion rules, different sensing metods and focused more on AND fusion rule for its ability to maximize misdetection probability wile minimizing false alarm probability for a given amount of CR. Also, we studied on setting misdetection tresold in order to protect PU from CR transmission interference. Te case study sows tat we can acieve maximal energy efficiency wile ensuring te protection of PU in a given environment.

46 38 CHAPTER V CONCLUSION AND FUTURE RESEARCH DIRECTIONS CR network can uses radio spectrum more efficiently because of its ability to searc for idle spectrum and access it opportunistically in order to transmit its own data Te study in tis tesis was to explore te metods to maximize energy efficiency of te CR network in order to enable green wireless network; Terefore, we can make CR network bot spectrum efficient and energy efficient. In Capter II, we proved tat for a given number of CR, AND fusion rule can maximize energy efficiency. And in Capter II and III, two different sensing scemes are presented, te first one is to sensing single cannel wic te bandwidt can be varied, and te next sensing sceme is to sense multiple cannels and assume eac cannel as same bandwidt. Furtermore, we studied about setting misdetection tresold on eac CR in order to protect primary user from excessive interference by CR. Te case study results sow tat by presetting misdetection probability and sensing bandwidt, tere exist a maximal energy efficiency point. And sensing single cannel wit varying bandwidt can be more energy efficient tan sensing multiple cannel slots eac wit same bandwidt. Future study on tis topic can be to find te optimal sensing time, transmission time or CR transmission power. In addition, more spectrum survey can be conducted in oter cities all around te world.

Exam 1 Review Solutions

Exam 1 Review Solutions Exam Review Solutions Please also review te old quizzes, and be sure tat you understand te omework problems. General notes: () Always give an algebraic reason for your answer (graps are not sufficient),

More information

HOW TO DEAL WITH FFT SAMPLING INFLUENCES ON ADEV CALCULATIONS

HOW TO DEAL WITH FFT SAMPLING INFLUENCES ON ADEV CALCULATIONS HOW TO DEAL WITH FFT SAMPLING INFLUENCES ON ADEV CALCULATIONS Po-Ceng Cang National Standard Time & Frequency Lab., TL, Taiwan 1, Lane 551, Min-Tsu Road, Sec. 5, Yang-Mei, Taoyuan, Taiwan 36 Tel: 886 3

More information

2.8 The Derivative as a Function

2.8 The Derivative as a Function .8 Te Derivative as a Function Typically, we can find te derivative of a function f at many points of its domain: Definition. Suppose tat f is a function wic is differentiable at every point of an open

More information

The derivative function

The derivative function Roberto s Notes on Differential Calculus Capter : Definition of derivative Section Te derivative function Wat you need to know already: f is at a point on its grap and ow to compute it. Wat te derivative

More information

Volume 29, Issue 3. Existence of competitive equilibrium in economies with multi-member households

Volume 29, Issue 3. Existence of competitive equilibrium in economies with multi-member households Volume 29, Issue 3 Existence of competitive equilibrium in economies wit multi-member ouseolds Noriisa Sato Graduate Scool of Economics, Waseda University Abstract Tis paper focuses on te existence of

More information

Preface. Here are a couple of warnings to my students who may be here to get a copy of what happened on a day that you missed.

Preface. Here are a couple of warnings to my students who may be here to get a copy of what happened on a day that you missed. Preface Here are my online notes for my course tat I teac ere at Lamar University. Despite te fact tat tese are my class notes, tey sould be accessible to anyone wanting to learn or needing a refreser

More information

232 Calculus and Structures

232 Calculus and Structures 3 Calculus and Structures CHAPTER 17 JUSTIFICATION OF THE AREA AND SLOPE METHODS FOR EVALUATING BEAMS Calculus and Structures 33 Copyrigt Capter 17 JUSTIFICATION OF THE AREA AND SLOPE METHODS 17.1 THE

More information

. If lim. x 2 x 1. f(x+h) f(x)

. If lim. x 2 x 1. f(x+h) f(x) Review of Differential Calculus Wen te value of one variable y is uniquely determined by te value of anoter variable x, ten te relationsip between x and y is described by a function f tat assigns a value

More information

Continuity and Differentiability Worksheet

Continuity and Differentiability Worksheet Continuity and Differentiability Workseet (Be sure tat you can also do te grapical eercises from te tet- Tese were not included below! Typical problems are like problems -3, p. 6; -3, p. 7; 33-34, p. 7;

More information

Efficient algorithms for for clone items detection

Efficient algorithms for for clone items detection Efficient algoritms for for clone items detection Raoul Medina, Caroline Noyer, and Olivier Raynaud Raoul Medina, Caroline Noyer and Olivier Raynaud LIMOS - Université Blaise Pascal, Campus universitaire

More information

Lab 6 Derivatives and Mutant Bacteria

Lab 6 Derivatives and Mutant Bacteria Lab 6 Derivatives and Mutant Bacteria Date: September 27, 20 Assignment Due Date: October 4, 20 Goal: In tis lab you will furter explore te concept of a derivative using R. You will use your knowledge

More information

Taylor Series and the Mean Value Theorem of Derivatives

Taylor Series and the Mean Value Theorem of Derivatives 1 - Taylor Series and te Mean Value Teorem o Derivatives Te numerical solution o engineering and scientiic problems described by matematical models oten requires solving dierential equations. Dierential

More information

Numerical Differentiation

Numerical Differentiation Numerical Differentiation Finite Difference Formulas for te first derivative (Using Taylor Expansion tecnique) (section 8.3.) Suppose tat f() = g() is a function of te variable, and tat as 0 te function

More information

ESTIMATION OF TIME-DOMAIN FREQUENCY STABILITY BASED ON PHASE NOISE MEASUREMENT

ESTIMATION OF TIME-DOMAIN FREQUENCY STABILITY BASED ON PHASE NOISE MEASUREMENT ESTIMATION OF TIME-DOMAIN FREQUENCY STABILITY BASED ON PHASE NOISE MEASUREMENT P. C. Cang, H. M. Peng, and S. Y. Lin National Standard Time & Frequenc Laborator, TL, Taiwan, Lane 55, Min-Tsu Road, Sec.

More information

MVT and Rolle s Theorem

MVT and Rolle s Theorem AP Calculus CHAPTER 4 WORKSHEET APPLICATIONS OF DIFFERENTIATION MVT and Rolle s Teorem Name Seat # Date UNLESS INDICATED, DO NOT USE YOUR CALCULATOR FOR ANY OF THESE QUESTIONS In problems 1 and, state

More information

How to Find the Derivative of a Function: Calculus 1

How to Find the Derivative of a Function: Calculus 1 Introduction How to Find te Derivative of a Function: Calculus 1 Calculus is not an easy matematics course Te fact tat you ave enrolled in suc a difficult subject indicates tat you are interested in te

More information

Chapter 5 FINITE DIFFERENCE METHOD (FDM)

Chapter 5 FINITE DIFFERENCE METHOD (FDM) MEE7 Computer Modeling Tecniques in Engineering Capter 5 FINITE DIFFERENCE METHOD (FDM) 5. Introduction to FDM Te finite difference tecniques are based upon approximations wic permit replacing differential

More information

INTRODUCTION AND MATHEMATICAL CONCEPTS

INTRODUCTION AND MATHEMATICAL CONCEPTS Capter 1 INTRODUCTION ND MTHEMTICL CONCEPTS PREVIEW Tis capter introduces you to te basic matematical tools for doing pysics. You will study units and converting between units, te trigonometric relationsips

More information

Chapter 2 Limits and Continuity

Chapter 2 Limits and Continuity 4 Section. Capter Limits and Continuity Section. Rates of Cange and Limits (pp. 6) Quick Review.. f () ( ) () 4 0. f () 4( ) 4. f () sin sin 0 4. f (). 4 4 4 6. c c c 7. 8. c d d c d d c d c 9. 8 ( )(

More information

HOMEWORK HELP 2 FOR MATH 151

HOMEWORK HELP 2 FOR MATH 151 HOMEWORK HELP 2 FOR MATH 151 Here we go; te second round of omework elp. If tere are oters you would like to see, let me know! 2.4, 43 and 44 At wat points are te functions f(x) and g(x) = xf(x)continuous,

More information

Multi-User Communication: Capacity, Duality, and Cooperation. Nihar Jindal Stanford University Dept. of Electrical Engineering

Multi-User Communication: Capacity, Duality, and Cooperation. Nihar Jindal Stanford University Dept. of Electrical Engineering Multi-User Communication: Capacity, Duality, and Cooperation Niar Jindal Stanford University Dept. of Electrical Engineering February 3, 004 Wireless Communication Vision Cellular Networks Wireless LAN

More information

Characterization of Relay Channels Using the Bhattacharyya Parameter

Characterization of Relay Channels Using the Bhattacharyya Parameter Caracterization of Relay Cannels Using te Battacaryya Parameter Josepine P. K. Cu, Andrew W. Ecford, and Raviraj S. Adve Dept. of Electrical and Computer Engineering, University of Toronto, Toronto, Ontario,

More information

Bayesian ML Sequence Detection for ISI Channels

Bayesian ML Sequence Detection for ISI Channels Bayesian ML Sequence Detection for ISI Cannels Jill K. Nelson Department of Electrical and Computer Engineering George Mason University Fairfax, VA 030 Email: jnelson@gmu.edu Andrew C. Singer Department

More information

INTRODUCTION AND MATHEMATICAL CONCEPTS

INTRODUCTION AND MATHEMATICAL CONCEPTS INTODUCTION ND MTHEMTICL CONCEPTS PEVIEW Tis capter introduces you to te basic matematical tools for doing pysics. You will study units and converting between units, te trigonometric relationsips of sine,

More information

MIMO decorrelation for visible light communication based on angle optimization

MIMO decorrelation for visible light communication based on angle optimization MIMO decorrelation for visible ligt communication based on angle optimization Haiyong Zang, and Yijun Zu Citation: AIP Conference Proceedings 80, 09005 (07); View online: ttps://doi.org/0.03/.4977399 View

More information

Polynomial Interpolation

Polynomial Interpolation Capter 4 Polynomial Interpolation In tis capter, we consider te important problem of approximatinga function fx, wose values at a set of distinct points x, x, x,, x n are known, by a polynomial P x suc

More information

REVIEW LAB ANSWER KEY

REVIEW LAB ANSWER KEY REVIEW LAB ANSWER KEY. Witout using SN, find te derivative of eac of te following (you do not need to simplify your answers): a. f x 3x 3 5x x 6 f x 3 3x 5 x 0 b. g x 4 x x x notice te trick ere! x x g

More information

2.11 That s So Derivative

2.11 That s So Derivative 2.11 Tat s So Derivative Introduction to Differential Calculus Just as one defines instantaneous velocity in terms of average velocity, we now define te instantaneous rate of cange of a function at a point

More information

Consider a function f we ll specify which assumptions we need to make about it in a minute. Let us reformulate the integral. 1 f(x) dx.

Consider a function f we ll specify which assumptions we need to make about it in a minute. Let us reformulate the integral. 1 f(x) dx. Capter 2 Integrals as sums and derivatives as differences We now switc to te simplest metods for integrating or differentiating a function from its function samples. A careful study of Taylor expansions

More information

Average Rate of Change

Average Rate of Change Te Derivative Tis can be tougt of as an attempt to draw a parallel (pysically and metaporically) between a line and a curve, applying te concept of slope to someting tat isn't actually straigt. Te slope

More information

5.1 We will begin this section with the definition of a rational expression. We

5.1 We will begin this section with the definition of a rational expression. We Basic Properties and Reducing to Lowest Terms 5.1 We will begin tis section wit te definition of a rational epression. We will ten state te two basic properties associated wit rational epressions and go

More information

A Reconsideration of Matter Waves

A Reconsideration of Matter Waves A Reconsideration of Matter Waves by Roger Ellman Abstract Matter waves were discovered in te early 20t century from teir wavelengt, predicted by DeBroglie, Planck's constant divided by te particle's momentum,

More information

Learning based super-resolution land cover mapping

Learning based super-resolution land cover mapping earning based super-resolution land cover mapping Feng ing, Yiang Zang, Giles M. Foody IEEE Fellow, Xiaodong Xiuua Zang, Siming Fang, Wenbo Yun Du is work was supported in part by te National Basic Researc

More information

Material for Difference Quotient

Material for Difference Quotient Material for Difference Quotient Prepared by Stepanie Quintal, graduate student and Marvin Stick, professor Dept. of Matematical Sciences, UMass Lowell Summer 05 Preface Te following difference quotient

More information

Physically Based Modeling: Principles and Practice Implicit Methods for Differential Equations

Physically Based Modeling: Principles and Practice Implicit Methods for Differential Equations Pysically Based Modeling: Principles and Practice Implicit Metods for Differential Equations David Baraff Robotics Institute Carnegie Mellon University Please note: Tis document is 997 by David Baraff

More information

Combining functions: algebraic methods

Combining functions: algebraic methods Combining functions: algebraic metods Functions can be added, subtracted, multiplied, divided, and raised to a power, just like numbers or algebra expressions. If f(x) = x 2 and g(x) = x + 2, clearly f(x)

More information

Exercises for numerical differentiation. Øyvind Ryan

Exercises for numerical differentiation. Øyvind Ryan Exercises for numerical differentiation Øyvind Ryan February 25, 2013 1. Mark eac of te following statements as true or false. a. Wen we use te approximation f (a) (f (a +) f (a))/ on a computer, we can

More information

Chapter 2 Performance Analysis of Call-Handling Processes in Buffered Cellular Wireless Networks

Chapter 2 Performance Analysis of Call-Handling Processes in Buffered Cellular Wireless Networks Capter 2 Performance Analysis of Call-Handling Processes in Buffered Cellular Wireless Networks In tis capter effective numerical computational procedures to calculate QoS (Quality of Service) metrics

More information

Service Outage Based Power and Rate Allocation

Service Outage Based Power and Rate Allocation 1 Service Outage Based Power and Rate Allocation Jiangong Luo, Lang Lin, Roy Yates, and Predrag Spasojević Abstract Tis paper combines te concepts of ergodic capacity and capacity versus outage for fading

More information

WYSE Academic Challenge 2004 Sectional Mathematics Solution Set

WYSE Academic Challenge 2004 Sectional Mathematics Solution Set WYSE Academic Callenge 00 Sectional Matematics Solution Set. Answer: B. Since te equation can be written in te form x + y, we ave a major 5 semi-axis of lengt 5 and minor semi-axis of lengt. Tis means

More information

1 The concept of limits (p.217 p.229, p.242 p.249, p.255 p.256) 1.1 Limits Consider the function determined by the formula 3. x since at this point

1 The concept of limits (p.217 p.229, p.242 p.249, p.255 p.256) 1.1 Limits Consider the function determined by the formula 3. x since at this point MA00 Capter 6 Calculus and Basic Linear Algebra I Limits, Continuity and Differentiability Te concept of its (p.7 p.9, p.4 p.49, p.55 p.56). Limits Consider te function determined by te formula f Note

More information

Symmetry Labeling of Molecular Energies

Symmetry Labeling of Molecular Energies Capter 7. Symmetry Labeling of Molecular Energies Notes: Most of te material presented in tis capter is taken from Bunker and Jensen 1998, Cap. 6, and Bunker and Jensen 2005, Cap. 7. 7.1 Hamiltonian Symmetry

More information

Chapter 2. Limits and Continuity 16( ) 16( 9) = = 001. Section 2.1 Rates of Change and Limits (pp ) Quick Review 2.1

Chapter 2. Limits and Continuity 16( ) 16( 9) = = 001. Section 2.1 Rates of Change and Limits (pp ) Quick Review 2.1 Capter Limits and Continuity Section. Rates of Cange and Limits (pp. 969) Quick Review..... f ( ) ( ) ( ) 0 ( ) f ( ) f ( ) sin π sin π 0 f ( ). < < < 6. < c c < < c 7. < < < < < 8. 9. 0. c < d d < c

More information

Lecture 15. Interpolation II. 2 Piecewise polynomial interpolation Hermite splines

Lecture 15. Interpolation II. 2 Piecewise polynomial interpolation Hermite splines Lecture 5 Interpolation II Introduction In te previous lecture we focused primarily on polynomial interpolation of a set of n points. A difficulty we observed is tat wen n is large, our polynomial as to

More information

The Krewe of Caesar Problem. David Gurney. Southeastern Louisiana University. SLU 10541, 500 Western Avenue. Hammond, LA

The Krewe of Caesar Problem. David Gurney. Southeastern Louisiana University. SLU 10541, 500 Western Avenue. Hammond, LA Te Krewe of Caesar Problem David Gurney Souteastern Louisiana University SLU 10541, 500 Western Avenue Hammond, LA 7040 June 19, 00 Krewe of Caesar 1 ABSTRACT Tis paper provides an alternative to te usual

More information

SECTION 1.10: DIFFERENCE QUOTIENTS LEARNING OBJECTIVES

SECTION 1.10: DIFFERENCE QUOTIENTS LEARNING OBJECTIVES (Section.0: Difference Quotients).0. SECTION.0: DIFFERENCE QUOTIENTS LEARNING OBJECTIVES Define average rate of cange (and average velocity) algebraically and grapically. Be able to identify, construct,

More information

Printed Name: Section #: Instructor:

Printed Name: Section #: Instructor: Printed Name: Section #: Instructor: Please do not ask questions during tis exam. If you consider a question to be ambiguous, state your assumptions in te margin and do te best you can to provide te correct

More information

2011 Fermat Contest (Grade 11)

2011 Fermat Contest (Grade 11) Te CENTRE for EDUCATION in MATHEMATICS and COMPUTING 011 Fermat Contest (Grade 11) Tursday, February 4, 011 Solutions 010 Centre for Education in Matematics and Computing 011 Fermat Contest Solutions Page

More information

5 Ordinary Differential Equations: Finite Difference Methods for Boundary Problems

5 Ordinary Differential Equations: Finite Difference Methods for Boundary Problems 5 Ordinary Differential Equations: Finite Difference Metods for Boundary Problems Read sections 10.1, 10.2, 10.4 Review questions 10.1 10.4, 10.8 10.9, 10.13 5.1 Introduction In te previous capters we

More information

Differential Calculus (The basics) Prepared by Mr. C. Hull

Differential Calculus (The basics) Prepared by Mr. C. Hull Differential Calculus Te basics) A : Limits In tis work on limits, we will deal only wit functions i.e. tose relationsips in wic an input variable ) defines a unique output variable y). Wen we work wit

More information

Notes on Neural Networks

Notes on Neural Networks Artificial neurons otes on eural etwors Paulo Eduardo Rauber 205 Consider te data set D {(x i y i ) i { n} x i R m y i R d } Te tas of supervised learning consists on finding a function f : R m R d tat

More information

Teaching Differentiation: A Rare Case for the Problem of the Slope of the Tangent Line

Teaching Differentiation: A Rare Case for the Problem of the Slope of the Tangent Line Teacing Differentiation: A Rare Case for te Problem of te Slope of te Tangent Line arxiv:1805.00343v1 [mat.ho] 29 Apr 2018 Roman Kvasov Department of Matematics University of Puerto Rico at Aguadilla Aguadilla,

More information

2.3 Product and Quotient Rules

2.3 Product and Quotient Rules .3. PRODUCT AND QUOTIENT RULES 75.3 Product and Quotient Rules.3.1 Product rule Suppose tat f and g are two di erentiable functions. Ten ( g (x)) 0 = f 0 (x) g (x) + g 0 (x) See.3.5 on page 77 for a proof.

More information

3.4 Worksheet: Proof of the Chain Rule NAME

3.4 Worksheet: Proof of the Chain Rule NAME Mat 1170 3.4 Workseet: Proof of te Cain Rule NAME Te Cain Rule So far we are able to differentiate all types of functions. For example: polynomials, rational, root, and trigonometric functions. We are

More information

3. THE EXCHANGE ECONOMY

3. THE EXCHANGE ECONOMY Essential Microeconomics -1-3. THE EXCHNGE ECONOMY Pareto efficient allocations 2 Edgewort box analysis 5 Market clearing prices 13 Walrasian Equilibrium 16 Equilibrium and Efficiency 22 First welfare

More information

Characterization of reducible hexagons and fast decomposition of elementary benzenoid graphs

Characterization of reducible hexagons and fast decomposition of elementary benzenoid graphs Discrete Applied Matematics 156 (2008) 1711 1724 www.elsevier.com/locate/dam Caracterization of reducible exagons and fast decomposition of elementary benzenoid graps Andrej Taranenko, Aleksander Vesel

More information

Chapters 19 & 20 Heat and the First Law of Thermodynamics

Chapters 19 & 20 Heat and the First Law of Thermodynamics Capters 19 & 20 Heat and te First Law of Termodynamics Te Zerot Law of Termodynamics Te First Law of Termodynamics Termal Processes Te Second Law of Termodynamics Heat Engines and te Carnot Cycle Refrigerators,

More information

Copyright c 2008 Kevin Long

Copyright c 2008 Kevin Long Lecture 4 Numerical solution of initial value problems Te metods you ve learned so far ave obtained closed-form solutions to initial value problems. A closedform solution is an explicit algebriac formula

More information

lecture 26: Richardson extrapolation

lecture 26: Richardson extrapolation 43 lecture 26: Ricardson extrapolation 35 Ricardson extrapolation, Romberg integration Trougout numerical analysis, one encounters procedures tat apply some simple approximation (eg, linear interpolation)

More information

Quantum Numbers and Rules

Quantum Numbers and Rules OpenStax-CNX module: m42614 1 Quantum Numbers and Rules OpenStax College Tis work is produced by OpenStax-CNX and licensed under te Creative Commons Attribution License 3.0 Abstract Dene quantum number.

More information

Ratio estimation using stratified ranked set sample

Ratio estimation using stratified ranked set sample METRON - International Journal of Statistics 003, vol. LXI, n. 1, pp. 75-90 HANI M. SAMAWI MAHMOUD I. SIAM Ratio estimation using stratified ranked set sample Summary - Ratio estimation metod is used to

More information

Homework 1 Due: Wednesday, September 28, 2016

Homework 1 Due: Wednesday, September 28, 2016 0-704 Information Processing and Learning Fall 06 Homework Due: Wednesday, September 8, 06 Notes: For positive integers k, [k] := {,..., k} denotes te set of te first k positive integers. Wen p and Y q

More information

EFFICIENCY OF MODEL-ASSISTED REGRESSION ESTIMATORS IN SAMPLE SURVEYS

EFFICIENCY OF MODEL-ASSISTED REGRESSION ESTIMATORS IN SAMPLE SURVEYS Statistica Sinica 24 2014, 395-414 doi:ttp://dx.doi.org/10.5705/ss.2012.064 EFFICIENCY OF MODEL-ASSISTED REGRESSION ESTIMATORS IN SAMPLE SURVEYS Jun Sao 1,2 and Seng Wang 3 1 East Cina Normal University,

More information

Polynomial Interpolation

Polynomial Interpolation Capter 4 Polynomial Interpolation In tis capter, we consider te important problem of approximating a function f(x, wose values at a set of distinct points x, x, x 2,,x n are known, by a polynomial P (x

More information

THE IDEA OF DIFFERENTIABILITY FOR FUNCTIONS OF SEVERAL VARIABLES Math 225

THE IDEA OF DIFFERENTIABILITY FOR FUNCTIONS OF SEVERAL VARIABLES Math 225 THE IDEA OF DIFFERENTIABILITY FOR FUNCTIONS OF SEVERAL VARIABLES Mat 225 As we ave seen, te definition of derivative for a Mat 111 function g : R R and for acurveγ : R E n are te same, except for interpretation:

More information

1 Calculus. 1.1 Gradients and the Derivative. Q f(x+h) f(x)

1 Calculus. 1.1 Gradients and the Derivative. Q f(x+h) f(x) Calculus. Gradients and te Derivative Q f(x+) δy P T δx R f(x) 0 x x+ Let P (x, f(x)) and Q(x+, f(x+)) denote two points on te curve of te function y = f(x) and let R denote te point of intersection of

More information

IEOR 165 Lecture 10 Distribution Estimation

IEOR 165 Lecture 10 Distribution Estimation IEOR 165 Lecture 10 Distribution Estimation 1 Motivating Problem Consider a situation were we ave iid data x i from some unknown distribution. One problem of interest is estimating te distribution tat

More information

Regularized Regression

Regularized Regression Regularized Regression David M. Blei Columbia University December 5, 205 Modern regression problems are ig dimensional, wic means tat te number of covariates p is large. In practice statisticians regularize

More information

SECTION 3.2: DERIVATIVE FUNCTIONS and DIFFERENTIABILITY

SECTION 3.2: DERIVATIVE FUNCTIONS and DIFFERENTIABILITY (Section 3.2: Derivative Functions and Differentiability) 3.2.1 SECTION 3.2: DERIVATIVE FUNCTIONS and DIFFERENTIABILITY LEARNING OBJECTIVES Know, understand, and apply te Limit Definition of te Derivative

More information

Dedicated to the 70th birthday of Professor Lin Qun

Dedicated to the 70th birthday of Professor Lin Qun Journal of Computational Matematics, Vol.4, No.3, 6, 4 44. ACCELERATION METHODS OF NONLINEAR ITERATION FOR NONLINEAR PARABOLIC EQUATIONS Guang-wei Yuan Xu-deng Hang Laboratory of Computational Pysics,

More information

HARMONIC ALLOCATION TO MV CUSTOMERS IN RURAL DISTRIBUTION SYSTEMS

HARMONIC ALLOCATION TO MV CUSTOMERS IN RURAL DISTRIBUTION SYSTEMS HARMONIC ALLOCATION TO MV CUSTOMERS IN RURAL DISTRIBUTION SYSTEMS V Gosbell University of Wollongong Department of Electrical, Computer & Telecommunications Engineering, Wollongong, NSW 2522, Australia

More information

The Priestley-Chao Estimator

The Priestley-Chao Estimator Te Priestley-Cao Estimator In tis section we will consider te Pristley-Cao estimator of te unknown regression function. It is assumed tat we ave a sample of observations (Y i, x i ), i = 1,..., n wic are

More information

ch (for some fixed positive number c) reaching c

ch (for some fixed positive number c) reaching c GSTF Journal of Matematics Statistics and Operations Researc (JMSOR) Vol. No. September 05 DOI 0.60/s4086-05-000-z Nonlinear Piecewise-defined Difference Equations wit Reciprocal and Cubic Terms Ramadan

More information

Printed Name: Section #: Instructor:

Printed Name: Section #: Instructor: Printed Name: Section #: Instructor: Please do not ask questions during tis exam. If you consider a question to be ambiguous, state your assumptions in te margin and do te best you can to provide te correct

More information

The Verlet Algorithm for Molecular Dynamics Simulations

The Verlet Algorithm for Molecular Dynamics Simulations Cemistry 380.37 Fall 2015 Dr. Jean M. Standard November 9, 2015 Te Verlet Algoritm for Molecular Dynamics Simulations Equations of motion For a many-body system consisting of N particles, Newton's classical

More information

FUNDAMENTAL ECONOMICS Vol. I - Walrasian and Non-Walrasian Microeconomics - Anjan Mukherji WALRASIAN AND NON-WALRASIAN MICROECONOMICS

FUNDAMENTAL ECONOMICS Vol. I - Walrasian and Non-Walrasian Microeconomics - Anjan Mukherji WALRASIAN AND NON-WALRASIAN MICROECONOMICS FUNDAMENTAL ECONOMICS Vol. I - Walrasian and Non-Walrasian Microeconomics - Anjan Mukerji WALRASIAN AND NON-WALRASIAN MICROECONOMICS Anjan Mukerji Center for Economic Studies and Planning, Jawaarlal Neru

More information

Applied Linear Statistical Models. Simultaneous Inference Topics. Simultaneous Estimation of β 0 and β 1 Issues. Simultaneous Inference. Dr.

Applied Linear Statistical Models. Simultaneous Inference Topics. Simultaneous Estimation of β 0 and β 1 Issues. Simultaneous Inference. Dr. Applied Linear Statistical Models Simultaneous Inference Dr. DH Jones Simultaneous Inference Topics Simultaneous estimation of β 0 and β 1 Bonferroni Metod Simultaneous estimation of several mean responses

More information

MAT244 - Ordinary Di erential Equations - Summer 2016 Assignment 2 Due: July 20, 2016

MAT244 - Ordinary Di erential Equations - Summer 2016 Assignment 2 Due: July 20, 2016 MAT244 - Ordinary Di erential Equations - Summer 206 Assignment 2 Due: July 20, 206 Full Name: Student #: Last First Indicate wic Tutorial Section you attend by filling in te appropriate circle: Tut 0

More information

MATH 1020 Answer Key TEST 2 VERSION B Fall Printed Name: Section #: Instructor:

MATH 1020 Answer Key TEST 2 VERSION B Fall Printed Name: Section #: Instructor: Printed Name: Section #: Instructor: Please do not ask questions during tis exam. If you consider a question to be ambiguous, state your assumptions in te margin and do te best you can to provide te correct

More information

3.1 Extreme Values of a Function

3.1 Extreme Values of a Function .1 Etreme Values of a Function Section.1 Notes Page 1 One application of te derivative is finding minimum and maimum values off a grap. In precalculus we were only able to do tis wit quadratics by find

More information

4. The slope of the line 2x 7y = 8 is (a) 2/7 (b) 7/2 (c) 2 (d) 2/7 (e) None of these.

4. The slope of the line 2x 7y = 8 is (a) 2/7 (b) 7/2 (c) 2 (d) 2/7 (e) None of these. Mat 11. Test Form N Fall 016 Name. Instructions. Te first eleven problems are wort points eac. Te last six problems are wort 5 points eac. For te last six problems, you must use relevant metods of algebra

More information

Derivation Of The Schwarzschild Radius Without General Relativity

Derivation Of The Schwarzschild Radius Without General Relativity Derivation Of Te Scwarzscild Radius Witout General Relativity In tis paper I present an alternative metod of deriving te Scwarzscild radius of a black ole. Te metod uses tree of te Planck units formulas:

More information

DC/DC Power Modules W

DC/DC Power Modules W PKV 3000 I PKV 5000 I DC/DC Power Modules 1.65 3 W PKV 3000 I PKV 5000 I Wide input voltage range, 9 36V, 18 72V Hig efficiency 74 83% typical Low idling power Full output power up to +75 C ambient temperature

More information

arxiv: v2 [quant-ph] 24 Oct 2016

arxiv: v2 [quant-ph] 24 Oct 2016 Projecting 3D color codes onto 3D toric codes Arun B. Alosious and Pradeep Kiran Sarvepalli Department of Electrical Engineering, Indian Institute of Tecnology Madras, Cennai 600 036, India (Dated: October

More information

Click here to see an animation of the derivative

Click here to see an animation of the derivative Differentiation Massoud Malek Derivative Te concept of derivative is at te core of Calculus; It is a very powerful tool for understanding te beavior of matematical functions. It allows us to optimize functions,

More information

Higher Derivatives. Differentiable Functions

Higher Derivatives. Differentiable Functions Calculus 1 Lia Vas Higer Derivatives. Differentiable Functions Te second derivative. Te derivative itself can be considered as a function. Te instantaneous rate of cange of tis function is te second derivative.

More information

University Mathematics 2

University Mathematics 2 University Matematics 2 1 Differentiability In tis section, we discuss te differentiability of functions. Definition 1.1 Differentiable function). Let f) be a function. We say tat f is differentiable at

More information

Pre-Calculus Review Preemptive Strike

Pre-Calculus Review Preemptive Strike Pre-Calculus Review Preemptive Strike Attaced are some notes and one assignment wit tree parts. Tese are due on te day tat we start te pre-calculus review. I strongly suggest reading troug te notes torougly

More information

Lecture XVII. Abstract We introduce the concept of directional derivative of a scalar function and discuss its relation with the gradient operator.

Lecture XVII. Abstract We introduce the concept of directional derivative of a scalar function and discuss its relation with the gradient operator. Lecture XVII Abstract We introduce te concept of directional derivative of a scalar function and discuss its relation wit te gradient operator. Directional derivative and gradient Te directional derivative

More information

Flavius Guiaş. X(t + h) = X(t) + F (X(s)) ds.

Flavius Guiaş. X(t + h) = X(t) + F (X(s)) ds. Numerical solvers for large systems of ordinary differential equations based on te stocastic direct simulation metod improved by te and Runge Kutta principles Flavius Guiaş Abstract We present a numerical

More information

Notes on wavefunctions II: momentum wavefunctions

Notes on wavefunctions II: momentum wavefunctions Notes on wavefunctions II: momentum wavefunctions and uncertainty Te state of a particle at any time is described by a wavefunction ψ(x). Tese wavefunction must cange wit time, since we know tat particles

More information

= 0 and states ''hence there is a stationary point'' All aspects of the proof dx must be correct (c)

= 0 and states ''hence there is a stationary point'' All aspects of the proof dx must be correct (c) Paper 1: Pure Matematics 1 Mark Sceme 1(a) (i) (ii) d d y 3 1x 4x x M1 A1 d y dx 1.1b 1.1b 36x 48x A1ft 1.1b Substitutes x = into teir dx (3) 3 1 4 Sows d y 0 and states ''ence tere is a stationary point''

More information

Optimal parameters for a hierarchical grid data structure for contact detection in arbitrarily polydisperse particle systems

Optimal parameters for a hierarchical grid data structure for contact detection in arbitrarily polydisperse particle systems Comp. Part. Mec. 04) :357 37 DOI 0.007/s4057-04-000-9 Optimal parameters for a ierarcical grid data structure for contact detection in arbitrarily polydisperse particle systems Dinant Krijgsman Vitaliy

More information

A = h w (1) Error Analysis Physics 141

A = h w (1) Error Analysis Physics 141 Introduction In all brances of pysical science and engineering one deals constantly wit numbers wic results more or less directly from experimental observations. Experimental observations always ave inaccuracies.

More information

Time (hours) Morphine sulfate (mg)

Time (hours) Morphine sulfate (mg) Mat Xa Fall 2002 Review Notes Limits and Definition of Derivative Important Information: 1 According to te most recent information from te Registrar, te Xa final exam will be eld from 9:15 am to 12:15

More information

158 Calculus and Structures

158 Calculus and Structures 58 Calculus and Structures CHAPTER PROPERTIES OF DERIVATIVES AND DIFFERENTIATION BY THE EASY WAY. Calculus and Structures 59 Copyrigt Capter PROPERTIES OF DERIVATIVES. INTRODUCTION In te last capter you

More information

Cooperative Spectrum Prediction for Improved Efficiency of Cognitive Radio Networks

Cooperative Spectrum Prediction for Improved Efficiency of Cognitive Radio Networks Cooperative Spectrum Prediction for Improved Efficiency of Cognitive Radio Networks by Nagwa Shaghluf B.S., Tripoli University, Tripoli, Libya, 2009 A Thesis Submitted in Partial Fulfillment of the Requirements

More information

Quantum Mechanics Chapter 1.5: An illustration using measurements of particle spin.

Quantum Mechanics Chapter 1.5: An illustration using measurements of particle spin. I Introduction. Quantum Mecanics Capter.5: An illustration using measurements of particle spin. Quantum mecanics is a teory of pysics tat as been very successful in explaining and predicting many pysical

More information

Simulation and verification of a plate heat exchanger with a built-in tap water accumulator

Simulation and verification of a plate heat exchanger with a built-in tap water accumulator Simulation and verification of a plate eat excanger wit a built-in tap water accumulator Anders Eriksson Abstract In order to test and verify a compact brazed eat excanger (CBE wit a built-in accumulation

More information

Differentiation in higher dimensions

Differentiation in higher dimensions Capter 2 Differentiation in iger dimensions 2.1 Te Total Derivative Recall tat if f : R R is a 1-variable function, and a R, we say tat f is differentiable at x = a if and only if te ratio f(a+) f(a) tends

More information