Packet loss in k-path routing and single shortest path routing in MANET

Transcription

1 Sushil Chadra Dimri / Iteratioal Joural of Comuter Sciece Egieerig (IJCSE Pacet loss i -ath routig ad sigle shortest ath routig i MANET Sushil Chadra Dimri Professor ad Head Grahic Era Uiversity Dehradu, Idia Sushil.dimri82@gmail.com Abstract Whe we tal about ad hoc etwor, the it is quite obvious that odes are ot steady ad there is o fixed static architecture. Routig is a very imortat factor i mobile ad hoc etwor which eables MANET ot oly to wor well with a small size etwor, but also to wor well with dyamically exaded huge etwor. This aer studies the ossibility of acet loss ad cogestio i - ath routig ad sigle shortest ath routig i MANET. Keywords--ath routig, Cogestio Cotrol, acet loss robability. I. INTRODUCTION Mobile Ad hoc etwor is a self-cofigurig, self-orgaizig ad self-maitaiig dyamic etwor. A mobile ad hoc etwor (MANET is a etwor cosistig of a set of mobile odes with o cetralized admiistratio [1, 2]. The movemet of odes is radom i MANET. Therefore MANETs have a dyamic toology. There are lots of issues ad challeges i desigig a MANET etwor.i MANET each ode acts as a tras-receiver, a router, which hels i forwardig acets from a source to destiatio. MANET odes ca be ersoal devices such as la-to, mobile hoes ad ersoal digital assistat.manet ca chage locatios ad cofigure itself. Mobile ad hoc etwors are suited for use i situatios where a ifrastructure is uavailable.alicatio area of MANET icludes military alicatios, at local level such as classrooms, coferece, emergecy oeratios, busiess alicatios ad also used i VANET (Vehicular Ad hoc etwor[3,4 ad 5]. Figure 1.0 shows a simle mobile ad hoc etwor. N 1 N 3 N 2 Figure 1.0 Simle Mobile ad-hoc etwor 1.1. Cogestio i MANET: Cogestio is a situatio i commuicatio etwors i which too may acets are reset i a art of the subet. Cogestio may occur whe umber of acets sed to the etwor is greater tha the caacity of the etwor (umber of acets a etwor ca hadle. Cogestio leads to acet losses ad badwidth degradatio ad waste of time ad eergy.i Iteret whe cogestio occurs it is ormally cocetrated o a sigle router, whereas, due to the shared medium of the MANET cogestio will ot over-load the mobile odes but has a effect o the etire coverage area [6, 7].Whe the routig rotocols i MANET are ot coscious about the cogestio, it results i the followig issues ISSN : Vol. 4 No.05 Se

2 Sushil Chadra Dimri / Iteratioal Joural of Comuter Sciece Egieerig (IJCSE Log delay:this holds u the rocess of detectig the cogestio. Whe the cogestio is more rigorous, it is better to select a alterate ath. High overhead:more rocessig ad commuicatio attemts are required for a ew route discovery. If the multiath routig is utilized, it eeds additioal effort for uholdig the multiath regardless of the existece of alterate route. Pacet losses: The cogestio cotrol techique attemts to miimize the excess load i the etwor by either reducig the sedig rate at the seder side or by droig the acets at the itermediate odes or by executig both the rocess. This causes icreased acet loss rate or miimum throughut [8, 9 ad 10] II. PROBLEM DEFINITION: This aer comares both the scheme of sigle ath routig ad ath slittable routig i MANET. I MANETs commuicatio betwee odes is doe through the wireless medium. Because odes are mobile ad may joi or leave the etwor so MANET have a dyamic toology. Nodes that are i trasmissio rage of each other are called eighbors. The eighbors ca sed data directly to each other however whe a ode eeds to sed data to aother o eighborig ode the data is routed through a sequece of multile hos, with itermediate odes actig as routers [11, 12]. As a result of these issues, MANETs are roe to umerous tyes of faults which icludes i Trasmissio error ii Node failures iii Li failures iv Route breaages v Cogested ode 2.1Sigle shortest ath routig: I sigle shortest ath routig oly a sigle shortest route is used betwee source ad destiatio ode. I MANET, sigle shortest ath routig is ot a effective routig techique secially whe there are may costraits. Sigle ath routig seds etire traffic via a sigle route from source to destiatio. I MANET, the li caacity(badwidth,the memory ad rocessig ower of the odes are limited so that they caot hadle high amout of traffic, which geerally leads to cogestio,acet loss, formatio of hot sots i the etwor. As a cosequeces the ed to ed delay ad ureliability of the etwor icreases. I sigle ath routig, if a li breas or a ode fails it leads to the etwor failure, i.e. o trasmissio occurs betwee source S ad destiatio D. [13] Let the arrival rate of acets is λ.destiatio λ S Source Figure1.1: Sigle-ath Routig D III. PACKET LOSS IN SINGLE SHORTEST -PATH ROUTING: Pacet losses are caused by either li errors or etwor cogestio. First, letus derive the exressio for acet loss due to li errors. Let the robability of acetloss o a li is, the robability of successfully trasmittig a acet o a li is (1. Aacet must be successfully trasmitted over all N l lis alog the route to reach thedestiatio. Therefore, the robability of successfully trasmittig a acet over N l lis from the source to the destiatio is ssucc {( 1.( 1...( 1 } times // usig Multilicative rule of Probability // (1 (1.1 ssucc Thus, the robability of acet loss o a route is: P 1 ( 1 sloss (1.2 Let us ow derive the formula for the robability of acet loss due to cogestio. Let us assume that the queue M M FIFO Q queue. legth for a ode i the etwor is, for a / /1: / l / ISSN : Vol. 4 No.05 Se

3 Sushil Chadra Dimri / Iteratioal Joural of Comuter Sciece Egieerig (IJCSE The robability of havig acets i the queue is: ( 1 (1.3 1 ( 1 Where / is the traffic desity, Pacets are droed whe the queue is full (=. Therefore, the robability of a acet lossdue to cogestio is: ( 1 1 ( 1 (1.4 Therefore, the et robability sloss sloss sloss 1 ( 1 sloss of acet loss is: l ( 1 (1.5 1 ( 1 Q IV. K-PATH ROUTING IN MANET: Slittig the traffic to differet routes ca rovide better load balacig, fault tolerace ad higher aggregate badwidth. Slittig of the traffic ca be helful i reductio of cogestio, bottle ecs ad miimizatio of the mea system delay; this also imroves etwor resource utilizatio ad badwidth otimizatio [11, 13]. 4.1 Networ model for -slittable routig: The sigle-ath model is cosidered as a multi-ode M / M /1: FIFO / / tadem etwor, ad the - ath model as a set of - arallel ath. The roosed framewor allows us to ivestigate issues such as otimal load distributio, ed-to-ed delay ad - ath routig reliability i ad hoc etwors. There are ode, li disjoited aths, which forms a sub grah i existig etwor. This sub grah is aroximately a rectagular regio, its size deed o source destiatio searatio ad the ode desity. To model each multi-ho ath, a multi ode M / M /1: FIFO / / tadem etwor is cosidered [14, 15 ad 16]. λ 1 μ μ λ S D λ λ μ μ μ μ Figure 1.2: Multi-ho, M/M/1, with iut arrivalad rocessig rate Let there are aths betwee source S ad destiatio D, Assumig a ath 1, 2 cosists of I itermediate relayig ode.the role of itermediate odes is just to forward the traffic to the aother ode i the directio of destiatio. Let µ is the rocessig ower of each ode. Sice λ is the forwardig traffic therefore igorig the mea system delay, all the divided traffic will reach to the destiatio at the same time.so the arrival rate at destiatio will remai λ. ISSN : Vol. 4 No.05 Se

4 Sushil Chadra Dimri / Iteratioal Joural of Comuter Sciece Egieerig (IJCSE Suose a traffic flow with average assio arrival rate λ exist betwee source ad destiatio, this traffic is the slitted i -ode disjoited aths, let the traffic alog ath is, 1, 2,,. (1.6 1 Each route will behave lie a sigle ath from source S to destiatio D.Thus robability of successful trasmissio of acet will be, succ trasmissio. 1 ( 1, for route 1, N l1 are the umber of lis where succ Sice there are routes thesimilarly we have is robability i case of successful succ (1 2,for route 2,----, for route, succ (1 So robability of o li error o all the routes 1 2 { (.(.1 ( } So robability of Pacet loss due to li error 1 N l 2 i 1 {( 1.( 1...( 1 } 1 ( 1 (1.7 lloss Let us ow derive the formula for the robability of acet loss due to cogestio. Let usassume that the queue legth for a ode i the etwor is, for a M / M /1: FIFO / / queue The robability of havig acets i the queue is: i 1 ( 1 1 ( 1 (1.8 Where, / is the traffic desity. Pacets are droed whe the queue is full (=. Therefore, the robability of a acet lostdue to cogestio is: ( 1 1 ( 1 (1.9 Therefore, the et robability los s loss los s los s of acet loss is: i ( (2.0 i 1 {1 ( } ( 1 V. ANALYSIS OF RESULTS: The robability of acet loss i asigle shortest route ad i disjoited multile routes are give below sloss 1 ( 1 N l ( 1 1, ( 1 los s i 1 i {1 ( 1 } ( 1 ( 1 1 If we aalyze these two, we get that oly the first comoet is differet i both the exressios i.e. ISSN : Vol. 4 No.05 Se

5 Sushil Chadra Dimri / Iteratioal Joural of Comuter Sciece Egieerig (IJCSE N l i (1 ( 1 Ad (1 ( 1 N, certaily l = N li for some i (1, 2, --,. Thus clearly we have i 1 N l i } i. e. ( 1 ( 1. N l1 N l 2 ( 1 {( 1.( 1...(1 i1 So we have i l {1 ( 1 N } ( 1 } { 1 which clearly shows that the acet loss i -ath i 1 routig is higher i comariso to sigle shortest ath. VI. CONCLUSION: Slittig the traffic to -differet routes ca rovide better load balacig, fault tolerace ad higher aggregate badwidth. Slittig of the traffic ca be helful i reductio of cogestio, bottle ecs ad i miimizatio of the mea system delay. This also imroves etwor resource utilizatio ad badwidth otimizatio but i terms of acet loss the scheme does ot seems better as i comariso to -ath routig the acet loss robability is less i sigle source shortest ath routig. Refereces: [1] K. Sudaresa, V. Aatharama,, H.Y. Hsieh ad R. Sivaumar. ATP: A Reliable Trasort Protocol for Ad-hoc Networs. I MobiHoc 03: Proceedigs of the 4th ACM Iteratioal Symosium o Mobile Ad Hoc Networig & Comutig, ages 64 75, Jue [2] L. Zhag, Z. Zhao, Y. Shu, L. Wag ad O.W.W. Yag, Load Balacigof Multiath Source Routig i Ad Hoc Networs, i ICC 2002, , Aril [3] Y. Gajali ad A. Keshavarzia, Load Balacig i Ad Hoc Networs:Sigle-ath Routig vs. Multi-ath Routig, i INFOCOM 2004, March2004. [4] S.Murthy ad J.J. Garcia-Lua-Aceves, A efficiet routig rotocol for wireless etwors, ACM Mobile Networs ad Alicatios Joural, , [5] K. M. Mahesh, ad R.S.Das, O-demad Multiath Distace Vector Routig i Ad Hoc Networs. I Proceedigs of the 9th IEEE Iteratioal Coferece o Networ Protocols (ICNP, Page(s:14 23, November [6] D. M. Chiu ad R. Jai, Aalysis of Icreasead Decrease Algorithms for Cogestio Avoidace i Comuter Networs, Comuter Networs ad ISDN Systems, Vol. 17, 1989, [7] P.P. Pham ad S. Perreau, Performace Aalysis of Reactive Shortest Path ad Multiath Routig Mechaism with Load Balace, i INFOCOM2003, March [8] K. K. Ramarisha, D. M. Chiu, ad R. Jai, Cogestio Avoidace i Comuter Networs with a Coectioless Networ Layer. Part IV: A SelectiveBiaryFeedbac Scheme for Geeral Toologies, Digital Equimet Cororatio, TechicalReort DEC-TR-510, August 1987, 41. [9] D. Kim, C.-K. Toh, ad Y. Choi. TCP-Bus: Imrovig TCP Performace i Wireless Ad-Hoc Networs. I ICC 00:Proceedigs of the IEEE Iteratioal Coferece o Commuicatios, volume 3, ages , Jue 2000.DOI: /ICC [10] Y.Su ad T. Gross. WXCP: Exlicit Cogestio Cotrol for Wireless Multi-ho Networs. I IWQoS 05:Proceedigs of the 12th Iteratioal Worsho o Quality of Service, Jue [11] S.C.Dimri, S.K.Chamoli, D.Pat :Delay based Traffic Distributio of Heavy Traffic o K-Paths to achieve the Load Balacig ad to miimize the Mea System Delay i MANET, Iteratioal Joural of Comuter Alicatios ( Volume 63 No.22, February 2013 [12] L. Zhag, Z. Zhao, Y. Shu, L. Wag, O. W.W. Yag; Load Balacig of Multiath Source Routig i Ad Hoc Networs, IEEE Iteratioal Coferece o Commuicatios, May 2002, [13] S.C.Dimri, K.C. Purohit, D.Pat: Imrovemet of Performace of Mobile Ad hoc Networ usig - ath slittable traffic flow scheme, IJCTA NOV-DEC 2011 ISSN: [14] S. J. Lee ad M. Gerla, Slit Multiath Routig with Maximally Disjoit Paths i Ad hoc Networs, i ICC 2001, , Jue [15] C. De M. Cordeiro, S. R. Das, ad D. P. Agrawal. COPAS: Dyamic Cotetio-Balacig to Ehace the Performace of TCP over Multi-ho Wireless Networs. I Proceedigs of the 10th Iteratioal Coferece o Comuter Commuicatio ad Networs (IC3N, ages , Miami, FL, USA, Oct [16] D. Gaesa, R. Govida, S. Sheer ad D. Estri, Highly-Resiliet,Eergy-Efficiet Multiath Routig i Wireless Sesor Networs, i ACM SIGMOBILE Mobile Comutig ad Commuicatios Review, Vol.5, Issue 4, October ISSN : Vol. 4 No.05 Se