Research Article Analysis of Wireless Energy Harvesting Relay Throughput in Rician Channel
|
|
- Dorcas Moore
- 5 years ago
- Views:
Transcription
1 Moble Informaton Systems Volume 16, Artcle ID , 9 pages Research Artcle Analyss of Wreless Energy Harvestng Relay Throughput n Rcan Channel Yfan Hu, 1 Nng Cao, 1 and Yunfe Chen 1 School of Computer and Informaton, Hoha Unversty, Xkang Road 1, Nanjng 198, Chna School of Engneerng, Unversty of Warwck, Coventry CV4 7AL, UK Correspondence should be addressed to Yfan Hu; hhu huyfan@yeah.net Receved 14 June 16; Revsed 1 October 16; Accepted 3 October 16 Academc Edtor: Francesco Grngol Copyrght 16 Yfan Hu et al. Ths s an open access artcle dstrbuted under the Creatve Commons Attrbuton Lcense, whch permts unrestrcted use, dstrbuton, and reproducton n any medum, provded the orgnal work s properly cted. Cooperatve communcaton uses dle nodes to acheve performance gans. Energy harvestng allows cooperatve communcaton to be less dependent on batteres. In ths paper, the performance of energyharvestng()amplfy-and-forwardrelayngsanalyzed for Rcan fadng channels, n contrast to prevous works that focused on Raylegh fadng channels. Contnuous tme protocol and dscrete tme protocol are consdered. Analytcal expressons for the average throughput are derved. Numercal results are presented to show the good performance of the system n Rcan fadng channels by examnng varous system parameters usng the analytcal expressons. 1. Introducton Amplfy-and-forward (AF) relayng s wdely used n communcaton systems to extend network coverage or acheve dversty gan. In AF relayng, the nformaton from the source node s receved and amplfed by the relay node before t s forwarded to the destnaton node. On the other hand, wreless energy harvestng has an mportant applcaton n relayng. The relay node may be lmted by ts battery lfe so that t may count on some external power source to reman actve n the network. In ths case, energy harvestng s partcularly useful, as the source node can act as an external power source for the relay node by transmttng energy wrelessly. Several works have been done on ether energy harvestng technque or amplfy-and-forward relayng technque, to name a few. References [1 3] consdered the use of energy harvestng from ambent rado frequency sgnals to power a wreless sensor network. References [4, 5] studed the transmsson strateges for nodes. In these cases the nodes harvest energy at some tme nstant and transmt the harvested energy at some other tme nstants. In [4], the transmsson tme mnmzaton was consdered. Reference [5] studed the maxmzed short-tme throughput for systems. Reference [6] also studed ambent RF energy harvestng, but nstead of usng the harvested energy to power the wreless sensor network drectly, t consdered the opton of storng the harvested energy n a capactor or battery to power the wreless sensor network. In [7], a rado frequency energy harvestng model was analyzed by consderng a recevng antenna part, a rectfyng part, and an energy storage n the crcut. In [8], the optmum samplng of a random feld was studed. Reference [9] studed the best-effort sensng wth fnte battery. The optmum estmaton of a contnuous tme random process usng dscrete tme samples taken by a sensor wth wreless power was studed n [1]. Ths work showed that, for the sensng of a tme-varyng random event wth wreless power, the optmum performance s acheved when the energy-harvestng-consumpton-rato s 1. In other studes, the optmal placement of the relay node was also studed. For example, [11] consdered a dual-hop energy transfer scheme, whle [1] presented a novel optmzaton problemfortwo-hoprfenergytransfertomprovewreless energy transfer effcency. In [13], artfcal nose was added to reducethenformatonleakagerateforenergyreceverswhle satsfyng ts energy harvestng requrements. Reference [14] consdered a wreless energy harvestng enabled massve multple-nput-multple-output relayng system n order to provde wreless securty. A protocol usng one part of each
2 Moble Informaton Systems frame for energy harvestng and the other part for message transmsson was consdered n [15]. In [16], the optmum performance boundares of a two-hop multantenna AF relayng system wth a multantenna energy harvestng () recever were studed. Also, energy harvestng technques for practcal devces n low-power applcatons were studed usng energy harvestng relayng n [17 19]. Reference [] studed the dfferent rate-energy trade-offs n order to acheve the optmal source and relay codng n a multple-nputmultple-output relay system. Reference [1] proposed two protocols of energy harvestng AF relayng and analyzed the throughput of each protocol (contnuous tme protocol and dscrete tme protocol). All the above works have been conducted for Raylegh fadng channels. However, t s well known that Raylegh fadng channel s only a specal case of the Rcan fadng channel when the lne of sght s. Thus, the Rcan fadng channel s more general and useful than the Raylegh fadng channel, and t s of great nterest to nvestgate the performance relayng n Rcan fadng channel. In ths paper, we fll ths gap by analyzng the performance of energy harvestng AF relayng n Rcan fadng channels. We consder two protocols, smlar to [1], as contnuous tmeprotocolanddscretetmeprotocol.basedon these protocols, we derve the analytcal expresson for the throughput n the Rcan fadng channels, whch s more challengng due to the Bessel functon n ts probablty densty functon. Numercal results are presented to compare the Rcan fadng channel wth the Raylegh fadng channel. They show that the performance n Rcan fadng channel s better than that n Raylegh fadng channel and ths performance gan can be quantfed usng our results. The rest of ths paper s organzed as follows. Secton presents the system model of AF relayng system wth energy harvestng. In Secton 3, we derve the analytcal expresson for the throughput of each protocol n Rcan fadng channel. InSecton4,weshowthenumercalexamplesobtaned from the analytcal expressons and verfy ts accuracy usng computer smulaton. Secton 5 concludes the paper.. System Model We consder a cooperatve communcaton scenaro consttuted by a source node (S), a destnaton (D), and an ntermedate relay node (R). The source node and the destnaton node are not energy-constraned, but the relay node s energy-constraned. We assume that the destnaton node can not communcate drectly wth the source because of physcal obstacles. Ths s a vald assumpton n some communcaton scenaros. Then, deployng relay nodes wll be a good soluton to make the communcaton between source and destnaton work effectve. The followng assumptons of relayng model are used n ths work. (1) The processng power used for the crcut at the relay s neglgble compared wth the transmsson power requred by the relay. () The energy-constraned relay node frst harvests suffcent energy from the source and then the relay node relays the source nformaton to the destnaton usng theharvestedenergy.thebatterycapactyattherelay s much larger than the requred transmsson power. (3) The relay adopts the tme-swtchng (TS) archtecture. It spends a porton of tme for energy harvestng () and the remanng tme for nformaton transmsson (). (4) The S R and R D channels are composed of Rcan fadng and large-scale path loss. We denote the dstances between S R and R D as d 1 and d, respectvely. The channel fadng gans between S R and R D are denoted, respectvely, as h and g. The fadng channel gans are assumed to be constant over a perod of T seconds and are ndependent and dentcally dstrbuted from one block to the other. (5) Assume that the communcaton happens n blocks of T seconds, each of whch s composed of two parts: part and part. We denote the fracton of tme allocated for n the th block as α.thus,part takes α T seconds, S R part takes (1 α )T/ seconds, and R D part takes (1 α )T/ seconds. For contnuous tme, the relay harvests energy and transmts nformaton wthn each block. Thus, α (, 1) [1]. For dscrete tme, the relay uses the whole block for energy harvestng or transmsson. When the relay harvests energy, α =1,whlewhen the relay transmts the nformaton, α =[1]. (6) For contnuous tme, an - block contans part and part, where occupes a porton of the block and occupes the rest. For dscrete tme, an - pattern contans (X+1)blocks, where there are X blocks and one block (X=,1,,...). Also, we defne the followng symbols: E : the avalable energy at the start of an - pattern E (): the avalable energy at the start of the th block E (t): the harvested energy at the tme nstant t n the th block E T : the energy harvested n an block t : - pattern start tme X: the number of blocks of dscrete tme protocol..1. Sgnal Model. For the th block, the source node sends the normalzed nformaton sgnal s wth E{ s }=1through the S R channel, whch s receved at the relay node as y r,. y r, = h d m 1 P s s +n r,, (1) where h s the S R fadng channel gan, d 1 s the dstance from source to the relay, m s the path loss exponent, P s s
3 Moble Informaton Systems 3 the source transmsson power, and n r, s the addtve whte Gaussan nose (AWGN) wth mean zero and varance σ nr. Then, the AF relay harvests enough energy to guarantee the requred transmsson power P r n the part. For the general case, P r canbeanyvaluesetbytherequrementsofthe applcaton QoS, whch wll produce dfferent throughput. After the part, the relay amplfes the receved sgnal and forwards t to the destnaton node. The sgnal sent by relay s P x r, = r y r,, P s h () /d1 m +σ nr where P s h /d m 1 +σ nr s the average power of y r, such that E { y r, } = P s h d1 m +σ nr. (3) Fnally, the sgnal y d, receved by the destnaton node s gven by y d, = g d m x r, +n d, P = r P s h g s d m P s h +d1 mσ nr P r d1 mg n r, + +n d,. d m P s h +d1 mσ nr In (4), g s the R D fadng channel gan, d s the dstance of the R D lnk, and n d, s the AWGN at the destnaton node. From (4), we can dstngush the sgnal part and the nose part, where P r P s h g s / d m P s h +d1 mσ nr s the sgnal part and P r d m 1 g n r, / d m P s h +d m 1 σ nr +n d, s the nose part. Thus we can get the sgnal-to-nose rato (SNR) at the destnaton node as γ d, = (4) P s P r h g /d m (P s h +d m 1 σ nr ) σnd +P r g d1 mσ nr /dm (P s h (5) +d1 mσ nd ), where agan σ nd sthevaranceofawgnatr node. For the th block, f the SNR s less than the threshold SNR (γ )therewllbeoutage.sowegettheoutagendcatori, as I, = L (γ d, <γ ), (6) where L( ) s an ndcator functon whch s equal to 1 f ts argument s true; otherwse t s... Relay Protocols..1. Contnuous Tme Protocol. In ths protocol, the relay harvests the energy just enough to transmt the nformaton sgnal.thecontnuoustmerelaymakessurethattherelay can harvest the requred amount of energy wthn each block and transmt t to the destnaton node. The - pattern only has one block [1]. As Fgure 1 shows, frstly the relay spends α T seconds on harvestng energy, where α (,1). Then, n the part, half of the tme (1 α )T/ s for S R transmsson and the other half tme (1 α )T/ s for R D transmsson. The energy harvested n the tme wll be consumed n the tme, so that the accumulated harvested energy s. Thus, E =E () =. In ths case, the harvested energy durng α T seconds s gven by E (α T) = ηp s h α T, (7) where <η<1s the energy converson effcency. The relay needs to forward the source message to the destnaton node wth a transmsson power P r for a tme of (1 α )T/.Wecan get the relaton as (1 α E (α T) =P )T r. (8) So, combnng (7) and (8), we can get d m 1 d m 1 α = P r ηp s h +d1 mp. (9) r In ths paper, throughput means the proporton of the effectve communcaton tme to the total tme when the relayng transmsson succeeds. As (1 α )T/ s the effectve communcaton tme wthn one block of tme T, the throughput τ s calculated as τ =(1 I, ) (1 α ) T/ T = (1 I,)(1 α ). (1) The throughput n (1) s a functon of the channel gans h and g. They are random varables. Thus, the average throughput s τ=e h g {τ }=E h g { (1 I,)(1 α ) }. (11)... Dscrete Tme Protocol. In ths protocol, each block s used ether for or for. If E () < P r T/, theblocks used for. Otherwse, t s used for. Wthn the part, T/ s used for S R transmsson, and the rest s for R D transmsson. In Fgure, f E <P r T/,therewllbeX blocks, and wll contnue untl E () > P r T/. Then,therelaystarts the. However, f E >P r T/ atthebegnnng,therewllbe no part (X = ), andtherelaywllstartmmedately. Inthscase,wecanseethattheharvestedenergymaynotbe completely consumed, so that E canbebggerthanzero[1]. In ths case, when a block s used for, the harvested energy wll be E T =η P s h T. (1) d m 1
4 4 Moble Informaton Systems T S R R D d1 m α = P r ηp s h +d1 mp r E(t) P r (1 α ) T α T (1 α ) T (1 α ) T E o = t to t o +α T t o +T Fgure 1: The TS protocol for and n AF relayng wth contnuous tme [1]. T (a) X blocks α {, 1} (b) (a) (b) E(t) P r T E o t o t o +XT P r T t E(t) E o > P rt P r T t o t t o +T Fgure : The TS protocol for and n AF relayng wth dscrete tme [1]. Then { 1, E () < P rt α =, {, E { () > P rt, { E () +E T, E () < P rt E (T) =, { E { () P rt, E () > P rt. (13) 3. Performance Analyss n Rcan Fadng Channels In ths secton, we wll derve the analytcal expresson for the throughput of each protocol n Rcan fadng channels Average Throughput of Contnuous Tme Protocol. Snce h and g are ndependent, (11) can be wrtten as τ=e h { E g {1 I, }(1 α ) }. (15) Smlarly, the throughput of the dscrete tme s also τ =(1 I, )(1 α )/, and the average throughput s where h {h,h 1,h,...}. τ=e h,g {τ }, (14) The functon of I, s gven by I, = L ( <γ ). P s P r h g P r g d1 mσ nr +dm σ nd (P s h +d1 mσ nr ) (16)
5 Moble Informaton Systems 5 For convenence, we defne a = P s d m σ nd γ, b = d m σ nd dm 1 σ nr γ, c=p s P r,andd=p r d m 1 σ nr γ.thenwehave L ( { g < a h +b c I, = h d ), h > d c, { L ( g > a h +b { c h d )=1, h < d (17) c. We assume the channel gan s Rcan dstrbuted. Thus, the PDF of h or g s gven by p h (x) = x +V )/σ σ e (x I ( Vx ), x>, (18) σ where σ s the power of the cluttery component and V s the ampltude of the lne-of-sght component. Usng the transformaton z=x, h or g has the PDF of p h (z) = 1 σ e V /σ e z/σ I ( V z), z >. (19) σ Then, we get that E g {1 I, } s E g {1 I, }=1 1 σ (a h +b)/(c h d) e V /σ e z/σ I ( V z) dz, σ h > d c. () Here,wecanseethatwhen h <d/c, E{1 I, }=. Fnally we get the average throughput by takng the PDF of h nto the formula as 1 d m 1 τ= P r/(ηp s z+d m 1 P r) [1 d/c (az+b)/(cz d) 1 σ e V /σ e x/σ I ( V x) dx] σ 1 σ e V /σ e z/σ I ( V z) dz. σ (1) One sees that ths s a two-dmensonal nested ntegral, whch s not easy to be computed numercally due to convergence ssue. So we should do some smplfcatons. We notce that, n (), we can get (ax + b)/(cx d) = (a/c)(1 + (ad + bc)/c x).for(ad + bc)/c,tsd m σ nd dm 1 σ nr γ γ /P rp s = γ /SINR nrsinr nd. In general cases, the SINR wll not be very small, so (ad + bc)/c smuchsmallerthan1.so()canbe approxmated as (az+b)/(cz d) 1 a/c 1 1 σ e V /σ e z/σ I ( V z) dz σ () 1 σ e V /σ e z/σ I ( V σ z) dz. Also, a/c 1 σ e V /σ e z/σ I ( V z) dz σ 1 σ e V /σ e z/σ I ( V (3) σ z) dz. =1 a/c On the other hand, for (1/σ ) /σ a/c e V e z/σ I ((V/ σ ) z)dz,weusethesubsttutonx =z/σ to have 1 σ a/c = e V /σ σ = e V /σ σ e V /σ e z/σ I ( V z) dz σ e z/σ I ( V z) dz a/c σ e x / I ( V dz x) ( a/c/σ σ dx )dx = xe (x+(v/σ) )/ I ( V x) dx, a/c/σ σ where Q functon s defned as (4) Q m (a, b) = x( x b a )m 1 e (x +a )/ I m 1 (ax) dx. (5) Then, (5) can be xe (x+(v/σ) )/ I ( V a/c/σ σ x) dx=q 1 ( V σ, a/c σ ). (6) So we get E g {1 I, } Q 1 ( V σ, a/c σ ). (7) Combnng (1) and (7), we get τ Q 1 ( V σ, a/c σ ) Then we have (8) 1 α σ e V /σ e z/σ I ( V σ z) dz. τ Q 1 (V/σ, a/c/σ) (1 dm 1 P r σ u), (9)
6 6 Moble Informaton Systems where u = (e V /σ e x/σ I ((V/σ ) x)/(ηp s x + d m 1 P r))dx. As we can see (9) s a one-dmensonal ntegral from to, and due to the exponental functon and the Bessel functon, the ntegrand of ths ntegral converges very quckly. 3.. Average Throughput of Dscrete Tme Protocol. Snce =(P s h η/d m 1 )T and h has the PDF of (19), one has E T p E T (ε) = 1 σ ρ e V /σ e ε/ρσ I ( V σ ε ), (3) ρ where ε s the dummy varable for the random varable E T, ρ=p s ηt/d m 1,andthemeanofE T s (σ + V )ρ. In the above, the harvested energy s X =1 E T.The leftover energy at the end of the frst - pattern after consumng P r T/ n the part s X =1 E T P r T/. Afterwards, for the second - pattern, f the leftover energy of the frst - pattern s smaller than P r T/, t wll be E for the second - pattern, but f t s larger than P r T/,tsalsoE of the second - pattern and wll consume another P r T/ energy wthout energy harvestng. Ths process contnues. We can deduce that the leftover energy at the end of any - pattern, n a sequence of - patterns, can be transformed to the same form as E T whch s a functon of ρ, V,andσ. Consequently, the harvested energy avalable at the start of any - pattern, E,wll have the PDF: We have p E (ε) = 1 σ ρ e V /σ e ε/ρσ I ( V σ ε ). (31) ρ Atthesametme,wesetXasthe number of the total blocks. Then we denote X = X 1asthenumberofblocks just before the energy arrves P r T/.IfE >P r T/,therewll be X=.WhenE <P r T/, wehaveknownthatthemean of E T E )/(σ + V )ρ. So we have s (σ + V )ρ. Then we can get E{X E }=(P r T/ {, E > P rt, E X {X E }= P { r T/ E {(σ + V )ρ +1, E < P (35) rt. Thus E X {X} = E E {E X E {X E }} So we have P r T/ E X {X} = P r T/ = (1 + E X {X E }) p E (ε) dε P r T/ + p E (ε) dε. 1 ( (σ + V )ρ (P rt ε)+1) p E (ε) dε + p E (ε) dε P r T/ P r T/ = 1 ( (σ + V )ρ (P rt ε)+1) 1 σ ρ e V /σ e ε/ρσ I ( V σ ε ρ ) dε. (36) (37) τ=e h,g {τ } = E h,g { (1 I,)(1 α ) }. (3) In ths case, I, s ndependent of the tme, α,butt depends on the fadng channels, h and g ;alsoα depends on theaccumulatedharvestedenergyatthestartoftheth block, E ().Thus,E () depends on S R fadng channels of the prevous blocks, or h\h ={h 1,h,...}.Sothethroughput τ canbewrttenas We use Q functon consdered before agan, to get E X {X} P =(1+ r T (σ + V )ρ )(1 Q 1 ( V σ, P rt/ρ )) σ 1 (σ + V )ρ ω, (38) τ= 1 E h,g {1 I, } E h\h {1 α }. (33) Usng the results of () and (7), we can get E h,g {1 I, } Q 1 ( V σ, a/c ). (34) σ where ω= P rt/ (ε/σ ρ)e V /σ e ε/ρσ I ((V/σ ) ε/ρ)dε. From the defnton of throughput we have E h\h {1 α }= 1/ E X {X+1}. (39) Combnng (34) and (39), the average throughput s τ Q 1 (V/σ, a/c/σ) ((1+P r T/ (σ + V )ρ)(1 Q 1 (V/σ, P r T/ρ/σ)) (1/ (σ + V )ρ)ω+1). (4)
7 Moble Informaton Systems 7 Throughput.5.45 Dscrete tme Contnuous tme P r (dbm) Throughput Dscrete tme Contnuous tme P r (dbm) Analyss of dscrete tme n Rcan fadng channel Analyss of contnuous tme n Rcan fadng channel Smulaton of dscrete tme n Rcan fadng channel Smulaton of contnuous tme n Rcan fadng channel Fgure 3: Comparson of the analytcal and smulaton results for the throughput of dscrete tme and contnuous tme n Rcan fadng channel. 4. Numercal Result and Dscusson In ths secton, numercal results are presented to show the throughput of the system n Rcan fadng channels. The source transmsson power s set to P s =46dBm. The path loss exponent s set to m = 3. The dstance from source to relay s set to d 1 = 35 meters and the dstance from relay to destnaton s set to d = 1 meters. The energy converson effcency s set to η=.5. The threshold SNR s set to γ = 55dB. The nose varances at the relay and the destnaton nodes are set to σ nr = 8dBm and σ nd = 11 dbm. Also, σ =.5, whchsthesameasσ n the Raylegh fadng channel. We also obtan the smulaton results to verfy the analytcal results obtaned n Secton 3. In the smulaton, 1 blocks are used, where we generate ndependent fadng channels h and g for each block. We assume fxed power transmsson at the relay so that P r s fxed whle α changes wth h, smlar to [1]. Fgure 3 shows the comparson of analytcal and smulaton results for the throughput of dscrete tme and contnuous tme n Rcan fadng channel. From Fgure 3 we can see that the smulaton and analytcal result of the throughput of contnuous tme and dscrete tme n Rcan fadng channel match well. Ths shows the accuracy of the approxmaton we used. In addton, we can fnd that there s a peak n the curve. It s because the throughput s relatedtoboththefnalsnrandthetmefor.when P r ncreases the fnal SNR wll be larger so that the outage probablty wll decrease, whch makes the throughput larger. On the other sde, when P r becomes bgger, the tme for wll be more, whch can decrease the throughput. Therefore, there wll be P r that makes the throughput the bggest, whch s the optmal. Moreover, we can see that the performance of dscrete tme protocol s better than that of contnuous tme protocol. There s energy left after a - pattern of dscrete tme protocol wll harvest more energy when h s larger. Then t makes the tme of the followng - pattern smaller, so that the throughput wll be larger. Analyss of dscrete tme n Rcan fadng channel Analyss of contnuous tme n Rcan fadng channel Smulaton of dscrete tme n Rcan fadng channel Smulaton of contnuous tme n Rcan fadng channel Smulaton of dscrete tme n Raylegh fadng channel Smulaton of contnuous tme n Raylegh fadng channel Fgure 4: Comparson of throughput versus P r for dscrete tme and contnuous tme n Raylegh and Rcan fadng channel. Optmal throughput.5.45 Dscrete tme Contnuous tme C nd (dbm) Analyss of dscrete tme n Rcan fadng channel Analyss of contnuous tme n Rcan fadng channel Smulaton of dscrete tme n Rcan fadng channel Smulaton of contnuous tme n Rcan fadng channel Smulaton of dscrete tme n Raylegh fadng channel Smulaton of contnuous tme n Raylegh fadng channel Fgure 5: Optmal throughput versus σ nd for dscrete tme and contnuous tme n Raylegh and Rcan fadng channel. In Fgure 4, the value of P r ncreases from 5 dbm to 5 dbm. The performance of the throughput of dscrete tme and contnuous tme n Raylegh and Rcan fadng channels can be compared. From the result, we can see that the throughput n Rcan fadng channel s hgher than that n Raylegh fadng channels under the same other condtons. It conforms to the physcal truth that the Rcan fadng channel s a better fadng channel than Raylegh fadng channel, such thatperformancenrcanfadngchannelshouldbebetter than that n the Raylegh fadng channel. Fgure 5 plots the optmal throughput when the nose varance at the destnaton nodes ncreases form 13 dbm to 7 dbm, so that the throughput also changes when the nose varance changes. The optmum throughput decreases when the nose varance ncreases. When the nose becomes bgger, P r needs to be bgger to satsfy the outage condton,
8 8 Moble Informaton Systems Optmal throughput Contnuous tme Dscrete tme Threshold SNR (db) Analyss of dscrete tme n Rcan fadng channel Analyss of contnuous tme n Rcan fadng channel Smulaton of dscrete tme n Rcan fadng channel Smulaton of contnuous tme n Rcan fadng channel Smulaton of dscrete tme n Raylegh fadng channel Smulaton of contnuous tme n Raylegh fadng channel Fgure 6: Optmal throughput versus threshold SNR for dscrete tme and contnuous tme n Raylegh and Rcan fadng channel. Throughput Contnuous tme Dscrete tme P r (dbm) Rcan true dscrete tme, v = 1 Rcan true contnuous tme, v = 1 Rcan dscrete tme, v =.5 Rcan contnuous tme, v =.5 Rcan dscrete tme, v = 1 Rcan contnuous tme, v = 1 Rcan true dscrete tme, v =.5 Rcan true contnuous tme v =.5 Fgure 7: Throughput versus P r for dfferent V n dscrete tme and contnuous tme n Rcan fadng channel. whch wll make the tme longer, and fnally, makes the throughput decrease. Fgure 6 shows the optmal throughput versus the threshold SNR when t ncreases from 3 db to 7 db. We can see that when the threshold SNR ncreases the throughput decreases. The hgher threshold SNR needed, the hgher fnal SNR should be, and t wll requre hgher P r,whchwll make the tme longer to decrease the throughput. When the threshold SNR ncreases, the gap between the smulaton and analytcal results ncreases, because when the threshold SNR ncreases the sensblty to σ nr wll be bgger, so the approxmaton becomes naccurate n ths case. In Fgure 7, we examne the lne of sght effect. The throughput when V = 1 s larger than that when V =.5. When the lne of sght ncreases, that s, the channel becomngbetter,thethroughputwllncrease. 5. Concluson In ths paper, we have derved the analytcal throughput of contnuous tme and dscrete tme protocols used n AF relay n Rcan fadng channel and have proved the accuracy of the analytcal throughput by computer smulaton. In addton, we also dscussed the performances n dfferent stuatons for dfferent transmt power of the relayng node, nose at the receve node, and threshold SNR. Moreover, the performance of the - protocols n Rcan fadng channel s better than that n Raylegh fadng channel, because of the channelmprovementfromthelneofsght.inaddton,the throughput wll change whle P r changes and there s a peak to attan the optmal throughput, and the optmal throughput wll decrease when the nose and threshold SNR ncreases. Competng Interests The authors declare that they have no competng nterests. References [1] A. M. Zungeru, L. M. Ang, S. Prabaharan, and K. P. Seng, Rado frequency energy harvestng and management for wreless sensor network, n Green Moble Devces and Networks: Energy Optmzaton and Scavengng Technques, pp ,CRC Press, 1. [] D.Bouchoucha,F.Dupont,M.Latrach,andL.Ventura, Ambent RF energy harvestng, n Proceedngs of the Internatonal Conference on Renewable Energes and Power Qualty (ICREP 1),Granada,Span,March1. [3] H. Jabbar, Y. S. Song, and T. T. Jeong, RF energy harvestng system and crcuts for chargng of moble devces, IEEE Transactons on Consumer Electroncs,vol.56,no.1,pp.47 53, 1. [4] J.YangandS.Ulukus, Optmalpacketschedulngnanenergy harvestng communcaton system, IEEE Transactons on Communcatons,vol.6,no.1,pp. 3,1. [5] K. Tutuncuoglu and A. Yener, Optmum transmsson polces for battery lmted energy harvestng nodes, IEEE Transactons on Wreless Communcatons, vol. 11, no. 3, pp , 1. [6]T.BengLm,N.M.Lee,andB.K.Poh, Feasbltystudyon ambent RF energy harvestng for wreless sensor network, n Proceedngs of the IEEE MTT-S Internatonal Mcrowave Workshop Seres on RF and Wreless Technologes for Bomedcal and Healthcare Applcatons (IMWS-BIO 13), pp.1 3,Sngapore, December 13. [7] H. ElAnzeery and R. Gund, Frequency survey smulaton for developng novel rado frequency energy harvestng model, n Proceedngs of the 14th Internatonal Conference on Modellng and Smulaton (UKSm 1), pp , March 1. [8] K. Rtter, G. W. Waslkowsk, and H. Woznakowsk, Multvarate ntegraton and approxmaton for random felds satsfyng Sacks-Ylvsaker condtons, The Annals of Appled Probablty, vol. 5, no., pp , [9] J. Yang, X. Wu, and J. Wu, Adaptve sensng schedulng for energy harvestng sensors wth fnte battery, n Proceedngs of
9 Moble Informaton Systems 9 the IEEE Internatonal Conference on Communcatons (ICC 15), June 15. [1] J. Wu, I. Akngeneye, and J. Yang, Optmum sensng of a tmevaryng random event wth energy harvestng power sources, n Proceedngs of the IEEE Internatonal Symposum on Informaton Theory (IS 15), pp , Hong Kong, June 15. [11] A. Kurs, A. Karals, R. Moffatt, J. D. Joannopoulos, P. Fsher, and M. Soljačć, Wreless power transfer va strongly coupled magnetc resonances, Scence, vol. 317, no. 5834, pp , 7. [1] D. Mshra and S. De, Optmal relay placement n two-hop RF energy transfer, IEEE Transactons on Communcatons, vol. 63, no. 5, pp , 15. [13] L.Lu,R.Zhang,andK.-C.Chua, Secrecywrelessnformaton and power transfer wth MISO beamformng, IEEE TransactonsonSgnalProcessng,vol.6,no.7,pp ,14. [14]X.Chen,J.Chen,andT.Lu, Securewrelessnformaton and power transfer n large-scale MIMO relayng systems wth mperfect CSI, [15] S. Luo, R. Zhang, and T. J. Lm, Optmal save-then-transmt protocol for energy harvestng wreless transmtters, n Proceedngs of the IEEE Internatonal Symposum on Informaton Theory (IS 1), pp , IEEE, Cambrdge, Mass, USA, July 1. [16] B. K. Chalse, W.-K. Ma, Y. D. Zhang, H. A. Suraweera, and M. G. Amn, Optmum performance boundares of OSTBC based AF-MIMO relay system wth energy harvestng recever, IEEE Transactons on Sgnal Processng,vol.61,no.17,pp , 13. [17] I. Krkds, Smultaneous nformaton and energy transfer n large-scale networks wth/wthout relayng, IEEE Transactons on Communcatons,vol.6,no.3,pp.9 91,14. [18] Y. Zeng and R. Zhang, Full-duplex wreless-powered relay wth self-energy recyclng, IEEE Wreless Communcatons Letters, vol. 4, no., pp. 1 4, 15. [19] A. A. Nasr, X. Zhou, S. Durran, and R. A. Kennedy, Relayng protocols for wreless energy harvestng and nformaton processng, IEEE Transactons on Wreless Communcatons,vol.1, no.7,pp ,13. [] B. K. Chalse, Y. D. Zhang, and M. G. Amn, Energy harvestng n an OSTBC based amplfy-and-forward MIMO relay system, n Proceedngs of the IEEE Internatonal Conference on Acoustcs, Speech, and Sgnal Processng (ICASSP 1), pp , March 1. [1] A. A. Nasr, X. Zhou, S. Durran, and R. A. Kennedy, Wrelesspowered relays n cooperatve communcatons: tme-swtchng relayng protocols and throughput analyss, IEEE Transactons on Communcatons,vol.63,no.5,pp ,15.
10 Journal of Advances n Industral Engneerng Multmeda The Scentfc World Journal Appled Computatonal Intellgence and Soft Computng Internatonal Journal of Dstrbuted Sensor Networks Advances n Fuzzy Systems Modellng & Smulaton n Engneerng Submt your manuscrpts at Journal of Computer Networks and Communcatons Advances n Artfcal Intellgence Internatonal Journal of Bomedcal Imagng Advances n Artfcal Neural Systems Internatonal Journal of Computer Engneerng Computer Games Technology Advances n Advances n Software Engneerng Internatonal Journal of Reconfgurable Computng Robotcs Computatonal Intellgence and Neuroscence Advances n Human-Computer Interacton Journal of Journal of Electrcal and Computer Engneerng
The Order Relation and Trace Inequalities for. Hermitian Operators
Internatonal Mathematcal Forum, Vol 3, 08, no, 507-57 HIKARI Ltd, wwwm-hkarcom https://doorg/0988/mf088055 The Order Relaton and Trace Inequaltes for Hermtan Operators Y Huang School of Informaton Scence
More informationECE559VV Project Report
ECE559VV Project Report (Supplementary Notes Loc Xuan Bu I. MAX SUM-RATE SCHEDULING: THE UPLINK CASE We have seen (n the presentaton that, for downlnk (broadcast channels, the strategy maxmzng the sum-rate
More informationResearch Article Relative Smooth Topological Spaces
Advances n Fuzzy Systems Volume 2009, Artcle ID 172917, 5 pages do:10.1155/2009/172917 Research Artcle Relatve Smooth Topologcal Spaces B. Ghazanfar Department of Mathematcs, Faculty of Scence, Lorestan
More informationResearch Article Green s Theorem for Sign Data
Internatonal Scholarly Research Network ISRN Appled Mathematcs Volume 2012, Artcle ID 539359, 10 pages do:10.5402/2012/539359 Research Artcle Green s Theorem for Sgn Data Lous M. Houston The Unversty of
More informationModule 3 LOSSY IMAGE COMPRESSION SYSTEMS. Version 2 ECE IIT, Kharagpur
Module 3 LOSSY IMAGE COMPRESSION SYSTEMS Verson ECE IIT, Kharagpur Lesson 6 Theory of Quantzaton Verson ECE IIT, Kharagpur Instructonal Objectves At the end of ths lesson, the students should be able to:
More informationPop-Click Noise Detection Using Inter-Frame Correlation for Improved Portable Auditory Sensing
Advanced Scence and Technology Letters, pp.164-168 http://dx.do.org/10.14257/astl.2013 Pop-Clc Nose Detecton Usng Inter-Frame Correlaton for Improved Portable Audtory Sensng Dong Yun Lee, Kwang Myung Jeon,
More informationError Probability for M Signals
Chapter 3 rror Probablty for M Sgnals In ths chapter we dscuss the error probablty n decdng whch of M sgnals was transmtted over an arbtrary channel. We assume the sgnals are represented by a set of orthonormal
More informationStructure and Drive Paul A. Jensen Copyright July 20, 2003
Structure and Drve Paul A. Jensen Copyrght July 20, 2003 A system s made up of several operatons wth flow passng between them. The structure of the system descrbes the flow paths from nputs to outputs.
More informationComparison of the Population Variance Estimators. of 2-Parameter Exponential Distribution Based on. Multiple Criteria Decision Making Method
Appled Mathematcal Scences, Vol. 7, 0, no. 47, 07-0 HIARI Ltd, www.m-hkar.com Comparson of the Populaton Varance Estmators of -Parameter Exponental Dstrbuton Based on Multple Crtera Decson Makng Method
More informationA new Approach for Solving Linear Ordinary Differential Equations
, ISSN 974-57X (Onlne), ISSN 974-5718 (Prnt), Vol. ; Issue No. 1; Year 14, Copyrght 13-14 by CESER PUBLICATIONS A new Approach for Solvng Lnear Ordnary Dfferental Equatons Fawz Abdelwahd Department of
More informationChapter 7 Channel Capacity and Coding
Wreless Informaton Transmsson System Lab. Chapter 7 Channel Capacty and Codng Insttute of Communcatons Engneerng atonal Sun Yat-sen Unversty Contents 7. Channel models and channel capacty 7.. Channel models
More informationThe Study of Teaching-learning-based Optimization Algorithm
Advanced Scence and Technology Letters Vol. (AST 06), pp.05- http://dx.do.org/0.57/astl.06. The Study of Teachng-learnng-based Optmzaton Algorthm u Sun, Yan fu, Lele Kong, Haolang Q,, Helongang Insttute
More informationSecret Communication using Artificial Noise
Secret Communcaton usng Artfcal Nose Roht Neg, Satashu Goel C Department, Carnege Mellon Unversty, PA 151, USA {neg,satashug}@ece.cmu.edu Abstract The problem of secret communcaton between two nodes over
More informationPower law and dimension of the maximum value for belief distribution with the max Deng entropy
Power law and dmenson of the maxmum value for belef dstrbuton wth the max Deng entropy Bngy Kang a, a College of Informaton Engneerng, Northwest A&F Unversty, Yanglng, Shaanx, 712100, Chna. Abstract Deng
More informationNumerical Heat and Mass Transfer
Master degree n Mechancal Engneerng Numercal Heat and Mass Transfer 06-Fnte-Dfference Method (One-dmensonal, steady state heat conducton) Fausto Arpno f.arpno@uncas.t Introducton Why we use models and
More informationOn the spectral norm of r-circulant matrices with the Pell and Pell-Lucas numbers
Türkmen and Gökbaş Journal of Inequaltes and Applcatons (06) 06:65 DOI 086/s3660-06-0997-0 R E S E A R C H Open Access On the spectral norm of r-crculant matrces wth the Pell and Pell-Lucas numbers Ramazan
More informationTwo-Way and Multiple-Access Energy Harvesting Systems with Energy Cooperation
Two-Way and Multple-Access Energy Harvestng Systems wth Energy Cooperaton Berk Gurakan, Omur Ozel, Jng Yang 2, and Sennur Ulukus Department of Electrcal and Computer Engneerng, Unversty of Maryland, College
More informationResource Allocation with a Budget Constraint for Computing Independent Tasks in the Cloud
Resource Allocaton wth a Budget Constrant for Computng Independent Tasks n the Cloud Wemng Sh and Bo Hong School of Electrcal and Computer Engneerng Georga Insttute of Technology, USA 2nd IEEE Internatonal
More informationApplication of Nonbinary LDPC Codes for Communication over Fading Channels Using Higher Order Modulations
Applcaton of Nonbnary LDPC Codes for Communcaton over Fadng Channels Usng Hgher Order Modulatons Rong-Hu Peng and Rong-Rong Chen Department of Electrcal and Computer Engneerng Unversty of Utah Ths work
More informationCHAPTER 5 NUMERICAL EVALUATION OF DYNAMIC RESPONSE
CHAPTER 5 NUMERICAL EVALUATION OF DYNAMIC RESPONSE Analytcal soluton s usually not possble when exctaton vares arbtrarly wth tme or f the system s nonlnear. Such problems can be solved by numercal tmesteppng
More informationAn Improved multiple fractal algorithm
Advanced Scence and Technology Letters Vol.31 (MulGraB 213), pp.184-188 http://dx.do.org/1.1427/astl.213.31.41 An Improved multple fractal algorthm Yun Ln, Xaochu Xu, Jnfeng Pang College of Informaton
More informationWireless information and power transfer in two-way relaying network with non-coherent differential modulation
Xu et al. EURASIP Journal on Wreless Communcatons and Networkng 015 015:131 DOI 10.1186/s13638-015-0368-4 RESEARCH Open Access Wreless nformaton and power transfer n two-way relayng network wth non-coherent
More informationEGR 544 Communication Theory
EGR 544 Communcaton Theory. Informaton Sources Z. Alyazcoglu Electrcal and Computer Engneerng Department Cal Poly Pomona Introducton Informaton Source x n Informaton sources Analog sources Dscrete sources
More informationMax-Min Criterion Still Diversity-Optimal?
Energy Harvestng Cooperatve Networks: Is the 1 Max-Mn Crteron Stll Dversty-Optmal? Zhguo Dng, Member, IEEE and H. Vncent Poor, Fellow, IEEE arxv:143.354v1 [cs.it] 3 Mar 214 Abstract Ths paper consders
More informationSharp integral inequalities involving high-order partial derivatives. Journal Of Inequalities And Applications, 2008, v. 2008, article no.
Ttle Sharp ntegral nequaltes nvolvng hgh-order partal dervatves Authors Zhao, CJ; Cheung, WS Ctaton Journal Of Inequaltes And Applcatons, 008, v. 008, artcle no. 5747 Issued Date 008 URL http://hdl.handle.net/07/569
More informationPower Allocation for Distributed BLUE Estimation with Full and Limited Feedback of CSI
Power Allocaton for Dstrbuted BLUE Estmaton wth Full and Lmted Feedback of CSI Mohammad Fanae, Matthew C. Valent, and Natala A. Schmd Lane Department of Computer Scence and Electrcal Engneerng West Vrgna
More informationLecture 4: November 17, Part 1 Single Buffer Management
Lecturer: Ad Rosén Algorthms for the anagement of Networs Fall 2003-2004 Lecture 4: November 7, 2003 Scrbe: Guy Grebla Part Sngle Buffer anagement In the prevous lecture we taled about the Combned Input
More informationThe optimal delay of the second test is therefore approximately 210 hours earlier than =2.
THE IEC 61508 FORMULAS 223 The optmal delay of the second test s therefore approxmately 210 hours earler than =2. 8.4 The IEC 61508 Formulas IEC 61508-6 provdes approxmaton formulas for the PF for smple
More informationDistributed Power Control for Interference-Limited Cooperative Relay Networks
Ths full text paper was peer revewed at the drecton of IEEE Communcatons Socety subject matter experts for publcaton n the IEEE ICC 2009 proceedngs Dstrbuted Power Control for Interference-Lmted Cooperatve
More informationNUMERICAL DIFFERENTIATION
NUMERICAL DIFFERENTIATION 1 Introducton Dfferentaton s a method to compute the rate at whch a dependent output y changes wth respect to the change n the ndependent nput x. Ths rate of change s called the
More informationTransfer Functions. Convenient representation of a linear, dynamic model. A transfer function (TF) relates one input and one output: ( ) system
Transfer Functons Convenent representaton of a lnear, dynamc model. A transfer functon (TF) relates one nput and one output: x t X s y t system Y s The followng termnology s used: x y nput output forcng
More informationAsymptotics of the Solution of a Boundary Value. Problem for One-Characteristic Differential. Equation Degenerating into a Parabolic Equation
Nonl. Analyss and Dfferental Equatons, ol., 4, no., 5 - HIKARI Ltd, www.m-har.com http://dx.do.org/.988/nade.4.456 Asymptotcs of the Soluton of a Boundary alue Problem for One-Characterstc Dfferental Equaton
More informationOutage Probability of Macrodiversity Reception in the Presence of Fading and Weibull Co- Channel Interference
ISSN 33-365 (Prnt, ISSN 848-6339 (Onlne https://do.org/.7559/tv-67847 Orgnal scentfc paper Outage Probablty of Macrodversty Recepton n the Presence of Fadng and Webull Co- Channel Interference Mloš PERIĆ,
More informationOutline. Communication. Bellman Ford Algorithm. Bellman Ford Example. Bellman Ford Shortest Path [1]
DYNAMIC SHORTEST PATH SEARCH AND SYNCHRONIZED TASK SWITCHING Jay Wagenpfel, Adran Trachte 2 Outlne Shortest Communcaton Path Searchng Bellmann Ford algorthm Algorthm for dynamc case Modfcatons to our algorthm
More informationEqual-Optimal Power Allocation and Relay Selection Algorithm Based on Symbol Error Probability in Cooperative Communication
INTERNATIONAL JOURNAL OF COUNICATIONS Volume 1, 18 Equal-Optmal Power Allocaton and Relay Selecton Algorthm Based on Symbol Error Probablty n Cooperatve Communcaton Xn Song, Syang Xu and ngle Zhang Abstract
More informationDistributed Non-Autonomous Power Control through Distributed Convex Optimization
Dstrbuted Non-Autonomous Power Control through Dstrbuted Convex Optmzaton S. Sundhar Ram and V. V. Veeravall ECE Department and Coordnated Scence Lab Unversty of Illnos at Urbana-Champagn Emal: {ssrnv5,vvv}@llnos.edu
More information2E Pattern Recognition Solutions to Introduction to Pattern Recognition, Chapter 2: Bayesian pattern classification
E395 - Pattern Recognton Solutons to Introducton to Pattern Recognton, Chapter : Bayesan pattern classfcaton Preface Ths document s a soluton manual for selected exercses from Introducton to Pattern Recognton
More informationCOMPARISON OF SOME RELIABILITY CHARACTERISTICS BETWEEN REDUNDANT SYSTEMS REQUIRING SUPPORTING UNITS FOR THEIR OPERATIONS
Avalable onlne at http://sck.org J. Math. Comput. Sc. 3 (3), No., 6-3 ISSN: 97-537 COMPARISON OF SOME RELIABILITY CHARACTERISTICS BETWEEN REDUNDANT SYSTEMS REQUIRING SUPPORTING UNITS FOR THEIR OPERATIONS
More informationCollege of Computer & Information Science Fall 2009 Northeastern University 20 October 2009
College of Computer & Informaton Scence Fall 2009 Northeastern Unversty 20 October 2009 CS7880: Algorthmc Power Tools Scrbe: Jan Wen and Laura Poplawsk Lecture Outlne: Prmal-dual schema Network Desgn:
More informationA Fast Computer Aided Design Method for Filters
2017 Asa-Pacfc Engneerng and Technology Conference (APETC 2017) ISBN: 978-1-60595-443-1 A Fast Computer Aded Desgn Method for Flters Gang L ABSTRACT *Ths paper presents a fast computer aded desgn method
More informationPower Allocation/Beamforming for DF MIMO Two-Way Relaying: Relay and Network Optimization
Power Allocaton/Beamformng for DF MIMO Two-Way Relayng: Relay and Network Optmzaton Je Gao, Janshu Zhang, Sergy A. Vorobyov, Ha Jang, and Martn Haardt Dept. of Electrcal & Computer Engneerng, Unversty
More informationInductance Calculation for Conductors of Arbitrary Shape
CRYO/02/028 Aprl 5, 2002 Inductance Calculaton for Conductors of Arbtrary Shape L. Bottura Dstrbuton: Internal Summary In ths note we descrbe a method for the numercal calculaton of nductances among conductors
More informationprinceton univ. F 17 cos 521: Advanced Algorithm Design Lecture 7: LP Duality Lecturer: Matt Weinberg
prnceton unv. F 17 cos 521: Advanced Algorthm Desgn Lecture 7: LP Dualty Lecturer: Matt Wenberg Scrbe: LP Dualty s an extremely useful tool for analyzng structural propertes of lnear programs. Whle there
More informationParametric fractional imputation for missing data analysis. Jae Kwang Kim Survey Working Group Seminar March 29, 2010
Parametrc fractonal mputaton for mssng data analyss Jae Kwang Km Survey Workng Group Semnar March 29, 2010 1 Outlne Introducton Proposed method Fractonal mputaton Approxmaton Varance estmaton Multple mputaton
More informationCredit Card Pricing and Impact of Adverse Selection
Credt Card Prcng and Impact of Adverse Selecton Bo Huang and Lyn C. Thomas Unversty of Southampton Contents Background Aucton model of credt card solctaton - Errors n probablty of beng Good - Errors n
More informationChapter 7 Channel Capacity and Coding
Chapter 7 Channel Capacty and Codng Contents 7. Channel models and channel capacty 7.. Channel models Bnary symmetrc channel Dscrete memoryless channels Dscrete-nput, contnuous-output channel Waveform
More informationMicrowave Diversity Imaging Compression Using Bioinspired
Mcrowave Dversty Imagng Compresson Usng Bonspred Neural Networks Youwe Yuan 1, Yong L 1, Wele Xu 1, Janghong Yu * 1 School of Computer Scence and Technology, Hangzhou Danz Unversty, Hangzhou, Zhejang,
More informationLecture 3: Shannon s Theorem
CSE 533: Error-Correctng Codes (Autumn 006 Lecture 3: Shannon s Theorem October 9, 006 Lecturer: Venkatesan Guruswam Scrbe: Wdad Machmouch 1 Communcaton Model The communcaton model we are usng conssts
More informationUsing T.O.M to Estimate Parameter of distributions that have not Single Exponential Family
IOSR Journal of Mathematcs IOSR-JM) ISSN: 2278-5728. Volume 3, Issue 3 Sep-Oct. 202), PP 44-48 www.osrjournals.org Usng T.O.M to Estmate Parameter of dstrbutons that have not Sngle Exponental Famly Jubran
More informationEcon107 Applied Econometrics Topic 3: Classical Model (Studenmund, Chapter 4)
I. Classcal Assumptons Econ7 Appled Econometrcs Topc 3: Classcal Model (Studenmund, Chapter 4) We have defned OLS and studed some algebrac propertes of OLS. In ths topc we wll study statstcal propertes
More informationDETERMINATION OF TEMPERATURE DISTRIBUTION FOR ANNULAR FINS WITH TEMPERATURE DEPENDENT THERMAL CONDUCTIVITY BY HPM
Ganj, Z. Z., et al.: Determnaton of Temperature Dstrbuton for S111 DETERMINATION OF TEMPERATURE DISTRIBUTION FOR ANNULAR FINS WITH TEMPERATURE DEPENDENT THERMAL CONDUCTIVITY BY HPM by Davood Domr GANJI
More informationStatistical inference for generalized Pareto distribution based on progressive Type-II censored data with random removals
Internatonal Journal of Scentfc World, 2 1) 2014) 1-9 c Scence Publshng Corporaton www.scencepubco.com/ndex.php/ijsw do: 10.14419/jsw.v21.1780 Research Paper Statstcal nference for generalzed Pareto dstrbuton
More informationON A DETERMINATION OF THE INITIAL FUNCTIONS FROM THE OBSERVED VALUES OF THE BOUNDARY FUNCTIONS FOR THE SECOND-ORDER HYPERBOLIC EQUATION
Advanced Mathematcal Models & Applcatons Vol.3, No.3, 2018, pp.215-222 ON A DETERMINATION OF THE INITIAL FUNCTIONS FROM THE OBSERVED VALUES OF THE BOUNDARY FUNCTIONS FOR THE SECOND-ORDER HYPERBOLIC EUATION
More informationModule 9. Lecture 6. Duality in Assignment Problems
Module 9 1 Lecture 6 Dualty n Assgnment Problems In ths lecture we attempt to answer few other mportant questons posed n earler lecture for (AP) and see how some of them can be explaned through the concept
More informationState Amplification and State Masking for the Binary Energy Harvesting Channel
State Amplfcaton and State Maskng for the Bnary Energy Harvestng Channel Kaya Tutuncuoglu, Omur Ozel 2, Ayln Yener, and Sennur Ulukus 2 Department of Electrcal Engneerng, The Pennsylvana State Unversty,
More informationI + HH H N 0 M T H = UΣV H = [U 1 U 2 ] 0 0 E S. X if X 0 0 if X < 0 (X) + = = M T 1 + N 0. r p + 1
Homework 4 Problem Capacty wth CSI only at Recever: C = log det I + E )) s HH H N M T R SS = I) SVD of the Channel Matrx: H = UΣV H = [U 1 U ] [ Σr ] [V 1 V ] H Capacty wth CSI at both transmtter and
More informationSystem in Weibull Distribution
Internatonal Matheatcal Foru 4 9 no. 9 94-95 Relablty Equvalence Factors of a Seres-Parallel Syste n Webull Dstrbuton M. A. El-Dacese Matheatcs Departent Faculty of Scence Tanta Unversty Tanta Egypt eldacese@yahoo.co
More informationEURASIP Journal on Wireless Communications and Networking
EURASIP Journal on Wreless Communcatons and Networkng Ths Provsonal PDF corresponds to the artcle as t appeared upon acceptance. Fully formatted PDF and full text (TM) versons wll be made avalable soon.
More informationConcepts for Wireless Ad Hoc
Bandwdth and Avalable Bandwdth oncepts for Wreless Ad Hoc Networks Marco A. Alzate Unversdad Dstrtal, Bogotá Néstor M. Peña Unversdad de los Andes, Bogotá Mguel A. abrador Unversty of South Florda, Tampa
More informationPulse Coded Modulation
Pulse Coded Modulaton PCM (Pulse Coded Modulaton) s a voce codng technque defned by the ITU-T G.711 standard and t s used n dgtal telephony to encode the voce sgnal. The frst step n the analog to dgtal
More informationANSWERS. Problem 1. and the moment generating function (mgf) by. defined for any real t. Use this to show that E( U) var( U)
Econ 413 Exam 13 H ANSWERS Settet er nndelt 9 deloppgaver, A,B,C, som alle anbefales å telle lkt for å gøre det ltt lettere å stå. Svar er gtt . Unfortunately, there s a prntng error n the hnt of
More informationOptimal Resource Allocation in Full-Duplex Wireless-Powered Communication Network
1 Optmal Resource Allocaton n Full-Duplex Wreless-owered Communcaton Network Hyungsk Ju and Ru Zhang, Member, IEEE arxv:143.58v3 [cs.it] 15 Sep 14 Abstract Ths paper studes optmal resource allocaton n
More informationAn Application of Fuzzy Hypotheses Testing in Radar Detection
Proceedngs of the th WSES Internatonal Conference on FUZZY SYSEMS n pplcaton of Fuy Hypotheses estng n Radar Detecton.K.ELSHERIF, F.M.BBDY, G.M.BDELHMID Department of Mathematcs Mltary echncal Collage
More informationOn an Extension of Stochastic Approximation EM Algorithm for Incomplete Data Problems. Vahid Tadayon 1
On an Extenson of Stochastc Approxmaton EM Algorthm for Incomplete Data Problems Vahd Tadayon Abstract: The Stochastc Approxmaton EM (SAEM algorthm, a varant stochastc approxmaton of EM, s a versatle tool
More informationStatistical Energy Analysis for High Frequency Acoustic Analysis with LS-DYNA
14 th Internatonal Users Conference Sesson: ALE-FSI Statstcal Energy Analyss for Hgh Frequency Acoustc Analyss wth Zhe Cu 1, Yun Huang 1, Mhamed Soul 2, Tayeb Zeguar 3 1 Lvermore Software Technology Corporaton
More information1 Derivation of Rate Equations from Single-Cell Conductance (Hodgkin-Huxley-like) Equations
Physcs 171/271 -Davd Klenfeld - Fall 2005 (revsed Wnter 2011) 1 Dervaton of Rate Equatons from Sngle-Cell Conductance (Hodgkn-Huxley-lke) Equatons We consder a network of many neurons, each of whch obeys
More informationDigital Signal Processing
Dgtal Sgnal Processng Dscrete-tme System Analyss Manar Mohasen Offce: F8 Emal: manar.subh@ut.ac.r School of IT Engneerng Revew of Precedent Class Contnuous Sgnal The value of the sgnal s avalable over
More informationIntroduction to Information Theory, Data Compression,
Introducton to Informaton Theory, Data Compresson, Codng Mehd Ibm Brahm, Laura Mnkova Aprl 5, 208 Ths s the augmented transcrpt of a lecture gven by Luc Devroye on the 3th of March 208 for a Data Structures
More informationAn Upper Bound on SINR Threshold for Call Admission Control in Multiple-Class CDMA Systems with Imperfect Power-Control
An Upper Bound on SINR Threshold for Call Admsson Control n Multple-Class CDMA Systems wth Imperfect ower-control Mahmoud El-Sayes MacDonald, Dettwler and Assocates td. (MDA) Toronto, Canada melsayes@hotmal.com
More information(Online First)A Lattice Boltzmann Scheme for Diffusion Equation in Spherical Coordinate
Internatonal Journal of Mathematcs and Systems Scence (018) Volume 1 do:10.494/jmss.v1.815 (Onlne Frst)A Lattce Boltzmann Scheme for Dffuson Equaton n Sphercal Coordnate Debabrata Datta 1 *, T K Pal 1
More informationarxiv: v1 [cs.it] 6 Mar 2018
Accumulate Then Transmt: Mult-user Schedulng n Full-Duplex Wreless-Powered IoT Systems D Zha, He Chen, Zhua Ln, Yonghu L and Branka Vucetc arxv:1803.02023v1 [cs.it] 6 Mar 2018 Abstract Ths paper develops
More informationHidden Markov Models
Hdden Markov Models Namrata Vaswan, Iowa State Unversty Aprl 24, 204 Hdden Markov Model Defntons and Examples Defntons:. A hdden Markov model (HMM) refers to a set of hdden states X 0, X,..., X t,...,
More information( ) = ( ) + ( 0) ) ( )
EETOMAGNETI OMPATIBIITY HANDBOOK 1 hapter 9: Transent Behavor n the Tme Doman 9.1 Desgn a crcut usng reasonable values for the components that s capable of provdng a tme delay of 100 ms to a dgtal sgnal.
More informationImplicit Integration Henyey Method
Implct Integraton Henyey Method In realstc stellar evoluton codes nstead of a drect ntegraton usng for example the Runge-Kutta method one employs an teratve mplct technque. Ths s because the structure
More information3.1 Expectation of Functions of Several Random Variables. )' be a k-dimensional discrete or continuous random vector, with joint PMF p (, E X E X1 E X
Statstcs 1: Probablty Theory II 37 3 EPECTATION OF SEVERAL RANDOM VARIABLES As n Probablty Theory I, the nterest n most stuatons les not on the actual dstrbuton of a random vector, but rather on a number
More informationCLOSED-FORM CHARACTERIZATION OF THE CHANNEL CAPACITY OF MULTI-BRANCH MAXIMAL RATIO COMBINING OVER CORRELATED NAKAGAMI FADING CHANNELS
CLOSED-FORM CHARACTERIZATION OF THE CHANNEL CAPACITY OF MULTI-BRANCH MAXIMAL RATIO COMBINING OVER CORRELATED NAKAGAMI FADING CHANNELS Yawgeng A. Cha and Karl Yng-Ta Hang Department of Commncaton Engneerng,
More informationMIMO Systems and Channel Capacity
MIMO Systems and Channel Capacty Consder a MIMO system wth m Tx and n Rx antennas. x y = Hx ξ Tx H Rx The power constrant: the total Tx power s x = P t. Component-wse representaton of the system model,
More informationAverage Decision Threshold of CA CFAR and excision CFAR Detectors in the Presence of Strong Pulse Jamming 1
Average Decson hreshold of CA CFAR and excson CFAR Detectors n the Presence of Strong Pulse Jammng Ivan G. Garvanov and Chrsto A. Kabachev Insttute of Informaton echnologes Bulgaran Academy of Scences
More informationThe Exact Formulation of the Inverse of the Tridiagonal Matrix for Solving the 1D Poisson Equation with the Finite Difference Method
Journal of Electromagnetc Analyss and Applcatons, 04, 6, 0-08 Publshed Onlne September 04 n ScRes. http://www.scrp.org/journal/jemaa http://dx.do.org/0.46/jemaa.04.6000 The Exact Formulaton of the Inverse
More informationOn the correction of the h-index for career length
1 On the correcton of the h-ndex for career length by L. Egghe Unverstet Hasselt (UHasselt), Campus Depenbeek, Agoralaan, B-3590 Depenbeek, Belgum 1 and Unverstet Antwerpen (UA), IBW, Stadscampus, Venusstraat
More informationLecture Notes on Linear Regression
Lecture Notes on Lnear Regresson Feng L fl@sdueducn Shandong Unversty, Chna Lnear Regresson Problem In regresson problem, we am at predct a contnuous target value gven an nput feature vector We assume
More informationLow Complexity Soft-Input Soft-Output Hamming Decoder
Low Complexty Soft-Input Soft-Output Hammng Der Benjamn Müller, Martn Holters, Udo Zölzer Helmut Schmdt Unversty Unversty of the Federal Armed Forces Department of Sgnal Processng and Communcatons Holstenhofweg
More informationMulti-Points Cooperative Relay in NOMA System with N-1 DF Relaying Nodes in HD/FD mode for N User Equipments with Energy Harvesting
Preprnts www.preprnts.org OT PEER-REVIEWED Posted: 1 December 18 do:1.944/preprnts181.19.v1 Artcle Mult-Ponts Cooperatve Relay n OMA System wth -1 DF Relayng odes n HD/FD mode for User Equpments wth Energy
More informationConsider the following passband digital communication system model. c t. modulator. t r a n s m i t t e r. signal decoder.
PASSBAND DIGITAL MODULATION TECHNIQUES Consder the followng passband dgtal communcaton system model. cos( ω + φ ) c t message source m sgnal encoder s modulator s () t communcaton xt () channel t r a n
More informationMarkov Chain Monte Carlo Lecture 6
where (x 1,..., x N ) X N, N s called the populaton sze, f(x) f (x) for at least one {1, 2,..., N}, and those dfferent from f(x) are called the tral dstrbutons n terms of mportance samplng. Dfferent ways
More informationCS 798: Homework Assignment 2 (Probability)
0 Sample space Assgned: September 30, 2009 In the IEEE 802 protocol, the congeston wndow (CW) parameter s used as follows: ntally, a termnal wats for a random tme perod (called backoff) chosen n the range
More informationA Particle Filter Algorithm based on Mixing of Prior probability density and UKF as Generate Importance Function
Advanced Scence and Technology Letters, pp.83-87 http://dx.do.org/10.14257/astl.2014.53.20 A Partcle Flter Algorthm based on Mxng of Pror probablty densty and UKF as Generate Importance Functon Lu Lu 1,1,
More informationConvergence of random processes
DS-GA 12 Lecture notes 6 Fall 216 Convergence of random processes 1 Introducton In these notes we study convergence of dscrete random processes. Ths allows to characterze phenomena such as the law of large
More informationAn Admission Control Algorithm in Cloud Computing Systems
An Admsson Control Algorthm n Cloud Computng Systems Authors: Frank Yeong-Sung Ln Department of Informaton Management Natonal Tawan Unversty Tape, Tawan, R.O.C. ysln@m.ntu.edu.tw Yngje Lan Management Scence
More informationCOGNITIVE RADIO NETWORKS BASED ON OPPORTUNISTIC BEAMFORMING WITH QUANTIZED FEEDBACK
COGNITIVE RADIO NETWORKS BASED ON OPPORTUNISTIC BEAMFORMING WITH QUANTIZED FEEDBACK Ayman MASSAOUDI, Noura SELLAMI 2, Mohamed SIALA MEDIATRON Lab., Sup Com Unversty of Carthage 283 El Ghazala Arana, Tunsa
More informationMore metrics on cartesian products
More metrcs on cartesan products If (X, d ) are metrc spaces for 1 n, then n Secton II4 of the lecture notes we defned three metrcs on X whose underlyng topologes are the product topology The purpose of
More informationA Note on Bound for Jensen-Shannon Divergence by Jeffreys
OPEN ACCESS Conference Proceedngs Paper Entropy www.scforum.net/conference/ecea- A Note on Bound for Jensen-Shannon Dvergence by Jeffreys Takuya Yamano, * Department of Mathematcs and Physcs, Faculty of
More informationLOW BIAS INTEGRATED PATH ESTIMATORS. James M. Calvin
Proceedngs of the 007 Wnter Smulaton Conference S G Henderson, B Bller, M-H Hseh, J Shortle, J D Tew, and R R Barton, eds LOW BIAS INTEGRATED PATH ESTIMATORS James M Calvn Department of Computer Scence
More informationComplement of Type-2 Fuzzy Shortest Path Using Possibility Measure
Intern. J. Fuzzy Mathematcal rchve Vol. 5, No., 04, 9-7 ISSN: 30 34 (P, 30 350 (onlne Publshed on 5 November 04 www.researchmathsc.org Internatonal Journal of Complement of Type- Fuzzy Shortest Path Usng
More informationA Robust Method for Calculating the Correlation Coefficient
A Robust Method for Calculatng the Correlaton Coeffcent E.B. Nven and C. V. Deutsch Relatonshps between prmary and secondary data are frequently quantfed usng the correlaton coeffcent; however, the tradtonal
More informationA Local Variational Problem of Second Order for a Class of Optimal Control Problems with Nonsmooth Objective Function
A Local Varatonal Problem of Second Order for a Class of Optmal Control Problems wth Nonsmooth Objectve Functon Alexander P. Afanasev Insttute for Informaton Transmsson Problems, Russan Academy of Scences,
More informationA Lower Bound on SINR Threshold for Call Admission Control in Multiple-Class CDMA Systems with Imperfect Power-Control
A ower Bound on SIR Threshold for Call Admsson Control n Multple-Class CDMA Systems w Imperfect ower-control Mohamed H. Ahmed Faculty of Engneerng and Appled Scence Memoral Unversty of ewfoundland St.
More informationFUZZY GOAL PROGRAMMING VS ORDINARY FUZZY PROGRAMMING APPROACH FOR MULTI OBJECTIVE PROGRAMMING PROBLEM
Internatonal Conference on Ceramcs, Bkaner, Inda Internatonal Journal of Modern Physcs: Conference Seres Vol. 22 (2013) 757 761 World Scentfc Publshng Company DOI: 10.1142/S2010194513010982 FUZZY GOAL
More informationFor now, let us focus on a specific model of neurons. These are simplified from reality but can achieve remarkable results.
Neural Networks : Dervaton compled by Alvn Wan from Professor Jtendra Malk s lecture Ths type of computaton s called deep learnng and s the most popular method for many problems, such as computer vson
More information