SECURED OPTIMAL ROUTING BASED ON TRUST AND ENERGY MODEL IN WIRELESS SENSOR NETWORKS. Tamil Nadu, INDIA

Transcription

1 ARTICLE SECURED OPTIMAL ROUTING BASED ON TRUST AND ENERGY MODEL IN WIRELESS SENSOR NETWORKS A Sethil Kumar 1, E Logashamugam 2 * 1 Research Scholar, Dept. of Electroics ad Commuicatio Egieerig, St. Peter s Uiversity, Cheai, Tamil Nadu, INDIA 2 Professor ad Head, Dept. of Electroics ad Commuicatio Egieerig, Sathyabama Uiversity, Cheai, Tamil Nadu, INDIA ABSTRACT Objective: I Wireless sesor etworks, odes have deployed to moitor ad collect the physical or evirometal coditio ad cooperatively pass the data to the mai cotrol ode through the etwork. The data forwarded to the mai cotrol ode should be efficiet ad trustable oe. Method: I this method a Scalable Eergy based Trust model for Security odes ad Data Ecryptio (SETS-DE) with the private key is proposed. The odes have very limited capability so profoud computatios for security mechaisms are ot suitable hece; the trust values of odes are computed for security purpose by usig its eergy cosumptio value. The data collected from the sesor ode is passed through the trusted odes. Eve though the trusted ode might become malicious but the ecrypted data caot be hacked or modified by the correspodig ode. Improvemet: This proposed method improves the performace measures for packet delivery, throughput ad efficietly reduces the eergy cosumptio. INTRODUCTION KEY WORDS Wireless sesor etworks, Nodal eergy, Trust based security, Sigle Message ecryptio, A Wireless Sesor Network (WSN) is a group of odes structured ito a cooperative etwork. Each ode cosists of processig capability, memory, a RF trasceiver, a power source such as battery; solar cells etc., ad accommodate various sesors ad actuators. The odes commuicate wirelessly ad ofte selfmaage after bee deployed i a ad hoc maer. Sesor odes popularly used for moitorig several applicatios such as eviromet for battlefield surveillace, military, wild aimals. These sesor odes have severely restricted to resources such as eergy, memory ad computatioal power. I a typical WSN applicatio, the sesor odes spread i a regio from where they collect data to achieve certai goals. Data collectio may be a cotiuous, periodic, or evet-based process. The WSN must be very stable i some of its applicatios such as security moitorig ad motio trackig. Systems of 1000s or eve 10,000 odes were aticipated to process a applicatio. Security ad privacy are critical services eeded for these systems. Security is a broadly used term ecirclig the characteristics of autheticatio, itegrity, privacy, o-repudiatio, ad ati-playback. Whe the depedecy o the iformatio provided by the etworks has bee icreases, the the risk of secure trasmissio of iformatio over the etworks has also icreased. Received: 16 Nov 2016 Accepted: 12 Feb 2017 Published: 5 April 2017 To protect WSNs agaist malicious ad selfish behavior, various methods of secured routig protocols had developed which maily rely o cryptographic basics ad autheticatio mechaisms. Nodes i the etwork may be compromised due to lack of eergy ad performs malicious attacks such as packet droppigs ad packet modificatios to disrupt the ormal operatios of sesor etworks. RELATED WORK *Correspodig Author sethilkumarstpeters@gmail. com Multi-hop relay had proposed to ehace the coverage area ad to forward traffic effectively betwee the (Base Statio) BS ad the (Mobile Statio) MS cosists of several itermediate mobile odes i betwee. The ovel techical solutios ad algorithms for multi-hop relay is aalyzed, icludig the separatio of cotrol ad data, effective sigal-to-iterferece-plus-oise ratio (SINR)-based routig algorithms, ad cooperative relay schemes. Several techiques were proposed but eergy cosumptio is higher for processig the data durig trasmissio. Dyamic Source routig protocol had proposed i multi-hop wireless ad hoc etworks, which is composed of the two mechaisms such as Route Discovery ad Route Maiteace. This two mechaisms work together to allow odes to discover ad maitai source routes to arbitrary destiatios i the ad hoc etwork. Geerally, routig mechaisms are selfish i ature, which leads iappropriate behavior i the etwork ad leads to performace degradatio i the etire etwork [1]. Optimal Forwarder based o Eergy ad Trust for Routig (OFETR) protocol had proposed to select ad prioritize odes forwarder list based o eergy ad trust value to improve the etwork lifetime. This protocol cosists of Eergy Watcher, Trust Maager ad Optimal Forwarder to record the eergy values, track the trust values ad to address the problem of forward list [4]. Trust-based secure routig model had proposed i which micro Timed, Efficiet, Streamig, Loss tolerat Autheticatio (micro TESLA) algorithm 13

2 is used to esure that the data should ot be tampered by malicious odes i.e. to autheticate the data packets betwee source ad destiatio odes [5]. A robust Trust-Aware Routig Framework for dyamic WSNs had proposed to provide protectio agaist the idetity deceptio through replayig routig iformatio. TARF secures the multi-hop routig i WSNs agaist itruders misdirectig the multi-hop routig by evaluatig the trustworthiess of eighborig odes. It idetifies such itruders by their low trustworthiess ad routes data through paths circumvetig those itruders to achieve satisfactory throughput [6]. A scalable cluster-based hierarchical trust maagemet protocol for wireless sesor etworks had implemeted to effectively deal with selfish or malicious odes. A trust maagemet protocol is applied i which a SN may adjust its behavior dyamically accordig to its ow operatioal state ad evirometal coditios. A SN is more likely to become selfish whe it has low eergy or it has may uselfish eighbor odes aroud [7]. A highly scalable hierarchical trust maagemet protocol for clustered WSN had proposed. Here each ode subjectively evaluates other peers periodically. Peer to peer trust evaluatios are reported from sesor odes, a cluster head obtai trust report of all sesor odes preset i its cluster ad this cluster head performs a statistical aalysis to idetify ad exclude malicious ode from the etwork. This trustbased IDS scheme cosiders the effect of both social trust ad QoS trust o trustworthiess or maliciousess [8]. Scalable Trust Based Secure (STBS) [9-10] wireless sesor etworks had proposed ew compoets for trust maagemet systems eve there is a chage i the etwork. Whe the ew odes deployed i the existig etwork, the trust relatioship should be maitaied betwee the ewly deployed odes ad the existig odes. However, maitaiig scalable eergy based trust relatioship betwee the odes i the etwork is difficult i this existig method. Scalable eergy based trust model for security odes ad data ecryptio A ovel ad scalable eergy based trust model for ode security method with the ecryptio of data is proposed. Data Ecryptio Stadard (DES) is applied to assure message passig security i this proposed method. Geerally, odes have limited capability ad cosume high eergy for security purposes; hece istead of implemetig heavy security mechaisms, a ode based trust factor, which icludes both eergy cosumptio ad selfishess factor, is desiged. The odes may break routes due to malicious actio, malfuctio, low hardware resources; ad havig low processig eergy is all characterized as ode behavior. The objective of this proposed model i WSN is to idetify the trusted odes ad to pass the ecrypted messages to the trusted odes. By improvig security ad reducig eergy cosumptio level improves the ovelty of the proposed SETS-DE mechaism. Here, three-tier system such as Mobile Sik (MS), Access Poit (AP) ad Motes (M) are proposed i order to derive optimal routig, maximize the etwork lifetime ad secure trasmissio of data. Phase 1: Tier 1 to Tier 2 I this phase, RREQ is broadcasted from the source ode preset i the mobile sik to the itermediate ode relies i AP. The threshold value rages from 0.7 ad 1.0 for AP ad Motes. If the trustworthiess of the mobile ode matches with the threshold value, the the AP trasmits the request to the secod phase. Phase 2: Tier 2 to Tier 3 RREQ is passed from the itermediate ode to the destiatio ode preset i the Mote. The mote has predefied threshold value. If the itermediate ode s trust value matches with the predefied threshold value of the destiatio the RREP is set via the same path. Selfishess Factor I this mobile sik phase, the source ode seds the Route Request (RREQ) to the AP through the itermediate odes. The trust model is proposed to calculate the trustworthiess of the each ode preset i the etwork ad the trustworthiess factor for each ode is evaluated by their residual eergy. The ode may chage to malicious ode due to lack of their residual eergy. The malicious ode i the etwork is idetified by the selfishess factor. The selfishess factor ca be derived by the ratio of RREQ to the umber of Route Reply (RREP). No of RREQ Selfishess Factor No of RREP Eergy calculatio 14

3 It is ecessary to calculate the eergy level i each ode i order to idetify the average eergy cosumed by the odes for the data trasmissio. This icludes eergy spet for sedig, receivig ad processig the data from mobile sik to destiatio via AP. The residual eergy level i the ode ca be evaluated by usig the below equatio. Eergy cosumptio Iitial eergy Curret eergy Nodal trust value The trustworthiess of the odes or odal trust ca be calculated by usig two factors such as selfishess of the ode ad the available eergy level of the ode after processig the requests. It ca effectively guide the data route i choosig odes with high trust to avoid black holes. Trust value i 0 ( S Potetial eergy of the ode ) reply () i ( i) S r eply Successful Reply Algorithm for SETS-DE Step 1: Broadcasts RREQ from SN to AP Step 2: Idetifyig Trust value of each ode (a) Calculate Selfishess factor (b) Calculate eergy compoet Step 3: Checks for the threshold value of AP Step 4: If trust value matches with the threshold value, the the RREQ passes to the secod phase. Step 5: Agai step 2 process cotiues Step 6: If threshold value of itermediate odes matches with the threshold value of Motes, the RREP is passed to the source. Step 7: The trusted route had discovered, ad data is set via i this route from the source to the sik. Step 8: The data is ecrypted with private key, eve the trusted odes become malicious it caot access the data. Reliable data trasmissio Oce the reliable ad trusted route is discovered, the data passed from the source ode to destiatio ode preset betwee the tier 1 ad tier 3. The data is ecrypted with the symmetric key eve the itermediate ode become malicious, it caot modify the iformatio cotaied with it. To esure the secured ad reliable data trasmissio, the threshold values are fixed ad verified for the itermediate odes by the AP ad the motes. The goal is to maximize the ratio of successful packets reachig the sik ad to reduce the eergy cosumptio. The data ecryptio Stadard (DES) ca be implemeted by usig the security key maagemet techique. SIMULATION RESULTS AND ANALYSIS I order to aalyze the performaces of the proposed method SETS-DE, the packet delivery rate, packet loss rate, delay rate ad throughput are compared through simulatios with the existig method. Packet delivery rate The Packet delivery rate is the ratio of the total packets delivered by the seder ode to the correspodig receiver ode i the etwork. The equatio for PDR is show below, where represet the umber of odes i the etwork. 0 Pkts Received PDR = time Packet loss rate (1) Packet Loss Rate (PLR) is the ratio of the packets lost durig packets trasmissio set by the seder to their correspodig receivers. The fig 2 shows the packet loss rate for the proposed SETS_DE ad the existig STBS. The packet lost rate is lower for the proposed SETS_DE mechaism. The equatio for PLR is give below, PLR Delay 0 PktsLost time (2) 15

4 Delay refers to the latecy time betwee set packets ad the received packets. The delay is calculated by usig the equatio show below, ( PktRecvTime PktSetTime ) 0 Delay Where represet the umber of odes. The average delay is plotted ad it is show clearly that the delay value is low for the proposed model SETS-DE tha the existig STBS method) Throughput Throughput is defied as the total umber of successfully received packets. The average throughput is calculated by usig the equatio show below. Pkts Received ( )* Pkt Size 0 Throughput (4) 1000 The SETS-DE method has achieved greater average throughput whe compared to the STBS mechaism. The security measures had improved the etwork performace greatly. Residual eergy The amout of eergy remaiig i a ode at the curret istace of time is said to be as residual eergy. A measure of the residual eergy gives the rate at which eergy is cosumed by the etwork operatios. Fig 5 shows the proposed scheme has higher residual eergy compared to the existig method STBS (3) Fig: 1. Packet delivery rate. Fig. 2: Packet loss rate. 16

5 Fig. 3: Delay. Fig. 4: Throughput. Fig. 5: Residual eergy. CONCLUSION The Scalable Eergy based Trust model for Security odes, Data Ecryptio (SETS-DE) model is proposed for improvig the scalability ad reliability of wireless sesor etworks i three tier based system. This proposed algorithm gives a efficiet output i terms of eergy cosumptio ad trust based security odes. This proposed scheme ca be applied i high security requiremet evirometal scearios. Simulatio aalysis shows better performace for packet delivery, throughput ad average delay for the 17

6 proposed scheme is comparatively low. This improves the security i sigificat to the eergy cosumptio of odes. I future, the overall ed-to-ed delay ca be further reduced by usig secured eergy based algorithms. CONFLICT OF INTEREST There is o coflict of iterest. ACKNOWLEDGEMENTS Noe FINANCIAL DISCLOSURE Noe REFERENCES [1] Johso D, Maltz A, Broch J. [2001] DSR: The dyamic source routig protocol for multi-hop wireless ad hoc etworks, Ad hoc etworkig, 5: [2] Chughtai O, Badruddi N, Awag A Reha M. [2013] A cooperative selectio reactive routig protocol for wireless sesor etworks, Research ad Developmet (SCOReD), IEEE Studet Coferece, pp [3] Yuxi L, Dog M, Ota K, Liu A. [2013] Active Trust: Secure ad Trustable Routig i Wireless Sesor Networks, IEEE Trasactios o Iformatio Foresics. [4] Maqbool S, Nidhi C, Shivraj D. [2013] Selectig Optimal Forwarder Based o Eergy ad Trust for Routig i WSN, I Computatioal Itelligece ad Commuicatio Networks (CICN), 5th Iteratioal Coferece, pp [5] Wei, Liu Y, Qig, Na Y. [2015] A trust-based secure routig algorithm for wireless sesor etworks, I Cotrol Coferece (CC), 34th Chiese, pp [6] Guoxig Z, Shi W, Deg J. [2012] Desig ad implemetatio of TARF: a trust-aware routig framework for WSNs, IEEE Trasactios o depedable ad secure computig, 9( 2): [7] Feye B, Che R, Moo C, Ji-Hee C [2012] Hierarchical trust maagemet for wireless sesor etworks ad its applicatios to trust-based routig ad itrusio detectio, IEEE trasactios o etwork ad service maagemet, 9( 2): [8] Bao, Feye, Ray Che, Moo Jeog Chag, ad Ji-Hee Cho. [2011] Trust-based itrusio detectio i wireless sesor etworks. I IEEE Iteratioal Coferece o Commuicatios (ICC), pp [9] Agrawal A, Wei R. [2014] Scalable Trust-Based Secure WSNs," Joural of Computer ad Commuicatios, 2(7):17. [10] Patha K, Al-Sakib ad Hog C S. [2007] A secure eergyefficiet routig protocol for WSN, I Iteratioal symposium o parallel ad distributed processig ad applicatios, Spriger Berli Heidelberg, pp