VoIP Capacity over Multiple IEEE WLANs *

Size: px
Start display at page:

Download "VoIP Capacity over Multiple IEEE 802.11 WLANs *"

Transcription

1 VoIP Capacty over Mltple IEEE WLANs * An Chan an Song Chang Lew Department of Informaton Engneerng The Chnese Unversty of Hong Kong Hong Kong, Chna {achan5, song}@e.chk.e.hk Abstract It s well known that IEEE WLAN s hghly neffcent for transportng voce ata. For eample, f one smply takes the ata rate of b, 11Mbps, an ve t by two tmes 13.2Kbps (the bt rate of a typcal voce stream n one recton), one comes to the conclson that more than 400 voce sessons can be spporte n an b WLAN. As shown n prevos work, t trns ot that at most 12 sessons can be spporte e to varos heaer an protocol overheas nherent n Ths paper ponts ot that the ba news oes not stop there, an that n practce the nmber of spportable voce sessons col be lower than 2 sessons per access pont (AP)! Ths s so becase as WLAN gans poplarty, t s common to have many WLANs beng eploye n the same geographcal area, an these WLANs share the common ar mem. Or ns2 smlaton eperments, for eample, show that the capacty of a 5-by-5, 25-cell IEEE b WLAN, la ot n a sqare gr manner, s only 1.6 sessons per AP. The secon contrbton of ths paper s the nvestgaton of technqes to mprove the smal capacty. We show that a systematc call amsson mechansm base on clqe analyss of a conflct graph can ncrease the capacty to 2.12 sessons per AP. Ang a Restart Moe to the protocol boosts the capacty frther to 2.72 sessons per AP. We also brefly scss the mpact of hgher ata rates (e.g., 54 Mbps n g an a), an carefl assgnment of avalable freqency channels (e.g., the three an twelve orthogonal freqency channels n b/g an a, respectvely), on capacty. Althogh all the above technqes can mprove the capacty somewhat, the hge penalty relatve to the potental remans. Boostng the voce capacty over mltple WLANs s therefore an area that eserves frther attenton from the research commnty. Keywors VoIP capacty; mltple WLANs; call amsson control; conflct graph; clqe I. INTRODUCTION Mch work [1-5] has been evote to the sty of VoIP (Voce-over-IP) capacty of IEEE WLAN (Wreless LAN). The pror work focses prmarly on the sngle-cell envronment n whch there s only one solate WLAN wth one AP. Ths paper, n contrast, s the frst attempt to eamne the VoIP capacty n the mlt-cell envronment wth many WLANs beng eploye n the same geographcal area. Ths *Ths work was spporte by the Compettve Earmarke Research Grant (Project Nmber ) establshe ner the Unversty Grant Commttee of the Hong Kong Specal Amnstratve Regon, Chna. scenaro s common n practce. Pror nvestgaton has shown that even n the sngle-cell scenaro, the VoIP capacty over WLAN s severely lmte e to the varos nherent heaer an protocol overheas. Assmng the GSM 6.10 coec, for eample, only 12 VoIP sessons can be spporte n an b WLAN [3, 5]. Ths paper fns that the VoIP capacty s frther eroe n the mlt-cell scenaro, an sbstantally so. For eample, or ns2 [6] smlatons show that the capacty of a 5-by-5, 25-cell b WLAN s only 1.6 VoIP sessons per AP. Ths smal performance has mportant mplcatons that eserve frther attenton n vew of the acceleratng proctzaton of VoIPover-WLAN technologes. Althogh VoIP over WLAN has varos avantages sch as low cost, easy setp, ntegraton of voce an ata networks, an seamless moblty when combne wth celllar networks, ts actal performance n the real-worl envronment has not been well teste. Whle the performance can be acceptable f VoIP-over-WLAN remans npoplar an there are only a few sers, the poplarty of VoIP-over-WLAN can actally brng abot ts ownfall wth ts stretche capacty. The secon contrbton of ths paper s the nvestgaton of varos technqes to mprove VoIP capacty. Base on a conflct-graph moel, we set p a framework for call amsson. The smlaton reslts show that call amsson sng a clqe analyss can ncrease the capacty to 2.12 VoIP sessons per AP for the 5-by-5, 25-cell WLAN (.e., 32.5% mprovement). Another way to mprove capacty s to rece the conflct eges n the conflct graph by mofyng the MAC protocol. We show that a so-calle Recever Restart Moe, a mnor varaton of the MAC protocol n some commercal chps, can ncrease the capacty of a 5-by-5, 25-cell WLAN by 50% to 2.4 VoIP sessons per AP. Combnng clqe-base call amsson an recever restart moe yels 2.72 sessons per AP for a 70% mprovement. In the later part of the paper, we also brefly scss the mpact of hgher ata rates (e.g., 54 Mbps n g an a), an carefl assgnment of avalable freqency channels (e.g., the three an twelve orthogonal freqency channels n b/g an a, respectvely), on capacty. Althogh all the above technqes can mprove the capacty somewhat, the hge penalty relatve to the potental remans. We therefore concle that boostng the voce capacty n

2 WLAN n the practcal settng s a frtfl area that eserves frther attenton from the research commnty. The prelmnary sty an the framework as set ot by ths paper serve as a goo startng pont for ong that. Althogh or nmercal stes assme the nfrastrctre-moe WLAN, the technqes an prncples emonstrate n ths paper can also be apple to a hoc networks. The remaner of ths paper s organze as follows. Secton II states the assmptons an network topologes se n or stes. The low capacty of VoIP over mltple WLANs s emonstrate. Secton III proves an analytcal eplanaton for the observaton n Secton II. Secton IV presents the reslts of the clqe-base amsson control an Recever Restart Moe. Use of g/802.11a an orthogonal freqency channels to ncrease capacty are scsse n Secton V. Secton VI concles the paper. II. VOIP OVER MULTIPLE WLANS A. Assmptons an Topology Settngs For concreteness, or stes assme the se of GSM However, the general sses aresse n ths paper are the same for other coecs. We also assme the se of Dstrbte Coornaton Fncton (DCF) [7] MAC protocol. Althogh Pont Coornaton Fncton (PCF) [7] s also worth styng, t s not poplar an almost never eploye n practce. Ths s perhaps becase () PCF s not spporte n most procts an that () the robstness of PCF n real fel eployment has not been well teste, partclarly n statons where there are mltple mtally-nterferng APs n the vcnty of each other servng as the pont coornators. For or smlatons an analyses, we prmarly focs on b. In Secton V, we also brefly scss the se of a an g. For the GSM 6.10 coec, the voce payloa s 33-byte an 50 packets are generate n each secon. After ang the 40-byte IP/UDP/RTP heaer, the mnmm channel capacty to spport a voce stream n one recton (ether plnk or ownlnk) s 29.2Kbps. If we allow a packet-loss rate of 1% to 3%, the mnmm channel capacty reqrement s 28.32Kbps. We se ths mnmm channel capacty reqrement as a benchmark n the evalaton of the capacty of VoIP over WLAN. If both the plnk an ownlnk of a VoIP sesson can have throghpts eceeng ths benchmark, we say the VoIP sesson can be spporte n the WLAN. We moel a WLAN cell wth a sqare area of 353m 353m. An AP s place at the center of the cell. Any wreless clent staton nse the cell wll be assocate wth the AP. The longest lnk stance s 250m, whch s the ata transmsson range for b assme n ns2. By placng the cells se by se, we form a D-by-D mlt-cell topology, where D s the nmber of cells on each se. Fg. 1 shows a 2-by-2 mlt-cell topology. B. 2-by-2 Mlt-Cell Scenaro We frst conser the small-scale 2-by-2 mlt-cell topology n Fg. 1. Clent statons (VoIP sessons) are ae to the network one by one ranomly assmng nform strbton. Wth each atonal VoIP sesson, ns2 smlaton s rn an the throghpt of each lnk recore. When the net newly ae VoIP sesson cases a volaton of the packet-loss rate reqrement by at least one of the sessons, we say that the capacty lmt has been eceee. Ths correspons to a smplstc call amsson scheme n whch pon the above nacceptable performance case by the newly ae sesson, the newly sesson wll be roppe, an no more ftre sessons wll be accepte. The reason no more ftre sessons wll be accepte s smply becase the ang an roppng of QoS-volatng sessons can be qte srptve to the qalty of the estng sessons. We wll later conser a cleverer call amsson scheme base on a clqe analyss of a conflct graph so that we can prect the performance before ecng whether to amt a call to get r of the srptveness. Or smlaton reslts ncate that at most 12 sessons can be spporte n the overall 2-by-2 network. Havng for APs s the same as havng one AP as far as the overall capacty s concerne! The nmber of VoIP sessons per AP s only three. C. 5-by-5 Mlt-Cell Scenaro We now look at a larger-scale 5-by-5, 25-cell scenaro. Smlar to the smlatons n 2-by-2 case, we progressvely a more clents to the topology ntl the net VoIP sesson cases volaton of packet-loss rate reqrement by at least one of the sessons. We have performe several rns of ns2 smlatons, each wth fferent clent-staton strbtons on the 5-by-5 mltcell topology. The nmber of VoIP sessons spporte ranges from 38 to 47, wth an average of 40. Fg. 2 shows the reslt of a typcal rn when there are 40, 41, 42 VoIP sessons. We recor the evaton of the throghpt of each lnk from the 28.32Kbps benchmark (Devaton = Throghpt Benchmark). In Fg. 2, the legen 40-DL means ownlnk throghpts when there are 40 VoIP sessons. UL means plnk throghpts. We see that when there are 40 VoIP sessons (sol bol lnes), all the lnks have throghpts eceeng the benchmark (postve evaton vales). Bt when the nmber of VoIP sessons ncreases to 41 or 42 (otte lnes), some lnks have throghpts lower than the benchmark (negatve evaton vales). The VoIP capacty n ths smlaton rn s therefore 40 sessons. 706m 706m Magnfe vew 250m 353m Fg. 1. A 22 mlt-cell topology AP

3 Devaton from Benchmark (Kbps) DL 40-UL 41-DL 41-UL 42-DL 42-UL In the sngle-cell scenaro, all clent statons are wthn the PCS range of each other becase they are assocate wth the same AP. So, eges shol be rawn among all vertces. That means any newly ae verte wll ncrease the clqe sze by one. The analyss an smlatons n [5] showe that the mamm nmber of VoIP sessons (assmng GSM 6.10 coec) that can be spporte n an b sngle-cell WLAN s 12, becase 12 VoIP sessons wll fll p all artmes an no artme s left for an atonal VoIP sesson. Therefore, 12 s also the mamm sze of a clqe n the conflct graph Lnk ID Fg. 2. Devaton of throghpt of each lnk from benchmark when there are 40, 41 an 42 VoIP sessons n a 55 WLAN The nmber of VoIP sessons that can be spporte per AP s aron 1.6 (40/25), whch s less than two per AP! Compare wth the sngle-cell scenaro, where each AP can spport 12 VoIP sessons, ths s a rather large penalty. We also note n passng that for a network larger than the 5-by-5 network, most cells wll be srrone by eght ajacent cells an there wll be proportonately fewer cells at the bonary. One can therefore epect the VoIP capacty per AP to rop even frther when the mensons are larger than 5-by-5. III. CLIQUE ANALYSIS To nerstan the case for the heavy performance penalty, we conser here a clqe analyss base on a graph moel that captres the conflct an nterference among the noes. The clqe analyss also sggests a call amsson methoology later. A. Conflct Graph an Clqes In a conflct graph, vertces represent VoIP sessons. An ege between two vertces means that the two VoIP sessons compete for the artme. In other wors, they cannot transmt at the same tme. There are two reasons why they cannot transmt at the same tme. () Frst, noes of the two sessons are wthn the Physcal Carrer Sensng (PCS) range (note: we conser only the basc access moe n ths paper) of each other wll be prevente by the protocol from transmttng together. () Even f the two sessons are not wthn each other s PCS range, there may be mtal nterference between them so that ether one or both of ther transmssons wll fal f they transmt together. Ths s e to the wellknown hen-noe problem [8]. In ether case () or (), an ege s rawn between the two vertces of the VoIP sessons to mean that ther sccessfl transmssons cannot share the same artme. As more VoIP sessons are establshe, more vertces an eges wll be ntroce n the graph. A clqe s a sbset of vertces wth an ege between any of two of them. The vertces n a clqe compete for the common artme. That s, the sm of the fractons of artmes se by the vertces shol not ecee one. B. Clqe n 2-by-2 Mlt-Cell Topology Wth reference to Fg. 1, we fn that the farthest stance between two APs n the 2-by-2 mlt-cell topology s 500m. Snce the assme PCS range s 550m, all for APs are wthn the PCS range of each other. The AP of the cell mst be a recever or a transmtter of any VoIP sesson nse the cell, so once for APs are covere by the PCS range of each other, all VoIP sessons n the 2-by-2 mlt-cell topology are covere by the PCS range of each other. Hence, there s an ege between any par of vertces nse the corresponng conflct graph of the 2-by-2 mlt-cell topology. Ths bols own to the same staton as the sngle-cell case, an that the mamm clqe sze s 12. Ths s consstent wth the smlaton reslt we presente n the prevos secton an eplans the low capacty of the 2-by-2 mlt-cell WLAN. C. Clqes n 5-by-5 Mlt-Cell Topology The sze of the 5-by-5 mlt-cell topology s larger. Some VoIP sessons are otse the PCS range (case () n sbsecton A) an nterference range (case () n sbsecton A) of each other. That means we can fn pars of vertces between whch there s no ege, an therefore ther sccessfl transmssons can share the same artme. Fg. 3 shows an eample of sch VoIP sessons. The nearest stance between the for shae cells s 706m, an therefore the noes nse fferent shae cells are not covere by each other s PCS range of 550m, as s assme n ns2. In other wors, case () n the frst paragraph of sbsecton A s not satsfe. For case (), we conser the Interference Range (IR) efne as follows: IR = (1 + ) (1) where IR of a noe (can be a clent staton or an AP) s the 706m 1765m 706m Fg. 3. A 55 mlt-cell WLAN topology 1765m

4 range wthn whch any other transmsson wll nterfere wth the transmsson to or from the noe; s the length of the lnk assocate wth the noe; an s a stance margn for nterference-free recepton wth typcal vale of 0.78 [6, 8]. The mamm lnk length wthn a cell n Fg. 3 s ma = 250m (shown n Fg. 1). The corresponng mamm IR s IR ma = = 445m As shown n Fg. 3, the stance between any two ponts of two fferent shae areas s beyon more than IR. Therefore, there s no ege between ma vertces of fferent shae cells, an a VoIP sesson n one shae cell can transmt smltaneosly wth a sesson n another shae cell. Snce some verte pars n the conflct graph of the 5-by-5 mlt-cell WLAN o not have an ege, two or more clqes wth the mamm sze can potentally be forme. Ths eplans why the total nmber of VoIP sessons that can be spporte n the 5-by-5 mlt-cell WLAN ecees 12 (recall that smlaton reslts n Secton II show 40 sessons can be spporte on average). Note, however, that the nmber of cells covere by the PCS range of a cell n the 5-by-5 mlt-cell WLAN s larger than that n the overall area of the 2-by-2 mlt-cell WLAN (n the 2-by-2 mlt-cell WLAN, the PCS range of a cell actally etens beyon the whole topology). Ths then cases the nmber of VoIP sessons spporte per AP n the 5-by-5 case to be even lower than the 2-by-2 case (40/25=1.6 verss 12/4=3 sessons per AP). In 5-by-5 mlt-cell WLAN, there are 16 bonary-cells (the cells on the bonares of the topology) whch eperence less nterference from ether others voce packet transmsson or PCS range than the nne non-bonary-cells. The APs n the non-bonary-cells spport fewer VoIP sessons than those n the bonary-cells. As mentone n Secton II, for a network larger than the 5-by-5 network, most cells wll be srrone by eght ajacent cells an the rato of the nmber of bonary-cells to the nmber of non-bonary-cells wll ecrease. So, the average nmber of VoIP sessons that can be spporte by each AP wll rop even frther when the mensons are larger than 5-by-5. Or man fnngs n ths paper s that even wth 2-by-2 an 5-by-5 mlt-cell topologes, the average nmber of VoIP sessons spporte by each AP s alreay qte low. Wth a larger topology, thngs can only get worse. IV. METHODS TO INCREASE CAPACITY The analyss n the prevos secton shows that the mamm clqe sze shol not ecee 12. In or prevos smlatons, VoIP sessons are ae ntl the net VoIP sesson cases a volaton of the packet-loss rate reqrement by at least one of the sessons. A more jcos call amsson process s calle for. In other wors, even thogh sch a net VoIP sesson may case volaton of the lossrate reqrement, t oes not mean the call reqest after that net call wll also case a volaton. In partclar, we nee a more sophstcate amsson control algorthm whch amts VoIP sessons base on clqe sze. Ths may potentally n- crease the mamm nmber of spportable VoIP sessons. Another menson to ncrease the VoIP capacty s to rece the formaton of eges n the conflct graph, so that more VoIP sessons can be amtte before the mamm clqe sze s reache. The followng sbsectons scss these two mensons an propose possble soltons. A. Call Amsson Control Base on Clqe Sze The ablty to prect whether a new VoIP sesson can be amtte wthot casng performance problem s mportant n call amsson. Prevos work [2, 9] shows that an atonal VoIP sesson to a sngle-cell WLAN whch alreay reache the mamm capacty can egrae the performance of all other estng VoIP sessons. Ths s also the case n mlt-cell WLANs. In the 2-by-2 network, for eample, f there are 14 VoIP sessons, three of them cannot flfll the loss-rate reqrement. That means only 11 sessons can be spporte wth acceptable performance, as oppose to the 12 sessons that can be spporte when there are eactly 12 sessons n WLAN. In ths secton, we conser a call amsson control mechansm base on the clqe sze of the conflct graph to psh the se of VoIP capacty to a mamm, bt not more than that so as not to volate loss-rate reqrements. Let E be the set of vertces wth whch verte V has an ege. Let K be the set of all clqes C to whch V, V belongs, where 1 K V, K s the total nmber of clqes n K. A clqe C tself s a set contanng ts V, assocate vertces. Any par of clqes n K mst satsfy (2) below so that all clqes n K are mamal an not contane n another clqe. As efne n (3), m s the sze of the largest clqe n K. C, C, V, y y, 1, y K V (2) m = ma C (3) V V, Fg. 4 gves an eample of a conflct graph, where verte V has the followng parameters. 1 E = { V, V, V, V } V K = { VV,, VV, },{ VVV,, }, V e., K = 2 C = { V, V, V, V }, C = { V, V, V } V1, V1, m = V 4 V 3 V 5 Fg. 4. An eample of a conflct graph

5 The general problem of fnng clqes n a graph s NP-Complete. However, the conflct graph forme by VoIP sessons n a mlt-cell WLANs has certan propertes carre over from the physcal propertes of the contenton an nterference relatonshps among lnks. For eample, only the vertces (VoIP sessons) that are physcally close to each other have the possblty to form clqes. Or call amsson algorthm below tres to eplot these physcal propertes to spee p the eecton tme of the algorthm. The pseo coe of the amsson control algorthm s gven n Algorthm I. There are three proceres n the algorthm: Proceres A, B an C. When there s a new call reqest (.e., a new verte (VoIP sesson) wants to be ae), Procere A s frst eecte, wheren a copy of the state ( K, m ) s frst save n case the amsson of Vj Vj j V fals an we nee to revert to the orgnal state later. After that, Procere B s eecte. Procere B pates the state Algorthm I Procere A Keep a copy of the state ( KV, m ) for all estng V ; j Vj j Perform Procere B; Procere B For each Vj E { For each CVj, K { Vj If CVj, EV then a V to C ; Vj, else a { CV,, } j EV V to } K = NO_REDUNDANCY ( K ); Upate m ; If m > C, ma then reject V ; K ; Revert the state sng the copy store n Procere A; Break ot of Procere B, an the algorthm s termnate; } // All Vj E have been looke at f the algorthm comes to ths pont Perform Procere C; Procere C s amtte; K V = ; For each Vj E { If V CVj, then C, = C, Vj, KV = K V C ; V, } K = NO_REDUNDANCY ( K ); Compte m ; ( KV, m ) assmng the aton of j V V j. To satsfy (2), a fncton call NO_REDUNDANCY ( K ) s mae. Algorthm II gves the pseo coe of NO_REDUNDANCY ( K V k ). Drng the patng, Procere B contnally checks to see f a preetermne mamm clqe sze C ma s eceee so as not to volate the loss-rate reqrement. If so, the algorthm s termnate an s rejecte; n whch case the state save n Procere A s restore. If Procere B sccessflly rns to the en wthot the C ma beng eceee, Procere C s eecte. Procere C amts the new verte V an calclates ( K, m ). We have performe an eperment n MATLAB to measre the tme the call amsson control algorthm nees to accept or reject one call. In the eperment, we se the algorthm to fn whch VoIP sessons ot of a total of N nformly ranomly place potental sessons can be amtte n a 5-by-5 mlt-cell WLAN topology wth the C ma constrant on the largest clqe sze. Unlke the smplstc call amsson scheme earler, here when a sesson s rejecte, the call amsson scheme contnes to conser a net sesson f all the N sessons have not been ehaste. In the eperment, fferent N an fferent noe strbtons are consere n a 5-by-5 WLAN. We se an ornary personal compter wth 3.2GHz CPU an 1G RAM to perform the eperment. The reslts for fferent N an C ma are shown n Table I. The total rntme s the total tme neee for the amsson control algorthm to go throgh all the N VoIP sessons. For a gven C ma, the total rntme s rectly proportonal to N. The average rntme the algorthm neee to amt or reject a call (Total rntme / N) s 0.23s when C ma s 9, an 0.37s when C ma s 12. We see that althogh the general clqe problem s NP-complete, the eecton tme of or algorthm on the Algorthm II NO_REDUNDANCY ( K V k ){ For each par CV,, k KV C k Vk, y K, V y { k If CV k, CV k, y then eletec ; Vk, } Retrn ( K V k ); } TABLE I EXPERIMENT RESULTS OF THE ADMISSION CONTROL ALGORITHM WHEN DIFFERENT N AND C ma ARE USED N C ma Total (s) rntme No. of amtte sessons V V

6 conflct graph that moels networks s actally acceptable. Base on the call amsson reslts n MATLAB, we then se ns2 to verfy whether the amtte calls meet the mamm 3% packet-loss rate reqrement n the smlaton. From Table I, we fn that when C ma s 9, the nmbers of VoIP sessons amtte by or amsson control algorthm are 52, 52, 53, 58, for N = 75, 100, 125, 150, respectvely. We ncorporate the assocate for sets of amtte VoIP sessons n for fferent rns of ns2 smlaton. In each rn, all the amtte VoIP sessons can meet or packet-loss rate reqrement. Therefore, the average nmber of VoIP sessons meetng the packet-loss rate reqrement ner the call amsson control s aron 53. However, f we nstea se the for sets of the amtte VoIP sessons when C ma s 12 n the ns2 smlatons, nearly one thr of them cannot meet the loss reqrement. It s nterestng that for the large-scale mlt-cell case, the mamm clqe sze that shol be mpose s 9 rather than 12 (recall that 12 s the mamm clqe sze n the sngle-cell topology) f loss-rate reqrement s to be satsfe. Ths s perhaps e to the nteracton an coplng among fferent clqes case by the MAC protocol. In other wors, MAC may not acheve perfect schelng n whch the artme sage wthn each clqe s 100% tghtly packe. Wth or call amsson control above, the 5-by-5 mltcell WLAN can spport 2.12 sessons (53/25) per AP, yelng a 32.5% mprovement over the smplstc call amsson scheme n Secton II. B. Recever Restart Moe We now conser the other menson to sqeeze n more VoIP capacty: recng the eges among the vertces n the conflct graph. Recever Restart (RS) Moe [8] s ncorporate nto some commercal chps (e.g. Atheros Chp). Wth RS, the recever swtches to receve a new sgnal n the mst of recevng an ol sgnal f the new sgnal has a power stronger than the ol sgnal by a certan threshol, say 10B. Ths moe changes the nteracton among lnks an may rece the eges n the conflct graph. To nerstan an moel the effect of RS Moe, we nee to conser the two transmsson rectons of a VoIP sesson separately. Let s splt each verte n the conflct graph nto two vertces, V an V, representng the plnk (clent staton to AP) an ownlnk (AP to clent) of separately (as shown n Fg. 5a an 5b, the etals of whch are eplane n the net few paragraphs). We shall refer to ths conflctgraph moel as recton-aware conflct graph moel, an the prevos conflct-graph moel as recton-oblvos conflct graph moel. We llstrate the ea n Fg. 5a an 5b. In the fgres, we assme the stances between noes satsfy (4) an (5). ( 1 + ) < (4) 1 3 ( 1+ ) 2 < (5) 3 where s the stance margn for nterference-free recepton. Accorng to [8], once (4) an (5) are satsfe, the two VoIP sessons ( an ) wll not nterfere wth each other. Bt ther PCS ranges may stll affect each other becase the PCS range n s a fe vale that oes not change wth lnk stance. In Fg. 5a, the PCS range of N1 covers AP2, so an ege shol be rawn between an n the rectonoblvos conflct graph. In the recton-aware graph, ths ege may be mappe to a mamm of s eges. Frst, there s always an ege between an, an an ege between V an 2, respectvely, by the assmpton of half-plety. Then, there are the for potental eges between the par V an 1, an the par V an 2. Conser the nteracton between an. Sppose that N1 sens a packet to AP1 frst, followe by N2 senng a packet to AP2 (note that N2 can sen a packet becase t s not covere by the PCS range of N1). If the RS Moe s not trne on, then e to the coverage of the PCS range of N1, AP2 wll not respon to the packet from N2 even thogh two VoIP sessons actally can operate at the same tme accorng to the relatonshps n (4) an (5). The commercal proct commonly operates wthot RS by efalt althogh some chps (e.g. Atheros Chp) have ncorporate RS as an optonal moe. The efalt operaton moe n ns2 s also wthot RS. Accorngly, there shol be an ege between V an wthot RS moe. 1 N AP1 PCS Range Fg. 5a. An eample to show the effect of RS Moe AP2 N2 On the other han, wth RS, AP2 wll swtch to receve the new sgnal from N2 an respon wth an ACK. That s, there shol be no ege between an n the rectonaware conflct graph. Therefore, wth RS, the nmber of eges s rece an more VoIP sessons can be potentally amtte to the WLAN before C ma s reache. For the recton-aware conflct graph, C ma shol be change a larger vale, say 18 (.e., two tmes the vale of C ma n the recton-oblvos conflct graph moel). In ns2 smlatons, we fn that a total of 60 VoIP sessons can be spporte n a 5-by-5 mlt-cell WLAN wth RS. That means each AP can spport 2.4 VoIP sessons, yelng a 50% mprovement Fg. 5b. The corresponng recton-aware conflct graph

7 relatve to the case wthot RS. If the call amsson control escrbe n the prevos sbsecton s se together wth RS, there s another 13.3% mprovement so that 2.72 VoIP sessons per AP can be spporte. V. USE OF g/a AND ORTHOGONAL FREQUENCY CHANNEL ASSIGNMENT TO BOOST CAPACITY Ths paper has so far assme b. In ths secton, we brefly scss the se of a an g to boost VoIP capacty. In aton, we also prove a qck assessment of assgnng orthogonal freqency channels to ajacent cells n mlt-cell WLANs. A. Stanars wth Hgh Data Rates In the IEEE stanar famly, a an g can offer hgher ata rates (p to 54Mbps) than b. So, more VoIP sessons can be spporte n a or g WLANs. From the overhea analyss n [5], the mamm nmber of VoIP sessons s 56 n a sngle-cell a WLAN, an 60 n g sngle-cell WLAN. However, the performance penalty of the mlt-cell case relatve to the sngle-cell case s e to the nterference from neghborng cells an the carrer-sensng mechansm, whch est n all stanars regarless of the ata rate se. Ths, the penalty for a or g when we go from the sngle-cell staton to the mlt-cell staton s smlar to that n b, althogh the absolte nmber of VoIP sessons that can be spporte s hgher. In partclar, base on the reslts of b, we prect that aron 8 an 9 VoIP sessons per AP can be spporte by a an g, respectvely, n a 5-by-5 mlt-cell WLAN. That s, the nmber of VoIP sessons that can be spporte per AP n a mlt-cell WLAN s stll small even thogh the hgher ata rate s se. Frthermore, the coverage area of the AP for the mamm ata rate of 54Mbps s small, an for larger coverage areas, lower ata rates mst be se. Ths, we are stck n a lemma n whch we may want to se a large coverage area to serve more sers, bt the VoIP capacty for the larger coverage area can be sgnfcantly lower. B. Channel Assgnment n Dfferent Cells The nterference from neghborng cells can be solate f fferent freqency channels are se n ajacent cells. If there are enogh freqency channels, the neghbor cells that may nteract wth a cell throgh nterference an carrer sensng col be assgne fferent freqency channels. Ths bols own to the same staton as the sngle-cell case, so the per-ap VoIP capacty n the mlt-cell case s the same as that n the sngle-cell case. However, b an g have only three orthogonal freqency channels, an ths s not enogh to completely solate co-channel nterference between cells. For channel assgnment, we col se heagonal cells for layng ot the mltple cells. Fg. 6 shows that f we have only three freqency channels, then the nearest stance between two cells sng the same channel s the same as the mamm lnk length wthn a cell, ma. Snce these two cells may nterfere wth each other, the carrer-sensng range (CS range) shol be larger than 3 ma to avo hen-noe collsons between the two cells (conser lnk (AP1, STA1) an lnk (AP2, STA2) of the two cells, where the stance between STA1 an STA2 s ma ; carrer-sensng range of 3 ma s neee to avo hen-noe collsons between these two lnks). Snce a cell mst now share artme wth other cells, the VoIP capacty per AP cannot be the same as that n the sngle-cell case a, on the other han, has twelve orthogonal channels. Fg. 7 shows that a 7-channel assgnment s enogh for complete solaton of co-channel nterference. The nearest stance between two cells sng the same channel s 2.65 ma whch s larger than the mnmm CS range, 2 ma, se to prevent collsons wthn a cell. So wth 7-channel assgnment, co-channel nterference can be completely solate. However, f we smply se 7 overlay networks n each cell (pt 7 APs nse each cell an operate n fferent channels), the nmber of VoIP sessons that can be spporte n each cell s aron 56 (78, snce we prect that 8 sessons can be spporte per AP n a mlt-cell WLAN n prevos sbsecton). Ths s the same as the capacty of a sngle-cell WLAN. If RS Moe an call amsson control are se n the overlay networks, the capacty can be hgher than 56 VoIP sessons per cell. Therefore, we fn that the channel assgnment n Fg. 7 actally oes not mprove the VoIP capacty on a per-cell (or per-freqency channel) bass, althogh on a per-ap bass, t oes. VI. CONCLUSION Ths paper has eamne the VoIP capacty of IEEE mlt-cell WLAN. The VoIP capacty of the sngle-cell case, 12 sessons per AP for b, s alreay qte low e to varos protocol an heaer overheas. There s another large capacty penalty when we move to the mlt-cell case: only an average of 2.12 sessons per AP for a 5-by-5, 25-cell network. An ths can be acheve only wth a carefl call amsson scheme base on a conflct-graph clqe analyss; ma AP ma Fg channel assgnment n mlt-cell WLAN 2.65 ma Fg channel assgnment n mlt-cell WLAN

8 the average capacty s only 1.6 sessons per AP wth a smplstc call amsson. The conflct-graph clqe analyss consere n ths paper, beses beng closely te to or call amsson scheme, also yels nsghts on how VoIP capacty can be ncrease. In partclar, we col conser mofyng the MAC protocol an carrer-sensng mechansm to rece the nmber of eges n the conflct graph, hence recng the clqe sze. Ths paper has consere a so-calle RS moe to rece eges. RS moe only nees a mnor mofcaton of the DCF protocol, an can ncrease the VoIP capacty by 50%. Combnng RS wth the clqe-base call amsson scheme yels a capacty of 2.72 sessons per AP n the 5-by-5, 25-cell network. It s a 70% capacty mprovement relatve to the case of sng smplstc call amsson wthot RS. Even f RS moe an clqe-base call amsson are se together, the VoIP capacty s stll qte low. There s mch room for mprovement. We have arge that althogh a an g col rase the absolte VoIP capacty e to ther hgher ata rates, the relatve large capacty penalty as compare to the sngle-cell case remans (.e., the capacty rato of the mlt-cell an sngle-call cases remans largely the same). Ths paper has also attempte a prelmnary foray nto the sse of channel assgnment: how best to se the three orthogonal freqency channels n b/g an the twelve orthogonal freqency channels n a. Or conclson s that althogh the VoIP capacty on a per-ap bass can ncrease somewhat, the VoIP capacty on a per-freqency s stll low. A more etale analyss awats frther work. Frther nvestgatons to boost VoIP capacty col procee along the rectons of () recton of heaer an protocol overheas by the se of packet aggregaton methos [3], or brst transmsson moe n e; () recton of conflct eges by means of avance lke protocols [10,11], power control [12,13], or rectonal antennas [14]; an () call assgnment schemes n whch sessons n hotspot cells are assgne an assocate to ajacent cells [15]. Approach () s relevant to both sngle- an mlt-cell scenaros whle approaches () an () are nqe to the mlt-cell scenaro. Technology, vol. 54, no. 1, Jan [6] The Network Smlator ns2, [7] M. S. Gast, Wreless Networks: Defntve Ge, O Relly, Sebastopol, CA, [8] L. Jang, S. C. Lew, Removng hen noes n IEEE wreless networks, IEEE Vehclar Technology Conference, Sep More comprehensve verson to appear as Hen-noe removal an ts applcaton n celllar WF networks, IEEE Trans. On Vehclar Technology, Nov [9] L. Ca, X. Shen, J. W. Mark, L. Ca, Y. Xan, Voce capacty analyss of WLAN wth mbalance traffc, Proceengs of Qshne 05, Ag [10] P. C. Ng, S. C. Lew, an L. Jang, Achevng scalable performance n large-scale IEEE wreless networks, IEEE Wreless Commncatons an Network Conference (WCNC), Mar 2005 [11] A. Chan an S. C. Lew, Mert of PHY-MAC cross-layer carrer sensng: a MAC-aress-base Physcal Carrer Sensng scheme for solvng hen-noe an epose-noe problems n large-scale W-F networks, The 6 th IEEE Workshop on Wreless Local Networks, Nov [12] W. H. Ho an S. C. Lew, Achevng scalable capacty n wreless networks wth aaptve power control, The 5 th IEEE Workshop on Wreless Local Networks, Nov [13] W. H. Ho an S. C. Lew, Dstrbte power control n IEEE wreless networks, IEEE Internatonal Conference on Moble A-hoc an Sensor System (MASS), Oct [14] J. Zhang an S. C. Lew, Capacty mprovement of wreless a hoc networks wth rectonal antennae, IEEE Vehclar Technology Conference, May [15] S. C. Lew an Y. J. Zhang, Proportonal farness n mlt-channel mlt-rate wreless networks, IEEE Globecom 2006, Nov REFERENCES [1] F. Anjm et al, Voce performance n WLAN networks an epermental sty, Proceengs of IEEE Globecom 03, vol. 6, pp , Dec [2] S. Garg, M. Kappes, An epermental sty of throghpt for UDP an VoIP traffc n IEEE b networks, Proceengs of IEEE WCNC 03, vol. 3, pp , Mar [3] W. Wang, S. C. Lew, Q. X. Pang, an V. O.K. L, A mltple-mltcast scheme that mproves system capacty of Voce-over-IP on wreless LAN by 100%, The Nnth IEEE Symposm on Compters an Commncatons, Jne 2004 [4] D. P. Hole, F. A. Tobag, Capacty of an IEEE b wreless LAN spportng VoIP, Proceeng of the IEEE ICC 04, vol. 1, pp , Jn [5] W. Wang, S. C. Lew, V. O. K. L, Soltons to performance problems n VoIP over wreless LAN, IEEE Trans. on Vehclar

VoIP over Multiple IEEE 802.11 Wireless LANs

VoIP over Multiple IEEE 802.11 Wireless LANs SUBMITTED TO IEEE TRANSACTIONS ON MOBILE COMPUTING 1 VoIP over Multple IEEE 80.11 Wreless LANs An Chan, Graduate Student Member, IEEE, Soung Chang Lew, Senor Member, IEEE Abstract IEEE 80.11 WLAN has hgh

More information

DEGREES OF EQUIVALENCE IN A KEY COMPARISON 1 Thang H. L., Nguyen D. D. Vietnam Metrology Institute, Address: 8 Hoang Quoc Viet, Hanoi, Vietnam

DEGREES OF EQUIVALENCE IN A KEY COMPARISON 1 Thang H. L., Nguyen D. D. Vietnam Metrology Institute, Address: 8 Hoang Quoc Viet, Hanoi, Vietnam DEGREES OF EQUIVALECE I A EY COMPARISO Thang H. L., guyen D. D. Vetnam Metrology Insttute, Aress: 8 Hoang Quoc Vet, Hano, Vetnam Abstract: In an nterlaboratory key comparson, a ata analyss proceure for

More information

INVESTIGATION OF VEHICULAR USERS FAIRNESS IN CDMA-HDR NETWORKS

INVESTIGATION OF VEHICULAR USERS FAIRNESS IN CDMA-HDR NETWORKS 21 22 September 2007, BULGARIA 119 Proceedngs of the Internatonal Conference on Informaton Technologes (InfoTech-2007) 21 st 22 nd September 2007, Bulgara vol. 2 INVESTIGATION OF VEHICULAR USERS FAIRNESS

More information

RISK MANAGEMENT OF UNCERTAIN INNOVATION PROJECT BASED ON BAYESIAN RISK DECISION

RISK MANAGEMENT OF UNCERTAIN INNOVATION PROJECT BASED ON BAYESIAN RISK DECISION Sept 201. Vol., o. 2012-201 EAAS & ARF. All rghts reserve www.eaas-ornal.org ISS20-8269 RISK MAAGEMET OF UCERTAI IOVATIO PROJECT BASED O BAYESIA RISK DECISIO Yngchn Go College of Mathematcs & Compter Seence,

More information

An Efficient Recovery Algorithm for Coverage Hole in WSNs

An Efficient Recovery Algorithm for Coverage Hole in WSNs An Effcent Recover Algorthm for Coverage Hole n WSNs Song Ja 1,*, Wang Balng 1, Peng Xuan 1 School of Informaton an Electrcal Engneerng Harbn Insttute of Technolog at Weha, Shanong, Chna Automatc Test

More information

Performance Analysis of Energy Consumption of Smartphone Running Mobile Hotspot Application

Performance Analysis of Energy Consumption of Smartphone Running Mobile Hotspot Application Internatonal Journal of mart Grd and lean Energy Performance Analyss of Energy onsumpton of martphone Runnng Moble Hotspot Applcaton Yun on hung a chool of Electronc Engneerng, oongsl Unversty, 511 angdo-dong,

More information

Luby s Alg. for Maximal Independent Sets using Pairwise Independence

Luby s Alg. for Maximal Independent Sets using Pairwise Independence Lecture Notes for Randomzed Algorthms Luby s Alg. for Maxmal Independent Sets usng Parwse Independence Last Updated by Erc Vgoda on February, 006 8. Maxmal Independent Sets For a graph G = (V, E), an ndependent

More information

A Secure Password-Authenticated Key Agreement Using Smart Cards

A Secure Password-Authenticated Key Agreement Using Smart Cards A Secure Password-Authentcated Key Agreement Usng Smart Cards Ka Chan 1, Wen-Chung Kuo 2 and Jn-Chou Cheng 3 1 Department of Computer and Informaton Scence, R.O.C. Mltary Academy, Kaohsung 83059, Tawan,

More information

An Alternative Way to Measure Private Equity Performance

An Alternative Way to Measure Private Equity Performance An Alternatve Way to Measure Prvate Equty Performance Peter Todd Parlux Investment Technology LLC Summary Internal Rate of Return (IRR) s probably the most common way to measure the performance of prvate

More information

Clone attack detection and data loss prevention in mobile ad hoc networks. Ganapathy Mani. 1 Introduction

Clone attack detection and data loss prevention in mobile ad hoc networks. Ganapathy Mani. 1 Introduction Int. J. Space-Based and Stated omptng, Vol. 5, No. 1, 2015 9 lone attack detecton and data loss preventon n moble ad hoc networks Ganapathy Man Department of ompter Scence, George Washngton Unversty, Washngton,

More information

EXAMPLE PROBLEMS SOLVED USING THE SHARP EL-733A CALCULATOR

EXAMPLE PROBLEMS SOLVED USING THE SHARP EL-733A CALCULATOR EXAMPLE PROBLEMS SOLVED USING THE SHARP EL-733A CALCULATOR 8S CHAPTER 8 EXAMPLES EXAMPLE 8.4A THE INVESTMENT NEEDED TO REACH A PARTICULAR FUTURE VALUE What amount must you nvest now at 4% compoune monthly

More information

The Design of Efficiently-Encodable Rate-Compatible LDPC Codes

The Design of Efficiently-Encodable Rate-Compatible LDPC Codes The Desgn of Effcently-Encoable Rate-Compatble LDPC Coes Jaehong Km, Atya Ramamoorthy, Member, IEEE, an Steven W. McLaughln, Fellow, IEEE Abstract We present a new class of rregular low-ensty party-check

More information

How To Understand The Results Of The German Meris Cloud And Water Vapour Product

How To Understand The Results Of The German Meris Cloud And Water Vapour Product Ttel: Project: Doc. No.: MERIS level 3 cloud and water vapour products MAPP MAPP-ATBD-ClWVL3 Issue: 1 Revson: 0 Date: 9.12.1998 Functon Name Organsaton Sgnature Date Author: Bennartz FUB Preusker FUB Schüller

More information

The Development of Web Log Mining Based on Improve-K-Means Clustering Analysis

The Development of Web Log Mining Based on Improve-K-Means Clustering Analysis The Development of Web Log Mnng Based on Improve-K-Means Clusterng Analyss TngZhong Wang * College of Informaton Technology, Luoyang Normal Unversty, Luoyang, 471022, Chna [email protected] Abstract.

More information

A Probabilistic Theory of Coherence

A Probabilistic Theory of Coherence A Probablstc Theory of Coherence BRANDEN FITELSON. The Coherence Measure C Let E be a set of n propostons E,..., E n. We seek a probablstc measure C(E) of the degree of coherence of E. Intutvely, we want

More information

Module 2 LOSSLESS IMAGE COMPRESSION SYSTEMS. Version 2 ECE IIT, Kharagpur

Module 2 LOSSLESS IMAGE COMPRESSION SYSTEMS. Version 2 ECE IIT, Kharagpur Module LOSSLESS IMAGE COMPRESSION SYSTEMS Lesson 3 Lossless Compresson: Huffman Codng Instructonal Objectves At the end of ths lesson, the students should be able to:. Defne and measure source entropy..

More information

VOLUME 5 BLAGOEVGRAD, BULGARIA SCIENTIFIC. Research ELECTRONIC ISSUE ISSN 1312-7535

VOLUME 5 BLAGOEVGRAD, BULGARIA SCIENTIFIC. Research ELECTRONIC ISSUE ISSN 1312-7535 VOLUME 5 007 BLAGOEVGRAD, BULGARIA SCIENTIFIC Research ISSN 131-7535 ELECTRONIC ISSUE IMPROVING FAIRNESS IN CDMA-HDR NETWORKS Valentn Hrstov Abstract. Improvng throughput and farness n Cellular Data Networks

More information

A Design Method of High-availability and Low-optical-loss Optical Aggregation Network Architecture

A Design Method of High-availability and Low-optical-loss Optical Aggregation Network Architecture A Desgn Method of Hgh-avalablty and Low-optcal-loss Optcal Aggregaton Network Archtecture Takehro Sato, Kuntaka Ashzawa, Kazumasa Tokuhash, Dasuke Ish, Satoru Okamoto and Naoak Yamanaka Dept. of Informaton

More information

Answer: A). There is a flatter IS curve in the high MPC economy. Original LM LM after increase in M. IS curve for low MPC economy

Answer: A). There is a flatter IS curve in the high MPC economy. Original LM LM after increase in M. IS curve for low MPC economy 4.02 Quz Solutons Fall 2004 Multple-Choce Questons (30/00 ponts) Please, crcle the correct answer for each of the followng 0 multple-choce questons. For each queston, only one of the answers s correct.

More information

On the Optimal Marginal Rate of Income Tax

On the Optimal Marginal Rate of Income Tax On the Optmal Margnal Rate of Income Tax Gareth D Myles Insttute for Fscal Stues an Unversty of Exeter June 999 Abstract: The paper shows that n the quas-lnear moel of ncome taxaton, the optmal margnal

More information

The OC Curve of Attribute Acceptance Plans

The OC Curve of Attribute Acceptance Plans The OC Curve of Attrbute Acceptance Plans The Operatng Characterstc (OC) curve descrbes the probablty of acceptng a lot as a functon of the lot s qualty. Fgure 1 shows a typcal OC Curve. 10 8 6 4 1 3 4

More information

Traffic State Estimation in the Traffic Management Center of Berlin

Traffic State Estimation in the Traffic Management Center of Berlin Traffc State Estmaton n the Traffc Management Center of Berln Authors: Peter Vortsch, PTV AG, Stumpfstrasse, D-763 Karlsruhe, Germany phone ++49/72/965/35, emal [email protected] Peter Möhl, PTV AG,

More information

denote the location of a node, and suppose node X . This transmission causes a successful reception by node X for any other node

denote the location of a node, and suppose node X . This transmission causes a successful reception by node X for any other node Fnal Report of EE359 Class Proect Throughput and Delay n Wreless Ad Hoc Networs Changhua He [email protected] Abstract: Networ throughput and pacet delay are the two most mportant parameters to evaluate

More information

Cluster Analysis. Cluster Analysis

Cluster Analysis. Cluster Analysis Cluster Analyss Cluster Analyss What s Cluster Analyss? Types of Data n Cluster Analyss A Categorzaton of Maor Clusterng Methos Parttonng Methos Herarchcal Methos Densty-Base Methos Gr-Base Methos Moel-Base

More information

On the Optimal Control of a Cascade of Hydro-Electric Power Stations

On the Optimal Control of a Cascade of Hydro-Electric Power Stations On the Optmal Control of a Cascade of Hydro-Electrc Power Statons M.C.M. Guedes a, A.F. Rbero a, G.V. Smrnov b and S. Vlela c a Department of Mathematcs, School of Scences, Unversty of Porto, Portugal;

More information

Can Auto Liability Insurance Purchases Signal Risk Attitude?

Can Auto Liability Insurance Purchases Signal Risk Attitude? Internatonal Journal of Busness and Economcs, 2011, Vol. 10, No. 2, 159-164 Can Auto Lablty Insurance Purchases Sgnal Rsk Atttude? Chu-Shu L Department of Internatonal Busness, Asa Unversty, Tawan Sheng-Chang

More information

PAS: A Packet Accounting System to Limit the Effects of DoS & DDoS. Debish Fesehaye & Klara Naherstedt University of Illinois-Urbana Champaign

PAS: A Packet Accounting System to Limit the Effects of DoS & DDoS. Debish Fesehaye & Klara Naherstedt University of Illinois-Urbana Champaign PAS: A Packet Accountng System to Lmt the Effects of DoS & DDoS Debsh Fesehaye & Klara Naherstedt Unversty of Illnos-Urbana Champagn DoS and DDoS DDoS attacks are ncreasng threats to our dgtal world. Exstng

More information

VRT012 User s guide V0.1. Address: Žirmūnų g. 27, Vilnius LT-09105, Phone: (370-5) 2127472, Fax: (370-5) 276 1380, Email: info@teltonika.

VRT012 User s guide V0.1. Address: Žirmūnų g. 27, Vilnius LT-09105, Phone: (370-5) 2127472, Fax: (370-5) 276 1380, Email: info@teltonika. VRT012 User s gude V0.1 Thank you for purchasng our product. We hope ths user-frendly devce wll be helpful n realsng your deas and brngng comfort to your lfe. Please take few mnutes to read ths manual

More information

Calculating the high frequency transmission line parameters of power cables

Calculating the high frequency transmission line parameters of power cables < ' Calculatng the hgh frequency transmsson lne parameters of power cables Authors: Dr. John Dcknson, Laboratory Servces Manager, N 0 RW E B Communcatons Mr. Peter J. Ncholson, Project Assgnment Manager,

More information

Efficient Algorithms for Computing the Triplet and Quartet Distance Between Trees of Arbitrary Degree

Efficient Algorithms for Computing the Triplet and Quartet Distance Between Trees of Arbitrary Degree Effcent Algorthms for omputng the Trplet an Quartet Dstance Between Trees of Arbtrary Degree Gerth Støltng Broal, Rolf Fagerberg Thomas Malun hrstan N. S. Peersen, Anreas San, Abstract The trplet an quartet

More information

Study on Model of Risks Assessment of Standard Operation in Rural Power Network

Study on Model of Risks Assessment of Standard Operation in Rural Power Network Study on Model of Rsks Assessment of Standard Operaton n Rural Power Network Qngj L 1, Tao Yang 2 1 Qngj L, College of Informaton and Electrcal Engneerng, Shenyang Agrculture Unversty, Shenyang 110866,

More information

A Practical Study of Regenerating Codes for Peer-to-Peer Backup Systems

A Practical Study of Regenerating Codes for Peer-to-Peer Backup Systems A Practcal Stuy of Regeneratng Coes for Peer-to-Peer Backup Systems Alessanro Dumnuco an Ernst Bersack EURECOM Sopha Antpols, France {umnuco,bersack}@eurecom.fr Abstract In strbute storage systems, erasure

More information

Optimal Control Approach to Production Systems. with Inventory-Level-Dependent Demand

Optimal Control Approach to Production Systems. with Inventory-Level-Dependent Demand Optmal Control Approach to Prodcton Systems wth Inventory-Level-Dependent Demand Egene Khmelntsky and Ygal Gerchak Department of Indstral Engneerng, Tel-Avv Unversty, Tel-Avv 69978, Israel Fax: 97--647669,

More information

Recurrence. 1 Definitions and main statements

Recurrence. 1 Definitions and main statements Recurrence 1 Defntons and man statements Let X n, n = 0, 1, 2,... be a MC wth the state space S = (1, 2,...), transton probabltes p j = P {X n+1 = j X n = }, and the transton matrx P = (p j ),j S def.

More information

THE LOAD PLANNING PROBLEM FOR LESS-THAN-TRUCKLOAD MOTOR CARRIERS AND A SOLUTION APPROACH. Professor Naoto Katayama* and Professor Shigeru Yurimoto*

THE LOAD PLANNING PROBLEM FOR LESS-THAN-TRUCKLOAD MOTOR CARRIERS AND A SOLUTION APPROACH. Professor Naoto Katayama* and Professor Shigeru Yurimoto* 7th Internatonal Symposum on Logstcs THE LOAD PLAIG PROBLEM FOR LESS-THA-TRUCKLOAD MOTOR CARRIERS AD A SOLUTIO APPROACH Professor aoto Katayama* an Professor Shgeru Yurmoto* * Faculty of Dstrbuton an Logstcs

More information

DEFINING %COMPLETE IN MICROSOFT PROJECT

DEFINING %COMPLETE IN MICROSOFT PROJECT CelersSystems DEFINING %COMPLETE IN MICROSOFT PROJECT PREPARED BY James E Aksel, PMP, PMI-SP, MVP For Addtonal Informaton about Earned Value Management Systems and reportng, please contact: CelersSystems,

More information

) of the Cell class is created containing information about events associated with the cell. Events are added to the Cell instance

) of the Cell class is created containing information about events associated with the cell. Events are added to the Cell instance Calbraton Method Instances of the Cell class (one nstance for each FMS cell) contan ADC raw data and methods assocated wth each partcular FMS cell. The calbraton method ncludes event selecton (Class Cell

More information

Cooperative Load Balancing in IEEE 802.11 Networks with Cell Breathing

Cooperative Load Balancing in IEEE 802.11 Networks with Cell Breathing Cooperatve Load Balancng n IEEE 82.11 Networks wth Cell Breathng Eduard Garca Rafael Vdal Josep Paradells Wreless Networks Group - Techncal Unversty of Catalona (UPC) {eduardg, rvdal, teljpa}@entel.upc.edu;

More information

An Interest-Oriented Network Evolution Mechanism for Online Communities

An Interest-Oriented Network Evolution Mechanism for Online Communities An Interest-Orented Network Evoluton Mechansm for Onlne Communtes Cahong Sun and Xaopng Yang School of Informaton, Renmn Unversty of Chna, Bejng 100872, P.R. Chna {chsun,yang}@ruc.edu.cn Abstract. Onlne

More information

An Adaptive Cross-layer Bandwidth Scheduling Strategy for the Speed-Sensitive Strategy in Hierarchical Cellular Networks

An Adaptive Cross-layer Bandwidth Scheduling Strategy for the Speed-Sensitive Strategy in Hierarchical Cellular Networks An Adaptve Cross-layer Bandwdth Schedulng Strategy for the Speed-Senstve Strategy n erarchcal Cellular Networks Jong-Shn Chen #1, Me-Wen #2 Department of Informaton and Communcaton Engneerng ChaoYang Unversty

More information

A Resource-trading Mechanism for Efficient Distribution of Large-volume Contents on Peer-to-Peer Networks

A Resource-trading Mechanism for Efficient Distribution of Large-volume Contents on Peer-to-Peer Networks A Resource-tradng Mechansm for Effcent Dstrbuton of Large-volume Contents on Peer-to-Peer Networks SmonG.M.Koo,C.S.GeorgeLee, Karthk Kannan School of Electrcal and Computer Engneerng Krannet School of

More information

Calculation of Sampling Weights

Calculation of Sampling Weights Perre Foy Statstcs Canada 4 Calculaton of Samplng Weghts 4.1 OVERVIEW The basc sample desgn used n TIMSS Populatons 1 and 2 was a two-stage stratfed cluster desgn. 1 The frst stage conssted of a sample

More information

Analysis of Premium Liabilities for Australian Lines of Business

Analysis of Premium Liabilities for Australian Lines of Business Summary of Analyss of Premum Labltes for Australan Lnes of Busness Emly Tao Honours Research Paper, The Unversty of Melbourne Emly Tao Acknowledgements I am grateful to the Australan Prudental Regulaton

More information

Overview of monitoring and evaluation

Overview of monitoring and evaluation 540 Toolkt to Combat Traffckng n Persons Tool 10.1 Overvew of montorng and evaluaton Overvew Ths tool brefly descrbes both montorng and evaluaton, and the dstncton between the two. What s montorng? Montorng

More information

A General and Practical Datacenter Selection Framework for Cloud Services

A General and Practical Datacenter Selection Framework for Cloud Services 212 IEEE Ffth Internatonal Conference on Clou Computng A General an Practcal Datacenter Selecton Framework for Clou Servces Hong Xu, Baochun L henryxu, [email protected] Department of Electrcal an Computer

More information

benefit is 2, paid if the policyholder dies within the year, and probability of death within the year is ).

benefit is 2, paid if the policyholder dies within the year, and probability of death within the year is ). REVIEW OF RISK MANAGEMENT CONCEPTS LOSS DISTRIBUTIONS AND INSURANCE Loss and nsurance: When someone s subject to the rsk of ncurrng a fnancal loss, the loss s generally modeled usng a random varable or

More information

Data Broadcast on a Multi-System Heterogeneous Overlayed Wireless Network *

Data Broadcast on a Multi-System Heterogeneous Overlayed Wireless Network * JOURNAL OF INFORMATION SCIENCE AND ENGINEERING 24, 819-840 (2008) Data Broadcast on a Mult-System Heterogeneous Overlayed Wreless Network * Department of Computer Scence Natonal Chao Tung Unversty Hsnchu,

More information

How To Detect An 802.11 Traffc From A Network With A Network Onlne Onlnet

How To Detect An 802.11 Traffc From A Network With A Network Onlne Onlnet IEEE TRANSACTIONS ON MOBILE COMPUTING, VOL. X, NO. X, XXX 2008 1 Passve Onlne Detecton of 802.11 Traffc Usng Sequental Hypothess Testng wth TCP ACK-Pars We We, Member, IEEE, Kyoungwon Suh, Member, IEEE,

More information

Efficient On-Demand Data Service Delivery to High-Speed Trains in Cellular/Infostation Integrated Networks

Efficient On-Demand Data Service Delivery to High-Speed Trains in Cellular/Infostation Integrated Networks IEEE JOURNAL ON SELECTED AREAS IN COMMUNICATIONS, VOL. XX, NO. XX, MONTH 2XX 1 Effcent On-Demand Data Servce Delvery to Hgh-Speed Trans n Cellular/Infostaton Integrated Networks Hao Lang, Student Member,

More information

Performance Analysis and Comparison of QoS Provisioning Mechanisms for CBR Traffic in Noisy IEEE 802.11e WLANs Environments

Performance Analysis and Comparison of QoS Provisioning Mechanisms for CBR Traffic in Noisy IEEE 802.11e WLANs Environments Tamkang Journal of Scence and Engneerng, Vol. 12, No. 2, pp. 143149 (2008) 143 Performance Analyss and Comparson of QoS Provsonng Mechansms for CBR Traffc n Nosy IEEE 802.11e WLANs Envronments Der-Junn

More information

A Binary Quantum-behaved Particle Swarm Optimization Algorithm with Cooperative Approach

A Binary Quantum-behaved Particle Swarm Optimization Algorithm with Cooperative Approach IJCSI Internatonal Journal of Computer Scence Issues, Vol., Issue, No, January 3 ISSN (Prnt): 694-784 ISSN (Onlne): 694-84 www.ijcsi.org A Bnary Quantum-behave Partcle Swarm Optmzaton Algorthm wth Cooperatve

More information

An Adaptive and Distributed Clustering Scheme for Wireless Sensor Networks

An Adaptive and Distributed Clustering Scheme for Wireless Sensor Networks 2007 Internatonal Conference on Convergence Informaton Technology An Adaptve and Dstrbuted Clusterng Scheme for Wreless Sensor Networs Xnguo Wang, Xnmng Zhang, Guolang Chen, Shuang Tan Department of Computer

More information

Load Balancing Based on Clustering Methods for LTE Networks

Load Balancing Based on Clustering Methods for LTE Networks Cyber Journals: Multdscplnary Journals n Scence and Technology Journal of Selected Areas n Telecommuncatons (JSAT) February Edton 2013 Volume 3 Issue 2 Load Balancng Based on Clusterng Methods for LTE

More information

A role based access in a hierarchical sensor network architecture to provide multilevel security

A role based access in a hierarchical sensor network architecture to provide multilevel security 1 A role based access n a herarchcal sensor network archtecture to provde multlevel securty Bswajt Panja a Sanjay Kumar Madra b and Bharat Bhargava c a Department of Computer Scenc Morehead State Unversty

More information

Conferencing protocols and Petri net analysis

Conferencing protocols and Petri net analysis Conferencng protocols and Petr net analyss E. ANTONIDAKIS Department of Electroncs, Technologcal Educatonal Insttute of Crete, GREECE [email protected] Abstract: Durng a computer conference, users desre

More information

Secure Walking GPS: A Secure Localization and Key Distribution Scheme for Wireless Sensor Networks

Secure Walking GPS: A Secure Localization and Key Distribution Scheme for Wireless Sensor Networks Secure Walkng GPS: A Secure Localzaton and Key Dstrbuton Scheme for Wreless Sensor Networks Q M, John A. Stankovc, Radu Stoleru 2 Department of Computer Scence, Unversty of Vrgna, USA 2 Department of Computer

More information

Master s Thesis. Configuring robust virtual wireless sensor networks for Internet of Things inspired by brain functional networks

Master s Thesis. Configuring robust virtual wireless sensor networks for Internet of Things inspired by brain functional networks Master s Thess Ttle Confgurng robust vrtual wreless sensor networks for Internet of Thngs nspred by bran functonal networks Supervsor Professor Masayuk Murata Author Shnya Toyonaga February 10th, 2014

More information

FI GERPRI T VERIFICATIO USI G OPTICAL SHIFTED PHASE- E CODED JOI T TRA SFORM CORRELATIO

FI GERPRI T VERIFICATIO USI G OPTICAL SHIFTED PHASE- E CODED JOI T TRA SFORM CORRELATIO FI GEPI VEIFICAIO USI G OPICAL SHIFED PHASE- E CODED JOI A SFOM COELAIO M. azrl Islam Emal: [email protected] Secrt Sstems Farmngdale State Unerst of New York 350 Broad Hollow oad Farmngdale New York

More information

Minimal Coding Network With Combinatorial Structure For Instantaneous Recovery From Edge Failures

Minimal Coding Network With Combinatorial Structure For Instantaneous Recovery From Edge Failures Mnmal Codng Network Wth Combnatoral Structure For Instantaneous Recovery From Edge Falures Ashly Joseph 1, Mr.M.Sadsh Sendl 2, Dr.S.Karthk 3 1 Fnal Year ME CSE Student Department of Computer Scence Engneerng

More information

VoIP Playout Buffer Adjustment using Adaptive Estimation of Network Delays

VoIP Playout Buffer Adjustment using Adaptive Estimation of Network Delays VoIP Playout Buffer Adjustment usng Adaptve Estmaton of Network Delays Mroslaw Narbutt and Lam Murphy* Department of Computer Scence Unversty College Dubln, Belfeld, Dubln, IRELAND Abstract The poor qualty

More information

Institute of Informatics, Faculty of Business and Management, Brno University of Technology,Czech Republic

Institute of Informatics, Faculty of Business and Management, Brno University of Technology,Czech Republic Lagrange Multplers as Quanttatve Indcators n Economcs Ivan Mezník Insttute of Informatcs, Faculty of Busness and Management, Brno Unversty of TechnologCzech Republc Abstract The quanttatve role of Lagrange

More information

Enabling P2P One-view Multi-party Video Conferencing

Enabling P2P One-view Multi-party Video Conferencing Enablng P2P One-vew Mult-party Vdeo Conferencng Yongxang Zhao, Yong Lu, Changja Chen, and JanYn Zhang Abstract Mult-Party Vdeo Conferencng (MPVC) facltates realtme group nteracton between users. Whle P2P

More information

Rank Optimization of Personalized Search

Rank Optimization of Personalized Search Rank Optmzaton of Personalzed Search Ln LI Zhengl YANG Masar KITSUREGAWA Agmentng the global rankng based on the lnkage strctre of the Web s one of the poplar approaches n data engneerng commnty today

More information

What is Candidate Sampling

What is Candidate Sampling What s Canddate Samplng Say we have a multclass or mult label problem where each tranng example ( x, T ) conssts of a context x a small (mult)set of target classes T out of a large unverse L of possble

More information

A Novel Methodology of Working Capital Management for Large. Public Constructions by Using Fuzzy S-curve Regression

A Novel Methodology of Working Capital Management for Large. Public Constructions by Using Fuzzy S-curve Regression Novel Methodology of Workng Captal Management for Large Publc Constructons by Usng Fuzzy S-curve Regresson Cheng-Wu Chen, Morrs H. L. Wang and Tng-Ya Hseh Department of Cvl Engneerng, Natonal Central Unversty,

More information

Distributed Strategic Learning with Application to Network Security

Distributed Strategic Learning with Application to Network Security Amercan Control Conference on O'Farrell Street San Francsco CA USA June 9 - July Dstrbute Strategc Learnng wth Applcaton to Network Securty Quanyan Zhu Hamou Tembne an Tamer Başar Abstract We conser n

More information

Hollinger Canadian Publishing Holdings Co. ( HCPH ) proceeding under the Companies Creditors Arrangement Act ( CCAA )

Hollinger Canadian Publishing Holdings Co. ( HCPH ) proceeding under the Companies Creditors Arrangement Act ( CCAA ) February 17, 2011 Andrew J. Hatnay [email protected] Dear Sr/Madam: Re: Re: Hollnger Canadan Publshng Holdngs Co. ( HCPH ) proceedng under the Companes Credtors Arrangement Act ( CCAA ) Update on CCAA Proceedngs

More information

Exact GP Schema Theory for Headless Chicken Crossover and Subtree Mutation

Exact GP Schema Theory for Headless Chicken Crossover and Subtree Mutation Exact GP Schema Theory for Healess Chcken Crossover an Subtree Mutaton Rccaro Pol School of Computer Scence The Unversty of Brmngham Brmngham, B5 TT, UK [email protected] Ncholas F. McPhee Dvson of Scence

More information

Student Performance in Online Quizzes as a Function of Time in Undergraduate Financial Management Courses

Student Performance in Online Quizzes as a Function of Time in Undergraduate Financial Management Courses Student Performance n Onlne Quzzes as a Functon of Tme n Undergraduate Fnancal Management Courses Olver Schnusenberg The Unversty of North Florda ABSTRACT An nterestng research queston n lght of recent

More information

Vision Mouse. Saurabh Sarkar a* University of Cincinnati, Cincinnati, USA ABSTRACT 1. INTRODUCTION

Vision Mouse. Saurabh Sarkar a* University of Cincinnati, Cincinnati, USA ABSTRACT 1. INTRODUCTION Vson Mouse Saurabh Sarkar a* a Unversty of Cncnnat, Cncnnat, USA ABSTRACT The report dscusses a vson based approach towards trackng of eyes and fngers. The report descrbes the process of locatng the possble

More information

An algorithm of choosing LSPs in the MPLS network with unreliable links

An algorithm of choosing LSPs in the MPLS network with unreliable links Ireneusz OLSZESKI Unversty of Technology an Lfe Scences n Bygoszcz, Faculty of Telecommuncatons an Electrcal Engneerng An algorthm of choosng LSPs n the MPLS network wth unrelable lnks Streszczene. pracy

More information

Dimming Cellular Networks

Dimming Cellular Networks Dmmng Cellular Networks Davd Tpper, Abdelmounaam Rezgu, Prashant Krshnamurthy, and Peera Pacharntanakul Graduate Telecommuncatons and Networkng Program, Unversty of Pttsburgh, Pttsburgh, PA 1526, Unted

More information

Relay Secrecy in Wireless Networks with Eavesdropper

Relay Secrecy in Wireless Networks with Eavesdropper Relay Secrecy n Wreless Networks wth Eavesdropper Parvathnathan Venktasubramanam, Tng He and Lang Tong School of Electrcal and Computer Engneerng Cornell Unversty, Ithaca, NY 14853 Emal : {pv45, th255,

More information

CHOLESTEROL REFERENCE METHOD LABORATORY NETWORK. Sample Stability Protocol

CHOLESTEROL REFERENCE METHOD LABORATORY NETWORK. Sample Stability Protocol CHOLESTEROL REFERENCE METHOD LABORATORY NETWORK Sample Stablty Protocol Background The Cholesterol Reference Method Laboratory Network (CRMLN) developed certfcaton protocols for total cholesterol, HDL

More information

GIS: data processing. 3.1.1. Example of spatial queries. 3.1 Spatial queries. Chapter III. Geographic Information Systems: Data Processing

GIS: data processing. 3.1.1. Example of spatial queries. 3.1 Spatial queries. Chapter III. Geographic Information Systems: Data Processing Vsal Informaton Systems Pr. Robert Larn GIS: data processng Chapter III Geographc Informaton Systems: Data Processng 3.1 Spatal qeres 3. Introdcton to Spatal nalyss 3.3 Spatal ndexng 3. Updatng 3. Conclsons

More information

Energy Conserving Routing in Wireless Ad-hoc Networks

Energy Conserving Routing in Wireless Ad-hoc Networks Energy Conservng Routng n Wreless Ad-hoc Networks Jae-Hwan Chang and Leandros Tassulas Department of Electrcal and Computer Engneerng & Insttute for Systems Research Unversty of Maryland at College ark

More information

ivoip: an Intelligent Bandwidth Management Scheme for VoIP in WLANs

ivoip: an Intelligent Bandwidth Management Scheme for VoIP in WLANs VoIP: an Intellgent Bandwdth Management Scheme for VoIP n WLANs Zhenhu Yuan and Gabrel-Mro Muntean Abstract Voce over Internet Protocol (VoIP) has been wdely used by many moble consumer devces n IEEE 802.11

More information

Schedulability Bound of Weighted Round Robin Schedulers for Hard Real-Time Systems

Schedulability Bound of Weighted Round Robin Schedulers for Hard Real-Time Systems Schedulablty Bound of Weghted Round Robn Schedulers for Hard Real-Tme Systems Janja Wu, Jyh-Charn Lu, and We Zhao Department of Computer Scence, Texas A&M Unversty {janjaw, lu, zhao}@cs.tamu.edu Abstract

More information

The Greedy Method. Introduction. 0/1 Knapsack Problem

The Greedy Method. Introduction. 0/1 Knapsack Problem The Greedy Method Introducton We have completed data structures. We now are gong to look at algorthm desgn methods. Often we are lookng at optmzaton problems whose performance s exponental. For an optmzaton

More information

Health Insurance Estimates for Counties 1

Health Insurance Estimates for Counties 1 003 Jont Statstcal Meetngs - Secton on Srvey Research Methods Health Insrance Estmates for Contes 1 Robn Fsher and Joanna Trner U.S. Censs Brea, HHES-SAEB, FB 3 Room 146 Washngton, DC, 033 Phone: (301)

More information

ANALYZING THE RELATIONSHIPS BETWEEN QUALITY, TIME, AND COST IN PROJECT MANAGEMENT DECISION MAKING

ANALYZING THE RELATIONSHIPS BETWEEN QUALITY, TIME, AND COST IN PROJECT MANAGEMENT DECISION MAKING ANALYZING THE RELATIONSHIPS BETWEEN QUALITY, TIME, AND COST IN PROJECT MANAGEMENT DECISION MAKING Matthew J. Lberatore, Department of Management and Operatons, Vllanova Unversty, Vllanova, PA 19085, 610-519-4390,

More information

APPLICATION OF PROBE DATA COLLECTED VIA INFRARED BEACONS TO TRAFFIC MANEGEMENT

APPLICATION OF PROBE DATA COLLECTED VIA INFRARED BEACONS TO TRAFFIC MANEGEMENT APPLICATION OF PROBE DATA COLLECTED VIA INFRARED BEACONS TO TRAFFIC MANEGEMENT Toshhko Oda (1), Kochro Iwaoka (2) (1), (2) Infrastructure Systems Busness Unt, Panasonc System Networks Co., Ltd. Saedo-cho

More information

Multi-Resource Fair Allocation in Heterogeneous Cloud Computing Systems

Multi-Resource Fair Allocation in Heterogeneous Cloud Computing Systems 1 Mult-Resource Far Allocaton n Heterogeneous Cloud Computng Systems We Wang, Student Member, IEEE, Ben Lang, Senor Member, IEEE, Baochun L, Senor Member, IEEE Abstract We study the mult-resource allocaton

More information

A Dynamic Load Balancing Algorithm in Heterogeneous Network

A Dynamic Load Balancing Algorithm in Heterogeneous Network 06 7th Internatonal Conference on Intellgent Systems Modellng and Smulaton A Dynamc Load Balancng Algorthm n Heterogeneous etwork Zhxong Dng Xngjun Wang and Wenmng Yang Shenzhen Key Lab of Informaton Securty

More information

Credit Limit Optimization (CLO) for Credit Cards

Credit Limit Optimization (CLO) for Credit Cards Credt Lmt Optmzaton (CLO) for Credt Cards Vay S. Desa CSCC IX, Ednburgh September 8, 2005 Copyrght 2003, SAS Insttute Inc. All rghts reserved. SAS Propretary Agenda Background Tradtonal approaches to credt

More information

Small-Signal Analysis of BJT Differential Pairs

Small-Signal Analysis of BJT Differential Pairs 5/11/011 Dfferental Moe Sall Sgnal Analyss of BJT Dff Par 1/1 SallSgnal Analyss of BJT Dfferental Pars Now lets conser the case where each nput of the fferental par conssts of an entcal D bas ter B, an

More information

Stock Profit Patterns

Stock Profit Patterns Stock Proft Patterns Suppose a share of Farsta Shppng stock n January 004 s prce n the market to 56. Assume that a September call opton at exercse prce 50 costs 8. A September put opton at exercse prce

More information

AN APPOINTMENT ORDER OUTPATIENT SCHEDULING SYSTEM THAT IMPROVES OUTPATIENT EXPERIENCE

AN APPOINTMENT ORDER OUTPATIENT SCHEDULING SYSTEM THAT IMPROVES OUTPATIENT EXPERIENCE AN APPOINTMENT ORDER OUTPATIENT SCHEDULING SYSTEM THAT IMPROVES OUTPATIENT EXPERIENCE Yu-L Huang Industral Engneerng Department New Mexco State Unversty Las Cruces, New Mexco 88003, U.S.A. Abstract Patent

More information