The document proposes a random keying technique combined with memetics concepts to provide security in wireless sensor networks. It involves randomly selecting keys from ranges distributed from the base station to cluster heads and nodes. When a node communicates, it selects keys that undergo crossover and mutation to generate header and trailer keys. The receiving node verifies packets by applying the same operations to the header keys and comparing the results to the trailer keys. Simulations showed this technique effectively combats spoofing attacks while being energy efficient compared to cryptographic methods.
LOCATION BASED DETECTION OF REPLICATION ATTACKS AND COLLUDING ATTACKSEditor IJCATR
Wireless sensor networks gains its importance because of the critical applications in which it is involved like
industrial automation, healthcare applications, military and surveillance. Among security attacks in wireless sensor
networks we consider an active attack, NODE REPLICATION attack and COLLUDING attack. We use localized
algorithms, ((ie) replication detection is done at the node level and eliminated without the intervention of the base
station) to solve replication attacks and colluding attacks. Replication attacks are detected to using a unique key pair
and cryptographic hash function. We propose to use XED and EED algorithm[1] ( authenticates the node and tries to
reduce the replication) , with this using the Event detected location , non-beacon node is used to find the location of a
malicious node and by a simple threshold verification we identify malicious clusters
Intelligent Handwritten Digit Recognition using Artificial Neural NetworkIJERA Editor
The aim of this paper is to implement a Multilayer Perceptron (MLP) Neural Network to recognize and predict handwritten digits from 0 to 9. A dataset of 5000 samples were obtained from MNIST. The dataset was trained using gradient descent back-propagation algorithm and further tested using the feed-forward algorithm. The system performance is observed by varying the number of hidden units and the number of iterations. The performance was thereafter compared to obtain the network with the optimal parameters. The proposed system predicts the handwritten digits with an overall accuracy of 99.32%.
USE OF MARKOV CHAIN FOR EARLY DETECTING DDOS ATTACKSIJNSA Journal
DDoS has a variety of types of mixed attacks. Botnet attackers can chain different types of DDoS attacks to confuse cybersecurity defenders. In this article, the attack type can be represented as the state of the model. Considering the attack type, we use this model to calculate the final attack probability. The final attack probability is then converted into one prediction vector, and the incoming attacks can be detected early before IDS issues an alert. The experiment results have shown that the prediction model that can make multi-vector DDoS detection and analysis easier.
A survey of Network Intrusion Detection using soft computing Techniqueijsrd.com
with the impending era of internet, the network security has become the key foundation for lot of financial and business application. Intrusion detection is one of the looms to resolve the problem of network security. An Intrusion Detection System (IDS) is a program that analyses what happens or has happened during an execution and tries to find indications that the computer has been misused. Here we propose a new approach by utilizing neuro fuzzy and support vector machine with fuzzy genetic algorithm for higher rate of detection.
LOCATION BASED DETECTION OF REPLICATION ATTACKS AND COLLUDING ATTACKSEditor IJCATR
Wireless sensor networks gains its importance because of the critical applications in which it is involved like
industrial automation, healthcare applications, military and surveillance. Among security attacks in wireless sensor
networks we consider an active attack, NODE REPLICATION attack and COLLUDING attack. We use localized
algorithms, ((ie) replication detection is done at the node level and eliminated without the intervention of the base
station) to solve replication attacks and colluding attacks. Replication attacks are detected to using a unique key pair
and cryptographic hash function. We propose to use XED and EED algorithm[1] ( authenticates the node and tries to
reduce the replication) , with this using the Event detected location , non-beacon node is used to find the location of a
malicious node and by a simple threshold verification we identify malicious clusters
Intelligent Handwritten Digit Recognition using Artificial Neural NetworkIJERA Editor
The aim of this paper is to implement a Multilayer Perceptron (MLP) Neural Network to recognize and predict handwritten digits from 0 to 9. A dataset of 5000 samples were obtained from MNIST. The dataset was trained using gradient descent back-propagation algorithm and further tested using the feed-forward algorithm. The system performance is observed by varying the number of hidden units and the number of iterations. The performance was thereafter compared to obtain the network with the optimal parameters. The proposed system predicts the handwritten digits with an overall accuracy of 99.32%.
USE OF MARKOV CHAIN FOR EARLY DETECTING DDOS ATTACKSIJNSA Journal
DDoS has a variety of types of mixed attacks. Botnet attackers can chain different types of DDoS attacks to confuse cybersecurity defenders. In this article, the attack type can be represented as the state of the model. Considering the attack type, we use this model to calculate the final attack probability. The final attack probability is then converted into one prediction vector, and the incoming attacks can be detected early before IDS issues an alert. The experiment results have shown that the prediction model that can make multi-vector DDoS detection and analysis easier.
A survey of Network Intrusion Detection using soft computing Techniqueijsrd.com
with the impending era of internet, the network security has become the key foundation for lot of financial and business application. Intrusion detection is one of the looms to resolve the problem of network security. An Intrusion Detection System (IDS) is a program that analyses what happens or has happened during an execution and tries to find indications that the computer has been misused. Here we propose a new approach by utilizing neuro fuzzy and support vector machine with fuzzy genetic algorithm for higher rate of detection.
Prevention of Packet Hiding Methods In Selective Jamming AttackIJCERT
The sharing nature of wireless medium provides various challenging features among various set of users. It is very important in real world and it provides better transfer rate but authentication is ignored. The limitations of existing wired network are overcome by wireless network. These networks act as source for various types of jamming attacks. In analysis and detection of jamming attack various methods are available but sometime they fail. In case of external threat the analysis and reporting of jamming attack is very easy model but it is quite difficult in terms of internal threat model, these internal term uses the knowledge about network secrets and network protocols to launch various attacks with very low effort. Various cryptographic techniques are implemented to prevent these attacks. The main goal of this project is to prevent the information at the wireless physical layer and allowed the safe transmission among communicated nodes although the attacker is present.
Key Management Scheme for Secure Group Communication in WSN with Multiple Gr...csandit
Security is one of the inherent challenges in the area of Wireless Sensor Network (WSN). At
present, majority of the security protocols involve massive iterations and complex steps of
encryptions thereby giving rise to degradation of quality of service. Many WSN applications are
based on secure group communication. In this paper, we have proposed a scheme for secure
group key management with simultaneous multiple groups. The scheme uses a key-based
approach for managing the groups and we show that membership change events can be
handled with less storage, communication and computation cost. The scheme also offers
authentication to the messages communicated within and among the groups.
Secure and efficient key pre distribution schemes for wsn using combinatorial...eSAT Publishing House
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology
NOVEL HYBRID INTRUSION DETECTION SYSTEM FOR CLUSTERED WIRELESS SENSOR NETWORKIJNSA Journal
Wireless sensor network (WSN) is regularly deployed in unattended and hostile environments. The WSN is vulnerable to security threats and susceptible to physical capture. Thus, it is necessary to use effective mechanisms to protect the network. It is widely known, that the intrusion detection is one of the most efficient security mechanisms to protect the network against malicious attacks or unauthorized access. In this paper, we propose a hybrid intrusion detection system for clustered WSN. Our intrusion framework uses a combination between the Anomaly Detection based on support vector machine (SVM) and the Misuse Detection. Experiments results show that most of routing attacks can be detected with low false alarm.
A Probabilistic Approach towards the Prevention of Error Propagation Effect o...IDES Editor
Error propagation effect of Advanced Encryption
Standard (AES) is a great research challenge. AES suffers
from a major limitation of Error propagation effect. In
literature, several studies have been made on this issue and
several techniques are suggested to tackle the effect. To tackle
this limitation, two methods are available. One is Redundancy
Based Technique and the other one is Bite Based Parity
Technique. The first one has a significant advantage of
correcting any error on definite term over the second one but
at the cost of higher level of overhead and hence lowering the
processing speed. In this paper we have proposed a probabilistic
technique to combat the Error Propagation Effect, which
definitely guarantees a secured communication.
Derivative threshold actuation for single phase wormhole detection with reduc...ijdpsjournal
Communication in mobile Ad hoc networks is completed via multi
-
hop ways. Owing to the distributed
specification and restricted resource of nodes, MANET is a lot prone
to wormhole attacks i.e. wormhole
attacks place severe threats to each Ad hoc routing protocol and a few security enhancements. Thus,
so as
to discover wormholes, totally different techniques are in use. In all those techniques fixation of
threshold
is mer
ely by trial & error methodology or by random manner. Conjointly wormhole detection is in twin
part by putting the nodes that is higher than the edge in a suspicious set, however predicting the n
ode as a
wormhole by using some other algorithms. Our aim in
this paper is to deduce the traffic threshold level by
derivational approach for identifying wormholes in a very single phase in relay network having dissi
milar
characteristics.
A SECURE DIGITAL SIGNATURE SCHEME WITH FAULT TOLERANCE BASED ON THE IMPROVED ...csandit
Fault tolerance and data security are two important issues in modern communication systems.
In this paper, we propose a secure and efficient digital signature scheme with fault tolerance
based on the improved RSA system. The proposed scheme for the RSA cryptosystem contains
three prime numbers and overcome several attacks possible on RSA. By using the Chinese
Reminder Theorem (CRT) the proposed scheme has a speed improvement on the RSA decryption
side and it provides high security also.
Intrusion Detection System Using Self Organizing Map AlgorithmsEditor IJCATR
With the rapid expansion of computer usage and computer network the security of the computer system has became very
im
portant. Every day new kind of attacks are being faced by industries. Many methods have been proposed for the development of
intrusion detection system using artificial intelligence technique. In this paper we will have a look at an algorithm based o
n neur
al
networks that are suitable for Intrusion Detection Systems (IDS)
.
The name of this
algorithm is "Self Organizing Maps" (SOM).
So
far, many different methods have been used to build a detector that Wide variety of different ways in the covers. Among the
methods
used to detect attacks in intrusion detection is done, In this paper we investigate the
Self
-
Organizing
Map
method.
AN ENHANCED DETECTION AND ENERGYEFFICIENT EN-ROUTE FILTERING SCHEME IN WIRELE...ieijjournal
Wireless sensor networks (WSNs), due to their small size, low cost, and untethered communication over a short-range, have great potential for applications and services. Due to hostile environments and an unattended nature, they are prone to many types of attacks by adversaries. False data injection attacks compromise data accuracy at the sink node and cause undesirable energy depletion at the sink and intermediate nodes. In order to detect and counter false data attacks, a number of en-route filtering schemes have been proposed. However, they lack a strong false report detection capacity or cannot support network dynamics well. Commutative cipher-based en-route filtering (CCEF) is based on fixed paths, and a
fixed detection probability, and does not consider the residual energy of a node. In an enhanced detectioncapacity and energy-efficient en-route filtering (EDEF) scheme, we use a fuzzy logic system which considers the residual energy, false traffic ratio (FTR), and number of message authentication codes
(MACs) in a report to evaluate the fitness of a node to be a verification node. This helps to balance network
energy usage and reduce the number of hops a false report may travel. The simulation results demonstrate the validity of our scheme with increased energy-efficiency (4.55 to 13.92%) and detection power (99.95%) against false report attacks in WSNs.
International Journal of Computational Engineering Research(IJCER)ijceronline
International Journal of Computational Engineering Research(IJCER) is an intentional online Journal in English monthly publishing journal. This Journal publish original research work that contributes significantly to further the scientific knowledge in engineering and Technology.
A Novel Classification via Clustering Method for Anomaly Based Network Intrus...IDES Editor
Intrusion detection in the internet is an active
area of research. Intruders can be classified into two
types, namely; external intruders who are unauthorized
users of the computers they attack, and internal
intruders, who have permission to access the system but
with some restrictions. The aim of this paper is to present
a methodology to recognize attacks during the normal
activities in a system. A novel classification via sequential
information bottleneck (sIB) clustering algorithm has
been proposed to build an efficient anomaly based
network intrusion detection model. We have compared
our proposed method with other clustering algorithms
like X-Means, Farthest First, Filtered clusters, DBSCAN,
K-Means, and EM (Expectation-Maximization)
clustering in order to find the suitability of our proposed
algorithm. A subset of KDDCup 1999 intrusion detection
benchmark dataset has been used for the experiment.
Results show that the proposed method is efficient in
terms of detection accuracy, low false positive rate in
comparison to the other existing methods.
On-line Fault diagnosis of Arbitrary Connected NetworksIDES Editor
This paper proposes an on-line two phase fault
diagnosis algorithm for arbitrary connected networks. The
algorithm addresses a realistic fault model considering crash
and value faults in the nodes. Fault diagnosis is achieved by
comparing the heartbeat message generated by neighboring
nodes and dissemination of decision made at each node.
Theoretical analysis shows that time and message complexity
of the diagnosis scheme is O(n) for a n-node network. The
message and time complexity are comparable to the existing
state of art approaches and thus well suited for design of
different fault tolerant wireless communication networks
Intrusion detection with Parameterized Methods for Wireless Sensor Networksrahulmonikasharma
Current network intrusion detection systems lack adaptability to the frequently changing network environments. Furthermore, intrusion detection in the new distributed architectures is now a major requirement. In this paper, we propose two Adaboost based intrusion detection algorithms. In the first algorithm, a traditional online Adaboost process is used where decision stumps are used as weak classifiers. In the second algorithm, an improved online Adaboost process is proposed, and online Gaussian mixture models (GMMs) are used as weak classifiers. We further propose a distributed intrusion detection framework, in which a local parameterized detection model is constructed in each node using the online Adaboost algorithm. A global detection model is constructed in each node by combining the local parametric models using a small number of samples in the node. This combination is achieved using an algorithm based on particle swarm optimization (PSO) and support vector machines. The global model in each node is used to detect intrusions. Experimental results show that the improved online Adaboost process with GMMs obtains a higher detection rate and a lower false alarm rate than the traditional online Adaboost process that uses decision stumps. Both the algorithms outperform existing intrusion detection algorithms. It is also shown that our PSO, and SVM-based algorithm effectively combines the local detection models into the global model in each node; the global model in a node can handle the intrusion types that are found in other nodes, without sharing the samples of these intrusion types.
A survey on bio inspired security in wireless sensor networkseSAT Journals
Abstract Wireless sensor networks usually comprise of a large number of nodes which are geographically dis- tributed and are not physically connected. These nodes are frequently used to sense private data and can be necessary to transmit confidential and critical data. Hence it is important to provide security for wireless sensor networks. Research is still ongoing in this field and many models have been proposed for providing security. Looking into the symbiotic nature of biological systems can give us valuable in- sights for computer networks. Because of the analo- gies between network security and how the biotic components react to perceived threats in their sur- roundings, Bio-inspired approaches for providing se- curity in networks are interesting to evaluate . Many theories from nature such as swarm intelligence, ant colony optimisation (ACO), web spider defence, bird flocking, human immune system and so forth have been used to tackle various problems in the network- ing domain. In this paper, we intend to outline and categorize the various security attacks we encounter in a wireless sensor network and review the proposed conventional security mechanisms for them and also compare it with an alternative novel approach, i.e bio-inspired approach. Keywords— Wireless sensor network (WSN), Bio-inspired, security, attacks
Prevention of Packet Hiding Methods In Selective Jamming AttackIJCERT
The sharing nature of wireless medium provides various challenging features among various set of users. It is very important in real world and it provides better transfer rate but authentication is ignored. The limitations of existing wired network are overcome by wireless network. These networks act as source for various types of jamming attacks. In analysis and detection of jamming attack various methods are available but sometime they fail. In case of external threat the analysis and reporting of jamming attack is very easy model but it is quite difficult in terms of internal threat model, these internal term uses the knowledge about network secrets and network protocols to launch various attacks with very low effort. Various cryptographic techniques are implemented to prevent these attacks. The main goal of this project is to prevent the information at the wireless physical layer and allowed the safe transmission among communicated nodes although the attacker is present.
Key Management Scheme for Secure Group Communication in WSN with Multiple Gr...csandit
Security is one of the inherent challenges in the area of Wireless Sensor Network (WSN). At
present, majority of the security protocols involve massive iterations and complex steps of
encryptions thereby giving rise to degradation of quality of service. Many WSN applications are
based on secure group communication. In this paper, we have proposed a scheme for secure
group key management with simultaneous multiple groups. The scheme uses a key-based
approach for managing the groups and we show that membership change events can be
handled with less storage, communication and computation cost. The scheme also offers
authentication to the messages communicated within and among the groups.
Secure and efficient key pre distribution schemes for wsn using combinatorial...eSAT Publishing House
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology
NOVEL HYBRID INTRUSION DETECTION SYSTEM FOR CLUSTERED WIRELESS SENSOR NETWORKIJNSA Journal
Wireless sensor network (WSN) is regularly deployed in unattended and hostile environments. The WSN is vulnerable to security threats and susceptible to physical capture. Thus, it is necessary to use effective mechanisms to protect the network. It is widely known, that the intrusion detection is one of the most efficient security mechanisms to protect the network against malicious attacks or unauthorized access. In this paper, we propose a hybrid intrusion detection system for clustered WSN. Our intrusion framework uses a combination between the Anomaly Detection based on support vector machine (SVM) and the Misuse Detection. Experiments results show that most of routing attacks can be detected with low false alarm.
A Probabilistic Approach towards the Prevention of Error Propagation Effect o...IDES Editor
Error propagation effect of Advanced Encryption
Standard (AES) is a great research challenge. AES suffers
from a major limitation of Error propagation effect. In
literature, several studies have been made on this issue and
several techniques are suggested to tackle the effect. To tackle
this limitation, two methods are available. One is Redundancy
Based Technique and the other one is Bite Based Parity
Technique. The first one has a significant advantage of
correcting any error on definite term over the second one but
at the cost of higher level of overhead and hence lowering the
processing speed. In this paper we have proposed a probabilistic
technique to combat the Error Propagation Effect, which
definitely guarantees a secured communication.
Derivative threshold actuation for single phase wormhole detection with reduc...ijdpsjournal
Communication in mobile Ad hoc networks is completed via multi
-
hop ways. Owing to the distributed
specification and restricted resource of nodes, MANET is a lot prone
to wormhole attacks i.e. wormhole
attacks place severe threats to each Ad hoc routing protocol and a few security enhancements. Thus,
so as
to discover wormholes, totally different techniques are in use. In all those techniques fixation of
threshold
is mer
ely by trial & error methodology or by random manner. Conjointly wormhole detection is in twin
part by putting the nodes that is higher than the edge in a suspicious set, however predicting the n
ode as a
wormhole by using some other algorithms. Our aim in
this paper is to deduce the traffic threshold level by
derivational approach for identifying wormholes in a very single phase in relay network having dissi
milar
characteristics.
A SECURE DIGITAL SIGNATURE SCHEME WITH FAULT TOLERANCE BASED ON THE IMPROVED ...csandit
Fault tolerance and data security are two important issues in modern communication systems.
In this paper, we propose a secure and efficient digital signature scheme with fault tolerance
based on the improved RSA system. The proposed scheme for the RSA cryptosystem contains
three prime numbers and overcome several attacks possible on RSA. By using the Chinese
Reminder Theorem (CRT) the proposed scheme has a speed improvement on the RSA decryption
side and it provides high security also.
Intrusion Detection System Using Self Organizing Map AlgorithmsEditor IJCATR
With the rapid expansion of computer usage and computer network the security of the computer system has became very
im
portant. Every day new kind of attacks are being faced by industries. Many methods have been proposed for the development of
intrusion detection system using artificial intelligence technique. In this paper we will have a look at an algorithm based o
n neur
al
networks that are suitable for Intrusion Detection Systems (IDS)
.
The name of this
algorithm is "Self Organizing Maps" (SOM).
So
far, many different methods have been used to build a detector that Wide variety of different ways in the covers. Among the
methods
used to detect attacks in intrusion detection is done, In this paper we investigate the
Self
-
Organizing
Map
method.
AN ENHANCED DETECTION AND ENERGYEFFICIENT EN-ROUTE FILTERING SCHEME IN WIRELE...ieijjournal
Wireless sensor networks (WSNs), due to their small size, low cost, and untethered communication over a short-range, have great potential for applications and services. Due to hostile environments and an unattended nature, they are prone to many types of attacks by adversaries. False data injection attacks compromise data accuracy at the sink node and cause undesirable energy depletion at the sink and intermediate nodes. In order to detect and counter false data attacks, a number of en-route filtering schemes have been proposed. However, they lack a strong false report detection capacity or cannot support network dynamics well. Commutative cipher-based en-route filtering (CCEF) is based on fixed paths, and a
fixed detection probability, and does not consider the residual energy of a node. In an enhanced detectioncapacity and energy-efficient en-route filtering (EDEF) scheme, we use a fuzzy logic system which considers the residual energy, false traffic ratio (FTR), and number of message authentication codes
(MACs) in a report to evaluate the fitness of a node to be a verification node. This helps to balance network
energy usage and reduce the number of hops a false report may travel. The simulation results demonstrate the validity of our scheme with increased energy-efficiency (4.55 to 13.92%) and detection power (99.95%) against false report attacks in WSNs.
International Journal of Computational Engineering Research(IJCER)ijceronline
International Journal of Computational Engineering Research(IJCER) is an intentional online Journal in English monthly publishing journal. This Journal publish original research work that contributes significantly to further the scientific knowledge in engineering and Technology.
A Novel Classification via Clustering Method for Anomaly Based Network Intrus...IDES Editor
Intrusion detection in the internet is an active
area of research. Intruders can be classified into two
types, namely; external intruders who are unauthorized
users of the computers they attack, and internal
intruders, who have permission to access the system but
with some restrictions. The aim of this paper is to present
a methodology to recognize attacks during the normal
activities in a system. A novel classification via sequential
information bottleneck (sIB) clustering algorithm has
been proposed to build an efficient anomaly based
network intrusion detection model. We have compared
our proposed method with other clustering algorithms
like X-Means, Farthest First, Filtered clusters, DBSCAN,
K-Means, and EM (Expectation-Maximization)
clustering in order to find the suitability of our proposed
algorithm. A subset of KDDCup 1999 intrusion detection
benchmark dataset has been used for the experiment.
Results show that the proposed method is efficient in
terms of detection accuracy, low false positive rate in
comparison to the other existing methods.
On-line Fault diagnosis of Arbitrary Connected NetworksIDES Editor
This paper proposes an on-line two phase fault
diagnosis algorithm for arbitrary connected networks. The
algorithm addresses a realistic fault model considering crash
and value faults in the nodes. Fault diagnosis is achieved by
comparing the heartbeat message generated by neighboring
nodes and dissemination of decision made at each node.
Theoretical analysis shows that time and message complexity
of the diagnosis scheme is O(n) for a n-node network. The
message and time complexity are comparable to the existing
state of art approaches and thus well suited for design of
different fault tolerant wireless communication networks
Intrusion detection with Parameterized Methods for Wireless Sensor Networksrahulmonikasharma
Current network intrusion detection systems lack adaptability to the frequently changing network environments. Furthermore, intrusion detection in the new distributed architectures is now a major requirement. In this paper, we propose two Adaboost based intrusion detection algorithms. In the first algorithm, a traditional online Adaboost process is used where decision stumps are used as weak classifiers. In the second algorithm, an improved online Adaboost process is proposed, and online Gaussian mixture models (GMMs) are used as weak classifiers. We further propose a distributed intrusion detection framework, in which a local parameterized detection model is constructed in each node using the online Adaboost algorithm. A global detection model is constructed in each node by combining the local parametric models using a small number of samples in the node. This combination is achieved using an algorithm based on particle swarm optimization (PSO) and support vector machines. The global model in each node is used to detect intrusions. Experimental results show that the improved online Adaboost process with GMMs obtains a higher detection rate and a lower false alarm rate than the traditional online Adaboost process that uses decision stumps. Both the algorithms outperform existing intrusion detection algorithms. It is also shown that our PSO, and SVM-based algorithm effectively combines the local detection models into the global model in each node; the global model in a node can handle the intrusion types that are found in other nodes, without sharing the samples of these intrusion types.
A survey on bio inspired security in wireless sensor networkseSAT Journals
Abstract Wireless sensor networks usually comprise of a large number of nodes which are geographically dis- tributed and are not physically connected. These nodes are frequently used to sense private data and can be necessary to transmit confidential and critical data. Hence it is important to provide security for wireless sensor networks. Research is still ongoing in this field and many models have been proposed for providing security. Looking into the symbiotic nature of biological systems can give us valuable in- sights for computer networks. Because of the analo- gies between network security and how the biotic components react to perceived threats in their sur- roundings, Bio-inspired approaches for providing se- curity in networks are interesting to evaluate . Many theories from nature such as swarm intelligence, ant colony optimisation (ACO), web spider defence, bird flocking, human immune system and so forth have been used to tackle various problems in the network- ing domain. In this paper, we intend to outline and categorize the various security attacks we encounter in a wireless sensor network and review the proposed conventional security mechanisms for them and also compare it with an alternative novel approach, i.e bio-inspired approach. Keywords— Wireless sensor network (WSN), Bio-inspired, security, attacks
An Efficient Security Way of Authentication and Pair wise Key Distribution wi...IJMER
International Journal of Modern Engineering Research (IJMER) is Peer reviewed, online Journal. It serves as an international archival forum of scholarly research related to engineering and science education.
International Journal of Modern Engineering Research (IJMER) covers all the fields of engineering and science: Electrical Engineering, Mechanical Engineering, Civil Engineering, Chemical Engineering, Computer Engineering, Agricultural Engineering, Aerospace Engineering, Thermodynamics, Structural Engineering, Control Engineering, Robotics, Mechatronics, Fluid Mechanics, Nanotechnology, Simulators, Web-based Learning, Remote Laboratories, Engineering Design Methods, Education Research, Students' Satisfaction and Motivation, Global Projects, and Assessment…. And many more.
Security in Wireless Sensor Networks Using BroadcastingIJMER
Wireless sensor networks as one of the growing technology in the coming decades has posed various unique challenges to researchers. A WSN typically consists of several base stations and thousands of sensor nodes, which are resource limited devices with low processing, energy, and storage capabilities.While the set of challenges in sensor networks are diverse, we focus on security of Wireless Sensor Network in this paper. As today’s world is growing more towards the Wireless technology, our aim must be towards providing the best security features to Wireless Sensor Network( WSN).We propose some of the security requirements for Wireless Sensor Network. Further, security being vital to the acceptance and use of sensor networks for many applications. We propose an efficient broadcast authentication scheme for wireless sensor networks in this paper.
Analysis of wireless sensor networks security, attacks and challengeseSAT Publishing House
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology
Similar to Random Keying Technique for Security in Wireless Sensor Networks Based on Memetics, International Journal of Computer Science: Theory and Application
IMPROVEMENT OF FALSE REPORT DETECTION PERFORMANCE BASED ON INVALID DATA DETEC...IJCNCJournal
WSN consists of a number of nodes and base stations and is used for event monitoring in various fields such as war situations, forest fires, and home networks. WSN sensor nodes are placed in fields that are difficult for users to manage. It is therefore vulnerable to attackers, and attackers can use false nodes or MAC injection attacks through the hijacked nodes to reduce the lifetime of the network or trigger false alarms. In order to prevent such attacks, several security protocols have been proposed, and all of them have been subjected to MAC-dependent validation, making it impossible to defend against false report attacks in extreme attack circumstances. As attacks have recently become more diverse and more intelligent, WSNs require intelligent methods of security. Based on the report information gathered from the base station, the proposed method provides a technique to prevent attacks that may occur where all MAC information is damaged by carrying out verification of a false report attack through the machine learning based prediction model and the evaluation function.
The Quality of the New Generator Sequence Improvent to Spread the Color Syste...TELKOMNIKA JOURNAL
This paper shows a new technic applicable for the digital devices that are the result of the finite’s
effect precision in the chaotic dynamics used in the coupled technic and the chaotic map’s perturbation
technics used for the generation of a Pseudo-Random Number Generator (PRNGs).The use of the
pseudo- chaotic sequences coupled to the orbit perturbation method in the chaotic logistic map and the
NewPiece-Wise Linear Chaotic Map (NPWLCM). The pseudo random number generator’s originality
proposed from the perturbation of the chaotic recurrence. Furthermore the outputs of the binary sequences
with NPWLCM are reconstructed conventionally with the Bernoulli’s sequences shifts map to change the
shapes with the bitwise permetation then the results in simulation are shown in progress.After being
perturbed, the chaotic system can generate the chaotic binary sequences in uniform distribution and the
statistical properties invulnerable analysis. This generator also has many advantages in the possible useful
applications of spread spectrum digitalimages, such as sensitive secret keys, random uniform distribution
of pixels in Crypto system in secure and synchronize communication.
With the increase in Internet users the number of malicious users are also growing day-by-day posing a
serious problem in distinguishing between normal and abnormal behavior of users in the network. This
has led to the research area of intrusion detection which essentially analyzes the network traffic and tries
to determine normal and abnormal patterns of behavior.In this paper, we have analyzed the standard
NSL-KDD intrusion dataset using some neural network based techniques for predicting possible
intrusions. Four most effective classification methods, namely, Radial Basis Function Network, Self-
Organizing Map, Sequential Minimal Optimization, and Projective Adaptive Resonance Theory have been
applied. In order to enhance the performance of the classifiers, three entropy based feature selection
methods have been applied as preprocessing of data. Performances of different combinations of classifiers
and attribute reduction methods have also been compared.
AN ANN APPROACH FOR NETWORK INTRUSION DETECTION USING ENTROPY BASED FEATURE S...IJNSA Journal
With the increase in Internet users the number of malicious users are also growing day-by-day posing a serious problem in distinguishing between normal and abnormal behavior of users in the network. This has led to the research area of intrusion detection which essentially analyzes the network traffic and tries to determine normal and abnormal patterns of behavior.In this paper, we have analyzed the standard NSL-KDD intrusion dataset using some neural network based techniques for predicting possible intrusions. Four most effective classification methods, namely, Radial Basis Function Network, SelfOrganizing Map, Sequential Minimal Optimization, and Projective Adaptive Resonance Theory have been applied. In order to enhance the performance of the classifiers, three entropy based feature selection methods have been applied as preprocessing of data. Performances of different combinations of classifiers and attribute reduction methods have also been compared.
MESSAGE EMBEDDED CIPHER USING 2-D CHAOTIC MAPijccmsjournal
This paper constructs two encryption methods using 2-D chaotic maps, Duffings and Arnold’s cat maps
respectively. Both of the methods are designed using message embedded scheme and are analyzed for their validity, for plaintext sensitivity, key sensitivity, known plaintext and brute-force attacks. Due to the
less key space generally many chaotic cryptosystem developed are found to be weak against Brute force attack which is an essential issue to be solved. For this issue, concept of identifiability proved to be a necessary condition to be fulfilled by the designed chaotic cipher to resist brute force attack, which is a basic attack. As 2-D chaotic maps provide more key space than 1-D maps thus they are considered to be more suitable. This work is accompanied with analysis results obtained from these developed cipher. Moreover, identifiable keys are searched for different input texts at various key values.
The methods are found to have good key sensitivity and possess identifiable keys thus concluding that they can resist linear attacks and brute-force attacks.
Message Embedded Cipher Using 2-D Chaotic Mapijccmsjournal
This paper constructs two encryption methods using 2-D chaotic maps, Duffings and Arnold’s cat maps
respectively. Both of the methods are designed using message embedded scheme and are analyzed for
their validity, for plaintext sensitivity, key sensitivity, known plaintext and brute-force attacks. Due to the
less key space generally many chaotic cryptosystem developed are found to be weak against Brute force
attack which is an essential issue to be solved. For this issue, concept of identifiability proved to be a
necessary condition to be fulfilled by the designed chaotic cipher to resist brute force attack, which is a
basic attack. As 2-D chaotic maps provide more key space than 1-D maps thus they are considered to be
more suitable. This work is accompanied with analysis results obtained from these developed cipher.
Moreover, identifiable keys are searched for different input texts at various key values.
New generation communication networks are moving towards autonomous wireless infrastructures which are very popular in the application of multimedia broadcasting and mobile communication where N numbers of data are transfer through the wireless network every day. In such applications security of transmitted signal is very important in wireless communication network. So the proposed work creates a methodology to increase the security of the data and communication using chaotic encryption algorithm to transfer the data from the wireless network. A proposed new structure is based on coupling of chaotic system. We combine the text message with the chaotic signals to reduce the attack and improve the security of the data. The performance of BER in AWGN channel are verified and analyzed with MATLAB toolbox.
Image morphing has been the subject of much attention in recent years. It has proven to be a powerful visual effects tool
in film and television, depicting the fluid transformation of one digital image into another. This paper reviews the growth of this field
and describes recent advances in image morphing in terms of three areas: feature specification, warp generation methods, and
transition control. These areas relate to the ease of use and quality of results. We will describe the role of radial basis functions, thin
plate splines, energy minimization, and multilevel free-form deformations in advancing the state-of-the-art in image morphing. A
comparison of various techniques for morphing one digital image in to another is made. We will compare various morphing techniques
such as Feature based image morphing, Mesh and Thin Plate Splines based image morphing based on different attributes such as
Computational Time, Visual Quality of Morphs obtained and Complexity involved in Selection of features. We will demonstrate the
pros and cons of various techniques so as to allow the user to make an informed decision to suit his particular needs. Recent work on a
generalized framework for morphing among multiple images will be described.
Intrusion Detection System Using Self Organizing Map AlgorithmsEditor IJCATR
With the rapid expansion of computer usage and computer network the security of the computer system has became very
important. Every day new kind of attacks are being faced by industries. Many methods have been proposed for the development of
intrusion detection system using artificial intelligence technique. In this paper we will have a look at an algorithm based on neural
networks that are suitable for Intrusion Detection Systems (IDS). The name of this algorithm is "Self Organizing Maps" (SOM). So
far, many different methods have been used to build a detector that Wide variety of different ways in the covers. Among the methods
used to detect attacks in intrusion detection is done, In this paper we investigate the Self-Organizing Map method.
A SECURE DIGITAL SIGNATURE SCHEME WITH FAULT TOLERANCE BASED ON THE IMPROVED ...cscpconf
Fault tolerance and data security are two important issues in modern communication systems.
In this paper, we propose a secure and efficient digital signature scheme with fault tolerance
based on the improved RSA system. The proposed scheme for the RSA cryptosystem contains
three prime numbers and overcome several attacks possible on RSA. By using the Chinese
Reminder Theorem (CRT) the proposed scheme has a speed improvement on the RSA decryption
side and it provides high security also.
The secure communication through synchronization between two identic chaotic systems have
recently gained a lot of interest. To implement a robust secure system based on synchronization, there is
always a need to generate new discrete dynamical systems and investigate their performances in terms of
amount of randomness they have and the ability to achieve synchronization smoothly. In this work, a new
chaotic system, named Nahrain, is proposed and tested for the possible use in secure transmission via
chaos synchronization as well as in cryptography applications. The performance of the proposed chaotic
system is tested using 0-1 test, while NIST suite tests are used to check the randomness statistical
properties. The nonlinear control laws are used to verify the synchronization of master-slave parts of the
proposed system. The simulation results show that Nahrain system has chaotic behavior and
synchronizable, while the equivalent binary sequence of the system has excellent randomness statistical
properties. The numerical results obtained using MATLAB for 0-1 test was 0.9864, and for frequency test
was 0.4202, while for frequency test within a block was 0.4311. As a result, the new proposed system can
be used to develop efficient encryption and synchronization algorithms for multimedia secure transmission
applications.
A Comparative Analysis of Feature Selection Methods for Clustering DNA SequencesCSCJournals
Large-scale analysis of genome sequences is in progress around the world, the major application of which is to establish the evolutionary relationship among the species using phylogenetic trees. Hierarchical agglomerative algorithms can be used to generate such phylogenetic trees given the distance matrix representing the dissimilarity among the species. ClustalW and Muscle are two general purpose programs that generates distance matrix from the input DNA or protein sequences. The limitation of these programs is that they are based on Smith-Waterman algorithm which uses dynamic programming for doing the pair-wise alignment. This is an extremely time consuming process and the existing systems may even fail to work for larger input data set. To overcome this limitation, we have used the frequency of codons usage as an approximation to find dissimilarity among species. The proposed technique further reduces the complexity by extracting only the significant features of the species from the mtDNA sequences using the techniques like frequent codons, codons with maximum range value or PCA technique. We have observed that the proposed system produces nearly accurate results in a significantly reduced running time.
Secured transmission through multi layer perceptron in wireless communication...ijmnct
In this paper, a multilayer perceptron guided encryption/decryption (STMLP) in wireless communication
has been proposed for exchange of data/information. Multilayer perceptron transmitting systems at both
ends generate an identical output bit and the network are trained based on the output which is used to
synchronize the network at both ends and thus forms a secret-key at end of synchronizations of the
networks. Weights or hidden units of the hidden layer help to form a secret session key. The plain text is
encrypted through chaining , cascaded xoring of multilayer perceptron generated session key. If size of the
final block of plain text is less than the size of the key then this block is kept unaltered. Receiver will use
identical multilayer perceptron generated session key for performing deciphering process for getting the
plain text. Parametric tests have been done and results are compared in terms of Chi-Square test, response
time in transmission with some existing classical techniques, which shows comparable results for the
proposed technique. Variation numbers of input vectors and hidden layers will increase the confusion
/diffusion of the schemeand hence increase the security. As a result variable energy based techniques may
be achieved which may be applicable devices/interface of the heterogeneous sizes of the network/device.
Similar to Random Keying Technique for Security in Wireless Sensor Networks Based on Memetics, International Journal of Computer Science: Theory and Application (20)
Observation of Io’s Resurfacing via Plume Deposition Using Ground-based Adapt...Sérgio Sacani
Since volcanic activity was first discovered on Io from Voyager images in 1979, changes
on Io’s surface have been monitored from both spacecraft and ground-based telescopes.
Here, we present the highest spatial resolution images of Io ever obtained from a groundbased telescope. These images, acquired by the SHARK-VIS instrument on the Large
Binocular Telescope, show evidence of a major resurfacing event on Io’s trailing hemisphere. When compared to the most recent spacecraft images, the SHARK-VIS images
show that a plume deposit from a powerful eruption at Pillan Patera has covered part
of the long-lived Pele plume deposit. Although this type of resurfacing event may be common on Io, few have been detected due to the rarity of spacecraft visits and the previously low spatial resolution available from Earth-based telescopes. The SHARK-VIS instrument ushers in a new era of high resolution imaging of Io’s surface using adaptive
optics at visible wavelengths.
Introduction:
RNA interference (RNAi) or Post-Transcriptional Gene Silencing (PTGS) is an important biological process for modulating eukaryotic gene expression.
It is highly conserved process of posttranscriptional gene silencing by which double stranded RNA (dsRNA) causes sequence-specific degradation of mRNA sequences.
dsRNA-induced gene silencing (RNAi) is reported in a wide range of eukaryotes ranging from worms, insects, mammals and plants.
This process mediates resistance to both endogenous parasitic and exogenous pathogenic nucleic acids, and regulates the expression of protein-coding genes.
What are small ncRNAs?
micro RNA (miRNA)
short interfering RNA (siRNA)
Properties of small non-coding RNA:
Involved in silencing mRNA transcripts.
Called “small” because they are usually only about 21-24 nucleotides long.
Synthesized by first cutting up longer precursor sequences (like the 61nt one that Lee discovered).
Silence an mRNA by base pairing with some sequence on the mRNA.
Discovery of siRNA?
The first small RNA:
In 1993 Rosalind Lee (Victor Ambros lab) was studying a non- coding gene in C. elegans, lin-4, that was involved in silencing of another gene, lin-14, at the appropriate time in the
development of the worm C. elegans.
Two small transcripts of lin-4 (22nt and 61nt) were found to be complementary to a sequence in the 3' UTR of lin-14.
Because lin-4 encoded no protein, she deduced that it must be these transcripts that are causing the silencing by RNA-RNA interactions.
Types of RNAi ( non coding RNA)
MiRNA
Length (23-25 nt)
Trans acting
Binds with target MRNA in mismatch
Translation inhibition
Si RNA
Length 21 nt.
Cis acting
Bind with target Mrna in perfect complementary sequence
Piwi-RNA
Length ; 25 to 36 nt.
Expressed in Germ Cells
Regulates trnasposomes activity
MECHANISM OF RNAI:
First the double-stranded RNA teams up with a protein complex named Dicer, which cuts the long RNA into short pieces.
Then another protein complex called RISC (RNA-induced silencing complex) discards one of the two RNA strands.
The RISC-docked, single-stranded RNA then pairs with the homologous mRNA and destroys it.
THE RISC COMPLEX:
RISC is large(>500kD) RNA multi- protein Binding complex which triggers MRNA degradation in response to MRNA
Unwinding of double stranded Si RNA by ATP independent Helicase
Active component of RISC is Ago proteins( ENDONUCLEASE) which cleave target MRNA.
DICER: endonuclease (RNase Family III)
Argonaute: Central Component of the RNA-Induced Silencing Complex (RISC)
One strand of the dsRNA produced by Dicer is retained in the RISC complex in association with Argonaute
ARGONAUTE PROTEIN :
1.PAZ(PIWI/Argonaute/ Zwille)- Recognition of target MRNA
2.PIWI (p-element induced wimpy Testis)- breaks Phosphodiester bond of mRNA.)RNAse H activity.
MiRNA:
The Double-stranded RNAs are naturally produced in eukaryotic cells during development, and they have a key role in regulating gene expression .
A brief information about the SCOP protein database used in bioinformatics.
The Structural Classification of Proteins (SCOP) database is a comprehensive and authoritative resource for the structural and evolutionary relationships of proteins. It provides a detailed and curated classification of protein structures, grouping them into families, superfamilies, and folds based on their structural and sequence similarities.
Comparing Evolved Extractive Text Summary Scores of Bidirectional Encoder Rep...University of Maribor
Slides from:
11th International Conference on Electrical, Electronics and Computer Engineering (IcETRAN), Niš, 3-6 June 2024
Track: Artificial Intelligence
https://www.etran.rs/2024/en/home-english/
(May 29th, 2024) Advancements in Intravital Microscopy- Insights for Preclini...Scintica Instrumentation
Intravital microscopy (IVM) is a powerful tool utilized to study cellular behavior over time and space in vivo. Much of our understanding of cell biology has been accomplished using various in vitro and ex vivo methods; however, these studies do not necessarily reflect the natural dynamics of biological processes. Unlike traditional cell culture or fixed tissue imaging, IVM allows for the ultra-fast high-resolution imaging of cellular processes over time and space and were studied in its natural environment. Real-time visualization of biological processes in the context of an intact organism helps maintain physiological relevance and provide insights into the progression of disease, response to treatments or developmental processes.
In this webinar we give an overview of advanced applications of the IVM system in preclinical research. IVIM technology is a provider of all-in-one intravital microscopy systems and solutions optimized for in vivo imaging of live animal models at sub-micron resolution. The system’s unique features and user-friendly software enables researchers to probe fast dynamic biological processes such as immune cell tracking, cell-cell interaction as well as vascularization and tumor metastasis with exceptional detail. This webinar will also give an overview of IVM being utilized in drug development, offering a view into the intricate interaction between drugs/nanoparticles and tissues in vivo and allows for the evaluation of therapeutic intervention in a variety of tissues and organs. This interdisciplinary collaboration continues to drive the advancements of novel therapeutic strategies.
What is greenhouse gasses and how many gasses are there to affect the Earth.moosaasad1975
What are greenhouse gasses how they affect the earth and its environment what is the future of the environment and earth how the weather and the climate effects.
This pdf is about the Schizophrenia.
For more details visit on YouTube; @SELF-EXPLANATORY;
https://www.youtube.com/channel/UCAiarMZDNhe1A3Rnpr_WkzA/videos
Thanks...!
Professional air quality monitoring systems provide immediate, on-site data for analysis, compliance, and decision-making.
Monitor common gases, weather parameters, particulates.
Seminar of U.V. Spectroscopy by SAMIR PANDASAMIR PANDA
Spectroscopy is a branch of science dealing the study of interaction of electromagnetic radiation with matter.
Ultraviolet-visible spectroscopy refers to absorption spectroscopy or reflect spectroscopy in the UV-VIS spectral region.
Ultraviolet-visible spectroscopy is an analytical method that can measure the amount of light received by the analyte.
Random Keying Technique for Security in Wireless Sensor Networks Based on Memetics, International Journal of Computer Science: Theory and Application
1. Vol. 1, No. 2, July 2014
Random Keying Technique for Security in Wireless
Sensor Networks Based on Memetics
S.B. Suman1, P.V. Ranjith Kumar2, E. Sandeep Kumar3
1 Dept. of Computer Science & Engg, M S Ramaiah Institute of Technology, Bangalore, Karnataka, India.
2 Dept. of Electronics & Communication Engg, M S Ramaiah Institute of Technology, Bangalore, Karnataka, India.
3 Dept. of Telecommunication Engg, JNN College of Engineering, Shimoga, Karnataka, India.
Email: sandeepe31@gmail.com
ABSTRACT
Wireless Sensor Networks (WSNs) are often prone to risk of security attacks and vulnerabilities. This is because of
the less human intervention in their operations. Hence, novel security mechanisms and techniques are of a prime
importance in these types of networks. In this context, we propose a unique security scheme, which coalesce the
random keying technique with memetics. The application of these kinds of bio-inspired computation in WSNs
provides robust security in the network with the obtained results supporting the security concerns of the network.
KEYWORDS
Random Keying Technique— Memetics— Bio-Inspired Computation.
c 2014 by Orb Academic Publisher. All rights reserved.
1. Introduction
Wireless sensor networks is gaining lot of research interest in
the present scenario because of its vast and versatile applications.
These networks are of great requirements in remote monitoring
and military applications where they exchange sensitive data.
Security is an area that has been a challenge for the researchers.
This is due to the versatility and complexity in attacks to which
these networks are often prone. Hence, in this paper we propose a
random keying technique merging with the concepts of memetics
to combat against the spoofing attacks in the network. Spoofing is
a type of attack where the adversary tries to impinge unwanted or
false information packets into the network to hamper its normal
operation. Few researches have been carried out in solving the
issues of WSNs using memetics.
Chuan- Kang Ting et al. [1] propose a scheme for improving
the network lifetime by enabling more coverage using memetic
algorithm for WSNs. Konstantinos et al. [2] propose a method
for improving network lifespan using memetic algorithm as an
improvement on the genetic algorithm, taking into accounts of
communication parameters and overheads of the sensor nodes.
Sandeep et al. [3] propose a novel biologically inspired tech-nique
that uses random keying technique with the concepts of
artificial immune system for identifying the spoofing attacks in
the network. Sandeep et al. [4] propose a bio-inspired approach
for addressing node capture attack, which is a combination of
artificial neural networks with the game theory as a combat mech-anism
against malicious attacker. Kashif et al. [5] propose a
bio-inspired approach that uses Ant Colony Optimization (ACO)
for routing, and artificial immune system for securing from ab-normalities
and routing attacks. Rongrong Fu et al. [6] developed
a bio- inspired security framework that adapts Artificial Immune
System (AIS) with the fuzzy techniques for detecting anomalies
in the network. Ranjith et al. [7] proposed a bio-inspired security
technique, which is based on genetics as counter measure against
spoofing attacks.
According our knowledge, very few research works has been
carried out using memetics in solving issues of WSNs and with
respect to applications of memetics concept is a novel approach
towards security. In the proposed work, we use a combination of
random key distribution scheme with memetic concepts for pro-viding
robust security for WSNs. The algorithm was simulated in
MATLAB and the results prove that the method is energy efficient
compared to the other widely used cryptographic techniques like
ECC and RSA, while combating against spoofing attacks.
The rest of the paper is organized as follows: section 2 deals
with memetics, section 3 with the proposed methodology, section
4 with radio model, section 5 discusses the attack scenario, section
6 deals with the simulations, section 7 deals with the results and
discussions, section 8 with the concluding remarks of the paper
and finally the paper ends with few references.
2. Memetics
Memetics is a theory based on Darwinian evolution, originating
from the popularization of Richard Dawkins book ‘the selfish
gene’. A ‘meme’ is same as ‘gene’ and but these are termed as
‘units of culture’, which are “hosted” in the minds of one or more
25
2. International Journal of Computer Science: Theory and Application
individuals, and which can reproduce itself, thereby jumping from
mind to mind [8]. The concept of ‘memetics’ has been developed
as ‘memetic algorithm’, for solving optimization problems.
2.1 Memetic algorithm
Memetic algorithms have elements of Metaheuristic and Compu-tational
Intelligence. Although they have principles of evolution-ary
algorithms, they may not strictly be considered an evolution-ary
technique. Using ideas of memes and memetic algorithms
in optimization may be referred to as memetics computing [9].
Ideally, memetic algorithms embrace the duality of genetic and
cultural evolution, allowing the transmission, selection, inheri-tance,
and variation of memes as well as genes. The memetic
algorithm can simply be considered as the improvement over the
genetic algorithm in the notion that, the genes are transferred
directly to the individual but the memes are processed locally
and then transferred. Hence, adding local search to the genetic
algorithm results in memetic algorithm.
The algorithm is given below:
1. Start: Randomly generate a population of N chromosomes.
2. Fitness: Calculate the fitness of all chromosomes.
3. Create a new population:
– Selection: According to the selection criteria, select two
chromosomes from the population that are best chromo-somes.
– Crossover: Perform crossover on the two chromosomes
selected.
– Local search: search for the best chromosomes.
– Mutation: Perform mutation on the chromosomes ob-tained
with small probability.
4. Replace: Replace the current population with the new
population.
5. Test: Test whether the termination condition is satisfied. If
so, stop. If not, go to Step 2.
This algorithm is modified for providing security in the WSNs.
3. Proposed Methodology
This section deals with the method introduced in the regard of
providing security in the network.
3.1 Random Key range distribution
3.1.1 At the Base Station (BS) - Set up phase
i - Set the range with in which the keys have to be selected.
The keys (integer numbers) between these ranges are the
initial set of populations (memes). Let this be (A;B).
ii - From the range (A;B) a random set of keys will be se-lected
for scaling down the range, this indicates the optimal
set of the keys, which participate in the further process. Let
this be (X;Y), where X is the lower limit and Y is the upper
limit.
iii - Within (X;Y), randomly two numbers will be picked, and
sent to the Cluster Head (CH). Step iii is repeated until all
the CHs receive two random numbers from the BS. Let the
number received at the CHs be (p;q), where, p is the lower
limit and q is the upper limit.
3.1.2 At the Cluster Heads
The received range from the BS will be sent all the member nodes
of its cluster. This is (p;q), which is dealt in the previous section.
3.2 Steady phase communication
1. Ordinary member node, if it wants to communicate with
its CH, it randomly picks two numbers from within the
range (p;q). The numbers (keys) in the range (p;q) is the
pool of population of memes. The chosen numbers in this
pool indicates the best locally picked memes for the further
processes. Let this be (m;n).
2. These memes are allowed to crossover with each other. The
procedure of the crossover is dealt in the later sections of
the paper.
3. The crossovered numbers (memes) are now checked for
fittest candidate, for the further mutation process. The re-sult
of crossover will be two numbers, let this be (k;h) and
out of two, one candidate is picked based on the presence
of number of ones. The candidate is now allowed for mu-tation,
whose process is explained in the further sections
of this paper, the other number is kept as it is without any
change. Let the picked candidate be h, and the result of the
mutation be v, the result after the process is (k;v).
4. (m;n) is placed in the header and (k;v) is substituted as the
trailer and the packet is sent to the CH.
5. The process is repeated by all the ordinary nodes in a net-work
that wants to communicate with the CH. The respec-tive
CHs wait until it receives the data from all the ordinary
nodes and again follows same procedure as in step 1 to step
4 and places header and trailer information in the packet
and sends to the BS.
3.3 Crossover
Let the range received by the higher hierarchy node be (p;q).
Select two numbers randomly and let this be (m;n). The step
involved is given below:
1. Initially, calculate intermediate number,
E = (m+1)+(n1); (1)
2. Find the smallest multiple of 3 between the range (m;E),
let this be x, else use m. 3 is an example this can also be
made random, and depends on the robustness required.
3. Find (x%8), which gives the point at which (m;n) has to be
crossovered. Here 8 is chosen since the size of keys chosen
for communication is 8 bits. The example is shown below.
26
3. International Journal of Computer Science: Theory and Application
Ex :
(p;q) = (12;70);
(m;n) = (15;56);
E = (15+1)+(561) = 71;
The smallest multiple between (15, 71) is x= 15;
4. (15%8) = 6; hence 6 is the crossover point. The bits from
6th position to the 8th position of (m;n) is crossovered with
one another.
m = 15 = 00001111
n = 56 = 00111000
After crossover! 00101111!47
!00011000!24
The result of crossover is (m;n) = (47;24).
3.4 Mutation
The two bytes obtained after the crossover is checked for number
of 1’s individually and the key with the highest number of ones
is chosen as the best candidate for mutation. From the example
dealt in the crossover section, the best candidate chosen is 47
because it has more number of 1’s in it.
The mutation is carried out in such a way that all the bits in
the number are complemented.
Ex :
47!00011111
11100000!223
The packet is put with (15, 56) as the header and (47, 223) as
the trailer information and sent to the higher hierarchical sensor
node.
3.5 Verification at the CH for the packet sent by ordi-nary
node or verification at the BS for the packet
sent by CH
1. Start
2. Receive the packet
3. Extract header
4. Check header, whether it is in the range that was sent by
itself. Let the received header be m, n and trailer be k,
v.
/*(p;q) range received by the higher hierarchy node*/
if (m p and n q) then
/* packet cleared stage-1*/
(g;h) = Crossover (m;n);
/*h1 and h2 are results of crossover*/
Select the best candidate for mutation. Let this be x.
(g1;h1)= Mutation (x);
if (g1 == k and h1 == v) then
/* packet cleared stage-2*/
else
/* packet is malicious*/
end
else
/* packet is malicious*/
end
5. Stop
3.6 Packet Description
i. Packet sent from BS to CH/ CH to its member nodes
MAC p q
where, MAC! address of the intended CH node and p, q!
keys randomly picked.
ii. Packet sent from ordinary node to CH/ CH to BS
This packet consists of the details regarding randomly picked
keys by the node and the trailer.
m n CRITICAL INFO k v
where, m;n!keys randomly picked by the node for communi-cation
with its CH and g1, h1 are the trailers after crossover and
mutation, CRITICAL INFO ! consists of various fields includ-ing,
preamble, sync bits, destination address, type, group identity,
length of message, counter for message sent, source address, error
checking bits and payload.
4. Radio Model
The proposed methodology uses a classical radio model [10]. The
sensor node is a transceiver. Hence, this radio model gives the
energy consumed for the transmission and reception. The block
diagram representation is shown in fig. 1. The radio model con-sists
of transmitter and receiver equivalent of the nodes separated
by the distance‘d’. Where Etx, Erx are the energy consumed in
the transmitter and the receiver electronics. Eamp is the energy
consumed in the transmitter amplifier in general, and it depends
on the type of propagation model chosen either free space or
multipath with the acceptable bit error rate. We consider Ef s for
free space propagation and Emp for multipath propagation as the
energy consumed in the amplifier circuitry. The transmitter and
the receiver electronics depends on digital coding, modulation,
filtering and spreading of data. Additional to this there is an ag-gregation
energy consumption of Eagg per bit if the node is cluster
head.
4.1 Energy Consumption
This section describes the energy consumed for communication.
Packet transmission
Et = (LP Etx)+(LP Eamp dn); (2)
where, LP ! is the packet length in bits, and n ! is the path
loss component which is 2 for free space and 4 for multipath
propagation.
Suppose a node transmits a packet. Each bit in a packet consumes
Etx amount of transmitter electronics energy, Eamp amount of
27
4. International Journal of Computer Science: Theory and Application
amplifier energy. A packet of length LP, consumes an overall
energy of Et .
Packet reception
Er = (LP Erx); (3)
where, LP ! is the packet length in bits.
Suppose a node receives a packet. Each bit in a packet con-sumes
Erx amount of receiver electronics energy. A packet of
length Lp, consumes an overall energy of Er.
Figure 1. Radio Model.
5. Attack Scenario
The system relies on confusing the intruder by randomly varying
the keys and ranges chosen for selecting the keys at the BS. The
newly deployed malicious attacker may spoof unwanted packets
to the CH or the BS. The attack scenarios are shown in the fig. 2
and fig. 3.
The new node carefully listens to the network paradigm and
assigns its MAC address with that of another node, of which it
may start disguising and spoofing packets to the higher hierarchi-cal
node. The packets follow the double verification steps and
gets identified itself as either a legitimate or a spoofed packet.
Suppose, the count of spoofed packets reaches above a pre-fixed
threshold, an alarm is sent to the BS for preventing the further
epidemic of the infected packet.
The spoofing can also be done at time by the legitimate nodes
already deployed. The spoofing in this case can also be detected
by the proposed methodology.
Since, the protocol protects the network using randomization
concept, the attack not being identified is minimal. One scenario
of attack was modeled in this paper, where a malicious node
listens to the paradigm of the network and gets to know about
the key ranges i.e. the keys are falling within the range (A;B),
and puts header of the packet with those numbers and trailers
with some random numbers. In this case, there are chances that
the packet may pass the first verification stage, but the second
stage clearance is difficult since the numbers in the headers has
to undergo crossover, mutation and results has to match with
the trailers. The results obtained for this scenario of attack is
discussed in the fig. 4, fig. 5, fig. 6, fig. 7 and fig. 8. Apart
from this case, if the malicious node has to successfully spoof
the packet in every attack, then it has to get the algorithmic and
mathematical details burnt in the node, which is the case of a
Figure 2. Malicious ordinary node sending a false packet to CH.
Figure 3. Malicious CH sending a false packet to the Base
Station.
node capture attack. The protocol fails if the node undergoes a
capture attack and the security details are hacked.
6. Simulations
The algorithm was executed and tested using MATLAB 2013a on
Intel core 5 Duo processor with windows operating system. CH
requirement was set to 10% and the algorithm was verified on
LEACH protocol till 1000 rounds. Table 1 contains the overhead
in packet size due to the proposed security algorithm and table 2
depicts the various key sizes used for simulation. The parameters
were set for modeling network environment is shown in table
3. The key sizes of ECC and RSA is shown in table 4, and of
which the basic key size of 112 for ECC and 512 for RSA was
considered for energy analysis.
7. Results and Discussions
This section deals with the results obtained. The algorithm was
tested on LEACH protocol. First five iterations are for analyzing
the security, where number of rounds was limited to 100 in every
iteration. Next, were five iterations each with 500 rounds. In
both cases, after every fifth round a malicious packet was made
to spoof into the network, the probability of being identified is
28
5. International Journal of Computer Science: Theory and Application
Table 1. Bits overhead due to cryptographic framework (per
communication).
Parameter Value
Packet sent from BS to CHs 32 bits
Packet sent from CH to ordinary node 32 bits
Packet sent from end node to CH 32 bits
Packet sent from CH to BS 32 bits
Table 2. Key sizes used in packets for communication.
Parameter Value
p;q 1 byte each
MAC 2 bytes
m;n 1 byte each
k;v 1 byte each
Figure 4. Number of spoofed packets identified for five iterations
(each for 100 rounds of LEACH).
checked, and the graph is plotted. It was observed that in both the
cases, the accuracy in identifying the malicious packets was 100%
Table 3. Radio characteristics and other parameters chosen for
simulation.
Parameter Size
Number of nodes 100
Transmitter electronics, Etx 50nJ=bit
Receiver electronics, Erx 50nJ=bit
Emp 0:0013pJ=bit
Ef s 10pJ=bit
Eagg 5nJ=bit
Length of plot 100m
Width of plot 100m
Lpt(packet sent from CH to Bs) 6400bits
Lctr(packet sent from ordinary node to CH) 200bits
Initial energy of the node 0:5J
Table 4. RSA and ECC key length comparison.
RSA ECC
512 112
1024 160
2048 224
3072 256
7680 384
15360 512
as per fig.6 and fig. 7. In addition, in both the cases the number
of packets clearing first stage and second stage of verification was
plotted separately as per the fig. 4 and fig. 5.
Figure 5. Number of spoofed packets identified for five iterations
(each for 500 rounds of LEACH).
Figure 6. Percentage of spoofed packets identified (each
iteration with 100 rounds of LEACH).
It was observed that even though the packets clear first stage,
it was likely that they were caught in the second stage of veri-fication;
hence, the accuracy was always 100% and shows the
29
6. International Journal of Computer Science: Theory and Application
Figure 7. Percentage of spoofed packets identified (each
iteration with 500 rounds of LEACH).
Figure 8. Additional Energy consumed for 100 rounds between
various cryptographic techniques.
robustness of the protocol in identifying the spoofed packets. The
energy consumption analysis of our scheme with the existing
cryptographic schemes like ECC and RSA was done for 100
rounds of LEACH for 10% of CH requirement, and the overhead
in the energy consumption is plotted in fig. 8.
It was observed that the modeled memetics based algorithm
(MA) is more energy efficient than the other widely used keying
techniques and the results prove that the technique is robust in
providing security in the network.
8. Conclusions
Security in WSNs has always been a difficult task in WSN to
address. In this context, memetics based random keying approach
is one of the contribution. It was observed a 100% accuracy in
identifying the spoofed packets, since every packet has to undergo
a double verification stage to get through into the network. In
addition, the energy overhead calibration due to the use of the
technique gives a promising result compared to other techniques.
The developed algorithm uses confusion strategy in combination
with memetics for identifying the spoofed packets. The obtained
results prove that the algorithm can be implemented in the future
networks with an ease.
References
[1] TING, Chuan-Kang et LIAO, Chien-Chih. A memetic algo-rithm
for extending wireless sensor network lifetime. Infor-mation
Sciences, 2010, vol. 180, no 24, p. 4818-4833.
[2] FERENTINOS, Konstantinos P. et TSILIGIRIDIS, Theodore
A. A memetic algorithm for optimal dynamic design of wire-less
sensor networks. Computer Communications, 2010, vol.
33, no 2, p. 250-258.
[3] KUMAR, E. Sandeep, KUSUMA, S.M., KUMAR, B.P. Vi-jaya,
A Random Key Distribution based Artificial Immune
System for Security in Wireless Sensor Networks, Proc.
of IEEE International Students’ Conference on Electron-ics,
Electrical and Computer Science (SCEECS)-2014, 1-2
March, MANIT, Bhopal, Madhya Pradesh.
[4] KUMAR, E. Sandeep, KUSUMA, S.M., KUMAR, B.P. Vi-jaya,
An Intelligent Defense Mechanism for Security inWire-less
Sensor Networks, Proc. of IEEE International Confer-ence
on Communications and Signal Processing (ICCSP) -
2014, 3-5 April, APEC, Melmaruvattur, Tamil Nadu.
[5] SALEEM, Kashif, FISAL, Norsheila, HAFIZAH, Sharifah,
et al. An intelligent information security mechanism for the
network layer of WSN: BIOSARP. In : Computational Intel-ligence
in Security for Information Systems. Springer Berlin
Heidelberg, 2011. p. 118-126.
[6] FU, Rongrong, ZHENG, Kangfeng, LU, Tianliang, et al.
Biologically Inspired Anomaly Detection for Hierarchical
Wireless Sensor Networks. Journal of Networks, 2012, vol.
7, no 8, p. 1214-1219.
[7] V RANJITHKUMAR, P., P NEMAGOUD, Sandeep, KU-MAR
E, Sandeep, et al. A Novel Security Framework based
on Genetics for Clustered Wireless Sensor Networks. Inter-national
Journal of Computer Applications, 2014, vol. 96,
no 5, p. 8-13.
[8] Concepts of memetics from, Memetics-http://
en.wikipedia.org/wiki/Memetics
[9] Concepts of memetics from site nature- inspired algorithms:
http://www.cleveralgorithms.com/natureinspired/physical/
memetic algorithm.html
[10] HEINZELMAN, Wendi Rabiner, CHANDRAKASAN,
Anantha, et BALAKRISHNAN, Hari. Energy-efficient com-munication
protocol for wireless microsensor networks. In
: System Sciences, 2000. Proceedings of the 33rd Annual
Hawaii International Conference on. IEEE, 2000. p. 10 pp.
vol. 2.
30