Detection of Malicious Node Using Optimization Techniques · 2018-09-01 · Fig. 1 : Wireless...

Detection of Malicious Node Using Optimization

Techniques 1S. Sijo,

2G.Vignesh Raj,

3*S. Sridevi and

4S. Geofrin Shirly

1Department of Computer Science and Engineering,

Vels Institute of Science,

Technology and Advanced Studies,

Chennai. 2Department of Computer Science and Engineering,



Chennai. 3*

Department of Computer Science and Engineering,



Chennai.

[email protected] 4Department of Computer Science and Engineering,



Chennai.

Abstract Deployed in a antagonistic surroundings, character nodes of a wireless

sensor network (WSN) may be without difficulty compromised by way of

the adversary because of the constraints along with constrained battery

lifetime, reminiscence area and computing capability. It's far vital to

stumble on and isolate the compromised nodes in order to avoid being

misled by way of the falsified statistics injected by using the adversary via

compromised nodes. However, it's far hard to secure the flat topology

networks efficaciously due to the terrible scalability and high conversation

overhead. On top of a hierarchical WSN architecture, in this paper we

proposed a singular scheme based totally on weighted- accept as true with

International Journal of Pure and Applied MathematicsVolume 119 No. 18 2018, 393-404ISSN: 1314-3395 (on-line version)url: http://www.acadpubl.eu/hub/Special Issue http://www.acadpubl.eu/hub/

393

evaluation to stumble on malicious nodes. The hierarchical community can

lessen the communication overhead among sensor nodes by utilizing

clustered topology. via intensive simulation, we demonstrated the

correctness and performance of our detection scheme.

Key Words:WSN, malicious nodes, cluster.

International Journal of Pure and Applied Mathematics Special Issue

394

1. Introduction

Wireless Sensor Networks (WSNs) present precise possibilities for a extensive

spectrum of applications including :-

Industrial automation

scenario awareness

Tactical surveillance for army applications

Environmental tracking

Chemical or biological detection etc.,

WSNs encompass masses of tiny nodes having the functionality of sensing,

computation and wireless communications shown in fig 1.

Fig. 1: Wireless Sensor Network

2. Security Attacks in Wireless Sensor Networks

In wireless sensor networks different layers involve different type of attacks. In

the software layer subversion and malicious nodes are the possible types of

attecks. This can be overcome by Malicious node detection and isolation

techniques. Wormhole attack, Sybil attack, Sinkhole attack are the attacks

encountered in Network layer.

This can be analysed by Key management and secure Routing techniques. Dos

attack can be encountered in physical Layer. Counter measure is seize counter

measure is Adaptive antennas, unfold Spectrum.

Physical Attacks

A Physical could be a attack earnings to urge admission to the hardware device.

This makes a issue of assault effects possible: the

assailant will completely destroyed the device nodes.

The attacks get right of access to furthermore permits him to urge admission to

a node parts with none software package layer concerned. This is often in

analysis to a way off assault, during which the attacked laptop is accessed

via many protocol or software package layer, that offers it the chance (as a


395

minimum, in principle) to find the assault and react as a stop conclusion.

During a bodily assault, this kind of “self-surveillance” is not on the market to

the device below assault and will simplest be potential via further measures,

together with out of doors police work. This makes bodily assaults as a

substitute powerful. They have got a number of potential blessings over ways

flung attacks. On portable computer systems, records could also be saved in

encrypted kind as properly, but this is often evaded because of usability

and accessibility problems. Consequently, physical get right of entry to

a laptop device usually yields whole get right of entry to the keep facts

herein, put together with the practicality for manipulations.

It can be gathered in some unspecified time in the future of an attack, which

isn't always possible with a long manner off attacks. bodily evidence want to

manual non-decent attribution of statistics to someone or enterprise, thereby to

facilitate extortion.

Interface Assaults

Interface assaults create the foremost vulnerabilities of the interfaces a

tool provides in order that you'll permit get right of get admission to

its terribly personal services or to induce correct of get entry to out of doors

offerings. They'll be expedited via the revealed nature of wi-fi communication

, and also the proven fact that get right of get entry to is while not

problem viable while not the threat of detection. An overview will

be determined. In Interface assaults what is more could also be performed

on the number of an organization API, as Associate in Nursing example those of

safety processors.

Software Attacks

The injection of code is an dangerous attack in AN execution atmosphere ,

because of the reality this produces probably full manage over this

surroundings. This type of attacks aren't uncommon with in the web

international, during which poorly administrated hosts are liable

to opposed AN prolonged manner off manage. one in every of the motives

for that's code quality i.e. code is usually downloaded from AN prolonged

method flung websites and domestically finished. Regardless of the reality that

mechanisms for code certification exist, those are frequently circumvented

through social engineering or client inattentiveness.

Protocol Relevant Attacks

Tiny Osbeacoining phony routing facts, selective forwarding, sink hole, Sybil,

wormholes, hi here floods. Directed diffusion and its multipath

version phony routing facts, selective forwarding, sinkholes, Sybil, wormholes,

hey floods. Geographic routing(GPSR, tools) phony routing info, selective

forwarding, Sybil, minimum worth forwarding phony routing facts, selective

forwarding, sink hollow wormholes, hey floods. clump based totally protocols

(LEACH, teenager, PEGASIS) selective forwarding selective forwarding sink

hole, wormholes, Sybil power holding topology protection (SPAN,GAF,CEC,


396

AFECA) phony routing statistics, Sybil, hey floods. safety protocols are secure

network enabling Protocol (SNEP) that provides confidentiality, authentication

and small regular inexperienced movement Loss (μ TESLA) offers

documented broadcast. comfortable network coding Protocol (SNEP).

3. Comparison Study of Malicious Node Detection based on Optimization Methods

In this comparison study we are dealing with two optimization methods they

are:-

ARTIFICIAL HONEYBEE

CUCKOO SEARCH

Artificial Honeybee

The artificial bee colony (ABC) set of suggestions is a modern-day swarm

intelligence set of regulations inspired through the behaviour of honey bees

shown in Fig.2

Fig. 2: Artificial Bee Colony Optimization

Artificial Bee Colony algorithm is a famous optimization algorithm. It is a

combination of particle swarm optimization and genetic algorithm. In this

algorithm simulates the foraging behaviour of the Honey Bee. The colony of

artificial bees includes three types of bees such as employed bee, onlooker bee

and scout bee. In general, the food size and onlooker bee size are equal. One

meal source is assigned to every employee bee. Onlooker bee chooses the food

source based on the dance of the bee. The new food sources are discovered by

the scout bees to replaces the abandoned food. Based on this concept, ABC

algorithm finding out optimal solution for finding out the route to reach the

destination.

Auto Regression Method

In wireless sensor network the malicious node is detected by auto regression


397

method. In this method the compromised node is detected based on the past

values of the sensor node. If the current value of the sensor node exceeds the

limit given by the auto regression method, it suspects the node may become

malicious node.

Data Aggregation Method

In this method each sensor sends the information to the aggregated node. This

node forwards this data to the base station. Based on the aggregate values

compromised node to be detected.

V-Detector

Ji et al. furnished a actual valued lousy desire set of regulations with variable

sized detectors, referred to as V-detector. Naive techniques have emerged as

used to robotically calculate the predicted insurance of the non-self vicinity

even as the detector set is generated. Prevention strategies, which encompass

relaxed and authenticated routing protocols , are usually taken into

consideration because the primary line of defence in competition to assaults.

but, these techniques do now not offer a complete answer for all attacks.

Niching Genetic Algorithm

Dasgupta et al. proposed a manner inspired via the awful selection set of

policies for intrusion detection in burdened out networks. It uses a niching

genetic set of rules (NGA) to generate a difficult and rapid of detectors to cowl

the non-self location. A hyper sphere is described spherical each self sample.

The uncooked health of a rule is calculated based totally mostly on the quantity

of its hyper rectangle and the quantity of self samples protected thru it.

Artificial Immune System Based on Negative Selection

Sarafijanovic et al. used an synthetic immune machine primarily based on

terrible choice, danger principle, and clonal choice for detecting malicious

nodes. In a few actual valued terrible preference algorithms, the variability of

self samples may result in the holes on the boundary the various self and non-

self areas. consequently, non-self samples in the ones regions can not be

detected.

Boundary Detectors

Wang et al. proposed an progressed detector technology set of regulations

primarily based totally on evolutionary are looking for to generate a selected

kind of detectors, known as boundary detectors. those detectors cowl the holes

at the boundary and function an possibility to find out non-self samples hidden

within the self space.

Anomaly Detection

They remember the trouble of anomaly detection as a hassle of supervised

studying from imbalanced records sets and use resampling strategies to stability

statistics gadgets. The technique first learns the styles of regular samples based

totally on a co-evolutionary genetic set of guidelines, that is stimulated from the


398

first-rate desire algorithm, and then generates synthetic anomalous samples

primarily based at the poor preference algorithm. each statistics sets are used for

getting to know a classifier. the number one issue of this technique is that it

imposes a sizable overhead for updating the boundary among normal and

anomalous samples and consequently isn't always appropriate for dynamic

anomaly detection.

Wireless Principal Component Analysis

Nakayama et al. proposed a dynamic anomaly detection technique, referred to

as WPCA, for AODV based totally MANETs that allows the profile of

everyday community behaviour to be up to date at unique time periods. It makes

use of the important issue assessment (PCA) to calculate the number one

precept trouble of everyday samples, which can be used as a profile of regular

network behaviour. The projection distance of new samples to this precept

difficulty is used for detecting routing assaults. the global covariance of

everyday samples is used to replace the profile at consecutive time durations.

the principle disadvantage of this method is that the global covariance is

calculated inaccurately.

Dynamic Clustering based Approach

Alikhany et al. proposed a dynamic clustering based method, called DCAD, for

anomaly detection in AODV based completely MANETs. It makes use of a

weighted regular width clustering set of rules to construct a profile of normal

community behaviour and to hit upon routing attacks. It furthermore uses a

forgetting equation to periodically update the profile. The experimental

consequences have confirmed that DCAD has a immoderate fake alarm charge.

Cuckoo’s Search Optimization

Fig. 3: Cuckoo Search

The various deployment usage of wireless sensor networks leads to an

multiplied issues which includes safety threat, lacks of the resource availability


399

and so forth. These troubles want to be resolved to be able to advantage an

advanced consciousness of researchers and customers to deploy the features of

WSN regularly. The most crucial assignment inside the WSN is records

transmission which can't be done securely and reliably because of unsuitable

route life. as a consequence the focal point at the better course discovery can

clear up these problems inside the optimized way. in the current work, consider

and energy aware Routing Protocol (TERP) is introduced for achieving the

secured and electricity concerned packet transmission which tries to select the

route in phrases agree with, power and hop count number of nearest nodes.But

this lacks in its performance in phrases of reliability due to no longer

considering the reliability element of nodes. And also present work attention on

most effective the status details of the modern-day node and not thinking about

the opposite nodes misbehaviour assaults which may cause the security

violation statistics corruption. These troubles are resolved in this work by means

of introducing the novel framework for the route status quo particularly

Reliability conscious power and consider based totally routing protocol

(RETRP). This technique focus improving the community overall performance

in terms of clustering the group of similar nodes for which optimized cluster

head might be decided on using the modified genetic algorithm. in order that

information transmission may be optimized based on cuckoo search shown in

fig.3 . on the time of course establishment, reliability of the nodes additionally

considered with the believe and power consumption aspect. in the proposed

research paintings, cuckoo seek set of rules is used for accept as true with and

reliability conscious course status quo. After course status quo, trojan horse

complete attacks are located the usage of predicted packet transmission matter

cost..

Trust Based Routing Protocol

To estimate the dependability of the sensor nodes in MANET the researcher

was carried out a dynamic trust prediction method. This technique is primarily

based at the chronological traits. The direct easy path is selected with the aid of

the usage of the accept as true with-based source Routing protocol (TSR) for the

switch of statistics packets. in this gift paintings, the analysis technique display

that this prediction method is improving the delivery ratio of the packet and

decreasing the average quit-end postpone.

Grade Trust Routing Protocol

To identify the black hollow assaults the researchers advocated a Grade accept

as true with routing protocol. The Grade accept as true with protocol improving

the packet transport ratio by means of compared to the prevailing protocols like

On-demand Distance Vector (AODV) and Fisheye state Routing (FSR)

protocol.

Optimized Link State Routing Protocol

The unwanted nodes were prohibited to calculate the direction with the

maximum route consider. For implementing a secure course, the radical


400

Optimized hyperlink state Routing Protocol (OLSR) became integrated. This

work has been completed in simulation manner and the outcome is proved that

the new FPNT-OLSR created most efficient packet transport ratio, overhead

values and the common latency than the prevailing OLSR technique. The path

with more number of depended on nodes turned into selected using the AODV

protocol.

Dynamic Source Routing

The brand new routing algorithm generating a better common give up to give up

put off, overhead, shipping ratio of the packet as compared to the prevailing

Watchdog-Dynamic source Routing (DSR) and QAODV. In the next phase

particular dialogue of the proposed studies framework is given with the clear

explanation and the desired instance state of affairs.

4. Conclusion

Wireless Sensor Networks in this degree of deployment are liable to attacks

which can be unfavourable sufficient to conquer easy safety parameters and

disrupt the configuration of system. With the realization of deployment locality,

the systems won't be handy for healing in case of intrusion, route gaps and

detection of malicious nodes. The request of reliable network influenced the

studies for development of autonomic computing for interacting with the

challenges at risk of sensor networks. Autonomic computing is the deterministic

technique in wireless sensor networks which powers the sensor nodes with

brainpower to deal with the assaults of undefined shape. The study of self-

computing is carried in 4 steps. The nodes located near the vacation spot factor

consumes excessive quantity of power in comparison to the final nodes. To

preserve the gadget efficiency the nodes are required to extend least and nearly

equal quantity of energy. The self-configuration scheme bifurcate the

community primarily based on nodes electricity. The node balancing approach

classifies the nodes with energy above threshold fee inside the high modulation

index and the nodes with power below threshold fee within the low modulation

index. To our surprise, the results for dynamic strength constraints were worse

than static constraints. The motive is due to the reality that dynamic constraints

are greater conservative than static ones and consequently more unused

electricity remains within the nodes after a path is "lost" because of strength-

outage in one or greater nodes.

References

[1] Roy Sandip et al., "Secure data aggregation in wireless sensor networks: Filtering out the attacker's impact", IEEE Transactions on Information Forensics and Security, vol. 9, no. 4, pp. 681-694, 2014.

[2] W Zhu, Y Xiang, J Zhou, "Secure localization with attack detection in wireless sensor networks", International Journal of Information Security, vol. 10, no. 3, pp. 155-171, 2011.


401

[3] I. S. Jacobs, C. P. Bean, G. T. Rado, H. Suhl, "Fine particles thin films and exchange anisotropy" in Magnetism, New York:Academic, vol. III, pp. 271-350, 1963.

[4] K.Pradeepa, WR Anne, S.Duraisamy, "Design and implementation issues of clustering in Wireless Sensor Networks", International Journal of Computer Applications, vol. 47, no. 11, pp. 23, 2012.

[5] T Kavitha, D.Sridharan, "Security vulnerabilities in Wireless Sensor Networks: A survey", Journal of Information Assurance and Security, vol. 5, pp. 31-44, 2010.

[6] C.Alcaraz, J Lopez, R Roman, "Selecting Key Management Schemes for Wireless Sensor Networks application", Journal of Computers and Security (Elsevier), vol. 31, no. 8, pp. 956-966, 2012.

[7] R Azarderskhsh, A Reyhani, "Secure clustering and symmetric key establishment in heterogeneous wireless sensor networks", Eurasip Journal on Wireless Communications and Networking Article ID: 893592, pp. 1-12, 2011.

[8] AC Chan, C Castelluccia, "A security framework for privacy preserving data aggregation in wireless sensor networks", ACM Transactions on Sensor Networks (TOSN), vol. 7, no. 4, pp. 29, 2011.

[9] S.Chatterjea, P. Havinga, "A Dynamic data aggregation scheme for Wireless Sensor Networks", Proc. ProRISC, pp. 56-60, 2003.

[10] Dietrich, F. Dressler, "On the Lifetime of Wireless Sensor Networks", ACM Transactions on Sensor Networks, vol. 5, no. 1, pp. 1-38, 2009, [online] Available: 10.1145/1464420.1464425.

[11] K. Kalpakis, K. Dasgupta, P. Namjoshi, "Efficient algorithms for maximum lifetime data gathering and aggregation in wireless sensor networks", Computer Networks, vol. 42, no. 6, pp. 697-716, August 2003.

[12] Y. Xue, Y. Cui, K. Nahrstedt, "Maximizing lifetime for data aggregation in wireless sensor networks", ACM/Kluwer Mobile Networks and Applications (MONET) Special Issue on Energy Constraints and Lifetime Performance in Wireless Sensor Networks, pp. 853-64, Dec. 2005.

[13] B. Hong, V.K. Prasanna, "Optimizing system lifetime for data gathering in networked sensor systems", Workshop on Algorithms for Wireless and Ad-hoc Networks (A-SWAN), August 2004.


402

[14] P Padmaja, G.V Marutheswar, "2016‘Secured Data Aggregation In Wireless Sensor Networks", International Journal of Applied Engineering Research, vol. 11, no. 7, pp. 4740-4745, 2016, ISSN 0973-4562.

[15] P Padmaja, G. V Marutheswar, "Optimization Of Wireless Sensor Networks In Secured Data Aggregation", International Journal of Electrical and Electronis Engineering Research, vol. 7, no. 2, pp. 94-100, 2016, ISSN 2321-2055.


403

404

Date post:	15-Mar-2020
Category:	Documents
Upload:	others
View:	0 times
Download:	0 times

Detection of Malicious Node Using Optimization Techniques · 2018-09-01 · Fig. 1 : Wireless...

Documents