Partition in mobile adhoc network with mobility-a new approach for effective use of fast IP address autoconfiguration

Transcription

1 Mukesh Chad et al. / Iteratioal Joural of Egieerig ad Techology (IJET) Partitio i mobile adhoc etwork with mobility-a ew approach for effective use of fast IP address autocofiguratio Mukesh Chad *, HL Madoria # *Assistat Professor, Gurukul Kagri Uiversity, Haridwar mukesh.geu@gmail.com #Prof. & Head, IT Dept, College Of Techology, Patagar Uiversity drmadoria@gmail.com Abstract-A mobile ad hoc etwork is a collectio of mobile odes i which a pair of odes commuicates by sedig messages either over a direct wireless lik, or over a sequece of wireless liks icludig oe or more itermediate odes. Oly pairs of odes that lie withi oe aother's trasmissio radius ca directly commuicate with each other. Wireless lik failures occur whe previously commuicatig odes move such that they are o loger withi trasmissio rage of each other. Further whe the speed icreases route failures also occurs rapidly ad also affects the performace of the system, such as route discovery time icreases, the umber of packets dropped icreases ad also the delay icreases. I this paper a ew approach is proposed to improve the performace of adhoc etwork whe odes move with differet mobility. Keywords: Mobility, Adhoc etwork, Mobile odes I-Itroductio The mobility is the most importat attribute of the MANETs. Mobility dictates etwork [4] ad applicatio level protocols. Mobility may be i some cases a challege for the desiger, ad may become part of the solutio i other cases. We ca have several types of mobility models such as: Idividual radom mobility: Whe a mobile ode moves with radom mobility [2]. 1. Group mobility: Whe a group is sharig the same profile of mobility. 2. Motio alog replated routes: Whe a mobile ode follows the predefied path trajectories. The mobility model ca have major impact o the selectio of a routig scheme ad ca thus ifluece performace [3]. Some time mobility is harmful i Adhoc Network.Some mai challeges are idetified caused by mobility such as Fast auto IP address cofiguratio of mobile odes whe a mobile Adhoc Network merges with other mobile Adhoc Network. Fast recovery of IP addresses of mobile odes whe a Adhoc Network is partitioed ito sub etworks. Path breakage - we must prevet packet loss, for istace presettig backup paths etc Topology cotrol traffic overhead - oe approach to combat path breakage is to update" the topology very frequetly. But, this ca have dagerous side effects. Log lastig discoectios - Oe approach will be to desig delay ad disruptio tolerat etwork protocols. II-Related work Nodes i Adhoc etworks are mobile ad due to this mobile ature of odes it becomes very difficult to maitai the performace of a adhoc etwork. A large umber of research paper available i the literature have proposed scheme for the mobility maagemet but the solutios are ot as efficiet as they should be as a scheme for Mobility maagemet with OLSR protocol for fourth geeratio (4G) mobile etworks [1].I this approach the author has described the issues related to mobility but o solutio is give to overcome the impact of mobility. I this paper we proposed algorithms to maitai the performace of a adhoc etwork [4] whe some of mobile odes i the etwork go out of rage which results a partitioed etwork. As for as mobility is cocered the proposed algorithm is desiged i such a way that helps to maitai the performace of a adhoc etwork. III-Proposed Algorithm I this chapter simulatio is carried out for Partitio of the etwork [5], i which iitially there is oe idepedet MANET is preset. Due to mobility [6] the etwork is partitioed ito two Adhoc etworks. By cosiderig the proposed algorithm the effect of partitio of a etwork ito two or more sub etwork has bee ISSN : Vol 4 No 6 Dec 2012-Ja

2 Mukesh Chad et al. / Iteratioal Joural of Egieerig ad Techology (IJET) described. Partitio ca be created due to: c) Graceless leavig d) Graceful leavig I Graceless leavig mobile odes i the Adhoc etwork leaves the etwork without givig iformatio of its departure from the existig Adhoc etwork. Such partitio is kow as graceless partitio. The result of such departure decreases the performace ad icreases the uecessary traffic due to repetitio of request. Also whe the IP addresses [7] assiged to these mobile odes that depart abruptly are useless ad caot be allocated util prior itimatio of their departure but i the case of graceful leavig IP addresses allocated to these mobile odes ca be reused without coflict. Graceful leavig of ode I this case odes leave the etwork by iformig the cluster head of the etwork. 1. Sed Message (Kill) // the leavig ode seds a kill message to cluster head CH ACK Node // the cluster head ask the ode for cofirmatio as 2. Node ACK CH // the leavig ode seds cofirmatio 3. CH(Restore IP) // the cluster head restore the ode s IP address as 4. CH broadcast ode(s) // the cluster head broadcast updated iformatio to all the participatig odes i the etwork Graceless Leavig Whe odes are leavig the etwork without iformig the the cluster head [8] check for the existece of all the odes i the etwork.it seds a beaco sigal to other odes i the etwork ad waits for respose from all the odes. The algorithm proceeds as follows: 1. Iitially there is o becko sigal used i the etwork Becko_sigal=ull; 2. All the odes are idle ad the cluster head seds a becko sigal to all the odes i the etwork (CH Node) i Idle Mode. Set Becko _Timer =5; 3. After sedig beaco sigal the cluster head sets the becko timer value ad waits for Becko sigal from the ode (Waits for 5 times Becko Update Time). If (Beacko_Timer==0) Update Cluster_Head_table; Else Sed Becko_sigal to ode; Becko_Timer =Becko_Timer-1; 4. If the cluster head does ot receive becko sigal from the ode the cluster head idetify that the ode is ot preset i the etwork. If (Becko_sigal =ull) Update Cluster_Head_table; 5. Cluster head the flush the etries of the leavig ode ad mark its IP address as uallocated for reuse by other joiig ode i the etwork. Cluster_Head_table = Previous (Cluster_Head_table) +free (ode_etry) IP_List=IP_List + free (IP (ode)); 6. Broadcast Updated iformatio to all odes Broadcast (IP_List) CH > ode (s) Process model for partitio i adhoc etwork: These process models are used whe some of the odes i the adhoc etwork go out of rage with the prior iformatio of leavig or leavig abruptly. Process model show i Fig. 1 is applied o the cluster head.to complete the process five states have bee used.each state process the icomig iformatio ad sed to the ext state by idetifyig the value of a particular state variable. The state descriptio is as follows: Sed_kill_mesg: I this state the leavig ode seds a kill message to the cluster head. Check_ack: I this state cluster head asks the ode for the cofirmatio ad waits for the reply. Kill_cofirm: I this state leavig ode seds cofirmatio message to the cluster head. Update_IPtab: I this state after receivig the cofirmatio message from the leavig ode the cluster head update the IP table ISSN : Vol 4 No 6 Dec 2012-Ja

3 Mukesh Chad et al. / Iteratioal Joural of Egieerig ad Techology (IJET) Figure 1: Process model for graceful partitio Bcast_IPtab: I this state the cluster head save the IP address of a leavig ode ad broadcast the updated IP address table the earby odes. Trasitio from oe state to other state occurs which is based o the value of a state variable. As from Table 3.18 F1, F2, F3, F4 ad F5 are the fuctio which are used i a particular state, V1, V2, V3, V4, V5 ad V6 are the state variables used for a particular variable i the state. Process model show i Fig. 2 is used whe some of the odes i the adhoc etwork leave their etwork abruptly without prior iformatio. I this model we have used five states to complete the process. Each state i the process model has differet fuctioalities. G1, G2, G3, G4 ad G5 are the key fuctio associated with a particular state, variable W1, W2,W3, W4 ad W5 are the state variables.each fuctio process the value of these variables ad pass the value of these variables to the ext state ad causes a state trasitio. The descriptio of the state is as follows: Iit: I this state each ode checks for the updated iformatio at a radom time or regular time iterval. Receive_CH: I this state the cluster head checks for the becko value received from all the odes. Fig. 2: Process model for graceless partitio ISSN : Vol 4 No 6 Dec 2012-Ja

4 Mukesh Chad et al. / Iteratioal Joural of Egieerig ad Techology (IJET) Check_sigals: I this state the cluster head updates the cluster head table if the value of becko timer is zero otherwise the cluster head keeps o sedig ad receivig util the value of becko timer becomes zero. Update_tab: I this state whe o sigal is received by the cluster head the it updates the cluster head table ad save the IP address of the ode which is ot preset i the etwork or just leaved. Broadcast: I this state after updatig the table the cluster head broadcast the updated table to the earby odes. After deployig these two process model o the MANET ode model the results are take. Simulatio & result aalysis I this sectio we are usig radom way poit model to check the performace of proposed algorithm. I this model, each ode selects a radom poit i the simulatio area as its destiatio, ad a speed v from a iput rage [v mi, v max ]. The ode the moves to its destiatio at its chose speed. Whe the ode reaches its destiatio, it rests for some pause time. If the destiatio is the ext hop the pause time does ot affect the performace but if the destiatio is after some itermediate odes the the pause time is cosidered may be cosidered. At the ed of this pause time, it selects a ew destiatio ad speed ad resumes movemet. I the simulatio eviromet we have take a mobility sceario for partitio as show i Fig. 3. I this sceario two MANETs are deployed i a area of 10 Km * 10 Km.MANET1 covers the area of 5Km * 5Km ad cosist of 20 mobile odes which are i the rage of each other either directly or idirectly ad MANET2 covers the area of 3Km * 3Km. Mobile odes 10,11,12,13 ad 14 are movig with the same speed as show i Table 1. Route Discovery Time: Wheever a ode (source) tries to sed data to aother ode (destiatio) it will first look ito its ROUTING TABLE. If source does t fid etry for destiatio it costructs a special ROUTE REQUEST packet ad broadcast it. The format of ROUTE REQUEST packet is as follows, here Source Address, Request ID used to idetify the request uiquely. As source broadcasts the ROUTE REQUEST message to the etwork, so it is possible that same request may come to a ode by differet path. Here we have slightly modified the AODV algorithm. Whe a ode receives the same ROUTE REQUEST message by more tha oe path, ulike AODV it will ot simply discard the massage which has came later. It keeps track all the eighbours ode by which the ROUTE REQUEST message appear, though the root may be a loger oe. Iitially whe the mobile odes 10,11,12,13 ad 14 depart from the MANET1 the route discovery time is low but whe these mobile odes goes out of MANET1 the the route discovery time icreases because of exchagig routig table to update the iformatio about the existace of each mobile odes i the MANET.Mobile odes starts movig with zero pause time ad fially departs from the MANET1. Fig. 3: Mobility sceario for partitio Iitally the route discovery time is 0.10 sec ad after some time route discovery time icreases to 0.18 sec.the total route discovery time icreases to 72 % ad which is further reduced with the help of proposed algorithm as decribed i chapter 5.Whe the speed is 30 Km/Hr the total route discovery time decreses from 66% to 51%.Whe the speed of mobile odes 10,11,12,13 ad 14 is 50 Km/Hr the the total route discovery time ISSN : Vol 4 No 6 Dec 2012-Ja

5 Mukesh Chad et al. / Iteratioal Joural of Egieerig ad Techology (IJET) decreases from 88% to 63%.Whe the speed of the mobile odes is 70 Km/Hr the the total route discovery time decreases from 30% to 18%.The route discovery time is show i Fig. 4. Fig. 4: Route discovery time Total Packets dropped: The mobility of odes makes fixed multi-hop routig ulikely i MANETs. I a dyamically chagig eviromet, the positio of the odes chages over a period of time. As a result, a route determied betwee ay pair of odes breaks frequetly ad has to be re-discovered.utill uless the status of the existece of mobile ode is kow, the packets are dropped. Iitially whe the speed of the mobile odes 10,11,12,13 ad 14 is 10 Km/Hr the the total packets dropped are measured as 65 packets but after some time packets dropped reaches to 250 packets. So the total umber of packets dropped is further reduced by applyig proposed algorithm as described i chapter 5 from 93 % to 78 %.Whe the speed of mobile odes 10,11,12,13 ad 14 is 30 Km/Hr the the total umber of packets dropped is reduced from 80% to 68 %. Whe the speed of the mobile odes is 50 Km/Hr the the total umber of packets dropped is reduced from 83 % to 60%.Whe the speed of mobile odes is 70 Km/Hr the the total umber of packets dropped is reduced from 86 % to 68 %.The total packets dropped is show i Fig. 5. Delay (sec): Wheever the mobile odes departs from the MANET the services provided by or to these mobile odes is also affected.suppose if a mobile ode which is fixed is dowloadig a file from other mobile ode which is movig with some speed the latecy will icrease to dowload a file ad results i icomplete dowload after waitig for certai amout of time.iitally whe the speed of mobile odes 10,11,12,13 ad 14 the the delay is measured as 0.14 sec ad after some time the delay icreases to 0.26 sec.the total delay icreases to 80% ad which is reduced to 43 % whe we apply proposed algorithm to the mobile odes. Whe the speed is 30 Km/Hr the the total delay is reduced from 83 % to 33 %.Whe the speed of mobile odes 10,11,12,13 ad 14 is 50 Km/Hr the the total delay is reduced from 52% to 16%.Whe the speed of mobile odes is 70 Km/Hr the the total delay is reduced from 98% to 28%.The total delay is show i Fig. 6. ISSN : Vol 4 No 6 Dec 2012-Ja

6 Mukesh Chad et al. / Iteratioal Joural of Egieerig ad Techology (IJET) Table 1: Speed ad trajectory Name of the Node Speed Trajectory Name (Km/Hr) Mi Max 0 10 Traj10_Maet10_Partitio 0 30 Traj30_Maet10_Partitio 0 50 Traj50_Maet10_Partitio 0 70 Traj70_Maet10_Partitio 0 10 Traj10_Maet11_Partitio 0 30 Traj30_Maet11_Partitio 0 50 Traj50_Maet11_Partitio 0 70 Traj70_Maet11_Partitio 0 10 Traj10_Maet12_Partitio 0 30 Traj30_Maet12_Partitio 0 50 Traj50_Maet12_Partitio 0 70 Traj70_Maet12_Partitio 0 10 Traj10_Maet13_Partitio 0 30 Traj30_Maet13_Partitio 0 50 Traj50_Maet13_Partitio 0 70 Traj70_Maet13_Partitio 0 10 Traj10_Maet14_Partitio 0 30 Traj30_Maet14_Partitio 0 50 Traj50_Maet14_Partitio 0 70 Traj70_Maet14_Partitio Mobility Model Radom Way poit Radom Way poit Radom Way poit Radom Way poit Radom Way poit Radom Way poit Radom Way poit Radom Way poit Radom Way poit Radom Way poit Radom Way poit Radom Way poit Radom Way poit Radom Way poit Radom Way poit Radom Way poit Radom Way poit Radom Way poit Radom Way poit Radom Way poit ISSN : Vol Fig. 4 5: No Total 6 Dec packets 2012-Ja dropped

7 Mukesh Chad et al. / Iteratioal Joural of Egieerig ad Techology (IJET) Validatio of Proposed Algorithm i case of partitio with mobility: Performace of the system is evaluated for ode desity 20 ad speeds 10 Km/Hr, 30 Km/Hr, 50 Km/Hr ad 70 Km/Hr. Performace of the proposed Algorithm i case of partitio with mobility is show i Table 6.3.Whe the speed of the ode 10,11,12,13 ad 14 is 10 Km/Hr the the overall performaces icludig parameters route discovery, total packets dropped ad delay is improved to 27%. Whe the speed of the ode 10,11,12,13 ad 14 is 30 Km/Hr the the overall performace is improved to 33%. Whe the speed of the ode 10,11,12,13 ad 14 is 50 Km/Hr the the overall performace is improved to 38%. Fig. 6: Delay (sec) Whe the speed of the ode 10,11,12,13 ad 14 is 70 Km/Hr the the overall performace is improved to 46.Though i this simulatio ode s speed is icreased up to70 Km/Hr ad overall performace of the system is icreasig gradually. The loss rate is 56 % whe the proposed algorithm is used ad which is slightly efficiet tha the loss rate calculated from Shabam Jazayeri[1]. Coclusio I this chapter the proposed algorithm for partitio is applied to check the performace i the case of mobility. I the first sceario whe the two MANETs are merged with differet speed the the performace of proposed algorithm is icreasig gradually.that meas the proposed algorithm supports mobility whe the differet MANETs are merged with differet speed. I the secod sceario oly the proposed algorithm for graceless leavig of odes is applied to the mobile odes ad the performace is icreasig gradually. This meas that the proposed algorithm support mobility i the case of partitio. Refereces [1] Jazayeri, S.;, "Mobility Maagemet with OLSR Protocol for Fourth Geeratio (4G) Mobile Networks," Next Geeratio Mobile Applicatios, Services ad Techologies, NGMAST '08. The Secod Iteratioal Coferece o, vol., o., pp , Sept. 2008doi: /NGMAST URL: [2] Sourav Saha; Mukherjee, M.; Neogy, S.;, "Mobile-autocof: Mobility maagemet with autocofiguratio i mobile ad-hoc etworks," TENCON IEEE Regio 10 Coferece, vol., o., pp.1-6, Nov. 2008doi: /TENCON URL: [3] Rohakar, R.; Bhatia, R.; Shrivastava, V.; Sharma, D.K.;, "Performace aalysis of various routig protocols (proactive ad reactive) for radom mobility models of Adhoc etworks," Recet Advaces i Iformatio Techology (RAIT), st Iteratioal Coferece o, vol., o., pp , March 2012doi: /RAIT URL: [4] Bai, F.; Narayaa Sadagopa; Helmy, A.;, "IMPORTANT: a framework to systematically aalyze the Impact of Mobility o Performace of Routig Protocols for Adhoc Networks," INFOCOM Twety-Secod Aual Joit Coferece of the IEEE Computer ad Commuicatios. IEEE Societies, vol.2, o., pp vol.2, 30 March-3 April 2003doi: /INFCOM URL: 6 [5] Ze Li; Haiyig She;, "A mobility ad cogestio resiliet data maagemet system for distributed mobile etworks," Mobile Adhoc ad Sesor Systems, MASS '09. IEEE 6th Iteratioal Coferece o, vol., o., pp.60-69, Oct. 2009doi: /MOBHOC URL: ISSN : Vol 4 No 6 Dec 2012-Ja

8 Mukesh Chad et al. / Iteratioal Joural of Egieerig ad Techology (IJET) [6] Tig Wag; Chor Pig Low;, "Dyamic Message Ferry Route (dmfr) for Partitioed MANETs," Commuicatios ad Mobile Computig (CMC), 2010 Iteratioal Coferece o, vol.3, o., pp , April 2010doi: /CMC URL: [7] Thoppia, M.R.; Prakash, R.;, "A distributed protocol for dyamic address assigmet i mobile ad hoc etworks," Mobile Computig, IEEE Trasactios o, vol.5, o.1, pp. 4-19, Ja. 2006doi: /TMC [8] Garcia-Palacios, E.; Mehallegue, N.; Safdar, G.A.;, "Providig security ad eergy efficiecy i wireless ad-hoc sesor etworks through Secure Cluster-Head Electio (SEC-CH-E)," Telecommuicatios ad Sigal Processig (TSP), th Iteratioal Coferece o, vol., o., pp.47-51, 3-4 July 2012doi: /TSP URL: ISSN : Vol 4 No 6 Dec 2012-Ja