Performance characterization of CSMA/CA adapted multi-user MIMO aware MAC in WLANs

Size: px
Start display at page:

Download "Performance characterization of CSMA/CA adapted multi-user MIMO aware MAC in WLANs"

Transcription

1 Thp et l. EURASIP Journl on Wireless Communitions n Networking, :4 RESEARCH Open Aess Performne hrteriztion of CSMA/CA pte multi-user MIMO wre MAC in WLANs Anup Thp, Suoh Pusini n Seokjoo Shin * Astrt To relize the multi-user multiple input multiple output (MIMO) vntge over WLANs, it requires signifint hnges in the MAC protool. Either the ominnt MAC protool rrier sense multiple ess/ollision voine (CSMA/CA) nees to e reple y novel multi-user MIMO wre MAC protool or it shoul e upgre into multi-user MIMO wre CSMA/CA. Nevertheless, the simplest pproh woul e upgring the CSMA/CA. Simple moifitions in the ontrol pkets formt n/or the hnnel ess mehnism n upgre CSMA/CA into simple, yet prtile, multi-user MIMO wre MAC protool. By utilizing onvenient hnges, severl moifition pprohes n e provisione for this purpose. Hene, it is importnt to unerstn their performne enefits n tre-offs. In this rtile, we isuss some of suh moifition pprohes tht est represent the possile moifitions. We provie their etil performne nlysis se on nlytil moeling n erive expressions in terms of throughput n ely. We lso erive expressions for hievle performne n present their performne limits too. Keywors: MIMO wre MAC, multi-user MIMO wre CSMA/CA, multi-user sptil multiplexing, WLAN. Introution Multiple input multiple output (MIMO) is rio ommunition tehnology tht uses multiple ntenn elements t oth the trnsmitting n the reeiving ens either to oost up hnnel pity or to ttin trnsmission reliility. Wireless networks eploye with the MIMO system n utilize these fetures y employing sptil multiplexing n/or sptil iversity [,]. Sptil multiplexing is MIMO trnsmission tehnique tht trnsmits multiple inepenent t strems onurrently from multiple ntenn elements so tht eh ntenn element n e logilly trete s seprte hnnel. Wheres, sptil iversity is MIMO trnsmission tehnique tht trnsmits the sme t strem from multiple ntenn elements so tht they oul e proesse for orretly eoing the esire informtion. Reently, the MIMO system hs gine inrese interest. Most of the existing wireless networks re pying onsierle ttention towr MIMO implementtion. They re expeting to meet their ever inresing * Corresponene: sjshin@hosun..kr Deprtment of Computer Engineering, Chosun University, Gwngju, Repuli of Kore pity emn (mostly from higher t rte servies like vieo teleonferening, multimei streming, et.) y exploiting MIMO offere spetrl effiieny t the physil lyer (PHY) [,4]. However, from network point of view, only n inrese pity in one speifi lyer is not suffiient to improve n overll network performne. Moreover, eh lyer must e wre of the hnges tht hve ourre in the onjugte lyers n their pplie protools must e smrt enough to relize the resulting effets positively [5]. Hene, even though the MIMO implementtion n inrese the PHY pity, suh inepenently enhne pity nnot e trnslte esily into MAC lyer pity gin unless n pplie MAC protool is lso MIMO wre. Simply, MIMO wre MAC protool n e viewe s protool tht possesses the pility to pply some speil mesures t the MAC lyer, sujet to mximizing the use of MIMO pity t the PHY. Suh mesures re ruil to ress importnt MAC lyer s issues like MIMO funtionlities informtion exhnge, sheuling of the MIMO enhne nwith, time synhroniztion, n the error free ontrol pkets trnsmission. In ition, it is lso eqully importnt to ensure kwr omptiility when pplying suh Thp et l; liensee Springer. This is n Open Aess rtile istriute uner the terms of the Cretive Commons Attriution Liense ( whih permits unrestrite use, istriution, n reproution in ny meium, provie the originl work is properly ite.

2 Thp et l. EURASIP Journl on Wireless Communitions n Networking, :4 Pge of mesures to filitte oexistene of legy evies with only single input single output pility. Applying suh mesures is reltively esier in networks with entrlize ontrol rhiteture like ellulr networks where highly sophistite entrlize ministrtion unit n govern the meium ess proeure n tke ontrol over resoure llotion n utiliztion [6]. However, pplying suh mesures is more hllenging in se of istriute wireless networks like WLANs [7], where meium ess is ontrolle y n synhronous rnom ess mehnism known s rrier sense multiple ess/ollision voine (CSMA/CA). Relizing the vntges of the MIMO system over existing WLANs requires signifint hnges in its MAC protool. Either its ominnt MAC protool CSMA/CA nees to e reple y novel MIMO wre MAC protool or it shoul e upgre into MIMO wre CSMA/CA. Nevertheless, the simplest pproh woul e upgring the wiely eploye MAC protool. An ppropritely moifie ontrol pkets exhnge provisione with n equtely rrie out hnnel ess mehnism se on CSMA/CA request to sen/ler to sen (RTS/CTS) ess sheme n upgre it into simple yet prtile MIMO wre MAC protool. Some of the prior reserhes [8-] vise suh moifitions n emonstrte enhne performne too. With proper moifition hnling, oth the single user sptil multiplexing se MIMO (SU-MIMO) n the multiuser sptil multiplexing se MIMO (MU- MIMO) trnsmissions n e supporte with MIMO wre CSMA/CA. Here, SU-MIMO refers to point-topoint MIMO ommunition where trnsmitter trnsmits multiple inepenent t strems estine for single reeiver. Wheres, MU-MIMO refers to point-tomultipoint ommunition where trnsmitter trnsmits multiple inepenent t strems eh estine for ifferent reeiver. As SU-MIMO is point-to-point ommunition, in generl, it n e oneive tht SU-MIMO wre CSMA/CA follows the sme hnnel ess mehnism s tht of legy CSMA/CA with exhnge of slightly moifie ontrol pkets only. Thus, it n e envisione tht throughput inreses pproximtely in the sme fol oring to the numer of ntenn elements in use; leving the ely onstnt. But the sme oes not pply for MU-MIMO. As MU-MIMO is point-tomultipoint ommunition, it nees to exhnge higher numer of the extene ontrol pkets uring negotition with multiple reeivers. If ontrol pkets re trnsmitte serilly, one fter one, to voi risk of ontrol pkets orruption n to sve ost n omplexity from signl proessing in MU-MIMO, it les to hevy overhe in time n ultimtely ereses the network performne. If the ontrol pkets re trnsmitte simultneously to erese overhe s effet, it les to higher ost n omplexity in signl proessing n my lso inrese the risk of ontrol pkets orruption. Hene, MU- MIMO fils to give similr performne to tht of SU- MIMO while mintining the sme level of network ost n omplexity. Nevertheless, noteworthy point is tht though SU- MIMO seems to e esirle, it is not lwys pplile. Owing to vrious network hrteristis like vrile hnnel lo, onstrint of kwr omptiility, n ely sensitivity, SU-MIMO nnot lwys leverge linerly enhne performne [8-]. For exmple, unless ll the queues of orresponing ntenn elements hve enough pkets to sen, its not worth pplying SU- MIMO. On the other hn, SU-MIMO implementtion is worthwhile only when ntenn elements re evenly istriute in trnsmitter n reeiver. Similrly, PHY hrteristis like hnnel rnk loss n ntenn orreltion effets lso ply n verse role in SU-MIMO performne []. Hene, in mny ses, SU-MIMO n prevent from fully utilizing the ville MIMO pity. In suh senrios, MU-MIMO woul e preferle. However, lthough its high prtil importne hs een shown oth theoretilly n prtilly [-4], MU-MIMO hs not een stnrize yet in WLANs stnr. While SU-MIMO hs lrey een stnrize in IEEE 8.n [5]. IEEE 8.n hs lso provisione moifie CSMA/ CA s its MIMO wre MAC protool. A ontrol frme lle ontrol wrpper frme hs een efine for this purpose suh tht the ontrol pkets re wrppe within the ontrol wrpper frme n then exhnge etween the trnsmitter n the reeiver [6]. On the other hn, s few of the unresolve mtters relte to MAC lyer issues re still uner onsiertion, MU- MIMO is yet to e stnrize. For instne, issues relte to hnnel ess proeure, sheuling mehnism, hnnel stte feek tehniques, et., re still uner ontempltion. Even so, euse of its superiority in vrious network onitions, MU-MIMO n e expete to eome one of the si essentils of the future wireless networks n their stnrs. For exmple, IEEE 8. Tsk Group is now working to exten IEEE 8.n like pilities in the 5 GHz spetrum with wier hnnels, etter moultion shemes, n MU-MIMO inlusion [7,8]. As mentione erlier, moifition in CSMA/CA is simplest pproh towr MU-MIMO wre MAC protool. The moifition in CSMA/CA is require to omplish hnnel stte informtion (CSI) of ll the intene reeivers t the trnsmitter suh tht trnsmitter n know out the interferene sitution of its

3 Thp et l. EURASIP Journl on Wireless Communitions n Networking, :4 Pge of reeivers n pply the interferene limite preoing, lso known s interferene limite t preproessing, prior to the t trnsmission in suh wy tht ousers interferene n e mitigte t the reeiver [9-]. Bsilly, CSI n e omplishe from three ifferent wys: perfet feek with full hnnel informtion, prtil feek with limite hnnel informtion, n fully lin feek with no hnnel informtion. Oviously, se on these mehnisms, severl moifition shemes in CSMA/CA n e provisione to support MU-MIMO. Hene, it is importnt to unerstn their performne enefits n tre-offs. Similrly, s CSMA/CA is often ritiize for its oune performne (ourrene of throughput limit n ely limit euse of the effets of inispensle overhe ssoite with its funmentl opertion) [], unerstning their hievle performne, i.e. performne tht n e hieve on the est se senrio, n their performne limits re lso importnt. Therefore, the performne hrteriztion (stuy, nlysis, n omprison) of the moifition pprohes fter employing ove mentione feek mehnisms is the mtter of interest in this rtile. In this rtile, we investigte three si types of moifition pprohes tht est represent the possile moifitions, nme s: () CSI feek from serilly trnsmitte CTS pkets, () CSI preition from serilly trnsmitte CTS pkets, n () CSI preition from simultneously trnsmitte CTS pkets (etil in Setion ). Along with the isussion on these pprohes, we provie their etile performne nlysis, se on the nlytil moeling n erive expressions, in terms of throughput n ely. Similrly, we lso erive expressions for hievle performne n therey present their performne limits too.. Relte works MIMO wre CSMA/CA is simple pproh towr MIMO ptility in WLANs. As mentione erlier, there hs een some prior reserh [8-,] etiling some moifitions in the CSMA/CA to mke it MIMO wre CSMA/CA. Even though they hve signifintly ifferent moifition pprohes, ontrol pkets formts, n hnnel ess mehnisms n lthough they hve een propose s new MIMO wre MAC protools, it will not e n unersttement to mention thtsillytheyrelyonthecsma/casemac uner RTS/CTS ess mehnism. In [8], istriute MU-MIMO MAC protool using lekge se preoing sheme from [4] hs een propose. It hs use moifie RTS n CTS ontrol pkets exhnge with n oringly moifie hnnel ess mehnism to hve negotition out the ntenn weights etween trnsmitter n reeivers. Along with simultion results, they [8] presente n nlytil moel to stuy the performne of the propose MAC protool. Performnes were nlyze in terms of mximum numer of users tht n e supporte in the stle network n the orresponing network throughput, onsiering symmetril trnsmission rtes of uplink n ownlink, in terms of trffi intensity n trffi rrivl rte, respetively [8]. However, in [8], ely nlysis hs not een overe. In [9], MIMO-DCF MAC, using moifie ontrol pkets n hnnel ess mehnism to exhnge the ntenn seletion informtion for oth the SU-MIMO n the MU-MIMO in A-Ho WLANs, hs een propose. In generl, [9] is se on the ntenn numer seletion y the reeiver fter reeiving the propose ntenn it mp in n extene RTS pket from trnsmitter. The rtile presente the simultion results in terms of rrie lo versus offere lo n pket loss rtio onsiering hot-spot senrio with ownlink onnetions from ess point (AP) to few numers of rnomly lote noes. Similrly in [], MU-MIMO MAC terme s multiple RTS hnshke MAC (MRH-MAC) with moifie hnnel ess mehnism hs een presente. In [], sme tive pir of noes hnshke multiple times with exhnge of RTS-CTS pkets in orer to hoose the most suitle trnsmitting ntenns for t trnsmission. In [] lso, threshol-seletive multiuser ownlink MAC hs een presente. In this sheme, signl-to-noise rtio (SNIR) threshol is efine y the AP n is onsiere known to the users. The trnsmission sequene is ivie into ontention phse, t phse, n ACK phse. When RTS frme is trnsmitte, multiple users n prtiipte in the ontention phse if their mximum SNIR exees the preefine threshol. Depening upon the outome of the ontention phse inepenent t strems re trnsmitte to the suessful users. IEEE 8. is lso in the proess of olleting speifi proposls n its rtifition for MU-MIMO inlusion. In prtiulr, the reently ville menment [8] hs propose some moifitions on physil lyer onvergene protool (PLCP) heer n ontrol pkets formt. PLCP heer will inite the moe of trnsmission (SU-MIMO or MU-MIMO) while ontrol pket will inite the group of reeivers selete for MU-MIMO trnsmission y ssigning ommon group ientity. As mjor moifition is require t the MAC lyer to smooth operting rules in wien hnnels uring vrile network onition, IEEE 8. is on the proess to moify the ontrol pkets formt on suh wy tht it oul inite trffi types, pket length, supporte nwith, n ping sequenes. The very high throughput (VHT) ontrol fiel will e present in

4 Thp et l. EURASIP Journl on Wireless Communitions n Networking, :4 Pge 4 of ontrol wrpper frme n expliit souning n ompresse mtrix feek will e use.. MIMO wre CSMA/CA for MU-MIMO In CSMA/CA, noe with pket to sen first monitors the hnnel tivity. If the hnnel is foun to e ile for n intervl tht exees the istriute inter frme spe (DIFS), the noe ontinues its trnsmission. Otherwise, the noe wits until the hnnel eomes ile for the DIFS perio n then omputes rnom koff time for whih it will efer its trnsmission. The efer time is prout of the selete koff vlue n slot urtion. After the meium eomes ile for DIFS perio, noes erement their koff timer until the hnnel eomes usy gin or the timer rehes zero. If the timer hs not rehe zero n the meium eomes usy, the noe freezes its timer. When the timer is finlly eremente to zero, the noe trnsmits its pket. If two or more noes erement to zero t the sme time, ollision ours. In CSMA/CA RTS/CTS ess mehnism, when noe monitors the hnnel tivity n fins it ile for more thn the DIFS, noe sens speil reservtion pket lle RTS, n the intene reeiving noe will respon with CTS fter short inter frme spe (). Other noes whih overher RTS n CTS upte their network llotion vetor (NAV) oringly. The trnsmitting noe is llowe to trnsmit its pket only if the CTS pket is reeive orretly. MIMO wre CSMA/CA is n extene version of the RTS/CTS mehnism. Although the min purpose of the RTS/CTS mehnism is to reserve hnnel for urtion of pket trnsmission with exhnge of hnnel reservtion prmeters, it n lso serve to exhnge informtion relte to MIMO funtionlities fter pplying frme extension. The extene version of the ontrol pkets ppen new fiel or heer eite for mnging the MIMO funtionlities while keeping the rest of the fiels unhnge. In MU-MIMO, trnsmitting noe trnsmits X inepenent prllel t strems from X trnsmit ntenn elements to K noes (X K), K X y pplying interferene limite preoing. Hene, in MU-MIMO wre CSMA/CA, when the trnsmitting noe hs pkets to sen it first quires the hnnel using the CSMA/CA stnr rule. After quiring the hnnel, it trnsmits n extene RTS (M-RTS) pket, s shown in Figure, expliitly inluing the informtion out K reeivers resses, serilly. All other fiels ontin the regulr informtion s they o in legy RTS pket [7]. After time intervl, long with other regulr informtion, reeiving noes whih re rey to reeive reply with iniviul extene CTS (M-CTS) pket ontining informtion tht oul e proesse to hieve CSI. The M-CTS n extene knowlegement (M-ACK) pket exhnge mehnisms n the frme formts re ifferent for ifferent moifition pprohes. For our investigte pprohes, it is isusse in etil elow... CSI feek from serilly trnsmitte CTS pkets (CSIF-STCP) In this moifition pproh, RTS/CTS hnshke n e moifie to llow their reeiver to feek CSI orresponing to reeive signl using M-CTS pket, s shown in Figure. All the reeivers estimte their hnnel from reeive M-RTS pket n, long with other regulr informtion, feek tht vlue to trnsmitter y sening iniviul M-CTS pket fter eh time intervl, s shown in Figure for ( MU- MIMO), oring to their seril orer ssigne in M- RTS pket. Bse on the informtion reeive from M- CTS pkets, the trnsmitting noe selets the est ntenn element orresponing to eh reeiver noe n then pplies pproprite preoing. Similrly fter eh time intervl, reeiver noes suessfully reeiving the t strem knowlege the reeption vi M-ACK, serilly. Therefore, this metho n e onsiere s the perfet CSI feek metho. This is the simplest n the most effetive metho espite the introue overhe resulting from trnsmission of multiple extene M-CTS n M-ACK pkets serilly. This mehnism, however, reues the ost n omplexity in signl proessing n lso minimizes the risk of ontrol pkets orruption... CSI preition from serilly trnsmitte CTS pkets (CSIP-STCP) In this moifition pproh, ifferent from the CSIF- STCP mehnism, the M-CTS pket oes not expliitly ontin the CSI, inste reeivers n sen M-CTS pket in the sme orer s in CSIF-STCP, i.e. serilly fter eh time intervl, ut with preefine pilot symols inlue in the PHY heer. From the enlose pilot symol, with pproprite signl proessing, the trnsmitter noe n preit the CSI orresponing to the respetive reeiver noe se on reiproity priniple, i.e. in the ssumption of sme hnnel hrteristis in uplink n ownlink in ontiguous trnsmission with TDMA. This metho n e onsiere s semi lin hnnel stte estimtion metho s limite informtion is provie y preefine pilot symols. After preiting CSIs, the trnsmitter n pply pproprite preoing n then sens the t strems. M-ACK pkets re lso trnsmitte in the sme wy s in CSIF-STCP, i.e. serilly. Hene, s whole, this mehnism reues the overhe tht results from feek its in spite of moerte rise in the preition uren. Even so, sine M-CTS pkets re trnsmitte serilly, there

5 Thp et l. EURASIP Journl on Wireless Communitions n Networking, :4 Pge 5 of Frme Control Durtion K*Reeiver Aress Trnsmitter Aress Frme Chek ytes ytes K x 6 ytes 6 ytes 4 ytes Figure M-RTS ontrol pket formt. M-RTS Frme is less hne of pkets eing orrupte n in most of the ses preition ws foun to work quite well... CSI preition from simultneously trnsmitte CTS pkets (CSIP-SmTCP) In this moifition pproh, ifferent from CSIF-STCP n CSIP-STCP, M-CTS pkets re not trnsmitte serilly. Inste, they re trnsmitte simultneously fter time intervl y ll the reeiver noes inluing the preefine pilot symol in the PHY heer s in CSIP- STCP. This metho n e onsiere s full lin hnnel stte estimtion metho espite the inlusion of the preefine pilot symol. As the reeiver noes trnsmit in sme time n frequeny omin, eoing the informtion ompletely omes s lin. Nevertheless, employing ville ntenn elements n the pproprite signl proessing, the trnsmitter noe n preit the CSI of ll the reeiver noes n n pply pproprite preoing. The M-ACK pkets re lso trnsmitte in the sme wy. The M-CTS frme formt n the ess mehnism for this pproh hve een shown in Figures 4 n 5, respetively. This mehnism reues the overhe tht oul result from trnsmission of feek its s in CSIF-STCP n overhe tht oul result from serilly trnsmitte M-CTS pkets s in CSIF-STCP n CSIP-STCP. However, this mehnism s higher ost n omplexity in signl proessing n my lso rise the risk of ontrol pkets orruption. 4. Numeril nlysis 4.. Mthemtil nlysis for hievle performne Ahievle mximum performne of system is the performne tht the system n eliver in the est se senrio. In orer to emulte the est se in wireless network, we ie y the following ssumptions: there is only one tive trnsmitting noe whih lwys hs pkets to sen, n the hnnel is error free. Consiering the forementione ssumptions, we nlyze the hievle mximum performne of our investigte pprohes in terms of throughput n ely. Herefter, we represent CSIF - STCP, CSIP - STCP, n CSIP - SmTCP s M,M, n M, respetively Ahievle mximum throughput Throughput n e efine s the rte of suessful trnsmission of the t pkets in the hnnel. Thus, mximum hievle throughput, S mx,forthemu- MIMO n e expresse s K S mx j= = E[P], () T s where E[P] isthepylosizeinitsnt s is the time for suessfully trnsmitting those its. T s for ll the three moifitions pprohes, T s,m, T s,m,n T s,m, re ifferent from eh other euse of the ifferenes in M-RTS, M-CTS, n M-ACK pket formts n/or exhnge mehnisms. However, it is importnt to note tht mthemtil expressions for M n M remin sme s the hnges only our in frme formts ut not in the exhnge mehnisms. T s,m /M =W σ + T DIFS + T M RTS +KT + KT M CTS + T HDR + T E[P] + KT M ACK, () Frme Control Durtion Reeiver Aress CSI Frme Chek ytes ytes 6 ytes X x K ytes 4 ytes Figure M-CTS ontrol pket formt for CSIF-STCP. M-CTS Frme I

6 Thp et l. EURASIP Journl on Wireless Communitions n Networking, :4 Pge 6 of DIFS Sener Reeiver Reeiver M RTS M CTS M CTS DATA DATA M ACK M ACK B k o f f Other STAs NAV NAV Time Figure Chnnel ess mehnism in CSIF-STCP n CSIP-STCP for MU-MIMO. T s,m =W σ + T DIFS + T M RTS +T + T M CTS + T HDR + T E[P] + T M ACK, where W is the verge koff vlue, s is the slot time, n T ( ) inites the totl time require for sening respetive pket. The heer, HDR, onsists of oth the physil n the MAC heers. By repling T s in () with T s,m, T s,m,nt s,m, the mximum hievle throughput for ll the three moifition pprohes, SM mx, SM mx, n S mx M, n e otine Ahievle minimum ely Aess ely n e efine s the time intervl from the moment noe is rey to ess the meium to the moment the trnsmission is suessfully finishe. Thus, the hievle minimum ely for the investigte pprohes, D min M, D min M,nD min M, n e expresse s (4) n (5). Note tht mthemtil expressions for M n M remin sme here s well. () D min M /M =W σ + T DIFS + T M-RTS + KT + KT M-CTS + T HDR + T E[P], (4) D min M =W σ + T DIFS + T M-RTS +T + T M-CTS + T HDR + T E[P]. 4.. Mthemtil nlysis for verge performne The rrie numeril nlysis follows moulr pproh. First, we nlyze the ehvior of single tggenoeyformultingsingleimensionlmrkov moel s in [5]. With the i of the formulte moel, the proility τ tht the noe strts to trnsmit in rnomly hosen slot time is lulte. Seon, we express the verge throughput n verge pket ely s funtion of τ. The ssumptions me for the nlysis re s follows: () the numer of noes in the (5) Frme Control Durtion Reeiver Aress Frme Chek ytes ytes 6 ytes 4 ytes M-CTS Frme II Figure 4 M-CTS ontrol pket formt for CSIP-STCP n CSIP-SmTCP.

7 Thp et l. EURASIP Journl on Wireless Communitions n Networking, :4 Pge 7 of Sener K Reeivers Other STAs DIFS M-RTS M-CTSs DATA DATA DATA K NAV NAV M-ACKs B k o f f Time Figure 5 Chnnel ess mehnism for CSIP-SmTCP. network is finite (sy n), () the noes lwys hve pkets to trnsmit, n () the hnnel is iel. For simpliity n for mintining esy reility of this rtile, we use the sme nottions s presente in [5] wherever pplile. The proility tht noe trnsmits in rnomly hosen slot while employing efult ontention resolution lgorithm, inry exponentil koff (BEB), n e erive s in [5] n n e expresse s τ = + p p R+, R p i E[ i ] i= where p is the ollision proility of the trnsmitte pket, n E[ i ] is the verge koff time in ontention stge i, i R. R is the mximum llowe retrnsmission stge. E[ i ]forstgei is W i,wherew i is the mximum ontention winow size in ontention stge i. In the sttionry stte, noe trnsmits pket with proility τ. Hene, the ollision proility, p, i.e. proility of trnsmission of other noes t sme ritrry time slot, n e expresse s (6) p = ( τ) n. (7) Equtions 6 n 7 represent nonliner systems with two unknowns, τ n p, whih n e solve using numeril methos to get unique solution. When τ n p re otine, performne metris like throughput n ely n e erive onsiering other system prmeters Averge throughput Throughput is one of the most importnt initors to evlute network performne. Throughput n e efine s the rte of suessful trnsmission of the t pkets over the hnnel. Thus, throughput for MU- MIMO, S, n e relte s K P s P tr E[P] j= S =, ( P tr )T i + P s P tr T s + ( P s )P tr T s where P tr is the proility tht there is t lest one trnsmitting noe tive in the onsiere slot time, n P s is the proility tht the trnsmission is suessful. P tr n P s n e otine esily when τ n p re known. T s n T rethevergetimethehnnelis sense to e usy euse of suessful trnsmission or ollision, respetively, while T i is the urtion of n empty slot time. T s n T for our investigte pprohes n e erive s follows: T s,m /M =T DIFS + T M-RTS +KT + KT M-CTS + T HDR + T E[P] + KT M-ACK, T s,m =T DIFS + T M-RTS +T + T M-CTS + T HDR + T E[P] + T M-ACK, (8) (9) () T,M /M /M = T DIFS + T M-RTS. ()

8 Thp et l. EURASIP Journl on Wireless Communitions n Networking, :4 Pge 8 of 4... Averge ely Pket ely is efine to e the time intervl from the time pket is t the he of its MAC queue rey to e trnsmitte until the ACK for tht pket is reeive. Averge pket ely, D, n e erive y following the moel in [5], n for the MU-MIMO it n e expresse s n D = S/E[P] E[slot]( B ) p R+ p R+ R i= ( + E[() i ]), where S is the throughput with single ntenn element while E[slot] =( P tr )T i + P s P tr T s + ( P s )P tr T s. Here, T s is the verge of the suessful trnsmission times with respetive ntenn elements n B = W. 5. Performne evlution We evlute the performne numerilly se on the ove presente mthemtil expressions tking into onsiertion ll the prmeters presente in Tle. The selete prmeters hve een opte in suh wy tht they oul insure the interoperility etween MIMO pte n MIMO less WLANs. The MAC heer n PHY heer prmeters re opte from IEEE 8.n mixe moe trnsmission [5]. Slight moifition in heers hs een pplie to omplish mximum 4 numers of MU-MIMO reeivers []. Rests of the prmeters re opte from IEEE 8.g. Extene RTS n CTS frmes re use s esrie erlier. Ahievle mximum throughput n hievle minimum ely with respet to E[P] for ifferent X K onfigurtion n for ifferent hnnel t rte (DR) re presente in Figures 6,, n 6 n 7,, n 7, respetively, for M,M, n M. It is importnt to note tht the hievle throughput inreses with the numer of ntenn elements n DR, n the hievle minimum ely ereses with n inrese in DR ut inreses with ntenn elements. However, it is evient tht from PHY point of view hievle throughput Tle System prmeters Prmeters Vlue MAC heer 7 its PHY heer 4 μs ACK pket its DIFS 5 μs μs Slot time μs Bsi t rte 6 Mps Aville ntenn,, 4 Minimum ontention winow (W) 6 Mximum retry limit (R) 6 Ahievle Mximum Throughput (Mps) Ahievle Mximum Throughput (Mps) Ahievle Mximum Throughput (Mps) TUL, 4x4 MU-MIMO 4x4 MU-MIMO x MU-MIMO IEEE 8. e Mps DR 54 Mps DR 44 Mps DR 6 Mps DR Mps DR Pylo Size (Bytes ) () M (CSIF-STCP) TUL, 4x4 MU-MIMO 4x4 MU-MIMO x MU-MIMO IEEE 8. e Mps DR 54 Mps DR 44 Mps DR 6 Mps DR Mps DR shoul inrese with n inrese in ntenn elements n DR, s the hnnel pity inreses with them. Similrly, the hievle minimum ely shoul erese with n inrese in DR n shoul show no e Pylo Size (Bytes ) () M (CSIP-STCP) TUL, 4x4 MU-MIMO 4x4 MU-MIMO x MU-MIMO IEEE 8. Mps DR 54 Mps DR 44 Mps DR 6 Mps DR e Mps DR e Pylo Size (Bytes ) () M (CSIP-SmTCP) e Figure 6 Ahievle mximum throughput of CSMA/CA pte MU-MIMO wre MAC protools for WLANs. () M (CSIF-STCP), () M (CSIP-STCP), () M (CSIP-SmTCP).

9 Thp et l. EURASIP Journl on Wireless Communitions n Networking, :4 Pge 9 of Ahievle Minimum Dely (S) x DLL, 4x4 MU-MIMO 4x4 MU-MIMO.5 x MU-MIMO IEEE 8. Mps DR 54 Mps DR 44 Mps DR.5 6 Mps DR e Mps DR Ahievle Minimum Dely (S).5 Ahievle Minimum Dely (S) Pylo Size (Bytes) () M (CSIF-STCP) x DLL, 4x4 MU-MIMO 4x4 MU-MIMO.5 x MU-MIMO IEEE 8. Mps DR 54 Mps DR 44 Mps DR 6 Mps DR.5 e Mps DR Pylo Size (Bytes ) () M (CSIP-STCP) x DLL, 4x4 MU-MIMO 4x4 MU-MIMO.5 x MU-MIMO IEEE 8. Mps DR 54 Mps DR 44 Mps DR 6 Mps DR.5 e Mps DR inition of hnges on ntenn elements vrition, s simultneous trnsmission with MIMO mens onurrent trnsmissions on sme time n frequeny omin. In these results, S mx M < S mx M e e Pylo Size (Bytes ) () M (CSIP-SmTCP) e Figure 7 Ahievle minimum ely of CSMA/CA pte MU- MIMO wre MAC protools for WLANs. () M (CSIF-STCP), () M (CSIP-STCP), () M (CSIP-SmTCP). < S mx M n D min M > D min M > D min M. These results show the effets of overhes ssoite with eh of the moifition pprohes. As mentione erlier, in orer to solve the importnt MAC lyer issues like MIMO funtionlities informtion exhnge n error free ontrol pkets reeption, MAC protool nees to exhnge ifferent extene ontrol pkets with ost of itionl overhe. Similrly, when the numer of ntenn elements inreses more ontrol pkets exhnge is require to ssoite eh of the elements gin in ost of itionl overhe. The results revel tht in the investigte pprohes M hs higher overhe ompre to M n M. Similrly, M hs higher overhe ompre to M. However, the resulting effets oserve here re not only from the overhe ssoite with extene ontrol pkets ut lso from si CSMA/ CA opertion n its requirement of ontrol pkets exhnge in lower trnsmission rte. Aprt from this, the results lso show tht the throughput oes not inrese linerly in M n M while in M it inreses more or less linerly with ntenn elements ut not with DR. Note tht in ll these ses there is no liner throughput-ely gin with respet to DR. Even for the infinite DR, the throughput ouns to throughput upper limit n ely ouns to ely lower limit. It n lso e oserve tht for M, in spite of our ssumption of no itionl overhe uring the moifition, the performne goes towr ouning euse of overhe relte to si CSMA/CA opertion n its requirement of ontrol pkets trnsmission in lower trnsmission rte. Averge throughput with respet to n for ifferent X K onfigurtion n with ifferent DR for M,M,n M re presente in Figure 8,, n 8, respetively. It n e seen tht throughput inreses with ntenn elementsndr.theresultslsoshows M < S M < S M. These results gin epit the overhe s effet n effets relte to si CSMA/CA opertion n its requirements s mentione ove. In ition, it n e oserve tht throughput inreses in the eginning when n strts to inrese ut fter rehing ertin threshol the throughput strts to erese. This is euse when there re only fewer numer of noes there will e higher proility of the slots remining ile euse of witing time ssoite with koff lgorithm. But, initilly when the numer of noes strts to rise, the throughput inreses s the proility of slots remining ile gets reue. However, when n inreses further the proility of ollision lso inreses whih ultimtely reues the throughput. Besies these oservtions, the throughput oes not inrese linerly in M n M while in M it inreses more or less linerly with ntenn elements like in the

10 Thp et l. EURASIP Journl on Wireless Communitions n Networking, :4 Pge of Averge Throughput (Mps) x4 MU-MIMO x MU-MIMO IEEE 8. Mps DR 54 Mps DR 44 Mps DR 6 Mps DR Averge Dely (S) x4 MU-MIMO x MU-MIMO IEEE 8. Mps DR 54 Mps DR 44 Mps DR 6 Mps DR Numer of Noes (n) () M (CSIF-STCP) Numer of Noes (n) () M (CSIF-STCP) Averge Throughput (Mps) x4 MU-MIMO x MU-MIMO IEEE 8. Mps DR 54 Mps DR 44 Mps DR 6 Mps DR Averge Dely (S) x4 MU-MIMO x MU-MIMO IEEE 8. Mps DR 54 Mps DR 44 Mps DR 6 Mps DR Numer of Noes (n) Numer of Noes (n) () M (CSIP-STCP) () M (CSIP-STCP) Averge Throughput (Mps) x4 MU-MIMO x MU-MIMO IEEE 8. Mps DR 54 Mps DR 44 Mps DR 6 Mps DR Numer of Noes (n) () M (CSIP-SmTCP) Figure 8 Averge throughput of CSMA/CA pte MU-MIMO wre MAC protools for WLANs. () M (CSIF-STCP), () M (CSIP-STCP), () M (CSIP-SmTCP) Averge Dely (S) x4 MU-MIMO x MU-MIMO IEEE 8. Mps DR 54 Mps DR 44 Mps DR 6 Mps DR Numer of Noes (n) () M (CSIP-SmTCP) Figure 9 Averge ely of CSMA/CA pte MU-MIMO wre MAC protools for WLANs. () M (CSIF-STCP), () M (CSIP-STCP), () M (CSIP-SmTCP). previous results. Figure 9,, n 9 shows the verge ely results for M,M,nM, respetively. It n e seen tht the ely inreses with ntenn elements ut in opposite ereses with DR. However, in these results s well, D M < D M < D M euse of overhe s effet n si CSMA/CA opertion s effet s mentione ove. Moreover, it n lso e remrke tht the ely inreses with n in ll the ses s the ition in

11 Thp et l. EURASIP Journl on Wireless Communitions n Networking, :4 Pge of numer of noes uses the higher proility of ollision n les to high witing time. Similr to the previous results, there is no liner throughput-ely gin in these results s well. Asfrswehveisusse,themjorftortht ouns throughput n ely is the overhe ssoite per suessful t trnsmission when pting onventionl CSMA/CA. Clerly, from our results, the overhe s effet n e reue t the ost of omplexity. Hene, performne n omplexity n e flexily tre off ginst eh other. Aprt from this, in MIMO wre CSMA/CA, long with the moifitions in ontrol pket formts n/or hnnel ess mehnism, other shemes to reue overhes like frme ggregtion, lok knowlegement, et., [5] shoul lso e investigte prllelly to etter utilize MIMO pity. 6. Conlusion We hrterize the performne of CSMA/CA pte MU-MIMO wre MAC in wiely eploye IEEE 8. WLANs. Along with the isussion on moifition pprohes tht est represent the possile wys tht oul e rrie out to upgre onventionl CSMA/CA into MU-MIMO wre CSMA/CA, we provie their etil performne nlysis, se on the nlytil moeling n erive expressions, in terms of throughput n ely. Thus, on the one hn, fter presenting the importne of MU-MIMO wre MAC protool, we presente the isussion on moifition pprohes n the nlytil moel to unerstn their performne, while on the other hn, we lso showe the limittions of suh protools euse of the effets of inispensle overhe ssoite. Ennotes To eoe simultneously trnsmitte signls, it emns high omputtionl omplexity with sophistite hrwre filters. Size of the RTS Reeiver Aress fiel is inrese y K - times in M-RTS. Aknowlegements This stuy ws supporte y the Bsi Siene Reserh Progrm through the Ntionl Reserh Fountion of Kore (NRF) grnt fune y the Kore government (MEST) (9-756). Competing interests The uthors elre tht they hve no ompeting interests. Reeive: Mrh Aepte: 7 Otoer Pulishe: 7 Otoer. SM Almouti, A simple trnsmit iversity tehnique for wireless ommunitions. IEEE J Sel Ares Commun. 6, (998). oi:.9/ AJ Pulrj, DA Gore, RU Nr, H Bolskei, An overview of MIMO ommunitions key to gigit wireless. Pro IEEE. 9(), 98 8 (4). oi:.9/jproc D Gesert, M Shfi, DS Shiu, PJ Smith, A Ngui, From theory to prtie: n overview of MIMO spe-time oe wireless systems. IEEE J Sel Ares Commun. (), 8 (). oi:.9/jsac Y Xio, Effiient MAC strtegies for the IEEE 8.n wireless LANs. Wireless Commun Moile Comput. 6, (6). oi:./wm CK Pn, YM Ci, YY Xu, Chnnel-wre multi-user uplink trnsmission sheme for SIMO-OFDM systems. Si Chin Ser F Inf Si. 5(9), (9). oi:.7/s x 7. IEEE 8. Prt : Wireless LAN Meium Aess Control (MAC) n Physil Lyer (PHY) Speifitions (7) 8. LX Ci, H Shn, W Zhung, X Shen, JW Mrk, Z Wng, A istriute multiuser MIMO MAC protool for wireless lol re networks, in Pro IEEE GLOBECOM, 5 (8) 9. J Mirkovi, J Zho, D Denteneer, A MAC protool with multi-user MIMO support for -ho WLANs, in Pro PIMRC, 5 (7). T Zhou, Y Yng, SJ Eggerling, Z Zhong, H Shrif, A novel istriute MIMO wre MAC protool esign with Mrkovin frmework for performne evlution, in Pro MILCOM, 6 (8). F Kltenerger, D Gesert, R Knopp, M Kountouris, Correltion n pity of mesure multi-user MIMO hnnels, in Pro PIMRC, 5 (8). D Gesert, M Kountouris, RW Heth Jr, CB Che, T Slzer, From single user to multiuser ommunitions: shifting the MIMO prigm. IEEE Signl Proess Mg. 4(5), 6 46 (7). H Bolskei, MIMO-OFDM wireless system: sis, perspetives, n hllenges. Wireless Commun IEEE. (4), 7 (6) 4. K Nishimori, R Kuo, N Honm, Y Tktori, O Atsushi, K Ok, Experimentl evlution using 6 6 multiuser MIMO teste in n tul inoor senrio, in Pro APS, 4 (8) 5. IEEE St 8.n -9 Prt : Wireless LAN Meium Aess Control (MAC) n Physil Lyer (PHY) Speifitions Amenment 5: Enhnement for Higher Throughput (9) 6. YG Lee, S Choi, Ongoing evolution of WiFi, in Bron Wireless Aess n Lol Networks: Moile WiMAX n WiFi, ARTECH House, INC, (8) 7. IEEE, IEEE p8.-tsk Group AC [online oument], 9 June IEEE, IEEE p8.-tsk Group AC [online oument], 9 June. mentor.ieee.org/8./n//--6---propose-tg-rftmenment.ox 9. H Kwon, JM Cioffi, MISO rost hnnel with user-oopertion n limite feek, in Pro ISIT, (9). J Lee, N Jinl, Dirty pper oing vs. liner preoing for MIMO rost hnnels, in Pro ACSSC 6, (6). M Sek, A Tright, AH Sye, Ative ntenn seletion in multiuser MIMO ommunitions. IEEE Trns Signl Proess. 4, (7). Y Xio, J Roshl, Throughput n ely limits of IEEE 8.. IEEE Commun Lett. 6(8), (). oi:.9/lcomm..85. E Krtskli, N Zor, L Alonso, C Verikoukis, Multiuser MAC protools for 8.n wireless networks, in Pro IEEE ICC 9, 5 (9) 4. S Zhou, Z Niu, Distriute meium ess ontrol with SDMA support for WLANs. IEICE Trns Commun. E9-B, (). oi:.587/trnsom. E9.B G Binhi, I Tinnirello, Remrks on IEEE 8. DCF performne nlysis. IEEE Commun Lett. 9(8), (5). oi:.9/lcomm oi:.86/ Cite this rtile s: Thp et l.: Performne hrteriztion of CSMA/ CA pte multi-user MIMO wre MAC in WLANs. EURASIP Journl on Wireless Communitions n Networking :4. Referenes. GJ Foshini, MJ Gns, On limits of wireless ommunitions in fing environment when using multiple ntenns. Wireless Personl Commun. 6, 5 (998). oi:./a:

Distance vector protocol

Distance vector protocol istne vetor protool Irene Finohi finohi@i.unirom.it Routing Routing protool Gol: etermine goo pth (sequene of routers) thru network from soure to Grph strtion for routing lgorithms: grph noes re routers

More information

Cooperative Routing in Multi-Source Multi-Destination Multi-hop Wireless Networks

Cooperative Routing in Multi-Source Multi-Destination Multi-hop Wireless Networks oopertive Routing in Multi-Soure Multi-estintion Multi-hop Wireless Networks Jin Zhng Qin Zhng eprtment of omputer Siene n ngineering Hong Kong University of Siene n Tehnology, HongKong {zjzj, qinzh}@se.ust.hk

More information

Internet Routing. Reminder: Routing. CPSC Network Programming

Internet Routing. Reminder: Routing. CPSC Network Programming PS 360 - Network Progrmming Internet Routing Mihele Weigle eprtment of omputer Siene lemson University mweigle@s.lemson.eu pril, 00 http://www.s.lemson.eu/~mweigle/ourses/ps360 Reminer: Routing Internet

More information

UTMC APPLICATION NOTE UT1553B BCRT TO INTERFACE PSEUDO-DUAL-PORT RAM ARCHITECTURE INTRODUCTION ARBITRATION DETAILS DESIGN SELECTIONS

UTMC APPLICATION NOTE UT1553B BCRT TO INTERFACE PSEUDO-DUAL-PORT RAM ARCHITECTURE INTRODUCTION ARBITRATION DETAILS DESIGN SELECTIONS UTMC APPLICATION NOTE UT1553B BCRT TO 80186 INTERFACE INTRODUCTION The UTMC UT1553B BCRT is monolithi CMOS integrte iruit tht provies omprehensive Bus Controller n Remote Terminl funtions for MIL-STD-

More information

Duality in linear interval equations

Duality in linear interval equations Aville online t http://ijim.sriu..ir Int. J. Industril Mthemtis Vol. 1, No. 1 (2009) 41-45 Dulity in liner intervl equtions M. Movhedin, S. Slhshour, S. Hji Ghsemi, S. Khezerloo, M. Khezerloo, S. M. Khorsny

More information

COMPUTER EDUCATION TECHNIQUES, INC. (WEBLOGIC_SVR_ADM ) SA:

COMPUTER EDUCATION TECHNIQUES, INC. (WEBLOGIC_SVR_ADM ) SA: In orer to lern whih questions hve een nswere orretly: 1. Print these pges. 2. Answer the questions. 3. Sen this ssessment with the nswers vi:. FAX to (212) 967-3498. Or. Mil the nswers to the following

More information

MITSUBISHI ELECTRIC RESEARCH LABORATORIES Cambridge, Massachusetts. Introduction to Matroids and Applications. Srikumar Ramalingam

MITSUBISHI ELECTRIC RESEARCH LABORATORIES Cambridge, Massachusetts. Introduction to Matroids and Applications. Srikumar Ramalingam Cmrige, Msshusetts Introution to Mtrois n Applitions Srikumr Rmlingm MERL mm//yy Liner Alger (,0,0) (0,,0) Liner inepenene in vetors: v, v2,..., For ll non-trivil we hve s v s v n s, s2,..., s n 2v2...

More information

Chapter 9. Greedy Technique. Copyright 2007 Pearson Addison-Wesley. All rights reserved.

Chapter 9. Greedy Technique. Copyright 2007 Pearson Addison-Wesley. All rights reserved. Chpter 9 Greey Tehnique Copyright 2007 Person Aison-Wesley. All rights reserve. Greey Tehnique Construts solution to n optimiztion prolem piee y piee through sequene of hoies tht re: fesile lolly optiml

More information

Greedy Algorithm. Algorithm Fall Semester

Greedy Algorithm. Algorithm Fall Semester Greey Algorithm Algorithm 0 Fll Semester Optimiztion prolems An optimiztion prolem is one in whih you wnt to fin, not just solution, ut the est solution A greey lgorithm sometimes works well for optimiztion

More information

Error Numbers of the Standard Function Block

Error Numbers of the Standard Function Block A.2.2 Numers of the Stndrd Funtion Blok evlution The result of the logi opertion RLO is set if n error ours while the stndrd funtion lok is eing proessed. This llows you to rnh to your own error evlution

More information

V = set of vertices (vertex / node) E = set of edges (v, w) (v, w in V)

V = set of vertices (vertex / node) E = set of edges (v, w) (v, w in V) Definitions G = (V, E) V = set of verties (vertex / noe) E = set of eges (v, w) (v, w in V) (v, w) orere => irete grph (igrph) (v, w) non-orere => unirete grph igrph: w is jent to v if there is n ege from

More information

Table-driven look-ahead lexical analysis

Table-driven look-ahead lexical analysis Tle-riven look-he lexil nlysis WUU YANG Computer n Informtion Siene Deprtment Ntionl Chio-Tung University, HsinChu, Tiwn, R.O.C. Astrt. Moern progrmming lnguges use regulr expressions to efine vli tokens.

More information

Research Article Distributed Dynamic Memetic Algorithm Based Coding Aware Routing for Wireless Mesh Sensor Networks

Research Article Distributed Dynamic Memetic Algorithm Based Coding Aware Routing for Wireless Mesh Sensor Networks Hinwi Pulishing Corportion Interntionl Journl of Distriute Sensor Networks Volume 26, Artile ID 542933, 7 pges http://x.oi.org/.55/26/542933 Reserh Artile Distriute Dynmi Memeti Algorithm Bse Coing Awre

More information

10.2 Graph Terminology and Special Types of Graphs

10.2 Graph Terminology and Special Types of Graphs 10.2 Grph Terminology n Speil Types of Grphs Definition 1. Two verties u n v in n unirete grph G re lle jent (or neighors) in G iff u n v re enpoints of n ege e of G. Suh n ege e is lle inient with the

More information

GENG2140 Modelling and Computer Analysis for Engineers

GENG2140 Modelling and Computer Analysis for Engineers GENG4 Moelling n Computer Anlysis or Engineers Letures 9 & : Gussin qurture Crete y Grn Romn Joles, PhD Shool o Mehnil Engineering, UWA GENG4 Content Deinition o Gussin qurture Computtion o weights n points

More information

CS 241 Week 4 Tutorial Solutions

CS 241 Week 4 Tutorial Solutions CS 4 Week 4 Tutoril Solutions Writing n Assemler, Prt & Regulr Lnguges Prt Winter 8 Assemling instrutions utomtilly. slt $d, $s, $t. Solution: $d, $s, nd $t ll fit in -it signed integers sine they re 5-it

More information

Containers: Queue and List

Containers: Queue and List Continers: Queue n List Queue A ontiner in whih insertion is one t one en (the til) n eletion is one t the other en (the he). Also lle FIFO (First-In, First-Out) Jori Cortell n Jori Petit Deprtment of

More information

Outline. Motivation Background ARCH. Experiment Additional usages for Input-Depth. Regular Expression Matching DPI over Compressed HTTP

Outline. Motivation Background ARCH. Experiment Additional usages for Input-Depth. Regular Expression Matching DPI over Compressed HTTP ARCH This work ws supported y: The Europen Reserh Counil, The Isreli Centers of Reserh Exellene, The Neptune Consortium, nd Ntionl Siene Foundtion wrd CNS-119748 Outline Motivtion Bkground Regulr Expression

More information

A decision support system prototype for fuzzy multiple objective optimization

A decision support system prototype for fuzzy multiple objective optimization EUSFLAT - LFA A eision support system prototype for fuzzy multiple ojetive optimiztion Fengjie Wu Jie Lu n Gungqun Zhng Fulty of Informtion Tehnology University of Tehnology Syney Austrli E-mil: {fengjiewjieluzhngg}@it.uts.eu.u

More information

FEEDBACK: The standard error of a regression is not an unbiased estimator for the standard deviation of the error in a multiple regression model.

FEEDBACK: The standard error of a regression is not an unbiased estimator for the standard deviation of the error in a multiple regression model. Introutory Eonometris: A Moern Approh 6th Eition Woolrige Test Bnk Solutions Complete ownlo: https://testbnkre.om/ownlo/introutory-eonometris-moern-pproh-6th-eition-jeffreym-woolrige-test-bnk/ Solutions

More information

COMMON FRACTIONS. or a / b = a b. , a is called the numerator, and b is called the denominator.

COMMON FRACTIONS. or a / b = a b. , a is called the numerator, and b is called the denominator. COMMON FRACTIONS BASIC DEFINITIONS * A frtion is n inite ivision. or / * In the frtion is lle the numertor n is lle the enomintor. * The whole is seprte into "" equl prts n we re onsiering "" of those

More information

The Network Layer: Routing in the Internet. The Network Layer: Routing & Addressing Outline

The Network Layer: Routing in the Internet. The Network Layer: Routing & Addressing Outline CPSC 852 Internetworking The Network Lyer: Routing in the Internet Mihele Weigle Deprtment of Computer Siene Clemson University mweigle@s.lemson.edu http://www.s.lemson.edu/~mweigle/ourses/ps852 1 The

More information

Using Red-Eye to improve face detection in low quality video images

Using Red-Eye to improve face detection in low quality video images Using Re-Eye to improve fe etetion in low qulity vieo imges Rihr Youmrn Shool of Informtion Tehnology University of Ottw, Cn youmrn@site.uottw. Any Aler Shool of Informtion Tehnology University of Ottw,

More information

Distributed Systems Principles and Paradigms. Chapter 11: Distributed File Systems

Distributed Systems Principles and Paradigms. Chapter 11: Distributed File Systems Distriuted Systems Priniples nd Prdigms Mrten vn Steen VU Amsterdm, Dept. Computer Siene steen@s.vu.nl Chpter 11: Distriuted File Systems Version: Deemer 10, 2012 2 / 14 Distriuted File Systems Distriuted

More information

SMALL SIZE EDGE-FED SIERPINSKI CARPET MICROSTRIP PATCH ANTENNAS

SMALL SIZE EDGE-FED SIERPINSKI CARPET MICROSTRIP PATCH ANTENNAS Progress In Eletromgnetis Reserh C, Vol. 3, 195 22, 28 SMALL SIZE EDGE-FED SIERPINSKI CARPET MICROSTRIP PATCH ANTENNAS W.-L. Chen nd G.-M. Wng Rdr Engineering Deprtment Missile Institute of Air Fore Engineering

More information

Robust internal multiple prediction algorithm Zhiming James Wu, Sonika, Bill Dragoset*, WesternGeco

Robust internal multiple prediction algorithm Zhiming James Wu, Sonika, Bill Dragoset*, WesternGeco Roust internl multiple preition lgorithm Zhiming Jmes Wu, Sonik, Bill Drgoset*, WesternGeo Summry Multiple ttenution is n importnt t proessing step for oth mrine n ln t. Tehniques for surfe- rpily in the

More information

WORKSHOP 9 HEX MESH USING SWEEP VECTOR

WORKSHOP 9 HEX MESH USING SWEEP VECTOR WORKSHOP 9 HEX MESH USING SWEEP VECTOR WS9-1 WS9-2 Prolem Desription This exerise involves importing urve geometry from n IGES file. The urves re use to rete other urves. From the urves trimme surfes re

More information

CICS Application Design

CICS Application Design CICS Applition Design In orer to lern whih questions hve een nswere orretly: 1. Print these pges. 2. Answer the questions. 3. Sen this ssessment with the nswers vi:. FAX to (212) 967-3498. Or. Mil the

More information

A matching algorithm for measuring the structural similarity between an XML document and a DTD and its applications $

A matching algorithm for measuring the structural similarity between an XML document and a DTD and its applications $ Informtion Systems 29 (2004) 23 46 A mthing lgorithm for mesuring the struturl similrity etween n XML oument n DTD n its pplitions $ Elis Bertino, Giovnn Guerrini, Mro Mesiti, * Diprtimento i Informti

More information

Internet Routing. IP Packet Format. IP Fragmentation & Reassembly. Principles of Internet Routing. Computer Networks 9/29/2014.

Internet Routing. IP Packet Format. IP Fragmentation & Reassembly. Principles of Internet Routing. Computer Networks 9/29/2014. omputer Networks 9/29/2014 IP Pket Formt Internet Routing Ki Shen IP protool version numer heder length (words) for qulity of servie mx numer remining hops (deremented t eh router) upper lyer protool to

More information

WORKSHOP 19 GLOBAL/LOCAL MODELING USING FEM FIELDS

WORKSHOP 19 GLOBAL/LOCAL MODELING USING FEM FIELDS WORKSHOP 19 GLOBAL/LOCAL MODELING USING FEM FIELDS WS19-1 WS19-2 Prolem Desription This exerise is use to emonstrte how to mp isplement results from the nlysis of glol(overll) moel onto the perimeter of

More information

Distributed Systems Principles and Paradigms

Distributed Systems Principles and Paradigms Distriuted Systems Priniples nd Prdigms Christoph Dorn Distriuted Systems Group, Vienn University of Tehnology.dorn@infosys.tuwien..t http://www.infosys.tuwien..t/stff/dorn Slides dpted from Mrten vn Steen,

More information

Three planes in networks

Three planes in networks Three plnes in networks Prof. Mlthi eerrghvn Ele. & Comp. Engg. Dept/CATT Polytehni University mv@poly.eu M. eerrghvn 1 Polytehni University User plne, ontrol plne, n mngement plne Mngement plne: onsists

More information

Comparison-based Choices

Comparison-based Choices Comprison-se Choies John Ugner Mngement Siene & Engineering Stnfor University Joint work with: Jon Kleinerg (Cornell) Senhil Mullinthn (Hrvr) EC 17 Boston June 28, 2017 Preiting isrete hoies Clssi prolem:

More information

An Efficient Algorithm for the Physical Mapping of Clustered Task Graphs onto Multiprocessor Architectures

An Efficient Algorithm for the Physical Mapping of Clustered Task Graphs onto Multiprocessor Architectures An Effiient Algorithm for the Physil Mpping of Clustere Tsk Grphs onto Multiproessor Arhitetures Netrios Koziris Pnyiotis Tsnks Mihel Romesis George Ppkonstntinou Ntionl Tehnil University of Athens Dept.

More information

Class Overview. Database Design. Database Design Process. Database Design. Introduction to Data Management CSE 414

Class Overview. Database Design. Database Design Process. Database Design. Introduction to Data Management CSE 414 Introution to Dt Mngement CSE 44 Unit 6: Coneptul Design E/R Digrms Integrity Constrints BCNF Introution to Dt Mngement CSE 44 E/R Digrms ( letures) CSE 44 Autumn 08 Clss Overview Dtse Design Unit : Intro

More information

Cellular-based Population to Enhance Genetic Algorithm for Assignment Problems

Cellular-based Population to Enhance Genetic Algorithm for Assignment Problems Amerin Journl of Intelligent Systems. 0; (): -5 DOI: 0. 593/j.jis.000.0 Cellulr-se Popultion to Enhne Geneti Algorithm for Assignment Prolems Hossein Rjlipour Cheshmehgz *, Hiollh Hron, Mohmm Rez Myoi

More information

Rolling Back Remote Provisioning Changes. Dell Command Integration for System Center

Rolling Back Remote Provisioning Changes. Dell Command Integration for System Center Rolling Bk Remote Provisioning Chnges Dell Commn Integrtion for System Center Notes, utions, n wrnings NOTE: A NOTE inites importnt informtion tht helps you mke etter use of your prout. CAUTION: A CAUTION

More information

Photovoltaic Panel Modelling Using a Stochastic Approach in MATLAB &Simulink

Photovoltaic Panel Modelling Using a Stochastic Approach in MATLAB &Simulink hotovolti nel Modelling Using Stohsti Approh in MATLAB &Simulink KAREL ZALATILEK, JAN LEUCHTER eprtment of Eletril Engineering University of efene Kouniov 65, 61 City of Brno CZECH REUBLIC krelzpltilek@unoz,

More information

COMPUTATION AND VISUALIZATION OF REACHABLE DISTRIBUTION NETWORK SUBSTATION VOLTAGE

COMPUTATION AND VISUALIZATION OF REACHABLE DISTRIBUTION NETWORK SUBSTATION VOLTAGE 24 th Interntionl Conferene on Eletriity Distriution Glsgow, 12-15 June 2017 Pper 0615 COMPUTATION AND VISUALIZATION OF REACHABLE DISTRIBUTION NETWORK SUBSTATION VOLTAGE Mihel SANKUR Dniel ARNOLD Lun SCHECTOR

More information

Evaluating Regular Expression Matching Engines on Network and General Purpose Processors

Evaluating Regular Expression Matching Engines on Network and General Purpose Processors Evluting Regulr Expression Mthing Engines on Network n Generl Purpose Proessors Mihel Behi Wshington University Computer Siene n Engineering St. Louis, MO 63130-4899 mehi@se.wustl.eu Chrlie Wisemn Wshington

More information

[Prakash* et al., 5(8): August, 2016] ISSN: IC Value: 3.00 Impact Factor: 4.116

[Prakash* et al., 5(8): August, 2016] ISSN: IC Value: 3.00 Impact Factor: 4.116 [Prksh* et l 58: ugust 6] ISSN: 77-9655 I Vlue: Impt Ftor: 6 IJESRT INTERNTIONL JOURNL OF ENGINEERING SIENES & RESERH TEHNOLOGY SOME PROPERTIES ND THEOREM ON FUZZY SU-TRIDENT DISTNE Prveen Prksh* M Geeth

More information

Inter-domain Routing

Inter-domain Routing COMP 631: NETWORKED & DISTRIBUTED SYSTEMS Inter-domin Routing Jsleen Kur Fll 2016 1 Internet-sle Routing: Approhes DV nd link-stte protools do not sle to glol Internet How to mke routing slle? Exploit

More information

McAfee Web Gateway

McAfee Web Gateway Relese Notes Revision C MAfee We Gtewy 7.6.2.11 Contents Aout this relese Enhnement Resolved issues Instlltion instrutions Known issues Additionl informtion Find produt doumenttion Aout this relese This

More information

The Droplet Virtual Brush for Chinese Calligraphic Character Modeling

The Droplet Virtual Brush for Chinese Calligraphic Character Modeling The Droplet Virtul Brush for Chinese Clligrphi Chrter Moeling Xiofeng Mi Jie Xu Min Tng Jinxing Dong CAD & CG Stte Key L of Chin, Zhejing University, Hngzhou, Chin Artifiil Intelligene Institute, Zhejing

More information

Adaptive Pixel Interpolation for Spatial Error Concealment

Adaptive Pixel Interpolation for Spatial Error Concealment J Sign Proess Syst (2010) 60:291 303 DOI 10.1007/s11265-009-0367-y Aptive Pixel Interpoltion for Sptil Error Conelment Li Song & Xin M Reeive: 9 Novemer 2008 / Revise: 23 Mrh 2009 /Aepte: 30 Mrh 2009 /Pulishe

More information

Declarative Routing: Extensible Routing with Declarative Queries

Declarative Routing: Extensible Routing with Declarative Queries elrtive Routing: Extensile Routing with elrtive Queries Boon Thu Loo 1 Joseph M. Hellerstein 1,2, Ion toi 1, Rghu Rmkrishnn3, 1 University of Cliforni t Berkeley, 2 Intel Reserh Berkeley, 3 University

More information

Security Issues in the Optimized Link State Routing Protocol version 2 (OLSRv2)

Security Issues in the Optimized Link State Routing Protocol version 2 (OLSRv2) Seurity Issues in the Optimize Link Stte Routing Protool version 2 (OLSRv2) Thoms Heie Clusen, Ulrih Hererg To ite this version: Thoms Heie Clusen, Ulrih Hererg. Seurity Issues in the Optimize Link Stte

More information

Prefetching in an Intelligent Memory Architecture Using a Helper Thread

Prefetching in an Intelligent Memory Architecture Using a Helper Thread Prefething in n Intelligent Memory Arhiteture Using Helper Thre Yn Solihin, Jejin Lee, n Josep Torrells University of Illinois t Urn-Chmpign Mihign Stte University solihin,torrells @s.uiu.eu jlee@se.msu.eu

More information

Introduction. Example

Introduction. Example OMS0 Introution isjoint sets n minimum spnning trees In this leture we will strt by isussing t struture use for mintining isjoint subsets of some bigger set. This hs number of pplitions, inluing to mintining

More information

Additional Measurement Algorithms in the Overhauser Magnetometer POS-1

Additional Measurement Algorithms in the Overhauser Magnetometer POS-1 Additionl Mesurement Algorithms in the Overhuser Mgnetometer POS-1 O.V. Denisov, A.Y. Denisov, V.A. Spunov (QM Lortory of Url Stte Tehnil University, Mir 19, Ekterinurg, 620002, Russi) J.L. Rsson (Royl

More information

Using SIMD Registers and Instructions to Enable Instruction-Level Parallelism in Sorting Algorithms

Using SIMD Registers and Instructions to Enable Instruction-Level Parallelism in Sorting Algorithms Using SIMD Registers n Instrutions to Enle Instrution-Level Prllelism in Sorting Algorithms Timothy Furtk furtk@s.ulert. José Nelson Amrl mrl@s.ulert. Roert Niewiomski niewio@s.ulert. Deprtment of Computing

More information

Resource and Memory Management Techniques for the High-Level Synthesis of Software Threads into Parallel FPGA Hardware

Resource and Memory Management Techniques for the High-Level Synthesis of Software Threads into Parallel FPGA Hardware Resoure n Memory Mngement Tehniques for the High-Level Synthesis of Softwre Thres into Prllel FPGA Hrwre Jongsok Choi, Stephen Brown, n Json Anerson ECE Deprtment, University of Toronto, Toronto, ON, Cn

More information

A distributed edit-compile workflow

A distributed edit-compile workflow Time Synhroniztion nd Logil Cloks Tody 1. The need for time synhroniztion 2. Wll lok time synhroniztion 3. Logil Time: Lmport Cloks COS 418: Distriuted Systems Leture 4 Kyle Jmieson 2 A distriuted edit-ompile

More information

Package Contents. Wireless-G USB Network Adapter with SpeedBooster USB Cable Setup CD-ROM with User Guide (English only) Quick Installation

Package Contents. Wireless-G USB Network Adapter with SpeedBooster USB Cable Setup CD-ROM with User Guide (English only) Quick Installation A Division of Ciso Systems, In. Pkge Contents Wireless-G USB Network Adpter with SpeedBooster USB Cle Setup CD-ROM with User Guide (English only) Quik Instlltion 2,4 GHz 802.11g Wireless Model No. Model

More information

Comparing Hierarchical Data in External Memory

Comparing Hierarchical Data in External Memory Compring Hierrhil Dt in Externl Memory Surshn S. Chwthe Deprtment of Computer Siene University of Mryln College Prk, MD 090 hw@s.um.eu Astrt We present n externl-memory lgorithm for omputing minimum-ost

More information

Using a User-Level Memory Thread for Correlation Prefetching

Using a User-Level Memory Thread for Correlation Prefetching Using User-Level Memory Thre for Correltion Prefething Yn Solihin Jejin Lee Josep Torrells University of Illinois t Urn-Chmpign Mihign Stte University http://iom.s.uiu.eu http://www.se.msu.eu/ jlee Astrt

More information

COSC 6374 Parallel Computation. Dense Matrix Operations

COSC 6374 Parallel Computation. Dense Matrix Operations COSC 6374 Prllel Computtion Dense Mtrix Opertions Edgr Griel Fll Edgr Griel Prllel Computtion Edgr Griel erminology Dense Mtrix: ll elements of the mtrix ontin relevnt vlues ypilly stored s 2-D rry, (e.g.

More information

Pattern Matching. Pattern Matching. Pattern Matching. Review of Regular Expressions

Pattern Matching. Pattern Matching. Pattern Matching. Review of Regular Expressions Pttern Mthing Pttern Mthing Some of these leture slides hve een dpted from: lgorithms in C, Roert Sedgewik. Gol. Generlize string serhing to inompletely speified ptterns. pplitions. Test if string or its

More information

5 ANGLES AND POLYGONS

5 ANGLES AND POLYGONS 5 GLES POLYGOS urling rige looks like onventionl rige when it is extene. However, it urls up to form n otgon to llow ots through. This Rolling rige is in Pington sin in Lonon, n urls up every Friy t miy.

More information

CS553 Lecture Introduction to Data-flow Analysis 1

CS553 Lecture Introduction to Data-flow Analysis 1 ! Ide Introdution to Dt-flow nlysis!lst Time! Implementing Mrk nd Sweep GC!Tody! Control flow grphs! Liveness nlysis! Register llotion CS553 Leture Introdution to Dt-flow Anlysis 1 Dt-flow Anlysis! Dt-flow

More information

Hash-based Subgraph Query Processing Method for Graph-structured XML Documents

Hash-based Subgraph Query Processing Method for Graph-structured XML Documents Hsh-bse Subgrph Query Proessing Metho for Grph-struture XML Douments Hongzhi Wng Hrbin Institute of Teh. wngzh@hit.eu.n Jinzhong Li Hrbin Institute of Teh. lijzh@hit.eu.n Jizhou Luo Hrbin Institute of

More information

A METHOD FOR CHARACTERIZATION OF THREE-PHASE UNBALANCED DIPS FROM RECORDED VOLTAGE WAVESHAPES

A METHOD FOR CHARACTERIZATION OF THREE-PHASE UNBALANCED DIPS FROM RECORDED VOLTAGE WAVESHAPES A METHOD FOR CHARACTERIZATION OF THREE-PHASE UNBALANCED DIPS FROM RECORDED OLTAGE WAESHAPES M.H.J. Bollen, L.D. Zhng Dept. Eletri Power Engineering Chlmers University of Tehnology, Gothenurg, Sweden Astrt:

More information

PROBLEM OF APOLLONIUS

PROBLEM OF APOLLONIUS PROBLEM OF APOLLONIUS In the Jnury 010 issue of Amerin Sientist D. Mkenzie isusses the Apollonin Gsket whih involves fining the rius of the lrgest irle whih just fits into the spe etween three tngent irles

More information

SAS Event Stream Processing 5.1: Using SAS Event Stream Processing Studio

SAS Event Stream Processing 5.1: Using SAS Event Stream Processing Studio SAS Event Strem Proessing 5.1: Using SAS Event Strem Proessing Stuio Overview to SAS Event Strem Proessing Stuio Overview SAS Event Strem Proessing Stuio is we-se lient tht enles you to rete, eit, uplo,

More information

Parallelization Optimization of System-Level Specification

Parallelization Optimization of System-Level Specification Prlleliztion Optimiztion of System-Level Speifition Luki i niel. Gjski enter for Emedded omputer Systems University of liforni Irvine, 92697, US {li, gjski} @es.ui.edu strt This pper introdues the prlleliztion

More information

Kinetic Collision Detection: Algorithms and Experiments

Kinetic Collision Detection: Algorithms and Experiments Kineti Collision Detetion: Algorithms n Experiments Leonis J. Guis Feng Xie Li Zhng Computer Siene Deprtment, Stnfor University Astrt Effiient ollision etetion is importnt in mny rooti tsks, from high-level

More information

Advanced Programming Handout 5. Enter Okasaki. Persistent vs. Ephemeral. Functional Queues. Simple Example. Persistent vs.

Advanced Programming Handout 5. Enter Okasaki. Persistent vs. Ephemeral. Functional Queues. Simple Example. Persistent vs. Avne Progrmming Hnout 5 Purel Funtionl Dt Strutures: A Cse Stu in Funtionl Progrmming Persistent vs. Ephemerl An ephemerl t struture is one for whih onl one version is ville t time: fter n upte opertion,

More information

Lecture 12 : Topological Spaces

Lecture 12 : Topological Spaces Leture 12 : Topologil Spes 1 Topologil Spes Topology generlizes notion of distne nd loseness et. Definition 1.1. A topology on set X is olletion T of susets of X hving the following properties. 1. nd X

More information

Asurveyofpractical algorithms for suffix tree construction in external memory

Asurveyofpractical algorithms for suffix tree construction in external memory Asurveyofprtil lgorithms for suffix tree onstrution in externl memory M. Brsky,, U. Stege n A. Thomo University of Vitori, PO Box, STN CSC Vitori, BC, VW P, Cn SUMMAY The onstrution of suffix trees in

More information

COSC 6374 Parallel Computation. Non-blocking Collective Operations. Edgar Gabriel Fall Overview

COSC 6374 Parallel Computation. Non-blocking Collective Operations. Edgar Gabriel Fall Overview COSC 6374 Prllel Computtion Non-loking Colletive Opertions Edgr Griel Fll 2014 Overview Impt of olletive ommunition opertions Impt of ommunition osts on Speedup Crtesin stenil ommunition All-to-ll ommunition

More information

Introduction to Algebra

Introduction to Algebra INTRODUCTORY ALGEBRA Mini-Leture 1.1 Introdution to Alger Evlute lgeri expressions y sustitution. Trnslte phrses to lgeri expressions. 1. Evlute the expressions when =, =, nd = 6. ) d) 5 10. Trnslte eh

More information

COMP 423 lecture 11 Jan. 28, 2008

COMP 423 lecture 11 Jan. 28, 2008 COMP 423 lecture 11 Jn. 28, 2008 Up to now, we hve looked t how some symols in n lphet occur more frequently thn others nd how we cn sve its y using code such tht the codewords for more frequently occuring

More information

FASTEST METHOD TO FIND ALTERNATIVE RE-ROUTE

FASTEST METHOD TO FIND ALTERNATIVE RE-ROUTE INTERNATIONAL JOURNAL OF RESEARCH IN COMPUTER APPLICATIONS AND ROBOTICS ISSN 2320-7345 FASTEST METHOD TO FIND ALTERNATIVE RE-ROUTE 1 M.JothiLkshmi, M.S., M.Phil. 2 C.Theeendr, M.S., M.Phil. 3 M.K.Pvithr,

More information

Lesson 4.4. Euler Circuits and Paths. Explore This

Lesson 4.4. Euler Circuits and Paths. Explore This Lesson 4.4 Euler Ciruits nd Pths Now tht you re fmilir with some of the onepts of grphs nd the wy grphs onvey onnetions nd reltionships, it s time to egin exploring how they n e used to model mny different

More information

LINX MATRIX SWITCHERS FIRMWARE UPDATE INSTRUCTIONS FIRMWARE VERSION

LINX MATRIX SWITCHERS FIRMWARE UPDATE INSTRUCTIONS FIRMWARE VERSION Overview LINX MATRIX SWITCHERS FIRMWARE UPDATE INSTRUCTIONS FIRMWARE VERSION 4.4.1.0 Due to the omplex nture of this updte, plese fmilirize yourself with these instrutions nd then ontt RGB Spetrum Tehnil

More information

A new way to evaluate steel sheet surfaces

A new way to evaluate steel sheet surfaces A new wy to evlute steel sheet surfes L. Blunt X. ing W. Zeng T. Asim Centre for Preision Tehnologies (CPT) University of Huersfiel Queensgte Huersfiel UK HD1 3DH Tel.: + 44-1484-473634 E-mil: x.ing@hu..uk

More information

ORGANIZER QUICK START GUIDE

ORGANIZER QUICK START GUIDE NOTES ON USING GOTOWEBINAR GoToWeinr Orgnizers my hol Weinrs for up to 1,000 ttenees. The Weinr proess n e roken into three stges: Weinr Plnning, Weinr Presenttion n Weinr Follow-up. Orgnizers nee to first

More information

Paradigm 5. Data Structure. Suffix trees. What is a suffix tree? Suffix tree. Simple applications. Simple applications. Algorithms

Paradigm 5. Data Structure. Suffix trees. What is a suffix tree? Suffix tree. Simple applications. Simple applications. Algorithms Prdigm. Dt Struture Known exmples: link tble, hep, Our leture: suffix tree Will involve mortize method tht will be stressed shortly in this ourse Suffix trees Wht is suffix tree? Simple pplitions History

More information

Bayesian Networks: Directed Markov Properties (Cont d) and Markov Equivalent DAGs

Bayesian Networks: Directed Markov Properties (Cont d) and Markov Equivalent DAGs Byesin Networks: Direte Mrkov Properties (Cont ) n Mrkov Equivlent DAGs Huizhen Yu jney.yu@s.helsinki.fi Dept. Computer Siene, Univ. of Helsinki Proilisti Moels, Spring, 2010 Huizhen Yu (U.H.) Byesin Networks:

More information

Graph Contraction and Connectivity

Graph Contraction and Connectivity Chpter 14 Grph Contrtion n Connetivity So fr we hve mostly overe tehniques for solving problems on grphs tht were evelope in the ontext of sequentil lgorithms. Some of them re esy to prllelize while others

More information

Scalable Spatio-temporal Continuous Query Processing for Location-aware Services

Scalable Spatio-temporal Continuous Query Processing for Location-aware Services Slle Sptio-temporl Continuous uery Proessing for Lotion-wre Servies iopeng iong Mohme F. Mokel Wli G. Aref Susnne E. Hmrush Sunil Prhkr Deprtment of Computer Sienes, Purue University, West Lfyette, IN

More information

Troubleshooting. Verify the Cisco Prime Collaboration Provisioning Installation (for Advanced or Standard Mode), page

Troubleshooting. Verify the Cisco Prime Collaboration Provisioning Installation (for Advanced or Standard Mode), page Trouleshooting This setion explins the following: Verify the Ciso Prime Collortion Provisioning Instlltion (for Advned or Stndrd Mode), pge 1 Upgrde the Ciso Prime Collortion Provisioning from Smll to

More information

TEMPLATE FOR ENTRY in Encyclopedia of Database Systems: GRID FILE. Yannis Manolopoulos

TEMPLATE FOR ENTRY in Encyclopedia of Database Systems: GRID FILE. Yannis Manolopoulos TEMPLATE FOR ENTRY in Enylopedi of Dtse Systems: GRID FILE Apostolos N. Ppdopoulos Ynnis Mnolopoulos Ynnis Theodoridis Vssilis Tsotrs Deprtment of Informtis Aristotle University of Thessloniki Thessloniki,

More information

Many analog implementations of CPG exist, typically using operational amplifier or

Many analog implementations of CPG exist, typically using operational amplifier or FPGA Implementtion of Centrl Pttern Genertor By Jmes J Lin Introuction: Mny nlog implementtions of CPG exist, typiclly using opertionl mplifier or trnsistor level circuits. These types of circuits hve

More information

WORKSHOP 8B TENSION COUPON

WORKSHOP 8B TENSION COUPON WORKSHOP 8B TENSION COUPON WS8B-2 Workshop Ojetives Prtie reting n eiting geometry Prtie mesh seeing n iso meshing tehniques. WS8B-3 Suggeste Exerise Steps 1. Crete new tse. 2. Crete geometry moel of the

More information

Width and Bounding Box of Imprecise Points

Width and Bounding Box of Imprecise Points Width nd Bounding Box of Impreise Points Vhideh Keikh Mrten Löffler Ali Mohdes Zhed Rhmti Astrt In this pper we study the following prolem: we re given set L = {l 1,..., l n } of prllel line segments,

More information

Outdoor IEEE Cellular Networks: MAC Protocol Design and Performance

Outdoor IEEE Cellular Networks: MAC Protocol Design and Performance Outoor IEEE 802.11 Cellulr Networks: MAC Protocol Design n Performnce Kin K. eung, Bruce McNir, eonr J. Cimini, Jr., n Jck H. Winters AT&T bs - Reserch Miletown, NJ 07748 Abstrct We explore the fesibility

More information

VSxF-2/-3/-4 SMALL LINEAR VALVES PN16 FOR MODULATING AND ON/OFF-CONTROL SPECIFICATIONS

VSxF-2/-3/-4 SMALL LINEAR VALVES PN16 FOR MODULATING AND ON/OFF-CONTROL SPECIFICATIONS VSxF2/3/4 SMLL LINER VLVES PN16 FOR MODULTING ND ON/OFFCONTROL VSxF2 VSxF3 VSxF4 GENERL These smll liner vlves re use in omintion with smll eletri liner vlve tutors n thermoeletri tutors for the ontrol

More information

CS453 INTRODUCTION TO DATAFLOW ANALYSIS

CS453 INTRODUCTION TO DATAFLOW ANALYSIS CS453 INTRODUCTION TO DATAFLOW ANALYSIS CS453 Leture Register llotion using liveness nlysis 1 Introdution to Dt-flow nlysis Lst Time Register llotion for expression trees nd lol nd prm vrs Tody Register

More information

McAfee Network Security Platform

McAfee Network Security Platform Pssive Fil-Open Kit Quik Strt Guide Revision D MAfee Network Seurity Pltform MAfee Network Seurity Pltform IPS Sensors, when deployed in-line, route ll inoming trffi through designted port pir. However,

More information

Exploiting Locality to Ameliorate Packet Queue Contention and Serialization

Exploiting Locality to Ameliorate Packet Queue Contention and Serialization Exploiting Lolity to Ameliorte Pket Queue Contention nd Seriliztion Silesh Kumr Wshington University Computer Siene nd Engineering St Louis, MO 6313-4899 +1-314-935-436 silesh@rlwustledu John Mshmeyer

More information

CMPUT101 Introduction to Computing - Summer 2002

CMPUT101 Introduction to Computing - Summer 2002 CMPUT Introdution to Computing - Summer 22 %XLOGLQJ&RPSXWHU&LUFXLWV Chpter 4.4 3XUSRVH We hve looked t so fr how to uild logi gtes from trnsistors. Next we will look t how to uild iruits from logi gtes,

More information

Exempt Organization Business Income Tax Return

Exempt Organization Business Income Tax Return Form Deprtment of the Tresury Internl Revenue Servie For lenr yer 2017 or other tx yer eginning, n ening. Go to www.irs.gov/form990t for instrutions n the ltest informtion. Do not enter SSN numers on this

More information

COSC 6374 Parallel Computation. Communication Performance Modeling (II) Edgar Gabriel Fall Overview. Impact of communication costs on Speedup

COSC 6374 Parallel Computation. Communication Performance Modeling (II) Edgar Gabriel Fall Overview. Impact of communication costs on Speedup COSC 6374 Prllel Computtion Communition Performne Modeling (II) Edgr Griel Fll 2015 Overview Impt of ommunition osts on Speedup Crtesin stenil ommunition All-to-ll ommunition Impt of olletive ommunition

More information

Graph theory Route problems

Graph theory Route problems Bhelors thesis Grph theory Route prolems Author: Aolphe Nikwigize Dte: 986 - -5 Sujet: Mthemtis Level: First level (Bhelor) Course oe: MAE Astrt In this thesis we will review some route prolems whih re

More information

Fault tree conversion to binary decision diagrams

Fault tree conversion to binary decision diagrams Loughorough University Institutionl Repository Fult tree onversion to inry deision digrms This item ws sumitted to Loughorough University's Institutionl Repository y the/n uthor. Cittion: ANDREWS, J.D.

More information

Kulleġġ San Ġorġ Preca Il-Liċeo tas-subien Ħamrun. Name & Surname: A) Mark the correct answer by inserting an X in the correct box. a b c d.

Kulleġġ San Ġorġ Preca Il-Liċeo tas-subien Ħamrun. Name & Surname: A) Mark the correct answer by inserting an X in the correct box. a b c d. Kulleġġ Sn Ġorġ Pre Il-Liċeo ts-suien Ħmrun Hlf Yerly Exmintion 2012 Trk 3 Form 3 INFORMATION TECHNOLOGY Time : 1hr 30 mins Nme & Surnme: Clss: A) Mrk the orret nswer y inserting n X in the orret ox. 1)

More information

Loop Shifting and Compaction for the High-Level Synthesis of Designs with Complex Control Flow

Loop Shifting and Compaction for the High-Level Synthesis of Designs with Complex Control Flow Shifting n Comption for the High-Level Synthesis of Designs with Complex Control low Sumit Gupt Nikil Dutt Rjesh Gupt Alexnru Niolu Center for Emee Computer Systems Shool of Informtion n Computer Siene

More information

P(r)dr = probability of generating a random number in the interval dr near r. For this probability idea to make sense we must have

P(r)dr = probability of generating a random number in the interval dr near r. For this probability idea to make sense we must have Rndom Numers nd Monte Crlo Methods Rndom Numer Methods The integrtion methods discussed so fr ll re sed upon mking polynomil pproximtions to the integrnd. Another clss of numericl methods relies upon using

More information