Академический Документы
Профессиональный Документы
Культура Документы
ORG
35
MANETistofindacorrectrouteefficiently.
1 INTRODUCTION
n MANET, all nodes of this network are mobile and can be connected dynamically in an arbitrary manner. All nodesofthisnetworkbehaveasroutersandtakepartin discovery and maintenance of routes to other nodes in the network is a set of wireless devices called wireless nodes, whichdynamicallyconnectandtransferinformation.Figure 1illustrateswhatMANETis.Ingeneral,wirelessnodescan be any computing equipment that employs air as transmissionmedium[14].
In MANET, wireless nodes keep moving rather than staying still, the network topology changes from time to time.Anodeplayingtheroleofaroutermaygetoutofthe route between source and destination then the route is disconnected, and route discovery process has to be restarted.Thus,themaingoalofroutingprotocolin
Figure1:OverviewofMobileAdhocNetwork. MANET has various potential applications. Some typical examples include emergency searchrescue operations, meeting events, conference, and battlefield communication between moving vehicles or soldiers. A key component of MANETisanefficientroutingprotocol,sinceallofthenodes in the network act as routers. Some of challenges faced include high mobility and constrained power resources. Many routing protocols have been proposed. Security implementation in MANETs instigates new kind of attacks particularly when the protocol adopted is not adaptable to thebehavior ofthenetworks.Asimplecaseisinappropriate selectionofdigitalsignatureschemeforsecuringthepackets. The existing security scheme of MANETs routing protocols
JOURNAL OF COMPUTING, VOLUME 4, ISSUE 3, MARCH 2012, ISSN 2151-9617 https://sites.google.com/site/journalofcomputing WWW.JOURNALOFCOMPUTING.ORG
36
such as SDSR[6], SAODV [16], ARAN etc. which employ digital signatures are not robust enough and impractical. Becauseoftheuseofdoubledigitalsignatures,thesocalled secure protocols will get worst in terms of time and memory consumption. This paper proposes an approach called Modified DSR (MDSR) which uses MSS digital signatures and hash chain. We also compare MDSR with related existing protocols such as SDSR [6] andARIADNE [5].
2 Background
2.1 Dynamic Source Routing Protocol (DSR)
DSRconsistsoftwomechanisms:routediscoveryandroute maintenance[4].
* While a route is in use, the route maintenance procedure monitorstheoperationoftherouteandinformsthesenderof anyroutingerrors. * Route_Error_Packets are sent back to source if source is found in cache, else if not in cache buffer the Route_Error_Packets perform Route_Discovery for the source. * Update the source cache using Route_error_Packet. The nodes in the way to destination can use the info of the Route_Error_Packet. To reduce the cost of Route Discovery and Route Maintenance, each node updates route caches form the info thatithaslearnedoroverheared,whichitaggressivelyused tolimitthefrequencyandpropagationofrouterequests.
JOURNAL OF COMPUTING, VOLUME 4, ISSUE 3, MARCH 2012, ISSN 2151-9617 https://sites.google.com/site/journalofcomputing WWW.JOURNALOFCOMPUTING.ORG
37
Figure2:Onewayhashchain.
whenanewroutetodestinationDisneededatsourcenode S,itexecutesfollowingcode: sign_Gen=NonmutuableRREQ; hc_gen=0,maxhop=ttl=1,3,; orig_RREQ=concat(REQ,S,D,S.certificate,req_id)); /*REQisrequestindicator,req_idisrequest id*/ RREQsec = Concat( orig_RREQ, hc_gen, signature, n_addr, pk); /*n_addristheaddressofpacketcreatorormodifier*/ rrl=NULL; /*rrlisroutelistexclusiveofSandD*/ cache(S,D,req_id,rrl); /*Storeintocache*/ broadcast(RREQsec,RRL,S.pk); Wheneveranodexreceives,itjustifythetypeofthemessage. Thecodeis asfollows. RREQsec: hc_tester=hop_count+1,has_from+max_hop+top_hash; /*max_hopismaximumnumberhops(nodes)forroutediscovery, has_fromiscurrentvalueofsuccessivehashfunctionforn_addr, top_hashishighestvalueofsuccessivehashfunction*/ sign_verifier=S.pk+signature+Nonmutuablefieldbytes; if(hc_tester&&sign_verifier){ if(X!=D) { ifRREQsecisreceivedforfirsttime { rrl=concat(rrl,X); cache(S,D,req_id,rrl); removepkandsignatureformRREQsec; sign_Gen=NonmutuableRREQ; hc_gen=0,maxhop=ttl=hop_to_org; RREQsec = Concat( orig RREQ, hc_gen, signature, n_addr,X.pk); broadcast(RREQsec,rrl,X.pk); else { rrl=concat(S,D,req_id,rrl); generate RREPsec ( similar process with generating RREPsec); unicast(RREPsec);/*sendRREPsectosourcealongthe reversepathinrrl*/ } RREPsec: If(X==S)
JOURNAL OF COMPUTING, VOLUME 4, ISSUE 3, MARCH 2012, ISSN 2151-9617 https://sites.google.com/site/journalofcomputing WWW.JOURNALOFCOMPUTING.ORG
38
Cache(rrl);/*rrlisthepath,thepacketswillbesendalong*/ else if(ttl>0) unicast(RREPsec); RERR: List_unreach=find_rt_table(RERRsec) If(list_unreach!=null&&ttl>0) { sign_gen=list_unreach; RERRsec=concat(origRERR,signature,X.pk); Unicast(RERRsec); }
Figure4:NormalizedRoutingLoadvs.pausetimevaluesin benignenvironment the NRL metric is, in general, inversely proportional to the PDF metric (Figure 3) which is depicted in Figure 4. A low PDFvaluecorrespondstoahighNRLvalue.
Figure3:PacketDeliveryFractionvs.pausetimevaluesin benignenvironment. AsshowninFigure3,thepercentageofpacketsdeliveredin DSR and MDSR is fairly close to each other, and both methodsexhibitsuperiorperformance(~80%ingeneral).
6 Conclusion
Secure ad hoc routing protocols are necessary for normal performanceofMANET.Secureroutingprotocolscanguard theMANETagainstvarioustypesofnetworkattacks.Sofar, there are many secure routing protocols that have been proposedsuchasSAODV,SEAD,ARIADNE,SecureAODV, ARAN and more. we believe that many more are being implementedinlaboratories. However, in time, there will also be more new types of network attacks. The attackers based on their deep understanding of current secure routing protocols will find
JOURNAL OF COMPUTING, VOLUME 4, ISSUE 3, MARCH 2012, ISSN 2151-9617 https://sites.google.com/site/journalofcomputing WWW.JOURNALOFCOMPUTING.ORG
39
ways to exploit the weakness of protocols. Furthermore, thereisnocompletesecureroutingprotocolthatcanprotect the network against all kinds of routing attacks. Thus, the battlebetweensecureroutingprotocolsandroutingattacks isanonstopbattle.Secureroutingprotocolscertainlyneed to be improved to be more secure. We have tried to make DSR more secure to protest security attacks. By evaluating theimplementationandcomparingtheperformanceofour proposed MDSR in malicious environments, we have disclosed the strongness of this protocol over other secure protocolssuchasSDSRandARIADNE.
13th European Wireless 2007 (EW2007). Paris: Ecole NationaleSuprieuredeTechniquesAvances,2007. [11] P. W. Shor, PolynomialTime Algorithms for Prime Factorization and Discrete Logarithms on a Quantum Computer.,SIAMJ.Comput.,1997:1484~1509 [12]K.Sadasivam,andV.Changrani,T.A.Yang,Scenario based Performance Evaluation of Secure Routing in MANETs, in Proc. of Second International Workshop on Mobile Ad Hoc Networks and Interoperability Issues, June 2005 [13] P. Sankar, Implementation of DSR algorithm using VHDL in wireless adhoc network., in Proc. of 7th References InternationalConferenceonICSICT,2004,pp.13641367. [1] S. R. Afzal, S. K. Biswas, J. Koh, T. Raza, G. Lee, D. [14] T. A. Nguyen, Evaluations of secure MANET routing Kim.,RSRP:ARobustSecureRoutingProtocolforMobile protocols in malicious environments., MSc. Thesis, The AdHocNetworks.,InProc.ofWCNC2008.pp.23132318 universityofHoustonClearLake,2006. [2] J. Buchmann, L.C.C. Garca, E. Dahmen, M. Dring, [15]OMNET++UserManualVersion3.0,Availablefrom and E. Klintsevich, CMSS An Improved Merkle http;/www.omnetpp.org/doc/manual/usman.html. SignatureScheme,inProcofINDOCRYPT,2006,pp.349 [16] M. G. Zapata, Secure Ad hoc OnDemand Distance Vector (SAODV) Routing, INTERNETDRAFT draft 363. guerreromanetsaodv06.txt.,September2006. [3]J.Buchmann,E.Dahmen,E.Klintsevich,K.Okeya,and C.Vuillaume,MerkleSignatureswithVirtuallyUnlimited SignatureCapacity,inProc.ofACNS,2007,pp.3145. [4] T. Demir, Simulation of Ad Hoc Networks with DSR Abu Sayed Chowdhury is now a Protocol, in Proc. of the Sixteenth International student of M.Sc. Engineering Symposium on Computer and Information Sciences, programme in department of Antalya/Turkey,November,2001. Computer Science and Engineering, [5]Y.Hu,A.Perrig,andD.B.Johnson,Ariadne:ASecure BangladeshUniversityofEngineering OnDemand Routing Protocol for Ad Hoc Networks., and Technology (BUET), Dhaka, WirelessNetworks11(12):2138(2005) Bangladesh. Currently, he is working [6] T. Jiang, Q. Li, and Y. Ruan, Secure Dynamic Source as a lecturer in department of Routing Protocol., In Proc. of the Forth International Computer Science and Engineering, Dhaka University of Conference on Computer and Information Technology Engineering and Technology (DUET), Gazipur, Bangladesh. (CIT),2004. His research interests include Mobile Adhoc Networks and [7] D. B. Johnson and D. A. Maltz, Dynamic Source WirelessSensorNetwoks. Routing in Ad Hoc Wireless Networks., Mobile Computing,ThomaszImielinskiandHankKorth(Editors), SuraiyaAkhterisnowastudentofM.Sc. Vol. 353, Chapter 5, pp. 153181, Kluwer Academic Engineering programme in department Publishers,1996 of Computer Science and Engineering, [8] S. Khurana, N. Gupta, and N. Aneja, Reliable Adhoc Dhaka University of Engineering and OndemandDistanceVectorRoutingProtocol.,InProc.of Technology (DUET), Gazipur, ICN/ICONS/MCL,2006. Bangladesh.Currently,sheisworkingas [9] L. Lamport, Password authentication with insecure a lecturer in department of Computer communication. Communications of the ACM, SRI Science and Engineering, World University of Bangladesh International, Menlo Park, CA., Volume 24 Issue 11, Nov. (WUB), Dhaka, Bangladesh. Her research interests include 1981 MobileAdhocNetworksandWirelessSensorNetwoks. [10]R.G.Paoliello,andL.C.Alabern,Improvingreactive routingonwirelessmultirateadhocnetworks.InProc.of