Communication security and reliability are two important issues in any network. A typical communication task in a wireless sensor network is for every sensor node to sense its local environment and, upon request, sends data of interest back to a base station (sink). Due to the distributed nature of these networks and their deployment in remote areas, these networks are vulnerable to numerous security threats that can adversely affect their proper functioning. This problem is more critical if the network is deployed for some mission-critical applications such as a tactical battlefield. Due to resource constraints in the sensor nodes like processing power, memory, bandwidth and power sources, traditional security mechanisms with large overhead of computation and communication are infeasible in WSNs. Security in sensor networks is, therefore, a particularly challenging task. The main requirements of wireless sensor networks are to extend the network lifetime and energy efficiency as well as provide a secure and reliable connection. In this project redundancy management of heterogeneous wireless sensor networks (HWSNs) is proposed, to answer user queries in the presence of unreliable and malicious nodes. The objective of the redundancy management is to exploit tradeoff between energy consumption against the gain in quality of service (QoS) such as reliability, timeliness and security to maximize the system lifetime. The presence of heterogeneous nodes in a sensor network is known to increase network reliability and lifetime. Selecting multipath routing can yield a variety of benefits such as fault tolerance, increased bandwidth and improved security. Furthermore, the best redundancy level for path redundancy and source redundancy is analyzed and the best intrusion detection system (IDS) is provided.

1. REDUNDANCY MANAGEMENT IN
HETEROGENEOUSWIRELESS
SENSOR NETWORKS
By: Saeid Hossein Pour lotomi
Roll No: 12011D4026
Guide: Ms.E.Hemalatha

2. Overview
• Introduction
• Modules
• Screenshots
• Conclusion
• Future work
• References

3. Introduction
• WSNs are deployed in an unattended
environment.
• limited resources, a WSN must satisfy:
i. QoS requirements and also
ii. minimize energy consumption
 to prolong the system useful lifetime.
• Tradeoff between energy consumption vs.
QoS gain with the goal to maximize the WSN
system lifetime has been well explored in the
literature.
• No prior work exists to consider the tradeoff
in the presence of malicious attackers.

4. The components of a sensor node

5. What is Wireless Sensor
Networks?
• WSN is composed of a large number of wireless sensors
with low processing power and energy consumption for
monitoring a certain environment
• In mathematics, a Voronoi diagram is a way of dividing space into
a number of regions.

6. Modules
I. Attack Scenario
II. Compromised Node
III. Redundancy Management
IV. Dynamic Redundancy Management
Algorithm

7. Attack Scenario
• All sensors are subject to capture attacks
• Intrusion/fault Tolerance
Through multipath routing
• Two most energy conserving attacks
I. Bad-mouthing attack
II. Packet dropping attacks

8. Compromised Node
• To detect compromised nodes, every node runs
a simple host IDS to assess its neighbors.
• The IDS is light-weight to conserve energy. It is
also generic and does not rely on the feedback
mechanism tied in with a specific routing
protocol .
• It is based on local monitoring. That is, each
node monitors its neighbor nodes only.
• To remove malicious nodes from the system, a
votingbased distributed IDS is applied
periodically in every TIDS (IDS interval time(sec)).
• It analyses the network by collecting sufficient
amount of data and detects unusual behavior of
sensor node.

9. Redundancy Management
• Increase source or path redundancy enhance
reliability , security. However, it also increases
the energy consumption (system lifetime).
• Tradeoff between QoS vs. energy consumption
by using distributed IDS.
• Maximize life time of a HWSN(MTTF)

10. Algorithm for Dynamic Redundancy
Management of multipath routing
algorithm.
The objective of dynamic
redundancy management is to
dynamically identify and apply the
best redundancy level in terms of
path redundancy (mp) and source
redundancy (ms), as well as the
best intrusion detection settings in
terms of the number of voters (m)
and the intrusion invocation
interval (TIDS) to maximize MTTF.

11. CH Execution for Dynamic Redundancy
Management.
1: CH Execution:
2: Get next event
3: if event is TD timer then
4: determine radio range to maintain CH connectivity
5: determine optimal TIDS,m,ms,mP
6: notify SNS within the cluster of the new
optimal settings of TIDS and m
7: else if event is query arrival then
8: trigger multipath routing using mS and mP
9: else if event is Tclustering timer then
10: perform clustering
11: else if event is TIDS timer then
12: for each neighbor CH
13: if selected as a voter then
14: execute voting based intrusion
detection
15: else // event is data packet arrival
16: follow multipath routing protocol design to route
the data packet

12. SN Execution for Dynamic Redundancy
Management
1: SN Execution:
2: Get next event
3: if event is TD timer then
4: determine radio range to maintain CH connectivity
within a cluster
5: else if event is control packet arrival from CH then
6: change the optimal settings of TIDS and m
7: else if event is Tclustering timer then
8: perform clustering
9: else if event is TIDS timer then
10: for each neighbor SN
11: if selected as a voter then
12: execute voting based intrusion
detection
13: else // event is data packet arrival
14: follow multipath routing protocol design to route the
data packet

13. SCREENSHOTS

14. Source

15. Routing

16. Routing

17. Routing

18. Routing

19. Routing

20. Destination

21. Conclusion
• A HWSN is maximized for reliability,
timeliness and security requirements of
query processing applications in the
presence of unreliable wireless
communication and malicious nodes.
• The design of a dynamic redundancy
management algorithm to identify and apply
the best design parameter settings at
runtime in response to prolong the system
lifetime. HWSN utilize multipath routing,
used to minimize the energy consumption
and reduce the failure node and transfer the
information in security manner.

22. Future work
For future work, we can explore more extensive
malicious attacks in addition to packet dropping
and bad mouthing attacks, each with different
implications to energy, security and reliability,
and investigate intrusion detection and
multipath routing based tolerance protocols to
react to these attacks.

23. References
• [1] Azzedine Boukerche, “Algorithms and protocols for wireless sensor networks” Willey, 2009.
• [2] W.Dargie,Ch.poellabauer,“Fundamentals of wireless sensor networks” Willey, 2010.
• [3] Ian F.Akylidiz, M. Can Vruan“Wireless sensor networks” Willey, 2010.
• [4] Ankita Joshi, Lakshmi Priya “A Survey of Hierarchical Routing Protocols in Wireless Sensor
Network” NIT Hamirpur.
• [5] Kinjal Patel, Himanshu Arora, Pradeep Jha “Hierarchical routing protocol in wireless sensor
network” IJATER.
• [6] Fiach Reid, “Network Programming in .NET” Elsevier Digital Press, 2004.
• [7] Hamid Al-Hamadi, Ing-Ray Chen, “Redundancy Management of Multipath Routing for
Intrusion Tolerance in Heterogeneous Wireless Sensor Networks” IEEE paper, 2013.
• [8] P.Swaruba, K.Kumaresan,“Weighted voting based trust management for intrusion tolerance
in heterogeneous wireless sensor networks.” International Journal of Computer Science and
Management Research, 2013.
• [9] Daniel-Ioan Curiac, Constantin Volosencu, Dan Pescaru, Lucian Jurca, Alexa Doboli,“
Redundancy and Its Applications in Wireless Sensor Networks: A Survey” WSEAS.
• [10] B. Rachid , H. Hafid , K. Bouabdellah,“ A distributed approach using redundancy for wireless
sensor networks reconfiguration” Oran Es-senia.
• [11] S. Mishra, A. Raj, A. Kayal, V. Choudhary, P. Verma, L. Biswal,“ Study of Cluster Based Routing
Protocols in Wireless Sensor Networks” IJSER journal .

24. QUESTIONS?