An efficient approach to improve throughput for TCP vegas in ad hoc network

Transcription

1 Inernaional Research Journal of Engineering and Technology (IRJET) e-issn: Volume: 0 Issue: 03 June-05 p-issn: An efficien approach o improve hroughpu for TCP vegas in ad hoc nework Payal Vispue, Elecronics and ele-communicaion, D.Y.Pail college of engg. Akurdi Pune, Maharashra, India Sayali N. Mane, Elecronics and ele-communicaion, D.Y.Pail college of engg. Akurdi Pune, Maharashra, India *** Absrac - The wireless communicaion Transmission Conrol Proocol (TCP) plays an imporan role in developing communicaion sysems which provides beer and reliable communicaion capabiliies in almos all kinds of neworking environmen. Vegas is much beer in performance as compare o oher TCP varians like TCP reno and new Reno because of is The simulaion resuls show ha he ICA for TCP has lower delay, higher hroughpu and more fair allocaion of bandwidh in muli-hops ad hoc scenarios. The relaed work is shown in secion. Secion 3 inroduces ICA (Improved Congesion Avoidance) for TCP vegas. Secion 4 formulaes he hroughpu model. Secion 5 describes he grey predicor. Q-Learning is as shown in packe delivery raio and full use of packe secion 6. Secion 7 shows obained resuls. The aricle ransmission bandwidh. Some parameers like concludes in secion 8. hroughpu and ransmission delay plays a vial role in vegas performance. The purpose of his paper is o conrol congesion and improve performance of cp. LITERATURE REVIEW vegas in mobile ad-hoc nework (MANET). The simulaion resuls show ha vegas has higher hroughpu and lower delay of whole nework and conrol congesion. Also, vegas has more capabiliies of bandwidh esimaion. Keywords: TCP Vegas; ICA for TCP Vegas; Throughpu model; Grey Predicor; Q-learning.. INTRODUCTION TCP vegas is known for is sable and brillian congesion conrol capabiliies. There are many compeiive versions of TCP like Weswood plus, Reno bu TCP vegas provides high hroughpu wih imum loss of packes. I is developed by Brakmo and Peerson in 99. Vegas is more reliable proocol because i provides congesion conrol before collision in ad hoc neworks. In mobile ad hoc neworks, vegas performs beer a hree aspecs-. RTT (Round rip ime) is prepared for he laer predicion of hroughpu.. Vegas halve he congesion window (cwnd) size by idenifying difference beween expeced hroughpu and acual hroughpu. 3. Vegas emphasize packe delay insead of packe loss by calculaing ransmission rae. F. U. Rashid, J. Singh, A. Panwar and M. Kumar [] have achieved beer oupu using TCP vegas. TCP vegas also provides large and effecive resuls han oher available compeiive versions like Reno and New Reno. I has been proved ha packe delivery raio using TCP vegas is much beer han oher varians. M. Jehan, Dr. G. Radhamani and T. Kalakumari [] have compared six differen TCP sandard congesion conrol algorihms namely BIC, cubic, TCP compound, vegas, reno and weswood congesion conrol algorihms. I is concluded ha vegas provides impressive and desired resuls like hroughpu. Also, vegas is bes suiable for small and acive mobile ad hoc nework. K. Tsiknas and G. Samaelos [3] have concenraed on he effec of suiable TCP varians on various adverse condiions of WiMax neworks like link congesions, asymmeric end o end capabiliies, wireless errors ec. G. Abed, M. Ismail and K. Jumari [4] have analyzed wo parameers like alpha and bea which play an imporan role in improving vegas performance. [5] Markov Decision Process is formulaed o deere TCP vegas performance. I also has been evaluaed ha segmen loss probabiliy plays a key role in a muli-hop scenario because of increased pah lengh which leads o a significan increase of segmen loss probabiliy. Z. H. Yuan, H. Venkaaraman and G. Munean [6] have proposed bandwidh esimaion scheme which esimaes he overall bandwidh for TCP raffic over 05, IRJET.NET- All Righs Reserved Page 83

2 Inernaional Research Journal of Engineering and Technology (IRJET) e-issn: Volume: 0 Issue: 03 June-05 p-issn: WLANs. The proposed bandwidh esimaion algorihm can also be exended for IEEE 80.e and IEEE 80.p. R. Belbachir, M. M. Zoulikha, A. Kies and B. Cousin [7] have illusraed a new echnique namely Accurae Bandwidh Reservaion ABR for bandwidh reservaion in MANET. ABR improves exising approach of bandwidh esimaion echniques on wireless links. C. Samios and M. Vernon [8] have proposed a simple and accurae model which is used o esimae he hroughpu of vegas as a funcion of packe loss rae, average round rip ime, imum observed round rip ime and proocol parameers like alpha and bea. K. Srijih, L. Jacob and A. Ananda [9] have proposed a modificaion in TCP vegas. TCP vegas-a was performed beer han TCP Reno in boh wired and saellie neworks. I overcome rerouing condiions in wired and flucuaing RTT in saellie neworks and overcome bias agains high bandwidh. 3. ICA FOR TCP VEGAS Vegas only calculae he expeced hroughpu by using round rip ime of TCP layer. I canno reflec he real hroughpu of whole nework. Based on nework siuaion of previous ime sep, vegas changes is congesion window. I gives idea of how o improve he whole nework performance by fuure predicion of hroughpu. ICA for TCP is a model which proposed o deal wih he problem of real achievable hroughpu of whole nework and online congesion conrol. Using difference (diff) beween expeced flow and acual flow, congesion window (cwnd) is adjused. Iniially value of alpha and bea is and 3 [0]. based on forward hroughpu predicion mechanism is used o promoe he online cwnd conrol. Q-learning is applied o search more reasonable changing size of congesion window. Fig : ICA for TCP Model 4. THROUGHPUT MODEL Throughpu model [0] concenraes on MAC sub layer. TCP hroughpu model is shown by equaion (3) and (4). In equaion (3) and (4), P and CW are Loss even rae and average size of congesion window respecively. p and p TO denoe segmen loss rae and probabiliy of imeou respecively. RTO is firs imeou of series imeou. A Th P B N * RTT p ( C D) TO (3) diff WindowSize SenDaa basertt AcualRTT () where, cwnd, diff < v_ cwnd cwnd, diff > v_ () unchanged, oher As shown in fig, ICA for TCP vegas has been proposed which has hree enhanced views in congesion avoidance sages. Three views are hroughpu model, grey predicion model and q learning model. Throughpu model calculaes he heoreical hroughpu. Grey predicion A CW * p, B CW * p, C p p RTO ( 4 )*, CW D ( log )* RTT. 4 05, IRJET.NET- All Righs Reserved Page 84

3 Inernaional Research Journal of Engineering and Technology (IRJET) e-issn: Volume: 0 Issue: 03 June-05 p-issn: CW 3 N ( pto ).( CW. p ) (4) For MAC layer, (Disribued Coordinaion Funcion) wih RTS and CTS is shown in figure (5) and parameers are shown in able (). Figure : scheme p DIFS 3. SIFS (5) RTS CTS macack p Process ime dp Delivery probabiliy ncdf D _ BER Dl dh CW number of compeiion channel daa flow probabiliy of node requess o send daa Bi error rae Packe size Table : Parameers of MAC layer Lengh of packe header Iniial size of cwnd D _ (7) CW rl lp ( a dp ) (8) drop Anoher imporan way o conrol he congesion is managemen model. Assume for managemen model, RED (Random Early Discard) is used. Loss probabiliy is as shown in equaion (9). and max are imal and maximal size of in every congesion conrol sage a ime. indicaes he average lengh a + ime. 0, lp, oherwise max, (9) Round rip ime and loss even rae are modified by considering MAC layer and managemen are calculaed as [0] p lp lp lp drop TCP ACK RTT P Q Where, _ (0) P ( lp ). p ( lp ). p drop Q ( lp ). p TCP _ ACK TCP _ ACK () The delivery probabiliy, probabiliy of node o send daa and loss probabiliy of one packe are given by equaion (6), (7) and (8),respecively. dp D BER ncdf dldh ( _ ).( ) (6) 5. GREY PREDICTOR Degree of daa can be shown by he colors in grey heory model. As daa increases, color ges deeper. The main purpose of grey heory is o predic oupu value for nex ime. Accumulaed Generaing Operaion (AGO) is 05, IRJET.NET- All Righs Reserved Page 85

4 Inernaional Research Journal of Engineering and Technology (IRJET) e-issn: Volume: 0 Issue: 03 June-05 p-issn: used o maximize smoohness and imize inerference by reducing randomness and volailiy of original daa. Using AGO iniial daa are generaed. The prediced value a + is used o decide wha acion congesion window should ake. 6. Q-LEARNING MODEL When large daa ransmi under limied bandwidh and less delay hen i is possible o send more packes and if more ransmission ime akes hen here is a use of less bandwidh. I is imporan o manage bandwidh properly in he nework and hence use vegas condiions. To change congesion window, RTT depends on differen values such as imum RTT and maximum RTT a each congesion conrol change. The inerval beween imum RTT and maximum RTT is he quanizaion of RTT. To improve quanizaion Markov Decision Model is bes. Q-learning process is one of he Markov process. 7. SIMULATION RESULTS Nework Simulaor is used o simulae ICA for TCP. In he scenarios, 50 o 50 mobile nodes move in a 000*000 meer recangular region. Normally channel capaciy of mobile nodes for speed is Mbps bu i may vary up o 4Mbps. Assume ha all mobile nodes move independenly wih same speed. All nodes have ransmission range is 50meers. Simulaion ime is 00 seconds. Fig 4: simulaion resul for nodes vs delay. The simulaion resuls for nodes vs hroughpu and nodes vs delay is as shown in figure (3) and (4) respecively. I shows ha he hroughpu of ICA for TCP is no sable because of environmenal awareness. 8. CONCLUSION The sudy of TCP vegas and is parameers such as hroughpu, ransmission delay is imporan in wireless ad hoc nework. The conclusion is TCP vegas is an algorihm which provides impressive and desired resuls. TCP vegas uses hroughpu model o improve performance of he nework and also i predics hroughpu for nex ime which helps o adjus congesion window. I is also observed ha NS simulaion ool is he bes way o illusrae and measure he performance of vegas in ad hoc nework. REFERENCES [] F. U. Rashid, J. Singh, A. Panwar and M. Kumar, Congesion conrol analysis over wireless ad hoc neworks, Inernaional journal of engineering research and echnology, vol., no. 5, pp , 03. Fig 3: Simulaion resul for nodes vs hroughpu. [] M. Jehan, Dr. G. Radhamani and T. Kalakumari, Vegas: beer performance han oher TCP congesion conrol algorihms on mane, Inernaional journal of compuer neworks(ijcn), vol. 3, no. 4, pp , 0. 05, IRJET.NET- All Righs Reserved Page 86

5 Inernaional Research Journal of Engineering and Technology (IRJET) e-issn: Volume: 0 Issue: 03 June-05 p-issn: [3] K. Tsiknas and G. Samaelos, Performance evaluaion of TCP in IEEE 80.6 neworks, IEEE wireless communicaions and neworking conference: mobile and wireless neworks, vol., no. 5, pp , 0. [4] G. Abed, M. Ismail and K. Jumari, Influence of parameers variaion of TCP Vegas in performance of congesion window over large bandwidh-delay neworks, 7h Asia-pacific conference on communicaions, vol. 7, no., pp , 0. [5] H. Xie, R. Pazzi and A. Boukerche, A novel cross layer TCP opimizaion proocol over wireless neworks by markov decision process, Wireless neworking symposium conference, vol., no. 5, pp , 0. [6] Z. H. Yuan, H. Venkaaraman and G. Munean, A novel bandwidh esimaion algorihm for IEEE 80. TCP daa ransmissions, Inernaional journal of compuer science and informaion securiy, vol. 3, no., pp ,0. [7] R. Belbachir, M. M. Zoulikha, A. Kies and B. Cousin, Bandwidh reservaion in mobile adhoc neworks, IEEE wireless communicaion and neworking conference: mobile and wireless neworks, vol., no., pp ,0. [8] C. Samios and M. Vernon, Modeling he Throughpu of TCP Vegas, Sigmerics pp , 003. [9] K. Srijih, L. Jacob and A. Ananda, TCP Vegas-A: Improving he Performance of TCP Vegas, Communicaion and Inerne Research Lab, pp , 003 [0] Y. Luo, M. Yin, H. Jiang and S. Ma, An improved congesion avoidance conrol model for TCP Vegas based on Ad Hoc neworks, pp , , IRJET.NET- All Righs Reserved Page 87