DOI: /ijarcsse/V7I1/0116

Transcription

1 Volume 7, Issue 1, January 2017 ISSN: X Internatonal Journal of Advanced Research n Computer Scence and Software ngneerng Research Paper Avalable onlne at: An nergy ffcent based Opportunstc Routng Metrc for Wreless Sensor Networks Sharda Ran Assstant Professor, Department of Computer Scence, R.K.S.D College, Kathal, Haryana, Inda DOI: /jarcsse/V7I1/0116 Abstract xstng cryptographc methods are not sutable for sensor networks because of ther lmted resources and opportunstc behavor of wreless nodes. In last four years, reputaton and trust aware methods are used to solve the ssue of securty n WSN. Data securty n transt s an mportant ssue for relable delvery of data n WSN. In ths paper, we have defned a new opportunstc routng (OR) metrc for sensor networks. The metrc s derved by usng energy consumpton and trustworthness of sensor nodes. The smulaton result shows that the metrc s able to detect a malcous actvty n the network segment. Ths metrc effectvely and effcently prevent from malcous actvtes and mantan data ntegrty. Keywords Routng Metrc, WSN, Trust, Secure Routng, Opportunstc Routng,. I. INTRODUCTION Cryptographc algorthms are not effcent n case of energy and storage n WSN, because of the lmted resources avalable n sensor nodes [3]. Hence, there s a need of cooperaton among sensor nodes n the network for securty purpose. But, takng the assumpton of hundred percent coordnaton s not vald. Sensor nodes n the deployment felds can easly be msconfgured, captured or hjacked by the attackers. The attackers may try to nject false nformaton n the network or try to destroy the network. However n recent years, researchers [4-8] have proposed cryptography based routng algorthms/protocols, but these algorthms are mostly provde soluton for outsde attacks. These algorthms are neffectve when there are nsder attacks from malcous sensor nodes. If we apply cryptographc algorthms for fghtng wth nsde attacks, than a lot of energy wll be wasted and network des soon. Hence there should be cooperaton and trust management between sensor nodes. To make successful delveres of data packets at base staton the trust management must be appled to routng process. The sensor nodes whch are havng low trust values must not be ncluded n routng process. As WSN are opportunstc networks n nature [9], rather than usng fxed path routng, opportunstc routng s very useful. But, when we talk about secure opportunstc routng protocols/algorthms, ether there are no proposed secure OR protocols/algorthms n lterature or there are very few whch are not much effcent n terms of energy and storage. The OR protocols must provde securty and effcency together. The securty n opportunstc routng protocols can be mproved by applyng routng decsons on the bass of trust values of sensor nodes n the network. To ncrease the probablty of a packet to reach destnaton, sensor nodes can utlze the trust based route dependablty nformaton. In opportunstc routng major phases are: forwarder set selecton and forwarder node selecton. The source, when has data to be sent over wreless lnk, frstly choose the forwarder set from the neghbor set. For ths purpose there s a requrement of certan crtera to be set. The forwarder set selecton process exclude those nodes whch are not able to fulfll the crtera. After ths process the canddate forwarder s selected and gven hgh prorty on the bass of opportunstc routng metrc (lke TX [10], mtx [11], AX [12] etc.). The routng decson n OR s purely dependent upon the metrc chosen for selectng canddate forwarder node [13]. In ths paper, a novel trust aware and energy effcent opportunstc routng metrc has been proposed whch s specally desgned for OR protocols n WSN. Ths metrc wll be compatble wth prevously proposed OR protocols for WSN. The metrc not only mprove the lfetme of the network but also the relablty and ntegrty of data. Major contrbutons of ths research work are gven below. A novel OR metrc has been proposed, whch consders the node trust value and energy effcency as major desgn factors. The parameters for desgnng the trust aware and energy effcent OR metrc are energy of the nodes, trust value of nodes, and lnk delvery probablty among nodes. Smulaton has been planned and executed to check the performance of the proposed OR metrc and framework appled to exstng OR protocols. Smulaton results valdate that ncorporatng the proposed trust metrc nto Destnaton Sequenced Dstance Vector Routng (DSDV) protocol. It can consderably ncrease the performance of DSDV communcatons n hostle envronments. 2017, IJARCSS All Rghts Reserved Page 191

2 Ran Internatonal Journal of Advanced Research n Computer Scence and Software ngneerng 7(1), II. RLATD WORK The frst and popular OR protocol has been proposed by Bswas and Morrs [2], and called as XOR [10]. The authors shown that ths new dea of routng can work more effcently and effectvely n wreless networks. Authors have proposed a metrc, called as xpected Transmsson Count (TX) [10], for forwarder canddate set selecton. Ths metrc calculates the number of transmssons requred for a data packet to reach destnaton. Forwarder canddate nodes was chosen from the set of neghbor nodes. Later xpected anypath transmsson (AX) [12] metrc has been proposed by Dubos-Ferre`re et al. [16]. On the bass of ths metrc they have proposed an OR protocol and named t as LCOR. But, AX s computatonally complex and expensve for large scale wreless networks. Smlar to XOR, [17] presented SOAR whch uses TX as a metrc for canddate forwarder selecton, but t manly tres to decrease the number of duplcate data packets to be receved at destnaton node. In exstng OR protocols the focus has been gven on tmely data delvery and no or very lttle emphass has been gven to securty of data and routes n communcaton. Securty s always crucal n wreless networks, as the data packets are sent on unsecured and open wreless lnks [18]. Cryptography methods provde external securty to the network, so that any attacker from outsde cannot harm the network [3]. But to cope wth nternal attacks there s a need of coordnaton among nodes and securty wthn the network. To provde nternal securty n WSN there s a need of lghtweght methods. Because, sensor nodes have less capabltes lke less energy, low storage and small computaton power etc. Trust and management systems are very lghtweght and easly computable and mprove securty of communcaton wthn the network. Researchers n recent year have developed trust and reputaton management protocols and algorthms for ad hoc networks, nternet of thngs and other moble wreless networks. Some common names of protocols nclude CONFIDANT [19], COR [20] and SORI [21] etc. Saleh et al. [22] has proposed some metrcs and a trust aware routng framework for wreless networks recently. There have proposed three routng metrcs.e. RTOR [22], TORDP [22] and GOTOR [22], for opportunstc routng protocols for calculatng the trust value. They have proposed a trust aware opportunstc routng protocol prevously, whch s also developed for wreless networks. But these all are not purely meant for WSN and does not work well n sensor networks. Also for opportunstc routng, to the best of our knowledge, very few trust based systems have been proposed. Trust management n WSN has also been focused durng last three years. As sensor nodes have lmted resources, researchers try to balance between securty and utlzaton of resources. Deng et.al. have proposed a dynamc routng framework for WSN, whch ncorporates socal network theores of trust and named t as TARF [23]. TARF uses conventonal cryptographc approaches as complementary methods and provde securty solutons for WSN. nergy effcency s an ssue n ths protocol. Workng n WSN securty MPIR [24] protocol has been proposed. Ths s probablstc and dstrbuted montorng approach. It tres to decrease montorng tasks per node and save energy, by mantanng the approprate securty level. Another trust based routng protocol for WSN has been proposed and named as TARP [25]. Ths protocol defne routng paths on the bass of maxmum utlzaton of resources wth lesser communcaton cost. But ths s also not, much energy effcent approach havng greater overhead. Recently, TSRP [26] has been proposed by Ahmed et.al whch s also desgned to save energy and lower the cost and overhead n routng process for WSN. TLAR [27] has been proposed especally for WSN. TLAR calculates the consoldated trust values usng drect and ndrect observatons of ts neghbors. Ths routng scheme adjust the route weght values dynamcally agan and agan. Ths ncrease the overhead and communcaton delay ntroduces. In ths paper we have presented a trust aware energy effcent opportunstc routng metrc for WSN. It s beng evaluated by extensve smulatons to check the effect of new metrc on varous performance parameters. The routng metrc proposed here has been checked wth exstng broadcastng algorthm DSDV. III. TRUST AWAR NRGY FFICINT OR MTRIC As dscussed n lterature very few researchers have focused on securty and energy effcency n opportunstc routng for WSN. In ths research a new trust aware energy effcent opportunstc routng metrc has been proposed, provde securty of data n transt and mprove lfetme of the network. nergy cost model wll be the same as n our research paper publshed recently [28]. In opportunstc routng the most mportant phase s consdered s the forwarder canddate set selecton. In wreless sensor network, after sensng data, each sensor node form a lst of ts neghbors. From neghbor lst, the forwarder canddates has been chosen and s gven a prorty value. The hghest prorty node wll frst transmt the data frst. Opportunstc routng make t possble to utlze broadcastng nature of wreless lnks. To fnd the best wreless lnk routng metrcs have been appled to OR. In ths secton a new opportunstc metrc has been ntroduced especally for OR protocols n WSN. Ths metrc s dstrbutve n nature. Ths metrc needs nformaton about forwarder nodes ID, energy and packet recepton rato. After collecton of these values, the node calculates forwardng rato, acknowledgement mpact and energy consumpton. By ncludng these all values trust value has been calculated. Dstance (D) between nodes s not requred as major crtera, especally for opportunstc routng n WSN. Hence, dstance wll be used only for checkng the packet forwardng progress (PFP) towards destnaton (q. 1 and q. 2). D ( x x ) ( y y ), j j j 2 2 where 0, j k, and j (1) sd, PFP D D n s, d n, d 2017, IJARCSS All Rghts Reserved Page 192

3 Ran Internatonal Journal of Advanced Research n Computer Scence and Software ngneerng 7(1), where s=source, d=destnaton, 0 n k (2) A. Proposed Metrc In opportunstc routng the forwarder node and the path of data packets have been decded at the tme of transmsson. ach sensor node mantan a matrx of trust evaluaton factors about other nodes and calculate the trust value for each forwarder canddate n neghbor lst. Metrc calculaton nvolves two step process as descrbed n below. Step 1: Trust valuaton In ths step, sensor node, when has data to send, form ts neghbor lst and extract the forwarder canddates on the bass of packet recepton rato (PRR) as calculated below n q. 3. Preceved PRR P where 0 PRR 1 (3) As soon as the forwarder lst has been made, the nodes now start calculatng the trust value for each node n the forwarder lst. The trust evaluaton conssts of followng trust factors. 1) Node Identfcaton (ID): Ths factor contans the locaton nformaton and the dentty of the forwarder canddate node. Source node collect ths nformaton from each node n the forwarder lst. ID NodeID, Locaton _ coordnates, nergy where 0 k 2) Forwardng Sncerty (F): Ths factor represents, whether the forwarder canddate node s forwardng the data packets successfully or not. Ths record s mantaned by usng the calculaton of success and falure counts. Intally ths value wll be 1 for each forwarder node. F : Forwardng sncerty value of node FS : Forwardng success count of node FF : Forwardng falure count of node. 3) nergy Depleton (): Ths factor calculates the energy consumpton for each transmsson made by a node. Ths factor s based on the nformaton of node s total energy. Also. Ths factor s used to calculate the lfetme of the node and the network. Ths factor s used to check whether the energy depleton s greater than threshold or not. If t s greater than threshold than the node cannot transfer data packets and excluded from the forwarder set. Otherwse a prorty has been set accordng to the value of ths factor. where, total : Total energy mpact of node : Transmsson energy, tx ( ) (4) 2017, IJARCSS All Rghts Reserved Page 193 sent total total tx rx ack : Recevng energy, rx ack : Acknowledgement sendng and recevng energy. 4) Acknowledgement Sncerty (ACK): Ths factor calculates the acknowledgement sendng and recevng sncerty among nodes. Ths record s mantaned by usng the calculaton of success and falure counts of acknowledgements transmssons. Also, ths value s useful to calculate the probablty of retransmsson of packets. Intally ths value wll be 1 for each forwarder node. ACK : Acknowledgement sncerty value of node SACK : Acknowledgement success count of node FACK : Acknowledgement falure count of node. 5) Trust Value (T): Ths factor gves the total trust value of a node and t wll be evaluated on the bass of all trust evaluaton factors. Ths value s dynamc n nature, because t needs to update agan and agan for every new transmsson of data packets. T : Trustworthness of node. Step 2: Trust Value Calculaton All trust evaluaton factors, dscussed above, values has been recorded n a matrx. As these values are dscrete, we cannot drectly judge the value n a logcal decson of trustng a node or not. Hence, the next step s to quantze the values of trust factors, so that the values wll be transformed nto contnuous values from -1 to +1. Here -1 means no trust and +1 means full trust. Trust quantfcaton for each trust factor can be calculated as follows: 1) Forwardng Sncerty Value 2) nergy Depleton Value FS FF F FS FF total, subject to 1 F 1 (5) tx rx ack, subject to 1 total 1 total (6)

4 Ran Internatonal Journal of Advanced Research n Computer Scence and Software ngneerng 7(1), 3) Acknowledgement Sncerty Value SACK FACK ACK, subject to 1 ACK 1 (7) SACK FACK Fnally usng these values total trust has been computed, whch nvolves the weghtng process. ach trust evaluaton factor has been assgned a weght. The weghts represents the mportance of each trust factor. The value wll be 0 for unmportant factor and 1 for most mportant factor. These weghts are dependent on the type of the applcatons of WSN. After the completon of ths process the trust value wll be calculated by the followng equaton. * F * * ACK T total, where 1,, 1 (8) Here, α s the weght adjustment for forwardng sncerty, β s the weght adjustment for nergy depleton and γ s the weght adjustment for acknowledgement sncerty. If the energy value s lower than a specfed threshold, than the node wll be excluded from the forwarder lst, because ths node s not able to forward data packets. And the value of trust, T n ths case wll be -1. As each sensor n nvolved n calculatng the trust value n the network, some malcous nodes whch are creatng problems lke nconsstent data, malcous data, and blockng data packets at one pont can be detected and reported n ths step. IV. XPRIMNTAL RSULTS AND ANALYSIS Ths secton presents the securty and energy performance of proposed trust aware opportunstc routng metrc. The metrc has been appled n DSDV protocol and smple DSDV [29], Ad-hoc On Demand (AODV) [30] and modfed DSDV (proposed) has been tested n WSN scenaro. The securty performance comprses the average number of malcous nodes have encountered durng a transmsson. A specfc malcous rato has been gven n every smulaton. On the other hand, energy performance s calculated by checkng the energy effcency of each node after each successful or unsuccessful transmsson n the presence of malcous nodes. A. Smulaton Setup The smulatons has been carred out by usng MATLAB. The scenaro consdered over here contans sngle base staton wth statc sensor nodes n a feld area of 500 x 500 m. The transmsson has been consdered successful only when base staton receves the packet. Many experments has been conducted consderng sngle base staton and contnuous communcaton model wth N sensor nodes. The source has been chosen randomly, whch wll ntate the communcaton. Table 1 Smulaton Parameters Parameter Descrpton Area 500 x 500 m Range of Rado 200 m Number of Nodes Traffc Type CBR Packet Sze 127 bytes Data Rate 20 kbps SNR Threshold 10 Intal nergy 10.0 J lectronc nergy 50 * 10-9 J At a tme only one source node has been selected and t wll forward the data towards base staton usng multple hops. The smulaton wll termnate the sensors havng energy lower than joules. For physcal and data lnk layers, I framework has been chosen, whch perfectly fts for low data rate applcatons and t provdes long lfetme of batteres of nodes [31]. As mentoned n [31], constant bt rate traffc wth a data rate of 20 kbps wth a packet sze of 127 bytes has been smulated here. Table 1 shows the smulaton settngs n MATLAB. B. xpermental Results The number of nodes consdered here vares from 50 to 100 deployed n the smulaton area. One can deploy nodes n any feld of applcaton as the poston of nodes s random. Ths metrc can be appled to any applcaton of WSN. a) Safety Performance: The safety performance has been measured for three protocols.e. DSDV, AODV and modfed DSDV. The dfferent malcous nodes percentages (5%-20%) has been consdered durng smulaton. It has been assumed that as the malcous sensor nodes rato ncreases n the network, the dffculty n managng securty n route setup has been ncreases. It can be seen from fgure 1 that the average rsk level of modfed DSDV has been lower as compared to DSDV and AODV protocols. Ths s because, n AODV and DSDV whle choosng the next-hop for data transmsson do not consder the values of number of successful transmsson and node energy. When a malcous node s 2017, IJARCSS All Rghts Reserved Page 194

5 Average Rsk Level Ran Internatonal Journal of Advanced Research n Computer Scence and Software ngneerng 7(1), selected as next-hop t wll not forward the packet or drop the packet. Ths malcous node wll be detected n modfed DSDV usng proposed trust aware metrc and wll be avoded for the next transmsson. Ths conclude that trust aware metrc can attan a hgh level of securty Average Rsk Level (5%-20% malcous nodes) No of Nodes Fgure 1: Average Rsk Level AVG Rsk_Proposed AVG Rsk_AODV AVG Rsk_DSDV From fgure 1 the average rsk level ncreases wth respect to ncrease n the number of malcous nodes n network. The rsk level for all three protocols ncrease as the malcous nodes ncrease n the network, because of the problem n choosng nodes as next-hop. very tme a malcous node drop the packet, there s a need of settng up route agan and retransmttng mssng packets. As the average rsk level n AODV and DSDV s hgh, we can conclude that, there s no securty has been consdered n the routng metrc of these protocols. b) nergy ffcency Performance: To test the energy performance of three protocols, general energy model has been consdered from our prevously publshed research paper [28]. Fgure 2 shows average energy cost for dfferent smulatons under dfferent malcous nodes ratos (5%-20%). It can be seen from the fgure 2 that modfed DSDV wth proposed metrc shows hgh energy effcency as compared to AODV and DSDV. AODV and DSDV shows poor performance n terms of energy effcency. Fgure 3 shows the average network lfetme whch vares wth number of nodes and the number of malcous nodes. Proposed metrc shows good performance n mantan good lfetme, but reduces n performance when the malcous nodes ncreases n the network. The energy effcency decreases because, f there are larger number of malcous nodes n the network, there wll be problems n route setup. The end-to-end delay wll be ncreases and also the path loss ncreases (fgure 4 and fgure 5) n ths case. Fgure 2: Average nergy Consumpton Fgure 3: Average Network Lfetme 2017, IJARCSS All Rghts Reserved Page 195

6 Ran Internatonal Journal of Advanced Research n Computer Scence and Software ngneerng 7(1), Fgure 4: Average nd-to-nd Delay From overall results obtaned above t can be concluded that the proposed metrc works well wth DSDV n mantanng the safety and energy effcency n the network. Proposed metrc has advantages of equal energy load dstrbuton and mantanng securty, over exstng route setup metrcs used n AODV and DSDV. The only dsadvantage s that the end-to-end delay wll be hgh due to lttle computaton overhead. Fgure 5: Average Path Loss V. CONCLUSION AND FUTUR SCOP In ths paper, we have proposed a new trust and energy aware routng metrc and appled t to DSDV protocol. The routng metrc focuses on the trustworthness and energy effcency of the nodes n the network. The trustworthness can be computed as a factor of forwardng sncerty, energy cost and acknowledgement sncerty of a node. These factors are most essental for the survval and successful operaton of WSN n hostle envronment and malcous attacks. The routng metrc can be vewed as a composte metrc. It assgns weghts for energy, forwardng sncerty and acknowledgement sncerty of a node. If a node s not satsfyng n these three sncerty condtons, t wll not be consdered as next-hop for data transmsson. The route selecton has been mproved and false lnk falure notfcatons has been avoded. The smulaton results have shown the betterment of the proposed metrc n terms of safety and energy effcency. RFRNCS [1] Akyldz, I.F., and Kasmoglu, I.H.: Wreless sensor and actor networks: research challenges, Ad hoc networks, 2004, 2, (4), pp [2] Akyldz, I.F., Su, W., Sankarasubramanam, Y., and Cayrc,.: Wreless sensor networks: a survey, Computer networks, 2002, 38, (4), pp [3] Mohndru, V., and Sngh, Y.: ffcent Approach for Securng Message Communcaton n Wreless Sensor Networks from Node Clone Attack, Indan Journal of Scence and Technology, 2016, 9, (32), pp. 1-7 [4] Lyu, C., Gu, D., Zhang, X., Sun, S., Zhang, Y., and Pande, A.: SGOR: Secure and scalable geographc opportunstc routng wth receved sgnal strength n WSNs, Computer Communcatons, 2015, 59, pp [5] Shakh, R.A., Jameel, H., d'aurol, B.J., Lee, H., Lee, S., and Song, Y.-J.: Group-based trust management scheme for clustered wreless sensor networks, I transactons on parallel and dstrbuted systems, 2009, 20, (11), pp [6] Yao, L., Man, Y., Huang, Z., Deng, J., and Wang, X.: Secure Routng based on Socal Smlarty n Opportunstc Networks, I Transactons on Wreless Communcatons, 2016, 15, (1), pp , IJARCSS All Rghts Reserved Page 196

7 Ran Internatonal Journal of Advanced Research n Computer Scence and Software ngneerng 7(1), [7] Yao, Z., Km, D., and Doh, Y.: PLUS: Parameterzed and localzed trust management scheme for sensor networks securty, n proceedngs of Internatonal Conference on Moble Ad Hoc and Sensor Systems (I, 2006), Vancover, BC, pp [8] Zhou, Y., Tan, X., He, X., Qn, G., and X, H.: Secure Opportunstc Routng for Wreless Mult-Hop Networks Usng LPG and Dgtal Sgnature, Informaton Assurance and Securty Letters 1 (2010), 2010, pp [9] Kumar, N., and Sngh, Y.: Routng Protocols n Wreless Sensor Networks, n Nranjan, K.R., and Ashok Kumar, T. (ds.): Handbook of Research on Advanced Wreless Sensor Network Applcatons, Protocols, and Archtectures (IGI Global, 2016), pp [10] Bswas, S., and Morrs, R.: xor: opportunstc mult-hop routng for wreless networks, n Proceedngs of 35 th SIGCOMM Computer Communcaton Revew (ACM, 2005), Phladelpha, Pennsylvana, USA, pp [11] Koksal, C.., and Balakrshnan, H.: Qualty-aware routng metrcs for tme-varyng wreless mesh networks, I Journal on Selected Areas n Communcatons, 2006, 24, (11), pp [12] Zhong, Z., Wang, J., Nelakudt, S., and Lu, G.-H.: On selecton of canddates for opportunstc anypath forwardng, ACM SIGMOBIL Moble Computng and Communcatons Revew, 2006, 10, (4), pp. 1-2 [13] Hsu, C.-J., Lu, H.-I., and Seah, W.K.G.: Opportunstc routng : A revew and the challenges ahead, Computer Networks, 2011, 55, (15), pp [14] Lu, K., Abu-Ghazaleh, N., and Kang, K.-D.: Locaton verfcaton and trust management for reslent geographc routng, Journal of Parallel and Dstrbuted Computng, 2007, 67, (2), pp [15] Boukerche, A., and Darehshoorzadeh, A.: Opportunstc routng n wreless networks: Models, algorthms, and classfcatons, ACM Computng Surveys (CSUR), 2015, 47, (2), pp. 22 [16] Dubos-Ferrare, H., Grossglauser, M., and Vetterl, M.: Valuable detours: Least-cost anypath routng, I/ACM Transactons on Networkng, 2011, 19, (2), pp [17] Rozner,., Seshadr, J., Mehta, Y.A., and Qu, L.: SOAR: Smple opportunstc adaptve routng protocol for wreless mesh networks, I Transactons on Moble Computng, 2009, 8, (12), pp [18] Hu-hu, D., Ya-jun, G., Zhong-qang, Y., and Hao, C.: A wreless sensor networks based on mult-angle trust of node, n Proceedngs of Internatonal Forum on Informaton Technology and Applcatons (I, 2009), Chengdu, Chna, pp [19] Ganerwal, S., Balzano, L.K., and Srvastava, M.B.: Reputaton-based framework for hgh ntegrty sensor networks, ACM Transactons on Sensor Networks (TOSN), 2008, 4, (3), pp. 15 [20] Mchard, P., and Molva, R.: Core: a collaboratve reputaton mechansm to enforce node cooperaton n moble ad hoc networks : Advanced communcatons and multmeda securty (Sprnger, 2002), pp [21] He, Q., Wu, D., and Khosla, P.: SORI: a secure and objectve reputaton-based ncentve scheme for ad-hoc networks, n Proceedngs of Wreless communcatons and networkng conference (I, 2004), Atlanta, GA, USA, pp [22] Saleh, M., Boukerche, A., Darehshoorzadeh, A., and Mammer, A.: Towards a novel trust-based opportunstc routng protocol for wreless networks, Wreless Networks, 2016, 22, (3), pp [23] Deng, H., Yang, Y., Jn, G., Xu, R., and Sh, W.: Buldng a trust-aware dynamc routng soluton for wreless sensor networks, n Proceedngs of Globecom Workshops (I, 2010), Mam, Florda, USA, pp [24] Maarouf, I., Baroud, U., and Naseer, A.R.: ffcent montorng approach for reputaton system-based trustaware routng n wreless sensor networks, IT communcatons, 2009, 3, (5), pp [25] Gong, P., Chen, T.M., and Xu, Q.: TARP: An nergy ffcent Trust-Aware Routng Protocol for Wreless Sensor Networks, Journal of Sensors, 2015, 2015 [26] Adnan, A., Kamalrulnzam Abu, B., Muhammad Ibrahm, C., and Abdul Waheed, K.: A Secure Routng Protocol wth Trust and nergy Awareness for Wreless Sensor Network, Mob. Netw. Appl., 2016, 21, (2), pp [27] Vams, P.R., and Kant, K.: Trust and Locaton-Aware Routng Protocol for Wreless Sensor Networks, IT Journal of Research, 2016, 63, pp [28] Kumar, N., and Sngh, Y.: An nergy ffcent Opportunstc Routng Metrc for Wreless Sensor Networks, Indan Journal of Scence and Technology, 2016, 9, (32), pp. 1-7 [29] Perkns, C.., and Bhagwat, P.: Hghly dynamc destnaton-sequenced dstance-vector routng (DSDV) for moble computers, n Proceedngs of SIGCOMM computer communcaton revew (ACM, 1994), New York, USA, pp [30] Perkns, C., Beldng-Royer,., and Das, S.: Ad hoc on-demand dstance vector (AODV) routng, No. RFC 3561, 2003 [31] Chang, J.-H., and Tassulas, L.: nergy conservng routng n wreless ad-hoc networks, n Nneteenth Annual Jont Conference of the I Computer and Communcatons Socetes (I, 2000), Tel Avv, Israel, pp , IJARCSS All Rghts Reserved Page 197