Cost Aware Secure Routing (CASER) Protocol Design for Wireless Sensor Networks G. SNEHA PRANEETHA 1, DEEPTHI JANAGAMA 2, N.

Transcription

1 ISSN Vol.08,Issue.12, September-2016, Pages: Cost Aware Secure Routig (CASER) Protocol Desig for Wireless Sesor Networks G. SNEHA PRANEETHA 1, DEEPTHI JANAGAMA 2, N. ANJANEYULU 3 1 PG Scholar, Dept of CSE, Sphoorthy Egieerig College, Hyderabad, Idia, gudurisehapraeetha@gmail.com. 2 Associate Professor & HOD, Dept of CSE, Sphoorthy Egieerig College, Hyderabad, Idia. 3 Assistat Professor, Dept of CSE, Sphoorthy Egieerig College, Hyderabad, Idia. Abstract: Wireless sesor etwork of globally distributed autoomous sesors to moitor physical or evirometal coditios such as temperature, oise, pressure etc. ad to cooperatively pass their data through the etwork to a mai locatio. CASER protocol is used to icrease the lifetime of the etwork. Eergy cosumptio ad security are the two coflictig issues i WSN. To overcome this problem some parameters are used Eergy balace cotrol usig PSO (Particle swarm optimizatio) ad lifetime optimizatio TORA (Temporally ordered Routig Algorithm). For security Probabilistic radom walkig the proposed protocol ca achieve a high message delivery ratio while prevet routig from pollutig attacks. Keywords: Routig, Security, Eergy Efficiecy, Eergy Balace, Delivery Ratio, Deploymet, Simulatio. I. INTRODUCTION Wireless Sesor Networks (WSN) are emergig as both a importat ew tier i the IT ecosystem ad a rich domai of active research ivolvig hardware ad system desig, etworkig, distributed algorithms, programmig models, data maagemet, security ad social factors The basic idea of sesor etwork is to disperse tiy sesig devices; which are capable of sesig some chages of icidets/parameters ad commuicatig with other devices, over a specific geographic area for some specific purposes like target trackig, surveillace, evirometal moitorig etc. Today s sesors ca moitor temperature, pressure, humidity, soil makeup, vehicular movemet, oise levels, lightig coditios, the presece or absece of certai kids of objects or substaces, mechaical stress levels o attached objects, ad other properties Routig is aother very challegig desig issue for WSNs. A properly desiged routig protocol should ot oly esure high message delivery ratio ad low eergy cosumptio for message delivery, but also balace the etire sesor etwork eergy cosumptio, ad thereby exted the sesor etwork lifetime. Motivated by the fact that WSNs routig is ofte geography-based secure ad efficiet Cost-Aware secure routig (CASER) protocol for WSNs without relyig o floodig CASER allows messages to be trasmitted usig two routig strategies, radom walkig ad determiistic routig, i the same framework. The distributio of these two strategies is determied by the specific security requiremets IJATIR. All rights reserved. This sceario is aalogous to deliverig US Mail through USPS: express mails cost more tha regular mails; however, mails ca be delivered faster. The protocol also provides a secure message delivery optio to maximize the message delivery ratio uder adversarial attacks. CASER protocol has two major advatages: It esures balaced eergy cosumptio of the etire sesor etwork so that the lifetime of the WSNs ca be maximized. CASER protocol supports multiple routig strategies based o the routig requiremets, icludig fast/slow message delivery ad secure message delivery to prevet routig trace back attacks ad malicious traffic jammig attacks i WSNs II. EXISTING AND PROPOSED SYSTEMS A. Existig System I existig system geographic routig is used as the promisig solutio i the etwork. Geographic adaptive fidelity is used as the promisig solutio for the low power sesor etwork.a query based geographic ad eergy aware routig was implemeted for the dissemiatio of the ode. I Geographic ad eergy aware routig (Gear), the sik dissemiates requests with geographic attributes to the target regio istead of usig floodig. Each ode forwards messages to its eighborig odes based o the estimated cost ad the learig cost. Source-locatio privacy is provided through broadcastig that mixes valid messages ot oly cosumes sigificat amout of sesor eergy. But also icreases the etwork collisios ad decreases the packet delivery ratio. I phatom routig protocol each message is routed from the actual source to a phatom source alog a desiged directed walk through either sector based approach or hop based approach. The directio sector iformatio is stored i the header of the message. I this way, the phatom source ca be away from the actual source. Ufortuately, oce the message is captured o the radom walk path, the adversaries are able to get the directio sector iformatio stored i the header of the message. B. Proposed System To overcome this drawback ew scheme is implemeted ad amed as CASER. Here the data that is used for the secure trasmissio is eergy balacig. Thus

2 G. SNEHA PRANEETHA, DEEPTHI JANAGAMA, N. ANJANEYULU developmet of the proposed scheme is used for the eergy balacig ad for secure trasmissio. A secure ad efficiet Cost Aware Secure Routig (CASER) protocol is used to address eergy balace ad routig security cocurretly i WSNs. I CASER routig protocol, each sesor ode eeds to maitai the eergy levels of its immediate adjacet eighborig grids i additio to their relative locatios. Usig this iformatio, each sesor ode ca create varyig filters based o the expected desig trade-off betwee security ad efficiecy. The quatitative security aalysis demostrates the proposed algorithm ca protect the source locatio iformatio from the adversaries. I this project, we will focus o two routig strategies for message forwardig: shortest path message forwardig, ad secure message forwardig through radom walkig to create routig path upredictability for source privacy ad jammig prevetio. C. System Overview The Eergy Balace Cotrol (EBC) is the oe of the problem i wireless sesor etwork. Here we discuss about the EBC. 1. Eergy Balace Cotrol (EBC): To balace the overall sesor etwork eergy cosumptio i all grids by cotrollig eergy spedig from sesor odes with low eergy levels. The source ode seds the message to eighborig odes, the move to the ext eighborig ode. Fig.1.System Overview. The Fig 1 shows that, the data is set the source ode to destiatio ode based o the eighbor s ode selectio. The EBC is the Eergy Balace cotrol; it is used to calculate the eergy. The eergy is calculatig based o the EBC algorithm. First select the eighborig ode for message forwardig. If the ode is has the highest ode meas select that ode. The sik ode has the iformatio about the etire ode, that iformatio is stored to the sik ode. The source ode seds the message to eighborig odes, the move to the ext eighborig ode. Fially the message is sed to sik ode. I wireless sesor etwork, sik ode has the all ode iformatio. The EBC method is used to calculate the eergy for the sesor ode. III. MODULES DESCRIPTION There are three modules: 1. Shortest path Allocatio 2. Eergy Balace Routig 3. Secure Routig Usig CASER A. Grid Creatio The etwork is ormally deployed with umber of sesor odes.the etwork is divided ito two or more equal size sectios. The umber of the sesor ode is determied by the size of the grid. The umber of sesor odes i each grid follows id. Whe the umber of sesor odes i each grid is large. The sum of the eergy i each grid should follow the ormal distributio accordig to the cetral limit theorem. I our proposed dyamic routig algorithm, the ext forwardig ode is selected based o the routig protocol. The message is forwardig ode based o the eighborig ode selectio ad estimate the distace. B. Eergy Balace Routig I the selectio of the eighborig ode selectio the eergy level of each ode to be cosidered. To achieve the eergy balace, moitor ad cotrol the eergy cosumptio for the odes with relatively low eergy levels. To select the grids with relatively higher remaiig eergy levels for message forwardig. For parameter α, αε [0, 1] to eforce the degree of the eergy balace cotrol. It ca be easily see that a larger a correspods to a better EBC. It is also clear that icreasig of a mai they also icrease the routig legth It ca effectively cotrol eergy cosumptio from the odes with eergy levels lower tha α, ε α (A). The CASER path selectio algorithm is derivate by the equatio, ε α A = 1 εri NA i NA Here ε is a parameter used for the Eergy Balaced Cotrol. Ad the the term α is used to deote challegig ratio. If the α value is maximum meas there is o shortest path i that ode. C. Secure Routig Usig CASER I the proposed model the data that are trasmitted accordig to the routig strategy. A routig strategy that ca provide routig path upredictability ad security the routig path become more chageable the routig protocol cotais two optios for message forwardig: oe is a determiistic shortest path routig grid selectio algorithm, ad the other is a secure routig grid selectio algorithm through radom walkig. I the determiistic routig approach, the ext hop grid is selected from N α A based o the relative locatios of the grids. The grid that is closest to the sik ode is selected for message forwardig. I the secure routig case, the ext hop grid is radomly selected from N α A for message forwardig. The distributio of these two algorithms is cotrolled by a security level called βϵ [0, 1], carried i each message. Whe a ode eeds to forward a message, the ode first selects a radom umber γϵ [0,1] If γ>β, the the ode selects the ext hop grid based o the shortest routig algorithm; otherwise, the ext hop grid is selected usig radom walkig. The security level β, is a adjustable parameter. Smaller β results i a shorter routig path ad is more eergy efficiet i message forwardig.

3 Cost Aware Secure Routig (CASER) Protocol Desig for Wireless Sesor Networks E. Algorithm 1. Eergy Balace Cotrol Algorithm The eergy Balace Cotrol algorithm shows, poited out that the EBC parameter a ca be cofigured i the message level, or i the ode level based o the applicatio sceario ad the preferece. Whe a icreases from 0 to 1, more ad more sesor odes with relatively low eergy levels will be excluded from the active routig selectio. Therefore, the N α A shriks as a icreases. I other words, as a icreases, the routig flexibility may reduce. As a result, the overall routig hops may icrease. But sice ε α(a) is defied as the average eergy level of the odes i N A, this subset is dyamic ad will ever be empty. Therefore, the ext hop grid ca always be selected from N α A. IV.PERFORMANCE EVALUATION AND SIMULATION RESULTS I this sectio, we will aalyze the routig performace of the proposed CASER protocol from four differet areas: routig path legth, eergy balace, the umber of messages that ca be delivered ad the delivery ratio uder the same eergy cosumptio. Our simulatios were coducted i a targeted sesor area of size 1,500 1,500 meters divided ito grids of icrease the umber of routig hops ad the overall eergy cosumptio slightly. This is especially true whe the sesor odes have very ubalaced eergy levels. I our simulatios, show i Fig. 2, the message source is located at (332, 259) ad the message destiatio is located at (1,250, 1,250). The source ode ad the destiatio ode are 10 hops away i direct distace. There are three odes i each grid, ad each ode is deployed with eergy to trasmit 70 messages. We show the remaiig eergy levels of the sesor odes uder two differet α level. TABLE 1. Delay Results for Various Security Parameters from Simulatio A. Routig Efficiecy ad Delay For routig efficiecy, we coduct simulatios of the proposed CASER protocol usig OPNET to measure the average umber of routig hops for four differet security levels. We radomly deployed 1,000 sesor odes i the etire sesor domai. We also assume that the source ode ad destiatio ode are 10 hops away i direct distace. The routig hops icrease as the umber of trasmitted messages icrease. The routig hops also icrease with the security levels. We performed simulatios with differet α ad β values. I all cases, we derived cosistet results showig that the average umber of routig hops derived i this paper provides a very close approximatio to the actual umber of routig hops. As expected, whe the eergy level goes dow, the routig path spreads further wider for better eergy balace. We also provided simulatio results o ed-to-ed trasmissio delay i Table 1. B. Eergy Balace The CASER algorithm is desiged to balace the overall sesor etwork eergy cosumptio i all grids by cotrollig eergy spedig from sesor odes with low eergy levels. I this way, we ca exted the lifetime of the sesor etworks. Through the EBC a, eergy cosumptio from the sesor odes with relatively lower eergy levels ca be regulated ad cotrolled. Therefore, we ca effectively prevet ay major sectios of the sesor domai from completely ruig out of eergy ad becomig uavailable. I the CASER scheme, the parameter α ca be adjusted to achieve the expected efficiecy. As α icrease, better eergy balace ca be achieved. Meawhile, the average umber of routig hops may also icrease. Accordigly, the overall eergy cosumptio may go up. I other words, though the eergy cotrol ca balace the etwork eergy levels, it may Fig.2. Remaiig eergy distributio statistics after the source trasmitted about 600 messages. The darker gray-scale level correspods to a lower remaiig level. Fig. 2a, we set α = 0 ad there is oly oe source ode. The eergy cosumptio is cocetrated aroud the shortest routig path ad moves away oly util eergy rus out i that area. I Fig. 2b, we set α = 0.5, the the eergy cosumptio is spread over a large area betwee this ode ad the sik. While maximizig the availability of the sesor odes, or lifetime, this desig ca also guaratee a high message delivery ratio util the eergy rus out for all of the available sesor odes i the area. We also coducted simulatios to evaluate the eergy cosumptio for dyamic sources i Fig.3. We assume that the oly sik ode is located i the ceter of the sesor domai. There are three odes i each grid, ad each ode is deployed with eergy to trasmit 70 messages. I this case, the eergy cosumptio is highest for the ode aroud the sik ode. The cosumptio decreases based o the distace that the ode is away from the sik ode. I fact, the average eergy cosumptio for the ode with distace i to the sik ode ca be calculated as follows. Theorem 5: Assume that all sesor odes trasmit messages to the sik ode at the same frequecy, the iitial eergy level of each grid is equal, the the average eergy cosumptio for the grid with distace i to the sik ode is

4 2 ++i i 2 (1) 2i where is the distace betwee the sik ode ad the outmost grid. G. SNEHA PRANEETHA, DEEPTHI JANAGAMA, N. ANJANEYULU 47,040: Therefore, the eergy cosumptio is oly 8,400/47,040 = 5/ % whe the iermost grids ru out of eergy ad become uavailable. Fig.3. The remaiig eergy levels of the sesor odes i the sesor domai whe the iermost grid almost rus out of the eergy, where α = 0.5, β = 0.5. Proof: Sice all messages will be set to the sik ode, the eergy cosumptio for the grids with distace i to the sik ode ca be measured based o message forwardig for grids with distace larger tha i ad message trasmissio for grids with distace i. The umber of grids with distace j to the sik ode is 8j. The total eergy cosumptio of the grids with distace i to the sik ca be calculated as j =1 8j: the average grid eergy cosumptio is therefore: j =1 8i 8j = i i 2 2i To ivestigate the eergy cosumptio i the uiform eergy deploymet, we assume each sesor ode has equal probability to geerate packets ad acts as a source ode i Figs. 3 ad 4. I these simulatios, the sik ode is located i the ceter of the target area located at (750, 750), which makes the target area symmetrical to show the eergy cosumptio. Each ode has the same probability to geerate the packets. The maximum direct distace betwee the source ode ad sik is 7. Similar to the previous simulatio, we assume there are three odes i each grid, ad each ode is deployed with eergy to trasmit 70 messages. Fig. 3 gives the remaiig eergy levels close to the sik ode whe the sesor odes ru out almost the etire eergy, where = 7, α = 0.5, α = 0.5. The color eveess i each layer of the grids demostrates the eergy usage balace eforced through the EBC α. I fact, accordig to Equatio (1), we ca calculate the total umber of messages that ca be trasmitted from the outmost grid whe the iermost grid rus out of eergy as210/(( 2 + )/2)= 210/(( )/2= 7.5. I this case, the overall eergy cosumptio is oly 7.5 j =1 8j 2 = 8,400, whe the sesor etworks become uavailable. Recall that the overall eergy uits deployed are 210 ((2 + 1) 2-1) = Fig.4. Delivery ratio uder differet EBC α ad security level β. C. Delivery Ratio Oe of the major differeces betwee our proposed CASER routig protocol ad the existig routig schemes is that we try to avoid havig ay sesor odes ru out of eergy while the eergy levels of other sesor odes i that area are still high. We implemet this by eforcig balaced eergy cosumptio for all sesor odes so that all sesor odes will ru out of eergy at about the same time. This desig guaratees a high message delivery ratio util eergy rus out from all available sesor odes at about the same time. The the delivery ratio drops sharply. This has bee cofirmed through our simulatios, show i Fig.4. V. CONCLUSION I this paper, we preseted a secure ad efficiet Cost Aware secure Routig (CASER) protocol for WSNs to balace the eergy cosumptio ad icrease etwork lifetime. CASER protocol is support multiple routig strategies i message forwardig to exted the lifetime ad icreasig routig security. Both theoretical aalysis ad simulatio results provide that CASER has a excellet routig performace i terms of eergy balace ad routig path security. The CASER protocol provides a o-uiform eergy deploymet scheme to maximize the sesor etwork lifetime. VI. REFERENCES [1] Di Tag, Togtog Li, Jia Re, Seior Member, IEEE, ad Jie Wu, Fellow, IEEE, Cost-Aware SEcure Routig (CASER) Protocol Desig for Wireless Sesor Networks, IEEE Trasactios o Parallel ad Distributed Systems, Vol. 26, No. 4, April [2] Y. Li, J. Re, ad J. Wu, Quatitative measuremet ad desig of source-locatio privacy schemes for wireless sesor etworks, IEEE Tras. Parallel Distrib. Syst., vol. 23, o. 7, pp , Jul [3] Y. Li, J. Li, J. Re, ad J. Wu, Providig hop-by-hop autheticatio ad source privacy i wireless sesor

5 Cost Aware Secure Routig (CASER) Protocol Desig for Wireless Sesor Networks Mr.N.Ajaeyulu, received the B.Tech (IT) from CVR College of Egieerig, Hyderabad, ad M.Tech(IT) from Guru Naak Egieerig College, Hyderabad, Idia i He is curretly workig as Assistat Professor i Sphoorthy Egieerig College, Hyderabad, Idia. His area of iterest icludes Computer Networks, Network Security, Mobile Computig ad Adhoc Sesor Networks. etworks, i Proc. IEEE Cof. Comput. Commu. Mii- Cof., Orlado, FL, USA, Mar. 2012, pp [4] B. Karp ad H. T. Kug, GPSR: Greedy perimeter stateless routig for wireless etworks, i Proc. 6th Au. It. Cof. Mobile Comput. Netw., New York, NY, USA, 2000, pp [5] J. Li, J. Jaotti, D. S. J. De Couto, D. R. Karger, ad R. Morris, A scalable locatio service for geographic ad hoc routig, i Proc. 6th Au. It. Cof. Mobile Comput. Netw., 2000, pp [6] Y. Xu, J. Heidema, ad D. Estri, Geographyiformed eergy coservatio for ad-hoc routig, i Proc. 7th Au. ACM/IEEE It. Cof. Mobile Comput. Netw., 2001, pp [7] Y. Yu, R. Govida, ad D. Estri, Geographical ad eergy aware routig: A recursive data dissemiatio protocol for wireless sesor etworks, Comput. Sci. Dept., UCLA, TR , Los Ageles, CA, USA, Tech. Rep., May [8] N. Bulusu, J. Heidema, ad D. Estri, GPS-less low cost outdoor localizatio for very small devices, Comput. Sci. Dept., Uiv. Souther Califoria, Los Ageles, CA, USA, Tech. Rep , Apr [9] A. Savvides, C.-C. Ha, ad M. B. Srivastava, Dyamic fie graied localizatio i ad-hoc etworks of sesors, i Proc. 7 th ACM Au. It. Cof. Mobile Comput. Netw., Jul , pp [10] P. Bose, P. Mori, I. Stojmeovic, ad J. Urrutia, Routig with guarateed delivery i ad hoc wireless etworks, i Proc. 3rd It. Workshop Discrete Algorithms Methods Mobile Comput. Commu., 1999, pp [11] P. Bose, P. Mori, I. Stojmeovic, ad J. Urrutia, Routig with guarateed delivery i ad hoc wireless etworks, i Proc. 3 rd ACM It. Workshop Discrete Algorithms Methods Mobile Comput. Commu., Seattle, WA, USA, Aug. 1999, pp [12] T. Melodia, D. Pompili, ad I. Akyildiz, Optimal local topology kowledge for eergy efficiet geographical routig i sesor etworks, i Proc. IEEE Cof. Comput. Commu., Mar. 2004, vol. 3, pp Author s Profile: G. Seha Praeetha, PG Scholar, Dept of CSE, Sphoorthy Egieerig College, Hyderabad, Idia, gudurisehapraeetha@gmail.com. Mrs,Deepthi Jaagama has doe Master of Sciece i Texas A&M Uiversity Commerce, Texas, USA ad received the Bachelor Of Techology degree from Kamala Istitute Of Techology Ad Sciece. She is curretly workig as Associate Professor ad Head of the Departmet of CSE with Sphoorthy Egieerig College,Nadergul.Her iterested subjects are Database maagemet system, Data miig ad Data Warehousig, Digital logic desig, computer programmig. deepthi.jaagama@gmail.com.