A Return and Risk Model for Efficient Spectrum Sharing in Cognitive Radio Networks

Size: px
Start display at page:

Download "A Return and Risk Model for Efficient Spectrum Sharing in Cognitive Radio Networks"

Transcription

1 A eturn and sk Model for Effcent Spectrum Sharng n Cogntve ado Networks Mao Pan,HaoYue, Yuguang Fang and Phone Ln Department of Electrcal and Computer Engneerng, Unversty of Florda, Ganesvlle, FL 326, USA Department of Computer Scence and Informaton Engneerng, Natonal Tawan Unversty, Tape, 06, Tawan Abstract Cogntve ado technology releases the spectrum from shackles of authorzed lcenses and facltates the tradng of spectrum bands. In the spectrum market, prmary users PUs set prces for ther vacant bands and sell them for monetary gans, and secondary users SUs buy the bands and opportunstcally use them to satsfy ther servce demands when the PUs are not actve. However, when there are multple bands avalable for the SUs to access, the SU confronts the challenges of how to choose bands and how to splt hs traffc over them consderng both the contenton from peer SUs as well as the unpredctable actvtes of the PUs. In ths paper, we propose a return and rsk model to represent these concerns of the SU, and help the SU to make approprate decsons of traffc dstrbuton over avalable spectrum bands, ether the bands belongng to SU tself or the bands shared wth PUs. The smulaton and analyss show that our spectrum sharng scheme s effcent n terms of maxmum return for gven rsk or mnmum rsk for gven return, and s also effectve n mprovng the spectrum utlzaton and SUs satsfactory degrees. Index Terms Cogntve ado, eturn, sk, Mx of Bands I. INTODUCTION ecent years has wtnessed the boomng growth of wreless networks and floursh of varous wreless servces. In parallel wth that, current statc spectrum allocaton polcy of Federal Communcatons Commsson FCC [] results n the exhauston of avalable spectrum, whle many lcensed spectrum bands are extremely under usage. As one of the most promsng solutons to mprove spectrum utlzaton, cogntve rado technology allows the SUs to opportunstcally access to vacant bands belongng to PUs n ether temporal or spatal doman [2], [3]. The dea of openng up the lcensed spectrum bands n cogntve rado networks ntates the market of spectrum tradng, and promotes a batch of nterestng research on related topcs. Specfcally, n [4], Grandblase has generally descrbed the possble scenaros and ntroduced some mcroeconomcs nspred mechansms of dynamc spectrum access; from the PUs aspect, Xng [5] and Nyato [6] have well nvestgated the spectrum prcng ssues n the spectrum market where multple PUs compete wth each other to offer spectrum access to the SUs; from the SUs aspect, people are nterested n how the SU chooses to dstrbute hs traffc over the spectrum The work of Pan, Yue and Fang was partally supported by the U.S. Natonal Scence Foundaton under grant CNS-09639, CNS and CNS The work of Ln was partally sponsored by the Natonal Scence Councl NSC, OC, under contract numbers NSC E MY2, NSC E and NSC E , and the Mnstry of Educaton, OC, under contract numbers and bands when there s more than one unoccuped lcensed band. Motamed [7] has formulated ths problem as a multarmed bandt problem and proposed a renforce learnng algorthm to consstently track the best band n terms of band condton. However, f the SU ontly consders the contenton among the SUs and the actvtes of PUs n cogntve rado networks, the concept of the best band tends to be ambguous snce he can nether dentfy the band wth least competton among SUs as the best band, nor regard the one wth most possblty of PU s absence as the best band. In ths paper, we propose to leverage SU s expected return to model the contenton among SUs and the varance of return to represent the potental rsk of PUs comng back. Instead of swarmng all the traffc over the best band, we make the SU splt hs traffc on a dversfed mx of bands. In partcular, we llustrate how the SU effcently dstrbutes hs traffc over the rsk free band of hs own and rsky bands shared wth PUs, and how the SU effcently selects the mx of rsky bands belongng to PUs. Smulaton results show that the proposed spectrum sharng scheme s effcent n the sense that the SU s able to obtan maxmum return for gven rsk or carry on mnmum rsk for gven return, except for t s effectve n mprovng the spectrum utlzaton and SUs satsfacton. II. SYSTEM MODEL A. Overvew We consder a wreless system wth multple PUs operatng on dfferent spectrum bands and multple SUs who can take opportunstc use of these frequences. That s to say, consderng the constrants of geographcal locaton, SUs are able to access to dfferent spectrum bands belongng to dfferent PUs when the PUs servces are not on; SUs must dsconnect and move out of PU s spectrum bands mmedately when PUs become actve. For example, as shown n Fg.a, the leftmost SU can opportunstcally access to the spectrum bands owned by {PU,PU 2,,PU } snce he s n the coverage of these PUs The grey part of PU s spectrum represents the currently vacant spectrum bands whch the SUs can access to. A PU may own more than one avalable spectrum band at a gven tme pont.. Smlarly, the rghtmost SU has to opportunstcally The process of selectng a mx of bands may be dvded nto two stages. The frst stage starts wth samplng and observaton, and ends wth statstcal values about the future performances of avalable spectrum bands [8]; the second stage starts wth the relevant values about future performances, and ends wth the selecton of the band mx. In ths paper, we are only concerned wth the second stage /0/$ IEEE

2 Prce p Spectrum F Prce p Prce p a System archtecture t 0 t t 2 t τ Spectrum F N Seller-layer Prce pn Buyer-layer b Perodcal spectrum sellng t n Prmary User Secondary User tme Fg.. System model for spectrum sharng use the spectrum bands of {PU,PU +,,PU n } because of hs locaton. From the vew of PUs, they allow unlcensed SUs to opportunstcally use ther bands for monetary purposes. In ths case, a PU wll set reasonable prces for hs unoccuped bands consderng the band condton as well as competton among the PUs n the spectrum market [5], [6], and sell those bands perodcally to enlarge hs revenue as shown n Fg.b. On the other hand, the SUs need to decde how to access to, or say how to buy, those vacant spectrum bands wth dfferent characterstcs. Intutvely, the decson-makng process of the SU must take the contenton from the other SUs.e., the competton for the transmsson opportuntes among the SUs, ust the same as n the pure Ad-hoc networks and prce of the avalable spectrum bands nto consderaton. Besdes, the SUs are also concerned wth qualty of the bands, and worred about the unpredctable comng back of PUs traffc. B. Qualty of the Spectrum Bands As for a SU, the characterstcs of the avalable bands shared by the PUs are not dentcal. The qualty of those bands may be evaluated qute dfferently by dfferent SUs regardng the locaton of the SUs, the frequency of the unoccuped bands, the contguty of bands provded, etc.; Table.I quoted from [5] roughly shows the change n terms of receved power when the transmsson s swtched from one frequency to another. When dong the computaton, we suppose the antenna gan both G t and G r to be, and the dstance d to be the same. As we can see, for nstance, when the transmsson frequency s swtched from 3000 MHz to 300 MHz, for the same transmsson power, the receved power wll ncrease by 20 db 2. To model these phenomena, spectral effcency q of transmsson of the SUs can be summarzed as [5], [6], qw,d W log 2 + y b d 2. N 0 2 Here, we gnore the effect of nterference and mult-path effects. TABLE I GAIN WITH DIFFEENT FEQUENCIES Intal Frequency Target Frequency ato Gan MHz MHz db where y b s sgnal power, W s the bandwdth of the spectrum band, and d s the dstance between the PU and the SU. Wth the help of spectrum effcency q, dfferent spectrum bands can be ranked accordng to the SU s preferences. III. ETUN AND ISK But, n cogntve rado networks, qualty s not the only crteron for the SUs to evaluate the condton of spectrum bands, especally the ones bought from the PUs. Snce the PUs can become actve at any tme, the SU must carry on the rsk of sharng spectrum bands wth PUs f we assume the payment for the spectrum s non-refundable. It s necessary for a SU to take the PUs actvtes nto account when he makes choce of the spectrum bands. To formulate all SU s concerns, we let a random varable r 0 r represent the contenton stuaton for a SU n band,.e., r denotes the tme that the SU can use for hs transmsson durng a unt sellng/buyng tme perod consderng the competton from the peer SUs. Thus, when the SU s usng band bought from PUs, hs monetary revenue for one perod s r q v p, 2 where q s the spectral effcency of band as descrbed n Secton II-B, v s the revenue the SU attans for satsfyng the traffc demands per Mbps, p s the unt prce for sharng band wth PUs, and s the monetary gans the SU obtans by usng band. Gven a specfc band, s a random varable dependng on r snce v, q and p can be regarded as constants. Wthout loss of generalty, we use the expected value 3, E, to represent the expected return of the SU, and the varance, σ σ > 0, to represent the rsk of return,.e., the SU s potental worry about PUs traffc comng back on band. Smlarly, f the SU s usng hs own bands, hs return can be expressed as, s r s q s v c s, 3 where s s the rsk-free return σ s 0per Mbps, r s s a random varable reflectng the contenton status, q s s the 3 These values can be abstracted from the hstory record of the prevous m or drectly from database of whte space [8].

3 low retrun s low rsk s Fg. 2. hgh retrun s 2 hgh rsk s 2 eturn vs sk. spectrum effcency coeffcent, and c s s the nherent cost of the SU s own band. We assume there are n dfferent bands denoted by N {, 2,,n} owned by PUs, and can be opportunstcally accessed by the SUs. Then, there wll be an nterestng queston for the SU,.e., how does a SU choose hs way to share the bands wth PUs, or say, how to dstrbute hs traffc over all the bands ncludng both rsk-free band of hs own and rsky bands from PUs. The problem can be mathematcally expressed as the follows, and E ηe s + ηe p, 4 E p n ω E, 5 where s the overall monetary return per Mbps, s s the rsk-free return per Mbps from dstrbutng traffc on the SU s own band, and p s the rsky return per Mbps from dstrbutng traffc on the PUs bands. The value of 0 η< ndcates that the SU takes opportunstc use of PUs vacant bands, whle η s s the return from the SU s own band. p s a weghted average of wth ω as non-negatve weghts, where s ndependent of ω. Intutvely, we fnd that the SU s able to maxmze hs expected return by pourng all hs traffc over the band k wth the maxmal expected return,.e., k argmax E. N However, the rsk of usng the chosen band k may be qute hgh, whch means the maxmum return s not guaranteed wth regard to the PU s actvtes, e.g., for the SU, the return E 2 s larger than E, but the rsk σ 2 s also greater than σ, as shown n Fg.2. Consequently, a ratonal or rsk-averse SU s not lkely to gamble all hs traffc on ths band snce the return may be extraordnarly low. On the other hand, f a SU dversfes hs traffc over a mx of dfferent bands, he may obtan gven return wth the correspondng mnmal rsk or maxmum return wth the gven rsk. So, the spectrum sharng s consdered to be effcent f the SU chooses a mx of PUs spectrum bands wth maxmum E for gven σ or less and mnmum σ for gven E or more, whch can be abbrevated as E σ crteron. As for the SU, the effcent spectrum sharng nvolves two ssues:. How to splt the traffc over the rsk-free band belongng to the SU and the rsky bands belongng to PUs; 2. How to choose the mx of the PUs bands. IV. THE EFFICIENT TAFFIC DISTIBUTION OVE ISKY AND ISK-FEE BANDS A. Traffc Splttng over the Mx of Bands In last secton, we establsh the relaton between the SU s traffc dstrbuton over arbtrary mx of spectrum bands and hs total expected return E as llustrated n equaton 4. Wth smple dervaton, we rewrte E and σ of the return of the band mx as, { E E s + η E p E s σ 2 6 η2 σp. 2 After elmnatng η between these two equatons above, we fnd that the drect relaton between the expected value of the SU s return of the traffc per Mbps and the rsk parameters of hs traffc splttng s: { E E s + θσ θ E p E s /σ p. In terms of any arbtrarly selected mx of spectrum bands, therefore, the SU s expected return on hs traffc dstrbuton over these bands s lnearly related to the rsk of return, as measured by the standard devaton of hs return. Gven any selected mx, the ntercept of ths lnear functon s the rskfree return s and ts slope s gven by θ, whch s determned by the parameters p and σ p of the partcular band mx of PUs beng consdered. Moreover, let us consder all possble mxes of spectrum bands. Those mxes wth the same θ value le on the same Opportunstc Spectrum Utlzaton Lne OSUL, but those have dfferent θ values wll produce dfferent OSULs between return and rsk for the SUs as shown n Fg.3. The SU s problem s to decde whch OSUL to choose the proper value of η, and how ntensvely to use t the proper value of ω. A ratonal SU adherng to the proposed effcent sharng crteron wll mnmze the varance of hs overall return σ 2 assocated wth any expected return E he may choose by confnng all hs selecton n bands to the mx wth the largest θ value. After choosng the band mx by maxmzng θ, the SU can complete hs effcent sharng choce and determne a unque best value of η,.e., the rato of the SU s traffc dstrbuton on the rsky bands and the amount of traffc on hs own rsk-free band. B. The Geometry of the Effcent Traffc Splttng The algebrac analyss gven above can be represented graphcally as n Fg.3. Any avalable mx of spectrum bands from PUs s characterzed by a par of values σ p, p whch can be represented as a pont n a plane wth σ as the horzonal axs and as the vertcal axs. Our assumptons nsure that the ponts representng all avalable band mxes le n a fnte regon, all parts of whch le to the rght of the lne σ 0, and that ths regon s bounded by a closed curve. All the σ, pars wth any partcular mx le on a seres of lne segments from the pont 0, f, where η 0,to the ponts on the boundary of attanable set, where η. Each possble band mx thus determnes a unque OSUL. Thus, 7

4 s m Effcent Set for the Band Mxes from PUs S a s Effcent Set for the Band Mxes from PUs S As for the SU, the effcent mx s the one whch maxmzes θ as we dscussed n the Secton IV. Therefore, we examne the partal dervatves of θ wth respect to the ω and fnd, θ σ p [ x λω σ x + ω σ x ], 3 ω s 2 s 0 σa σp σ Fg. 3. a Gven σ a 0 σp σ b Gven a Geometry of traffc splttng between rsk free and rsky bands the optmal band mx s determned by two factors: the SU s selecton of s and hs selecton of θ. Accordng to the -σ rule, the optmal s selecton strategy for the SU s to make full use of hs own band. As shown n Fg.3a, for gven rsk σ a, the total return of the SU wth the maxmum s.e., s m n Fg.3a s greater than that wth less rsk-free return.e., s, s 2,, s m. Then, the second factor s θ, the slope of OSUL. Note that shfts from one possble mx to another, rotatng the assocated OSUL counter clockwse, move the SU to preferred postons. The lmt of the favorable rotaton s OSUL wth the maxmum attanable θ, whch dentfes the effcent mx of spectrum bands. V. THE EFFICIENT MIX OF PUS SPECTUM BANDS Now, the problem left s how to select the effcent mx of PUs spectrum bands,.e., how to determne the proper value of ω. We see that f ω s assgned to the th band for servce provdng, the return of the th band wll be ω, whch can also be wrtten n the form ω ω s +ω s. 8 By usng the constrant ω, the expected return per Mbps for any mx of PUs bands can be expressed as E p [ ω E E s + ω E ] s E s + ω E E s. 9 Thus, the expectaton and varance of the return on any mx of PUs bands s { E p E s + ω E E s σ p ω 0 ω σ. where σ represents the varance σ when, and covarances when. By defnng x s,the notatons n the rght-hand expressons are able to be further smplfed : { E p E s + ω x σ p ω ω σ x. By substtutng equaton nto equaton 7, θ defned n Secton IV-A can be wrtten as θ E p E s ω ˇx σ p /2 ω. 2 ω σ x /2 where λ x σ 2 p ω x ω. 4 ω σ x The necessary and suffcent condtons on the relatve values of the ω for a statonary and the unque maxmum are obtaned by settng the dervatves above equal to zero, whch gve the set of equatons ζ σ x + ζ σ x x, N 5 where ζ λω. Note that the set of equatons are lnear n terms of the own-varances, σ x, pooled covarances, σ x, and excess returns, x, of the respectve spectrum bands from PUs. Snce the covarance matrx s postve defnte and hence nonsngular, there s a unque soluton to ths system of equatons, ζ σ x x, 6 where σ x represents the th element of the nverse of the covarance matrx. Ths soluton may also be expressed n terms of the prmary varables as ω λ σ x s, N. 7 Moreover, ζ λω mples ζ λ ω. 8 When we leverage the constrant ω, λ s readly evaluated as ζ λ ω λ. 9 The optmal ζ can consequently be scaled to the effcent traffc splttng over the band mx ω, whch s ζ λ x σ 2 x. 20 It s also nterestng to note that f we represent the rato of the expected excess return to ts varance for the th band at the effcent sharng, we have x ω λ λ ω, where λ x. 2 σ x σ x The fracton of traffc dstrbuted n each band n the effcent band mx of PUs s equal to the rato of ts λ to λ of the entre mx mnus the rato of ts pooled covarance wth other bands to ts own varance. As a result, f the SU acts on the assumpton that all the covarances were zero, he s able to pck hs optmal band mx of PUs smply by determnng the λ rato of the expected excess return x s of each

5 AND AV AND AV ato Spectrum Utlzaton ato SUs Satsfactory Degree AND AV a The rato of return and rsk b Spectrum utlzaton c SUs satsfactory degrees Fg. 4. Performance comparson of dfferent traffc splttng schemes over spectrum bands spectrum band to ts varance σ x σ, and settng each ω λ / λ. Consder the case of no covarances, we fnd λ λ x /σx 2. Wth ths smplfed assumpton, the λ ratos of each band s enough to determne the effcent mx 4. VI. SIMULATION AND ANALYSIS In ths secton, we compare the proposed E σ based traffc splttng wth random splttng AND and averaged splttng AV over the bands to demonstrate ts effcency n spectrum sharng n terms of E σ rato, spectrum utlzaton and SUs satsfactory degrees. We set up the smulaton wth a smlar settng to that shown n Fg., modelng a SU to choose hs traffc dstrbuton over a mx of hs own band and bands of PUs. For llustraton purpose, we suppose that the rsk free return f s equal to 5 and the number of PUs bands n s 0. Wthout loss of generalty, we assume the return of the band belongng to PUs > 5 monotoncally ncreases wth the rsk of that band σ σ > 0. As depcted n Fg.4a, when the number of spectrum bands ncreases, the E σ rato ncreases n all these three schemes. But the proposed spectrum sharng s more effcent than AND and AV because t dstrbutes traffc to the th band wth ω λ λ, whch makes t acheve the maxmal θ and guarantee the maxmum wth gven σ or mnmum σ wth gven. In Fg.4b, we evaluate the performance of spectrum utlzaton. Note that no matter the band s used by the PU or used by the SU, the spectrum band tself should be consdered as utlzed one. The spectrum utlzaton should be calculated as the rato of the number of utlzed bands to the number of total bands. Accordng to ths defnton, we fnd that the E σ based traffc splttng s stll slghtly better than the other two schemes. The reason s that the SU wll dstrbute less traffc on the more rsky band f he shares the spectrum accordng to E σ rule. In ths way, although the SU cannot releve hs servces from mpact of the PUs comng back to 00%, he s able to take more opportunstc use of the lcensed bands of 4 In the more general case wth non-zero covarances, a sngle set of lnear equatons must be solved n the usual way, but no lnear or non-lnear programmng s requred. PUs. By contrast, the spectrum utlzaton n both AND and AV are more lkely affected by the PUs actvtes. Smlar analyss also apples to the SUs satsfactory degrees, whch can be defned as the rato of satsfed demands to overall demands of the SU. Compared wth AND and AV, the satsfactory degrees of E σ based spectrum sharng s hgher when the vacant spectrum of PUs s not abundant. VII. CONCLUSION In ths paper, we propose a return and rsk model for spectrum sharng n cogntve rado networks. Consderng the rsk of gatherng all the traffc on one band, we elaborate on how to choose a effcent band mx consstng of rsky and rsk free bands, and gude the SUs to dstrbute hs traffc over them. By numercal smulatons, we show that our spectrum sharng scheme s effcent n terms of E σ crteron, and t mproves the spectrum utlzaton and SUs satsfactory degrees as well. EFEENCES [] FCC, Spectrum polcy task force report, eport of Federal Communcatons Commsson, Et docket No , November [2] IEEE P802.22/D0. Draft Standard for Wreless egonal Area Networks Part 22: Cogntve Wreless AN Medum Access Control MAC and Physcal Layer PHY specfcatons: Polces and procedures for operaton n the TV Bands, IEEE Workng Group on Wreless egonal Area Networks, IEEE doc: P D0., May [3] I. Akyldz, W. Lee, M. Vuran, and M. Shantdev, Next generaton/ dynamc spectrum access/ cogntve rado wreless networks: a survey, Computer Networks Elsever Journal, vol. 50, no. 4, pp , September [4] D. Grandblase, P. Bag, P. Levne, K. Moessner, and M. Pan, Mcroeconomcs nspred mechansms to manage dynamc spectrum allocaton, n Proc. of IEEE Internatonal Symposum on New Fronters n Dynamc Spectrum Access Networks, DySPAN 07, Dubln, Ireland, Aprl [5] Y. Xng,. Chandramoul, and C. Cordero, Prce dynamcs n compettve agle spectrum access markets, IEEE Journal on Selected Areas n Communcatons, vol. 25, no. 3, pp , Aprl [6] D. Nyato and E. Hossan, Compettve prcng for spectrum sharng n cogntve rado networks: Dynamc game, neffcency of nash equlbrum, and colluson, IEEE Journal on Selected Areas n Communcatons, vol. 26, no., pp , January [7] A. Motamed and A. Baha, Optmal channel selecton for spectrumagle low-power wreless packet swtched networks n unlcensed band, EUASIP J. Wrel. Commun. Netw., vol. 2008, pp. 0, [8] D. Gurney, G. Buchwald, L. Ecklund, S. Kuffner, and J. Grosspetsch, Geo-locaton database technques for ncumbent protecton n the tv whte space, n Proc. of IEEE Internatonal Symposum on New Fronters n Dynamc Spectrum Access Networks, DySPAN 08, Chcago, Illnos, October 2008.

Calculation of the received voltage due to the radiation from multiple co-frequency sources

Calculation of the received voltage due to the radiation from multiple co-frequency sources Rec. ITU-R SM.1271-0 1 RECOMMENDATION ITU-R SM.1271-0 * EFFICIENT SPECTRUM UTILIZATION USING PROBABILISTIC METHODS Rec. ITU-R SM.1271 (1997) The ITU Radocommuncaton Assembly, consderng a) that communcatons

More information

The Spectrum Sharing in Cognitive Radio Networks Based on Competitive Price Game

The Spectrum Sharing in Cognitive Radio Networks Based on Competitive Price Game 8 Y. B. LI, R. YAG, Y. LI, F. YE, THE SPECTRUM SHARIG I COGITIVE RADIO ETWORKS BASED O COMPETITIVE The Spectrum Sharng n Cogntve Rado etworks Based on Compettve Prce Game Y-bng LI, Ru YAG., Yun LI, Fang

More information

A TWO-PLAYER MODEL FOR THE SIMULTANEOUS LOCATION OF FRANCHISING SERVICES WITH PREFERENTIAL RIGHTS

A TWO-PLAYER MODEL FOR THE SIMULTANEOUS LOCATION OF FRANCHISING SERVICES WITH PREFERENTIAL RIGHTS A TWO-PLAYER MODEL FOR THE SIMULTANEOUS LOCATION OF FRANCHISING SERVICES WITH PREFERENTIAL RIGHTS Pedro Godnho and oana Das Faculdade de Economa and GEMF Unversdade de Combra Av. Das da Slva 65 3004-5

More information

antenna antenna (4.139)

antenna antenna (4.139) .6.6 The Lmts of Usable Input Levels for LNAs The sgnal voltage level delvered to the nput of an LNA from the antenna may vary n a very wde nterval, from very weak sgnals comparable to the nose level,

More information

Comparative Analysis of Reuse 1 and 3 in Cellular Network Based On SIR Distribution and Rate

Comparative Analysis of Reuse 1 and 3 in Cellular Network Based On SIR Distribution and Rate Comparatve Analyss of Reuse and 3 n ular Network Based On IR Dstrbuton and Rate Chandra Thapa M.Tech. II, DEC V College of Engneerng & Technology R.V.. Nagar, Chttoor-5727, A.P. Inda Emal: chandra2thapa@gmal.com

More information

Resource Allocation Optimization for Device-to- Device Communication Underlaying Cellular Networks

Resource Allocation Optimization for Device-to- Device Communication Underlaying Cellular Networks Resource Allocaton Optmzaton for Devce-to- Devce Communcaton Underlayng Cellular Networks Bn Wang, L Chen, Xaohang Chen, Xn Zhang, and Dacheng Yang Wreless Theores and Technologes (WT&T) Bejng Unversty

More information

Traffic balancing over licensed and unlicensed bands in heterogeneous networks

Traffic balancing over licensed and unlicensed bands in heterogeneous networks Correspondence letter Traffc balancng over lcensed and unlcensed bands n heterogeneous networks LI Zhen, CUI Qme, CUI Zhyan, ZHENG We Natonal Engneerng Laboratory for Moble Network Securty, Bejng Unversty

More information

Queuing-Based Dynamic Channel Selection for Heterogeneous Multimedia Applications over Cognitive Radio Networks

Queuing-Based Dynamic Channel Selection for Heterogeneous Multimedia Applications over Cognitive Radio Networks 1 Queung-Based Dynamc Channel Selecton for Heterogeneous ultmeda Applcatons over Cogntve Rado Networks Hsen-Po Shang and haela van der Schaar Department of Electrcal Engneerng (EE), Unversty of Calforna

More information

Walsh Function Based Synthesis Method of PWM Pattern for Full-Bridge Inverter

Walsh Function Based Synthesis Method of PWM Pattern for Full-Bridge Inverter Walsh Functon Based Synthess Method of PWM Pattern for Full-Brdge Inverter Sej Kondo and Krt Choesa Nagaoka Unversty of Technology 63-, Kamtomoka-cho, Nagaoka 9-, JAPAN Fax: +8-58-7-95, Phone: +8-58-7-957

More information

Dynamic Optimization. Assignment 1. Sasanka Nagavalli January 29, 2013 Robotics Institute Carnegie Mellon University

Dynamic Optimization. Assignment 1. Sasanka Nagavalli January 29, 2013 Robotics Institute Carnegie Mellon University Dynamc Optmzaton Assgnment 1 Sasanka Nagavall snagaval@andrew.cmu.edu 16-745 January 29, 213 Robotcs Insttute Carnege Mellon Unversty Table of Contents 1. Problem and Approach... 1 2. Optmzaton wthout

More information

Performance Analysis of Multi User MIMO System with Block-Diagonalization Precoding Scheme

Performance Analysis of Multi User MIMO System with Block-Diagonalization Precoding Scheme Performance Analyss of Mult User MIMO System wth Block-Dagonalzaton Precodng Scheme Yoon Hyun m and Jn Young m, wanwoon Unversty, Department of Electroncs Convergence Engneerng, Wolgye-Dong, Nowon-Gu,

More information

Joint Adaptive Modulation and Power Allocation in Cognitive Radio Networks

Joint Adaptive Modulation and Power Allocation in Cognitive Radio Networks I. J. Communcatons, etwork and System Scences, 8, 3, 7-83 Publshed Onlne August 8 n ScRes (http://www.scrp.org/journal/jcns/). Jont Adaptve Modulaton and Power Allocaton n Cogntve Rado etworks Dong LI,

More information

Malicious User Detection in Spectrum Sensing for WRAN Using Different Outliers Detection Techniques

Malicious User Detection in Spectrum Sensing for WRAN Using Different Outliers Detection Techniques Malcous User Detecton n Spectrum Sensng for WRAN Usng Dfferent Outlers Detecton Technques Mansh B Dave #, Mtesh B Nakran #2 Assstant Professor, C. U. Shah College of Engg. & Tech., Wadhwan cty-363030,

More information

Selective Sensing and Transmission for Multi-Channel Cognitive Radio Networks

Selective Sensing and Transmission for Multi-Channel Cognitive Radio Networks IEEE INFOCOM 2 Workshop On Cogntve & Cooperatve Networks Selectve Sensng and Transmsson for Mult-Channel Cogntve Rado Networks You Xu, Yunzhou L, Yfe Zhao, Hongxng Zou and Athanasos V. Vaslakos Insttute

More information

A NSGA-II algorithm to solve a bi-objective optimization of the redundancy allocation problem for series-parallel systems

A NSGA-II algorithm to solve a bi-objective optimization of the redundancy allocation problem for series-parallel systems 0 nd Internatonal Conference on Industral Technology and Management (ICITM 0) IPCSIT vol. 49 (0) (0) IACSIT Press, Sngapore DOI: 0.776/IPCSIT.0.V49.8 A NSGA-II algorthm to solve a b-obectve optmzaton of

More information

Test 2. ECON3161, Game Theory. Tuesday, November 6 th

Test 2. ECON3161, Game Theory. Tuesday, November 6 th Test 2 ECON36, Game Theory Tuesday, November 6 th Drectons: Answer each queston completely. If you cannot determne the answer, explanng how you would arrve at the answer may earn you some ponts.. (20 ponts)

More information

Distributed Uplink Scheduling in EV-DO Rev. A Networks

Distributed Uplink Scheduling in EV-DO Rev. A Networks Dstrbuted Uplnk Schedulng n EV-DO ev. A Networks Ashwn Srdharan (Sprnt Nextel) amesh Subbaraman, och Guérn (ESE, Unversty of Pennsylvana) Overvew of Problem Most modern wreless systems Delver hgh performance

More information

To: Professor Avitabile Date: February 4, 2003 From: Mechanical Student Subject: Experiment #1 Numerical Methods Using Excel

To: Professor Avitabile Date: February 4, 2003 From: Mechanical Student Subject: Experiment #1 Numerical Methods Using Excel To: Professor Avtable Date: February 4, 3 From: Mechancal Student Subject:.3 Experment # Numercal Methods Usng Excel Introducton Mcrosoft Excel s a spreadsheet program that can be used for data analyss,

More information

The Impact of Spectrum Sensing Frequency and Packet- Loading Scheme on Multimedia Transmission over Cognitive Radio Networks

The Impact of Spectrum Sensing Frequency and Packet- Loading Scheme on Multimedia Transmission over Cognitive Radio Networks Ths artcle has been accepted for publcaton n a future ssue of ths journal, but has not been fully edted. Content may change pror to fnal publcaton. The Impact of Spectrum Sensng Frequency and Pacet- Loadng

More information

Study of Downlink Radio Resource Allocation Scheme with Interference Coordination in LTE A Network

Study of Downlink Radio Resource Allocation Scheme with Interference Coordination in LTE A Network Internatonal Journal of Future Computer and Communcaton, Vol. 6, o. 3, September 2017 Study of Downln Rado Resource Allocaton Scheme wth Interference Coordnaton n LTE A etwor Yen-Wen Chen and Chen-Ju Chen

More information

A Comparison of Two Equivalent Real Formulations for Complex-Valued Linear Systems Part 2: Results

A Comparison of Two Equivalent Real Formulations for Complex-Valued Linear Systems Part 2: Results AMERICAN JOURNAL OF UNDERGRADUATE RESEARCH VOL. 1 NO. () A Comparson of Two Equvalent Real Formulatons for Complex-Valued Lnear Systems Part : Results Abnta Munankarmy and Mchael A. Heroux Department of

More information

Performance Evaluation of QoS Parameters in Dynamic Spectrum Sharing for Heterogeneous Wireless Communication Networks

Performance Evaluation of QoS Parameters in Dynamic Spectrum Sharing for Heterogeneous Wireless Communication Networks IJCSI Internatonal Journal of Computer Scence Issues, Vol. 9, Issue 1, No 2, January 2012 ISSN (Onlne): 1694-0814 www.ijcsi.org 81 Performance Evaluaton of QoS Parameters n Dynamc Spectrum Sharng for Heterogeneous

More information

Passive Filters. References: Barbow (pp ), Hayes & Horowitz (pp 32-60), Rizzoni (Chap. 6)

Passive Filters. References: Barbow (pp ), Hayes & Horowitz (pp 32-60), Rizzoni (Chap. 6) Passve Flters eferences: Barbow (pp 6575), Hayes & Horowtz (pp 360), zzon (Chap. 6) Frequencyselectve or flter crcuts pass to the output only those nput sgnals that are n a desred range of frequences (called

More information

UNIT 11 TWO-PERSON ZERO-SUM GAMES WITH SADDLE POINT

UNIT 11 TWO-PERSON ZERO-SUM GAMES WITH SADDLE POINT UNIT TWO-PERSON ZERO-SUM GAMES WITH SADDLE POINT Structure. Introducton Obectves. Key Terms Used n Game Theory.3 The Maxmn-Mnmax Prncple.4 Summary.5 Solutons/Answers. INTRODUCTION In Game Theory, the word

More information

Adaptive Modulation for Multiple Antenna Channels

Adaptive Modulation for Multiple Antenna Channels Adaptve Modulaton for Multple Antenna Channels June Chul Roh and Bhaskar D. Rao Department of Electrcal and Computer Engneerng Unversty of Calforna, San Dego La Jolla, CA 993-7 E-mal: jroh@ece.ucsd.edu,

More information

Uncertainty in measurements of power and energy on power networks

Uncertainty in measurements of power and energy on power networks Uncertanty n measurements of power and energy on power networks E. Manov, N. Kolev Department of Measurement and Instrumentaton, Techncal Unversty Sofa, bul. Klment Ohrdsk No8, bl., 000 Sofa, Bulgara Tel./fax:

More information

A MODIFIED DIRECTIONAL FREQUENCY REUSE PLAN BASED ON CHANNEL ALTERNATION AND ROTATION

A MODIFIED DIRECTIONAL FREQUENCY REUSE PLAN BASED ON CHANNEL ALTERNATION AND ROTATION A MODIFIED DIRECTIONAL FREQUENCY REUSE PLAN BASED ON CHANNEL ALTERNATION AND ROTATION Vncent A. Nguyen Peng-Jun Wan Ophr Freder Computer Scence Department Illnos Insttute of Technology Chcago, Illnos vnguyen@t.edu,

More information

Rejection of PSK Interference in DS-SS/PSK System Using Adaptive Transversal Filter with Conditional Response Recalculation

Rejection of PSK Interference in DS-SS/PSK System Using Adaptive Transversal Filter with Conditional Response Recalculation SERBIAN JOURNAL OF ELECTRICAL ENGINEERING Vol., No., November 23, 3-9 Rejecton of PSK Interference n DS-SS/PSK System Usng Adaptve Transversal Flter wth Condtonal Response Recalculaton Zorca Nkolć, Bojan

More information

A Fuzzy-based Routing Strategy for Multihop Cognitive Radio Networks

A Fuzzy-based Routing Strategy for Multihop Cognitive Radio Networks 74 Internatonal Journal of Communcaton Networks and Informaton Securty (IJCNIS) Vol. 3, No., Aprl 0 A Fuzzy-based Routng Strategy for Multhop Cogntve Rado Networks Al El Masr, Naceur Malouch and Hcham

More information

Research of Dispatching Method in Elevator Group Control System Based on Fuzzy Neural Network. Yufeng Dai a, Yun Du b

Research of Dispatching Method in Elevator Group Control System Based on Fuzzy Neural Network. Yufeng Dai a, Yun Du b 2nd Internatonal Conference on Computer Engneerng, Informaton Scence & Applcaton Technology (ICCIA 207) Research of Dspatchng Method n Elevator Group Control System Based on Fuzzy Neural Network Yufeng

More information

PRACTICAL, COMPUTATION EFFICIENT HIGH-ORDER NEURAL NETWORK FOR ROTATION AND SHIFT INVARIANT PATTERN RECOGNITION. Evgeny Artyomov and Orly Yadid-Pecht

PRACTICAL, COMPUTATION EFFICIENT HIGH-ORDER NEURAL NETWORK FOR ROTATION AND SHIFT INVARIANT PATTERN RECOGNITION. Evgeny Artyomov and Orly Yadid-Pecht 68 Internatonal Journal "Informaton Theores & Applcatons" Vol.11 PRACTICAL, COMPUTATION EFFICIENT HIGH-ORDER NEURAL NETWORK FOR ROTATION AND SHIFT INVARIANT PATTERN RECOGNITION Evgeny Artyomov and Orly

More information

Approximating User Distributions in WCDMA Networks Using 2-D Gaussian

Approximating User Distributions in WCDMA Networks Using 2-D Gaussian CCCT 05: INTERNATIONAL CONFERENCE ON COMPUTING, COMMUNICATIONS, AND CONTROL TECHNOLOGIES 1 Approxmatng User Dstrbutons n CDMA Networks Usng 2-D Gaussan Son NGUYEN and Robert AKL Department of Computer

More information

ANNUAL OF NAVIGATION 11/2006

ANNUAL OF NAVIGATION 11/2006 ANNUAL OF NAVIGATION 11/2006 TOMASZ PRACZYK Naval Unversty of Gdyna A FEEDFORWARD LINEAR NEURAL NETWORK WITH HEBBA SELFORGANIZATION IN RADAR IMAGE COMPRESSION ABSTRACT The artcle presents the applcaton

More information

TODAY S wireless networks are characterized as a static

TODAY S wireless networks are characterized as a static IEEE TRANSACTIONS ON MOBILE COMPUTING, VOL. 10, NO. 2, FEBRUARY 2011 161 A Spectrum Decson Framework for Cogntve Rado Networks Won-Yeol Lee, Student Member, IEEE, and Ian F. Akyldz, Fellow, IEEE Abstract

More information

Resource Control for Elastic Traffic in CDMA Networks

Resource Control for Elastic Traffic in CDMA Networks Resource Control for Elastc Traffc n CDMA Networks Vaslos A. Srs Insttute of Computer Scence, FORTH Crete, Greece vsrs@cs.forth.gr ACM MobCom 2002 Sep. 23-28, 2002, Atlanta, U.S.A. Funded n part by BTexact

More information

A Novel Optimization of the Distance Source Routing (DSR) Protocol for the Mobile Ad Hoc Networks (MANET)

A Novel Optimization of the Distance Source Routing (DSR) Protocol for the Mobile Ad Hoc Networks (MANET) A Novel Optmzaton of the Dstance Source Routng (DSR) Protocol for the Moble Ad Hoc Networs (MANET) Syed S. Rzv 1, Majd A. Jafr, and Khaled Ellethy Computer Scence and Engneerng Department Unversty of Brdgeport

More information

NOVEL ITERATIVE TECHNIQUES FOR RADAR TARGET DISCRIMINATION

NOVEL ITERATIVE TECHNIQUES FOR RADAR TARGET DISCRIMINATION NOVEL ITERATIVE TECHNIQUES FOR RADAR TARGET DISCRIMINATION Phaneendra R.Venkata, Nathan A. Goodman Department of Electrcal and Computer Engneerng, Unversty of Arzona, 30 E. Speedway Blvd, Tucson, Arzona

More information

Define Y = # of mobiles from M total mobiles that have an adequate link. Measure of average portion of mobiles allocated a link of adequate quality.

Define Y = # of mobiles from M total mobiles that have an adequate link. Measure of average portion of mobiles allocated a link of adequate quality. Wreless Communcatons Technologes 6::559 (Advanced Topcs n Communcatons) Lecture 5 (Aprl th ) and Lecture 6 (May st ) Instructor: Professor Narayan Mandayam Summarzed by: Steve Leung (leungs@ece.rutgers.edu)

More information

Impact of Secondary MAC Cooperation on Spectrum Sharing in Cognitive Radio Networks

Impact of Secondary MAC Cooperation on Spectrum Sharing in Cognitive Radio Networks Impact of Secondary MAC Cooperaton on Spectrum Sharng n Cogntve ado Networks Tarq Elkourd and Osvaldo Smeone CWCSP, ECE Dept. New Jersey Insttute of Technology Unversty Heghts, Newark, New Jersey 0702

More information

Multiagent Jamming-Resilient Control Channel Game for Cognitive Radio Ad Hoc Networks

Multiagent Jamming-Resilient Control Channel Game for Cognitive Radio Ad Hoc Networks Multagent Jammng-Reslent Control Channel Game for Cogntve Rado Ad Hoc Networks Brandon F. Lo and Ian F. Akyldz Broadband Wreless Networkng Laboratory, School of Electrcal and Computer Engneerng Georga

More information

Digital Transmission

Digital Transmission Dgtal Transmsson Most modern communcaton systems are dgtal, meanng that the transmtted normaton sgnal carres bts and symbols rather than an analog sgnal. The eect o C/N rato ncrease or decrease on dgtal

More information

QoS Provisioning in Wireless Data Networks under Non-Continuously Backlogged Users

QoS Provisioning in Wireless Data Networks under Non-Continuously Backlogged Users os Provsonng n Wreless Data Networks under Non-Contnuously Backlogged Users Tmotheos Kastrnoganns, and Symeon Papavasslou, Member, IEEE School of Electrcal and Computer Engneerng Natonal Techncal Unversty

More information

Parameter Free Iterative Decoding Metrics for Non-Coherent Orthogonal Modulation

Parameter Free Iterative Decoding Metrics for Non-Coherent Orthogonal Modulation 1 Parameter Free Iteratve Decodng Metrcs for Non-Coherent Orthogonal Modulaton Albert Gullén Fàbregas and Alex Grant Abstract We study decoder metrcs suted for teratve decodng of non-coherently detected

More information

Distributed Interference Alignment in Cognitive Radio Networks

Distributed Interference Alignment in Cognitive Radio Networks Dstrbuted Interference Algnment n Cogntve Rado Networks Y Xu and Shwen Mao Department of Electrcal and Computer Engneerng, Auburn Unversty, Auburn, AL, USA Abstract In ths paper, we nvestgate the problem

More information

Dynamic Pricing Approach for Spectrum Allocation in Wireless Networks with Selfish Users

Dynamic Pricing Approach for Spectrum Allocation in Wireless Networks with Selfish Users Dynamc Prcng Approach for Spectrum Allocaton n Wreless Networks wth Selfsh Users Zhu J and K. J. Ray Lu Electrcal and Computer Engneerng Department and Insttute for Systems Research Unversty of Maryland,

More information

A Novel DSA-Driven MAC Protocol for Cognitive Radio Networks

A Novel DSA-Driven MAC Protocol for Cognitive Radio Networks Wreless Sensor Networ, 29, 2, 6-2 do:.4236/wsn.29.2 7 Publshed Onlne July 29 (http://www.scrp.org/journal/wsn/). A Novel DSA-Drven MAC Protocol for Cogntve Rado Networs Hua SONG, Xaola LIN School of Informaton

More information

MTBF PREDICTION REPORT

MTBF PREDICTION REPORT MTBF PREDICTION REPORT PRODUCT NAME: BLE112-A-V2 Issued date: 01-23-2015 Rev:1.0 Copyrght@2015 Bluegga Technologes. All rghts reserved. 1 MTBF PREDICTION REPORT... 1 PRODUCT NAME: BLE112-A-V2... 1 1.0

More information

RESOURCE CONTROL FOR HYBRID CODE AND TIME DIVISION SCHEDULING

RESOURCE CONTROL FOR HYBRID CODE AND TIME DIVISION SCHEDULING RESOURCE CONTROL FOR HYBRID CODE AND TIME DIVISION SCHEDULING Vaslos A. Srs Insttute of Computer Scence (ICS), FORTH and Department of Computer Scence, Unversty of Crete P.O. Box 385, GR 7 Heraklon, Crete,

More information

Discussion on How to Express a Regional GPS Solution in the ITRF

Discussion on How to Express a Regional GPS Solution in the ITRF 162 Dscusson on How to Express a Regonal GPS Soluton n the ITRF Z. ALTAMIMI 1 Abstract The usefulness of the densfcaton of the Internatonal Terrestral Reference Frame (ITRF) s to facltate ts access as

More information

Improved Detection Performance of Cognitive Radio Networks in AWGN and Rayleigh Fading Environments

Improved Detection Performance of Cognitive Radio Networks in AWGN and Rayleigh Fading Environments Improved Detecton Performance of Cogntve Rado Networks n AWGN and Raylegh Fadng Envronments Yng Loong Lee 1, Wasan Kadhm Saad, Ayman Abd El-Saleh *1,, Mahamod Ismal 1 Faculty of Engneerng Multmeda Unversty

More information

A study of turbo codes for multilevel modulations in Gaussian and mobile channels

A study of turbo codes for multilevel modulations in Gaussian and mobile channels A study of turbo codes for multlevel modulatons n Gaussan and moble channels Lamne Sylla and Paul Forter (sylla, forter)@gel.ulaval.ca Department of Electrcal and Computer Engneerng Laval Unversty, Ste-Foy,

More information

Control Chart. Control Chart - history. Process in control. Developed in 1920 s. By Dr. Walter A. Shewhart

Control Chart. Control Chart - history. Process in control. Developed in 1920 s. By Dr. Walter A. Shewhart Control Chart - hstory Control Chart Developed n 920 s By Dr. Walter A. Shewhart 2 Process n control A phenomenon s sad to be controlled when, through the use of past experence, we can predct, at least

More information

Fuzzy Logic Power Control in Cognitive Radio

Fuzzy Logic Power Control in Cognitive Radio Fuzzy Logc ower Control n Cogntve Rado Zeljko Tabakovc Croatan ost and Electronc Communcatons Agency Jursceva 3 Zagreb, Croata zeljkotabakovc@telekomhr Sonja Grgc, Mslav Grgc Unversty of Zagreb, Faculty

More information

High Speed ADC Sampling Transients

High Speed ADC Sampling Transients Hgh Speed ADC Samplng Transents Doug Stuetzle Hgh speed analog to dgtal converters (ADCs) are, at the analog sgnal nterface, track and hold devces. As such, they nclude samplng capactors and samplng swtches.

More information

Distributed Energy Efficient Spectrum Access in Cognitive Radio Wireless Ad Hoc Networks

Distributed Energy Efficient Spectrum Access in Cognitive Radio Wireless Ad Hoc Networks Dstrbuted Energy Effcent Spectrum Access n Cogntve Rado Wreless Ad Hoc Networks Song Gao, Ljun Qan, Dhadesugoor. R. Vaman ARO/ARL Center for Battlefeld Communcatons Research Prare Vew A&M Unversty, Texas

More information

Joint Power Control and Scheduling for Two-Cell Energy Efficient Broadcasting with Network Coding

Joint Power Control and Scheduling for Two-Cell Energy Efficient Broadcasting with Network Coding Communcatons and Network, 2013, 5, 312-318 http://dx.do.org/10.4236/cn.2013.53b2058 Publshed Onlne September 2013 (http://www.scrp.org/journal/cn) Jont Power Control and Schedulng for Two-Cell Energy Effcent

More information

Throughput Maximization by Adaptive Threshold Adjustment for AMC Systems

Throughput Maximization by Adaptive Threshold Adjustment for AMC Systems APSIPA ASC 2011 X an Throughput Maxmzaton by Adaptve Threshold Adjustment for AMC Systems We-Shun Lao and Hsuan-Jung Su Graduate Insttute of Communcaton Engneerng Department of Electrcal Engneerng Natonal

More information

NATIONAL RADIO ASTRONOMY OBSERVATORY Green Bank, West Virginia SPECTRAL PROCESSOR MEMO NO. 25. MEMORANDUM February 13, 1985

NATIONAL RADIO ASTRONOMY OBSERVATORY Green Bank, West Virginia SPECTRAL PROCESSOR MEMO NO. 25. MEMORANDUM February 13, 1985 NATONAL RADO ASTRONOMY OBSERVATORY Green Bank, West Vrgna SPECTRAL PROCESSOR MEMO NO. 25 MEMORANDUM February 13, 1985 To: Spectral Processor Group From: R. Fsher Subj: Some Experments wth an nteger FFT

More information

Understanding the Spike Algorithm

Understanding the Spike Algorithm Understandng the Spke Algorthm Vctor Ejkhout and Robert van de Gejn May, ntroducton The parallel soluton of lnear systems has a long hstory, spannng both drect and teratve methods Whle drect methods exst

More information

A Current Differential Line Protection Using a Synchronous Reference Frame Approach

A Current Differential Line Protection Using a Synchronous Reference Frame Approach A Current Dfferental Lne rotecton Usng a Synchronous Reference Frame Approach L. Sousa Martns *, Carlos Fortunato *, and V.Fernão res * * Escola Sup. Tecnologa Setúbal / Inst. oltécnco Setúbal, Setúbal,

More information

Full-duplex Relaying for D2D Communication in mmwave based 5G Networks

Full-duplex Relaying for D2D Communication in mmwave based 5G Networks Full-duplex Relayng for D2D Communcaton n mmwave based 5G Networks Boang Ma Hamed Shah-Mansour Member IEEE and Vncent W.S. Wong Fellow IEEE Abstract Devce-to-devce D2D communcaton whch can offload data

More information

Review: Our Approach 2. CSC310 Information Theory

Review: Our Approach 2. CSC310 Information Theory CSC30 Informaton Theory Sam Rowes Lecture 3: Provng the Kraft-McMllan Inequaltes September 8, 6 Revew: Our Approach The study of both compresson and transmsson requres that we abstract data and messages

More information

Source Localization by TDOA with Random Sensor Position Errors - Part II: Mobile sensors

Source Localization by TDOA with Random Sensor Position Errors - Part II: Mobile sensors Source Localzaton by TDOA wth Random Sensor Poston Errors - Part II: Moble sensors Xaome Qu,, Lhua Xe EXOUISITUS, Center for E-Cty, School of Electrcal and Electronc Engneerng, Nanyang Technologcal Unversty,

More information

Tile Values of Information in Some Nonzero Sum Games

Tile Values of Information in Some Nonzero Sum Games lnt. ournal of Game Theory, Vot. 6, ssue 4, page 221-229. Physca- Verlag, Venna. Tle Values of Informaton n Some Nonzero Sum Games By P. Levne, Pars I ), and ZP, Ponssard, Pars 2 ) Abstract: The paper

More information

Opportunistic Beamforming for Finite Horizon Multicast

Opportunistic Beamforming for Finite Horizon Multicast Opportunstc Beamformng for Fnte Horzon Multcast Gek Hong Sm, Joerg Wdmer, and Balaj Rengarajan allyson.sm@mdea.org, joerg.wdmer@mdea.org, and balaj.rengarajan@gmal.com Insttute IMDEA Networks, Madrd, Span

More information

GAME THEORETIC FLOW AND ROUTING CONTROL FOR COMMUNICATION NETWORKS. Ismet Sahin. B.S., Cukurova University, M.S., University of Florida, 2001

GAME THEORETIC FLOW AND ROUTING CONTROL FOR COMMUNICATION NETWORKS. Ismet Sahin. B.S., Cukurova University, M.S., University of Florida, 2001 GAME THEORETIC FLOW AND ROUTING CONTROL FOR COMMUNICATION NETWORKS by Ismet Sahn B.S., Cukurova Unversty, 996 M.S., Unversty of Florda, 00 Submtted to the Graduate Faculty of School of Engneerng n partal

More information

Topology Control for C-RAN Architecture Based on Complex Network

Topology Control for C-RAN Architecture Based on Complex Network Topology Control for C-RAN Archtecture Based on Complex Network Zhanun Lu, Yung He, Yunpeng L, Zhaoy L, Ka Dng Chongqng key laboratory of moble communcatons technology Chongqng unversty of post and telecommuncaton

More information

Medium Term Load Forecasting for Jordan Electric Power System Using Particle Swarm Optimization Algorithm Based on Least Square Regression Methods

Medium Term Load Forecasting for Jordan Electric Power System Using Particle Swarm Optimization Algorithm Based on Least Square Regression Methods Journal of Power and Energy Engneerng, 2017, 5, 75-96 http://www.scrp.org/journal/jpee ISSN Onlne: 2327-5901 ISSN Prnt: 2327-588X Medum Term Load Forecastng for Jordan Electrc Power System Usng Partcle

More information

Cooperative Multicast Scheduling Scheme for IPTV Service over IEEE Networks

Cooperative Multicast Scheduling Scheme for IPTV Service over IEEE Networks Cooperatve Multcast Schedulng Scheme for IPTV Servce over IEEE 802.16 Networks Fen Hou 1, Ln X. Ca 1, James She 1, Pn-Han Ho 1, Xuemn (Sherman Shen 1, and Junshan Zhang 2 Unversty of Waterloo, Waterloo,

More information

Joint Rate-Routing Control for Fair and Efficient Data Gathering in Wireless sensor Networks

Joint Rate-Routing Control for Fair and Efficient Data Gathering in Wireless sensor Networks Jont Rate-Routng Control for Far and Effcent Data Gatherng n Wreless sensor Networks Yng Chen and Bhaskar Krshnamachar Mng Hseh Department of Electrcal Engneerng Unversty of Southern Calforna Los Angeles,

More information

Comparison of Two Measurement Devices I. Fundamental Ideas.

Comparison of Two Measurement Devices I. Fundamental Ideas. Comparson of Two Measurement Devces I. Fundamental Ideas. ASQ-RS Qualty Conference March 16, 005 Joseph G. Voelkel, COE, RIT Bruce Sskowsk Rechert, Inc. Topcs The Problem, Eample, Mathematcal Model One

More information

A MODIFIED DIFFERENTIAL EVOLUTION ALGORITHM IN SPARSE LINEAR ANTENNA ARRAY SYNTHESIS

A MODIFIED DIFFERENTIAL EVOLUTION ALGORITHM IN SPARSE LINEAR ANTENNA ARRAY SYNTHESIS A MODIFIED DIFFERENTIAL EVOLUTION ALORITHM IN SPARSE LINEAR ANTENNA ARRAY SYNTHESIS Kaml Dmller Department of Electrcal-Electroncs Engneerng rne Amercan Unversty North Cyprus, Mersn TURKEY kdmller@gau.edu.tr

More information

Multiband Jamming Strategies with Minimum Rate Constraints

Multiband Jamming Strategies with Minimum Rate Constraints Multband Jammng Strateges wth Mnmum Rate Constrants Karm Banawan, Sennur Ulukus, Peng Wang, and Bran Henz Department of Electrcal and Computer Engneerng, Unversty of Maryland, College Park, MD 7 US Army

More information

Ergodic Capacity of Block-Fading Gaussian Broadcast and Multi-access Channels for Single-User-Selection and Constant-Power

Ergodic Capacity of Block-Fading Gaussian Broadcast and Multi-access Channels for Single-User-Selection and Constant-Power 7th European Sgnal Processng Conference EUSIPCO 29 Glasgow, Scotland, August 24-28, 29 Ergodc Capacty of Block-Fadng Gaussan Broadcast and Mult-access Channels for Sngle-User-Selecton and Constant-Power

More information

High Speed, Low Power And Area Efficient Carry-Select Adder

High Speed, Low Power And Area Efficient Carry-Select Adder Internatonal Journal of Scence, Engneerng and Technology Research (IJSETR), Volume 5, Issue 3, March 2016 Hgh Speed, Low Power And Area Effcent Carry-Select Adder Nelant Harsh M.tech.VLSI Desgn Electroncs

More information

TECHNICAL NOTE TERMINATION FOR POINT- TO-POINT SYSTEMS TN TERMINATON FOR POINT-TO-POINT SYSTEMS. Zo = L C. ω - angular frequency = 2πf

TECHNICAL NOTE TERMINATION FOR POINT- TO-POINT SYSTEMS TN TERMINATON FOR POINT-TO-POINT SYSTEMS. Zo = L C. ω - angular frequency = 2πf TECHNICAL NOTE TERMINATION FOR POINT- TO-POINT SYSTEMS INTRODUCTION Because dgtal sgnal rates n computng systems are ncreasng at an astonshng rate, sgnal ntegrty ssues have become far more mportant to

More information

The Performance Improvement of BASK System for Giga-Bit MODEM Using the Fuzzy System

The Performance Improvement of BASK System for Giga-Bit MODEM Using the Fuzzy System Int. J. Communcatons, Network and System Scences, 10, 3, 1-5 do:10.36/jcns.10.358 Publshed Onlne May 10 (http://www.scrp.org/journal/jcns/) The Performance Improvement of BASK System for Gga-Bt MODEM Usng

More information

Power Control for Wireless Data

Power Control for Wireless Data Power Control for Wreless Data Davd Goodman Narayan Mandayam Electrcal Engneerng WINLAB Polytechnc Unversty Rutgers Unversty 6 Metrotech Center 73 Brett Road Brooklyn, NY, 11201, USA Pscataway, NJ 08854

More information

Figure 1. DC-DC Boost Converter

Figure 1. DC-DC Boost Converter EE46, Power Electroncs, DC-DC Boost Converter Verson Oct. 3, 11 Overvew Boost converters make t possble to effcently convert a DC voltage from a lower level to a hgher level. Theory of Operaton Relaton

More information

Clustering Based Fractional Frequency Reuse and Fair Resource Allocation in Multi-cell Networks

Clustering Based Fractional Frequency Reuse and Fair Resource Allocation in Multi-cell Networks Ths full text paper was peer revewed at the drecton of IEEE Communcatons Socety subject matter experts for publcaton n the IEEE ICC 21 proceedngs Clusterng Based Fractonal Frequency Reuse and Far Resource

More information

Analysis of Time Delays in Synchronous and. Asynchronous Control Loops. Bj rn Wittenmark, Ben Bastian, and Johan Nilsson

Analysis of Time Delays in Synchronous and. Asynchronous Control Loops. Bj rn Wittenmark, Ben Bastian, and Johan Nilsson 37th CDC, Tampa, December 1998 Analyss of Delays n Synchronous and Asynchronous Control Loops Bj rn Wttenmark, Ben Bastan, and Johan Nlsson emal: bjorn@control.lth.se, ben@control.lth.se, and johan@control.lth.se

More information

Optimal Placement of PMU and RTU by Hybrid Genetic Algorithm and Simulated Annealing for Multiarea Power System State Estimation

Optimal Placement of PMU and RTU by Hybrid Genetic Algorithm and Simulated Annealing for Multiarea Power System State Estimation T. Kerdchuen and W. Ongsakul / GMSARN Internatonal Journal (09) - Optmal Placement of and by Hybrd Genetc Algorthm and Smulated Annealng for Multarea Power System State Estmaton Thawatch Kerdchuen and

More information

Ad hoc Service Grid A Self-Organizing Infrastructure for Mobile Commerce

Ad hoc Service Grid A Self-Organizing Infrastructure for Mobile Commerce Ad hoc Servce Grd A Self-Organzng Infrastructure for Moble Commerce Klaus Herrmann, Kurt Gehs, Gero Mühl Berln Unversty of Technology Emal: klaus.herrmann@acm.org Web: http://www.vs.tu-berln.de/herrmann/

More information

Webinar Series TMIP VISION

Webinar Series TMIP VISION Webnar Seres TMIP VISION TMIP provdes techncal support and promotes knowledge and nformaton exchange n the transportaton plannng and modelng communty. DISCLAIMER The vews and opnons expressed durng ths

More information

International Journal of Wireless Communications and Mobile Computing

International Journal of Wireless Communications and Mobile Computing Internatonal Journal of Wreless Communcatons and Moble Computng 215; 3(6): 58-65 ublshed onlne eptember 25, 215 (http://www.scencepublshnggroup.com/j/wcmc) do: 1.11648/j.wcmc.21536.11 I: 233-17 (rnt);

More information

Beam quality measurements with Shack-Hartmann wavefront sensor and M2-sensor: comparison of two methods

Beam quality measurements with Shack-Hartmann wavefront sensor and M2-sensor: comparison of two methods Beam qualty measurements wth Shack-Hartmann wavefront sensor and M-sensor: comparson of two methods J.V.Sheldakova, A.V.Kudryashov, V.Y.Zavalova, T.Y.Cherezova* Moscow State Open Unversty, Adaptve Optcs

More information

Optimal State Prediction for Feedback-Based QoS Adaptations

Optimal State Prediction for Feedback-Based QoS Adaptations Optmal State Predcton for Feedback-Based QoS Adaptatons Baochun L, Dongyan Xu, Klara Nahrstedt Department of Computer Scence Unversty of Illnos at Urbana-Champagn b-l, d-xu, klara @cs.uuc.edu Abstract

More information

1 GSW Multipath Channel Models

1 GSW Multipath Channel Models In the general case, the moble rado channel s pretty unpleasant: there are a lot of echoes dstortng the receved sgnal, and the mpulse response keeps changng. Fortunately, there are some smplfyng assumptons

More information

Priority based Dynamic Multiple Robot Path Planning

Priority based Dynamic Multiple Robot Path Planning 2nd Internatonal Conference on Autonomous obots and Agents Prorty based Dynamc Multple obot Path Plannng Abstract Taxong Zheng Department of Automaton Chongqng Unversty of Post and Telecommuncaton, Chna

More information

arxiv: v2 [cs.gt] 19 May 2017

arxiv: v2 [cs.gt] 19 May 2017 Inter-Operator Resource Management for Mllmeter Wave, Mult-Hop Backhaul Networks Omd Semar, Wald Saad, Mehd Benns, and Zaher Dawy Wreless@VT, Bradley Department of Electrcal and Computer Engneerng, Vrgna

More information

Guidelines for CCPR and RMO Bilateral Key Comparisons CCPR Working Group on Key Comparison CCPR-G5 October 10 th, 2014

Guidelines for CCPR and RMO Bilateral Key Comparisons CCPR Working Group on Key Comparison CCPR-G5 October 10 th, 2014 Gudelnes for CCPR and RMO Blateral Key Comparsons CCPR Workng Group on Key Comparson CCPR-G5 October 10 th, 2014 These gudelnes are prepared by CCPR WG-KC and RMO P&R representatves, and approved by CCPR,

More information

Power Allocation in Wireless Relay Networks: A Geometric Programming-Based Approach

Power Allocation in Wireless Relay Networks: A Geometric Programming-Based Approach ower Allocaton n Wreless Relay Networks: A Geometrc rogrammng-based Approach Khoa T. han, Tho Le-Ngoc, Sergy A. Vorobyov, and Chntha Telambura Department of Electrcal and Computer Engneerng, Unversty of

More information

A Predictive QoS Control Strategy for Wireless Sensor Networks

A Predictive QoS Control Strategy for Wireless Sensor Networks The 1st Worshop on Resource Provsonng and Management n Sensor Networs (RPMSN '5) n conjuncton wth the 2nd IEEE MASS, Washngton, DC, Nov. 25 A Predctve QoS Control Strategy for Wreless Sensor Networs Byu

More information

4.3- Modeling the Diode Forward Characteristic

4.3- Modeling the Diode Forward Characteristic 2/8/2012 3_3 Modelng the ode Forward Characterstcs 1/3 4.3- Modelng the ode Forward Characterstc Readng Assgnment: pp. 179-188 How do we analyze crcuts wth juncton dodes? 2 ways: Exact Solutons ffcult!

More information

Optimization of Scheduling in Wireless Ad-Hoc Networks. Using Matrix Games

Optimization of Scheduling in Wireless Ad-Hoc Networks. Using Matrix Games Optmzaton of Schedulng n Wreless Ad-Hoc Networs Usng Matrx Games Ebrahm Karam and Savo Glsc, Senor Member IEEE Centre for Wreless Communcatons (CWC), Unversty of Oulu, P.O. Box 4500, FIN-90014, Oulu, Fnland

More information

The Synthesis of Dependable Communication Networks for Automotive Systems

The Synthesis of Dependable Communication Networks for Automotive Systems 06AE-258 The Synthess of Dependable Communcaton Networks for Automotve Systems Copyrght 2005 SAE Internatonal Nagarajan Kandasamy Drexel Unversty, Phladelpha, USA Fad Aloul Amercan Unversty of Sharjah,

More information

Channel Alternation and Rotation in Narrow Beam Trisector Cellular Systems

Channel Alternation and Rotation in Narrow Beam Trisector Cellular Systems Channel Alternaton and Rotaton n Narrow Beam Trsector Cellular Systems Vncent A. Nguyen, Peng-Jun Wan, Ophr Freder Illnos Insttute of Technology-Communcaton Laboratory Research Computer Scence Department-Chcago,

More information

Exploiting Dynamic Workload Variation in Low Energy Preemptive Task Scheduling

Exploiting Dynamic Workload Variation in Low Energy Preemptive Task Scheduling Explotng Dynamc Worload Varaton n Low Energy Preemptve Tas Schedulng Lap-Fa Leung, Ch-Yng Tsu Department of Electrcal and Electronc Engneerng Hong Kong Unversty of Scence and Technology Clear Water Bay,

More information

Secure Transmission of Sensitive data using multiple channels

Secure Transmission of Sensitive data using multiple channels Secure Transmsson of Senstve data usng multple channels Ahmed A. Belal, Ph.D. Department of computer scence and automatc control Faculty of Engneerng Unversty of Alexandra Alexandra, Egypt. aabelal@hotmal.com

More information

Game-Theoretic Spectrum Trading in RF Relay-Assisted Free-Space Optical Communications

Game-Theoretic Spectrum Trading in RF Relay-Assisted Free-Space Optical Communications Game-Theoretc Spectrum Tradng n RF Relay-Asssted Free-Space Optcal Communcatons 1 arxv:1806.10464v1 [cs.it] 27 Jun 2018 Shenje Huang, Student Member, IEEE, Vahd Shah-Mansour, Member, IEEE, and Majd Safar,

More information