Beruflich Dokumente
Kultur Dokumente
Time
CTP without
adversaries
CTP with 5-
node
wormhole
0
10
20
30
40
N
u
m
b
e
r
o
f
Time
CTP without
adversaries
CTP with 5-
node
wormhole
International Journal of Computer Trends and Technology (IJCTT) volume 5 number 1 Nov 2013
ISSN: 2231-2803 http://www.ijcttjournal.org Page4
reveal that the number of nodes with delivery records
is more when there are no adversaries.
Fig. 3 Time vs. number of nodes with delivery
record (Third Floor)
As can be seen in figure 3, the time is represented by
horizontal axis while the number of nodes with
delivery record is represented by vertical axis. The
experiments are made with proposed framework. The
collection tree routing protocol is also used for
experiments with and without adversaries. The results
reveal that the number of nodes with delivery records
is more when there are no adversaries.
Fig. 4 Number of reported detections
As can be seen in figure 4, it is evident that the
number of reported detections is more with our
framework enabled CTP node. This will prove the
efficiency of the proposed framework when
compared with normal CTP.
V. CONCLUSION
In this paper we studied the problem of security in
WSNs. WSNs are vulnerable as they are open,
resource constrained and mobility in nature. They are
subjected to various attacks such as wormhole attack,
sinkhole attack and Sybil attacks. Adversaries replay
the routing information in order to launch these
attacks. We implemented trust aware routing
framework that ensures that these attacks are
prevented. The proposed framework is both
trustworthy and energy efficient. A node in the
network can track of trustworthiness of neighbors so
as to take effective routing decisions. We built a
prototype application to demonstrate the efficiency of
the proposed framework. Experimental results reveal
that he trust aware framework is very effective and
useful for real world applications.
REFERENCES
[1] F. Zhao and L. Guibas, Wireless Sensor Networks: An
Information Processing Approach. Morgan Kaufmann Publishers,
2004.
[2] A. Wood and J . Stankovic, Denial of service in sensor
networks, Computer, vol. 35, no. 10, pp. 5462, Oct 2002.
[3] C. Karlof and D. Wagner, Secure routing in wireless sensor
networks: attacks and countermeasures, in Proceedings of the 1st
IEEE International Workshop on Sensor Network Protocols and
Applications, 2003.
[4] M. J ain and H. Kandwal, A survey on complex wormhole
attack in wireless ad hoc networks, in Proceedings of
International Conference on Advances in Computing, Control, and
Telecommunication Technologies (ACT 09), 28-29 2009, pp. 555
558.
[5] I. Krontiris, T. Giannetsos, and T. Dimitriou, Launching a
sinkhole attack in wireless sensor networks; the intruder side, in
Proceedings of IEEE International Conference on Wireless and
Mobile Computing, Networking and Communications(WIMOB
08), 12-14 2008, pp. 526 531.
[6] J . Hee-J in, N. Choon-Sung, J . Yi-Seok, and S. Dong-Ryeol,
A mobile agent based leach in wireless sensor networks, in
Proceedings of the 10th International Conference on Advanced
Communication Technology (ICACT 2008), vol. 1, 17-20 2008, pp.
75 78.
[7] W. Xue, J . Aiguo, and W. Sheng, Mobile agent based moving
target methods in wireless sensor networks, in IEEE International
Symposium on Communications and Information Technology
(ISCIT 2005), vol. 1, 12-14 2005, pp. 22 26.
[8] L. Zhang, Q. Wang, and X. Shu, A mobile-agent-based
middleware for wireless sensor networks data fusion, in
Proceedings of Instrumentation and Measurement Technology
Conference (I2MTC 09), 5-7 2009, pp. 378 383.
[9] L. Bai, F. Ferrese, K. Ploskina, and S. Biswas, Performance
analysis of mobile agent-based wireless sensor network, in
0
5
10
15
20
25
30
N
u
m
b
e
r
o
f
Time
CTP without
adversaries
CTP with 5-
node
wormhole
0
50
100
150
200
1 2 3
N
u
m
b
e
r
o
f