Mobility-dependent small-scale propagation model for applied simulation studies

Size: px
Start display at page:

Download "Mobility-dependent small-scale propagation model for applied simulation studies"

Transcription

1 RESEARCH Open Access Moblty-dependent small-scale propagaton model for appled smulaton studes Dmtr Moltchanov Abstract We propose an extenson to exstng wreless channel modelng technques ntroducng a noton of moblty behavor of the user. We represent large-scale propagaton characterstcs of wreless channels as a mobltydependent stochastc process that explctly tracks the movement of the user between areas wth dfferent receved local average sgnal strength (RLASS). Our model conssts of two dfferent parts: moblty model and propagaton model. Moblty of the user s modeled by a Markov chan wth fnte state space. Large-scale propagaton characterstcs of wreless channel are represented as a functon of moblty model. Small-scale propagaton characterstcs are then obtaned takng nto account shadowng of the lne-of-sght propagaton path. Based on the amount of avalable nformaton regardng a gven landscape envronment we develop two dfferent parametrzaton methods () RLASS values are avalable for lmted number of ponts n a gven landscape and () RLASS nformaton s not avalable. The model s sutable for smulaton studes of applcatons performance n presence of RLASS changes caused by movement of the user. 1 Introducton To estmate performance of wreless channels propagaton models are often used. We dstngush between large-scale and small-scale models. The former models capture propagaton characterstcs on a coarse granularty usng the noton of the receved local average sgnal strength (RLASS), see e.g., [1-3]. Models characterzng rapd changes of the receved sgnal strength are called small-scale propagaton models, see e.g., [4-]. These models capture propagaton characterstcs on a fner granularty. Nether large-scale nor small-scale models take nto account the sgnal strength attenuaton caused by movements of a user. To be precse small-scale propagaton models do take nto account the so-called small-scale moblty of the user over short dstances [7]. Such models descrbe rapd fluctuatons around a constant mean whch are called fadng. Such processes are mplctly assumed to be statonary at least n the second-order sense and mean equals to the receved local average sgnal strength (RLASS). However, f we would consder larger travel dstances (.e., more than just few meters) RLASS starts to vary and the most mportant factors Correspondence: moltchan@cs.tut.f Department of Communcaton Engneerng, Tampere Unversty of Technology, P.O. Box 553, Tampere, Fnland affectng t are terran, speed of a moble and dstance from between transmtter and the recever. In ths artcle, contrarly to most small-scale propagaton models proposed so far, we explctly take nto account two of these three factors terran and moblty of a user over t. In a moble envronment a user s allowed to change ts poston at any nstant of tme and these movements are not restrcted to short travel dstances. A recever durng a sngle sesson experences dfferent propagaton characterstcs. To predct these changes, an adequate model must capture both movement of a user between areas wth dfferent propagaton characterstcs and small-scale propagaton characterstcs n each area. Propagaton characterstcs must be represented as a probablstc functon of user s movements. Such model would be useful to estmate performance provded to applcatons whle user s n travelng mode. The rest of the artcle s organzed as follows. In Secton 2, we descrbe the structure of the model and ntroduce our modelng assumptons. Then, n Secton 3, we propose three dfferent parametrzaton methods for our model. Extensons and refnements of the model are dscussed n Secton 4. Fnally, n Secton 5 we test some of our assumptons. Conclusons are provded n the last secton. 2 Moltchanov; lcensee Sprnger. Ths s an Open Access artcle dstrbuted under the terms of the Creatve Commons Attrbuton Lcense ( whch permts unrestrcted use, dstrbuton, and reproducton n any medum, provded the orgnal work s properly cted.

2 Page 2 of 9 2 Structure of the model 2.1 Prelmnary notes The receved sgnal strength n wreless networks s bascally affected by three factors: () type of the terran we consder () speed of mobles, and () dstance between the transmtter and recever. Most small-scale propagaton models proposed so far ether mplctly or explctly assumed that all these factors are fxed,.e., a certan type of terran s consdered, speed of mobles as well as dstance between transmtter and recever are fxed. The man reasons s that even wth these assumptons the resultng receved sgnal strength s a covarance statonary stochastc process wth complcated dstrbutonal and correlatonal propertes. The reason for such reduced complexty of models s that smallscale propagaton models were manly used to desgn transcevers and assocated lower layer technques. For such tasks these models provde suffcent accuracy and should not be extended to more complex cases. When performance of nformaton transmsson at hgher layers s concerned we are nterestng n addng those addtonal factors to the small-scale propagaton models. Indeed, durng the actve sesson a moble user may move nsde and n-between cells experencng not only qualtatvely dfferent propagaton characterstcs (e. g., dfferent dstrbutons but the same mean) but quanttatvely dfferent too (e.g., dfferent RLASS). Thus, n addton to the type of small-scale propagaton at a certan separaton dstance from the transmtter we also have to take nto account movement of a user between areas wth dfferent RLASS. We would lke to note that allowng at least one factor affectng the receved sgnal strength to be varable may result n complex stochastc process makng the model applcable for smulaton studes only. 2.2 The moblty model Assume that a gven cell of a crcular shape s dvded nto a fnte number of areas, M, such that these areas are non-overlapped and the sum of ther areas equals to the area of the cell. Each area s assocated wth a certan, not necessarly dstnctve value of RLASS. We assume that a moble user may probablstcally move between these areas. Consder a dscrete-tme envronment,.e., tme axs s slotted, the slot duraton s constant and gven by Δt. Changes of areas are only allowed at the slot boundares. To capture movement of a user between areas we use a homogenous dscrete-tme Markov chan (DTMC) {S P (n), n=,1,...}, S P (n) Î {1, 2,...,M}, whose states correspond to areas. Let D P be ts transton probablty matrx. To parameterze ths model M, D P, and Δt shall be provded. 2.3 The large-scale propagaton model RLASS s manly a functon of the dstance between the transmtter and the recever and the type of propagaton envronment. To represent t, we assocate a value of RLASS wth each state of the moblty model. Let {P (n), n =,1,...}, P(n) Î {P 1,P 2,...,P M }betherlass process whose underlyng Markov chan s {S P (n), n =, 1,...},.e., the value of RLASS s modulated by the underlyng Markov chan. To parameterze ths model we have to provde the RLASS vector P =(P 1, P 2,..., P M ). 2.4 The small-scale propagaton model For performance evaluaton studes, small-scale propagaton characterstcs n a certan area can be modeled by doubly-stochastc process {R (n), n =,1,...}modulated by homogenous DTMC {S R, (n), n =,1,...}, S R, (n) Î {1, 2,..., H }, each state of whch s assocated wth condtonal probablty dstrbuton functon of the receved sgnal strength F R, (kδf j) (Δf) =Pr{R (n) =kδf S R, (n) =j}, k =1,2,..., N, j =1,2,..., H, where N s the number of bns to whch the sgnal strength s parttoned, Δf s the dscretzaton nterval. The slot duraton Δt of the model equals to the tme to transmt a sngle bt at the wreless channel. Slot duratons of moblty and small-scale propagaton models are equal and synchronzed. To capture small-scale propagaton characterstcs we dstngush between LOS and NLOS envronments. In the former case the small-scale propagaton envelop dstrbuton s Rcan. As the domnant component fades away the small-scale propagaton envelop dstrbuton degenerates to Raylegh dstrbuton. Thus, small-scale propagaton characterstcs n dfferent areas are, at least, qualtatvely (dstrbuton) or quanttatvely (RLASS) dfferent. Therefore, areas must be determned such that each of them s unquely characterzed by mean/dstrbuton par. Then, each area must be assocated wth unque small-scale propagaton model {R (n), n =,1,...}, =1, 2,..., M such that E[R ]=P,.e., the RLASS n the area s the mean of {R (n), n =,1,...}. We requre that the state space of all small-scale propagaton models s the same and gven by {1, 2,..., H}. Snce propagaton characterstcs are a probablstc functon of the movement between areas, the choce of the actve propagaton model {R (n), n =,1,...}, = 1, 2,..., M, ntheslotn depends on the area n the

3 Page 3 of 9 slot n,.e., {R(n), n=,1,...}={r (n), n =,1,...}, S P (n) =. Recallng that all small-scale propagaton models were assumed to have the same number of states, H, the state-space of the resultng model s S R (n) {(1, 1),..., (1, H),..., (M, 1),..., (M, H)}. (1) An approprate small-scale propagaton model s only assocated wth the state of the moblty model correspondng to the approprate area. Hence, transton probabltes of DTMC of moblty-dependent model s gven by d R,j = d R,,kj, k, j {1, 2,..., H}, S P (n) =. (2) To parameterze moblty-dependent small-scale propagaton model we shall provde H, D R,, F R, (kδf j)(δf), =1,2,..., M, k =1,2,..., N, j =1,2,..., H. 3 Parametrzaton of the model 3.1 The moblty model Assume that the number of areas M and assocated RLASS vector P are known. It s far to expect MP that the mean sojourn tme n a certan area depends on ts sze. Consder a user that s n the area n the slot n. In the next slot ths user may stay n the area or move to another area. The only areas to whch a user can move n a slot are adjacent areas denoted by Ω.Consder areas from Ω as a sngle area. We compute transton probablty between area and Ω as d L, = S j S + S, d L, = S S + S, (3) where S s the area of area, S Ω stheareaofω, d L,, = 1, 2,..., M, are transton probabltes between area and Ω. Dependng on the length of the border between area and areas from Ω transton probablty d L, s dstrbuted among transton probabltes d L, j, j Î Ω,as d L,j = d V j w j j V j, j, (4) where V j, j Î Ω are lengths of the border between and j. Parameters w j, j Î Ω are ntroduced to represent drectonal movement of the user n a certan applcaton scenaro, e.g., hghway, cty center. Snce ths movement s specfc for a gven envronment, no general expresson can be provded. Note that j w j =1, =1,2,..., M. 3.2 Large-scale propagaton model Parametrzaton based on measurements Measurements of RLASS are often gven by the 3D vector P XY =(x, y, P ), =1,2,..., M, wherem s the number of measurements, (x, y ) s the coordnate of th measurement and P s the RLASS value of respectve measurement. Practcally, t s not feasble to measure RLASS n each and every pont of the landscape. Thus, nformaton gven by P XY s often nsuffcent to parameterze our model. To estmate P and M we have to determne areas to whch these measurements belong to, such that the approxmaton error s mnmzed. To determne areas we propose to use a dvson of the cell nto areas whose vertexes are measurement ponts (x, y ), =1,2,..., M. An approprate dvson of the cell s gven by Vorono (Drchlet) tesselaton separatng a regon E of the space R 2 nto polygons E,=1,2,..., M, usng M ponts drawn from a certan pont process. In our case the space s R 2 and coordnates of measurements are consdered as a realzaton of the pont process. For each measurement pont (x,y ),E s the area consstng of all locatons that are closer to (x,y )thantoany other pont. There are a number of algorthms to compute Vorono tesselaton [8]. To determne areas wth dfferent RLASS t s not strctly requred to dstngush between values of RLASS n each area. Instead, t s possble to consder ranges of RLASS. In ths case the range (max P - mn P ) must be dvded nto K non-overlappng ranges of length ΔP =(max P - mn P )/K. Then, all measurements are classfed to these ranges. Adjacent areas havng RLASS values fallng n the same range can be grouped. An example s shown n Fgure 1, where measurements ponts, the Vorono tesselaton, and resultng areas are shown Theoretcal parametrzaton Measurements of RLASS are often unavalable. In ths case, we can parameterze our model based on approxmate estmaton of shadowed areas and subsequent applcaton of large-scale propagaton models. Assume that centers of shadowers are dstrbuted accordng to the statonary Posson pont process wth mean l. The parameter l depends on a gven landscape. Note that whenever possble actual placements of shadowers can be used. We also assume that (1) shadowers are of rectangular form, (2) thckness of shadowers s zero, (3) ther wdths and heghts are arbtrary dstrbuted, (4) heght of the transmtter antenna h a s known. Threepossbleshadowplacementscausedbyshadowers wth dfferent relaton between ntal parameters are shown n Fgure 2, where d s s the shadow length, R s the radus of a cell, d s mnmal dstance between the center of the cell and a shadower, and h s s the heght of shadower. We should dstngush between three cases: (1) h a >h s, d s R-d, the shadow s wthn the cell, (2) h a >h s, d s >R-d, the shadow s bounded

4 Page 4 of Fgure 1 Example of dvson of a cell based on measurements. outsde, (3) h a <h s, the shadow vrtually contnues up to nfnty. Snce we consder a sngle cell, the latter two cases can be treated smlarly. The area of an arbtrary shadow s gven by ( S s = mn 4π R 2 γ,4π(d + d s) 2 γ ) dw s 2,(5) where d s = mn ( ) hs cot β, R d, β =9 arctan d h a h s. To estmate RLASS vector P we use large-scale propagaton models. It was shown n [9] that the mean value of propagaton loss, L(d), can be approxmated by E [ L (d) ] ( ) d = L s (d ) +1n lg + X σ, () where d s the separaton dstance, n s the path loss exponent, d s the standard dstance, L s (d )sthepropagaton loss at d, X s s the factor unque for a gven envronment. For every shadowed area the propagaton loss s estmated usng () wth n>2, for unshad- owed areas n 2. Parameters for dfferent frequency bands are gven n [2,1]. Gven a certan transmsson power of the base staton, propagaton loss can be related to RLASS [7]. Observe that there can be shadows whose length s only slghtly less than the radus of the cell. The range of RLASS correspondng to these shadows s large d leadng to modelng errors. To avod t, n addton to dvson of the cell nto shadowed and non-shadowed areas, we propose to dvde the cell nto crcles wth dfferent rad. Shadows are then classfed to these crcles as shown n Fgure 3. Fnally, we need to menton that performng theoretcal estmaton of shadowed areas accordng to the proceduredescrbedabovetherecouldbethecasewhen two or more shadows overlap as shown n Fgure 4, where dfferent fllngs denote doubly and trply overlapped shadowed areas. In ths case RLASS n the area where shadows overlap could be dfferent compared to RLASS n non-overlappng regons of these areas. In ths case the propagaton loss n regons where two or more shadows overlap needs to be computed usng dfferent pass loss exponents. 3.3 The small-scale propagaton model We parameterze small-scale propagaton models usng the hstogram matchng method. Dependng on presenceoflosnthearea, process {R (n), n =,1,...} has ether Rcan or Raylegh dstrbuton wth mean E [R ]=L. Settng the number of states of the Markov chan n each state of the moblty model to one (H =1) and choosng Δf small enough we capture these dstrbutons as F R, ( k f )( f ) = p k x k+1 x k. (7) h a >h s,d s <R-d d R 9 o h a >h s,d s >R-d h a <h s d R d 9 o 9 o R d s d s d s Fgure 2 Three possble placements of a shadow.

5 Page 5 of 9 where p k = x k+1 x k f X (x)dx, f X (x) s ether Raylegh or Rcan dstrbuton, x k and x k+1 are lower and upper values for nterval k. Alternatvely, settng H and solvng the nverse-egenvalue problem one can capture autocorrelaton 1 and solvng the nverse-egenvalue problem one can capture autocorrelaton propertes of the receved sgnal strength. 4 Extensons and notes 4.1 Sgnal-to-nterference rato For a model to be useful, n addton to the receved sgnalstrengthwehavetotakentoaccountthelevelof nose and consder the sgnal-to-nterference (SI) rato. The nterference at the recever s gven by I = W + U, where W the thermal nose, U = L l=1 U (l) s receved sgnal strength from L nterferng base statons. W s usually assumed to be constant. U s stochastc, depends on the dstance and propagaton path between the recever and transmtters of nterferng cells. Assume that U s constant for any state of the moblty model. The nterference process {U(n), n =,1,...}, U(n) {U 1, U 2,..., U M }, s modulated by {S P (n), n =,1,...}. We determne the mean propagaton loss E[L(m j )] for a gven area and nterferng transmtter j as a functon of dstance them, m j,usng().e[l(m )] s then related to RLASS and mean other cells nterference s computed for areas as U = L l=1 U (l). Addng a constant W to {U(n), n =,1,...} affects the mean only allowng to consder the nterference process {I(n), n =,1,...}, =1,2,..., M. The resultng sgnal-to-nterference process s gven by (R 1 I 1 )(n), S P (n) =1, Y (n) = (8) (R M I M )(n), S P (n) = M, where I = W + L l=1 U (l), = 1, 2,..., M. Fgure 4 Doubly and trply overlapped shadowed areas. 4.2 Attracton ponts Notce that n our model movement of the user s homogenous n tme and depends on the sze of areas only, see (3). However, n addton to the sze of the areas other factors may affect movement of the user of the landscape. One of the most mportant s the socalled attracton ponts n a cell,.e., places (areas n our termnology) where a user may spent sgnfcant amount of tme compared to other areas. Takng nto account the effect of such attracton ponts s equvalent to ntroducng non-homogenety to the process of user movement between areas, that s, makng movement to depend on some addtonal factors. Formally, t can be done ntroducng a new multplers g, =1,2,..., M, each of whch corresponds to a certan area nto (3). 4.3 The scope of applcaton We would lke to note that when mcro or pcocells scenaros are consdered the areas we ntroduced n ths artcle are almost mpossble to defne. The reason s that n such cells attracton ponts seem to play much more mportant role compared to the sze of areas. Ths s clearly seen consderng offce scenaro, where employees move between pre-fxed locatons such as workng places, meetng rooms, etc. In ths case nstead of parameterzng our model based on szes of areas we need to consder attractveness of varous locatons and Fgure 3 Example of drect estmaton of shadowed areas.

6 Page of 9 nter-locaton movement of users developng new expressons for estmatng nter-locaton movements. Sncetherecouldbeanumberoflocaton-specfcfactors nvolved nto estmaton of these probabltes we do not provde formulas for mcro and pcocells. Our model was orgnally proposed for macrocell envronments where t s possble to dstngush between dfferent areas wth quanttatvely and/or qualtatvely dfferent receved sgnal strength. The theoretcal parametrzaton of the model s sutable for suburbs and country-sde areas. When measurements of RLASS are avalable the model can be appled n cty-center scenaros. The only dfference s that n addton to szes of areas we also need to take nto account possble tunnelng effects. Notce that even n ths case we can use theoretcal parametrzaton. However, nstead of propagaton models specfed n [1-3,1] we need to use specal models sutable for such envronment. Fnally, as mentoned above wth some modfcatons ths model can be appled to mcrocell and pcocell scenaros where a user moves between a number of attracton ponts. Applyng ths model n such scenaros addtonal care should be taken as even small travel dstances may lead to drastc changes n small-scaled propagaton characterstcs due to complcated reflecton and scatterng observed n the buldngs. 5 Testng assumptons Unfortunately due to unavalablty of data regardng moblty of users on the landscape we were not able to test closeness of the proposed moblty model and emprcal data. Asde from ths, one of the most mportant assumpton we take n ths artcle s that the receved sgnal strength at a certan separaton dstance from the transmtter s ndeed statonary whle when changng the locaton dfferent characterstcs of the receved sgnal strength dstrbuton changes. To test ths assumpton we carred out experments wth wreless local area network (WLAN) networks operatng n nfrastructure DCF mode accordng to IEEE 82.11b standard at 11 Mbps (DSSS) n laboratory envronments. The access pont s nstalled n the corrdors wth rooms along both sdes of t. The man ponts of nterest were characterstcs of the receved sgnal strength process at a certan separaton dstance from the transmtter and ts changes as users move between dfferent attracton ponts. Sgnal strength observatons were measures wth 1 ms granularty and then averaged over.5 ms tme ntervals. To test our assumpton regardng statonary nature f the receved sgnal strength two rooms were arbtrarly chosen and the sgnal was measured for a long duraton of tme. Two samples gather as a result of these experments are shown n Fgure 5. Just observng these traces no defntve conclusons regardng statonarty of the SNR process at a certan separaton dstance from the transmtter can be made. For ths reason we performed detaled statstcal analyss as dscussed below. Hstograms of relatve frequences servce as estmates of emprcal dstrbutons and ther approxmatons by Normal dstrbuton are show n Fgure. As one may observe approxmatons are qute good. Testng the null hypothess about Normal dstrbuton of data usng c 2 test confrmed t wth the level of sgnfcance, a, setto.1. Notce that for the second trace the null hypothess s accepted even when a =.5. Tests performed for other rooms (not shown here due to space constrants) also confrm ths approxmaton. We would lke to note that one should not be surprsed wth normalty of observatons. Recall that we averaged the receved sgnal strength over.5 s. ntervals provdng suffcent aggregaton level for central lmt theorem to hold. In addton to dstrbutonal propertes dscussed above the process s found to be autocorrelated as hghlghted as normalzed autocorrelaton functons (NACF) shownnfgurec,d.theljung-boxtest(aspecal type of portmanteau test) performed wth the level of sgnfcance a =.1 showed that frst three lags of the frst sample and the frst lag of the second one are statstcally dfferent from zero wth level of confdence a =.1. Observng the fgures we see that the both functons decay geometrcally fast. Note that the above mentoned analyss does not allow us to conclude that the process at a certan separaton dstance s covarance statonary. Unfortunately, there are no well-behaved tests to access statonarty of stochastc processes. We use the followng two-steps procedure. Frst of all, observe that explctly assumng covarance statonarty the above mentoned analyss allows to model SNR data at a certan separaton dstance from the transmtter usng autoregressve process of order 1, AR(1), n the form Y = j + j 1 Y -1 + ε, =, 1,...,wherej and j 1 are some constants, ε are ndependently and dentcally dstrbuted random varables havng the same normal dstrbuton wth zero mean and varance s 2 [ε]. Thus, we used aposteror change-pont exponental weghted movng average test for AR(1) (see [11,]) to detect change n the mean of SNR data. For our observatons no changes have been observed n both samples. However, ths does not necessarly mply that there are no changes n other parameters of the process. To address ths stuaton we dvded each sample nto three dfferent subsamples and compare ther dstrbutonal and correlatonal propertes. It appeared that usng c 2 test wth the level of sgnfcance set to a =.1 all the subsamples drawn from a certan sample are homogenous,.e., have the same 1D dstrbutons. Usage of rather bg value of a s explaned

7 Page 7 of 9 Y() (a) Sample 1 Fgure 5 Samples of SNR observatons (locaton s fxed). Y() (b) Sample 2 by presence of correlaton n subsamples. To conceal the effect of correlaton we also used every second observaton n each subsample to compute emprcal dstrbutons.theturnngponttestdemonstratedthatthe hypothess about whte nose should be rejected wth the level of sgnfcant a =.5 ndcatng that there s memory n each of those sample. Fnally, n each subsample NACF decayed geometrcally fast. The reason for performng the turnng pont test nstead of, e.g., Ljung-Box portmanteau test s that t s unreasonable to expect the same number of lags havng statstcally sgnfcant correlaton n samples of small szes. Although these observatons do not strctly prove that SNR process at a certan separaton dstance from the transmtter s covarance statonary they provde enough evdence that frst and second-order characterstcs lkely reman unchanged. Recall that n addton to covarance statonarty of SNR process as a certan separaton dstance from the f,e ( ) K Y () (a) Sample (c) Sample 1,lag f,e ( ) K Y () (b) Sample (d) Sample 2 Fgure Hstograms and NACFs of SNR observatons and ther approxmatons.,lag transmtter we also assumed that the mean (and possbly dstrbuton) changes as usermovesbetweendfferent locatons. To back up our assumpton we performed the followng experments. A moble staton was n statonary poston for some notceable amount of tme. Then, a user moved nto another offce room and the staton agan remaned n statonary state for some amount of tme. Two arbtrarly chosen SNR samples obtaned by changng the locaton of the user durng the measurng process are shown n Fgure 7. Observng these traces one may notce that the change n the receved sgnal strength happens almost nstantaneously. The reason s that the dstances between attracton ponts n offce envronment are rather short (recall that the granularty of SNR measurements s.5 s). Results of EWMA change pont test are shown n Fgure 8 for two values of smoothng parameters g. Inall demonstrated fgures the change n SNR statstcs s detected. Moreover, our results show that changes are detected for all values of smoothng parameters g that are less than.1 mplyng that there s no need to access accuracy of the test usng average run length (ARL) statstcs. Note that change-pont statstcal tests are rather coarse n general. To ensure that the change n some parameters of the dstrbuton happened we compared dstrbutonal characterstcs of two subsamples drawn from each sample. To get these subsamples we used results of EWMA test to exclude those observatons occurrng at the change pont. c 2 test performed wth the level of sgnfcance set to a =.5showedthatthe null hypothess about the same emprcal dstrbuton should be rejected. Note that the above mentoned statstcal analyss demonstrate that () SNR process at a certan separaton dstance from the transmtter s close to covarance statonary () SNR process may quanttatvely change when user changes ts locaton. Supplementng the above mentoned analyss wth moblty model between attracton ponts we a partcular case of the moblty-

8 Page 8 of 9 Y() (a) Sample 1 Fgure 7 Tme seres of SNR observatons (locaton s changed). Y() (b) Sample 2 dependent propagaton model ntroduced n ths artcle. Although these test have been performed n offce envronment usng IEEE 82.11b WLAN we can expect the same statstcal behavor for publc wreless networks. Stll there are mportant dfferences. Frst of all, due to larger spaces covered by these networks n addton to attracton ponts we need to consder areas as descrbed n Secton 2. Secondly, changes n characterstcs of the receved sgnal strength are not expected to happen drastcally as user moved between areas and/or attracton ponts. Conclusons We developed an extenson for wreless channel modelng technques explctly takng nto account the movement of the user between areas wth dfferent smallscale propagaton characterstcs. Although a sngle cell envronment has been consdered, results can be extended to multple cells scenaro. The model s sutable for performance evaluaton of applcatons n presence of sgnal strength changes caused by movement of the user. Although the Markov structure of the model allows for analytcal performance L Y (), C mn (), C max () (a) Sample 1: γ =.1 L Y (), C mn (), C max () (c) Sample 2: γ =.1 Fgure 8 Tme seres of SNR observatons (locaton s changed). L Y (), C mn (), C max () (b) Sample 1: γ =.1 L Y (), C mn (), C max () (d) Sample 2: γ =.1

9 Page 9 of 9 modelng, large state space may restrct ts usage to smulaton studes. We note that the model can be extended to capture propagaton-dependent behavor. For example, the current modulaton and codng scheme as a functon of moblty of the user can be modeled. Competng nterests The authors declare that they have no competng nterests. Receved: February 211 Accepted: 2 Aprl 2 Publshed: 2 Aprl 2 References 1. T Okumura, E Omor, K Fakuda, Feld strength and ts varablty n VHF and UHF land moble servce. Rev Electr Commun Lab. 1(9/1): (198) 2. M Hata, Emprcal formula for propagaton loss n land moble rado servces. IEEE Trans Veh Tech. VT-29(3): (198) 3. M Feueresten, K Blackard, T Rappaport, S Sedel, H Xa, Path loss, delay spread, and outage models as functons of antena heght for mcrocellular system desgn. IEEE Trans Veh Tech. 43(3): (1994). do:1.119/ A Saleh, R Valenzuela, A statstcal model for ndoor multpath propagaton. IEEE JSAC. 5(2):8 137 (1987) 5. T Rappaport, Statstcal channel mpulse response models for factory and open plan buldng rado communcaton system desgn. IEEE Trans Commun. 39(5):794 8 (1991). do:1.119/ D Durgn, T Rappaport, Theory of multpath shape factors for small-scale fadng wreless channels. IEEE Trans Ant Propag. 48, (2). do:1.119/ T Rappaport, Wreless Communcatons: Prncples and Practce, 2nd edn. (Prentce Hall, Upper Saddle Rver, 22) 8. P Green, R Sbson, Computng Drchlet tesselatons n the plane. Comput J. 21, 173 (1978) 9. S Sedel, Path loss, scatterng and multpath delay statstcs n four european ctes of dgtal cellular and mcrocellular radotelephone. IEEE Trans Veh Tech. 4(4):721 7 (1991). do:1.119/ Dgtal moble rado, towards future generaton systems. COST 231 Fnal Report, EUR957. (1999) 11. D Moltchanov, State descrpton of wreless channels usng change-pont statstcal tests. n Proc WWIC 2, vol (Bern, Swtzerland, 2), pp W Schmd, A Schone, Some propertes of the EWMA control chart n the presence of auto-correlaton. Ann Stat. 25(3):77 83 (1997). do:1.14/ aos/ do:1.1/ Cte ths artcle as: Moltchanov: Moblty-dependent small-scale propagaton model for appled smulaton studes. EURASIP Journal on Wreless Communcatons and Networkng 2 2:1. Submt your manuscrpt to a journal and beneft from: 7 Convenent onlne submsson 7 Rgorous peer revew 7 Immedate publcaton on acceptance 7 Open access: artcles freely avalable onlne 7 Hgh vsblty wthn the feld 7 Retanng the copyrght to your artcle Submt your next manuscrpt at 7 sprngeropen.com

Empirical Distributions of Parameter Estimates. in Binary Logistic Regression Using Bootstrap

Empirical Distributions of Parameter Estimates. in Binary Logistic Regression Using Bootstrap Int. Journal of Math. Analyss, Vol. 8, 4, no. 5, 7-7 HIKARI Ltd, www.m-hkar.com http://dx.do.org/.988/jma.4.494 Emprcal Dstrbutons of Parameter Estmates n Bnary Logstc Regresson Usng Bootstrap Anwar Ftranto*

More information

A Binarization Algorithm specialized on Document Images and Photos

A Binarization Algorithm specialized on Document Images and Photos A Bnarzaton Algorthm specalzed on Document mages and Photos Ergna Kavalleratou Dept. of nformaton and Communcaton Systems Engneerng Unversty of the Aegean kavalleratou@aegean.gr Abstract n ths paper, a

More information

S1 Note. Basis functions.

S1 Note. Basis functions. S1 Note. Bass functons. Contents Types of bass functons...1 The Fourer bass...2 B-splne bass...3 Power and type I error rates wth dfferent numbers of bass functons...4 Table S1. Smulaton results of type

More information

Parallelism for Nested Loops with Non-uniform and Flow Dependences

Parallelism for Nested Loops with Non-uniform and Flow Dependences Parallelsm for Nested Loops wth Non-unform and Flow Dependences Sam-Jn Jeong Dept. of Informaton & Communcaton Engneerng, Cheonan Unversty, 5, Anseo-dong, Cheonan, Chungnam, 330-80, Korea. seong@cheonan.ac.kr

More information

User Authentication Based On Behavioral Mouse Dynamics Biometrics

User Authentication Based On Behavioral Mouse Dynamics Biometrics User Authentcaton Based On Behavoral Mouse Dynamcs Bometrcs Chee-Hyung Yoon Danel Donghyun Km Department of Computer Scence Department of Computer Scence Stanford Unversty Stanford Unversty Stanford, CA

More information

R s s f. m y s. SPH3UW Unit 7.3 Spherical Concave Mirrors Page 1 of 12. Notes

R s s f. m y s. SPH3UW Unit 7.3 Spherical Concave Mirrors Page 1 of 12. Notes SPH3UW Unt 7.3 Sphercal Concave Mrrors Page 1 of 1 Notes Physcs Tool box Concave Mrror If the reflectng surface takes place on the nner surface of the sphercal shape so that the centre of the mrror bulges

More information

X- Chart Using ANOM Approach

X- Chart Using ANOM Approach ISSN 1684-8403 Journal of Statstcs Volume 17, 010, pp. 3-3 Abstract X- Chart Usng ANOM Approach Gullapall Chakravarth 1 and Chaluvad Venkateswara Rao Control lmts for ndvdual measurements (X) chart are

More information

Some Advanced SPC Tools 1. Cumulative Sum Control (Cusum) Chart For the data shown in Table 9-1, the x chart can be generated.

Some Advanced SPC Tools 1. Cumulative Sum Control (Cusum) Chart For the data shown in Table 9-1, the x chart can be generated. Some Advanced SP Tools 1. umulatve Sum ontrol (usum) hart For the data shown n Table 9-1, the x chart can be generated. However, the shft taken place at sample #21 s not apparent. 92 For ths set samples,

More information

Mathematics 256 a course in differential equations for engineering students

Mathematics 256 a course in differential equations for engineering students Mathematcs 56 a course n dfferental equatons for engneerng students Chapter 5. More effcent methods of numercal soluton Euler s method s qute neffcent. Because the error s essentally proportonal to the

More information

y and the total sum of

y and the total sum of Lnear regresson Testng for non-lnearty In analytcal chemstry, lnear regresson s commonly used n the constructon of calbraton functons requred for analytcal technques such as gas chromatography, atomc absorpton

More information

Cluster Analysis of Electrical Behavior

Cluster Analysis of Electrical Behavior Journal of Computer and Communcatons, 205, 3, 88-93 Publshed Onlne May 205 n ScRes. http://www.scrp.org/ournal/cc http://dx.do.org/0.4236/cc.205.350 Cluster Analyss of Electrcal Behavor Ln Lu Ln Lu, School

More information

FEATURE EXTRACTION. Dr. K.Vijayarekha. Associate Dean School of Electrical and Electronics Engineering SASTRA University, Thanjavur

FEATURE EXTRACTION. Dr. K.Vijayarekha. Associate Dean School of Electrical and Electronics Engineering SASTRA University, Thanjavur FEATURE EXTRACTION Dr. K.Vjayarekha Assocate Dean School of Electrcal and Electroncs Engneerng SASTRA Unversty, Thanjavur613 41 Jont Intatve of IITs and IISc Funded by MHRD Page 1 of 8 Table of Contents

More information

Wishing you all a Total Quality New Year!

Wishing you all a Total Quality New Year! Total Qualty Management and Sx Sgma Post Graduate Program 214-15 Sesson 4 Vnay Kumar Kalakband Assstant Professor Operatons & Systems Area 1 Wshng you all a Total Qualty New Year! Hope you acheve Sx sgma

More information

6.854 Advanced Algorithms Petar Maymounkov Problem Set 11 (November 23, 2005) With: Benjamin Rossman, Oren Weimann, and Pouya Kheradpour

6.854 Advanced Algorithms Petar Maymounkov Problem Set 11 (November 23, 2005) With: Benjamin Rossman, Oren Weimann, and Pouya Kheradpour 6.854 Advanced Algorthms Petar Maymounkov Problem Set 11 (November 23, 2005) Wth: Benjamn Rossman, Oren Wemann, and Pouya Kheradpour Problem 1. We reduce vertex cover to MAX-SAT wth weghts, such that the

More information

Improvement of Spatial Resolution Using BlockMatching Based Motion Estimation and Frame. Integration

Improvement of Spatial Resolution Using BlockMatching Based Motion Estimation and Frame. Integration Improvement of Spatal Resoluton Usng BlockMatchng Based Moton Estmaton and Frame Integraton Danya Suga and Takayuk Hamamoto Graduate School of Engneerng, Tokyo Unversty of Scence, 6-3-1, Nuku, Katsuska-ku,

More information

A MOVING MESH APPROACH FOR SIMULATION BUDGET ALLOCATION ON CONTINUOUS DOMAINS

A MOVING MESH APPROACH FOR SIMULATION BUDGET ALLOCATION ON CONTINUOUS DOMAINS Proceedngs of the Wnter Smulaton Conference M E Kuhl, N M Steger, F B Armstrong, and J A Jones, eds A MOVING MESH APPROACH FOR SIMULATION BUDGET ALLOCATION ON CONTINUOUS DOMAINS Mark W Brantley Chun-Hung

More information

A Semi-parametric Regression Model to Estimate Variability of NO 2

A Semi-parametric Regression Model to Estimate Variability of NO 2 Envronment and Polluton; Vol. 2, No. 1; 2013 ISSN 1927-0909 E-ISSN 1927-0917 Publshed by Canadan Center of Scence and Educaton A Sem-parametrc Regresson Model to Estmate Varablty of NO 2 Meczysław Szyszkowcz

More information

Steps for Computing the Dissimilarity, Entropy, Herfindahl-Hirschman and. Accessibility (Gravity with Competition) Indices

Steps for Computing the Dissimilarity, Entropy, Herfindahl-Hirschman and. Accessibility (Gravity with Competition) Indices Steps for Computng the Dssmlarty, Entropy, Herfndahl-Hrschman and Accessblty (Gravty wth Competton) Indces I. Dssmlarty Index Measurement: The followng formula can be used to measure the evenness between

More information

Compiler Design. Spring Register Allocation. Sample Exercises and Solutions. Prof. Pedro C. Diniz

Compiler Design. Spring Register Allocation. Sample Exercises and Solutions. Prof. Pedro C. Diniz Compler Desgn Sprng 2014 Regster Allocaton Sample Exercses and Solutons Prof. Pedro C. Dnz USC / Informaton Scences Insttute 4676 Admralty Way, Sute 1001 Marna del Rey, Calforna 90292 pedro@s.edu Regster

More information

An Optimal Algorithm for Prufer Codes *

An Optimal Algorithm for Prufer Codes * J. Software Engneerng & Applcatons, 2009, 2: 111-115 do:10.4236/jsea.2009.22016 Publshed Onlne July 2009 (www.scrp.org/journal/jsea) An Optmal Algorthm for Prufer Codes * Xaodong Wang 1, 2, Le Wang 3,

More information

IMPACT OF RADIO MAP SIMULATION ON POSITIONING IN INDOOR ENVIRONTMENT USING FINGER PRINTING ALGORITHMS

IMPACT OF RADIO MAP SIMULATION ON POSITIONING IN INDOOR ENVIRONTMENT USING FINGER PRINTING ALGORITHMS IMPACT OF RADIO MAP SIMULATION ON POSITIONING IN INDOOR ENVIRONTMENT USING FINGER PRINTING ALGORITHMS Jura Macha and Peter Brda Unversty of Zlna, Faculty of Electrcal Engneerng, Department of Telecommuncatons

More information

Helsinki University Of Technology, Systems Analysis Laboratory Mat Independent research projects in applied mathematics (3 cr)

Helsinki University Of Technology, Systems Analysis Laboratory Mat Independent research projects in applied mathematics (3 cr) Helsnk Unversty Of Technology, Systems Analyss Laboratory Mat-2.08 Independent research projects n appled mathematcs (3 cr) "! #$&% Antt Laukkanen 506 R ajlaukka@cc.hut.f 2 Introducton...3 2 Multattrbute

More information

TN348: Openlab Module - Colocalization

TN348: Openlab Module - Colocalization TN348: Openlab Module - Colocalzaton Topc The Colocalzaton module provdes the faclty to vsualze and quantfy colocalzaton between pars of mages. The Colocalzaton wndow contans a prevew of the two mages

More information

Proper Choice of Data Used for the Estimation of Datum Transformation Parameters

Proper Choice of Data Used for the Estimation of Datum Transformation Parameters Proper Choce of Data Used for the Estmaton of Datum Transformaton Parameters Hakan S. KUTOGLU, Turkey Key words: Coordnate systems; transformaton; estmaton, relablty. SUMMARY Advances n technologes and

More information

Content Based Image Retrieval Using 2-D Discrete Wavelet with Texture Feature with Different Classifiers

Content Based Image Retrieval Using 2-D Discrete Wavelet with Texture Feature with Different Classifiers IOSR Journal of Electroncs and Communcaton Engneerng (IOSR-JECE) e-issn: 78-834,p- ISSN: 78-8735.Volume 9, Issue, Ver. IV (Mar - Apr. 04), PP 0-07 Content Based Image Retreval Usng -D Dscrete Wavelet wth

More information

SLAM Summer School 2006 Practical 2: SLAM using Monocular Vision

SLAM Summer School 2006 Practical 2: SLAM using Monocular Vision SLAM Summer School 2006 Practcal 2: SLAM usng Monocular Vson Javer Cvera, Unversty of Zaragoza Andrew J. Davson, Imperal College London J.M.M Montel, Unversty of Zaragoza. josemar@unzar.es, jcvera@unzar.es,

More information

Simulation Based Analysis of FAST TCP using OMNET++

Simulation Based Analysis of FAST TCP using OMNET++ Smulaton Based Analyss of FAST TCP usng OMNET++ Umar ul Hassan 04030038@lums.edu.pk Md Term Report CS678 Topcs n Internet Research Sprng, 2006 Introducton Internet traffc s doublng roughly every 3 months

More information

High Utility Video Surveillance System on Public Transport using WiMAX technology

High Utility Video Surveillance System on Public Transport using WiMAX technology Edth Cowan Unversty Research Onlne ECU Publcatons Pre. 2011 2010 Hgh Utlty Vdeo Survellance System on Publc Transport usng WMAX technology Iftekhar Ahmad Edth Cowan Unversty Daryoush Habb Edth Cowan Unversty

More information

NAG Fortran Library Chapter Introduction. G10 Smoothing in Statistics

NAG Fortran Library Chapter Introduction. G10 Smoothing in Statistics Introducton G10 NAG Fortran Lbrary Chapter Introducton G10 Smoothng n Statstcs Contents 1 Scope of the Chapter... 2 2 Background to the Problems... 2 2.1 Smoothng Methods... 2 2.2 Smoothng Splnes and Regresson

More information

TECHNIQUE OF FORMATION HOMOGENEOUS SAMPLE SAME OBJECTS. Muradaliyev A.Z.

TECHNIQUE OF FORMATION HOMOGENEOUS SAMPLE SAME OBJECTS. Muradaliyev A.Z. TECHNIQUE OF FORMATION HOMOGENEOUS SAMPLE SAME OBJECTS Muradalyev AZ Azerbajan Scentfc-Research and Desgn-Prospectng Insttute of Energetc AZ1012, Ave HZardab-94 E-mal:aydn_murad@yahoocom Importance of

More information

Problem Set 3 Solutions

Problem Set 3 Solutions Introducton to Algorthms October 4, 2002 Massachusetts Insttute of Technology 6046J/18410J Professors Erk Demane and Shaf Goldwasser Handout 14 Problem Set 3 Solutons (Exercses were not to be turned n,

More information

Feature Reduction and Selection

Feature Reduction and Selection Feature Reducton and Selecton Dr. Shuang LIANG School of Software Engneerng TongJ Unversty Fall, 2012 Today s Topcs Introducton Problems of Dmensonalty Feature Reducton Statstc methods Prncpal Components

More information

Positive Semi-definite Programming Localization in Wireless Sensor Networks

Positive Semi-definite Programming Localization in Wireless Sensor Networks Postve Sem-defnte Programmng Localzaton n Wreless Sensor etworks Shengdong Xe 1,, Jn Wang, Aqun Hu 1, Yunl Gu, Jang Xu, 1 School of Informaton Scence and Engneerng, Southeast Unversty, 10096, anjng Computer

More information

Classifier Selection Based on Data Complexity Measures *

Classifier Selection Based on Data Complexity Measures * Classfer Selecton Based on Data Complexty Measures * Edth Hernández-Reyes, J.A. Carrasco-Ochoa, and J.Fco. Martínez-Trndad Natonal Insttute for Astrophyscs, Optcs and Electroncs, Lus Enrque Erro No.1 Sta.

More information

The Research of Ellipse Parameter Fitting Algorithm of Ultrasonic Imaging Logging in the Casing Hole

The Research of Ellipse Parameter Fitting Algorithm of Ultrasonic Imaging Logging in the Casing Hole Appled Mathematcs, 04, 5, 37-3 Publshed Onlne May 04 n ScRes. http://www.scrp.org/journal/am http://dx.do.org/0.436/am.04.584 The Research of Ellpse Parameter Fttng Algorthm of Ultrasonc Imagng Loggng

More information

Explicit Formulas and Efficient Algorithm for Moment Computation of Coupled RC Trees with Lumped and Distributed Elements

Explicit Formulas and Efficient Algorithm for Moment Computation of Coupled RC Trees with Lumped and Distributed Elements Explct Formulas and Effcent Algorthm for Moment Computaton of Coupled RC Trees wth Lumped and Dstrbuted Elements Qngan Yu and Ernest S.Kuh Electroncs Research Lab. Unv. of Calforna at Berkeley Berkeley

More information

Virtual Machine Migration based on Trust Measurement of Computer Node

Virtual Machine Migration based on Trust Measurement of Computer Node Appled Mechancs and Materals Onlne: 2014-04-04 ISSN: 1662-7482, Vols. 536-537, pp 678-682 do:10.4028/www.scentfc.net/amm.536-537.678 2014 Trans Tech Publcatons, Swtzerland Vrtual Machne Mgraton based on

More information

Subspace clustering. Clustering. Fundamental to all clustering techniques is the choice of distance measure between data points;

Subspace clustering. Clustering. Fundamental to all clustering techniques is the choice of distance measure between data points; Subspace clusterng Clusterng Fundamental to all clusterng technques s the choce of dstance measure between data ponts; D q ( ) ( ) 2 x x = x x, j k = 1 k jk Squared Eucldean dstance Assumpton: All features

More information

Research and Application of Fingerprint Recognition Based on MATLAB

Research and Application of Fingerprint Recognition Based on MATLAB Send Orders for Reprnts to reprnts@benthamscence.ae The Open Automaton and Control Systems Journal, 205, 7, 07-07 Open Access Research and Applcaton of Fngerprnt Recognton Based on MATLAB Nng Lu* Department

More information

3D vector computer graphics

3D vector computer graphics 3D vector computer graphcs Paolo Varagnolo: freelance engneer Padova Aprl 2016 Prvate Practce ----------------------------------- 1. Introducton Vector 3D model representaton n computer graphcs requres

More information

Parallel matrix-vector multiplication

Parallel matrix-vector multiplication Appendx A Parallel matrx-vector multplcaton The reduced transton matrx of the three-dmensonal cage model for gel electrophoress, descrbed n secton 3.2, becomes excessvely large for polymer lengths more

More information

3. CR parameters and Multi-Objective Fitness Function

3. CR parameters and Multi-Objective Fitness Function 3 CR parameters and Mult-objectve Ftness Functon 41 3. CR parameters and Mult-Objectve Ftness Functon 3.1. Introducton Cogntve rados dynamcally confgure the wreless communcaton system, whch takes beneft

More information

The Codesign Challenge

The Codesign Challenge ECE 4530 Codesgn Challenge Fall 2007 Hardware/Software Codesgn The Codesgn Challenge Objectves In the codesgn challenge, your task s to accelerate a gven software reference mplementaton as fast as possble.

More information

Problem Definitions and Evaluation Criteria for Computational Expensive Optimization

Problem Definitions and Evaluation Criteria for Computational Expensive Optimization Problem efntons and Evaluaton Crtera for Computatonal Expensve Optmzaton B. Lu 1, Q. Chen and Q. Zhang 3, J. J. Lang 4, P. N. Suganthan, B. Y. Qu 6 1 epartment of Computng, Glyndwr Unversty, UK Faclty

More information

Reducing Frame Rate for Object Tracking

Reducing Frame Rate for Object Tracking Reducng Frame Rate for Object Trackng Pavel Korshunov 1 and We Tsang Oo 2 1 Natonal Unversty of Sngapore, Sngapore 11977, pavelkor@comp.nus.edu.sg 2 Natonal Unversty of Sngapore, Sngapore 11977, oowt@comp.nus.edu.sg

More information

TOA localization for multipath and NLOS environment with virtual stations

TOA localization for multipath and NLOS environment with virtual stations Lu et al. EURASIP Journal on Wreless Communcatons and etworkng (07) 07:04 DOI 0.86/s3638-07-0896- RESEARCH TOA localzaton for multpath and LOS envronment wth vrtual statons Delang Lu, Yng Wang *, Peng

More information

THE THEORY OF REGIONALIZED VARIABLES

THE THEORY OF REGIONALIZED VARIABLES CHAPTER 4 THE THEORY OF REGIONALIZED VARIABLES 4.1 Introducton It s ponted out by Armstrong (1998 : 16) that Matheron (1963b), realzng the sgnfcance of the spatal aspect of geostatstcal data, coned the

More information

Fusion Performance Model for Distributed Tracking and Classification

Fusion Performance Model for Distributed Tracking and Classification Fuson Performance Model for Dstrbuted rackng and Classfcaton K.C. Chang and Yng Song Dept. of SEOR, School of I&E George Mason Unversty FAIRFAX, VA kchang@gmu.edu Martn Lggns Verdan Systems Dvson, Inc.

More information

Overview. Basic Setup [9] Motivation and Tasks. Modularization 2008/2/20 IMPROVED COVERAGE CONTROL USING ONLY LOCAL INFORMATION

Overview. Basic Setup [9] Motivation and Tasks. Modularization 2008/2/20 IMPROVED COVERAGE CONTROL USING ONLY LOCAL INFORMATION Overvew 2 IMPROVED COVERAGE CONTROL USING ONLY LOCAL INFORMATION Introducton Mult- Smulator MASIM Theoretcal Work and Smulaton Results Concluson Jay Wagenpfel, Adran Trachte Motvaton and Tasks Basc Setup

More information

Fast Computation of Shortest Path for Visiting Segments in the Plane

Fast Computation of Shortest Path for Visiting Segments in the Plane Send Orders for Reprnts to reprnts@benthamscence.ae 4 The Open Cybernetcs & Systemcs Journal, 04, 8, 4-9 Open Access Fast Computaton of Shortest Path for Vstng Segments n the Plane Ljuan Wang,, Bo Jang

More information

NUMERICAL SOLVING OPTIMAL CONTROL PROBLEMS BY THE METHOD OF VARIATIONS

NUMERICAL SOLVING OPTIMAL CONTROL PROBLEMS BY THE METHOD OF VARIATIONS ARPN Journal of Engneerng and Appled Scences 006-017 Asan Research Publshng Network (ARPN). All rghts reserved. NUMERICAL SOLVING OPTIMAL CONTROL PROBLEMS BY THE METHOD OF VARIATIONS Igor Grgoryev, Svetlana

More information

A New Approach For the Ranking of Fuzzy Sets With Different Heights

A New Approach For the Ranking of Fuzzy Sets With Different Heights New pproach For the ankng of Fuzzy Sets Wth Dfferent Heghts Pushpnder Sngh School of Mathematcs Computer pplcatons Thapar Unversty, Patala-7 00 Inda pushpndersnl@gmalcom STCT ankng of fuzzy sets plays

More information

Accounting for the Use of Different Length Scale Factors in x, y and z Directions

Accounting for the Use of Different Length Scale Factors in x, y and z Directions 1 Accountng for the Use of Dfferent Length Scale Factors n x, y and z Drectons Taha Soch (taha.soch@kcl.ac.uk) Imagng Scences & Bomedcal Engneerng, Kng s College London, The Rayne Insttute, St Thomas Hosptal,

More information

Lecture #15 Lecture Notes

Lecture #15 Lecture Notes Lecture #15 Lecture Notes The ocean water column s very much a 3-D spatal entt and we need to represent that structure n an economcal way to deal wth t n calculatons. We wll dscuss one way to do so, emprcal

More information

Assignment # 2. Farrukh Jabeen Algorithms 510 Assignment #2 Due Date: June 15, 2009.

Assignment # 2. Farrukh Jabeen Algorithms 510 Assignment #2 Due Date: June 15, 2009. Farrukh Jabeen Algorthms 51 Assgnment #2 Due Date: June 15, 29. Assgnment # 2 Chapter 3 Dscrete Fourer Transforms Implement the FFT for the DFT. Descrbed n sectons 3.1 and 3.2. Delverables: 1. Concse descrpton

More information

Evaluation of an Enhanced Scheme for High-level Nested Network Mobility

Evaluation of an Enhanced Scheme for High-level Nested Network Mobility IJCSNS Internatonal Journal of Computer Scence and Network Securty, VOL.15 No.10, October 2015 1 Evaluaton of an Enhanced Scheme for Hgh-level Nested Network Moblty Mohammed Babker Al Mohammed, Asha Hassan.

More information

Solving two-person zero-sum game by Matlab

Solving two-person zero-sum game by Matlab Appled Mechancs and Materals Onlne: 2011-02-02 ISSN: 1662-7482, Vols. 50-51, pp 262-265 do:10.4028/www.scentfc.net/amm.50-51.262 2011 Trans Tech Publcatons, Swtzerland Solvng two-person zero-sum game by

More information

Optimizing Document Scoring for Query Retrieval

Optimizing Document Scoring for Query Retrieval Optmzng Document Scorng for Query Retreval Brent Ellwen baellwe@cs.stanford.edu Abstract The goal of ths project was to automate the process of tunng a document query engne. Specfcally, I used machne learnng

More information

We Two Seismic Interference Attenuation Methods Based on Automatic Detection of Seismic Interference Moveout

We Two Seismic Interference Attenuation Methods Based on Automatic Detection of Seismic Interference Moveout We 14 15 Two Sesmc Interference Attenuaton Methods Based on Automatc Detecton of Sesmc Interference Moveout S. Jansen* (Unversty of Oslo), T. Elboth (CGG) & C. Sanchs (CGG) SUMMARY The need for effcent

More information

Available online at ScienceDirect. Procedia Environmental Sciences 26 (2015 )

Available online at   ScienceDirect. Procedia Environmental Sciences 26 (2015 ) Avalable onlne at www.scencedrect.com ScenceDrect Proceda Envronmental Scences 26 (2015 ) 109 114 Spatal Statstcs 2015: Emergng Patterns Calbratng a Geographcally Weghted Regresson Model wth Parameter-Specfc

More information

An Entropy-Based Approach to Integrated Information Needs Assessment

An Entropy-Based Approach to Integrated Information Needs Assessment Dstrbuton Statement A: Approved for publc release; dstrbuton s unlmted. An Entropy-Based Approach to ntegrated nformaton Needs Assessment June 8, 2004 Wllam J. Farrell Lockheed Martn Advanced Technology

More information

Network Coding as a Dynamical System

Network Coding as a Dynamical System Network Codng as a Dynamcal System Narayan B. Mandayam IEEE Dstngushed Lecture (jont work wth Dan Zhang and a Su) Department of Electrcal and Computer Engneerng Rutgers Unversty Outlne. Introducton 2.

More information

Analysis of Collaborative Distributed Admission Control in x Networks

Analysis of Collaborative Distributed Admission Control in x Networks 1 Analyss of Collaboratve Dstrbuted Admsson Control n 82.11x Networks Thnh Nguyen, Member, IEEE, Ken Nguyen, Member, IEEE, Lnha He, Member, IEEE, Abstract Wth the recent surge of wreless home networks,

More information

Module Management Tool in Software Development Organizations

Module Management Tool in Software Development Organizations Journal of Computer Scence (5): 8-, 7 ISSN 59-66 7 Scence Publcatons Management Tool n Software Development Organzatons Ahmad A. Al-Rababah and Mohammad A. Al-Rababah Faculty of IT, Al-Ahlyyah Amman Unversty,

More information

A mathematical programming approach to the analysis, design and scheduling of offshore oilfields

A mathematical programming approach to the analysis, design and scheduling of offshore oilfields 17 th European Symposum on Computer Aded Process Engneerng ESCAPE17 V. Plesu and P.S. Agach (Edtors) 2007 Elsever B.V. All rghts reserved. 1 A mathematcal programmng approach to the analyss, desgn and

More information

A Five-Point Subdivision Scheme with Two Parameters and a Four-Point Shape-Preserving Scheme

A Five-Point Subdivision Scheme with Two Parameters and a Four-Point Shape-Preserving Scheme Mathematcal and Computatonal Applcatons Artcle A Fve-Pont Subdvson Scheme wth Two Parameters and a Four-Pont Shape-Preservng Scheme Jeqng Tan,2, Bo Wang, * and Jun Sh School of Mathematcs, Hefe Unversty

More information

Performance Analysis of the IEEE MAC Protocol over a WLAN with Capture Effect

Performance Analysis of the IEEE MAC Protocol over a WLAN with Capture Effect Vol. IPSJ Dgtal Courer Nov. 25 Regular Paper Performance Analyss of the IEEE 82. MAC Protocol over a WLAN wth Capture Effect Xaolong L, and Qng-An Zeng, In ths paper, we use a dscrete Markov chan model

More information

For instance, ; the five basic number-sets are increasingly more n A B & B A A = B (1)

For instance, ; the five basic number-sets are increasingly more n A B & B A A = B (1) Secton 1.2 Subsets and the Boolean operatons on sets If every element of the set A s an element of the set B, we say that A s a subset of B, or that A s contaned n B, or that B contans A, and we wrte A

More information

BioTechnology. An Indian Journal FULL PAPER. Trade Science Inc.

BioTechnology. An Indian Journal FULL PAPER. Trade Science Inc. [Type text] [Type text] [Type text] ISSN : 0974-74 Volume 0 Issue BoTechnology 04 An Indan Journal FULL PAPER BTAIJ 0() 04 [684-689] Revew on Chna s sports ndustry fnancng market based on market -orented

More information

Constructing Minimum Connected Dominating Set: Algorithmic approach

Constructing Minimum Connected Dominating Set: Algorithmic approach Constructng Mnmum Connected Domnatng Set: Algorthmc approach G.N. Puroht and Usha Sharma Centre for Mathematcal Scences, Banasthal Unversty, Rajasthan 304022 usha.sharma94@yahoo.com Abstract: Connected

More information

SVM-based Learning for Multiple Model Estimation

SVM-based Learning for Multiple Model Estimation SVM-based Learnng for Multple Model Estmaton Vladmr Cherkassky and Yunqan Ma Department of Electrcal and Computer Engneerng Unversty of Mnnesota Mnneapols, MN 55455 {cherkass,myq}@ece.umn.edu Abstract:

More information

A Fast Visual Tracking Algorithm Based on Circle Pixels Matching

A Fast Visual Tracking Algorithm Based on Circle Pixels Matching A Fast Vsual Trackng Algorthm Based on Crcle Pxels Matchng Zhqang Hou hou_zhq@sohu.com Chongzhao Han czhan@mal.xjtu.edu.cn Ln Zheng Abstract: A fast vsual trackng algorthm based on crcle pxels matchng

More information

Analysis of Continuous Beams in General

Analysis of Continuous Beams in General Analyss of Contnuous Beams n General Contnuous beams consdered here are prsmatc, rgdly connected to each beam segment and supported at varous ponts along the beam. onts are selected at ponts of support,

More information

Performance analysis of distributed cluster-based MAC protocol for multiuser MIMO wireless networks

Performance analysis of distributed cluster-based MAC protocol for multiuser MIMO wireless networks RESEARCH Open Access Performance analyss of dstrbuted cluster-based MAC protocol for multuser MIMO wreless networks Azadeh Ettefagh *, Marc Kuhn, Celal Eşl and Armn Wttneben Abstract It s known that multuser

More information

Resource and Virtual Function Status Monitoring in Network Function Virtualization Environment

Resource and Virtual Function Status Monitoring in Network Function Virtualization Environment Journal of Physcs: Conference Seres PAPER OPEN ACCESS Resource and Vrtual Functon Status Montorng n Network Functon Vrtualzaton Envronment To cte ths artcle: MS Ha et al 2018 J. Phys.: Conf. Ser. 1087

More information

Power Adjustment and Scheduling in OFDMA Femtocell Networks

Power Adjustment and Scheduling in OFDMA Femtocell Networks Power Adjustment and Schedulng n OFDMA Femtocell Networks Mchael Ln CSE Department Pennsylvana State Unversty Emal:moln@cse.psu.edu Novella Bartoln Computer Scence Department Sapenza Unversty, Italy Emal:novella@d.unroma1.t

More information

A Fast Content-Based Multimedia Retrieval Technique Using Compressed Data

A Fast Content-Based Multimedia Retrieval Technique Using Compressed Data A Fast Content-Based Multmeda Retreval Technque Usng Compressed Data Borko Furht and Pornvt Saksobhavvat NSF Multmeda Laboratory Florda Atlantc Unversty, Boca Raton, Florda 3343 ABSTRACT In ths paper,

More information

3D Virtual Eyeglass Frames Modeling from Multiple Camera Image Data Based on the GFFD Deformation Method

3D Virtual Eyeglass Frames Modeling from Multiple Camera Image Data Based on the GFFD Deformation Method NICOGRAPH Internatonal 2012, pp. 114-119 3D Vrtual Eyeglass Frames Modelng from Multple Camera Image Data Based on the GFFD Deformaton Method Norak Tamura, Somsangouane Sngthemphone and Katsuhro Ktama

More information

The Shortest Path of Touring Lines given in the Plane

The Shortest Path of Touring Lines given in the Plane Send Orders for Reprnts to reprnts@benthamscence.ae 262 The Open Cybernetcs & Systemcs Journal, 2015, 9, 262-267 The Shortest Path of Tourng Lnes gven n the Plane Open Access Ljuan Wang 1,2, Dandan He

More information

A Post Randomization Framework for Privacy-Preserving Bayesian. Network Parameter Learning

A Post Randomization Framework for Privacy-Preserving Bayesian. Network Parameter Learning A Post Randomzaton Framework for Prvacy-Preservng Bayesan Network Parameter Learnng JIANJIE MA K.SIVAKUMAR School Electrcal Engneerng and Computer Scence, Washngton State Unversty Pullman, WA. 9964-75

More information

A Topology-aware Random Walk

A Topology-aware Random Walk A Topology-aware Random Walk Inkwan Yu, Rchard Newman Dept. of CISE, Unversty of Florda, Ganesvlle, Florda, USA Abstract When a graph can be decomposed nto clusters of well connected subgraphs, t s possble

More information

Analysis of Malaysian Wind Direction Data Using ORIANA

Analysis of Malaysian Wind Direction Data Using ORIANA Modern Appled Scence March, 29 Analyss of Malaysan Wnd Drecton Data Usng ORIANA St Fatmah Hassan (Correspondng author) Centre for Foundaton Studes n Scence Unversty of Malaya, 63 Kuala Lumpur, Malaysa

More information

MULTISPECTRAL IMAGES CLASSIFICATION BASED ON KLT AND ATR AUTOMATIC TARGET RECOGNITION

MULTISPECTRAL IMAGES CLASSIFICATION BASED ON KLT AND ATR AUTOMATIC TARGET RECOGNITION MULTISPECTRAL IMAGES CLASSIFICATION BASED ON KLT AND ATR AUTOMATIC TARGET RECOGNITION Paulo Quntlano 1 & Antono Santa-Rosa 1 Federal Polce Department, Brasla, Brazl. E-mals: quntlano.pqs@dpf.gov.br and

More information

Load Balancing for Hex-Cell Interconnection Network

Load Balancing for Hex-Cell Interconnection Network Int. J. Communcatons, Network and System Scences,,, - Publshed Onlne Aprl n ScRes. http://www.scrp.org/journal/jcns http://dx.do.org/./jcns.. Load Balancng for Hex-Cell Interconnecton Network Saher Manaseer,

More information

Smoothing Spline ANOVA for variable screening

Smoothing Spline ANOVA for variable screening Smoothng Splne ANOVA for varable screenng a useful tool for metamodels tranng and mult-objectve optmzaton L. Rcco, E. Rgon, A. Turco Outlne RSM Introducton Possble couplng Test case MOO MOO wth Game Theory

More information

DESIGNING TRANSMISSION SCHEDULES FOR WIRELESS AD HOC NETWORKS TO MAXIMIZE NETWORK THROUGHPUT

DESIGNING TRANSMISSION SCHEDULES FOR WIRELESS AD HOC NETWORKS TO MAXIMIZE NETWORK THROUGHPUT DESIGNING TRANSMISSION SCHEDULES FOR WIRELESS AD HOC NETWORKS TO MAXIMIZE NETWORK THROUGHPUT Bran J. Wolf, Joseph L. Hammond, and Harlan B. Russell Dept. of Electrcal and Computer Engneerng, Clemson Unversty,

More information

Electrical analysis of light-weight, triangular weave reflector antennas

Electrical analysis of light-weight, triangular weave reflector antennas Electrcal analyss of lght-weght, trangular weave reflector antennas Knud Pontoppdan TICRA Laederstraede 34 DK-121 Copenhagen K Denmark Emal: kp@tcra.com INTRODUCTION The new lght-weght reflector antenna

More information

CS 534: Computer Vision Model Fitting

CS 534: Computer Vision Model Fitting CS 534: Computer Vson Model Fttng Sprng 004 Ahmed Elgammal Dept of Computer Scence CS 534 Model Fttng - 1 Outlnes Model fttng s mportant Least-squares fttng Maxmum lkelhood estmaton MAP estmaton Robust

More information

IP Camera Configuration Software Instruction Manual

IP Camera Configuration Software Instruction Manual IP Camera 9483 - Confguraton Software Instructon Manual VBD 612-4 (10.14) Dear Customer, Wth your purchase of ths IP Camera, you have chosen a qualty product manufactured by RADEMACHER. Thank you for the

More information

Determining the Optimal Bandwidth Based on Multi-criterion Fusion

Determining the Optimal Bandwidth Based on Multi-criterion Fusion Proceedngs of 01 4th Internatonal Conference on Machne Learnng and Computng IPCSIT vol. 5 (01) (01) IACSIT Press, Sngapore Determnng the Optmal Bandwdth Based on Mult-crteron Fuson Ha-L Lang 1+, Xan-Mn

More information

Hermite Splines in Lie Groups as Products of Geodesics

Hermite Splines in Lie Groups as Products of Geodesics Hermte Splnes n Le Groups as Products of Geodescs Ethan Eade Updated May 28, 2017 1 Introducton 1.1 Goal Ths document defnes a curve n the Le group G parametrzed by tme and by structural parameters n the

More information

Synthesizer 1.0. User s Guide. A Varying Coefficient Meta. nalytic Tool. Z. Krizan Employing Microsoft Excel 2007

Synthesizer 1.0. User s Guide. A Varying Coefficient Meta. nalytic Tool. Z. Krizan Employing Microsoft Excel 2007 Syntheszer 1.0 A Varyng Coeffcent Meta Meta-Analytc nalytc Tool Employng Mcrosoft Excel 007.38.17.5 User s Gude Z. Krzan 009 Table of Contents 1. Introducton and Acknowledgments 3. Operatonal Functons

More information

A Statistical Model Selection Strategy Applied to Neural Networks

A Statistical Model Selection Strategy Applied to Neural Networks A Statstcal Model Selecton Strategy Appled to Neural Networks Joaquín Pzarro Elsa Guerrero Pedro L. Galndo joaqun.pzarro@uca.es elsa.guerrero@uca.es pedro.galndo@uca.es Dpto Lenguajes y Sstemas Informátcos

More information

Unsupervised Learning and Clustering

Unsupervised Learning and Clustering Unsupervsed Learnng and Clusterng Why consder unlabeled samples?. Collectng and labelng large set of samples s costly Gettng recorded speech s free, labelng s tme consumng 2. Classfer could be desgned

More information

Modeling Local Uncertainty accounting for Uncertainty in the Data

Modeling Local Uncertainty accounting for Uncertainty in the Data Modelng Local Uncertanty accontng for Uncertanty n the Data Olena Babak and Clayton V Detsch Consder the problem of estmaton at an nsampled locaton sng srrondng samples The standard approach to ths problem

More information

Chapter 6 Programmng the fnte element method Inow turn to the man subject of ths book: The mplementaton of the fnte element algorthm n computer programs. In order to make my dscusson as straghtforward

More information

Kiran Joy, International Journal of Advanced Engineering Technology E-ISSN

Kiran Joy, International Journal of Advanced Engineering Technology E-ISSN Kran oy, nternatonal ournal of Advanced Engneerng Technology E-SS 0976-3945 nt Adv Engg Tech/Vol. V/ssue /Aprl-une,04/9-95 Research Paper DETERMATO O RADATVE VEW ACTOR WTOUT COSDERG TE SADOWG EECT Kran

More information

F Geometric Mean Graphs

F Geometric Mean Graphs Avalable at http://pvamu.edu/aam Appl. Appl. Math. ISSN: 1932-9466 Vol. 10, Issue 2 (December 2015), pp. 937-952 Applcatons and Appled Mathematcs: An Internatonal Journal (AAM) F Geometrc Mean Graphs A.

More information

On the Exact Analysis of Bluetooth Scheduling Algorithms

On the Exact Analysis of Bluetooth Scheduling Algorithms On the Exact Analyss of Bluetooth Schedulng Algorth Gl Zussman Dept. of Electrcal Engneerng Technon IIT Hafa 3000, Israel glz@tx.technon.ac.l Ur Yechal Dept. of Statstcs and Operatons Research School of

More information

Tsinghua University at TAC 2009: Summarizing Multi-documents by Information Distance

Tsinghua University at TAC 2009: Summarizing Multi-documents by Information Distance Tsnghua Unversty at TAC 2009: Summarzng Mult-documents by Informaton Dstance Chong Long, Mnle Huang, Xaoyan Zhu State Key Laboratory of Intellgent Technology and Systems, Tsnghua Natonal Laboratory for

More information