DISSERTATION_heena.docx

8/10/2019 DISSERTATION_heena.docx

1/87

SECURE ROUTING IN WIRELESS SENSOR

NETORK

Dissertation Submitted in the partial fulfilment of the requirements for the award

of degree of

Master of Engineering

In

Computer Science & Engineering

Submitted By:

HEENA SINGH

(1202062037)

Under the guidance of

Prof.(Dr.) Naveen Hemrajani

Head of Department

2012-2014

COMPUTER SCIENCE AND ENGINEERING DEPARTMENT

JECRC UNIVERSITY, JAIPUR


2/87

CERTIFICATE

This is to certify that the work in this dissertation entitled Secure Routing In

Wireless Sensor Networks submitted by Miss. Heena Singh in partial fulfillment ofthe requirements for the award of the degree of Master of Technology in Computer

Science & Engineering during the session 2012-2014 in the Department ofComputer Science & Engineering, JECRC University, Jaipur is an authentic work

carried out by her under my supervision and guidance.

To the best of my knowledge, the matter presented in this dissertation has not beensubmitted to any other University/Institute for the award of any Degree.

Prof. ( Dr.) Naveen Hemrajani

Head Of DepartmentComputer Science & Engineering

JECRC UniversityJaipur, Rajasthan

Department of Computer Science and Engineering

JECRC UNIVERSITY, JAIPUR, RAJASTHAN,

303905


3/87

DECLARATION BY STUDENT

Hereby I declare, that this dissertation is my original authorial work, which I haveworked out by my own. All sources, references and literature used or excerpted

during elaboration of this work are properly cited and listed in complete referenceto the due source.

Heena Singh

M.Tech

CSE


4/87

ACKNOWLEDGMENT

My first thanks are to Almighty God, without whose blessings I wouldnt have beenwriting these acknowledgements.

I then would like to express my heartfelt thanks to my guide, Prof . (Dr .) NaveenHemrajani , Head of Department of Computer Science & Engineering, for givingme the guidance, encouragement, counsel throughout my research and reading my

reports and my research papers. He has helped me to explore this vast topic in an

organized manner and provided me with all the ideas on how to work towards aresearch oriented venture. Without his invaluable advice and assistance it would

not have been possible for me to complete this dissertation.

I am also thankful to Mr. Ajay Kumar, for providing me help and support.

I would also like to thank the staff members and my colleagues who were always

there in the need of the hour and provided with all the help and facilities, which Irequired, for the completion of my dissertation.

Most importantly, I would like to thank my Parents and the Almighty for showing

me the right direction out of the blue, to help me stay calm in the oddest of the

times and keep moving even at times when there was no hope.

Finally, I would like to thank all of them whose names are not mentioned herebut have helped me in any way to accomplish the work.

HEENA SINGH


5/87

ABSTRACT

Wireless networks of miniaturized, low-power sensor/actuator devices are poised to become

widely used in commercial and military environments. The communication security problems for

these networks are exacerbated by the limited power and energy of the sensor devices. WSN

generally deployed in natural environment hence a large number of security issues are there. In

many sensor network applications, security and privacy of the data collected will be a critical

concern. Providing security services for sensor networks is a technical challenge. In order to

protect the data in WSN require more techniques for making data transmission more secure from

the attackers. The proposed work describes the design and implementation of sensor deployment,

master node selection, and dissemination of authenticated messages into the network to improve

the secure communication among them. Frequent update of node information in the database;support the secure communication under very limiting energy. In addition, it selects highly

energetic shortest routes that have authenticated nodes for data transmission. Thus, the proposed

work improves the performance by exploiting multiple highly energetic shortest paths with

authenticated routers.

OBJECTIVES

To improve the secure sensor communication, deploy the sensor network andselect a sender called Master Node which is considered as an authenticated

node from the network.

To maintain the database for both authenticated and unauthenticated nodes

accurately using the dissemination of authenticated detection messages

To select the highly energetic and shortest paths having authenticated routers to

reach the sink node


6/87


7/87

4. Requirement Analysis/ Background of Work

4.1Design Specifications

4.2 Details of Hardware /Software/ Platform to be used for Experimentations

5. Experimental Analysis and Results

5.1 Final Objective

5.2 Experimentations carried out towards meeting final Objectives

5.3 Result and Discussion on whether and to what extent the objectives are met

5.4 Future Planning

6. Conclusion

References

Bibliography

Appendix-A

Appendix-B


8/87

LIST OF TABLES


9/87

LIST OF FIGURES


10/87

ACRONYMS

ACK Acknowledgement

ADC Analog to Digital Convertor

AI Artificial Intelligence

AODV Ad-hoc On-demand Distance Vector

BE Backoff Exponent

BP Backoff Period

CRC Cyclic Redundancy Check

DARPA Defence Advanced Research Project Agency

DSN Distributed Sensor Networks

DSSS Direct Sequence Spread Spectrum

ED Energy Detection

FC 15 Fedora Core 15

FTP File Transfer Protocol

GUI Graphical User Interface I

IEEE Institute of Electrical and Electronics Engineers

IP Internet Protocol

WSN Wireless Sensor Network


11/87


12/87

capabilities, dynamic network topology, limited power, node failures and mobility of nodes,

short range broadcast communication and multi-hop routing, and large scale of deployment.

The sensor network architecture consists of one sink node (or base station) and a (large) number

of sensor nodes deployed over a large geographic area (sensing field). Data are transferred from

sensor nodes to the sink through a multi-hop communication paradigm [2]. We will consider firstthe case in which both the sink and the sensor nodes are static (static sensor network). Then, we

will also discuss energy conservation schemes for sensor networks with mobile elements in

further chapter, in which a sparse sensor network architecture where continuous end-to-endpaths between sensor nodes and the sink might not be availablewill be accounted as well.

Fig: 2 Sensor network architecture

The strength of wireless sensor network lies in their flexibility and scalability. The capability of

self-organize and wireless communication made them to be deployed in an ad-hoc fashion inremote or hazardous location without the need of any existing infrastructure. Through multi-hop

communication a sensor node can communicate a far away node in the network. This allows the

addition of sensor nodes in the network to expand the monitored area and hence proves itsscalability and flexibility property.

The key challenge in sensor networks is to maximize the lifetime of sensor nodes due to the factthat it is not feasible to replace the batteries of thousands of sensor nodes. Therefore,

computational operations of nodes and communication protocols must be made as energy

efficient as possible. Among these protocols data transmission protocols have much more

importance in terms of energy, since the energy required for data transmission takes 70 % of thetotal energy consumption of a wireless sensor network. Area coverage and data aggregation

techniques can greatly help conserve the scarce energy resources by eliminating data redundancy

and minimizing the number of data transmissions. Therefore, data aggregation methods in sensornetworks are extensively investigated.


13/87

Security in data communication is another important issue to be considered while designing

wireless sensor networks, as wireless sensor networks may be deployed in hostile areas such as

battlefields. Therefore, data aggregation protocols should work with the data communicationsecurity protocols, as any conflict between these protocols might create loopholes in network

security. Presently there are different types of commercially available sensor nodes.

1.1.1 Sensor network topology

Sheer numbers of inaccessible and unattended sensor nodes, which are prone to frequent failures.

Hundreds to several thousands of nodes are deployed throughout the sensor field. They are

deployed within tens of feet of each other. The node densities may be as high as 20 nodes/ m3.Deploying high number of nodes densely requires careful handling of topology maintenance. We

examine issues related to topology maintenance and change in three phases:

1. Pre-deployment and deployment phase: Sensor nodes can be either thrown in mass orplaced one by one in the sensor field. They can be deployed by

dropping from a plane delivering in an artillery shell, rocket or missile,

Throwing by a catapult (from a ship board, etc.)

Placing in factory, and placing one by one either by a human or a robot.

Although the sheer number of sensors and their unattended deployment usually preclude placingthem according to a carefully engineered deployment plan, the schemes for initial deployment

must

reduce the installation cost,

eliminate the need for any pre-organization and pre-planning,

increase the flexibility of arrangement, and

promote self-organization and fault tolerance.

2. Post-deployment phase: After deployment, topology changes are due tochange in sensor nodes.

Position

reach ability (due to jamming, noise, moving obstacles ,etc) available energy

Malfunctioning and task details.

Sensor nodes may be statically deployed. However, device failure is a regular or common event

due to energy depletion or destruction. It is also possible to have sensor networks with highlymobile nodes. Besides, sensor nodes and the network


14/87


15/87

Quality of Service:Some real time sensor application are very time critical which means thedata should be delivered within a certain period of time from the moment it is sensed, otherwise

the data will be unusable .So this must be a QOS parameter for some applications.

Unattended operation: In many application sensor networks is deployed once, and after

deployment have no human intervention. Hence the nodes themselves are responsible forreconfiguration in case of any changes.

Untethered:The sensor nodes are not connected to any energy source. They have only a finitesource of energy, which must be optimally used for processing and communication. To make

optimal use of energy, communication should be minimized as much as possible.

Security:Security is very critical parameter in sensor networks, given some of the proposedapplications. An effective compromise must be obtained, between the low bandwidth

requirements of sensor network applications and security demands for secure datacommunication in the sensor networks (which traditionally place considerable strain on

resources)Thus, unlike traditional networks, where the focus is on maximizing channelthroughput with secure transmission.

1.1.3 APPLICATION REQUIREMENT

The performance of a secure routing protocol is closely depended on the architectural model and

design of the sensor networks, base on the application requirements different architectures anddesign goals/constraints have been considered for sensor networks. In this section we attempt to

capture architectural issues and highlight their implications. The basic configuration of a simple

sensor node, it depends on the application requirement.

Security Implementation: Security is data communication is main concerning parameter forproviding secure communication in sensor networks, whiled designing wireless networks, as

wireless sensor networks may be deployed in hostile areas such as battlefields .therefore, designof protocol should work with the data communication security protocols, as any conflict between

these protocols might create challenge in network security.

Energy Considerations: Energy is very important parameter during the creation of an

infrastructure, and the process of selecting the routes for transmission. Since the transmission

power of a wireless radio is proportional to distance squared or even higher order in the presenceof obstacles, multi hop routing will consume less energy than direct communication. However,

multi hop routing introduces significant overhead for topology management and medium access

control. Direct routing would perform well enough if all the nodes were very close to the sink.

Data Aggregation/Fusion: In the sensor network, sensor nodes might generate redundant data;

similar packets from multiple nodes can be aggregated so that the number of transmissions

would be reduced. Data aggregation is the combination of data from different sources by usingfunctions. Such as suppression (eliminating duplicates), minimum, maximum and average. Some

of these functions can be performed by the aggregator sensor node, by allowing sensor nodes to

conduct in-network data reduction. Recognizing that computation would be less energy


16/87

consuming than communication, substantial energy savings can be obtained through data

aggregation.

Network Dynamics: There are three basic components, sensor nodes, sink and user which ismonitored the events in a sensor network. Most of the network architectures assume that sensor

nodes are stationary. Some application are required the mobility of sinks or cluster-heads(gateways). Routing messages from or to moving nodes is more challenging since route stability

becomes an important optimization factor, in addition to energy, bandwidth etc. The sensed

event can be either dynamic or static depending on the application.

Node Deployment: It is an important issue to deployment of sensor nodes in topologicalmanner. This is application dependent and affects the performance of the routing protocol. The

deployment is either deterministic or self-organizing. In deterministic situations, the sensors are

manually placed or data is routed through pre-determined paths. However in self-organizing

systems, the sensor nodes are scattered randomly creating an infrastructure in an ad hoc manner.

Data Delivery Models: Base on the application requirements of the sensor network, the datadelivery model to the sink can be continuous, event-driven, query-driven and hybrid. In the

continuous delivery model, each sensor sends data periodically. In event-driven and query driven

models, the transmission of data is triggered when an event occurs or a query is generated by the

sink. Some networks apply a hybrid model using a combination of continuous, event- driven and

query-driven data delivery.

Node Capabilities: Depending on the sort of work a node can be dedicated to a particularspecial function such as relaying, sensing and aggregation since engaging the three

functionalities at the same time on a node might quickly drain the energy of that node. Inclusion

of heterogeneous set of sensors raises multiple technical issues making data routing more

challenging.

1.1.4 Wireless Sensor Networks vs. Traditional Wireless Networks

There are many existing protocol, techniques and concepts from traditional wireless network,

such as cellular network, mobile ad-hoc network, wireless local area network and Bluetooth, are

applicable and still used in wireless sensor network, but there are also many fundamental

differences which lead to the need of new protocols and techniques. Some of the most importantcharacteristic differences are summarized below:

Number of nodes in wireless sensor network is much higher than any traditiona l wireless

network. Possibly a sensor network has to scale number of nodes to thousands. Moreover a

sensor network might need to extend the monitored area and has to increase number of nodes


17/87

from time to time. This needs a highly scalable solution to ensure sensor network operations

without any problem.

Due to large number of sensor nodes, addresses are not assigned to the sensor nodes. Sensor

networks are not address-centric; instead they are data-centric network. Operations in sensor

networks are centred on data instead of individual sensor node. As a result sensor nodes require

collaborative efforts.

Sensor nodes mainly use a broadcast communication paradigm, whereas most ad hoc networks

are on point-to-point communications.

Sensor nodes are much cheaper than nodes in ad hoc networks.

Wireless sensor networks are environment-driven. While data is generated by humans in

traditional networks, the sensor network generate data when environment changes. As a result

the traffic pattern changes dramatically from time to time. Sensor networks are mainly used to

collect information while MANETs (Mo-bile Ad hoc Networks) are designed for distributed

computing rather than information gathering.

A unique characteristic of wireless sensor network is the correlated data problem. Data

collected by neighbouring sensor nodes are often quite similar which makes possible to the

development of routing and aggregation techniques that can reduce redundancy and improve

energy efficiency. It has also been observed that the environmental quantities changes very slow

and some consecutive readings sense temporally correlated data. This advantageous feature can

be exploited to develop an energy efficient data gathering and aggregation techniques. Thus,

unlike traditional networks, where the focus is on maximizing channel throughput or minimizing

node deployment, the major consideration in a sensor network is to extend the system lifetime as

well as the system security.

1.1.5 Applications of Sensors

Military Applications: Sensor networks are applied very successfully in the military sensing.Now wireless sensor networks can be an integral part of military command, control,

communications, computing, intelligence, surveillance, reconnaissance and targeting systems.

There are two example important programs the Distributed Sensor Networks (DSN) and theSensor Information Technology (SenIT) form the Defense Advanced Research Project Agency

(DARPA) [14], are applied very successfully in the military sensing.

Environmental Monitoring: Nowadays sensor networks are also widely applied in habitat

monitoring, agriculture research.


18/87

Medical Application: Sensor networks are also widely used in health care area. In somemodern hospital sensor networks are constructed to monitor patient physiological data, to control

the drug administration track and monitor patients and doctors and inside a hospital.

Home Application: Many concepts are already designed by researcher and architects, like

"Smart Environment: Residential Laboratory" and "Smart Kindergarten" some are even realized.

Traffic Monitoring: The sensor node has a built-in magneto-resistive sensor that measures

changes in the Earth's magnetic field caused by the presence or passage of a vehicle in the

proximity of the node. A low-power radio relays the detection data to the access point at user-

selectable periodic reporting intervals or on an event driven basis. By placing two nodes a few

feet apart in the direction of traffic, accurate individual vehicle speeds can be measured and

reported.

Robotics Control:Robotics has matured as a system integration engineering field defined as

"the intelligent connection of the perception to action". Programmable robot manipulators

provide the "action" component. A variety of sensors and sensing techniques are available to

provide the "perception".

Habitat Monitoring:The intimate connection with its immediate physical environment allowseach sensor to provide localized measurements and detailed information that is hard to obtain

through traditional instrumentation.

1.1.6 Secure Data Routing In Wireless Sensor Network:

Wireless systems suffer from bandwidth, energy and throughput constraints which bound theamount of information transmission from end-to-end. Data routing is known technique

considered to alleviate these problems but there is some limitation due to lack of adaption to

dynamic network topologies and unpredictable traffic patterns.

The main constrains of WSNs are the power, storage and processing these limitation and the

specific architecture of sensors nodes call for energy efficient and secure communicationprotocols. The key challenge in WSNs is to maximize the lifetime of sensor nodes because of;

practically it is not possible to replace the batteries of large number of deployed sensor in the

environment.

The main goal of data-routing algorithms is to gather and aggregate data in an energy efficient

manner so that network lifetime is enhanced. in our framework we have also consider somesecurity issues to establish secured data routing in wireless sensor networks with negligible over

head. Data routing techniques can significantly help to conserve the limited energy resource by

eliminating data redundancy and minimizing the number of data transmission.


19/87

1.2 Motivation

Wireless Sensor Networks have risen as an imperative new territory in wireless innovation. The

wireless sensor networks comprises of many economical nodes each one having the sensing

proficiency with constrained computational and the correspondence power, which empower us to

send an extensive scale of sensor network systems.

Wireless sensor networks are possibly a standout amongst the most important innovations of this

century. Recent advancement in wireless interchanges and hardware has empowered the

improvement of ease, low-control, multifunctional little gadgets for utilization in remote sensingprovisions. The combination of these factors has enhanced the reasonability of using a sensor

system comprising of a substantial number of intelligent sensors, enabling the gathering,

processing analysis and dissemination of valuable information gathered in a variety of situations.

A wireless network consists of little devices which screens the physical or environmental

conditions such as temperature, pressure, movement or pollutants and so on at diverse territories.

Because of the thorough vitality obligations of extensive number of densely conveyed sensor

nodes, it requires a suite of system conventions to implement various network control and

administration capacities, for example, synchronization, hub restriction, and system security.

A wireless sensor system is an exceptional system with numerous challenges contrasted with a

traditional computer network. Because of these constraints it is difficult to specifically utilize

existing security methodologies to the range of WSN. WSNs were at first proposed in spaces

where standard systems (not so much wired) are not helpful, either on account of the missing

frameworks, or when various hubs (in the request of hundreds) are required to attain theallocated assignment.

Four basic components in a sensor network:-

1. An assembly of distributed or localized errors.

2. An interconnecting network [usually but not always wireless based].

3. A central point of information clustering.

4. A set of computing resources at the central point to handle the data correlation, event

trending, status querying and data mining.


20/87

Fig.3 Sensor Node Component

Todays sensor can be described as smartinexpensive devices equipped with multiple onboard

sensing elements; they are low-cost, low power unlettered multifunctional nodes that are

logically homed to a central sink node.

Sensor devices or wireless nodes are also sometimes called as motes. In some cases, it is

challenging to collect[extract] data from wireless sensors because connectivity to and from the

WSNs may be intermittent due to low-battery status[ e.g, if these are dependent on sunlight torecharge] or other wireless network malfunction.

Energy efficient wireless communications systems are being sought and are typical of WSNs.

Low power consumption is a key factor in ensuring long operating horizons for non-power-fed

systems.

Power efficiency in WSNs is generally accomplished in three ways:

Low-dutycycle operation

Local/in- network processing to reduce data volume Multi hop network reduces the requirement for long-range transmission.

The typical mode of communication in WSN is from multiple data sources to a data recipient or

sinks rather than communication between a pair of nodes.

Location

Finding

System

Mobilizer

Sensin

g Unit

Processing

Unit

Transceiv

er

POWER UNIT Power


21/87

In most scenarios the sensor themselves are not mobile, this implies that the dynamic in the two

types of networks are different.

Because the data being collected by multiple sensors are based on common phenomena, there is

potentially a degree of redundancy in the data being communicated by two various sources in

wireless sensor networks, such that some typical random-access protocol models may be

inadequate at the querying-analysis level.

The main challenges in wireless sensor networks are how to provide maximum lifetime to the

network and how to provide secure communication to network. As sensor networks totally rely

on battery power, the main aim for maximizing lifetime of network is to conserve battery power

or energy with some security considerations.

In sensor network, energy is mainly consumed for three purposes: data transmission, signal

processing, and the hardware operation. It is stated in [20] that 70 percent of the energy

consumption is due to the data transmission. So for maximizing the network lifetime, the process

of data transmission should be optimized. The data transmission can be optimized by using

efficient routing protocols and effective ways of data aggregation.

Routing protocols provide an optimal data transmission route from sensor nodes to sink to save

energy of nodes in the network. Data aggregation plays an important role in energy conservation

of sensor network. Data aggregation methods are used not only for finding an optimal path from

source to destination but also to eliminate the redundancy of data, since transmitting huge

volume of raw data is an energy intensive operation, and thus minimizing the number of data

transmission.

Also multiple sensors may sense the same phenomenon, although from different view and if this

data can be reconciled into a more meaningful form as it passes through the network, it becomes

more useful to an application.

Moreover when data aggregation is performing data is compress as it is passed through the

network, thus occupying less bandwidth. This also reduces the amount of transmission power

expended by nodes. Hence secure data aggregation can also be considered as a very challenging

problem in wireless sensor network.

1.2.1 Routing in Wireless Sensor Networks

Routing is a process of determining a path between source and destination upon request of data

transmission. In WSNs the network layer is mostly used to implement the routing of the

incoming data. It is known that generally in multi-hop networks the source node cannot reach the

sink directly. So, intermediate sensor nodes have to relay their packets. The implementation of


22/87

routing tables gives the solution. These contain the lists of node option for any given packet

destination. Routing table is the task of the routing algorithm along with the help of the routing

protocol for their construction and maintenance.

1.2.1.1 Routing Challenges and Design Issues

Depending on the application, different architectures and design goals/constraint have been

considered for sensor networks. The performance of a routing protocol is closely related to the

architectural model.

Network dynamics: Most of the network architectures assume that sensor nodes are

stationary, because there are very few setups that utilize mobile sensors. It is sometimes

necessary to support the mobility of sinks or cluster-heads (gateways). Route stability

becomes an important optimization factor, in addition to energy, bandwidth etc. As,

routing messages from or to moving nodes is more challenging. So, the sensed event can

be either dynamic or static depending on the application.

Node deployment: It is application dependent and affects the performance of the

routing protocol. The deployment is either deterministic or self-organizing. In

deterministic situations, the sensors are manually placed and data is routed through pre-

determined paths. Where as in self-organizing systems, the sensor nodes are scattered

randomly creating an infrastructure in an ad hoc manner. In later the position of the sink

or the cluster-head is also crucial in terms of energy efficiency and performance. When

the distribution of nodes is not uniform, optimal clustering becomes a pressing issue to

enable energy efficient network operation.

Energy considerations:During the creation of an infrastructure, the process of setting

up the routes is greatly influenced by energy considerations. Since the transmission

power of a wireless radio is proportional to distance squared or even higher order in the

presence of obstacles, multi-hop routing will consume less energy than direct

communication. However, multi-hop routing introduces significant overhead for

topology management and medium access control. Direct routing would perform well

enough if all the nodes were very close to the sink. Most of the time sensors are scattered

randomly over an area of interest and multi hop routing becomes unavoidable.

Data delivery models: Data delivery model to the sink can be continuous, event driven,

query-driven and hybrid, depending on the application of the sensor network. In the

continuous delivery model, each sensor sends data periodically. In event-driven and

query-driven models, the transmission of data is triggered when an event occurs or the

sink generates a query. Some networks apply a hybrid model using a combination of


23/87

continuous, event-driven and query-driven data delivery. The routing protocol is highly

influenced by the data delivery model, especially with regard to the minimization of

energy consumption and route stability.

Node capabilities:In a sensor network, different functionalities can be associated with

the sensor nodes. Depending on the application a node can be dedicated to a particular

special function such as relaying, sensing and aggregation since engaging the three

functionalities at the same time on a node might quickly drain the energy of that node.

Data aggregation/fusion: Similar packets from multiple nodes can be aggregated to

reduce the transmission. For this sensor nodes might generate significant redundant data.

Data aggregation is the combination of data from different sources by using functions

such as suppression (eliminating duplicates), min, max and average.

1.2.1.2 Routing Objectives

Some sensor network applications only require the successful delivery of messages between a

source and a destination. However, there are applications that need even more assurance. These

are the real-time requirements of the message delivery, and in parallel, the maximization of

network lifetime.

Non-real time delivery: The assurance of message delivery is indispensable for all

routing protocols. It means that the protocol should always find the route between the

communicating nodes, if it really exists. This correctness property can be proven in a

formal way, while the average-case performance can be evaluated by measuring themessage delivery ratio.

Real-time delivery: Some applications require that a message must be delivered within a

specified time, otherwise the message becomes useless or its information content is

decreasing after the time bound. Therefore, the main objective of these protocols is to

completely control the network delay. The average-case performance of these protocols

can be evaluated by measuring the message delivery ratio with time constraints.

Network lifetime: This protocol objective is crucial for those networks, where the

application must run on sensor nodes as long as possible. The protocols aiming this

concern try to balance the energy consumption equally among nodes considering their

residual energy levels. However, the metric used to determine the network lifetime is

also application dependent. Most protocols assume that every node is equally important

and they use the time until the first node dies as a metric, or the average energy

consumption of the nodes as another metric. If nodes are not equally important, then the

time until the last or high-priority nodes die can be a reasonable metric.


24/87

1.2.1.3. Characteristics of Routing Protocols

Generally the routing protocols are: Application specific, Data Centric, capable of aggregating

data; Capable of optimizing energy consumption.

1.2.1.4. Routing Techniques in Wireless Sensor Networks

WSN Routing Protocols can be classified in four ways, according to the way of routing paths are

established, according to the network structure, according to the protocol operation and

according to the initiator of communications. Fig. 4 shows the classification of WSN routing

protocols.

Fig. 4 Classification of Routing Protocols in Wireless Sensor Network.

Routing paths can be established in one of three ways, namely proactive, reactive or hybrid.

Proactive protocols compute all the routes before they are really needed and then store these

routes in a routing table in each node. When a route changes, the change has to be propagated

throughout the network. Since a WSN could consist of thousands of nodes, the routing table that

each node would have to keep could be huge and therefore proactive protocols are not suited to

WSNs.

Reactive protocols compute routes only when they are needed. Hybrid protocols use a

combination of these two ideas. But in general, routing in WSNs can be divided into three

categories named as flat-based routing, hierarchical-based routing and location based routing

depending on the network structure. In flat-based routing, all nodes play the same role. In

hierarchical-based routing, however, nodes will play different roles in the network. In location-


25/87

based routing, sensor nodes' positions are exploited to route data in the network. Furthermore,

these protocols can be classified into multipath-based, query-based, negotiation-based, QoS-

based, or coherent-based routing techniques depending on the protocol operation.

CATEGORY REPRESENTATIVE PROTOCOLS

LocationbasedProtocols

MECN, SMECN, GAF, GEAR, SPAN, TBF, BVGF, GeRaF

Data-Centric Protocols SPIN, Directed Diffusion, Rumor Routing, COUGAR, EAD,ACQUIRE, Information-Directed Routing, Gradient- Based Routing,

Energy-aware Routing, Information-Directed Routing

Hierarchial Protocols LEACH,PEGASIS,HEED,TEEN.APTEEN

Mobility-based

Protocols

SEAD,TTDD,Joint Mobility and Routing, Data MULES, Dynamic

proxy Tree-Base Data Dissemination

Multipath-basedProtocols

Sensor-Disjoint Multipath, Braided Multipath

Hetrogenity-based

Protocols

IDSQ,CADR,CHR

QoS-based protocols SAR, SPEED, Energy Aware Routing

1.2.2 General Approaches to Data Routing and Energy Conservation

Depending on the specific applications, the sensor nodes may also include additional

components such as a location finding system to determine their position, a mobilizer to changetheir location or configuration (e.g., antennas orientation), and so on.

The power breakdown heavily depends on the specific node. It is shown that the powercharacteristics of a Mote-class node are completely different from those of a Stargate node.

However, the following remarks generally hold:

The communication subsystem has much higher energy consumption than thecomputation subsystem. It has been shown that transmitting one bit may consume as

much as executing a few thousands instructions [21]. Therefore, communication should

be traded for computation.

The radio energy consumption is of the same order in the reception, transmission, andidle states, while the power consumption drops of at least one order of magnitude in the

sleep state. Therefore, the radio should be put to sleep (or turned off) whenever possible.

Depending on the specific application, the sensing subsystem might be anothersignificant source of energy consumption, so its power consumption has to be reduced aswell.

Based on the above architecture and power breakdown, several approaches have to be exploited,

even simultaneously, to reduce power consumption in wireless sensor networks. At a verygeneral level, we identify three main enabling techniques, namely, duty cycling, data-driven

approaches, and mobility.


26/87

Duty cycling is mainly focused on the networking subsystem. The most effective energy-

conserving operation is putting the radio transceiver in the (low-power) sleep mode whenever

communication is not required. Ideally, the radio should be switched off as soon as there is nomore data to send/receive, and should be resumed as soon as a new data packet becomes ready.

In this way nodes alternate between active and sleep periods depending on network activity. This

behavior is usually referred to as duty cycling, and duty cycle is defined as the fraction of timenodes are active during their lifetime. As sensor nodes perform a cooperative task, they need tocoordinate their sleep/wakeup times.

A sleep/wakeup scheduling algorithm thus accompanies any duty cycling scheme. It is typically

a distributed algorithm based on which sensor nodes decide when to transition from active to

sleep, and back. It allows neighboring nodes to be active at the same time, thus making packet

exchange feasible even when nodes operate with a low duty cycle (i.e., they sleep for most of thetime).

Duty-cycling schemes are typically oblivious to data that are sampled by sensor nodes. Hence,

data-driven approaches can be used to improve the energy efficiency even more. In fact, datasensing impacts on sensor nodes energy consumption in two ways:

1. Unneeded samples: Sampled data generally has strong spatial and/or temporal correlation

[22], so there is no need to communicate the redundant information to the sink.

2. Power consumption of the sensing subsystem: Reducing communication is not enough when

the sensor itself is power hungry.

The second issue arises whenever the consumption of the sensing subsystem is not negligible.

Data driven techniques presented in the following are designed to reduce the amount of sampled

data by keeping the sensing accuracy within an acceptable level for the application.

Ordinary nodes wait for the passage of the mobile device and route messages towards it, so thatthe communications take place in proximity (directly or at most with a limited multi-hop

traversal). As a consequence, ordinary nodes can save energy because path length, contention

and forwarding overheads are reduced as well. In addition, the mobile device can visit the

network in order to spread more uniformly the energy consumption due to communications.

When the cost of mobilizing sensor nodes is prohibitive, the usual approach is to attach sensor

nodes to entities that will be roaming in the sensing field anyway, such as buses or animals.

1.2.2.1 In-Network Aggregation

In-network aggregation deals with this distributed processing of data within the network. In this

scheme, the sensor networks is divided into pre-defined set of regions .each region is responsiblefor sensing and reporting events that occurs inside the region to the sink node .In a typical sensor

network scenario, different node collect data from the environment and then send it to some

central node or sink which analyze and process the data and then send it to the application. But


27/87

in-Network data aggregation s, data produced by different node can be jointly processed while

being forwarded to the sink node.

"In-network aggregation is the global process of gathering and routing information through a

multi-hop network, processing data at intermediate nodes with the objective of reducing resource

consumption (in particular energy), there by increasing network lifetime." In in-networkaggregation, the sensor with the most critical information aggregates the data packets and sends

the fused data to the sink. Each sensor transmits its signal strength to its neighbours. If the

neighbour has higher signal strength, the sender stops transmitting packets. After receivingpackets from all the neighbours, the node that has the highest signal strength becomes the data

aggregator. The in-network aggregation scheme is best suited for environments where events are

highly localized.

There are two approaches for in-network aggregation: with size reduction and without size

reduction. In-network aggregation with size reduction refers to the process of combining and

compressing the data packets received by a node from its neighbours in order to reduce the

packet length to be transmitted or forwardedtowards sink. As an example, consider the situationwhen a node receives twopackets which have a spatial correlated data. In this case it is worthless

to sendboth packets. Instead of that one should apply any function like AVG, MAX,and MINand then send a single packet.

This approach considerably reduces the amount of bits transmitted in the network and thussaving a lot of energy but on the other hand, it also reduces the precision of value of data

received. In-network aggregation without size reduction refers to the process merging data

packets received from different neighbours in to a single data packet but without processing the

value of data. As an example, two packets may contain different physical quantities (liketemperature and humidity) and they can be merged in to a single packet by keeping both values

intact but keeping a single header. This approach preserves the value of data and thus transmitmore bits in the network but still reduce the overhead by keeping single header.

This of the two approaches to use depends on many factors like the type of application, data rate,

network characteristics and so on. There is also a trade-of between energy consumption andprecision of data for the two approaches.


28/87

Fig 5. In-Network Architecture

An in-network data aggregation scheme, the numbers indicate the signal strengths detected bythe sensors. The arrows indicate the exchange of signal strengths between neighbouring nodes.

1.2.2.2 Grid-Based Data Aggregation

Vaidhyanathan et al. [23] have proposed grid base data-aggregation schemes which are based on

dividing the region monitored by a sensor network into several grids. In grid-based data

aggregation, a set of sensors is assigned as data aggregators in fixed regions of the sensornetwork. The sensors in a particular grid transmit the data directly to the data aggregator of that

grid. Hence, the sensors within a grid do not communicate with each other.

In grid-based data aggregation, the data aggregator is fixed in each grid and it aggregates the datafrom all the sensors within the grid. This is similar to cluster-based data aggregation in which the

cluster heads are fixed. Grid based data aggregation is suitable for mobile environments such as

military surveillance and weather forecasting and adapts to dynamic changes in the network andevent mobility. Figure 6 An grid base data aggregation scheme.

Sink

In-NetworkAggregator


29/87

Fig: 6 Grid base data aggregation

The arrows indicate the transmission of data from sensors to the grid aggregator.

A typical Grid-base data aggregation scheme is Fig 6 shows that in grid- based data aggregation;all sensors directly transmit data to a predetermined grid aggregator. After collecting all data

from other sensors, then aggregator sends only the critical information to the sink nodes. Thusgrid-base scheme reduce the traffic in mobile environment and make sure the critical istransmitted to the sink. However grid-base scheme not perform well where events are highly

localized and mostly immobile in nature.

1.2.2.3 Tree-Based Approach

The simplest way to routing data is to organize the nodes in a hierarchical manner and then select

some nodes as the aggregation point or aggregators. The tree based approach perform

aggregation by constructing an aggregation tree, which could be a minimum spanning tree,

rooted at sink and source nodes are considered as leaves. Each node has a parent node to forward

its data. Flow of data starts from leaves nodes up to the sink and therein the aggregation done byparent nodes. The way this approach operates has some drawbacks. As we know like any

wireless network the wireless sensor networks are also not free from failures. In case of packetloss at any level of tree, the data will be lost not only for a single level but for whole related sub-

tree as well. In spite of high cost for maintaining tree structure in dynamic networks and scarce

robustness of the system, this approach is very much suitable for designing optimal aggregationtechnique and energy-efficient techniques.

sink

GridA re ator


30/87

A data-centric protocol which is based on aggregation tress, known as Tiny Aggregation (TAG)

approach. TAG works in two phases: distribution phase and collection phase. In distribution

phase, TAG organizes nodes in to a routing tree rooted at sink. The tree formation starts withbroadcasting a message from sink specify level or distance from root. When a node receive this

message it sets its own level to be the level of message plus one and elect parent as node from

which it receives the message. After that, node re- broadcast this message with its own level.This process continues until all nodes elect their parent. After tree formation, sink send queriesalong structure to all nodes in the network.

TAG uses database query language (SQL) for selection and aggregation functions. In collection

phase, data is forwarded and aggregated from leaves nodes to root. A parent node has to wait for

data from its entire child node before it can send its aggregate up the tree. Apart from the simple

aggregation function provided by SQL (eg: COUNT, MIN, MAX, SUM, and AVG), TAG alsopartitions aggregates according to the duplicate sensitivity, exemplary and summary, and

monotonic properties. Though TAG periodically refresh tree structure of network but as most of

the tree-based schemes are inefficient for dynamic network.

A reactive data-centric protocol for applications where sink ask some specific information by

flooding, known as directed diffusion paradigm. The main idea behind directed diffusionparadigm is to combine data coming from different source and en-route them by eliminating

redundancy, minimizing the number of data transmission; thus maximizing network lifetime.

Directed diffusion consists of several elements: interests, data messages, gradients, and

reinforcements. Figure 7 An tree-base data routing scheme.

Fig : 7 Tree-base data Routing Architecture

Fig 7 Simplified schematic for directed diffusion. (a) Interest propagation.

(b) Initial gradients setup. (c) Data delivery along reinforced path [3].

The base station (BS) requests data by broadcasting an interest message which contains adescription of a sensing task. This interest message propagates through the network hop-by-hopand each node also broadcast interest message to its neighbour. As interest message propagates

throughout the network, gradients are set up by every node within the network. The gradient

direction is set toward the neighbouring node from which the interest is received. This process


31/87

continues until gradients are setup from source node to base station. Loops are not checked at

this stage but removed at later stage. After this path of information flow are formed and then best

path are reinforced to prevent further flooding according to a local rule.

Data aggregation took place on the way of different paths from different sources to base station

or sink. The base station periodically refresh and resend the interest message as soon as it start toreceives data from sources to provide reliability. The problem with directed diffusion is that it

may not be applied to applications (e.g. environmental monitoring) that require continuous data

delivery to base station. This is because query driven on demand data model may not help in thisregard. Also matching data to queries might require some extra overhead at the sensor nodes.

Mobility of sink nodes can also degrade the performance as path from sources to sinks cannot be

updated until next interest message is flooded throughout the network. To cope up with above

issue if introduce frequent flooding then also too much overhead of bandwidth and battery powerwill be introduced.

Furthermore, exploratory data follow all possible paths in the network following gradients which

lead to unnecessary communications overhead.

Some assumption have been made, they are:

(1)All source nodes maintain routes to mobile sink node.(2)No periodically messaging for topological changes due to mobile sink node(3)All links are bi-directional and no control messages are lost.(4)mobile sink nodes have unlimited battery power, so no need to care about battery efficiency

of sink node(5)Network partitioning is not considered. Data dissemination process

An energy-aware spanning tree algorithm for data aggregation, referred as E-Span. E-Span is adistributed protocol in which source node that has highest residual energy is chosen as root.Other source nodes choose their parent based on residual energy and distance to the root. The

protocol uses configuration message to exchange information of node i.e., residual energy and

distance to the root. Each node performs single-hop broadcast operation to send packets. Single-hop broadcast refers to the operation of sending a packet to all single-hop neighbours.

Fig: 8 E-Span Protocol Architecture


32/87

1.2.2.4 Cluster-Based Approach

We discussed about hierarchical organization of the network in tree-based approach. Another

scheme to organize the network in hierarchical manner is cluster-based approach. In cluster-

based approach, whole network is divided in to several clusters. Each cluster has a cluster-head

which is selected among cluster members. Cluster-heads do the role of aggregator whichaggregate data received from cluster members locally and then transmit the result to sink. The

advantages and disadvantages of the cluster-based approaches is very much similar to tree-based

approaches.

A maximum lifetime data aggregation (MLDA) algorithm which finds data gathering scheduleprovided location of sensors and base-station, data packet size, and energy of each sensor. A data

gathering schedule specifies how data packet are collected from sensors and transmitted to base

station for each round. A schedule can be thought of as a collection of aggregation trees. In, they

proposed heuristic-greedy clustering-based MLDA based on MLDA algorithm. In this theypartitioned the network in to cluster and referred each cluster as super-sensor. They then

compute maximum lifetime schedule for the super-sensors and then use this schedule toconstruct aggregation trees for the sensors.

In present, a two-phase clustering (TPC) scheme. Phase I of this scheme creates clusters with a

cluster-head and each node within that cluster form a direct link with cluster-head. Phase I of thisscheme is similar to various scheme used for clustering but differ in one way that the cluster-

head rotation is localized and is done based on the remaining energy level of the sensor nodes

which minimize time variance of sensors and this lead to energy saving from unnecessary

cluster-head rotation. In phase II, each node within the cluster searches for a neighbour closerthan cluster-head which is called data relay point and setup up a data relay link. Now the sensor

nodes within a cluster either use direct link or data relay link to send their data to cluster head

which is an energy efficient scheme. The data relay point aggregates data at forwarding time toanother data relay point or cluster-head. In case of high network density, TPC phase II will setup

unnecessary data relay link between neighbours as closely deployed sensor will sense same data

and this lead to a waste of energy.


33/87

Fig: 9 Illustration of twophase clustering

1.2.3 Clustering in WSN

It is widely accepted that the energy consumed in one bit of data transfer can be used to perform

a large number of arithmetic operations in the sensor processor. Moreover in a densely deployed

sensor network the physical environment would produce very similar data in near-by sensor

nodes and transmitting such data is more or less redundant.

Therefore, all these facts encourage using some kind of grouping of nodes such that data from

sensor nodes of a group can be combined or compressed together in an intelligent way and

transmit only compact data. This can not only reduce the global data to be transmitted and

localized most traffic to within each individual group, but reduces the traffic and hence

contention in a wireless sensor network. This process of grouping of sensor nodes in a denselydeployed large-scale sensor network is known as clustering. The intelligent way to combined and

compress the data belonging to a single cluster is known as data aggregation.

There are some issues involved with the process of clustering in a wireless sensor network. First

issue is, how many clusters should be formed that could optimize some performance parameter.

Second could be how many nodes should be taken in to a single cluster. Third important issue is


34/87

the selection procedure of cluster-head in a cluster. Another issue that has been focused in many

research papers is to introduce heterogeneity in the network. It means that user can put some

more powerful nodes, in terms of energy, in the network which can act as a cluster-head and

other simple node work as cluster-member only. Considering the above issues, many protocols

have been proposed which deals with each individual issue.

1.2.4 Obstacles of Sensor Security

Limited Resources

> Limited Memory and Storage Space: A sensor is a tiny devicewith only a small amount ofmemory and storage space for the code.

> Power Limitation: Energy is the biggest constraint to wireless sensor capabilities.

We assume that once sensor nodes are deployed in a sensor network, they cannot be easilyreplaced (high operating cost) or recharged (high cost of sensors).

Unreliable Communication: Normally the packet-based routing of the sensor network is

connectionless and thus inherently unreliable. Packets may get damaged due to channel errors ordropped at highly congested nodes. The result is lost or missing packets.

1.2.5 Security Requirements

A sensor network has some exclusive requirements:

Data Confidentiality: In many applications nodes communicate highly sensitive data,e.g., key distribution; therefore it is extremely important to build a secureCommunication channel in a wireless sensor network [10]. The adversary can change the

data, so as to send the sensor network into disarray. For example, a malicious node may

add some fragments or manipulate the data within a packet.

Data Freshness: Data freshness suggests that the data is recent, and it ensures that no oldmessages have been replayed. This requirement is especially important when there are

shared-key strategies employed in the design.

Self-Organization: A wireless sensor network is a typically an ad hoc network, whichrequires every sensor node be independent and flexible enough to be self-organizing and

self-healing according to different situations.

Time Synchronization: sensors may wish to compute the end-to end delay of a packet asit travels between two pair wise sensors. A more collaborative sensor network may

require group synchronization for tracking applications, etc.

Secure Localization: A sensor network will rely on its ability to accurately andautomatically locate each sensor in the network. A sensor network designed to locate

faults will need accurate location information in order to pinpoint the location of a fault.

For large sensor networks, the SPINE (Secure Positioning for sensor Networks)algorithm is used. It is a three phase algorithm based upon verifiable multilateration.


35/87

Authentication: Data authentication allows a receiver to verify that the data really issent by the claimed sender. In the case of two-party communication, data authentication

can be achieved through a purely symmetric mechanism: the sender and the receiver

share a secret key to compute the message authentication code (MAC) of allcommunicated data.

1.2.6 Attacks on WSNs

Denial of Service Attack: "Any event that diminishes or eliminates a network's capacity toperform its expected function".

Jamming:To jam a node or set of nodes, in this case, is simply the transmission of a radiosignal that interferes with the radio frequencies being used by the sensor network.

The Sybil Attack: Sybil attack is defined as a "malicious device illegitimately taking onmultiple identities". It was originally described as an attack able to defeat the redundancy

mechanisms of distributed data storage systems in peer-to-peer networks. In addition to defeatingdistributed data storage systems, the Sybil attack is also effective against routing algorithms, data

aggregation, voting, fair resource allocation and foiling misbehaviour detection. For instance, ina sensor network voting scheme, the Sybil attack might utilize multiple identities to generate

additional "votes."

Node Replication Attacks:An attacker seeks to add a node to an existing sensor network by

copying (replicating) the node ID of an existing sensor node. A node replicated in this fashioncan severely disrupt a sensor network's performance; packets can be corrupted or even

misrouted. This can result in a disconnected network, false sensor readings, etc.

Attacks against Privacy: Monitor and eavesdropping: By listening to the data, the adversarycould easily discover the communication contents. When the traffic conveys the control

information about the sensor network configuration, which contains potentially more detailed

information than accessible through the location server, the eavesdropping can act effectivelyagainst the privacy protection.

State of Art

In a typical scenario, users can retrieve information of interest from a WSN by injecting queries

and gathering results from the base stations or sink nodes, which behave as an interface between

users and the network. In this way, WSNs can be considered as a distributed database. The

sensor networks will ultimately be connected to the Internet, through which global informationsharing becomes feasible.Sensor device or wireless nodes are also sometimes called as motes. In some cases it is

challenging to collect [extract] data from WNs because connectivity to and from the WNs may

be intermittent due to low-battery status [eg., if these are dependent on sunlight to recharge] orother WN malfunction.


36/87

The key limitations of wireless sensor networks are the storage, power and processing. These

limitations and the specific architecture of sensor nodes call for energy efficient and secure

communication protocols.

Energy efficient wireless communication systems are being sought and are typical of WSNs.

Low power computation is a key factor in ensuring long operating horizons for non-power-fedsystems.

Power efficiency in WSNs is generally accomplished in three ways-

Low-duty-cycle operation

Local / in- network processing to reduce data volume

Multi-hop networking reduces the requirement for long-range transmission.

The typical mode of communication in wireless sensor network is from multiple data sources to

a data recipient or sinks rather than communication between a pair of nodes.

Thesis Outline

In this thesis we propose an energy-efficient secure routing for wireless networks based on

symmetric key cryptography. The proposed crypto system is session based and the session key is

changed after the expire of each session. We divide the network into number of clusters and

select a cluster head within each cluster. Communication between sensor and the sink takes place

at the three level; sensor>cluster-head >sink.

Encryption of the sensed data is transmitted to the cluster head, which aggregated the datareceived from the sensor nodes of its cluster before forwarding to the next cluster head on the

path or to the sink . Sensors do not participate in the routing scheme; their energy is conserved at

each sensor node.

We have organized the thesis into 6 chapters which include Introduction; Background

Information; Literature Review; Problem Statement and objectives; Requirement analysis/Background of work; Experimental Analysis and Results and finally Conclusion and Future

Scope.

Chapter 1 describes Wireless Sensor Network in general in terms of motivation and then

follows by state of art and finally the whole thesis outline.

Chapter 2, we discuss the background information relating to WSN and its strength and

weaknesses. We study the description of protocol modes and working, structure of various

packets being transferred; procedures followed by the nodes in the particular modes. This chapteroutlines the literature survey. A literature survey condenses, translates, and basically assesses

existing "literature" (or distributed material) keeping in mind the end goal to make current

learning of a subject. The reason for doing so identifies with continuous exploration to create that


37/87

information: the writing survey may resolve a controversy, make the requirement for extra

research, and/or characterize a point of inquiry.

Chapter 3 discusses the problem statement and tasks. This chapter looks into the problem

statement and objective of thesis. In the chapter we will discuss about background details and

how I have came to select a particular problem. And, the methodologies used by the researchersare also listed in this chapter with the brief introduction and hardware & software specifications.

Chapter 4discusses the installation of tools and the simulation environment. In this chapter weinclude the design specification with the methodologies used to perform research work. In this

part, I clarify the procedure and result approach that have chosen for the focused on issue and

how it will be determined. Detail explanation of hardware and software platform is also

mentioned in this chapter.

Chapter 5 describes the results, evaluates the performance, and analysis. An evaluation of

selected approach and final result has been discussed in this chapter. The whole process of

evaluation including its all steps has been described in detail to reach the objective of this study.The select procedure and its after effects and benefits all are explained which will be quite

efficient for detecting malware. Thus the whole summary of all discussion and its result has beenincluded in this section.

Chapter 6summarizes the conclusions drawn in the thesis along with future research directions.


38/87

CHAPTER 2

LITERATURE REVIEW

Wireless Sensor Networks consists of individual nodes that are able to interact with theirenvironment by sensing or controlling physical parameter; these nodes have to collaborate in

order to fulfil their tasks as usually, a single node is incapable of doing so; and they use wireless

communication to enable this collaboration [1]. The definition of WSN, according to, Smart Dustprogram of DARPA is:

A sensor network is a deployment of massive numbers of small, inexpensive, self powereddevices that can sense, compute, and communicate with other devices for the purpose of

gathering local information to make global decisions about a physical environment [1].

WSNs are resource limited, they are deployed densely, they are prone to failures, the number of

nodes in WSNs is several orders higher than that of ad hoc networks, WSN network topology isconstantly changing, WSNs use broadcast communication mediums and finally sensor nodes

dont have a global identification tags.

Wireless sensor networks are quite different from general wireless networks due to variousconstraints and highly application specific nature of WSNs. Consequently, WSNs pose different

research challenges. In wireless communication system, the models for signal strength drop aver

a distance is well developed.

The size, power, cost and their tradeoffs are fundamental constraints in WSNs .Considering the

basic differences with the wireless communication systems, many issues have been identified

and investigated.

In this chapter a brief study of different issues and challenges and detection approaches whichhave been explored earlier are presented. At the end of the small survey lots of detection

techniques and other approaches discussed in various papers will be representing in a tabular

format. Also solution approaches are depicted in various surveys against few issues and

challenges that helped in choosing the path of the research and methodology to be used toacquire the desired objective.

The details of most related paper of our research work are given below.

Babli Kumari and Jyoti Shukla have proposed a technique Detection Based Path HoppingTechnique to protect the data in WSN that will make data transmission more secure from theattackers.This technique is used to make WSN more secure from intruders and attacks.The

packet delivery ratio in this technique is more than the original path hopping technique.It secures

the network more than the existing path hopping technique.

I.F.Akyildiz, W.Su*, Y.Sankarasubramaniam, E. Cayirci , proposed a survey called WirelessSensor Network :A Survey [2].In this research paper the sensor network applications are


39/87

explored, and a review of factors influencing the design of sensor network is provided.

Realization of sensor networks needs to satisfy the constraints introduced by factors such as fault

tolerance, scalability, cost, hardware, topology change, environment and power consumption.Theproblems and more development in solutions to the open research issues are described in this

paper.

Aashima Singla and Ratika Sachdeva make a review on the Security Issues and Attacks in

Wireless Sensor Networks. This paper describes the security issues on many attacks that are to

be protected.As the sensor sensor nodes are highly distributed, there is a need of security in thenetwork. It elaborates the characteristics of WSNs and its types, security issues and various

attacks on different layers, dimensions of security that are being directed by different physical

attack.

Chonggun Kim, Elmurod Talipov and Byoungchul Ahn have proposed a technique A Reverse

AODV Routing Protocol in Ad Hoc Mobile Network. It describes the successful delivery of

RREP messages which are important in on-demand routing protocols for ad-hoc networks.R-

AODV route discovery succeeds in fewer tries and it improves the performance of AODV.

Jamal N. Al-Karaki and Ahmed E.Kamal had done a survey on Routing Techniques in Wireless

Sensor Networks. In this survey, they present the state-of-art routing techniques in WSNs. It

describes the design challenges for routing protocols in WSNs followed by a comprehensivesurvey of different routing techniques, the design tradeoffs between energy and communication

overheads saving in every routing paradigm. It also highlights the advantages and performance

issues of each routing technique.

Chee-Yee Chong, Member, Ieee And Srikanta P. Kumar have find out the opportunities,

challenges and evolution of sensor networks.This paper traces the history of research in sensornetworks over the past three decades, including two important programs of the DefenseAdvanced Research Projects Agency (DARPA) spanning this period: the Distributed Sensor

Networks (DSN) and the Sensor Information Technology ( Sens IT) programs. Technology

trends that impact the development of sensor networks are reviewed, and new applications suchas infrastructure security, habitat monitoring, and traffic control are presented. Technical

challenges in sensor network development include network discovery, control and routing,

collaborative signal and information processing, tasking and querying, and security. The paperconcludes by presenting some recent research results in sensor network algorithms, including

localized algorithms and directed diffusion, distributed tracking in wireless ad hoc networks, and

distributed classification using local agents.

Jan Steffan, Ludger Fiege, Mariano Cilia, Alejandro Buchmann introduced the scoping in

wireless sensor networks. In this paper we proposed that the WSN middleware focuses on very

high-level system abstractions, such as declarativequery languages, and acts as black box thattries to automaticallymap applications to the underlying resources. We propose scopes as a

generic abstraction for the definition of groups of nodes. They bridge the gap between high- and

low-level interfaces and enable the partitioning of WSN functionality. As middleware buildingblock they facilitate the construction of tailored services in multipurpose WSNs.


40/87

Shio Kumar Singh, M P Singh , and D K Singh had done a survey on Routing protocols in

wireless sensor networks. In this paper, we have surveyed a sample of routing protocols by

taking into account several classification criteria, including location information, networklayering and in-network processing, data centricity, path redundancy, network dynamics, QoS

requirements, and network heterogeneity. For each of these categories, we have discussed a few

example protocols. Two important related research directions should receive attention from theresearcher namely the design of routing protocols for duty-cycled WSNs, and three-dimensional(3D) sensor fields when designing such protocols.

Hiren Kumar Deva Sharma and and Avijit Kar introduced Security Threats in Wireless Sensor

Networks. In this paper they have studied different key issues in achieving security in WSN. We

have also studied different threats existing in different layers of the protocol stack of WSN.

Possible solutions against different threats have also been outlined. T'his work was undertaken

by the authors and is in progress regarding the design of a security framework for wireless sensor

networks. The mathematical modeling of different threats present in the WSN is another aspect

of this work.

Chris Karlof , David Wagner introduced Secure routing in wireless sensor networks: attacks and

countermeasures. In this paper the researchers have proposed security goals for routing in sensornetworks, show how attacks against ad-hoc and peer-to-peer networks can be adapted into

powerful attacks against sensor networks, introduce two classes of novel attacks against sensor

networkssinkholes and HELLO floods, and analyze the security of all the major sensor

network routing protocols. We describe crippling attacks against all of them and suggestcountermeasures and design considerations.

XIAOJIANG DU, HSIAO-HWA CHEN introduced Security in wireless sensor networks. In thisarticle we survey the state of the art in research on sensor network security. In this article, we

summarize typical attacks on sensor networks and surveyed the literatures on several importantsecurity issues relevant to the sensor networks, including key management, secure timesynchronization, secure location discovery, and secure routing.

Vinod Kumar Jatav, Meenakshi Tripathi, M S Gaur and Vijay Laxmi introduced the attacks andmodels in wireless sensor networks. This paper presents a mechanism to launch sinkhole attack

based attacks such as selective forwarding and balckhole attack in wireless sensor networks. The

proposed work includes detection and countermeasure rules to make the sensor network securefrom these attacks.

Basil Etefia proposed the Routing Protocol in Wireless Sensor Network, this paper presents animprovement on the implementation of information routing capabilities in ad hoc wireless sensor

networks. Improving the protocols used by each sensor node can increase the networks

localization and power conservation abilities.Using a more efficient algorithm will improve the

overall effectiveness of the entire network in terms of power efficiency.

YONG WANG, GARHAN ATTEBURY, AND BYRAV RAMAMURTHY have done a surveyof security issues in wireless sensor networks.In this article we present a survey of security issues

in WSNs. First we outline the constraints, security requirements, and attacks with their


41/87

corresponding countermeasures in WSNs. We then present a holistic view of security issues.

These issues are classified into five categories: cryptography, key management, secure routing,

secure data aggregation, and intrusion detection.

Rachid Haboub and Mohammed Ouzzif includes the secure routing in wireless sensor networks.

In this paper the author has described about the need for security mechanisms aware of thesensor challenges (low energy, computational resources, memory, etc.). Thus, this work aims to

provide a secure WSN by changing the frequency of data transmission. This security approach

was tested, and the results shows an interesting decreased of throughput from malicious nodewhen the number of frequency used is increased, that way the WSN will not waste its resources

treating malicious packets.

Abolfazl Akbari, Mehdi soruri and Ali Khosrozadeh introduced a technique of A New AODV

Routing Protocol in Mobile Adhoc Networks. In this paper, they proposed a new route

maintenance algorithm to avoid route breaks because each intermediate node on an active route

detects a danger of a link break to an upstream node and reestablishes a new route before a route

break. We propose this algorithm based on AODV (Ad-hoc On-demand Distance Vector routingprotocol).

Jinfang Jiang, Guangjie Han, Chuan Zhu, Yuhui Dong, Na Zhang done a survey on Secure

Localization in Wireless Sensor Networks: A Survey. In this survey, Secure localization of

unknown nodes in a Wireless Sensor Network (WSN) is an important research subject. WhenWSNs are deployed in hostile environments, many attacks happen, e.g., wormhole, sinkhole and

sybil attacks. Two issues about unknown nodes secure localization need to be considered. First ,

the attackers may disguise as or attack the unknown and anchor nodes to interfere with

localization process. Second, the attackers may forge, modify or replay localization informationto make the estimated positions incorrect. Currently, researchers have proposed many

techniques, e.g., SeRLoc, HiRLoc and ROPE, to solve the two issues.

Rijin I.K, Dr.N.K.Sakthivel, Dr.S.Subasree,introduced the Development of an EnhancedEfficient Secured Multi-Hop Routing Technique for Wireless Sensor Networks. An efficient

secured multi-hop routing technique for wireless sensornetworks (ES-MHRT) was proposedrecently, which was a two contemporary hybrid Multi-Hop Routing Techniques, namely, Flat

Multi- Hop Routing Technique and Hierarchical Multi-Hop Routing Technique for providing

trustworthy and efficient routing in WS networks. It demonstrates the effective performance interms of Network Lifetime and superior connectivity. However, from the literature survey, it is

observed that in ES-MHRT the sender understand the status of delivery report from receiver

only, which costs more time to understand the reliable route. Thus Sender couldnt forward the

data in fast manner, which affects the Network Performance in terms of Throughput and Bandwidth Utilization. This is the major issue. To address this issue, this project work is planned

to design an efficient Distributed Monitoring System, which will help the ES-MHRT to push

more volume of Data with Secured Route.

Ioannis Krontiris, Tassos Dimitriou, Thanassis Giannetsos, and Marios Mpasoukos, proposed

Intrusion Detection of Sinkhole Attacks in Wireless Sensor Networks. In this paper, we presentan Intrusion Detection System designed for wireless sensor networks and show how it can be


42/87

configured to detect Sinkhole attacks. A Sinkhole attack forms a serious threat to sensor

networks.

Ioannis Krontiris, Thanassis Giannetsos, Tassos Dimitriou, launched a Sinkhole Attack in

Wireless Sensor Networks; the Intruder Side. In this paper we investigate in depth one of the

most severe attacks against sensor networks, namely the sinkhole attack, and we emphasize onstrategies that an attacker can follow to successfully launch such an attack. Then we propose

specific detection rules that can make legitimate nodes become aware of the threat, while the

attack is still taking place. Finally, we demonstrate the attack and present some implementationdetails that emphasize the little effort that an attacker would need to put in order to break into a

realistic sensor network.

Vinay Soni, Pratik Modi, Vishvash Chaudhri, Detecting Sinkhole Attack in Wireless Sensor

Network.In this paper the authors proposed that There are many possible attacks on sensor

network such as selective forwarding, jamming, sinkhole, wormhole, Sybil and hello flood

attacks. Sinkhole attack is among the most destructive routing attacks for these networks. It may

cause the intruder to lure all or most of the data flow that has to be captured at the base station.Once sinkhole attack has been implemented and the adversary node has started to work as

network member in the data routing, it can apply some more threats such as black hole or grayhole. Ultimately this drop of some important data packets can disrupt the sensor networks

completely. We have presented some countermeasures against the sinkhole attack.

Shrawan Kumar Trivedi, Rajat Kumar Singh, proposed the Enhancement of energy efficiency in

heterogeneous wireless sensor network using multi-hop transmission technique. A wireless

sensor network consists of hundreds of sensor nodes in a wide field. Due to the limited energy

capability of these sensor nodes, it is known as an energy constrained network and hence thelifetime of this network is limited. So, our primary concern is to save this energy in order to

increase the lifetime. The efficient way to reach this goal is to use clustering approach. Earlierresearch was done on the homogeneous network model which means all nodes have sameamount of energy. But practically, the network is not a pure homogeneous network, some

heterogeneity still present on it. In our model, we are using heterogeneous network, and applying

multi-hop transmission technique instead of direct transmission. The concept of heterogeneity incorrelation with the multi-hop routing technique will enhance the lifetime of the sensor network.

For validation, we have compared our results with already published results.

Tejinderdeep Singh, Harpreet Kaur Arora, Detection and Correction of Sinkhole Attack with

Novel Method in WSN Using NS2 Tool.WSNs suffer from many constraints, including low

computation capability, small memory, limited energy resources, susceptibility to physical

capture, and the use of insecure wireless communication channels. These constraints makesecurity in WSNs a challenge. In this article we discuss security issues in WSNs. In this paper

we are discussing a vulnerable sinkhole attack, its implementation and correction.

M. Yasir Malik, Draw An Outline of Security in Wireless Sensor Networks: Threats,

Countermeasures and Implementations. In this chapter, we will provide the basics of

information security with special emphasis on WSNs. The chapter will also give an overview of


43/87

the information security requirements in these networks. Threats to the security of data in WSNs

and some of their counter measures are also presented.

Giuseppe Anastasi , Marco Conti, Mario Di Francesco, Andrea Passarella, introduced the Energy

Conservation in Wireless Sensor Networks: a Survey.The authors present a systematic and

comprehensive taxonomy of the energy conservation schemes, which are subsequently discussedin depth. Special attention has been devoted to promising solutions which have not yet obtained awide attention in the literature, such as techniques for energy efficient data acquisition. Finally

we conclude the paper with insights for research directions about energy conservation in WSNs.

2.1 Review Process Adopted

Babli Kumari and Jyoti Shukla have proposed a technique Detection Based Path Hopping

Technique to protect the data in WSN that will make data transmission more secure from the

attackers. This technique is used to make WSN more secure from intruders and attacks. Thepacket delivery ratio in this technique is more than the original path hopping technique. It

secures the network more than the existing path hopping technique. In this technique we willimprove the energy efficiency of the sensor network.

Energy consumption in a sensor node could be due to either useful or wasteful sources.

Useful energy consumption can be due to transmitting or receiving data, processing queryrequests, and forwarding queries and data to neighboring nodes.


44/87

Table 2 . Protocols with their classifications.

2.2 Categorical Review Secure Routing in Wireless Sensor Network:Energy Efficiency

Table 3. Attacks , security schemes, and routing protocol used

Attacks Network

Architechture

Layers Security

Schemes

Protocols

Spoofed

altered,Replayedrouting

information

Traditional

Wireless SensorNetwork

Physical layer On

communicationsecurity

Hierarchical

Selective

Forwarding

Traditional

Wireless SensorNetwork

Physical layer Packet Sequence Hierarchical,

location

based, network

flow

Sinkhole attack Traditional

wireless

sensor network

Physical layer Unique key to

initialize

frequency

Flat based,

hierarchical,

network flow


45/87

hopping and Qos

aware

Sybil attack Traditional

wireless

sensor network

Network Layer Strong

authentication

mechanism,

Radio resource

Testing, Random

key

distributio

Flat based,

hierarchical,

location based

Wormhole attack Traditional

wireless

sensor network

Network Layer Clock

Synchronization

and

accurate location

verification

and TIK

Flat based,

hierarchical,

location based,

Network flowand Qos

Aware

Acknowledgement

Documents

DISSERTATION_heena.docx