OneShot Games for Spectrum Sharing among CoLocated Radio Access Networks


 Abigayle Golden
 3 years ago
 Views:
Transcription
1 OneShot Games for Spectrum Sharng among CoLocated Rado Access etwors Sofonas Halu, Alexs A. Dowhuszo, Olav Tronen and Lu We Department of Communcatons and etworng, Aalto Unversty, P.O. Box 3000, FI Aalto, Fnland Department of Mathematcs and Statstcs, Unversty of Helsn, P.O. Box 68, FI0004, Fnland Emal: {sofonas.halu, alexs.dowhuszo, Abstract We consder an adaptve coprmary spectrum sharng scheme based on playng oneshot games between colocated dstrbuted Rado Access etwors (RAs). Spectrum s dvded nto prvate and shared parts, and each RA nternally apples coordnated multpont transmssons. Zeroforcng precodng s used n the prvate part, whle untary precodng s appled n the nonorthogonally shared part. A oneshot game s played such that each operator proposes a spectrum partton whch maxmzes ts own sum utlty, and the actual spectrum partton s resolved based on a pror decson rules that reflect the regulatory framewor. Thus, adaptve spectrum sharng can be mplemented wth a mnmal exchange of sgnalng nformaton among operators. The exstence of a unque ashequlbrum s shown for the game. Smulaton results show that adaptve spectrum sharng s able to brdge between the baselne performance of orthogonal and full (nonorthogonal) spectrum n dfferent sgnaltonose power rato regons. I. ITRODUCTIO In order to cope wth the forecast demand of moble data traffc n future wreless networs, operators need to sgnfcantly ncrease ther operatonal bandwdth []. Interoperator spectrum sharng s one of the approaches that has been envsoned to ncrease the operatonal bandwdth of an operator. The conventonal cogntve rado networ approach that s used to share spectrum between operators assumes a predefned prmary secondary herarchy. In an alternatve coprmary spectrum sharng model, multple operators are wllng to jontly use a part (or the whole) of ther lcensed spectrum [], [3]. Operators may have ndvdual lcenses to access exclusve frequency bands, or a group authorzaton to use a common pool of spectral resources. Jont use of the lcensed spectrum of operators can be realzed by sharng the frequency resources ether orthogonally or nonorthogonally. Orthogonal sharng of common spectral resources could be acheved n tme doman [4], frequency & power doman [5], [6], and/or space doman [7]. In the case of nonorthogonal spectrum sharng, operators smultaneously use common bloc of spectral resources, creatng nteroperator nterference. The operators mght mplement nteroperator nterference mtgaton schemes, see e.g. [8], [9]. Most of the wors on coprmary spectrum sharng rely on operator specfc nformaton whch n some cases needs to be exchanged. In [8], [9], operator specfc nformaton such as full nteroperator Channel State Informaton (CSI) s assumed to be avalable for all operators, n order to apply nteroperator nterference mtgaton schemes. However, the exchange of nteroperator CSI generally requres a dedcated ln between the operators or to a central entty. In [5], [6], game theoretc approaches ncludng oneshot games are dscussed for unlcensed spectrum sharng, where the games depend on the power appled on all carrers by the operators. Wth these approaches, the rate that an operator could acheve on a gven carrer or porton of the spectrum pool s unpredctable, as the nteroperator nterference depends on the power appled on the carrer by other operators. In addton, both [5] and [6] consdered systems comprsed of sngle transmtterrecever pars leavng no room for multuser dversty gan. On the other hand, n [0], a statc coprmary spectrum sharng scheme s proposed, whch restrcts the gan from flexbly sharng the spectrum though t mght be easer to mplement. In ths paper, a oneshot game approach s consdered for coprmary spectrum sharng among colocated dstrbuted Rado Access etwors (RAs) of dfferent operators. The operators do not exchange CSI, only preferences of parttonng the spectrum nto prvate and nonorthogonally shared portons are exchanges. The decson to determne the actual spectrum partton s made based on a pror decson rule, tang nto account the regulatory framewor. The proposed oneshot game s shown to have a unque ash equlbrum. Thus, the game could be played once per nterval of tme n whch the channel realzaton of all the users reman constant. Smulaton results ndcate that the proposed oneshot game leads to better and more far data rate allocatons to the users, when compared to conventonal schemes that share the whole communcaton bandwdth nonorthogonally among operators, or allocate an exclusve frequency band to each of the operator. The rest of the paper s organzed as follows: Secton II explans the system model and presents the spectrum access schemes. Secton III dscusses the Coordnated MultPont Transmsson (CoMP) technques appled n the prvate and nonorthogonally shared portons of the spectrum, and descrbes the computaton of the sum utlty of the operators. Secton IV presents the proposed oneshot game and proves the exstence of a unque ashequlbrum soluton. Secton V dscusses the characterstcs of the smulaton scenaro and carres out performance analyss. Fnally, conclusons are drawn n Secton VI.
2 Operator RAU MS BBU Prvate Band for operator Shared Band Prvate Band for operator Operator RAU MS BBU Fg.. Multoperator downln communcaton scenaro wth I = dstrbuted RAs, coverng an overlappng hotspot area. Total communcaton spectrum s dvded nto three parts: a prvate band for each operator and a nonorthogonally shared band. The spectrum parttonng between operators s coordnated usng control sgnalng between both BBUs of the operators. II. SYSTEM MODEL A. Multoperator downln scenaro A multoperator downln communcaton scenaro s consdered whch conssts of colocated multple operators belongng to the set I, see llustraton for I = n Fg.. The operators own ndependent dstrbuted Rado Access etwors (RAs), ther coverage area are overlappng, and they are wllng to share ther lcensed spectrum to mprove the performance of ther Moble Statons (MSs). The dstrbuted RA of operator I conssts of M Remote Antenna Unts (RAUs) wth wred connectons to a centralzed Baseband Unt (BBU). The centralzed BBU of operator performs schedulng decsons and carres out the multantenna sgnal processng operatons that are requred to serve K randomly deployed sngleantenna MSs n the coverage area. For sae of smplcty, we assume that the number of RAUs and MSs per operator are equal,.e., M = K I. It s assume that the users are relatvely statc. Accordng to spectrum access model used, operator may propose to share nonorthogonally part of ts dedcated ndvdual spectrum B nd, or may request to have exclusve access to a porton of the common group spectrum B grp. egotatons dealng wth the most convenent spectrum partton are carred out among operators n a tme scale longer than schedulng nterval, but shorter than the coherence tme of channels and the traffc needs of the users. The results of a negotaton holds for one sharng perod. The negotaton are based on a mnmal exchange of control nformaton. Operators do not share local nformaton le schedulng decsons and transmt beamformng vectors, the only control nformaton that s shared s the most convenent spectrum partton from the perspectve of each ndvdual operator. The decson on the spectrum partton used for the next sharng perod s carred out by each operator n a decentralzed way, followng an a pror decson rule that all operators are forced to follow. Accordng to the reached decson, for the duraton of the next sharng perod, shared subband B (s) s used for nonorthogonal spectrum access among all operators, whle prvate subband B (p) s used for orthogonal spectrum access of operator. Then, the total communcaton bandwdth for the multoperator scenaro s B = B (s) + I B(p), and the aggregate communcaton bandwdth that operator uses to serve ts K MSs s B = B (p) + B (s). The transmt power spectral densty of each operator s assumed to be constant across ts aggregate bandwdth B. Thus, P tx, /B = tx, /B(s) = P (p) tx, /B(p), where P tx, = P (p) tx, + tx, s the total transmt power that operator uses for communcaton, whle P (p) (s) tx, and P tx, are the correspondng transmt power portons n the prvate and shared subbands, respectvely. ote that based on ths assumpton, transmt power P tx, s a lnear functon of bandwdth B. The wreless channel gan between RAU m of operator and MS s gven by h (m,), = h (m,), / L (m,), I, K, () where L (m,), s the dstance dependent pathloss attenuaton and h (m,), are the complex fast fadng components of the wreless channel model. In case of rch scatterng and flat fadng, h (m,), s descrbed by a zeromean crcularly symmetrc complex Gaussan Random Varable (RV) wth unt varance. All fast fadng components of the wreless channel are assumed to be uncorrelated. Fnally, the nose powers that MS experences n prvate and shared subbands are modeled as a zeromean Gaussan complex RVs wth power = 0 B (s) and P (p), = 0 B (p), wth 0 the thermal spectral densty. B. Spectrum sharng models The negotatons to determne the spectrum partton for the whole multoperator scenaro are performed n a decentralzed manner between peers. In ths process, each operator frst nforms to the other operators ts preferred spectrum partton. ext, the actual spectrum partton s resolved locally by each operator, based on predefned rules that tae nto account the type of lcense that operators have to access spectrum. Based on the spectrum lcense of the operators, two coprmary sharng models are consdered []. ) Mutual rentng: Each operator owns a lcense for exclusve access to a frequency band of bandwdth B nd. For smplcty, we assume equal amounts of lcensed spectrum,.e, B nd = B nd I. Operator determnes ts preferred fracton 0 α nd that t s wllng to share and nforms ths to the other operators. If proposal α nd s accepted by all operators, the total bandwdth of the shared subband becomes B (s) = I α nd B nd, whle the bandwdth of the prvate subband s reduced to B (p) = B nd B (s) / I I.
3 ) Lmted spectrum pool: In ths case, the I operators have a lcense to access a pool of common frequency resources wth total bandwdth B grp, whch s assumed to be nonorthogonally shared among all operators. Then, operator determnes ts preferred fracton 0 α grp / I that t prefers to use prvately. If proposal α grp s accepted by all operators, the bandwdth of the prvate subband becomes B (p) = α grp B grp I, whle the total bandwdth of the shared subband s reduced to B (s) = B grp I B (p). III. UTILITY FUCTIO AD MULTIATEA TRASMISSIO SCHEMES For a gven spectrum partton {B (p), B (s) }, operator has the opportunty to schedule ts assocated MSs ether n the prvate, shared, or both prvate and shared frequency subbands. In the shared frequency subband B (s), fullran Untary Precodng (UP) s used to mae the nstantaneous nteroperator nterference power reman constant, ndependently of the local schedulng decsons that operators mae. In the prvate frequency subband B (p), on the other hand, ZeroForcng Precodng (ZF) s employed to cancel completely the ntraoperator nterference that s created among the data streams ntended to the dfferent scheduled users. Let K be the set of MSs assocated to operator. Then, the ndexes of those MSs that are scheduled n the prvate and shared frequency subbands are contaned n sets S (p) K and S (s) K, respectvely. In ths paper, S (p) S (s) = K s always verfed. A. Receved SIR n prvate and shared frequency subbands The data rate that a MS K s able to acheve depends on both the spectrum partton {B (p), B (s) } and the schedulng decsons {S (p), S (s) }, where the latter affects the SgnaltoInterference plus ose power Rato (SIR) that the MS observes n recepton. Then, the SIR that MS K experences n the shared frequency subband s γ (s) = P l S (s),l (s) tx, ht,w (s) tx, ht, w(s), +,l } {{ } Intraoperator nterference l S (s) j,j tx,j ht j,w (s) j,l } {{ } Interoperator nterference, + }{{} ose () where h T, s a row vector that contans all channel gans from RAUs of operator to MS, w (s), s the transmt beamformng vector that operator uses to serve MS n the shared frequency subband, and s the nose power n the shared frequency subband. ote that when MS / S (s), beamformng vector w (s), s a null vector of the proper dmenson. Smlarly, the SIR that MS K experences n recepton n the prvate frequency subband s obtaned from () when the superscrpts (s) are replaced wth (p), and when the nteroperator nterference term of the denomnator s removed. ote that f ZF s used to serve MSs n the prvate frequency subband, the ntraoperator nterference term that appears n the denomnator of () vanshes as well. Algorthm Untary precoder for shared frequency subband : Intalzaton: Set U = S (s) and D 0 = : for m = to S (s) do 3: for n = to U m do 4: v n (m) h H,n / h,n d D u T d (hh,n / h,n )u d 5: v n (m) v n (m) /( v n (m) ) 6: I (m) n 7: γ (m) n = S (s) = d D tx, ht,n u d I (m) n 8: end for 9: π m = arg mn n Um γ n (m) 0: D m = D m {π m } : U m+ = U m {π m } : u m = v π (m) m tx, ht,n v(m) n + l S (s) (s) P,j j tx,j ht j,nw(s) j,l + 3: end for 4: Output: W (s) = [ ] (s) u u (s) S and D = D (s) S B. Sum utlty functon The operator sum utlty s defned as U = K u (r ) I, (3) where u (x) = log e (x) n case of a proportonal far lograte utlty, and r = B (p) log ( + γ (p) )+B(s) log ( + γ (s) ) K (4) s the aggregate rate that MS s able to acheve. ote that Aggregate rate (4) depends on the bandwdth of spectral portons B (p) and B (s), as well as the receved SIRs γ (p) and γ (s) that MS experences n both prvate and shared frequency subbands, respectvely. C. Untary precoder n shared frequency subband The columns of the untary precoder matrx W (s) that s used to serve MSs S (s) are determned by an orthogonalzaton process. The order of orthogonalzaton depends on the receved SIR γ (m) that each MS experences n recepton at each teraton m of the process, and taes nto account both ntraoperator and nteroperator nterference powers. The ntraoperator nterference power comes from the MSs that were orthogonalzed n a prevous teraton of the process, whle the nteroperator nterference power remans constant durng the whole process because t s assumed that the other operators also use UP n the shared frequency subband. To ncrease the level of farness among users, the MS wth lowest SIR s selected for orthogonalzaton at each teraton. A summary of the procedure that s used to determne the untary precoder for the shared frequency subband of operator s presented as Algorthm.
4 D. Zeroforcng precoder n prvate frequency subband The MSs scheduled n the prvate frequency subband are served usng ZF wth sum power constrant. The precoder matrx that operator uses n the prvate frequency subband becomes W (p) where H +,S (p) H (p),s h T, = [ w (p), w(p), S (p) ] = H +,S (p) H +,S (p) F I, (5) s the pseudonverse of the channel matrx, whch s formed by the concatenaton of row vectors S(p), and F s the Frobenus norm of a matrx. ote that the pseudonverse of matrx H s defned as H + = (H H H) H H where ( ) and ( ) H are the nverse and Hermtan transpose of a matrx, respectvely. IV. PROPOSED OESHOT GAME In ths paper, we model the coprmary spectrum sharng problem as a oneshot game { } I, {a } I, {U } I. In ths defnton, I denotes the set of players the operators wth servng the same hotspot area. The set {a } I denotes the nstantaneous strateges of the players, and the set {U } I dentfes ther correspondng payoffs. The allowed strategy of a player s restrcted to an nterval a [0, α max ] I, and have dfferent meanng dependng on the coprmary spectrum sharng model. In the case of mutual rentng, the strategy of a player represents the fracton of ts lcensed spectrum that the operator s wllng to share wth the other operators, and α max = f B Ind = Bj Ind, j I. In the case of lmted spectrum pool, the strategy of a player denotes the fracton of common spectrum resource that the operator s requestng for prvate (exclusve) use, and α max = / I. The payoff U (a, a ) of player s defned as the sum of the utltes of ts assocated MSs after the proposals that dfferent players proposed for parttonng the spectrum are resolved. Accordng to ths defnton, the payoff of a player depends not only on ts own strategy a, but also on the strategy of the other players a and the a pror rule that all players agree to follow n order to resolve ther spectrum partton proposals. Tang nto account the spectrum regulatory framewor, we propose an a pror rule to resolve the outcomes of the spectrum parttonng proposals by and thus U (a, a ) = U (a mn ), a mn = mn I a, (6) a mn = mn I a. (7) Therefore, n the case of mutual rentng, an operator s guaranteed that t s not gong to share more than the fracton of ts lcensed spectrum that t s wllng to share. Smlarly, n the case of lmted spectrum pool, an operator s guaranteed that t wll not be forced to nonorthogonally share less than the fracton of the common resource that t s wllng to share. A. Selectng the strategy of a player For smplcty, we requre that each user s always scheduled n both prvate and shared frequency subbands. Then, t s possble to show that the utlty functon of an operator s strct concave functon of a f the lograte utlty functon s used. Ths follows from the observaton that, when schedulng decsons are fxed, the data rate of an MS s a lnear functon of a, and t s wellnown that the sum of logarthms of lnear functons s a strctly concave functon []. A player chooses a strategy that maxmzes ts payoff functon. However, the payoff functon of a player depends on the nstantaneous strateges of all the players, and a player cannot now n advance the strateges of other players. As the CSIs of the other players are not nown, n a generc game, a player would have to apply a probablty dstrbuton of all the strateges of the other players to deduce ts chosen strategy, so that the outcome of the game would be closest to the preferred one. The outcome decson rule consdered here, however, together wth concavty, smplfes the strategy selecton process. We assume that player selects ts strategy wthout consderng probablty dstrbutons of other player s strateges, a = arg max a U (a ) subject to 0 a α max S (p) = S (s) = K, (8) ote that n (8), the sum utlty for a partcular a [0, α max ] s obtaned computng the correspondng B (p) and B (s) frst, and then pluggng the obtaned results n equaton (4) and (3). Due to the concavty of U (a ), and the outcome decson rule (6), ths s the optmal strategy choce for, rrespectvely of the other players actons. Ths wll be seen below, and s the reason for the exstence of a ash equlbrum. The soluton to (8) can be readly obtaned usng effcent convex optmzaton algorthms, le the ones presented n []. B. Exstence and unqueness of ashequlbrum A unque ashequlbrum exsts for the proposed oneshot game, when players are ratonal and try to selfshly maxmze ther own sum utlty. Proposton. The proposed oneshot game has a unque ashequlbrum pont a = {a,..., a,..., a I } where a, I s chosen accordng to (8), the payoff U (a, a ), I s gven by (7), and the sum utlty U (a ) n (8) s a strct concave functon of a. Proof. Consder a player unlaterally changng ts strategy from a to a, and let a,mn = mn{a j } j,j I. We now analyze two complementary cases: Case. Assume that a >= a,mn If a a,mn, U(a, a ) = U(a, a ). If a < a,mn, U(a, a ) < U(a, a ) snce U(a, a ) s a strct concave functon n a [0, a,mn ).
5 Case. Assume that a < a,mn For a a, U(a, a ) < U(a, a ). Thus a ash equlbrum exsts. The unqueness of the ashequlbrum follows from the strct concavty of U (a ) n (8), snce t s a sum of log functons. Thus, the acton of a player whch s selected by maxmzng (8) s unque. It s worth to notce, that the game settng dscussed here allows for a ash equlbrum where each operators do not always use the full spectrum. Ths s n contrast to the spectrum sharng games n frequency/power doman [5], where the ash equlbrum s to use the full frequency. The dfference n outcomes s due to Rule (6) of the game consdered here. In the game model here, (6) s outsde the doman of the decson of the players, and enables nontrval outcomes of the game. V. PERFORMACE RESULTS To understand characterstcs of the consdered spectrum sharng game, we smulate t n a multoperator downln scenaro. A. Smulaton Scenaro We consder I = colocated dstrbuted RAs belongng to dfferent operators. We use an evaluaton scenaro smulaton smlar to the small cell networ deployments model of []. The networ elements of both RAs are ndependently deployed to serve the same hotspot area. Each operator unformly deploys a total of M = 4 RAUs n an nner crcle of radus R, and a total of K = 4 sngleantenna MSs n an outer concentrc crcle of radus R. Mnmum dstances d mn,raurau = 0 m and d mn,raums = 3 m are respected when the networ elements are owned by the same operator. There s no mnmum RAUtoRAU or RAUtoMS dstance restrcton when the networ elements belong to dfferent operators. The dstance dependent path loss attenuaton s calculated usng the Urban Mcro (UM) wreless channel model wth a carrer frequency of 3.4 GHz [3]. For sae of smplcty, we assume that there s always a on LneofSght (LOS) condton between each RAU and MS par; therefore, the path loss attenuaton s L (m,), = 36.7 log 0 (d (m,), ) log 0 (f c ), (9) where d (m,), s the dstance n meters between RAU m of operator and MS, and f c s the carrer frequency n GHz. The antenna gans are G rau = 5 db and G ms = 0 db for the RAUs and MSs, respectvely. The nose fgure of the MSs s set to F ms = 9 db. For the mutual rentng regulatory model, both operators are assumed to have exclusve access to a frequency band of bandwdth B nd = 0 MHz I. Smlarly, n the lmted spectrum pool regulatory model, both operators are assumed to have authorzaton to access a common pool of frequency resources of bandwdth B grp = 0 MHz. The transmt power spectral densty s 0 dbm/mhz, and s ept constant ndependently on the aggregate communcaton bandwdth B. Average Data Rate per User (Mbps) Adaptve Spectrum Sharng (LSP) Adaptve Spectrum Sharng (MR) Orthogonal Spectrum Sharng on orthogonal Spectrum Sharng Radus of nner crcle (m) Fg.. Mean data rate per user for dfferent spectrum sharng schemes as a functon of nner crcle radus R (outer crcle radus R =.4 R ). Dashed lnes: Fxed spectrum sharng schemes. Sold lnes: Adaptve spectrum sharng schemes. MR: Mutual rentng. LSP: Lmted spectrum pool. 0 th Percentle of User Data Rates (Mbps) Adaptve Spectrum Sharng (LSP) Adaptve Spectrum Sharng (MR) Orthogonal Spectrum Sharng on orthogonal Spectrum Sharng Radus of nner crcle (m) Fg th percentle of user data rates for dfferent spectrum sharng schemes as a functon of nner crcle radus R (outer crcle: R =.4 R ). Dashed lnes: Fxed spectrum sharng schemes. Sold lnes: Adaptve spectrum sharng schemes. MR: Mutual rentng. LSP: Lmted spectrum pool. B. Analyss of numercal results In order to study the effect that the Sgnaltoose power Rato (SR) has on the performance of the proposed spectrum sharng schemes, the radus of nner crcle R (.e., the deployment area for RAUs) and the radus of the outer crcle R (.e., the deployment area for MSs) are vared eepng the rato R /R =.4. Ths s n lne wth the baselne recommendaton presented n [], whch defnes R = 50 m and R = 70 m. For each value that R taes, numercal smulatons are run for 0 ndependent RAU deployments, each of them havng 0 ndependent deployments of MSs. For each separate RAU and MS snapshot, 0 ndependent fast fadng states are used when modelng the gans of the wreless channel. Orthogonal spectrum sharng s used as baselne scheme for performance evaluaton for mutual rentng scenaro. When operators have a group lcense to access a spectrum pool, full nonorthogonal spectrum sharng s the baselne. Fgure shows the mean data rate per user (.e., from an average rate performance perspectve), and Fgure 3 presents the 0th percentle of user data rate, whch reflects outage rate performance. Accordng to smulaton results presented n Fgure and
6 Fgure 3, orthogonal spectrum sharng wors well n the hgh SR regon, whle full spectrum sharng wors better n the low SR regon,.e., when R grows and the multoperator scenaro becomes noselmted. Adaptve spectrum sharng wth one shot game protocols provdes a performance that s at least as good as the one that s acheved wth the fxed spectrum allocaton schemes prevously descrbed. Ths observaton s vald for both mean and 0th percentle data rate curves. For mdrange SR values,.e. for R n the range of m, the gan of adaptve spectrum sharng s notable when compared to both baselne spectrum sharng schemes, partcularly when the 0th percentle data rate fgure s analyzed n detal. Fnally, for mdrange SR values, adaptve spectrum sharng wth group lcense and lmted spectrum pool wors slghtly better n terms of mean user data rate, whle adaptve spectrum sharng wth ndvdual lcense and mutual rentng has a better performance n terms of the 0th percentle of the user data rate. VI. COCLUSIO In ths paper, a oneshot game was proposed to mplement adaptve coprmary spectrum sharng among colocated dstrbuted RAs of dfferent operators. The game was consdered n dfferent forms for an ndvdual lcensng wth mutual rentng and group lcense model wth lmted spectrum pool, and can be mplemented wth a mnmal exchange of control sgnalng. The game was shown to have a unque ash equlbrum n all networ states. The performance of the proposed adaptve spectrum sharng scheme was analyzed n terms of both mean user rate and 0th percentle of user rate, assumng a dense small cell networ scenaro wth multple operators servng the same hotspot area. For low and hgh SR regons, adaptve spectrum sharng scheme s able to choose the better of full spectrum sharng and orthogonal spectrum sharng. For mdrange SR values, adaptve spectrum sharng scheme showed a notable gan wth respect to both fxed spectrum sharng schemes. It can be concluded that adaptve spectrum sharng based on mnmal nformaton exchange between operators holds promse for guaranteeng more spectrum and correspondng better servce for users served by future communcaton systems. ACKOWLEDGMET Ths wor was supported n part by the Academy of Fnland (grant 5499), and the European Commsson n the framewor of the FP7 project ITC METIS. REFERECES [] oa Semens etwors, Waeup call: Industry collaboraton needed to mae beyond 4G networs carry 000 tmes more traffc by 00, Whte Paper, Aug. 0. [] T. Irnch, J. Kronander, Y. Selén, and G. L, Spectrum sharng scenaros and resultng techncal requrements for 5G systems, n Proc. IEEE Int. Symp. Personal, Indoor and Moble Rado Commun., Sept. 03, pp [3] METIS 00 Project, Intermedate descrpton of the spectrum needs and usage prncples, Delverable D5., Aug. 03. [4] G. Mddleton, K. Hool, A. Töll, and J. Llleberg, Interoperator spectrum sharng n a broadband cellular networ, n Proc. IEEE Int. Symp. Spread Spectrum Technques and Applcatons, Aug. 006, pp [5] R. Etn, A. Pareh, and D. Tse, Spectrum sharng for unlcensed bands, IEEE J. Sel. Areas Commun., vol. 5, no. 3, pp , Apr [6] M. Benns, S. Lasaulce, and M. Debbah, Interoperator spectrum sharng from a game theoretcal perspectve, EURASIP J. Adv. Sgnal Process., vol. 009, pp., Sept [7] E. A. Jorswec, L. Bada, T. Fahldec, E. Karpds, and J. Luo, Spectrum sharng mproves the networ effcency for cellular operators, IEEE Commun. Mag., vol. 5, no. 3, pp. 9 36, Mar. 04. [8] R. Gangula, D. Gesbert, J. Lndblom, and E. G. Larsson, On the value of spectrum sharng among operators n multcell networs, n Proc. IEEE Veh. Tech. Conf., Jun. 03, pp. 5. [9] S. Halu, A. A. Dowhuszo, and O. Tronen, Adaptve coprmary shared access between colocated rado access networs, n Proc. Int. Conf. Cogntve Rado Orented Wreless etw., Jun. 04, pp [0] Y. Teng, Y. Wang, and K. Horneman, CoPrmary spectrum sharng for denser networs n local area, n Proc. Int. Conf. Cogntve Rado Orented Wreless etw., Jun. 04, pp [] S. Boyd and L. Vandenberghe, Convex optmzaton. Cambrdge unversty press, 009. [] 3GPP TSG RA WG, Evaluaton assumptons for small cell enhancements  physcal layer, Tech. Doc. R30856, Jan. 03. [3] 3GPP, Further advancements for EUTRA physcal layer aspects (Release 9), Tech. Rep. TR V9.0.0, March 00.
INVESTIGATION OF VEHICULAR USERS FAIRNESS IN CDMAHDR NETWORKS
21 22 September 2007, BULGARIA 119 Proceedngs of the Internatonal Conference on Informaton Technologes (InfoTech2007) 21 st 22 nd September 2007, Bulgara vol. 2 INVESTIGATION OF VEHICULAR USERS FAIRNESS
More informationCommunication Networks II Contents
8 / 1  Communcaton Networs II (Görg)  www.comnets.unbremen.de Communcaton Networs II Contents 1 Fundamentals of probablty theory 2 Traffc n communcaton networs 3 Stochastc & Marovan Processes (SP
More informationJoint Resource Allocation and BaseStation. Assignment for the Downlink in CDMA Networks
Jont Resource Allocaton and BaseStaton 1 Assgnment for the Downlnk n CDMA Networks Jang Won Lee, Rav R. Mazumdar, and Ness B. Shroff School of Electrcal and Computer Engneerng Purdue Unversty West Lafayette,
More informationbenefit is 2, paid if the policyholder dies within the year, and probability of death within the year is ).
REVIEW OF RISK MANAGEMENT CONCEPTS LOSS DISTRIBUTIONS AND INSURANCE Loss and nsurance: When someone s subject to the rsk of ncurrng a fnancal loss, the loss s generally modeled usng a random varable or
More informationThe Development of Web Log Mining Based on ImproveKMeans Clustering Analysis
The Development of Web Log Mnng Based on ImproveKMeans Clusterng Analyss TngZhong Wang * College of Informaton Technology, Luoyang Normal Unversty, Luoyang, 471022, Chna wangtngzhong2@sna.cn Abstract.
More informationCalculating the high frequency transmission line parameters of power cables
< ' Calculatng the hgh frequency transmsson lne parameters of power cables Authors: Dr. John Dcknson, Laboratory Servces Manager, N 0 RW E B Communcatons Mr. Peter J. Ncholson, Project Assgnment Manager,
More informationPSYCHOLOGICAL RESEARCH (PYC 304C) Lecture 12
14 The Chsquared dstrbuton PSYCHOLOGICAL RESEARCH (PYC 304C) Lecture 1 If a normal varable X, havng mean µ and varance σ, s standardsed, the new varable Z has a mean 0 and varance 1. When ths standardsed
More informationAn Alternative Way to Measure Private Equity Performance
An Alternatve Way to Measure Prvate Equty Performance Peter Todd Parlux Investment Technology LLC Summary Internal Rate of Return (IRR) s probably the most common way to measure the performance of prvate
More informationPerformance Analysis of Energy Consumption of Smartphone Running Mobile Hotspot Application
Internatonal Journal of mart Grd and lean Energy Performance Analyss of Energy onsumpton of martphone Runnng Moble Hotspot Applcaton Yun on hung a chool of Electronc Engneerng, oongsl Unversty, 511 angdodong,
More informationCoordinated DenialofService Attacks in IEEE 802.22 Networks
Coordnated DenalofServce Attacks n IEEE 82.22 Networks Y Tan Department of ECE Stevens Insttute of Technology Hoboken, NJ Emal: ytan@stevens.edu Shamk Sengupta Department of Math. & Comp. Sc. John Jay
More informationJoint Dynamic Radio Resource Allocation and Mobility Load Balancing in 3GPP LTE MultiCell Network
288 FENG LI, LINA GENG, SHIHUA ZHU, JOINT DYNAMIC RADIO RESOURCE ALLOCATION AND MOBILITY LOAD BALANCING Jont Dynamc Rado Resource Allocaton and Moblty Load Balancng n 3GPP LTE MultCell Networ Feng LI,
More informationRapid Estimation Method for Data Capacity and Spectrum Efficiency in Cellular Networks
Rapd Estmaton ethod for Data Capacty and Spectrum Effcency n Cellular Networs C.F. Ball, E. Humburg, K. Ivanov, R. üllner Semens AG, Communcatons oble Networs unch, Germany carsten.ball@semens.com Abstract
More informationDEFINING %COMPLETE IN MICROSOFT PROJECT
CelersSystems DEFINING %COMPLETE IN MICROSOFT PROJECT PREPARED BY James E Aksel, PMP, PMISP, MVP For Addtonal Informaton about Earned Value Management Systems and reportng, please contact: CelersSystems,
More informationWhat is Candidate Sampling
What s Canddate Samplng Say we have a multclass or mult label problem where each tranng example ( x, T ) conssts of a context x a small (mult)set of target classes T out of a large unverse L of possble
More informationFrequency Selective IQ Phase and IQ Amplitude Imbalance Adjustments for OFDM Direct Conversion Transmitters
Frequency Selectve IQ Phase and IQ Ampltude Imbalance Adjustments for OFDM Drect Converson ransmtters Edmund Coersmeer, Ernst Zelnsk Noka, Meesmannstrasse 103, 44807 Bochum, Germany edmund.coersmeer@noka.com,
More informationAnalysis of EnergyConserving Access Protocols for Wireless Identification Networks
From the Proceedngs of Internatonal Conference on Telecommuncaton Systems (ITC97), March 223, 1997. 1 Analyss of EnergyConservng Access Protocols for Wreless Identfcaton etworks Imrch Chlamtac a, Chara
More informationStochastic Games on a Multiple Access Channel
Stochastc Games on a Multple Access Channel Prashant N and Vnod Sharma Department of Electrcal Communcaton Engneerng Indan Insttute of Scence, Bangalore 560012, Inda Emal: prashant2406@gmal.com, vnod@ece.sc.ernet.n
More informationWhen Network Effect Meets Congestion Effect: Leveraging Social Services for Wireless Services
When Network Effect Meets Congeston Effect: Leveragng Socal Servces for Wreless Servces aowen Gong School of Electrcal, Computer and Energy Engeerng Arzona State Unversty Tempe, AZ 8587, USA xgong9@asuedu
More information8.5 UNITARY AND HERMITIAN MATRICES. The conjugate transpose of a complex matrix A, denoted by A*, is given by
6 CHAPTER 8 COMPLEX VECTOR SPACES 5. Fnd the kernel of the lnear transformaton gven n Exercse 5. In Exercses 55 and 56, fnd the mage of v, for the ndcated composton, where and are gven by the followng
More informationdenote the location of a node, and suppose node X . This transmission causes a successful reception by node X for any other node
Fnal Report of EE359 Class Proect Throughput and Delay n Wreless Ad Hoc Networs Changhua He changhua@stanford.edu Abstract: Networ throughput and pacet delay are the two most mportant parameters to evaluate
More informationEfficient Bandwidth Management in Broadband Wireless Access Systems Using CACbased Dynamic Pricing
Effcent Bandwdth Management n Broadband Wreless Access Systems Usng CACbased Dynamc Prcng Bader AlManthar, Ndal Nasser 2, Najah Abu Al 3, Hossam Hassanen Telecommuncatons Research Laboratory School of
More informationv a 1 b 1 i, a 2 b 2 i,..., a n b n i.
SECTION 8.4 COMPLEX VECTOR SPACES AND INNER PRODUCTS 455 8.4 COMPLEX VECTOR SPACES AND INNER PRODUCTS All the vector spaces we have studed thus far n the text are real vector spaces snce the scalars are
More informationDownlink Power Allocation for Multiclass. Wireless Systems
Downlnk Power Allocaton for Multclass 1 Wreless Systems JangWon Lee, Rav R. Mazumdar, and Ness B. Shroff School of Electrcal and Computer Engneerng Purdue Unversty West Lafayette, IN 47907, USA {lee46,
More information1. Fundamentals of probability theory 2. Emergence of communication traffic 3. Stochastic & Markovian Processes (SP & MP)
6.3 /  Communcaton Networks II (Görg) SS20  www.comnets.unbremen.de Communcaton Networks II Contents. Fundamentals of probablty theory 2. Emergence of communcaton traffc 3. Stochastc & Markovan Processes
More informationTraffic State Estimation in the Traffic Management Center of Berlin
Traffc State Estmaton n the Traffc Management Center of Berln Authors: Peter Vortsch, PTV AG, Stumpfstrasse, D763 Karlsruhe, Germany phone ++49/72/965/35, emal peter.vortsch@ptv.de Peter Möhl, PTV AG,
More informationHow Sets of Coherent Probabilities May Serve as Models for Degrees of Incoherence
1 st Internatonal Symposum on Imprecse Probabltes and Ther Applcatons, Ghent, Belgum, 29 June 2 July 1999 How Sets of Coherent Probabltes May Serve as Models for Degrees of Incoherence Mar J. Schervsh
More informationM3S MULTIMEDIA MOBILITY MANAGEMENT AND LOAD BALANCING IN WIRELESS BROADCAST NETWORKS
M3S MULTIMEDIA MOBILITY MANAGEMENT AND LOAD BALANCING IN WIRELESS BROADCAST NETWORKS Bogdan Cubotaru, GabrelMro Muntean Performance Engneerng Laboratory, RINCE School of Electronc Engneerng Dubln Cty
More informationEfficient Project Portfolio as a tool for Enterprise Risk Management
Effcent Proect Portfolo as a tool for Enterprse Rsk Management Valentn O. Nkonov Ural State Techncal Unversty Growth Traectory Consultng Company January 5, 27 Effcent Proect Portfolo as a tool for Enterprse
More informationForecasting the Direction and Strength of Stock Market Movement
Forecastng the Drecton and Strength of Stock Market Movement Jngwe Chen Mng Chen Nan Ye cjngwe@stanford.edu mchen5@stanford.edu nanye@stanford.edu Abstract  Stock market s one of the most complcated systems
More informationOptimization of Resource Allocation in Wireless Systems Based on Game Theory
Internatonal Journal of Computer Scences and Engneerng Open Access Research Paper Volume4, Issue1 EISSN: 347693 Optmzaton of Resource Allocaton n Wreless Systems Based on Game Theory Sara Rah 1*, Al
More informationEnabling P2P Oneview Multiparty Video Conferencing
Enablng P2P Onevew Multparty Vdeo Conferencng Yongxang Zhao, Yong Lu, Changja Chen, and JanYn Zhang Abstract MultParty Vdeo Conferencng (MPVC) facltates realtme group nteracton between users. Whle P2P
More informationCooperative Load Balancing in IEEE 802.11 Networks with Cell Breathing
Cooperatve Load Balancng n IEEE 82.11 Networks wth Cell Breathng Eduard Garca Rafael Vdal Josep Paradells Wreless Networks Group  Techncal Unversty of Catalona (UPC) {eduardg, rvdal, teljpa}@entel.upc.edu;
More informationA Dynamic Load Balancing Algorithm in Heterogeneous Network
06 7th Internatonal Conference on Intellgent Systems Modellng and Smulaton A Dynamc Load Balancng Algorthm n Heterogeneous etwork Zhxong Dng Xngjun Wang and Wenmng Yang Shenzhen Key Lab of Informaton Securty
More informationProject Networks With MixedTime Constraints
Project Networs Wth MxedTme Constrants L Caccetta and B Wattananon Western Australan Centre of Excellence n Industral Optmsaton (WACEIO) Curtn Unversty of Technology GPO Box U1987 Perth Western Australa
More informationModule 2 LOSSLESS IMAGE COMPRESSION SYSTEMS. Version 2 ECE IIT, Kharagpur
Module LOSSLESS IMAGE COMPRESSION SYSTEMS Lesson 3 Lossless Compresson: Huffman Codng Instructonal Objectves At the end of ths lesson, the students should be able to:. Defne and measure source entropy..
More informationCausal, Explanatory Forecasting. Analysis. Regression Analysis. Simple Linear Regression. Which is Independent? Forecasting
Causal, Explanatory Forecastng Assumes causeandeffect relatonshp between system nputs and ts output Forecastng wth Regresson Analyss Rchard S. Barr Inputs System Cause + Effect Relatonshp The job of
More informationLoad Balancing Based on Clustering Methods for LTE Networks
Cyber Journals: Multdscplnary Journals n Scence and Technology Journal of Selected Areas n Telecommuncatons (JSAT) February Edton 2013 Volume 3 Issue 2 Load Balancng Based on Clusterng Methods for LTE
More informationFeature selection for intrusion detection. Slobodan Petrović NISlab, Gjøvik University College
Feature selecton for ntruson detecton Slobodan Petrovć NISlab, Gjøvk Unversty College Contents The feature selecton problem Intruson detecton Traffc features relevant for IDS The CFS measure The mrmr measure
More informationOpen Access A Load Balancing Strategy with Bandwidth Constraint in Cloud Computing. Jing Deng 1,*, Ping Guo 2, Qi Li 3, Haizhu Chen 1
Send Orders for Reprnts to reprnts@benthamscence.ae The Open Cybernetcs & Systemcs Journal, 2014, 8, 115121 115 Open Access A Load Balancng Strategy wth Bandwdth Constrant n Cloud Computng Jng Deng 1,*,
More information) of the Cell class is created containing information about events associated with the cell. Events are added to the Cell instance
Calbraton Method Instances of the Cell class (one nstance for each FMS cell) contan ADC raw data and methods assocated wth each partcular FMS cell. The calbraton method ncludes event selecton (Class Cell
More informationRecurrence. 1 Definitions and main statements
Recurrence 1 Defntons and man statements Let X n, n = 0, 1, 2,... be a MC wth the state space S = (1, 2,...), transton probabltes p j = P {X n+1 = j X n = }, and the transton matrx P = (p j ),j S def.
More informationTHE DISTRIBUTION OF LOAN PORTFOLIO VALUE * Oldrich Alfons Vasicek
HE DISRIBUION OF LOAN PORFOLIO VALUE * Oldrch Alfons Vascek he amount of captal necessary to support a portfolo of debt securtes depends on the probablty dstrbuton of the portfolo loss. Consder a portfolo
More informationOn File Delay Minimization for Content Uploading to Media Cloud via Collaborative Wireless Network
On Fle Delay Mnmzaton for Content Uploadng to Meda Cloud va Collaboratve Wreless Network Ge Zhang and Yonggang Wen School of Computer Engneerng Nanyang Technologcal Unversty Sngapore Emal: {zh0001ge, ygwen}@ntu.edu.sg
More information"Research Note" APPLICATION OF CHARGE SIMULATION METHOD TO ELECTRIC FIELD CALCULATION IN THE POWER CABLES *
Iranan Journal of Scence & Technology, Transacton B, Engneerng, ol. 30, No. B6, 789794 rnted n The Islamc Republc of Iran, 006 Shraz Unversty "Research Note" ALICATION OF CHARGE SIMULATION METHOD TO ELECTRIC
More informationDistributed Optimal Contention Window Control for Elastic Traffic in Wireless LANs
Dstrbuted Optmal Contenton Wndow Control for Elastc Traffc n Wreless LANs Yalng Yang, Jun Wang and Robn Kravets Unversty of Illnos at UrbanaChampagn { yyang8, junwang3, rhk@cs.uuc.edu} Abstract Ths paper
More informationVoIP Playout Buffer Adjustment using Adaptive Estimation of Network Delays
VoIP Playout Buffer Adjustment usng Adaptve Estmaton of Network Delays Mroslaw Narbutt and Lam Murphy* Department of Computer Scence Unversty College Dubln, Belfeld, Dubln, IRELAND Abstract The poor qualty
More informationSelfAdaptive SLADriven Capacity Management for Internet Services
SelfAdaptve SLADrven Capacty Management for Internet Servces Bruno Abrahao, Vrglo Almeda and Jussara Almeda Computer Scence Department Federal Unversty of Mnas Geras, Brazl Alex Zhang, Drk Beyer and
More informationLearning the Best Kth Channel for QoS Provisioning in Cognitive Networks
000 001 002 003 004 005 006 007 008 009 010 011 012 013 014 015 016 017 018 019 020 021 022 023 024 025 026 027 028 029 030 031 032 033 034 035 036 037 038 039 040 041 042 043 044 045 046 047 048 049 050
More informationA Performance Analysis of View Maintenance Techniques for Data Warehouses
A Performance Analyss of Vew Mantenance Technques for Data Warehouses Xng Wang Dell Computer Corporaton Round Roc, Texas Le Gruenwald The nversty of Olahoma School of Computer Scence orman, OK 739 Guangtao
More informationQoSAware Spectrum Sharing in Cognitive Wireless Networks
QoSAware Spectrum Sharng n Cogntve reless Networks Long Le and Ekram Hossan Abstract e consder QoSaware spectrum sharng n cogntve wreless networks where secondary users are allowed to access the spectrum
More informationMAPP. MERIS level 3 cloud and water vapour products. Issue: 1. Revision: 0. Date: 9.12.1998. Function Name Organisation Signature Date
Ttel: Project: Doc. No.: MERIS level 3 cloud and water vapour products MAPP MAPPATBDClWVL3 Issue: 1 Revson: 0 Date: 9.12.1998 Functon Name Organsaton Sgnature Date Author: Bennartz FUB Preusker FUB Schüller
More informationSlow Fading Channel Selection: A Restless MultiArmed Bandit Formulation
Slow Fadng Channel Selecton: A Restless MultArmed Bandt Formulaton Konstantn Avrachenkov INRIA, Maestro Team BP95, 06902 Sopha Antpols, France Emal: k.avrachenkov@sopha.nra.fr Laura Cottatellucc, Lorenzo
More informationAvailabilityBased Path Selection and Network Vulnerability Assessment
AvalabltyBased Path Selecton and Network Vulnerablty Assessment Song Yang, Stojan Trajanovsk and Fernando A. Kupers Delft Unversty of Technology, The Netherlands {S.Yang, S.Trajanovsk, F.A.Kupers}@tudelft.nl
More informationA Dynamic Load Balancing for Massive Multiplayer Online Game Server
A Dynamc Load Balancng for Massve Multplayer Onlne Game Server Jungyoul Lm, Jaeyong Chung, Jnryong Km and Kwanghyun Shm Dgtal Content Research Dvson Electroncs and Telecommuncatons Research Insttute Daejeon,
More informationAn Analysis of Central Processor Scheduling in Multiprogrammed Computer Systems
STANCS73355 I SUSE73013 An Analyss of Central Processor Schedulng n Multprogrammed Computer Systems (Dgest Edton) by Thomas G. Prce October 1972 Techncal Report No. 57 Reproducton n whole or n part
More informationOnLine Fault Detection in Wind Turbine Transmission System using Adaptive Filter and Robust Statistical Features
OnLne Fault Detecton n Wnd Turbne Transmsson System usng Adaptve Flter and Robust Statstcal Features Ruoyu L Remote Dagnostcs Center SKF USA Inc. 3443 N. Sam Houston Pkwy., Houston TX 77086 Emal: ruoyu.l@skf.com
More informationDynamic Pricing for Smart Grid with Reinforcement Learning
Dynamc Prcng for Smart Grd wth Renforcement Learnng ByungGook Km, Yu Zhang, Mhaela van der Schaar, and JangWon Lee Samsung Electroncs, Suwon, Korea Department of Electrcal Engneerng, UCLA, Los Angeles,
More informationForecasting the Demand of Emergency Supplies: Based on the CBR Theory and BP Neural Network
700 Proceedngs of the 8th Internatonal Conference on Innovaton & Management Forecastng the Demand of Emergency Supples: Based on the CBR Theory and BP Neural Network Fu Deqang, Lu Yun, L Changbng School
More informationBlind Estimation of Transmit Power in Wireless Networks
Bln Estmaton of Transmt Power n Wreless Networks Murtaza Zafer (IBM Research), Bongjun Ko (IBM Research), Chatschk Bskan (IBM Research) an Ivan Ho (Imperal College, UK) Transmtpower Estmaton: Problem
More informationFault tolerance in cloud technologies presented as a service
Internatonal Scentfc Conference Computer Scence 2015 Pavel Dzhunev, PhD student Fault tolerance n cloud technologes presented as a servce INTRODUCTION Improvements n technques for vrtualzaton and performance
More informationGRAVITY DATA VALIDATION AND OUTLIER DETECTION USING L 1 NORM
GRAVITY DATA VALIDATION AND OUTLIER DETECTION USING L 1 NORM BARRIOT JeanPerre, SARRAILH Mchel BGI/CNES 18.av.E.Beln 31401 TOULOUSE Cedex 4 (France) Emal: jeanperre.barrot@cnes.fr 1/Introducton The
More informationSUPPLIER FINANCING AND STOCK MANAGEMENT. A JOINT VIEW.
SUPPLIER FINANCING AND STOCK MANAGEMENT. A JOINT VIEW. Lucía Isabel García Cebrán Departamento de Economía y Dreccón de Empresas Unversdad de Zaragoza Gran Vía, 2 50.005 Zaragoza (Span) Phone: 976761000
More informationProperties of Indoor Received Signal Strength for WLAN Location Fingerprinting
Propertes of Indoor Receved Sgnal Strength for WLAN Locaton Fngerprntng Kamol Kaemarungs and Prashant Krshnamurthy Telecommuncatons Program, School of Informaton Scences, Unversty of Pttsburgh Emal: kakst2,prashk@ptt.edu
More informationVOLUME 5 BLAGOEVGRAD, BULGARIA SCIENTIFIC. Research ELECTRONIC ISSUE ISSN 13127535
VOLUME 5 007 BLAGOEVGRAD, BULGARIA SCIENTIFIC Research ISSN 1317535 ELECTRONIC ISSUE IMPROVING FAIRNESS IN CDMAHDR NETWORKS Valentn Hrstov Abstract. Improvng throughput and farness n Cellular Data Networks
More informationCan Auto Liability Insurance Purchases Signal Risk Attitude?
Internatonal Journal of Busness and Economcs, 2011, Vol. 10, No. 2, 159164 Can Auto Lablty Insurance Purchases Sgnal Rsk Atttude? ChuShu L Department of Internatonal Busness, Asa Unversty, Tawan ShengChang
More informationNetwork Aware LoadBalancing via Parallel VM Migration for Data Centers
Network Aware LoadBalancng va Parallel VM Mgraton for Data Centers KunTng Chen 2, Chen Chen 12, PoHsang Wang 2 1 Informaton Technology Servce Center, 2 Department of Computer Scence Natonal Chao Tung
More informationRelay Secrecy in Wireless Networks with Eavesdropper
Relay Secrecy n Wreless Networks wth Eavesdropper Parvathnathan Venktasubramanam, Tng He and Lang Tong School of Electrcal and Computer Engneerng Cornell Unversty, Ithaca, NY 14853 Emal : {pv45, th255,
More informationCalculation of Sampling Weights
Perre Foy Statstcs Canada 4 Calculaton of Samplng Weghts 4.1 OVERVIEW The basc sample desgn used n TIMSS Populatons 1 and 2 was a twostage stratfed cluster desgn. 1 The frst stage conssted of a sample
More informationLuby s Alg. for Maximal Independent Sets using Pairwise Independence
Lecture Notes for Randomzed Algorthms Luby s Alg. for Maxmal Independent Sets usng Parwse Independence Last Updated by Erc Vgoda on February, 006 8. Maxmal Independent Sets For a graph G = (V, E), an ndependent
More informationData Broadcast on a MultiSystem Heterogeneous Overlayed Wireless Network *
JOURNAL OF INFORMATION SCIENCE AND ENGINEERING 24, 819840 (2008) Data Broadcast on a MultSystem Heterogeneous Overlayed Wreless Network * Department of Computer Scence Natonal Chao Tung Unversty Hsnchu,
More informationA Lyapunov Optimization Approach to Repeated Stochastic Games
PROC. ALLERTON CONFERENCE ON COMMUNICATION, CONTROL, AND COMPUTING, OCT. 2013 1 A Lyapunov Optmzaton Approach to Repeated Stochastc Games Mchael J. Neely Unversty of Southern Calforna http://wwwbcf.usc.edu/
More informationAn Adaptive Crosslayer Bandwidth Scheduling Strategy for the SpeedSensitive Strategy in Hierarchical Cellular Networks
An Adaptve Crosslayer Bandwdth Schedulng Strategy for the SpeedSenstve Strategy n erarchcal Cellular Networks JongShn Chen #1, MeWen #2 Department of Informaton and Communcaton Engneerng ChaoYang Unversty
More informationPerformance Analysis and Comparison of QoS Provisioning Mechanisms for CBR Traffic in Noisy IEEE 802.11e WLANs Environments
Tamkang Journal of Scence and Engneerng, Vol. 12, No. 2, pp. 143149 (2008) 143 Performance Analyss and Comparson of QoS Provsonng Mechansms for CBR Traffc n Nosy IEEE 802.11e WLANs Envronments DerJunn
More informationSoftware project management with GAs
Informaton Scences 177 (27) 238 241 www.elsever.com/locate/ns Software project management wth GAs Enrque Alba *, J. Francsco Chcano Unversty of Málaga, Grupo GISUM, Departamento de Lenguajes y Cencas de
More informationA GameTheoretic Approach for Minimizing Security Risks in the InternetofThings
A GameTheoretc Approach for Mnmzng Securty Rsks n the InternetofThngs George Rontds, Emmanoul Panaouss, Aron Laszka, Tasos Daguklas, Pasquale Malacara, and Tansu Alpcan Hellenc Open Unversty, Greece
More informationAn RFID Distance Bounding Protocol
An RFID Dstance Boundng Protocol Gerhard P. Hancke and Markus G. Kuhn May 22, 2006 An RFID Dstance Boundng Protocol p. 1 Dstance boundng Verfer d Prover Places an upper bound on physcal dstance Does not
More informationPowerofTwo Policies for Single Warehouse MultiRetailer Inventory Systems with Order Frequency Discounts
Powerofwo Polces for Sngle Warehouse MultRetaler Inventory Systems wth Order Frequency Dscounts José A. Ventura Pennsylvana State Unversty (USA) Yale. Herer echnon Israel Insttute of echnology (Israel)
More informationDynamic Resource Allocation and Power Management in Virtualized Data Centers
Dynamc Resource Allocaton and Power Management n Vrtualzed Data Centers Rahul Urgaonkar, Ulas C. Kozat, Ken Igarash, Mchael J. Neely urgaonka@usc.edu, {kozat, garash}@docomolabsusa.com, mjneely@usc.edu
More informationRESEARCH ON DUALSHAKER SINE VIBRATION CONTROL. Yaoqi FENG 1, Hanping QIU 1. China Academy of Space Technology (CAST) yaoqi.feng@yahoo.
ICSV4 Carns Australa 9 July, 007 RESEARCH ON DUALSHAKER SINE VIBRATION CONTROL Yaoq FENG, Hanpng QIU Dynamc Test Laboratory, BISEE Chna Academy of Space Technology (CAST) yaoq.feng@yahoo.com Abstract
More informationAN APPROACH TO WIRELESS SCHEDULING CONSIDERING REVENUE AND USERS SATISFACTION
The Medterranean Journal of Computers and Networks, Vol. 2, No. 1, 2006 57 AN APPROACH TO WIRELESS SCHEDULING CONSIDERING REVENUE AND USERS SATISFACTION L. Bada 1,*, M. Zorz 2 1 Department of Engneerng,
More information1 Example 1: Axisaligned rectangles
COS 511: Theoretcal Machne Learnng Lecturer: Rob Schapre Lecture # 6 Scrbe: Aaron Schld February 21, 2013 Last class, we dscussed an analogue for Occam s Razor for nfnte hypothess spaces that, n conjuncton
More informationA DYNAMIC CRASHING METHOD FOR PROJECT MANAGEMENT USING SIMULATIONBASED OPTIMIZATION. Michael E. Kuhl Radhamés A. TolentinoPeña
Proceedngs of the 2008 Wnter Smulaton Conference S. J. Mason, R. R. Hll, L. Mönch, O. Rose, T. Jefferson, J. W. Fowler eds. A DYNAMIC CRASHING METHOD FOR PROJECT MANAGEMENT USING SIMULATIONBASED OPTIMIZATION
More informationEfficient OnDemand Data Service Delivery to HighSpeed Trains in Cellular/Infostation Integrated Networks
IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, VOL. XX, NO. XX, MONTH 2XX 1 Effcent OnDemand Data Servce Delvery to HghSpeed Trans n Cellular/Infostaton Integrated Networks Hao Lang, Student Member,
More informationJoint Scheduling of Processing and Shuffle Phases in MapReduce Systems
Jont Schedulng of Processng and Shuffle Phases n MapReduce Systems Fangfe Chen, Mural Kodalam, T. V. Lakshman Department of Computer Scence and Engneerng, The Penn State Unversty Bell Laboratores, AlcatelLucent
More informationAn Adaptive and Distributed Clustering Scheme for Wireless Sensor Networks
2007 Internatonal Conference on Convergence Informaton Technology An Adaptve and Dstrbuted Clusterng Scheme for Wreless Sensor Networs Xnguo Wang, Xnmng Zhang, Guolang Chen, Shuang Tan Department of Computer
More informationAn InterestOriented Network Evolution Mechanism for Online Communities
An InterestOrented Network Evoluton Mechansm for Onlne Communtes Cahong Sun and Xaopng Yang School of Informaton, Renmn Unversty of Chna, Bejng 100872, P.R. Chna {chsun,yang}@ruc.edu.cn Abstract. Onlne
More informationEconomicRobust Transmission Opportunity Auction in Multihop Wireless Networks
EconomcRobust Transmsson Opportunty Aucton n Multhop Wreless Networks Mng L, Pan L, Mao Pan, and Jnyuan Sun Department of Electrcal and Computer Engneerng, Msssspp State Unversty, Msssspp State, MS 39762
More informationWireless InterSession Network Coding  An Approach Using Virtual Multicasts
Wreless InterSesson Network Codng  An Approach Usng Vrtual Multcasts Mchael Hendlmaer,DesmondS.Lun,DanalTraskov,andMurelMédard Insttute for Communcatons Engneerng CCIB RLE Technsche Unverstät München
More informationEfficient Striping Techniques for Variable Bit Rate Continuous Media File Servers æ
Effcent Strpng Technques for Varable Bt Rate Contnuous Meda Fle Servers æ Prashant J. Shenoy Harrck M. Vn Department of Computer Scence, Department of Computer Scences, Unversty of Massachusetts at Amherst
More informationA DATA MINING APPLICATION IN A STUDENT DATABASE
JOURNAL OF AERONAUTICS AND SPACE TECHNOLOGIES JULY 005 VOLUME NUMBER (5357) A DATA MINING APPLICATION IN A STUDENT DATABASE Şenol Zafer ERDOĞAN Maltepe Ünversty Faculty of Engneerng BüyükbakkalköyIstanbul
More informationDistributed MultiTarget Tracking In A SelfConfiguring Camera Network
Dstrbuted MultTarget Trackng In A SelfConfgurng Camera Network Crstan Soto, B Song, Amt K. RoyChowdhury Department of Electrcal Engneerng Unversty of Calforna, Rversde {cwlder,bsong,amtrc}@ee.ucr.edu
More informationOn the Interaction between Load Balancing and Speed Scaling
On the Interacton between Load Balancng and Speed Scalng Ljun Chen and Na L Abstract Speed scalng has been wdely adopted n computer and communcaton systems, n partcular, to reduce energy consumpton. An
More informationSupport Vector Machines
Support Vector Machnes Max Wellng Department of Computer Scence Unversty of Toronto 10 Kng s College Road Toronto, M5S 3G5 Canada wellng@cs.toronto.edu Abstract Ths s a note to explan support vector machnes.
More informationThe OC Curve of Attribute Acceptance Plans
The OC Curve of Attrbute Acceptance Plans The Operatng Characterstc (OC) curve descrbes the probablty of acceptng a lot as a functon of the lot s qualty. Fgure 1 shows a typcal OC Curve. 10 8 6 4 1 3 4
More informationAn Introduction to 3G MonteCarlo simulations within ProMan
An Introducton to 3G MonteCarlo smulatons wthn ProMan responsble edtor: Hermann Buddendck AWE Communcatons GmbH OttoLlenthalStr. 36 D71034 Böblngen Phone: +49 70 31 71 49 716 Fax: +49 70 31 71 49
More informationAn Evolutionary Game Theoretic Approach to Adaptive and Stable Application Deployment in Clouds
An Evolutonary Game Theoretc Approach to Adaptve and Stable Applcaton Deployment n Clouds Chonho Lee Unversty of Massachusetts, Boston Boston, MA 5, USA chonho@csumbedu Yuj Yamano OGIS Internatonal, Inc
More informationStatistical Methods to Develop Rating Models
Statstcal Methods to Develop Ratng Models [Evelyn Hayden and Danel Porath, Österrechsche Natonalbank and Unversty of Appled Scences at Manz] Source: The Basel II Rsk Parameters Estmaton, Valdaton, and
More information行 政 院 國 家 科 學 委 員 會 補 助 專 題 研 究 計 畫 成 果 報 告 期 中 進 度 報 告
行 政 院 國 家 科 學 委 員 會 補 助 專 題 研 究 計 畫 成 果 報 告 期 中 進 度 報 告 畫 類 別 : 個 別 型 計 畫 半 導 體 產 業 大 型 廠 房 之 設 施 規 劃 計 畫 編 號 :NSC 962628E009026MY3 執 行 期 間 : 2007 年 8 月 1 日 至 2010 年 7 月 31 日 計 畫 主 持 人 : 巫 木 誠 共 同
More informationROSA: Distributed Joint Routing and Dynamic Spectrum Allocation in Cognitive Radio Ad Hoc Networks
ROSA: Dstrbuted Jont Routng and Dynamc Spectrum Allocaton n Cogntve Rado Ad Hoc Networks Le Dng Tommaso Meloda Stella Batalama Mchael J. Medley Department of Electrcal Engneerng, State Unversty of New
More informationADSHARE: AN ADVERTISING METHOD IN P2P SYSTEMS BASED ON REPUTATION MANAGEMENT
1 ADSHARE: AN ADVERTISING METHOD IN P2P SYSTEMS BASED ON REPUTATION MANAGEMENT Nkos Salamanos, Ev Alexogann, Mchals Vazrganns Department of Informatcs, Athens Unversty of Economcs and Busness salaman@aueb.gr,
More information