Open Access Open Access  Restricted Access Subscription or Fee Access

Implementing Truthful Routing Path Generation in WSN through TARF

Premakshi B. Dohe

Abstract


Wireless device networks are susceptible to a good set of security attacks, together with those targeting the routing protocol practicality. The multi-hop routing in wireless device networks (WSNs) offers very little protection against identity deception through replaying routing data. Associate in Nursingopposerwill exploit this defect to launch numerous harmful or perhaps devastating attacks against the routing protocols, together withsink attacks, hollow attacks and Sybil attacks. To face this downside, we tend to propose a truthful routing protocol that adopts the routing principle to address the network dimensions, and depends on a distributed trust model for the detection and dodging of malicious neighbors. true is any aggravated by mobile and harsh network conditions. Ancient cryptographical techniques or efforts at developing trust-aware routing protocols don't effectively address this severe downside. Further, we'veenforced allow-overhead TARF module in TinyOS; as incontestable, this implementation may be incorporated into existing routing protocols with the smallest amount effort. supported TARF, we tend toadditionallyincontestable a proof-of-concept mobile target detection application that functions well against Associate in Nursing anti-detection mechanism.
To secure the WSNs against adversaries misdirecting the multi-hop routing, we've designed and enforced TARF, a strong trust-aware routing framework for dynamic WSNs. 


Keywords


Control Overhead, Dropping Ratio, Delay Energy Efficient Routing, Jitter, Secure Routing, Sensor Energy, Simulation Throughput, Trust-Aware Routing, WSN.

Full Text:

PDF

References


J. Newsome, E. Shi, D. Song, and A. Perrig, Apr 2004“The sybil attack in sensor networks: Analysis and defenses,” in Proc. of the 3rdInternational Conference on Information Processing in Sensor Networks (IPSN’04).

L. Bai, F. Ferrese, K. Ploskina, and S. Biswas, 2009 “Performance analysis of mobile agent-based wireless sensor network,” 8th International Conference on Reliability, Maintainability andSafety (ICRMS 2009), pp. 16 –19.

L. Zhang, Q. Wang, and X. Shu, 5-7 2009 “A mobile-agent-based middleware for wireless sensor networks data fusion,” Instrumentation and Measurement Technology Conference (I2MTC’09), pp. 378 –383.

W. Xue, J. Aiguo, and W. Sheng,12-14 2005 “Mobile agent based moving target methods in wireless sensor networks,” ,IEEE International Symposium on Communications and Information Technology (ISCIT2005), vol. 1, pp. 22 – 26.

J. Hee-Jin, N. Choon-Sung, J. Yi-Seok, and S. Dong-Ryeol,2008 “Amobile agent based leach in wireless sensor networks,” 10th International Conference on Advanced Communication Technology (ICACT 2008), vol. 1, 17-20 , pp. 75 –78.

J. Al-Karaki and A. Kamal,Dec 2004 “Routing techniques in wireless sensornetworks: a survey,” Wireless Communications, vol. 11, no. 6, pp.6–28.

G. Zhan, W. Shi, and J. Deng, 2010“TARF: A trust-aware routing framework for wireless sensor networks,” 7th European Conference on Wireless Sensor Networks (EWSN’10).

F. Zhao and L. Guibas, “Wireless Sensor Networks: An Information Processing Approach”2004,Morgan Kaufmann Publishers.

A. Wood and J. Stankovic,Oct 2002 “Denial of service in sensor networks,” Computer, vol. 35, no. 10, pp. 54–62.

C. Karlof and D. Wagner, 2003 “Secure routing in wireless sensor networks: attacks and countermeasures” 1st IEEE International Workshop on Sensor Network Protocols and Applications.

M. Jain and H. Kandwal,2009 “A survey on complex wormhole attack in wireless ad hoc networks,” International Conference on Advances in Computing, Control, and Telecommunication Technologies (ACT ’09), pp. 555 –558.

I. Krontiris, T. Giannetsos, and T. Dimitriou, “Launching a sinkhole attack in wireless sensor networks; the intruder side,” IEEE International Conference on Wireless and Mobile Computing, Network


Refbacks

  • There are currently no refbacks.


Creative Commons License
This work is licensed under a Creative Commons Attribution 3.0 License.