Performance Analysis of the Binary Exponential Backoff Algorithm for IEEE Based Mobile Ad Hoc Networks

Size: px
Start display at page:

Download "Performance Analysis of the Binary Exponential Backoff Algorithm for IEEE Based Mobile Ad Hoc Networks"

Transcription

1 Ths full text aer was eer revewed at the dreton of IEEE Counatons Soety subet atter exerts for ublaton n the IEEE ICC roeedngs Perforane Analyss of the Bnary Exonental Bakoff Algorth for IEEE 8. Based Moble Ad Ho Networks Y-Hua Zhu, Xan-Zhong Tan, and Jun Zheng Shool of Couter Sene and Tehnology, Zheang Unversty of Tehnology Hangzhou, Zheang 33, Chna Eal:{yhzhu, txz}@zut.edu.n Natonal Moble Counatons Researh aboratory Southeast Unversty Nanng, Jangsu 96, Chna Eal: unzheng@seu.edu.n Abstrat In an IEEE 8. based oble ad ho network (MANET, a network node aesses a oon wreless hannel through the dstrbuted oordnate funton (DCF, whh s rovded at the edu aess ontrol (MAC layer of the IEEE 8. standard. The bnary exonental bakoff (BEB algorth, whh uses slotted ontenton wndows, lays an ortant role n the DCF. Ths aer develos a atheatal odel for analyzng the erforane of the BEB algorth, whh takes nto aount the aket loss robablty of a wreless lnk. Based on the develoed atheatal odel, we derve the bakoff robablty dstrbuton of a node, the average nuber of bakoffs of a node, the average sze of a ontenton wndow, and the average aket delay. Moreover, we attet to fnd the otal value of the ntal ontenton wndow sze, to whh a node resets ts ontenton wndow sze after a suessful transsson, n order to avod the osllaton of the ontenton wndow sze and thus axze the utlzaton of the wreless hannel. Index Ters IEEE 8. standard; bnary exonental bakoff; oble ad ho network I. INTRODUCTION THE IEEE 8. standard [ sefes the hysal layer (PHY and edu aess ontrol (MAC layer of a wreless loal area network (WAN. At the MAC layer, ostve aknowledgeent (ACK s used to aheve relable delvery of data akets between network nodes. The reever of a data aket has to transt an ACK to the sender of the aket f t reeves the aket suessfully. The aket s onsdered lost and the sender has to retranst the aket f the sender does not reeve the ACK before the retranssson ter of the transtted aket tes out. The MAC layer rovdes the dstrbuted oordnate funton (DCF and the ont oordnate funton (PCF to suort and ontrol aess to the transsson hannel, where PCF s otonal whle DCF s andatory. DCF allows ultle ndeendent nodes to nterat wth eah other wthout a entral ontroller, whh s tyally sutable for oble ad ho networks (MANETs. The arrer sensng ultle aess/ollson avodane (CSMA/CA rotool and the bnary exonental bakoff (BEB algorth are two key DCF oonents that are used to avod aket ollsons. Wth the BEB algorth, a ontenton wndow s dvded nto a seres of te slots of equal length, whh are nubered n,,, CW. Here, CW s the axu slot nuber, whh s ntalzed to a onstant, CW n, and norally kees a value n [CW n, CW ax [. To redue the robablty that a aket ollson ours, a node randoly ks a value n [, CW to set ts bakoff ter and starts to transt ts data n the orresondng slot. However, ollsons ay stll our when two or ore nodes k the sae bakoff slot. To address ths roble, eah te a node enounters a aket ollson, the sze of ts ontenton wndow s doubled unless CW ax s reahed [. Meanwhle, the node randoly ks a bakoff slot n the nreased ontenton wndow for ts next transsson. As a result, the aket ollson robablty an be redued at the exense of nreasng the delay of the node to aess the hannel beause the robablty that the node ks a larger bakoff slot s nreased. The CW of the nreased ontenton wndow s reset to the ntal value CW n when the node has a suessful transsson [. Obvously, the value of CW has a bg at on the erforane of the BEB algorth. Aordng to exstng work, the BEB algorth s far fro satsfaton n rovng the network erforane n ters of aket delay and throughut [[3, and the standard BEB algorth ay ause unneessary long delay and low hannel untzaton [4. Moreover, resettng CW to CW n after eah suessful transsson ay ause an osllaton of the ontenton wndow sze n a network wth a large nuber of nodes, and thus affet the stablty of the network erforane. Therefore, t s desrable not to reset CW to ts ntal value after eah suessful transsson n order to stablze the network erforane [5. In [6, t s shown that an arorately hosen fxed CW sze an aheve a throughut erforane lose to that of the standard BEB algorth. Ths rases an nterestng queston: What s the otal sze of a fxed CW sze to axze the hannel untzaton and avod the throughut osllaton for a gven network? whh s the otvaton for ths work. In ths aer, we analyze the erforane of the BEB algorth used n a MANET and attet to answer the above entoned queston. The an ontrbutons of the aer //$6. IEEE

2 Ths full text aer was eer revewed at the dreton of IEEE Counatons Soety subet atter exerts for ublaton n the IEEE ICC roeedngs nlude the followng asets: A atheatal odel s develoed for dervng the aket ollson robablty of a node, the bakoff robablty dstrbuton of a node, the average nuber of bakoffs of a node, the average sze of a ontenton wndow, and the average aket delay. An otal value of the ntal ontenton wndow sze s roosed to avod the osllaton of the ontenton wndow sze and thus axze the utlzaton of the wreless hannel, whh s defned as the rato of the nuber of te slots n whh a node transts a aket wthout ollson to the total nuber of te slots. 3 It s found that unlke the aroxaton onluson ade n [7 the aket ollson robablty of a node wth the BEB algorth s a onstant regardless of the nuber of retransssons and the aket ollson robablty dereases as the sze of the ontenton wndow nreases when the nuber of nodes n the network s large. The reander of the aer s organzed as follows. Seton II revews related work. Seton III resents the atheatal odel and analyzes the erforane of the BEB algorth. Seton IV resents nueral results to nvestgate the aket ollson robablty and the otal ntal ontenton wndow sze for avodng osllaton of the ontenton wndow sze. In Seton V, we onlude the aer. II. REATED WORK The BEB algorth has reently reeved uh attenton and otvated a lot of researh work. In [, Cal et al. showed that, deendng on the network onfguraton, the BEB algorth gven n the IEEE 8. standard erfors far fro the theoretal throughut lt, and the throughut of the IEEE 8. rotool ould aroah the theoretal lt by arorately tunng the bakoff algorth. In [8, Nasr and Albalt roved the BEB algorth and roosed a hstory based adatve bakoff (HBAB algorth to rove the qualty of serve (QoS erforane based on the network status and ondton. Consderng that the bakoff araeters of the ollson avodane ehans n the latest verson of the IEEE 8. standard are far fro otal under heavy traff load or n an error-rone WAN envronent, Deng et al. roosed a dstrbuted algorth that allows a node to dynaally adust ts ontenton wndow based on the turn-round-te easureent of the hannel status [3. In [5, Ksentn et al. roosed a deternst ontenton wndow algorth (DCWA, whh s dfferent fro the BEB algorth n the IEEE 8. standard n that the DCWA nreases both the uer bound and the lower bound of the bakoff range. In [9, Gannoune nvestgated a non-lnear dyna adataton algorth that enables eah node to tune the sze of the nu ontenton wndow (CW n. In [, Ye and Tseng roosed a ulthan bakoff (MCB algorth, n whh a node s allowed to adat to dfferent ongeston levels by usng ore than one bakoff han together wth ollson events aused by nodes. In [, Nafaa rovded a sldng ontenton wndow (SCW algorth for eah network flow, whh s able to dynaally adust to hangng network ondtons but antan a searaton between dfferent serve lasses. In [, Ma and Roy ntrodued a ont ontenton wndow and transsson oortunty (CWTO adataton algorth to rove the aggregate throughut and network farness for ult-ell hgh densty WANs. Deste the above work, however, lttle work has analyzed the bakoff robablty dstrbuton of a node and studed the ontenton wndow sze osllaton roble n a MANET wth lossy wreless lnks, whh are the fouses of ths aer. III. PERFORMANCE MODE In ths seton, we develo a atheatal odel for analyzng the erforane of the BEB algorth based on the saturaton throughut assuton [7,.e., the transsson queue of eah node s always nonety. We defne the sze of a ontenton wndow as the nuber of te slots that the ontenton wndow ontans. Sne the nu and axu slot nubers n a ontenton wndow are and CW, resetvely, the sze of a ontenton wndow s equal to CW+. We assue that the sze of the ontenton wndow reahes CW ax after t s doubled tes, and let be the sze of the ontenton wndow after t s doubled tes (=,,,, where s the nu ontenton wndow sze,.e., =CW n +, and s the axu ontenton wndow sze,.e., =CW ax +. Meanwhle, we assue that there are n nodes n the network and use V to denote the set of nodes n the network. Under CSMA/CA, a node has to sense the wreless hannel before ts transsson. The BEB algorth s trggered when the node has sensed an dle erod of dstrbuted nter-frae sae (DIFS. Only when the bakoff ter of the node tes out s the node allowed to transt ts data. As desrbed earler, the ontenton wndow sze of a node s doubled unless s reahed every te the node enounters a ollson. As a result, dfferent nodes usually have dfferent ontenton wndow szes. We use W sze (v to denote the ontenton wndow sze of node v and defne G k ={v W sze (v= k } wth ardnalty G k (k=,,,. Thus, we have G n k k =, = G = V k = k, G Gk = Φ ( k. Obvously, a node belongs to one of G k (k=,,, at any te. Further, we defne that a node s n state f t has ontnuously erfored the BEB algorth for tes before a suessful transsson. We use node( to denote a node n state. Clearly, the ontenton wndow sze of node( satsfes: =, =,,, ; =, =+, +,.. As a result, the nodes n states,,, and - are nluded n G, G,, and G -, resetvely, whereas all the nodes n state, +, + are ontaned n G. et be the aket loss robablty of the wreless hannel and defne q=-. et, be the robablty that a aket ollson ours durng the aket transsson of node(, whh s trggered one the bakoff ter of node( tes out. Obvously, for any >, we have, =, due to =. Fg.

3 Ths full text aer was eer revewed at the dreton of IEEE Counatons Soety subet atter exerts for ublaton n the IEEE ICC roeedngs gves the state transton dagra of a node, n whh a rle stands for a state, an arrow reresents a state transton, and the exresson on an arrow s the transton robablty orresondng to the event of a state transton. Next we derve robablty,. Clearly,, =-,n, where,n s the robablty that node( transts wthout a ollson,.e., none of the other nodes n the network ks the sae bakoff slot as the one node( ks. We all node A olldes wth node B f node A and node B k the sae bakoff slot. Fg. State transton dagra Fg. Dfferent bakoff slots et x be the bakoff slot ked by node( wth ontenton wndow sze, and,n (x be the robablty that any other node n the network does not ollde wth node( n slot x. Clearly, node( randoly ks a slot n the set {,,, -} wth robablty /. Thus, the robablty that node( ks a artular te slot x and other nodes do not ollde wth node( n the te slot s equal to the rodut of,n (x and /, whh results n the robablty that node( transts wthout a ollson n any ked slot,.e.,, n =, n ( x. ( Notng that the nterval [, - an be dvded nto the ntervals: [, -, [, -, [, -, and [ -, -, Eq. ( an be rewrtten as, n = [ ( x + ( x + +,n ( x. (,n,n x = x = x = To derve,n, let us observe Fg., fro whh we an obtan the followng onlusons: For any x< (.f. x n Fg., any node n G olldes wth node( wth robablty / as eah node n G randoly ks a slot n the set {,,, -}, whh leads to the robablty that all the nodes n G do not ollde G wth node( beng ( /, where,,, and. Partularly, for, ths robablty beoes G ( / beause node( s also n G,.e., there are G - nodes n G, whh are lkely to ollde wth node(. Thus, the robablty that all the nodes n G, G,, and G do not ollde wth node( n slot x an be alulated as G G G, n ( x = ( ( ( = = +. (3 G = (, {,,, } x = Sung Eq. (3 leads to,n ( x = = ( G. (4 For x< (.f. x n Fg., any node n G does not ollde wth node(, but eah node n G, G,, and G olldes wth node( wth robablty /, /,, and /, resetvely, whh rodues G, n x = ( = (, where x {, +,, } wth - eleents. Thus, we have,n ( x = ( ( G. (5 3 For x< (.f. x n Fg., any node n G and G does not ollde wth node(, but eah node n G, G 3,, and G olldes wth node( wth robablty /,, / 3,, and /, resetvely, whh leads to G, n x = ( (, where x, +,, }. Thus, we have {,n ( x = ( ( G. (6 By observng Eq. (4-Eq. (6, we obtan the followng relatonsh: k G,n( x = ( k k (, (7 k where - and G = n. = = k k =,,,

4 Ths full text aer was eer revewed at the dreton of IEEE Counatons Soety subet atter exerts for ublaton n the IEEE ICC roeedngs Also, aordng to Eq. ( and Eq. (7, we have whh yelds G, n = ( k k ( k = k, (8 G, =, n = ( k k ( k = k, (9 where =,,,. et P be the robablty that a node s n state ( =,,. Thus, we have = P =. ( In Fg., we an obtan the followng set of flow-balanng equatons: P = P [ + (, P = P [ + (, P = P [ + (,, P + = P [ + (, P + = P + [ + (, whh are followed by P = P [ + (,, =,,, ;. ( P + = P [ + (, [ + (, =,,, Notng that < and, <, we have <+(-, <. Thus, fro the seond equaton n Eq. (, we have = P + = P = P [ + ( ( (,, = Eq. (-Eq. ( lead to P = + [ + ( = + ( (, [ + ( [ + (, [ + (,,,. ( (3 Thus, P, P,, P an be deterned based on Eq. (9, Eq. (3, and Eq. (. Fro Eq. ( and Eq. (, we an obtan the average ontenton wndow sze of a node,.e., avg = = P ( + P = = + ( ( P + = =, [ + ( = P +, [ + (,. (4 In addton, the average nuber of bakoffs before a suessful transsson s = N bakoff P, (5 = M whh s aroxately equal to P =, where M s a ostve nteger suh that P M s suffently lose to. It an be easly roved that the average nuber of a bakoff slot s (-/ f a node randoly ks a bakoff slot n a ontenton wndow wth sze,.e., the node ks a bakoff slot n,,, -. et τ be the duraton of a te slot used n the BEB algorth. Thus, the average delay for a node to suessfully transt a aket s T = avg delay τ. (6 IV. NUMERICA ANAYSIS In the revous seton, we derved the aket ollson robablty dstrbuton of a node, whh s gven by Eq. (9. Aordng to Eq. (9,, deends on G, G,, and G, whh are varyng wth the aket ollsons and are dffult to be exatly deterned beause the nodes n the network erfor the BEB algorth ndvdually. For ths reason, t s stll dffult to fnd the robablty dstrbuton for a gven n. However, we an onsder G, G,, and G as rando varables beause eah node ks ts te slot randoly. Therefore, to nvestgate the roertes of the derved robablty dstrbuton and the erforane of the BEB algorth, we randoly set G, G,, and G suh that G + G + + G = n. (7 We assue that CW n =5 and CW ax =3, whh orresonds to the frequeny ho PHY [. Thus, CW takes a value n the set {5, 3, 63, 7, 55, 5, 3}, whh are equvalent to =6 and =, =,,, (= 6. Usually, a real network has several tens of nodes. However, f the nuber of nodes n a network s too sall, t does not suffe to nvestgate the erforane of the BEB algorth. Ths s beause n that ase the robablty that two or ore nodes k the sae te slot that leads to a aket ollson would be very sall and as a result the ontenton wndow sze of a node ould rarely be doubled to reah the axu (.e., CW ax +=4. For ths reason, we onsder [, as the soe of n. In addton, we set =.,.4,.7, and.9, resetvely. Under the above assutons and settngs, we obtaned soe nueral results based on Eq. (4 to Eq. (6, whh are shown n Fg. 3 to Fg. 6. All the results are an average over 3 runs wth eah randoly rodung G (=,,, satsfyng Eq. (7.

5 Ths full text aer was eer revewed at the dreton of IEEE Counatons Soety subet atter exerts for ublaton n the IEEE ICC roeedngs Fg. 3 shows the aket ollson robablty wth dfferent node states when n=. It s seen that the aket ollson robablty dereases as a node oves fro the state wth a saller ontenton wndow sze to the one wth a larger sze. That s, the aket ollson robablty dereases as the sze of the ontenton wndow s doubled. Ths agrees wth our ntuton that the aket ollson robablty an be redued by nreasng the ontenton wndow sze of a node. The robablty of aket ollson when n= Node state Fg. 3 Paket ollson robablty Fgs. 4-6 show the ats of the nuber of nodes n a network (.e., n and the aket loss robablty of the wreless hannel (.e., on the average sze of a ontenton wndow (.e., avg, the average nuber of bakoffs (.e., N bakoff, and the average aket delay (T delay, resetvely. It s seen that avg, N bakoff, and T delay gradually nrease wth the nrease of n and/or, resetvely. Ths agrees wth our ntuton that the ore nodes a network has, the ore lkely a aket ollson ours, ausng the sze of a ontenton wndow, the nuber of bakoffs, and the delay to nrease; the hgher the aket loss robablty, the ore akets (nludng ACK akets are lost, ausng the node to nrease ts wndow sze and retranst. Also, the BEB algorth akes the ontenton wndow sze of a node osllate. For exale, n a network wth nodes (.e., n=, f the aket loss robablty =., the average ontenton wndow sze of a node s around (.f. Fg. 4. In ths ase, when a node has a suessful transsson, ts ontenton wndow sze s reset to =6 n the standard BEB algorth. Then, the node has to bakoff 3 tes before the next transsson. Sefally, t frst hanges ts ontenton wndow sze fro 6 to 3, then to 64 and to 8 so that t an k a slot wthout aket ollson. In soe ases, the osllaton of a ontenton wndow sze ould be larger. To avod the osllaton of the ontenton wndow sze, we an take advantage of Eq. (4 to fnd an otal sze ot and allow a node to reset ts ontenton wndow sze dretly to ot (.e., reset CW to ot - nstead of to (.e., reset CW to CW n. For exale, the osllaton n the above ase an be avoded f we allow the node to reset ts CW to 3 - (.e., 7 nstead of CW n (.e., 5. To ustfy ths la, we erfored a sulaton exerent usng MATAB, n whh we assued that n= and eah sulaton result was averaged over runs wth eah run lastng for a erod of 5 te slots. The average sze of the ententon wndow of a node, avg The average delay (μs, T delay The average nuber of bakoffs, N bakoff =. =.4 =.7 = The nuber of nodes, n Fg. 4 The ontenton wndow sze vs. the nuber of nodes =. =.4 =.7 = The nuber of nodes, n Fg. 5 The nuber of bakoffs vs. the nuber of nodes =. =.4 =.7 = The nuber of nodes, n Fg. 6 The average delay vs. the nuber of nodes Fg. 7 shows the at of the ntal sze of a ontenton wndow on the utlzaton of the wreless hannel. The hannel utlzaton value orresondng to a artular ntal sze value s obtaned by resettng the ontenton wndow sze of a node dretly to that ntal sze value one the node has a suessful transsson. It an be learly seen that the hannel utlzaton reahes the axu value f 8 s ked as the resettng

6 Ths full text aer was eer revewed at the dreton of IEEE Counatons Soety subet atter exerts for ublaton n the IEEE ICC roeedngs value of the ontenton wndow sze (.e., CW=7 when =.; whle the best ontenton wndow sze s 64 (.e., CW=63 for =.3. These ndate that based on Eq. (4 we an fnd an otal ontenton wndow sze that an axze the hannel utlzaton. Channel utlzaton =. =. =.3 = The ntal sze of a ontenton wndow Fg. 7 Channel utlzaton vs. the ntal ontenton wndow sze V. CONCUSION In a MANET, a node transts ts akets through ontenton for aessng a oon wreless hannel. The BEB algorth ntrodued n the IEEE 8. standard lays an ortant role n avodng aket ollsons and has a bg at on the utlzaton of the wreless hannel. However, the BEB algorth s far fro satsfaton n rovng the network erforane n ters of delay and throughut. In ths aer, we develoed a atheatal odel for analyzng the erforane of the BEB algorth used n a MANET wth lossy wreless lnks. Based on the develoed odel, we an analyze the erforane of the BEB algorth and fnd the otal ontenton wndow sze, whh s used by a node to reset ts CW after a suessful transsson so that the osllaton n the ontenton wndow sze s avoded and the utlzaton of the wreless hannel s thus axzed. In addton, we found that when the nuber of nodes n a network s large (e.g., ore than the aket ollson robablty of a node wth the BEB algorth dereases as the sze of ts ontenton wndow s doubled, whh agrees wth the ntuton that the node has less hane to k the sae bakoff te slot than other nodes f the ontenton wndow sze of the node s larger than those of other nodes. We noted that Banh obtaned the aroxaton onluson that eah aket olldes wth onstant and ndeendent robablty at eah transsson attet and regardless of the nuber of retranssson attet based on the sulaton results [7. Ths onluson s true for a network wth a sall nuber of nodes (e.g., no ore than 5 n whh the robablty that two or ore nodes k the sae bakoff te slot s very sall and thus the sze of the ontenton wndow s rarely doubled, whh leads the aket ollson robablty to be very lose. However, t ay not hold true for a network wth large nuber of nodes (e.g., nodes. ACKNOWEDGEMENT Ths work was suorted by the Natonal Natural Sene Foundaton of Chna under Grants No. 679 and No. 675, by the Zheang Provnal Key Sene & Tehnology Proet of Chna under Grant No. 9C433, and by Zheang Provnal Natural Sene Foundaton under Grant No. Z455. REFERENCES [ AN MAN Standards Cottee of the IEEE Couter Soety, IEEE 8. Standard wreless AN edu aess ontrol and hysal layer sefatons, June 997. [ F. Cal, M. Cont, E. Gregor, Dyna tunng of the IEEE 8. rotool to aheve a theoretal throughut lt, IEEE/ACM Transatons on Networkng, vol. 8, no. 6, De., [3 D.-J. Deng, C.-H. Ke, H.-H. Chen, et al, Contenton Wndow Otzaton for IEEE 8. DCF Aess Control, IEEE Transatons. on Wreless Counatons., vol. 7, no., De. 8, [4 Q. Pang, V.C.M. eung, and S. C. ew, Iroveent of WAN ontenton resoluton by loss dfferentaton, IEEE Transatons on Wreless Counatons, vol. 5, no., 6, [5 A. Ksentn, A. Nafaa, A. Guerou, and M. Na, Deternst ontenton wndow algorth for IEEE 8., n Pro. 5 IEEE 6th Internatonal Syosu on Personal, Indoor and Moble Rado Counatons (PIMR 5, Berln, Gerany, Set. 5, [6 K. Medeall and F. A. Tobag, On otzaton of CSMA/CA based wreless ANs: Part I - Iat of exonental bakoff, n Pro. 6 IEEE Internatonal Conferene on Counatons (ICC 6, vol. 5, Istanbul, Turkey, June 6, [7 G. Banh, Perforane analyss of the IEEE 8. Dstrbuted Coordnaton Funton, IEEE Journal on Seleted Areas n Counatons, vol. 8, no. 3, Marh, [8 Q. Nasr and M. Albalt, Iroved bakoff algorth for IEEE 8. networks, n Pro. 9 IEEE Internatonal Conferene on Networkng, Sensng, and Control, Okayaa, Jaan, Marh 6-9, 9,. -6. [9. Gannoune, A non-lnear dyna tunng of the nu ontenton wndow (CW n for enhaned serve dfferentaton n IEEE 8. ad-ho Networks, n Pro. 6 IEEE 63 rd Vehular Tehnology Conferene (VTC 6-Srng, Melbourne, Australa, May 6, [ S.-R. Ye and Y.-C. Tseng, A ulthan bakoff ehans for IEEE 8. WANs, IEEE Transatons on Vehular Tehnology, vol. 55, no. 5, Set. 6, [ A. Nafaa, A. Ksentn, and A. Mehaoua, Sldng ontenton wndow (SCW: Towards bakoff range-based serve dfferentaton over IEEE 8. wreless AN networks, IEEE Network, vol. 9, no. 4, July/August 5, [ H. Ma and S. Roy, Contenton wndow and transsson oortunty adataton for dense IEEE 8. WAN based on loss dfferentaton, n Pro. 8 IEEE Internatonal Conferene on Counatons (ICC 8, Beng, Chna, May 8,

Delay Analysis of Different Backoff Algorithms in IEEE

Delay Analysis of Different Backoff Algorithms in IEEE Delay Analyss of Dfferent Backoff Algorths n IEEE 82. Ivan N. Vukovc otorola Inc., 44 W. Sure Dr., Arlngton Heghts, IL, 64 USA, Ivan.Vukovc@otorola.co, (847) 632-5963, fax (847) 435-997 Abstract - In ths

More information

IEEE Distributed Coordination Function(DCF): Analysis and Enhancement *

IEEE Distributed Coordination Function(DCF): Analysis and Enhancement * IEEE 802. Dstrbuted Coordnaton Functon(DCF): Analyss and Enhanceent * Hatao Wu, Shduan Cheng, Yong Peng, Keng Long, Jan Ma 2 Natonal Key Lab of Swtchng Technology and Telecouncaton Networks, P.O.Box 206,

More information

Access Delay Analysis of IEEE DCF in the Presence of Hidden Stations

Access Delay Analysis of IEEE DCF in the Presence of Hidden Stations Access Delay Analyss of IEEE 82. DCF n the Presence of Hdden tatons Fu-Y Hung and Ivan Marsc CAIP Center, ECE Deartent, Rutgers Unversty Pscataway, NJ 8854-888 {fuyhung, arsc}@ca.rutgers.edu Abstract In

More information

QoS-Factor Transmission Control Mechanism for Voice over IP Network based on RTCP-XR Scheme

QoS-Factor Transmission Control Mechanism for Voice over IP Network based on RTCP-XR Scheme QoS-Fator Transsson Control Mehans for Voe over IP Network based on RTCP-XR Shee Jnsul K, Seung Ho Han, Hyun-Woo Lee, Won Ryu, and Mnsoo Hahn Abstrat Wth the nreasng deand for Internet telehony serves

More information

2016 International Conference on Sustainable Energy, Environment and Information Engineering (SEEIE 2016) ISBN:

2016 International Conference on Sustainable Energy, Environment and Information Engineering (SEEIE 2016) ISBN: 06 Internatonal Conference on Sustanable Energy, Envronent and Inforaton Engneerng (SEEIE 06) ISBN: 978--60595-337-3 A Study on IEEE 80. MAC Layer Msbehavor under Dfferent Back-off Algorths Trong Mnh HOANG,,

More information

FUZZY SEGMENTATION IN IMAGE PROCESSING

FUZZY SEGMENTATION IN IMAGE PROCESSING FUZZY SEGMENTATION IN IMAGE PROESSING uevas J. Er,, Zaldívar N. Danel,, Roas Raúl Free Unverstät Berln, Insttut für Inforat Tausstr. 9, D-495 Berln, Gerany. Tel. 0049-030-8385485, Fax. 0049-030-8387509

More information

Performance Improvement of the DSRC System Using a Novel S and Π-Decision Demapper

Performance Improvement of the DSRC System Using a Novel S and Π-Decision Demapper Wreless Sensor Network, 29,, 268-275 do:.4236/wsn.29.433 Publshed Onlne Noveber 29 (http://www.srp.org/journal/wsn). Perforane Iproveent of the DSRC Syste Usng a Novel S and Π-Deson Deapper Abstrat Jeh

More information

Minimize Congestion for Random-Walks in Networks via Local Adaptive Congestion Control

Minimize Congestion for Random-Walks in Networks via Local Adaptive Congestion Control Journal of Communatons Vol. 11, No. 6, June 2016 Mnmze Congeston for Random-Walks n Networks va Loal Adaptve Congeston Control Yang Lu, Y Shen, and Le Dng College of Informaton Sene and Tehnology, Nanjng

More information

Use of Colour and Shape Constraints in Vision-based Valve Operation by Robot

Use of Colour and Shape Constraints in Vision-based Valve Operation by Robot Use of Colour and Shae Constrants n Vson-based Valve Oeraton b Robot De Xu ; Mn Tan ; Zemn Jang & Huosheng Hu Ke Laborator of Comle Sstems and Intellgene Sene, Insttute of Automaton, Chnese Aadem of Senes,

More information

The ray density estimation of a CT system by a supervised learning algorithm

The ray density estimation of a CT system by a supervised learning algorithm Te ray densty estaton of a CT syste by a suervsed learnng algort Nae : Jongduk Baek Student ID : 5459 Toc y toc s to fnd te ray densty of a new CT syste by usng te learnng algort Background Snce te develoent

More information

The Simulation of Electromagnetic Suspension System Based on the Finite Element Analysis

The Simulation of Electromagnetic Suspension System Based on the Finite Element Analysis 308 JOURNAL OF COMPUTERS, VOL. 8, NO., FEBRUARY 03 The Smulaton of Suspenson System Based on the Fnte Element Analyss Zhengfeng Mng Shool of Eletron & Mahanal Engneerng, Xdan Unversty, X an, Chna Emal:

More information

An Energy-Aware QoS Routing Protocol for Wireless Sensor Networks

An Energy-Aware QoS Routing Protocol for Wireless Sensor Networks An Energy-Aware QoS Routng Protocol for Wreless Sensor Networks Abstract Recent advances n wreless sensor networks have led to any new routng rotocols secfcally desgned for sensor networks. Alost all of

More information

Modeling TCP Throughput: A Simple Model and its Empirical Validation

Modeling TCP Throughput: A Simple Model and its Empirical Validation Modelng TCP Throughut: A Smle Model and ts mrcal Valdaton Jtendra Padhye, Vctor Frou, Don Towsley, Jm Kuros 0-09-9 Presenter: Ognjen Vukovc Modelng TCP Throughut: A Smle Model and ts mrcal Valdaton Motvaton

More information

Research on Neural Network Model Based on Subtraction Clustering and Its Applications

Research on Neural Network Model Based on Subtraction Clustering and Its Applications Avalable onlne at www.senedret.om Physs Proeda 5 (01 ) 164 1647 01 Internatonal Conferene on Sold State Deves and Materals Sene Researh on Neural Networ Model Based on Subtraton Clusterng and Its Applatons

More information

Semi-analytic Evaluation of Quality of Service Parameters in Multihop Networks

Semi-analytic Evaluation of Quality of Service Parameters in Multihop Networks U J.T. (4): -4 (pr. 8) Sem-analyt Evaluaton of Qualty of Serve arameters n Multhop etworks Dobr tanassov Batovsk Faulty of Sene and Tehnology, ssumpton Unversty, Bangkok, Thaland bstrat

More information

On the End-to-end Call Acceptance and the Possibility of Deterministic QoS Guarantees in Ad hoc Wireless Networks

On the End-to-end Call Acceptance and the Possibility of Deterministic QoS Guarantees in Ad hoc Wireless Networks On the End-to-end Call Aeptane and the Possblty of Determnst QoS Guarantees n Ad ho Wreless Networks S. Srram T. heemarjuna Reddy Dept. of Computer Sene Dept. of Computer Sene and Engneerng Unversty of

More information

Algorithm for Computer Aided Design Curve Shape Form Generation of Knitting Patterns

Algorithm for Computer Aided Design Curve Shape Form Generation of Knitting Patterns Algorth for Couter Aded Desgn Curve Shae For Generaton of Knttng Patterns Elena Zahareva-Stoyanova Techncal Unversty of Gabrovo 4 H. Drat str. 500 Gabrovo, ulgara, hone +59 59 Abstract - The knttng ndustry

More information

Clustering incomplete data using kernel-based fuzzy c-means algorithm

Clustering incomplete data using kernel-based fuzzy c-means algorithm Clusterng noplete data usng ernel-based fuzzy -eans algorth Dao-Qang Zhang *, Song-Can Chen Departent of Coputer Sene and Engneerng, Nanjng Unversty of Aeronauts and Astronauts, Nanjng, 210016, People

More information

Session 4.2. Switching planning. Switching/Routing planning

Session 4.2. Switching planning. Switching/Routing planning ITU Semnar Warsaw Poland 6-0 Otober 2003 Sesson 4.2 Swthng/Routng plannng Network Plannng Strategy for evolvng Network Arhtetures Sesson 4.2- Swthng plannng Loaton problem : Optmal plaement of exhanges

More information

Solutions to Programming Assignment Five Interpolation and Numerical Differentiation

Solutions to Programming Assignment Five Interpolation and Numerical Differentiation College of Engneerng and Coputer Scence Mechancal Engneerng Departent Mechancal Engneerng 309 Nuercal Analyss of Engneerng Systes Sprng 04 Nuber: 537 Instructor: Larry Caretto Solutons to Prograng Assgnent

More information

On-line Scheduling Algorithm with Precedence Constraint in Embeded Real-time System

On-line Scheduling Algorithm with Precedence Constraint in Embeded Real-time System 00 rd Internatonal Conference on Coputer and Electrcal Engneerng (ICCEE 00 IPCSIT vol (0 (0 IACSIT Press, Sngapore DOI: 077/IPCSIT0VNo80 On-lne Schedulng Algorth wth Precedence Constrant n Ebeded Real-te

More information

Path Following Control of a Spherical Robot Rolling on an Inclined Plane

Path Following Control of a Spherical Robot Rolling on an Inclined Plane Sensors & ransduers, Vol., Speal Issue, May 3, pp. 4-47 Sensors & ransduers 3 by IFSA http://www.sensorsportal.om Path Followng Control of a Spheral Robot Rollng on an Inlned Plane ao Yu, Hanxu Sun, Qngxuan

More information

Introduction. Leslie Lamports Time, Clocks & the Ordering of Events in a Distributed System. Overview. Introduction Concepts: Time

Introduction. Leslie Lamports Time, Clocks & the Ordering of Events in a Distributed System. Overview. Introduction Concepts: Time Lesle Laports e, locks & the Orderng of Events n a Dstrbuted Syste Joseph Sprng Departent of oputer Scence Dstrbuted Systes and Securty Overvew Introducton he artal Orderng Logcal locks Orderng the Events

More information

Color Texture Classification using Modified Local Binary Patterns based on Intensity and Color Information

Color Texture Classification using Modified Local Binary Patterns based on Intensity and Color Information Color Texture Classfaton usng Modfed Loal Bnary Patterns based on Intensty and Color Informaton Shvashankar S. Department of Computer Sene Karnatak Unversty, Dharwad-580003 Karnataka,Inda shvashankars@kud.a.n

More information

Sums of exponential functions and their new fundamental properties

Sums of exponential functions and their new fundamental properties Sus of exonental functons and ther new fundaental roertes Yur K. Shestoaloff Abstract hs aer dscovers and roves the fundaental roertes of sus of exonental functon n the for of а heore that s stated as

More information

A New Scheduling Algorithm for Servers

A New Scheduling Algorithm for Servers A New Schedulng Algorth for Servers Nann Yao, Wenbn Yao, Shaobn Ca, and Jun N College of Coputer Scence and Technology, Harbn Engneerng Unversty, Harbn, Chna {yaonann, yaowenbn, cashaobn, nun}@hrbeu.edu.cn

More information

126 Int. J. Ad Hoc and Ubiquitous Computing, Vol. 1, No. 3, Djamel Djenouri*

126 Int. J. Ad Hoc and Ubiquitous Computing, Vol. 1, No. 3, Djamel Djenouri* 126 Int. J. Ad Hoc and Ubqutous Coputng, Vol. 1, No. 3, 2006 New power-aware routng protocol for oble ad hoc networks Djael Djenour* Basc Software Laboratory, CERIST Center of Research, Algers, Algera

More information

An Adaptive Batched Patch Caching Scheme for Multimedia Streaming *

An Adaptive Batched Patch Caching Scheme for Multimedia Streaming * An Adatve Batched Patch achng Schee for Multeda Streang * Shaohua Qn, Wehong He, Zu L, and Janng Hu School of outer Scence, Beng Unversty of Aeronautcs & Astronautcs, Beng 8,hna {shqn,annghu}@buaa.edu.cn

More information

A Novel Dynamic and Scalable Caching Algorithm of Proxy Server for Multimedia Objects

A Novel Dynamic and Scalable Caching Algorithm of Proxy Server for Multimedia Objects Journal of VLSI Sgnal Proessng 2007 * 2007 Sprnger Sene + Busness Meda, LLC. Manufatured n The Unted States. DOI: 10.1007/s11265-006-0024-7 A Novel Dynam and Salable Cahng Algorthm of Proxy Server for

More information

Connectivity in Fuzzy Soft graph and its Complement

Connectivity in Fuzzy Soft graph and its Complement IOSR Journal of Mathemats (IOSR-JM) e-issn: 2278-5728, p-issn: 2319-765X. Volume 1 Issue 5 Ver. IV (Sep. - Ot.2016), PP 95-99 www.osrjournals.org Connetvty n Fuzzy Soft graph and ts Complement Shashkala

More information

Bayesian Networks: Independencies and Inference. What Independencies does a Bayes Net Model?

Bayesian Networks: Independencies and Inference. What Independencies does a Bayes Net Model? Bayesan Networks: Indeendences and Inference Scott Daves and Andrew Moore Note to other teachers and users of these sldes. Andrew and Scott would be delghted f you found ths source materal useful n gvng

More information

TCP Performance over Current Cellular Access: A Comprehensive Analysis

TCP Performance over Current Cellular Access: A Comprehensive Analysis TCP Performane over Current Cellular Aess: A Comprehensve Analyss Eneko Atxuteg 1(B), Åke Arvdsson 2, Fdel Lberal 1, Karl-Johan Grnnemo 3, and Anna Brunstrom 3 1 Unversty of the Basque Country (UPV/EHU),

More information

Positive Semi-definite Programming Localization in Wireless Sensor Networks

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

More information

A Base Station-Coordinated Contention Resolution for IEEE PMP Networks

A Base Station-Coordinated Contention Resolution for IEEE PMP Networks A Base Staton-Coordnated Contenton Resoluton for IEEE 802.6 PMP Networks Wenyan Lu, Weja Ja,2, Wenfeng Du, and Ldong Ln 2 School of Informaton Scence & Engneerng, Central South Unversty, Changsha, 40083,

More information

Interval uncertain optimization of structures using Chebyshev meta-models

Interval uncertain optimization of structures using Chebyshev meta-models 0 th World Congress on Strutural and Multdsplnary Optmzaton May 9-24, 203, Orlando, Florda, USA Interval unertan optmzaton of strutures usng Chebyshev meta-models Jngla Wu, Zhen Luo, Nong Zhang (Tmes New

More information

Monte Carlo inference

Monte Carlo inference CS 3750 achne Learnng Lecture 0 onte Carlo nerence los Hauskrecht los@cs.ptt.edu 539 Sennott Square Iportance Saplng an approach or estatng the epectaton o a uncton relatve to soe dstrbuton target dstrbuton

More information

Generating Fuzzy Term Sets for Software Project Attributes using and Real Coded Genetic Algorithms

Generating Fuzzy Term Sets for Software Project Attributes using and Real Coded Genetic Algorithms Generatng Fuzzy Ter Sets for Software Proect Attrbutes usng Fuzzy C-Means C and Real Coded Genetc Algorths Al Idr, Ph.D., ENSIAS, Rabat Alan Abran, Ph.D., ETS, Montreal Azeddne Zah, FST, Fes Internatonal

More information

Zooming in Surrogate Optimization Using Convolute RBF. Masao Arakawa 1

Zooming in Surrogate Optimization Using Convolute RBF. Masao Arakawa 1 t World Congress on Structural and ultdsclnary Otsaton 7 t - t, June 5, Sydney Australa Zoong n Surrogate Otzaton Usng Convolute RBF asao Arakawa Kagawa Unversty, Takaatsu, JAPAN, arakawa@eng.kagawa-u.ac.j.

More information

An adaptive multi-objective genetic algorithm with fuzzy c-means for automatic data clustering

An adaptive multi-objective genetic algorithm with fuzzy c-means for automatic data clustering An adaptve ult-objetve genet algorth wth fuzzy -eans for autoat data lusterng Ze Dong, Hao Ja, and Mao Lu Departent of Autoaton, North Chna Eletr Power Unversty, Baodng 0700, Chna, Hebe Engneerng Researh

More information

Efficient Backoff Algorithm in Wireless Multihop Ad Hoc Networks

Efficient Backoff Algorithm in Wireless Multihop Ad Hoc Networks 1 Chen-Mn Wu, 2 Hu-Ka Su, 3 Wang-Has Yang *1,Correspondng Author Nanhua Unversty, cmwu@mal.nhu.edu.tw 2 Natonal Formosa Unversty, hksu@nfu.edu.tw 3 Hsupng Insttute of Technology, yangwh@mal.ht.edu.tw do:10.4156/jact.vol3.

More information

Analysis of Collaborative Distributed Admission Control in x Networks

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

More information

CASCAM: Crisp and Soft Classification Accuracy Measurement Software

CASCAM: Crisp and Soft Classification Accuracy Measurement Software CASCAM: Crs and Soft Classfaton Auray Measurement Software Mohammad A. Shalan, Manoj K. Arora and John Elgy Shool of Engneerng and Aled Senes, Aston Unversty, Brmngham, UK Deartment of Cvl Engneerng, IIT

More information

Parallelism for Nested Loops with Non-uniform and Flow Dependences

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

More information

Link Graph Analysis for Adult Images Classification

Link Graph Analysis for Adult Images Classification Lnk Graph Analyss for Adult Images Classfaton Evgeny Khartonov Insttute of Physs and Tehnology, Yandex LLC 90, 6 Lev Tolstoy st., khartonov@yandex-team.ru Anton Slesarev Insttute of Physs and Tehnology,

More information

Performance Improvement of TCP on Wireless Cellular Networks by Adaptive FEC Combined with Explicit Loss Notification

Performance Improvement of TCP on Wireless Cellular Networks by Adaptive FEC Combined with Explicit Loss Notification erformane Improvement of TC on Wireless Cellular Networks by Adaptive Combined with Expliit Loss tifiation Masahiro Miyoshi, Masashi Sugano, Masayuki Murata Department of Infomatis and Mathematial Siene,

More information

Dynamic Resource Discovery based on Preference and Movement Pattern Similarity for Large-Scale Social Internet-of-Things

Dynamic Resource Discovery based on Preference and Movement Pattern Similarity for Large-Scale Social Internet-of-Things > REPLACE THIS LINE WITH YOUR PAPER IDENTIFICATION NUMBER (DOUBLE-CLICK HERE TO EDIT) < 1 Dynac Resource Dscovery based on Preference and Moveent Pattern Slarty for Large-Scale Socal Internet-of-Thngs

More information

A study of Adaptive Replication Technique in routing time-constrained messages (VoIP) in MANET

A study of Adaptive Replication Technique in routing time-constrained messages (VoIP) in MANET A study of Adaptve Replcaton Technque n routng te-constraned essages (VoIP) n MANET SWATI SAXENA Research Scholar AIM & ACT Banasthal Vdyapth Banasthal, (Ra.) Dr. MADHAVI SINHA Asst. Prof. (HOD) Dept.

More information

Merging Results by Using Predicted Retrieval Effectiveness

Merging Results by Using Predicted Retrieval Effectiveness Mergng Results by Usng Predcted Retreval Effectveness Introducton Wen-Cheng Ln and Hsn-Hs Chen Departent of Coputer Scence and Inforaton Engneerng Natonal Tawan Unversty Tape, TAIWAN densln@nlg.cse.ntu.edu.tw;

More information

Equation Based Rate Control and Multiple Connections for Adaptive Video Streaming in Cellular Networks

Equation Based Rate Control and Multiple Connections for Adaptive Video Streaming in Cellular Networks Equaton Based Rate Control and Multple Connectons for Adaptve Vdeo Streang n Cellular Networks A. Mardanan Dehkord and V. Tabataba Vakl Abstract Rate control s an portant ssue for vdeo streang n cellular

More information

LOCAL BINARY PATTERNS AND ITS VARIANTS FOR FACE RECOGNITION

LOCAL BINARY PATTERNS AND ITS VARIANTS FOR FACE RECOGNITION IEEE-Internatonal Conferene on Reent Trends n Informaton Tehnology, ICRTIT 211 MIT, Anna Unversty, Chenna. June 3-5, 211 LOCAL BINARY PATTERNS AND ITS VARIANTS FOR FACE RECOGNITION K.Meena #1, Dr.A.Suruland

More information

Voice capacity of IEEE b WLANs

Voice capacity of IEEE b WLANs Voce capacty of IEEE 82.b WLANs D. S. Amanatads, V. Vtsas, A. Mantsars 2, I. Mavrds 2, P. Chatzmsos and A.C. Boucouvalas 3 Abstract-There s a tremendous growth n the deployment and usage of Wreless Local

More information

Routing Time-Constrained Traffic in Wireless Sensor Networks

Routing Time-Constrained Traffic in Wireless Sensor Networks Routng Te-Constraned Traffc n Wreless Sensor Networks Keal Akkaya and Mohaed Youns Departent of Coputer Scence and Electrcal Engneerng Unversty of Maryland, Baltore County Baltore, MD 2250 keal youns@cs.ubc.edu

More information

Analysis of ray stability and caustic formation in a layered moving fluid medium

Analysis of ray stability and caustic formation in a layered moving fluid medium Analyss of ray stablty and aust formaton n a layered movng flud medum Davd R. Bergman * Morrstown NJ Abstrat Caust formaton ours wthn a ray skeleton as optal or aoust felds propagate n a medum wth varable

More information

Adaptive Network Resource Management in IEEE Wireless Random Access MAC

Adaptive Network Resource Management in IEEE Wireless Random Access MAC Adaptve Network Resource Management n IEEE 802.11 Wreless Random Access MAC Hao Wang, Changcheng Huang, James Yan Department of Systems and Computer Engneerng Carleton Unversty, Ottawa, ON, Canada Abstract

More information

AVideoStabilizationMethodbasedonInterFrameImageMatchingScore

AVideoStabilizationMethodbasedonInterFrameImageMatchingScore Global Journal of Computer Sene and Tehnology: F Graphs & vson Volume 7 Issue Verson.0 Year 207 Type: Double Blnd Peer Revewed Internatonal Researh Journal Publsher: Global Journals In. (USA) Onlne ISSN:

More information

Steganalysis of DCT-Embedding Based Adaptive Steganography and YASS

Steganalysis of DCT-Embedding Based Adaptive Steganography and YASS Steganalyss of DCT-Embeddng Based Adaptve Steganography and YASS Qngzhong Lu Department of Computer Sene Sam Houston State Unversty Huntsvlle, TX 77341, U.S.A. lu@shsu.edu ABSTRACT Reently well-desgned

More information

Performance Evaluation of IEEE e based on ON-OFF Traffic Model I. Papapanagiotou PhD. Student

Performance Evaluation of IEEE e based on ON-OFF Traffic Model I. Papapanagiotou PhD. Student erformance Evaluaton of IEEE 82.e based on ON-OFF Traffc Model I. apapanagotou hd. Student Wreless Telecommuncaton Laboratory Unversty of atras 265 4 atras Greece papapanag@upnet.gr J.S. Vardakas hd. Student

More information

Time Synchronization in WSN: A survey Vikram Singh, Satyendra Sharma, Dr. T. P. Sharma NIT Hamirpur, India

Time Synchronization in WSN: A survey Vikram Singh, Satyendra Sharma, Dr. T. P. Sharma NIT Hamirpur, India Internatonal Journal of Enhaned Researh n Sene Tehnology & Engneerng, ISSN: 2319-7463 Vol. 2 Issue 5, May-2013, pp: (61-67), Avalable onlne at: www.erpublatons.om Tme Synhronzaton n WSN: A survey Vkram

More information

An Improved Image Segmentation Algorithm Based on the Otsu Method

An Improved Image Segmentation Algorithm Based on the Otsu Method 3th ACIS Internatonal Conference on Software Engneerng, Artfcal Intellgence, Networkng arallel/dstrbuted Computng An Improved Image Segmentaton Algorthm Based on the Otsu Method Mengxng Huang, enjao Yu,

More information

Gabor-Filtering-Based Completed Local Binary Patterns for Land-Use Scene Classification

Gabor-Filtering-Based Completed Local Binary Patterns for Land-Use Scene Classification Gabor-Flterng-Based Completed Loal Bnary Patterns for Land-Use Sene Classfaton Chen Chen 1, Lbng Zhou 2,*, Janzhong Guo 1,2, We L 3, Hongjun Su 4, Fangda Guo 5 1 Department of Eletral Engneerng, Unversty

More information

Simulation Based Analysis of FAST TCP using OMNET++

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

More information

Interclass Collision Protection for IEEE e Wireless LANs

Interclass Collision Protection for IEEE e Wireless LANs Interclass Collson Protecton for IEEE 82.e Wreless LANs Woon Sun Cho, Chae Y. Lee Dstrbuted Coordnaton Functon (DCF) n IEEE 82. and Enhanced Dstrbuted Channel Access (EDCA) n IEEE 82.e are contenton-based

More information

A New Token Allocation Algorithm for TCP Traffic in Diffserv Network

A New Token Allocation Algorithm for TCP Traffic in Diffserv Network A New Token Allocaton Algorthm for TCP Traffc n Dffserv Network A New Token Allocaton Algorthm for TCP Traffc n Dffserv Network S. Sudha and N. Ammasagounden Natonal Insttute of Technology, Truchrappall,

More information

Efficient Distributed File System (EDFS)

Efficient Distributed File System (EDFS) Effcent Dstrbuted Fle System (EDFS) (Sem-Centralzed) Debessay(Debsh) Fesehaye, Rahul Malk & Klara Naherstedt Unversty of Illnos-Urbana Champagn Contents Problem Statement, Related Work, EDFS Desgn Rate

More information

THE CONDENSED FUZZY K-NEAREST NEIGHBOR RULE BASED ON SAMPLE FUZZY ENTROPY

THE CONDENSED FUZZY K-NEAREST NEIGHBOR RULE BASED ON SAMPLE FUZZY ENTROPY Proceedngs of the 20 Internatonal Conference on Machne Learnng and Cybernetcs, Guln, 0-3 July, 20 THE CONDENSED FUZZY K-NEAREST NEIGHBOR RULE BASED ON SAMPLE FUZZY ENTROPY JUN-HAI ZHAI, NA LI, MENG-YAO

More information

An Analytical Model for IEEE Point-to-Point Link

An Analytical Model for IEEE Point-to-Point Link An Analytcal Model for IEEE 82. Pont-to-Pont Lnk Yong Yan, Xaowen hu Department of omputer cence, Hong Kong Baptst Unversty Emal: {yyan, chxw}@comp.hkbu.edu.hk Abstract - Wreless mesh networks have attracted

More information

Performance Analysis of Markov Modulated 1-Persistent CSMA/CA Protocols with Exponential Backoff Scheduling

Performance Analysis of Markov Modulated 1-Persistent CSMA/CA Protocols with Exponential Backoff Scheduling Performance Analyss of Markov Modulated -Persstent CSMA/CA Protocols wth ponental Backoff Schedulng Pu ng Wong, Dongje Yn, and Tony T. Lee, Abstract. Ths paper proposes a Markovan model of -persstent CSMA/CA

More information

EXTENDED SVD FLATNESS CONTROL. Per Erik Modén and Markus Holm ABB AB, Västerås, Sweden

EXTENDED SVD FLATNESS CONTROL. Per Erik Modén and Markus Holm ABB AB, Västerås, Sweden EXTENDED SVD FLATNESS CONTROL Per Erik Modén and Markus Hol ABB AB, Västerås, Sweden ABSTRACT Cold rolling ills soeties do not see able to control flatness as well as exected, taking into account the nuber

More information

Control strategies for network efficiency and resilience with route choice

Control strategies for network efficiency and resilience with route choice Control strateges for networ effcency and reslence wth route choce Andy Chow Ru Sha Centre for Transport Studes Unversty College London, UK Centralsed strateges UK 1 Centralsed strateges Some effectve

More information

Priority-Based Scheduling Algorithm for Downlink Traffics in IEEE Networks

Priority-Based Scheduling Algorithm for Downlink Traffics in IEEE Networks Prorty-Based Schedulng Algorthm for Downlnk Traffcs n IEEE 80.6 Networks Ja-Mng Lang, Jen-Jee Chen, You-Chun Wang, Yu-Chee Tseng, and Bao-Shuh P. Ln Department of Computer Scence Natonal Chao-Tung Unversty,

More information

Pattern Classification of Back-Propagation Algorithm Using Exclusive Connecting Network

Pattern Classification of Back-Propagation Algorithm Using Exclusive Connecting Network World Acade of Scence, Engneerng and Technolog 36 7 Pattern Classfcaton of Bac-Propagaton Algorth Usng Eclusve Connectng Networ Insung Jung, and G-Na Wang Abstract The obectve of ths paper s to a desgn

More information

Multi-hop Fast Conflict Resolution Algorithm for Ad Hoc Networks

Multi-hop Fast Conflict Resolution Algorithm for Ad Hoc Networks Multi-hop Fast Conflit Resolution Algorithm for Ad Ho Networks Shengwei Wang 1, Jun Liu 2,*, Wei Cai 2, Minghao Yin 2, Lingyun Zhou 2, and Hui Hao 3 1 Power Emergeny Center, Sihuan Eletri Power Corporation,

More information

Progressive scan conversion based on edge-dependent interpolation using fuzzy logic

Progressive scan conversion based on edge-dependent interpolation using fuzzy logic Progressve san onverson based on edge-dependent nterpolaton usng fuzzy log P. Brox brox@mse.nm.es I. Baturone lum@mse.nm.es Insttuto de Mroeletróna de Sevlla, Centro Naonal de Mroeletróna Avda. Rena Meredes

More information

Light Weight Distributed QoS Adapter in Large-Scale Ad hoc Networks. Seyed Hossein Hosseini Nazhad Ghazani 1, R.M.Alguliev 2

Light Weight Distributed QoS Adapter in Large-Scale Ad hoc Networks. Seyed Hossein Hosseini Nazhad Ghazani 1, R.M.Alguliev 2 Lght Weght Dstruted QoS Adapter n Large-Scale Ad hoc Networs Seyed Hossen Hossen Nazhad Ghazan, R.M.Algulev 2 Ph.D. Canddate, Insttute of Inforaton Technology of ANAS, Bau, Azerajan 2 Doctor of Techncal

More information

SOCIAL networking is among the fastest growing information

SOCIAL networking is among the fastest growing information IEEE TRANSACTIONS ON PARALLEL AND DISTRIBTED SYSTEMS, VOL. 26, NO. 5, MAY 2015 1301 Effent Data Query n Intermttently-Conneted Moble Ad Ho Soal Networks Yang Lu, Student Member, IEEE, Yanyan Han, Zhpeng

More information

Agent-based Traffic Simulation and Traffic Signal Timing Optimization with GPU Zhen Shen, Kai Wang, Fenghua Zhu

Agent-based Traffic Simulation and Traffic Signal Timing Optimization with GPU Zhen Shen, Kai Wang, Fenghua Zhu 20 4th Internatonal IEEE Conferene on Intellgent Transportaton Systes Washngton, DC, USA. Otober 5-7, 20 Agent-based Traff Sulaton and Traff Sgnal Tng Optzaton wth GPU Zhen Shen, Ka Wang, Fenghua Zhu Abstrat

More information

Remote Sensing Image Segmentation Algorithm Based on Multi-agent and Fuzzy Clustering

Remote Sensing Image Segmentation Algorithm Based on Multi-agent and Fuzzy Clustering 017 nd International Conferene on Environental Siene and Energy Engineering (ICESEE 017) ISB: 978-1-60595-417- Reote Sensing Iage Segentation Algorith Based on Multi-agent and Fuzzy Clustering Lei LIU,

More information

AN ALGORITHM FOR ODD GRACEFULNESS OF THE TENSOR PRODUCT OF TWO LINE GRAPHS

AN ALGORITHM FOR ODD GRACEFULNESS OF THE TENSOR PRODUCT OF TWO LINE GRAPHS Internatonal ournal on applcatons of graph theory n wreless ad hoc networks and sensor networks (GRAPH-HOC) Vol.3, No., March 0 AN ALGORITHM FOR ODD GRACEFULNESS OF THE TENSOR PRODUCT OF TWO LINE GRAPHS

More information

An Adaptive Sleep Strategy for Energy Conservation in Wireless Sensor Networks

An Adaptive Sleep Strategy for Energy Conservation in Wireless Sensor Networks An Adaptve Sleep Strategy for Energy Conservaton n Wreless Sensor Networks Guseppe Anastas, Marco Cont, Maro D Francesco Abstract - In recent years, wreless sensor network deployents for real lfe applcatons

More information

Real-Time Guarantees. Traffic Characteristics. Flow Control

Real-Time Guarantees. Traffic Characteristics. Flow Control Real-Tme Guarantees Requrements on RT communcaton protocols: delay (response s) small jtter small throughput hgh error detecton at recever (and sender) small error detecton latency no thrashng under peak

More information

An Efficient Fault-Tolerant Multi-Bus Data Scheduling Algorithm Based on Replication and Deallocation

An Efficient Fault-Tolerant Multi-Bus Data Scheduling Algorithm Based on Replication and Deallocation BULGARIAN ACADEMY OF SCIENCES CYBERNETICS AND INFORMATION TECHNOLOGIES Volue 16, No Sofa 016 Prnt ISSN: 1311-970; Onlne ISSN: 1314-4081 DOI: 10.1515/cat-016-001 An Effcent Fault-Tolerant Mult-Bus Data

More information

1 Calculation and Analysis of Buffer

1 Calculation and Analysis of Buffer Sep. 5 Journal of Electronc Scence and Technology of Chna Vol.3 No.3 ` Calculaton and Analyss of Destnaton Buffer for ulteda Servce n ole Ad Hoc Network ZHOU Zhong, AO Yu-ng, JIANG Zh-qong. School of Councaton

More information

Adaptive Class Preserving Representation for Image Classification

Adaptive Class Preserving Representation for Image Classification Adaptve Class Preservng Representaton for Image Classfaton Jan-Xun M,, Qankun Fu,, Wesheng L, Chongqng Key Laboratory of Computatonal Intellgene, Chongqng Unversty of Posts and eleommunatons, Chongqng,

More information

A Real-Time Detecting Algorithm for Tracking Community Structure of Dynamic Networks

A Real-Time Detecting Algorithm for Tracking Community Structure of Dynamic Networks A Real-Tme Detetng Algorthm for Trakng Communty Struture of Dynam Networks Jaxng Shang*, Lanhen Lu*, Feng Xe, Zhen Chen, Jaa Mao, Xueln Fang, Cheng Wu* Department of Automaton, Tsnghua Unversty, Beng,,

More information

Outline. Third Programming Project Two-Dimensional Arrays. Files You Can Download. Exercise 8 Linear Regression. General Regression

Outline. Third Programming Project Two-Dimensional Arrays. Files You Can Download. Exercise 8 Linear Regression. General Regression Project 3 Two-densonal arras Ma 9, 6 Thrd Prograng Project Two-Densonal Arras Larr Caretto Coputer Scence 6 Coputng n Engneerng and Scence Ma 9, 6 Outlne Quz three on Thursda for full lab perod See saple

More information

A Clustering Algorithm for Chinese Adjectives and Nouns 1

A Clustering Algorithm for Chinese Adjectives and Nouns 1 Clusterng lgorthm for Chnese dectves and ouns Yang Wen, Chunfa Yuan, Changnng Huang 2 State Key aboratory of Intellgent Technology and System Deptartment of Computer Scence & Technology, Tsnghua Unversty,

More information

A Low-Overhead Routing Protocol for Ad Hoc Networks with selfish nodes

A Low-Overhead Routing Protocol for Ad Hoc Networks with selfish nodes A Low-Oerhead Routng Protocol for Ad Hoc Networks wth selfsh nodes Dongbn Wang 1, Xaofeng Wang 2, Xangzhan Yu 3, Kacheng Q 1, Zhbn Xa 1 1 School of Software Engneerng, Bejng Unersty of Posts and Telecommuncatons,100876,

More information

An Accurate Evaluation of Integrals in Convex and Non convex Polygonal Domain by Twelve Node Quadrilateral Finite Element Method

An Accurate Evaluation of Integrals in Convex and Non convex Polygonal Domain by Twelve Node Quadrilateral Finite Element Method Internatonal Journal of Computatonal and Appled Mathematcs. ISSN 89-4966 Volume, Number (07), pp. 33-4 Research Inda Publcatons http://www.rpublcaton.com An Accurate Evaluaton of Integrals n Convex and

More information

Analysis of Malaysian Wind Direction Data Using ORIANA

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

More information

Adaptive Energy and Location Aware Routing in Wireless Sensor Network

Adaptive Energy and Location Aware Routing in Wireless Sensor Network Adaptve Energy and Locaton Aware Routng n Wreless Sensor Network Hong Fu 1,1, Xaomng Wang 1, Yngshu L 1 Department of Computer Scence, Shaanx Normal Unversty, X an, Chna, 71006 fuhong433@gmal.com {wangxmsnnu@hotmal.cn}

More information

Keywords: Cloud Computing, Resource Allocation, Queueing Theory, Performance Measures.

Keywords: Cloud Computing, Resource Allocation, Queueing Theory, Performance Measures. Volume, Issue 9, Setember ISSN: 77 8X Internatonal Journal of Advanced Research n Comuter Scence and Software Engneerng Research Paer Avalable onlne at: wwwjarcssecom Resource Allocaton n Cloud Comutng

More information

An extended target tracking model with multiple random matrices and unified kinematics

An extended target tracking model with multiple random matrices and unified kinematics 1 An etended target tracng odel wth ultle rando atrces and unfed neatcs Karl Granströ arxv:146.13v1 [cs.sy] 9 Jun 14 Abstract Ths aer resents a odel for tracng of etended targets, where each target s reresented

More information

136 IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, VOL. 6, NO. 1, JANUARY Ching-Ling Huang and Wanjiun Liao, Senior Member, IEEE

136 IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, VOL. 6, NO. 1, JANUARY Ching-Ling Huang and Wanjiun Liao, Senior Member, IEEE 136 IEEE TRANSACTIONS ON WIRELESS COMMUNICATIONS, VOL. 6, NO. 1, JANUARY 2007 Throughput and Delay Performance of IEEE 802.11e Enhanced Dstrbuted Channel Access (EDCA) Under Saturaton Condton Chng-Lng

More information

Simulation and Exploration of RCP in the networks

Simulation and Exploration of RCP in the networks EE384Y Smulaton and Exploraton of P n the networks Sprng, 003 Smulaton and Exploraton of P n the networks hanghua He changhua@stanford.edu June 06, 003 Abstract P (ate ontrol Protocol) s a rate-based congeston

More information

Bias Error Reduction of Digital Image Correlation Based on Kernel

Bias Error Reduction of Digital Image Correlation Based on Kernel Vol.81 (CST 15),.16- htt://dx.doi.org/1.1457/astl.15.81.4 Bias Error Redution of Digital Image Correlation Based on Kernel Huan Shen 1,, eize Zhang 1, and Xiang Shen 1 Energy and ower College, anjing Uniersity

More information

Maintaining temporal validity of real-time data on non-continuously executing resources

Maintaining temporal validity of real-time data on non-continuously executing resources Mantanng temporal valdty of real-tme data on non-contnuously executng resources Tan Ba, Hong Lu and Juan Yang Hunan Insttute of Scence and Technology, College of Computer Scence, 44, Yueyang, Chna Wuhan

More information

X- Chart Using ANOM Approach

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

More information

Dynamic wetting property investigation of AFM tips in micro/nanoscale

Dynamic wetting property investigation of AFM tips in micro/nanoscale Dynamc wettng property nvestgaton of AFM tps n mcro/nanoscale The wettng propertes of AFM probe tps are of concern n AFM tp related force measurement, fabrcaton, and manpulaton technques, such as dp-pen

More information

Extension and Comparison of QoS-Enabled Wi-Fi Models in the Presence of Errors

Extension and Comparison of QoS-Enabled Wi-Fi Models in the Presence of Errors Extenson and Comparson of QoS-Enabled W-F Models n the Presence of Errors Ioanns Papapanagotou, Georgos S. Paschos*, Stavros A. Kotsopoulos** and Mchael Devetskots Electrcal and Computer Engneerng, North

More information

A New Robotic 3D Inspection System of Automotive Screw Hole

A New Robotic 3D Inspection System of Automotive Screw Hole 740 Moon-Hong Baeg, Internatonal Seung-Ho Journal Baeg, of Control, Chanwoo Autoaton, Moon, Gu-Mn and Jeong, Sstes, Hun-Sk vol. 6, no. Ahn, 5, and pp. 740-745, Do-Hun Otober K 2008 A New Robot 3D Inspeton

More information