The paper envisages defense of critical information used in Computer Networks those are using Network Topologies such as Star Topology. The first part of the paper develops a model to predict the malicious traffic from the incoming traffic by using Black Scholes Equations. MATLAB is used to simulate the developed model for realistic values. However, the second part of the problem provides a framework for the treatment of predicted malicious traffic with detailed discussion of security measures.
This document proposes using a linear prediction model to detect a wide range of flooding distributed denial of service (DDoS) attacks. It models the entropy of incoming network traffic over time using a linear prediction technique commonly applied to financial time series. The model is tested on simulated network data containing normal traffic and introduced attacks of varying rates. Results show the linear prediction model can successfully detect attacks with low rates and delays by identifying anomalies in the modeled entropy time series compared to normal traffic patterns. This approach aims to provide a fast and effective method for detecting different types of flooding DDoS attacks.
This document proposes a scalable authentication scheme for wireless sensor networks based on elliptic curve cryptography. The proposed scheme allows nodes to transmit an unlimited number of messages without suffering from the threshold problem that exists in polynomial-based schemes. It provides hop-by-hop authentication to verify messages as they are forwarded and also provides source privacy by anonymizing the message sender. Both theoretical analysis and simulation results show the proposed scheme has lower communication and computation overhead than polynomial-based schemes under comparable security levels, while providing source anonymity.
This document proposes a scalable authentication scheme for wireless sensor networks based on elliptic curve cryptography. The proposed scheme allows nodes to transmit an unlimited number of messages without suffering from the threshold problem that exists in polynomial-based schemes. It provides hop-by-hop authentication to verify messages as they are forwarded and also provides source privacy by anonymizing the message sender. Both theoretical analysis and simulation results show the proposed scheme has lower communication and computation overhead than polynomial-based schemes under comparable security levels, while providing source anonymity.
Impact of black hole attack on aodv routing protocolZac Darcy
A
m
obile
a
d
-
hoc
n
etwork (MANET)
is a
collection
of wireless mobile nodes
that dynamically self
-
organize
to form an
arbitrary and temporary network.
The mobile nodes can communicate wit
h each other
without
any fixed infrastructure.
MANET
can be set
up quickly to facilitate communication in a hostile environment
such as battlefield or emergency situation.
The various severe security threats are
increasing
on the
MANET
. One of these secur
ity threats is black hole attack which drops all received data packets intended
for forwarding. In this paper, we are simulating and analyzing the impact of black hole attack on Ad Hoc
On
-
Demand Distance Vector (AODV) protocol. Th
e simulation is carried on
NS
-
2 and t
he simulation
results are analyzed
on
various network performance
metric
s such as packet delivery ratio, normalized
routing overhead
and
average end
-
to
-
end delay
An Analytical Approach To Analyze The Impact Of Gray Hole Attacks In Manetidescitation
Mobile adhoc networks are connected by wireless
links which forms a random topology of mobile nodes.Random
topology and self-organising network provides on-demand
networking and dynamic topology.Due to lack of infrastructure
support each node are self-organising and any nodes can join
and leave the network at any time.Providing security to these
network is a challenging issue because these type of networks
suffer for various kinds of malicious attacks.One of the attacks
which are most difficult to detect in Mobile adhoc network is
Gray hole attack.In this paper an analytical Gray Hole attack
model is developed for AODV protocol.Experiments are
simulated for Gray Hole attacks under variety of adhoc
network condition.
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 new ids scheme against blackhole attack to enhance security in wireless net...eSAT Journals
Abstract The aim of this paper is to protect the wireless network against the blackhole attack. Blackhole attack, as the name suggest, drops all the packets forwarded to it. In this paper, we have proposed an intrusion detection system (IDS) scheme to detect the malicious node (blackhole node) and to nullify its effect in the network. The proposed IDS scheme in the presence of blackhole attack gives approximately similar result as that of in the absence of attack. The network comprises for the three modules (i) Default AODV, (ii) AODV in the presence of blackhole attack and (iii) IDS scheme in the presence of attack by considering some parameters such as end to end delay, throughput, packet delivery ratio, normalized routing load etc. The proposed algorithm has been simulated on Network Simulator version-2 (NS-2). Key Words: AODV, Blackhole attack, DSN, IDS scheme, routing misbehavior, security
In this paper we propose a system that allows a safe and secure data transfer in MANETs between the source and the destination. As MANETs are unplanned networks and networks of instant communication, they are prone to attacks like disclosure, brute force attacks etc. In this paper we mainly concentrate on limiting the disclosure attacks in MANETs. Disclosure attack means that the network is monitored quietly without modifying it. The monitoring of network is possible only if the traffic is known. Hiding of traffic between the source and destination would prevent disclosure attacks in MANETs. To hide the traffic between the source and destination we must identify it. The traffic is identified using STARS(Statistical Traffic Pattern Discovery System for MANETs) technique. Using this technique, the traffic is made observable only for the intermediary nodes and the data is sent via intermediary nodes to the destination as single hop. The data which is sent as single hop by hop via intermediary nodes prevents the malicious node from knowing the original source and destination and thus preventing MANETs from disclosure attack.
This document proposes using a linear prediction model to detect a wide range of flooding distributed denial of service (DDoS) attacks. It models the entropy of incoming network traffic over time using a linear prediction technique commonly applied to financial time series. The model is tested on simulated network data containing normal traffic and introduced attacks of varying rates. Results show the linear prediction model can successfully detect attacks with low rates and delays by identifying anomalies in the modeled entropy time series compared to normal traffic patterns. This approach aims to provide a fast and effective method for detecting different types of flooding DDoS attacks.
This document proposes a scalable authentication scheme for wireless sensor networks based on elliptic curve cryptography. The proposed scheme allows nodes to transmit an unlimited number of messages without suffering from the threshold problem that exists in polynomial-based schemes. It provides hop-by-hop authentication to verify messages as they are forwarded and also provides source privacy by anonymizing the message sender. Both theoretical analysis and simulation results show the proposed scheme has lower communication and computation overhead than polynomial-based schemes under comparable security levels, while providing source anonymity.
This document proposes a scalable authentication scheme for wireless sensor networks based on elliptic curve cryptography. The proposed scheme allows nodes to transmit an unlimited number of messages without suffering from the threshold problem that exists in polynomial-based schemes. It provides hop-by-hop authentication to verify messages as they are forwarded and also provides source privacy by anonymizing the message sender. Both theoretical analysis and simulation results show the proposed scheme has lower communication and computation overhead than polynomial-based schemes under comparable security levels, while providing source anonymity.
Impact of black hole attack on aodv routing protocolZac Darcy
A
m
obile
a
d
-
hoc
n
etwork (MANET)
is a
collection
of wireless mobile nodes
that dynamically self
-
organize
to form an
arbitrary and temporary network.
The mobile nodes can communicate wit
h each other
without
any fixed infrastructure.
MANET
can be set
up quickly to facilitate communication in a hostile environment
such as battlefield or emergency situation.
The various severe security threats are
increasing
on the
MANET
. One of these secur
ity threats is black hole attack which drops all received data packets intended
for forwarding. In this paper, we are simulating and analyzing the impact of black hole attack on Ad Hoc
On
-
Demand Distance Vector (AODV) protocol. Th
e simulation is carried on
NS
-
2 and t
he simulation
results are analyzed
on
various network performance
metric
s such as packet delivery ratio, normalized
routing overhead
and
average end
-
to
-
end delay
An Analytical Approach To Analyze The Impact Of Gray Hole Attacks In Manetidescitation
Mobile adhoc networks are connected by wireless
links which forms a random topology of mobile nodes.Random
topology and self-organising network provides on-demand
networking and dynamic topology.Due to lack of infrastructure
support each node are self-organising and any nodes can join
and leave the network at any time.Providing security to these
network is a challenging issue because these type of networks
suffer for various kinds of malicious attacks.One of the attacks
which are most difficult to detect in Mobile adhoc network is
Gray hole attack.In this paper an analytical Gray Hole attack
model is developed for AODV protocol.Experiments are
simulated for Gray Hole attacks under variety of adhoc
network condition.
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 new ids scheme against blackhole attack to enhance security in wireless net...eSAT Journals
Abstract The aim of this paper is to protect the wireless network against the blackhole attack. Blackhole attack, as the name suggest, drops all the packets forwarded to it. In this paper, we have proposed an intrusion detection system (IDS) scheme to detect the malicious node (blackhole node) and to nullify its effect in the network. The proposed IDS scheme in the presence of blackhole attack gives approximately similar result as that of in the absence of attack. The network comprises for the three modules (i) Default AODV, (ii) AODV in the presence of blackhole attack and (iii) IDS scheme in the presence of attack by considering some parameters such as end to end delay, throughput, packet delivery ratio, normalized routing load etc. The proposed algorithm has been simulated on Network Simulator version-2 (NS-2). Key Words: AODV, Blackhole attack, DSN, IDS scheme, routing misbehavior, security
In this paper we propose a system that allows a safe and secure data transfer in MANETs between the source and the destination. As MANETs are unplanned networks and networks of instant communication, they are prone to attacks like disclosure, brute force attacks etc. In this paper we mainly concentrate on limiting the disclosure attacks in MANETs. Disclosure attack means that the network is monitored quietly without modifying it. The monitoring of network is possible only if the traffic is known. Hiding of traffic between the source and destination would prevent disclosure attacks in MANETs. To hide the traffic between the source and destination we must identify it. The traffic is identified using STARS(Statistical Traffic Pattern Discovery System for MANETs) technique. Using this technique, the traffic is made observable only for the intermediary nodes and the data is sent via intermediary nodes to the destination as single hop. The data which is sent as single hop by hop via intermediary nodes prevents the malicious node from knowing the original source and destination and thus preventing MANETs from disclosure attack.
The document describes a source location privacy scheme for wireless sensor networks. It aims to hide the location of transmitting nodes from unauthorized parties. The scheme uses cluster-based anonymization and random routing. Node identities are anonymized by cluster heads assigning random numbers. Messages are then randomly routed across the network before reaching the base station. The scheme is evaluated using an information theoretic privacy measure index that considers the degree of privacy from anonymization and routing. Simulation results show the scheme achieves high privacy levels over 70% while increasing average message delay by a factor of 10 compared to schemes without privacy protections.
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
In remote sensor arrange messages are exchanged between the different source and goal matches agreeably such way that multi-jump parcel transmission is utilized. These information bundles are exchanged from the middle of the road hub to sink hub by sending a parcel to goal hubs. Where each hub overhears transmission close neighbor hub. To dodge this we propose novel approach with proficient steering convention i.e. most brief way directing and conveyed hub steering calculation. Proposed work additionally concentrates on Automatic Repeat Request and Deterministic Network coding. We spread this work by the end to end message encoding instrument. To upgrade hub security match shrewd key era is utilized, in which combined conveying hub is allocated with combine key to making secure correspondence. End to end. We dissect both single and numerous hubs and look at basic ARQ and deterministic system coding as strategies for transmission.
Efficient security approaches in mobile ad hoc networks a surveyeSAT 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
Limiting Self-Propagating Malware Based on Connection Failure Behavior csandit
Self-propagating malware (e.g., an Internet worm) exploits security loopholes in software to
infect servers and then use them to scan the Internet for more vulnerable servers. While the
mechanisms of worm infection and their propagation models are well understood, defense
against worms remains an open problem. One branch of defense research investigates the
behavioral difference between worm-infected hosts and normal hosts to set them apart. One
particular observation is that a worm-infected host, which scans the Internet with randomly
selected addresses, has a much higher connection-failure rate than a normal host. Rate-limit
algorithms have been proposed to control the spread of worms by traffic shaping based on
connection failure rate. However, these rate-limit algorithms can work properly only if it is
possible to measure failure rates of individual hosts efficiently and accurately. This paper points
out a serious problem in the prior method and proposes a new solution based on a highly
efficient double-bitmap data structure, which places only a small memory footprint on the
routers, while providing good measurement of connection failure rates whose accuracy can be
tuned by system parameters.
A Mobile Ad-Hoc Network (MANET) is a self configuring, infrastructure less network of mobile devices
connected by wireless links. Loopholes like wireless medium, lack of a fixed infrastructure, dynamic
topology, rapid deployment practices, and the hostile environments in which they may be deployed, make
MANET vulnerable to a wide range of security attacks and Wormhole attack is one of them. During this
attack a malicious node captures packets from one location in the network, and tunnels them to another
colluding malicious node at a distant point, which replays them locally. This paper presents a cluster based
Wormhole attack avoidance technique. The concept of hierarchical clustering with a novel hierarchical 32-
bit node addressing scheme is used for avoiding the attacking path during the route discovery phase of the
DSR protocol, which is considered as the under lying routing protocol. Pinpointing the location of the
wormhole nodes in the case of exposed attack is also given by using this method.
Detecting Misbehavior Nodes Using Secured Delay Tolerant NetworkIRJET Journal
This document proposes a method called Statistical-based Detection of Blackhole and Greyhole attackers (SDBG) to detect misbehaving nodes in delay tolerant networks. SDBG can detect both individual misbehaving nodes as well as nodes that are colluding together. It works by having each node record encounter data with other nodes, including the number of messages sent and received. Individual nodes that drop many messages can be detected based on having a low message forwarding ratio. Colluding nodes can be detected because they will have sent many messages to each other to fake good behavior. The method aims to accurately detect misbehaving nodes while keeping false positives low. Extensive simulations showed it can work well across different network conditions.
Elimination of wormhole attacker node in manet using performance evaluation m...Alexander Decker
This document summarizes a research paper that proposes a new method for detecting wormhole attacker nodes in mobile ad hoc networks (MANETs). The method detects malicious nodes based on analyzing hop counts and time delays in routes, without requiring any special hardware or protocol modifications. The proposed method is simulated using OPNET software with scenarios of 50 nodes, both with and without wormhole attacks. The results show that without prevention, a wormhole attack decreases average hop count and increases delays. However, when the proposed method is applied, it is able to detect the attacker nodes and avoid their paths, regaining normal hop counts and delays.
Comparison of the performance of trsaodv with aodv under blackhole attack in ...eSAT Journals
Abstract
A MANET is a self configuring, decentralized network of mobile nodes with limited energy and bandwidth. They have dynamic
topology which means their topology keeps changing. These bring lot of challenges in routing. Since there is no central authority
the mobile nodes act both as hosts as well as routers. They provide great comfort due to their portability and ease of installation
with no infrastructure but their nature brings in security issues which could not be compromised which paves way for extensive
research. They are vulnerable to many attacks and one such attack, Black hole Attack is implanted and a Trust based AODV,
TRSAODV has been proposed to overcome the attack and a comparative analysis of proposed TRSAODV with AODV is done in
this paper.
KeyWords: MANET; Blackhole Attack; AODV; Trust; TRSAODV;
Malicious Node Detection Mechanism for Wireless Ad Hoc NetworkCSCJournals
With the popularity of intelligent electronics which rely on wireless communication in the post-PC era, computing devices have become cheaper, smaller, more mobile and more pervasive in daily lives. Construction of wireless ad hoc network becomes more and more convenient. However, the deployment of sensor nodes in an unattended environment makes the networks vulnerable to a variety of potential attacks. We present a malicious node detection mechanism. In using a monitoring mechanism to detect suspicious behavior, and on the basis of the responses from other monitoring nodes, if the number of suspicious entries concerning a particular node reaches a set threshold, that node is declared malicious. The simulation results show that the time it takes to detect a malicious node is decreased when there are more nodes in the network, and that it provides a fast and efficient way to detect malicious nodes.
DETECTING PACKET DROPPING ATTACK IN WIRELESS AD HOC NETWORKIJCI JOURNAL
In wireless ad hoc network, packet loss is a serious issue. Either it is caused by link errors or by malicious
packet dropping. The malicious nodes in a route can intentionally drop the packets during the transmission
from source to destination. It is difficult to distinct the packet loss due to link errors and malicious
dropping. Here is a mechanism which will detect the malicious packet dropping by using the correlation
between packets. An auditing architecture based on homomorphic linear authenticator can be used to
ensure the proof of reception of packets at each node. Also to ensure the forwarding of packets at each
node, a reputation mechanism based on indirect reciprocity can be used.
DoS Forensic Exemplar Comparison to a Known SampleCSCJournals
The investigation of any event or incident often involves the evaluation of physical evidence. Occasionally, a comparison is conducted between an evidentiary sample of unknown origin and that of an appropriate known sample. In a Denial of Service (DoS) attack, items of evidentiary value may cross the spectrum from anecdotes to useful information in firewall logs or complete packet captures. Because of the spoofed or reflective nature of DoS attacks, relevant information leading to the direct identification of the perpetrator is rarely available. In many instances, this underscores the significance of the investigator's ability to accurately identify the tool utilized by the suspect. For a DoS attack scenario, this would likely involve a commercially available stresser or criminal bot infrastructure. In this paper, we propose the concept of a DoS exemplar and determine if the comparison of evidentiary samples to an appropriate known sample of DoS attributes could add value in the investigative process. We also provide a simple tool to compare two DoS flows.
IJCER (www.ijceronline.com) International Journal of computational Engineeri...ijceronline
This document summarizes a research paper on black hole attacks and countermeasures in the AODV routing protocol for mobile ad hoc networks (MANETs). It describes how a black hole attack works by having a malicious node send fake route replies to drop packets. It then discusses cooperative black hole attacks and several existing solutions that use watchdog mechanisms, reputation systems, intrusion detection, and opinion-based approaches to detect and isolate malicious nodes.
PREVENTION METHOD OF FALSE REPORT GENERATION IN CLUSTER HEADS FOR DYNAMIC EN-...ijcsit
Wireless sensor networks collect data through collaborative communication between sensor nodes. sensor nodes of wireless sensor networks are deployed in open environments. Hence, an attacker can easily compromise the node. An attacker can compromise a node to generate false reports and inject into the network. This causes unnecessary energy consumption in the process of transmitting false alarm messages and false data reports to the system. If the attacker keeps repeatedly attacking thereby causing problems such as reduction in the entire network life or disabling the networks. Yu and Guan proposed a dynamic en-route filtering scheme to detect and drop these false reports before reaching to the Base station. In the dynamic en-route filtering, the energy waste of the intermediate nodes occurs until it is detected early. In this paper, we propose a method to save the energy of the intermediate nodes by searching for the compromised node and blocking the reports generated at that node. When verifying a false report at the verification node, it can know report information. The base station is able to find the cluster of compromised nodes using that information. In particular, the base station can know the location of the node that has been compromised, we can block false alarms and energy losses by blocking reports
generated in that cluster.
Dear Student,
DREAMWEB TECHNO SOLUTIONS is one of the Hardware Training and Software Development centre available in
Trichy. Pioneer in corporate training, DREAMWEB TECHNO SOLUTIONS provides training in all software
development and IT-related courses, such as Embedded Systems, VLSI, MATLAB, JAVA, J2EE, CIVIL,
Power Electronics, and Power Systems. It’s certified and experienced faculty members have the
competence to train students, provide consultancy to organizations, and develop strategic
solutions for clients by integrating existing and emerging technologies.
ADD: No:73/5, 3rd Floor, Sri Kamatchi Complex, Opp City Hospital, Salai Road, Trichy-18
Contact @ 7200021403/04
phone: 0431-4050403
JPD1423 A Probabilistic Misbehavior Detection Scheme toward Efficient Trust ...chennaijp
We have best 2014 free dot not projects topics are available along with all document, you can easy to find out number of documents for various projects titles.
For More Details:
http://jpinfotech.org/final-year-ieee-projects/2014-ieee-projects/dot-net-projects/
This document discusses the detection of distributed denial of service (DDoS) attacks using different classifiers on the UCLA dataset. It presents a system with modules for packet collection, preprocessing, feature extraction, training/testing data splitting, and classification using K-nearest neighbors (KNN), support vector machines (SVM), and naive Bayesian classifiers. The system is evaluated using metrics like accuracy, sensitivity, specificity, precision, F-measure, and time complexity. Experimental results on the UCLA dataset show that KNN achieved the best performance with 94% accuracy and 96% precision in classifying attack packets from normal packets.
INFRINGEMENT PRECLUSION SYSTEM VIA SADEC: STEALTHY ATTACK DETECTION AND COUNT...ijp2p
In this paper we are providing a implementation details about simulated solution of stealthy packet drop
attack. Stealthy packet drop attack is a suite of four attack types, includes colluding collision, packet
misrouting, identity delegation and power control. Stealthy packet drop attacks disrupts the packet from
reaching to it’s destination through malicious behaviour. These attacks can be easily breakdown the
multi-hop wireless ad-hoc networks. Most widely preferred method for detecting attacks in wireless
network is behaviour based detection method. In this method a normal network overhears
communication from its neighbourhood. Here we are implementing a SADEC protocol which is
proposed solution of stealthy packet drop attacks. SADEC overlaid the base line local monitoring. In
base line local monitoring each neighbour maintains additional information about routing path also it
adds some checking responsibility to all its neighbours. SADEC proves more efficient than baseline local
monitoring to mitigate successfully all the stealthy attack types.
INFRINGEMENT PRECLUSION SYSTEM VIA SADEC: STEALTHY ATTACK DETECTION AND COUNT...ijp2p
In this paper we are providing a implementation details about simulated solution of stealthy packet drop
attack. Stealthy packet drop attack is a suite of four attack types, includes colluding collision, packet
misrouting, identity delegation and power control. Stealthy packet drop attacks disrupts the packet from
reaching to it’s destination through malicious behaviour. These attacks can be easily breakdown the
multi-hop wireless ad-hoc networks. Most widely preferred method for detecting attacks in wireless
network is behaviour based detection method. In this method a normal network overhears
communication from its neighbourhood. Here we are implementing a SADEC protocol which is
proposed solution of stealthy packet drop attacks. SADEC overlaid the base line local monitoring. In
base line local monitoring each neighbour maintains additional information about routing path also it
adds some checking responsibility to all its neighbours. SADEC proves more efficient than baseline local
monitoring to mitigate successfully all the stealthy attack types.
INFRINGEMENT PRECLUSION SYSTEM VIA SADEC: STEALTHY ATTACK DETECTION AND COUNT...ijp2p
In this paper we are providing a implementation details about simulated solution of stealthy packet drop
attack. Stealthy packet drop attack is a suite of four attack types, includes colluding collision, packet
misrouting, identity delegation and power control. Stealthy packet drop attacks disrupts the packet from
reaching to it’s destination through malicious behaviour. These attacks can be easily breakdown the
multi-hop wireless ad-hoc networks. Most widely preferred method for detecting attacks in wireless
network is behaviour based detection method. In this method a normal network overhears
communication from its neighbourhood. Here we are implementing a SADEC protocol which is
proposed solution of stealthy packet drop attacks. SADEC overlaid the base line local monitoring. In
base line local monitoring each neighbour maintains additional information about routing path also it
adds some checking responsibility to all its neighbours. SADEC proves more efficient than baseline local
monitoring to mitigate successfully all the stealthy attack types.
INFRINGEMENT PRECLUSION SYSTEM VIA SADEC: STEALTHY ATTACK DETECTION AND COUNT...ijp2p
In this paper we are providing a implementation details about simulated solution of stealthy packet drop
attack. Stealthy packet drop attack is a suite of four attack types, includes colluding collision, packet
misrouting, identity delegation and power control. Stealthy packet drop attacks disrupts the packet from
reaching to it’s destination through malicious behaviour. These attacks can be easily breakdown the
multi-hop wireless ad-hoc networks. Most widely preferred method for detecting attacks in wireless
network is behaviour based detection method. In this method a normal network overhears
communication from its neighbourhood. Here we are implementing a SADEC protocol which is
proposed solution of stealthy packet drop attacks. SADEC overlaid the base line local monitoring. In
base line local monitoring each neighbour maintains additional information about routing path also it
adds some checking responsibility to all its neighbours. SADEC proves more efficient than baseline local
monitoring to mitigate successfully all the stealthy attack types.
INFRINGEMENT PRECLUSION SYSTEM VIA SADEC: STEALTHY ATTACK DETECTION AND COUNT...ijp2p
In this paper we are providing a implementation details about simulated solution of stealthy packet drop
attack. Stealthy packet drop attack is a suite of four attack types, includes colluding collision, packet
misrouting, identity delegation and power control. Stealthy packet drop attacks disrupts the packet from
reaching to it’s destination through malicious behaviour. These attacks can be easily breakdown the
multi-hop wireless ad-hoc networks. Most widely preferred method for detecting attacks in wireless
network is behaviour based detection method. In this method a normal network overhears
communication from its neighbourhood. Here we are implementing a SADEC protocol which is
proposed solution of stealthy packet drop attacks. SADEC overlaid the base line local monitoring. In
base line local monitoring each neighbour maintains additional information about routing path also it
adds some checking responsibility to all its neighbours. SADEC proves more efficient than baseline local
monitoring to mitigate successfully all the stealthy attack types.
The document describes a source location privacy scheme for wireless sensor networks. It aims to hide the location of transmitting nodes from unauthorized parties. The scheme uses cluster-based anonymization and random routing. Node identities are anonymized by cluster heads assigning random numbers. Messages are then randomly routed across the network before reaching the base station. The scheme is evaluated using an information theoretic privacy measure index that considers the degree of privacy from anonymization and routing. Simulation results show the scheme achieves high privacy levels over 70% while increasing average message delay by a factor of 10 compared to schemes without privacy protections.
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
In remote sensor arrange messages are exchanged between the different source and goal matches agreeably such way that multi-jump parcel transmission is utilized. These information bundles are exchanged from the middle of the road hub to sink hub by sending a parcel to goal hubs. Where each hub overhears transmission close neighbor hub. To dodge this we propose novel approach with proficient steering convention i.e. most brief way directing and conveyed hub steering calculation. Proposed work additionally concentrates on Automatic Repeat Request and Deterministic Network coding. We spread this work by the end to end message encoding instrument. To upgrade hub security match shrewd key era is utilized, in which combined conveying hub is allocated with combine key to making secure correspondence. End to end. We dissect both single and numerous hubs and look at basic ARQ and deterministic system coding as strategies for transmission.
Efficient security approaches in mobile ad hoc networks a surveyeSAT 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
Limiting Self-Propagating Malware Based on Connection Failure Behavior csandit
Self-propagating malware (e.g., an Internet worm) exploits security loopholes in software to
infect servers and then use them to scan the Internet for more vulnerable servers. While the
mechanisms of worm infection and their propagation models are well understood, defense
against worms remains an open problem. One branch of defense research investigates the
behavioral difference between worm-infected hosts and normal hosts to set them apart. One
particular observation is that a worm-infected host, which scans the Internet with randomly
selected addresses, has a much higher connection-failure rate than a normal host. Rate-limit
algorithms have been proposed to control the spread of worms by traffic shaping based on
connection failure rate. However, these rate-limit algorithms can work properly only if it is
possible to measure failure rates of individual hosts efficiently and accurately. This paper points
out a serious problem in the prior method and proposes a new solution based on a highly
efficient double-bitmap data structure, which places only a small memory footprint on the
routers, while providing good measurement of connection failure rates whose accuracy can be
tuned by system parameters.
A Mobile Ad-Hoc Network (MANET) is a self configuring, infrastructure less network of mobile devices
connected by wireless links. Loopholes like wireless medium, lack of a fixed infrastructure, dynamic
topology, rapid deployment practices, and the hostile environments in which they may be deployed, make
MANET vulnerable to a wide range of security attacks and Wormhole attack is one of them. During this
attack a malicious node captures packets from one location in the network, and tunnels them to another
colluding malicious node at a distant point, which replays them locally. This paper presents a cluster based
Wormhole attack avoidance technique. The concept of hierarchical clustering with a novel hierarchical 32-
bit node addressing scheme is used for avoiding the attacking path during the route discovery phase of the
DSR protocol, which is considered as the under lying routing protocol. Pinpointing the location of the
wormhole nodes in the case of exposed attack is also given by using this method.
Detecting Misbehavior Nodes Using Secured Delay Tolerant NetworkIRJET Journal
This document proposes a method called Statistical-based Detection of Blackhole and Greyhole attackers (SDBG) to detect misbehaving nodes in delay tolerant networks. SDBG can detect both individual misbehaving nodes as well as nodes that are colluding together. It works by having each node record encounter data with other nodes, including the number of messages sent and received. Individual nodes that drop many messages can be detected based on having a low message forwarding ratio. Colluding nodes can be detected because they will have sent many messages to each other to fake good behavior. The method aims to accurately detect misbehaving nodes while keeping false positives low. Extensive simulations showed it can work well across different network conditions.
Elimination of wormhole attacker node in manet using performance evaluation m...Alexander Decker
This document summarizes a research paper that proposes a new method for detecting wormhole attacker nodes in mobile ad hoc networks (MANETs). The method detects malicious nodes based on analyzing hop counts and time delays in routes, without requiring any special hardware or protocol modifications. The proposed method is simulated using OPNET software with scenarios of 50 nodes, both with and without wormhole attacks. The results show that without prevention, a wormhole attack decreases average hop count and increases delays. However, when the proposed method is applied, it is able to detect the attacker nodes and avoid their paths, regaining normal hop counts and delays.
Comparison of the performance of trsaodv with aodv under blackhole attack in ...eSAT Journals
Abstract
A MANET is a self configuring, decentralized network of mobile nodes with limited energy and bandwidth. They have dynamic
topology which means their topology keeps changing. These bring lot of challenges in routing. Since there is no central authority
the mobile nodes act both as hosts as well as routers. They provide great comfort due to their portability and ease of installation
with no infrastructure but their nature brings in security issues which could not be compromised which paves way for extensive
research. They are vulnerable to many attacks and one such attack, Black hole Attack is implanted and a Trust based AODV,
TRSAODV has been proposed to overcome the attack and a comparative analysis of proposed TRSAODV with AODV is done in
this paper.
KeyWords: MANET; Blackhole Attack; AODV; Trust; TRSAODV;
Malicious Node Detection Mechanism for Wireless Ad Hoc NetworkCSCJournals
With the popularity of intelligent electronics which rely on wireless communication in the post-PC era, computing devices have become cheaper, smaller, more mobile and more pervasive in daily lives. Construction of wireless ad hoc network becomes more and more convenient. However, the deployment of sensor nodes in an unattended environment makes the networks vulnerable to a variety of potential attacks. We present a malicious node detection mechanism. In using a monitoring mechanism to detect suspicious behavior, and on the basis of the responses from other monitoring nodes, if the number of suspicious entries concerning a particular node reaches a set threshold, that node is declared malicious. The simulation results show that the time it takes to detect a malicious node is decreased when there are more nodes in the network, and that it provides a fast and efficient way to detect malicious nodes.
DETECTING PACKET DROPPING ATTACK IN WIRELESS AD HOC NETWORKIJCI JOURNAL
In wireless ad hoc network, packet loss is a serious issue. Either it is caused by link errors or by malicious
packet dropping. The malicious nodes in a route can intentionally drop the packets during the transmission
from source to destination. It is difficult to distinct the packet loss due to link errors and malicious
dropping. Here is a mechanism which will detect the malicious packet dropping by using the correlation
between packets. An auditing architecture based on homomorphic linear authenticator can be used to
ensure the proof of reception of packets at each node. Also to ensure the forwarding of packets at each
node, a reputation mechanism based on indirect reciprocity can be used.
DoS Forensic Exemplar Comparison to a Known SampleCSCJournals
The investigation of any event or incident often involves the evaluation of physical evidence. Occasionally, a comparison is conducted between an evidentiary sample of unknown origin and that of an appropriate known sample. In a Denial of Service (DoS) attack, items of evidentiary value may cross the spectrum from anecdotes to useful information in firewall logs or complete packet captures. Because of the spoofed or reflective nature of DoS attacks, relevant information leading to the direct identification of the perpetrator is rarely available. In many instances, this underscores the significance of the investigator's ability to accurately identify the tool utilized by the suspect. For a DoS attack scenario, this would likely involve a commercially available stresser or criminal bot infrastructure. In this paper, we propose the concept of a DoS exemplar and determine if the comparison of evidentiary samples to an appropriate known sample of DoS attributes could add value in the investigative process. We also provide a simple tool to compare two DoS flows.
IJCER (www.ijceronline.com) International Journal of computational Engineeri...ijceronline
This document summarizes a research paper on black hole attacks and countermeasures in the AODV routing protocol for mobile ad hoc networks (MANETs). It describes how a black hole attack works by having a malicious node send fake route replies to drop packets. It then discusses cooperative black hole attacks and several existing solutions that use watchdog mechanisms, reputation systems, intrusion detection, and opinion-based approaches to detect and isolate malicious nodes.
PREVENTION METHOD OF FALSE REPORT GENERATION IN CLUSTER HEADS FOR DYNAMIC EN-...ijcsit
Wireless sensor networks collect data through collaborative communication between sensor nodes. sensor nodes of wireless sensor networks are deployed in open environments. Hence, an attacker can easily compromise the node. An attacker can compromise a node to generate false reports and inject into the network. This causes unnecessary energy consumption in the process of transmitting false alarm messages and false data reports to the system. If the attacker keeps repeatedly attacking thereby causing problems such as reduction in the entire network life or disabling the networks. Yu and Guan proposed a dynamic en-route filtering scheme to detect and drop these false reports before reaching to the Base station. In the dynamic en-route filtering, the energy waste of the intermediate nodes occurs until it is detected early. In this paper, we propose a method to save the energy of the intermediate nodes by searching for the compromised node and blocking the reports generated at that node. When verifying a false report at the verification node, it can know report information. The base station is able to find the cluster of compromised nodes using that information. In particular, the base station can know the location of the node that has been compromised, we can block false alarms and energy losses by blocking reports
generated in that cluster.
Dear Student,
DREAMWEB TECHNO SOLUTIONS is one of the Hardware Training and Software Development centre available in
Trichy. Pioneer in corporate training, DREAMWEB TECHNO SOLUTIONS provides training in all software
development and IT-related courses, such as Embedded Systems, VLSI, MATLAB, JAVA, J2EE, CIVIL,
Power Electronics, and Power Systems. It’s certified and experienced faculty members have the
competence to train students, provide consultancy to organizations, and develop strategic
solutions for clients by integrating existing and emerging technologies.
ADD: No:73/5, 3rd Floor, Sri Kamatchi Complex, Opp City Hospital, Salai Road, Trichy-18
Contact @ 7200021403/04
phone: 0431-4050403
JPD1423 A Probabilistic Misbehavior Detection Scheme toward Efficient Trust ...chennaijp
We have best 2014 free dot not projects topics are available along with all document, you can easy to find out number of documents for various projects titles.
For More Details:
http://jpinfotech.org/final-year-ieee-projects/2014-ieee-projects/dot-net-projects/
This document discusses the detection of distributed denial of service (DDoS) attacks using different classifiers on the UCLA dataset. It presents a system with modules for packet collection, preprocessing, feature extraction, training/testing data splitting, and classification using K-nearest neighbors (KNN), support vector machines (SVM), and naive Bayesian classifiers. The system is evaluated using metrics like accuracy, sensitivity, specificity, precision, F-measure, and time complexity. Experimental results on the UCLA dataset show that KNN achieved the best performance with 94% accuracy and 96% precision in classifying attack packets from normal packets.
INFRINGEMENT PRECLUSION SYSTEM VIA SADEC: STEALTHY ATTACK DETECTION AND COUNT...ijp2p
In this paper we are providing a implementation details about simulated solution of stealthy packet drop
attack. Stealthy packet drop attack is a suite of four attack types, includes colluding collision, packet
misrouting, identity delegation and power control. Stealthy packet drop attacks disrupts the packet from
reaching to it’s destination through malicious behaviour. These attacks can be easily breakdown the
multi-hop wireless ad-hoc networks. Most widely preferred method for detecting attacks in wireless
network is behaviour based detection method. In this method a normal network overhears
communication from its neighbourhood. Here we are implementing a SADEC protocol which is
proposed solution of stealthy packet drop attacks. SADEC overlaid the base line local monitoring. In
base line local monitoring each neighbour maintains additional information about routing path also it
adds some checking responsibility to all its neighbours. SADEC proves more efficient than baseline local
monitoring to mitigate successfully all the stealthy attack types.
INFRINGEMENT PRECLUSION SYSTEM VIA SADEC: STEALTHY ATTACK DETECTION AND COUNT...ijp2p
In this paper we are providing a implementation details about simulated solution of stealthy packet drop
attack. Stealthy packet drop attack is a suite of four attack types, includes colluding collision, packet
misrouting, identity delegation and power control. Stealthy packet drop attacks disrupts the packet from
reaching to it’s destination through malicious behaviour. These attacks can be easily breakdown the
multi-hop wireless ad-hoc networks. Most widely preferred method for detecting attacks in wireless
network is behaviour based detection method. In this method a normal network overhears
communication from its neighbourhood. Here we are implementing a SADEC protocol which is
proposed solution of stealthy packet drop attacks. SADEC overlaid the base line local monitoring. In
base line local monitoring each neighbour maintains additional information about routing path also it
adds some checking responsibility to all its neighbours. SADEC proves more efficient than baseline local
monitoring to mitigate successfully all the stealthy attack types.
INFRINGEMENT PRECLUSION SYSTEM VIA SADEC: STEALTHY ATTACK DETECTION AND COUNT...ijp2p
In this paper we are providing a implementation details about simulated solution of stealthy packet drop
attack. Stealthy packet drop attack is a suite of four attack types, includes colluding collision, packet
misrouting, identity delegation and power control. Stealthy packet drop attacks disrupts the packet from
reaching to it’s destination through malicious behaviour. These attacks can be easily breakdown the
multi-hop wireless ad-hoc networks. Most widely preferred method for detecting attacks in wireless
network is behaviour based detection method. In this method a normal network overhears
communication from its neighbourhood. Here we are implementing a SADEC protocol which is
proposed solution of stealthy packet drop attacks. SADEC overlaid the base line local monitoring. In
base line local monitoring each neighbour maintains additional information about routing path also it
adds some checking responsibility to all its neighbours. SADEC proves more efficient than baseline local
monitoring to mitigate successfully all the stealthy attack types.
INFRINGEMENT PRECLUSION SYSTEM VIA SADEC: STEALTHY ATTACK DETECTION AND COUNT...ijp2p
In this paper we are providing a implementation details about simulated solution of stealthy packet drop
attack. Stealthy packet drop attack is a suite of four attack types, includes colluding collision, packet
misrouting, identity delegation and power control. Stealthy packet drop attacks disrupts the packet from
reaching to it’s destination through malicious behaviour. These attacks can be easily breakdown the
multi-hop wireless ad-hoc networks. Most widely preferred method for detecting attacks in wireless
network is behaviour based detection method. In this method a normal network overhears
communication from its neighbourhood. Here we are implementing a SADEC protocol which is
proposed solution of stealthy packet drop attacks. SADEC overlaid the base line local monitoring. In
base line local monitoring each neighbour maintains additional information about routing path also it
adds some checking responsibility to all its neighbours. SADEC proves more efficient than baseline local
monitoring to mitigate successfully all the stealthy attack types.
INFRINGEMENT PRECLUSION SYSTEM VIA SADEC: STEALTHY ATTACK DETECTION AND COUNT...ijp2p
In this paper we are providing a implementation details about simulated solution of stealthy packet drop
attack. Stealthy packet drop attack is a suite of four attack types, includes colluding collision, packet
misrouting, identity delegation and power control. Stealthy packet drop attacks disrupts the packet from
reaching to it’s destination through malicious behaviour. These attacks can be easily breakdown the
multi-hop wireless ad-hoc networks. Most widely preferred method for detecting attacks in wireless
network is behaviour based detection method. In this method a normal network overhears
communication from its neighbourhood. Here we are implementing a SADEC protocol which is
proposed solution of stealthy packet drop attacks. SADEC overlaid the base line local monitoring. In
base line local monitoring each neighbour maintains additional information about routing path also it
adds some checking responsibility to all its neighbours. SADEC proves more efficient than baseline local
monitoring to mitigate successfully all the stealthy attack types.
Impact of Black Hole Attack on AODV Routing ProtocolZac Darcy
A mobile ad-hoc network (MANET) is a collection of wireless mobile nodes that dynamically self-organize
to form an arbitrary and temporary network. The mobile nodes can communicate with each other without
any fixed infrastructure. MANET can be set up quickly to facilitate communication in a hostile environment
such as battlefield or emergency situation. The various severe security threats are increasing on the
MANET. One of these security threats is black hole attack which drops all received data packets intended
for forwarding. In this paper, we are simulating and analyzing the impact of black hole attack on Ad Hoc
On-Demand Distance Vector (AODV) protocol. The simulation is carried on NS-2 and the simulation
results are analyzed on various network performance metrics such as packet delivery ratio, normalized
routing overhead and average end-to-end delay.
Impact of Black Hole Attack on AODV Routing ProtocolZac Darcy
This document analyzes the impact of black hole attacks on the Ad Hoc On-Demand Distance Vector (AODV) routing protocol in mobile ad hoc networks. Through simulations in NS-2, it evaluates various performance metrics like packet delivery ratio, end-to-end delay, and routing overhead under different network conditions. The results show that the black hole attack significantly reduces packet delivery and increases delay and overhead compared to normal AODV operation. The attack has a more severe impact as the number of malicious nodes, network transactions, or node mobility increases.
A NOVEL TECHNIQUE TO DETECT INTRUSION IN MANETIJNSA Journal
In this paper a novel technique has been proposed for intrusion detection in MANET, where agents are
fired from a node for each node randomly and detect the defective nodes. Detection is based on triangular
encryption technique (TE)[9,10], and AODV[1,2,3,8] is taken as routing protocol. The scheme is an
‘Agent’ based intrusion detection system. This technique is applied on two types of defective nodes namely
packet sinking and black hole attack. For simulation purpose we have taken NS2 (2.33) and three type of
parameters are considered. These are number of nodes, percentage of node mobility and type of defective
nodes. For analysis purpose 20, 30, 30, 40, 50 and 60 nodes are taken with variability. Percentage of
defectiveness as 10%, 20%, 30% and 40%.Packet sink and black hole attack are considered as
defectiveness of nodes. We have considered generated packets, forward packets, average delay and drop
packets as comparisons and performance analysis parameters.
A NOVEL TECHNIQUE TO DETECT INTRUSION IN MANETIJNSA Journal
In this paper a novel technique has been proposed for intrusion detection in MANET, where agents are fired from a node for each node randomly and detect the defective nodes. Detection is based on triangular encryption technique (TE)[9,10], and AODV[1,2,3,8] is taken as routing protocol. The scheme is an ‘Agent’ based intrusion detection system. This technique is applied on two types of defective nodes namely packet sinking and black hole attack. For simulation purpose we have taken NS2 (2.33) and three type of parameters are considered. These are number of nodes, percentage of node mobility and type of defective nodes. For analysis purpose 20, 30, 30, 40, 50 and 60 nodes are taken with variability. Percentage of defectiveness as 10%, 20%, 30% and 40%.Packet sink and black hole attack are considered as defectiveness of nodes. We have considered generated packets, forward packets, average delay and drop packets as comparisons and performance analysis parameters.
TWIN-NODE NEIGHBOUR ATTACK ON AODV BASED WIRELESS AD HOC NETWORKIJCNCJournal
As security is a very challenging issue in ad hoc networks, variety of research works related to security of
ad hoc networks are being reported for last many years. In the present work, we propose a new sort of
attack titled Twin-Node Neighbour Attack (TNNA), wherein two malicious nodes in close vicinity of each
other exploits the provision of broadcast nature of Hello Messages in AODV routing protocol along with
non-provision of any restriction regarding authentication of participating nodes. Mitigation measures are
designed to lessen or perhaps remove security flaws and threats altogether. Detection and mitigation of
TNNA attack are also proposed and discussed. The network's performance has been measured using four
metrics viz. Packet Delivery Ratio, Throughput, Total Number of Received Packets and Average End-toEnd Delay. It is evident from simulations that the TNNA attack is significantly detrimental to the
performance of WANETs using AODV routing protocol. After attack throughput of legitimate flow is found
to be less than 5 % as compared to the Throughput without attack, when the data rate of malicious node is
100 Kibps. Due to stress of malicious flow of 100 Kibps, the number of transmitted (received) data packets
of legitimate flow is reduced by a factor of more than 20.
Twin-Node Neighbour Attack on AODV based Wireless Ad Hoc NetworkIJCNCJournal
As security is a very challenging issue in ad hoc networks, variety of research works related to security of ad hoc networks are being reported for last many years. In the present work, we propose a new sort of attack titled Twin-Node Neighbour Attack (TNNA), wherein two malicious nodes in close vicinity of each other exploits the provision of broadcast nature of Hello Messages in AODV routing protocol along with non-provision of any restriction regarding authentication of participating nodes. Mitigation measures are designed to lessen or perhaps remove security flaws and threats altogether. Detection and mitigation of TNNA attack are also proposed and discussed. The network's performance has been measured using four metrics viz. Packet Delivery Ratio, Throughput, Total Number of Received Packets and Average End-toEnd Delay. It is evident from simulations that the TNNA attack is significantly detrimental to the performance of WANETs using AODV routing protocol. After attack throughput of legitimate flow is found to be less than 5 % as compared to the Throughput without attack, when the data rate of malicious node is 100 Kibps. Due to stress of malicious flow of 100 Kibps, the number of transmitted (received) data packets of legitimate flow is reduced by a factor of more than 20.
Robust encryption algorithm based sht in wireless sensor networksijdpsjournal
In bound applications, the locations
of events reportable by a device network have to be compelled to stay
anonymous. That is, unauthorized observers should be unable to notice the origin of such events by
analyzing the network traffic. I analyze 2 forms of downsides: Communication overhead a
nd machine load
problem. During this paper, I gift a brand new framework for modeling, analyzing, and evaluating
obscurity in device networks. The novelty of the proposed framework is twofold: initial, it introduc
es the
notion of “interval indistinguishabi
lity” and provides a quantitative live to model obscurity in wireless
device networks; second, it maps supply obscurity to the applied mathematics downside I showed that
the
present approaches for coming up with statistically anonymous systems introduce co
rrelation in real
intervals whereas faux area unit unrelated. I show however mapping supply obscurity to consecutive
hypothesis testing with nuisance Parameters ends up in changing the matter of exposing non
-
public supply
data into checking out associate d
egree applicable knowledge transformation that removes or minimize the
impact of the nuisance data victimization sturdy cryptography algorithmic rule. By doing therefore,
I
remodel the matter of analyzing real valued sample points to binary codes, that ope
ns the door for
committal to writing theory to be incorporated into the study of anonymous networks. In existing wor
k,
unable to notice unauthorized observer in network traffic. However our work in the main supported
enhances their supply obscurity against
correlation check. the most goal of supply location privacy is to
cover the existence of real events.
STATISTICAL QUALITY CONTROL APPROACHES TO NETWORK INTRUSION DETECTIONIJNSA Journal
In the study of network intrusion, much attention has been drawn to on-time detection of intrusion to safeguard public and private interest and to capture the law-breakers. Even though various methods have been found in literature, some situations warrant us to determine intrusions of network in real-time to prevent further undue harm to the computer network as and when they occur. This approach helps detect the intrusion and has a greater potential to apprehend the law-breaker. The purpose of this article is to formulate a method to this effect that is based on the statistical quality control techniques widely used in the manufacturing and production processes.
A secure routing process to simultaneously defend against false report and wo...ieijjournal
This document proposes a new secure routing scheme to simultaneously detect and defend against wormhole attacks and false report attacks in wireless sensor networks. Existing security schemes focus on defending against single attacks but their performance degrades when multiple attacks occur simultaneously. The proposed scheme uses a key partition-based routing protocol to mitigate the detection probability reduction caused by wormholes. It also defines a new event report format containing verification counts and wormhole detection mechanisms. The scheme aims to detect attacks with few hops and low overhead even if the sender or receiver is compromised.
CLUSTER BASED FIDELITY TO SECURE DSDV PROTOCOL AGAINST BLACK HOLE ATTACKSpijans
In this paper, we introduce and discuss an approach that will be used to secure the DSDV routing
protocol in an ad-hoc network. Due to mobility and absence of infrastructure, nodes are more vulnerable
to several malicious attacks. The secure routing is essential to transmit packets from source to the
destination. Our approach consists to model and manage fidelity concept in an ad-hoc clustering
architecture. Clustering makes it possible to group the mobile nodes and to send data simultaneously to
the each group. Our security model thus aims to integrate mechanisms against black hole attacks, forcing cooperation between nodes and detecting failing behaviors. The nodes present in the clusters will work
more efficiently and the message passing within the nodes will also get more authenticated from the
cluster heads. The simulation of our proposed algorithm is carried out using NS2 network simulator by evaluating some network performances such as average delay, throughput of communication and packets
loss
CLUSTER BASED FIDELITY TO SECURE DSDV PROTOCOL AGAINST BLACK HOLE ATTACKSpijans
In this paper, we introduce and discuss an approach that will be used to secure the DSDV routing
protocol in an ad-hoc network. Due to mobility and absence of infrastructure, nodes are more vulnerable
to several malicious attacks. The secure routing is essential to transmit packets from source to the
destination. Our approach consists to model and manage fidelity concept in an ad-hoc clustering
architecture. Clustering makes it possible to group the mobile nodes and to send data simultaneously to
the each group. Our security model thus aims to integrate mechanisms against black hole attacks, forcing
cooperation between nodes and detecting failing behaviors. The nodes present in the clusters will work
more efficiently and the message passing within the nodes will also get more authenticated from the
cluster heads. The simulation of our proposed algorithm is carried out using NS2 network simulator by
evaluating some network performances such as average delay, throughput of communication and packets
loss.
CLUSTER BASED FIDELITY TO SECURE DSDV PROTOCOL AGAINST BLACK HOLE ATTACKSpijans
In this paper, we introduce and discuss an approach that will be used to secure the DSDV routing protocol in an ad-hoc network. Due to mobility and absence of infrastructure, nodes are more vulnerable to several malicious attacks. The secure routing is essential to transmit packets from source to the destination. Our approach consists to model and manage fidelity concept in an ad-hoc clustering architecture. Clustering makes it possible to group the mobile nodes and to send data simultaneously to the each group. Our security model thus aims to integrate mechanisms against black hole attacks, forcing cooperation between nodes and detecting failing behaviors. The nodes present in the clusters will work more efficiently and the message passing within the nodes will also get more authenticated from the cluster heads. The simulation of our proposed algorithm is carried out using NS2 network simulator by evaluating some network performances such as average delay, throughput of communication and packets loss.
CLUSTER BASED FIDELITY TO SECURE DSDV PROTOCOL AGAINST BLACK HOLE ATTACKSpijans
In this paper, we introduce and discuss an approach that will be used to secure the DSDV routing
protocol in an ad-hoc network. Due to mobility and absence of infrastructure, nodes are more vulnerable
to several malicious attacks. The secure routing is essential to transmit packets from source to the
destination. Our approach consists to model and manage fidelity concept in an ad-hoc clustering
architecture. Clustering makes it possible to group the mobile nodes and to send data simultaneously to
the each group. Our security model thus aims to integrate mechanisms against black hole attacks, forcing
cooperation between nodes and detecting failing behaviors. The nodes present in the clusters will work
more efficiently and the message passing within the nodes will also get more authenticated from the
cluster heads. The simulation of our proposed algorithm is carried out using NS2 network simulator by
evaluating some network performances such as average delay, throughput of communication and packets
loss.
This document discusses preventing and isolating black hole attacks in mobile ad hoc networks (MANETs) using alarm packets. It begins with background on MANETs and security attacks they face such as black hole attacks. Then, it reviews existing literature on detecting and preventing black hole attacks. Next, it describes how black hole attacks work in MANETs by having malicious nodes advertise short paths to destinations and drop packets. The proposed solution will use alarm packets to isolate and prevent black hole attacks in MANETs.
This document discusses various types of denial of service (DoS) attacks against wireless networks and techniques for detecting them. It describes three main types of DoS attacks: 1) selective forwarding attacks, where a compromised router selectively drops packets; 2) pollution attacks, where corrupted packets are injected into the network; and 3) jamming attacks, which block communication channels. It then explains detection techniques for each type of attack, including channel aware detection for selective forwarding, code guarding using digital signatures to detect pollution, and using honey nodes to detect jamming attacks. The objective is to survey issues related to different DoS attacks on wireless networks and present strategies for both attacking and defending against such threats.
Similar to PREDICTION OF MALICIOUS OBJECTS IN COMPUTER NETWORK AND DEFENSE (20)
Supermarket Management System Project Report.pdfKamal Acharya
Supermarket management is a stand-alone J2EE using Eclipse Juno program.
This project contains all the necessary required information about maintaining
the supermarket billing system.
The core idea of this project to minimize the paper work and centralize the
data. Here all the communication is taken in secure manner. That is, in this
application the information will be stored in client itself. For further security the
data base is stored in the back-end oracle and so no intruders can access it.
Prediction of Electrical Energy Efficiency Using Information on Consumer's Ac...PriyankaKilaniya
Energy efficiency has been important since the latter part of the last century. The main object of this survey is to determine the energy efficiency knowledge among consumers. Two separate districts in Bangladesh are selected to conduct the survey on households and showrooms about the energy and seller also. The survey uses the data to find some regression equations from which it is easy to predict energy efficiency knowledge. The data is analyzed and calculated based on five important criteria. The initial target was to find some factors that help predict a person's energy efficiency knowledge. From the survey, it is found that the energy efficiency awareness among the people of our country is very low. Relationships between household energy use behaviors are estimated using a unique dataset of about 40 households and 20 showrooms in Bangladesh's Chapainawabganj and Bagerhat districts. Knowledge of energy consumption and energy efficiency technology options is found to be associated with household use of energy conservation practices. Household characteristics also influence household energy use behavior. Younger household cohorts are more likely to adopt energy-efficient technologies and energy conservation practices and place primary importance on energy saving for environmental reasons. Education also influences attitudes toward energy conservation in Bangladesh. Low-education households indicate they primarily save electricity for the environment while high-education households indicate they are motivated by environmental concerns.
Gas agency management system project report.pdfKamal Acharya
The project entitled "Gas Agency" is done to make the manual process easier by making it a computerized system for billing and maintaining stock. The Gas Agencies get the order request through phone calls or by personal from their customers and deliver the gas cylinders to their address based on their demand and previous delivery date. This process is made computerized and the customer's name, address and stock details are stored in a database. Based on this the billing for a customer is made simple and easier, since a customer order for gas can be accepted only after completing a certain period from the previous delivery. This can be calculated and billed easily through this. There are two types of delivery like domestic purpose use delivery and commercial purpose use delivery. The bill rate and capacity differs for both. This can be easily maintained and charged accordingly.
Use PyCharm for remote debugging of WSL on a Windo cf5c162d672e4e58b4dde5d797...shadow0702a
This document serves as a comprehensive step-by-step guide on how to effectively use PyCharm for remote debugging of the Windows Subsystem for Linux (WSL) on a local Windows machine. It meticulously outlines several critical steps in the process, starting with the crucial task of enabling permissions, followed by the installation and configuration of WSL.
The guide then proceeds to explain how to set up the SSH service within the WSL environment, an integral part of the process. Alongside this, it also provides detailed instructions on how to modify the inbound rules of the Windows firewall to facilitate the process, ensuring that there are no connectivity issues that could potentially hinder the debugging process.
The document further emphasizes on the importance of checking the connection between the Windows and WSL environments, providing instructions on how to ensure that the connection is optimal and ready for remote debugging.
It also offers an in-depth guide on how to configure the WSL interpreter and files within the PyCharm environment. This is essential for ensuring that the debugging process is set up correctly and that the program can be run effectively within the WSL terminal.
Additionally, the document provides guidance on how to set up breakpoints for debugging, a fundamental aspect of the debugging process which allows the developer to stop the execution of their code at certain points and inspect their program at those stages.
Finally, the document concludes by providing a link to a reference blog. This blog offers additional information and guidance on configuring the remote Python interpreter in PyCharm, providing the reader with a well-rounded understanding of the process.
Mechatronics is a multidisciplinary field that refers to the skill sets needed in the contemporary, advanced automated manufacturing industry. At the intersection of mechanics, electronics, and computing, mechatronics specialists create simpler, smarter systems. Mechatronics is an essential foundation for the expected growth in automation and manufacturing.
Mechatronics deals with robotics, control systems, and electro-mechanical systems.
Build the Next Generation of Apps with the Einstein 1 Platform.
Rejoignez Philippe Ozil pour une session de workshops qui vous guidera à travers les détails de la plateforme Einstein 1, l'importance des données pour la création d'applications d'intelligence artificielle et les différents outils et technologies que Salesforce propose pour vous apporter tous les bénéfices de l'IA.
LLM Fine Tuning with QLoRA Cassandra Lunch 4, presented by Anant
PREDICTION OF MALICIOUS OBJECTS IN COMPUTER NETWORK AND DEFENSE
1. International Journal of Network Security & Its Applications (IJNSA), Vol.3, No.6, November 2011
DOI : 10.5121/ijnsa.2011.3612 161
PREDICTION OF MALICIOUS OBJECTS IN
COMPUTER NETWORK AND DEFENSE
Hemraj Sainia1
, T. C. Panda2
, Minaketan Panda3
1
Department of Computer Science & engineering,
Alwar Institute of Engineering & Technology, India
hemraj1977@yahoo.co.in
2
Department of Applied Mathematics,
Orissa Engineering College, Bhubaneswar, Orissa, India
tc_panda@yahoo.com
3
Engineer, Presales & Planning,
SPANCO TELE, Chandigarh, India
tominaketa@gmail.com
ABSTRACT
The paper envisages defense of critical information used in Computer Networks those are using Network
Topologies such as Star Topology. The first part of the paper develops a model to predict the malicious
traffic from the incoming traffic by using Black Scholes Equations. MATLAB is used to simulate the
developed model for realistic values. However, the second part of the problem provides a framework for
the treatment of predicted malicious traffic with detailed discussion of security measures.
KEYWORDS
Malicious Object, Black Scholes Equations, Star Topology, Anti Malicious Objects, System Hardening,
Friendly-Cooperative Framework
1. INTRODUCTION
Models for malicious object propagation in the computer networks are well discussed in
literature [1, 2, 3, 4, 5] but its propagation in network topology [6, 7, 8] is not adequately
documented. Network topology plays an important role for various factors such as speed of
propagation, server management, band width usage etc. Hence, before deciding the malicious
object’s dynamics, the network topology must be considered.
The paper uses star topology [9] for deciding the dynamics of malicious objects as it is
widely used network topology. A star topology is depicted in figure-1 where the server is
centrally located and connected with the outer world through ISP. The incoming traffic from
ISP having malicious objects and may enter into the network and destroy the network or steal
the information. The work presented in the paper predicts the malicious traffic by using the
Black Scholes Equations [10, 11], which are the most widely used equations to predict the
portfolio of financial market. Cyber Attacks are totally analogous to financial market. The
uncertainty of the option price in the financial market is similar to the uncertainty of the cyber
attacks. Other feature such as input to the financial market is similar to number of cyber
attackers, pattern of change of option price is similar to the change in the rate of malicious
objects, and the effect of strike price is compatible to the effect of Anti Malicious Software
(AMS) [12, 13] i.e. number of malicious objects already restricted by the AMS. In addition, the
2. International Journal of Network Security & Its Applications (IJNSA), Vol.3, No.6, November 2011
change in option price is affected by multi factors similar to the number of incoming malicious
objects in the cyber world and these are uncertain for every attack.
The predicted malicious traffic is isolated and cured by security measures and then
again put in to the regular traffic. In addition the information about the malicious traffic is
parallelly transferred to all the connected nodes so that they can make themselves self
[14, 15] enough to face the attack by using the friendly
In addition to Introduction, the paper envisages model formulation as section
friendly cooperative framework for processing the malicious information as section
finally the conclusion and future direction to the work as section
2. MODEL FORMULATION
The normal functioning of the server ensures the smoothness and malicious objects free
environment of the network as far as star topology is concerned. If the server gets down then all
the nodes or clients will also remain in idle condition, and as such cannot communicate each
other as well as with the outer world. Hence, sever is the only gateway for the communication.
The incoming traffic is in the form of packets with destination address. The server
receives the packets first and diverts the packets to the nodes as shown in the figure
International Journal of Network Security & Its Applications (IJNSA), Vol.3, No.6, November 2011
change in option price is affected by multi factors similar to the number of incoming malicious
objects in the cyber world and these are uncertain for every attack.
The predicted malicious traffic is isolated and cured by security measures and then
n put in to the regular traffic. In addition the information about the malicious traffic is
parallelly transferred to all the connected nodes so that they can make themselves self
[14, 15] enough to face the attack by using the friendly-cooperative-framework.
In addition to Introduction, the paper envisages model formulation as section
friendly cooperative framework for processing the malicious information as section
finally the conclusion and future direction to the work as section-IV.
Figure-1: Star Topology
ORMULATION
The normal functioning of the server ensures the smoothness and malicious objects free
environment of the network as far as star topology is concerned. If the server gets down then all
also remain in idle condition, and as such cannot communicate each
other as well as with the outer world. Hence, sever is the only gateway for the communication.
The incoming traffic is in the form of packets with destination address. The server
he packets first and diverts the packets to the nodes as shown in the figure-2.
International Journal of Network Security & Its Applications (IJNSA), Vol.3, No.6, November 2011
162
change in option price is affected by multi factors similar to the number of incoming malicious
The predicted malicious traffic is isolated and cured by security measures and then
n put in to the regular traffic. In addition the information about the malicious traffic is
parallelly transferred to all the connected nodes so that they can make themselves self-harden
In addition to Introduction, the paper envisages model formulation as section-II,
friendly cooperative framework for processing the malicious information as section-III and
The normal functioning of the server ensures the smoothness and malicious objects free
environment of the network as far as star topology is concerned. If the server gets down then all
also remain in idle condition, and as such cannot communicate each
other as well as with the outer world. Hence, sever is the only gateway for the communication.
The incoming traffic is in the form of packets with destination address. The server
2.
3. International Journal of Network Security & Its Applications (IJNSA), Vol.3, No.6, November 2011
Figure
Packet-1 is broadcasted to all the nodes after it is received by the server. The concern
node accepts it and other discard. By
suspected traffic and can take security measures. Signature based methods are the most widely
used methods to identify the malicious traffic. But if signature database is not having the
signature of incoming traffic then it cannot be detected. In such a situation we have to use some
of predictable approach, in our case we are using the Black Scholes equations to predict the
malicious traffic.
Let number of incoming packets at any instance t are N, from whic
may be a malicious packet. The connection from star network to its ISP is continuous and so
the packets are continuously transmitting to and fro.
Let the traffic is coming with
malicious and second non-malicious, so, we assume that the probability of being malicious is p
and non-malicious is q, p + q=1. For n spans of time
objects are to be find is given by
t n t= ∆
So, the number of total malicious/non
1 2 3( ) ...x t z z z z= + + + +
Where, iz (I = 1, 2, …, n) is the number of malicious/non
The expectation of total traffic is as under
1 2 3( ( )) ( ) ( ) ( ) ... ( )E x t E z E z E z E z= + + + +
Where,
( )iE z represents the ith time span expectation of being either malicious/
malicious.
International Journal of Network Security & Its Applications (IJNSA), Vol.3, No.6, November 2011
Figure-2: Packet transferring in star Topology
1 is broadcasted to all the nodes after it is received by the server. The concern
node accepts it and other discard. By analyzing the traffic pattern one can separate the
suspected traffic and can take security measures. Signature based methods are the most widely
used methods to identify the malicious traffic. But if signature database is not having the
ng traffic then it cannot be detected. In such a situation we have to use some
of predictable approach, in our case we are using the Black Scholes equations to predict the
Let number of incoming packets at any instance t are N, from which any random packet
may be a malicious packet. The connection from star network to its ISP is continuous and so
the packets are continuously transmitting to and fro.
Let the traffic is coming with /x t∆ ∆ speed. As the traffic is having two parts, one is
malicious, so, we assume that the probability of being malicious is p
malicious is q, p + q=1. For n spans of time t∆ , the total time of which the ma
objects are to be find is given by-
So, the number of total malicious/non-malicious objects in time t is ( )x t and given by
( ) ... nx t z z z z= + + + +
(I = 1, 2, …, n) is the number of malicious/non-malicious objects.
The expectation of total traffic is as under-
1 2 3( ( )) ( ) ( ) ( ) ... ( )nE x t E z E z E z E z= + + + +
represents the ith time span expectation of being either malicious/
International Journal of Network Security & Its Applications (IJNSA), Vol.3, No.6, November 2011
163
1 is broadcasted to all the nodes after it is received by the server. The concern
analyzing the traffic pattern one can separate the
suspected traffic and can take security measures. Signature based methods are the most widely
used methods to identify the malicious traffic. But if signature database is not having the
ng traffic then it cannot be detected. In such a situation we have to use some
of predictable approach, in our case we are using the Black Scholes equations to predict the
h any random packet
may be a malicious packet. The connection from star network to its ISP is continuous and so
speed. As the traffic is having two parts, one is
malicious, so, we assume that the probability of being malicious is p
, the total time of which the malicious
(a)
and given by-
(1)
(2)
represents the ith time span expectation of being either malicious/non-
4. International Journal of Network Security & Its Applications (IJNSA), Vol.3, No.6, November 2011
164
Above equation (2) can be rewritten as-
1
( ( ))
n
i i
i
E x t p x
=
= ∑
(3)
Now,
( )iE z will be given by-
( ) ( ) ( )iE z p x q x= ∆ + − ∆
( )p q x= − ∆ (4)
Where, i=1, 2, …, n so, equation-(3) can be expended by using equation-(4) as follows-
( ( )) ( ) ( ) ... ( )E x t p q x p q x p q x− − ∆ + − ∆ + + − ∆
( ( )) ( )E x t n p q x= − ∆ (5)
The variance of the traffic is calculated as follows, which represents the behavior of
traffic of being malicious/non-malicious.
2 2 2
( ) ( ( )) ( ( ))Var x E x E xσ= = − (6)
Equation-(6) leads that
2 2
( ) ( ( )) ( ( ))i i iVar z E z E z= −
2 2 2
( ) ( ( ) (( ) )p x q x p q x= ∆ + − ∆ − − ∆
2
4 ( )pq x= ∆
0 0
( ) ( )
n n
i i
i i
Var x Var x
= =
=∑ ∑
Or
2
( ( )) 4 ( )Var x t npq x= ∆ (7)
Equation-(5) represents the instantaneous expectation. Now,
0
( )
inst t
p q x
E Limit
t
∆ →
− ∆
=
∆ (8)
Thus from equation-(a) and equation-(8) we have-
5. International Journal of Network Security & Its Applications (IJNSA), Vol.3, No.6, November 2011
165
( )
( ( )) .t o t o
t p q
Limit E x t Limit t
t
µ∆ → ∆ →
−
= =
∆ (9)
as the traffic is continuous to the network.
Similarly the instantaneous variance can be given as under-
2
2
0
4 ( )
t
pq x
Limit
t
σ ∆ →
∆
=
∆ or
2 2
0( ( )) 4. . ( )t
t
Var x t Limit pq x t
t
σ∆ →= ∆ =
∆ (10)
Initially there are no malicious objects in the network and the possibility of malicious
objects in the further independently incremented time span does not depend on each other. In
addition we assuming that the value of malicious objects at time t i.e. ( )x t follows normal
distribution [16] with mean .tµ or
2
tσ , which are derived in equation-(9) and equation –(10)
separately.
In other words, the variable ( )x t is a stochastic process with respect to time t.
Now, the traffic is continuous and represented by Standard Normal distribution, which
is given by-
( )x t t
t
µ
σ
−
Φ =
(11)
Φ is a Standard Normal Distribution with mean zero and variance one i.e. ( ) 0E Φ =
and ( ) 0Var Φ = So, from equation-(11)-
( )x t t tµ σ= + Φ
( ) ( ) ( )x t t tµ σω⇒ = + (12)
If 0µ = and 1σ = then
( ) ( )x t tω= , where, ( )tω is a wiener’s process.
Now, as ( )x t , the number of malicious objects in time t, is a stochastic process and
hence ( )x t is said to follow a Geometric Brownian Motion (GBM) [17], which satisfies the
following stochastic deferential equation-
( ) ( ) ( ( ))dx t x t dt x t dµ σ ω= + (13)
6. International Journal of Network Security & Its Applications (IJNSA), Vol.3, No.6, November 2011
166
Additionally, the stochastic process ( )x t is an ITO-Process and satisfies the below
equation-
( ) ( ( ), ) ( ( ), )dx t x t t dt x t t dµ σ ω= + (14)
Now, the evolution of malicious objects in the network traffic follows GBM in a long
normal distribution form i.e. the deviation in general behavior is very less within the range say,
5%± .
The change of the incoming malicious objects in the short period of the computation of
the number of incoming malicious objects in the traffic is almost constant.
There is no extra load of malicious objects in the system as the AMS is running to
overcome of it.
By above conclusions, we can say the number of malicious objects represented by
( , )V S t where, S is a stochastic process [18] which represents the last counted number of
malicious objects.
Let present time is t and the number of malicious objects in the network is π which is
given by-
sV ∆−=π , (15)
Where V is the maximum possible value of ( , )V S t and s∆ is the small value changed
in the number of malicious objects.
After time period dt the number of malicious objects will be increased by dπ and
becomes dπ π+ i.e.
( )d V s dπ π π+ = − ∆ +
( ) ( )V dV s ds= + − ∆ + (16)
The change in the value of the number of malicious objects in time dt is πd and given
by-
( )d dπ π π π= + − (17)
By equation (15) to (16)-
d dV dsπ = − ∆ (18)
Since V satisfies GBM. Hence by ITO’s lemma is-
7. International Journal of Network Security & Its Applications (IJNSA), Vol.3, No.6, November 2011
167
2
2 2
2
1
2
V V V V
dV s s t sdx
t s s s
σ µ σ
σ
∂ ∂ ∂ ∂
= + + ∂ +
∂ ∂ ∂ (19)
The solution of equation – (19) can be obtained by the following process:-
Let there are k time spans of duration tδ in the total time T to compute the total number
of malicious objects and the Malicious Object Updating (MOU) Step as sδ such that
T
t
k
δ =
,
iS
s
I
δ =
, where 0 i I≤ ≤ .
So, we can get the solution to obtain the number of malicious objects,
( , ) k
i k iV S t V≡
for the already identified malicious objects by AMS, iS
and for kth time span of the total time,
where 0 i I≤ ≤ & 0 k K≤ ≤ , which can be obtained by the following equation-(20).
1
2 2 1 1
2
1 1
21
2 ( )
0
2
k k k k k
i i i i i
i
k k
ki i
i i
V V V V V
S
t s
V V
S V
s
σ
δ δ
µ µ
δ
+
+ −
+ −
− − +
+ +
−
− =
(20)
Where i=1, 2, …, I-1 and k=0, 1, 2, …., K-1
1
1 1
k k k k
i i i i i i iV AV BV CV+
− += + + (21)
Where
,i iA B
and iC
are constants given by following equation-(22).
2 2
2 2
2 2
;
;
2
i
i
i
T
A I I
K
K T I T
B
K
T
C I I
K
σ µ
σ µ
σ µ
= −
− −
=
= +
(22)
3. DEFENDING MECHANISM
Figure-3 shows the MATLAB simulation of the equation-(20) for the number of
malicious objects already identified by AMS as 10.
8. International Journal of Network Security & Its Applications (IJNSA), Vol.3, No.6, November 2011International Journal of Network Security & Its Applications (IJNSA), Vol.3, No.6, November 2011
Figure-3: Relation among s, S and t
Figure-4: Traffic analysis algorithm
International Journal of Network Security & Its Applications (IJNSA), Vol.3, No.6, November 2011
168
9. International Journal of Network Security & Its Applications (IJNSA), Vol.3, No.6, November 2011
As soon as the prediction of the number of malicious objects increases by a threshold
value, the traffic becomes the suspected one and may be isolated either to ign
the security measures over it as shown in the figure
The threshold value used in figure
represents the maximum number of malicious objects counted at any moment where it goes up
from the maximum number of malicious objects already blocked by AMS.
4. FRIENDLY COOPERATIVE
MALICIOUS INFORMATION
As the suspected traffic is isolated for its diagnostic purpose and once it got a
confirmation to be the malicious then its s
connected nodes. This information is communicated by using friendly cooperative framework
as shown in figure-5.
Figure-5: Friendly cooperative framework for information transfer to all directly
5. CONCLUSION AND FUTURE
The Black Scholes equations are used to predict the behavior of network traffic and the
simulation for already identified malicious objects by AMS at a specific time interval is made,
which is more realistic in the real time scenario. On the basis of simulated results a proposal is
provided to identify the traffic in which the possibility of the number of malicious objects is
beyond a threshold value and will be thus termed as suspected traffic. This suspect
then treated through security measures to make it a regular traffic. In addition, a framework is
also provided to propagate the generated malicious information to all the directly connected
nodes or friendly nodes.
International Journal of Network Security & Its Applications (IJNSA), Vol.3, No.6, November 2011
As soon as the prediction of the number of malicious objects increases by a threshold
value, the traffic becomes the suspected one and may be isolated either to ignore or to deploy
the security measures over it as shown in the figure-4.
The threshold value used in figure-4 can be easily computed from the figure
represents the maximum number of malicious objects counted at any moment where it goes up
ximum number of malicious objects already blocked by AMS.
OOPERATIVE FRAMEWORK FOR PROCESSING THE
NFORMATION
As the suspected traffic is isolated for its diagnostic purpose and once it got a
confirmation to be the malicious then its signature and source has to be spread to all the
connected nodes. This information is communicated by using friendly cooperative framework
5: Friendly cooperative framework for information transfer to all directly
connected nodes.
UTURE DIRECTION TO THE WORK
The Black Scholes equations are used to predict the behavior of network traffic and the
simulation for already identified malicious objects by AMS at a specific time interval is made,
c in the real time scenario. On the basis of simulated results a proposal is
provided to identify the traffic in which the possibility of the number of malicious objects is
beyond a threshold value and will be thus termed as suspected traffic. This suspected traffic is
then treated through security measures to make it a regular traffic. In addition, a framework is
also provided to propagate the generated malicious information to all the directly connected
International Journal of Network Security & Its Applications (IJNSA), Vol.3, No.6, November 2011
169
As soon as the prediction of the number of malicious objects increases by a threshold
ore or to deploy
4 can be easily computed from the figure-3. It
represents the maximum number of malicious objects counted at any moment where it goes up
ROCESSING THE
As the suspected traffic is isolated for its diagnostic purpose and once it got a
ignature and source has to be spread to all the
connected nodes. This information is communicated by using friendly cooperative framework
5: Friendly cooperative framework for information transfer to all directly
The Black Scholes equations are used to predict the behavior of network traffic and the
simulation for already identified malicious objects by AMS at a specific time interval is made,
c in the real time scenario. On the basis of simulated results a proposal is
provided to identify the traffic in which the possibility of the number of malicious objects is
ed traffic is
then treated through security measures to make it a regular traffic. In addition, a framework is
also provided to propagate the generated malicious information to all the directly connected
10. International Journal of Network Security & Its Applications (IJNSA), Vol.3, No.6, November 2011
170
References
[1] Ossama A. Toutonji, Seong-Moo Yoo, and Moongyu Park (2010), “Propagation modeling and
analysis of network worm attack”, In Proceedings of the Sixth Annual Workshop on Cyber Security
and Information Intelligence Research (CSIIRW '10), ACM, New York, NY, USA, , Article 48, 4
pages. DOI=10.1145/1852666.1852719 http://doi.acm.org/10.1145/18526661852719
[2] T. R. Tidwell, K. Fitch Larson, J. Hale (2001), “Modeling Internet Attacks”, Proceedings of
the IEEE Workshop on Information Assurance and Security, Unites States Military Academy,
West Point, NY.
[3] Hemraj Saini, Dinesh Saini (2007), “Malicious Object dynamics in the presence of Anti Malicious
Software”, European Journal of Scientific Research, volume-18, Issue-3, pp.-491-499
[4] Hemraj Saini (2009), “Queuing Model for Malicious Attack Detection”, The Icfai University
Journal of Information Technology, 5(2) 16-28
[5] Hemraj Saini, Dinesh Saini (2008), “VAIN: A Stochastic Model for Dynamics of Malicious
Objects”, ICFAI journal of Systems Management, Vol. 6, No. 1, pp. 14-28
[6] Jean Wairand (1998), “Communication Networks (A first Course”), Second Edition, WCB/McGraw
Hill.
[7] Behrouz, Forouzan (2001), “Introduction to Data Communication and Networking”, 2nd
Edition,
TMH.
[8] Andrew S Tanenbaum, Computer Networks, 4th
, (2002), Prentice Hall PTR.
[9] FitzGerald, Jerry, Alan Dennis (1999), “Business Data Communications and Networking”, 6th
ed.,
New York: John Wiley & Sons.
[10] R. Company, E. Navarro, J. Ramón Pintos, E. Ponsoda (2008), “Numerical solution of linear and
nonlinear Black-Scholes option pricing equations” Comput. Math. Appl., 56, 3 813-821. DOI=
http://dx.doi.org/10.1016/j.camwa.2008. 02.010
[11] G. Barles, H. M. Soner (1998), “Option pricing with transaction costs and a nonlinear Black-
Scholes equation”. Finance Stochast., v2. 369-397.
[12] K. Lakkaraju, and A. Slagell (2008), “Evaluating the utility of anonymized network traces for
intrusion detection”, In Proceedings of the 4th international Conference on Security and Privacy in
Communication Netowrks (Istanbul, Turkey, September 22 - 25. SecureComm '08. ACM, New
York, NY, 1-8. DOI= http://doi.acm.org /10.1145/1460877.1460899
[13] Nick Clemente (2007), “System Hardening The Process of Defending and Securing Today's
Information Systems”, Journal of Security Education, 2(4) 89 – 118
[14] Hemraj Saini, Dinesh Kumar Saini (2007), “Proactive cyber Defense and Reconfigurable
Framework of Cyber Security”, International journal named International Review on Computer and
Software, 2(2) 89-97
[15] H. Saini, D. K. Saini (2006), “Cyber Defense Architecture in Campus Wide Network”, 3rd
International Conference on Quality, Reliability and INFOCOM Technology (Trends and Future),
Indian National Science Academy, New Delhi (INDIA), 2-4 December, Souvenir pp. 62
[16] M. G. Kendall, A. Stuart (1977), “The advanced theory of statistics”, Griffin.
[17] A. Borodin, P. Salminen (2002), Handbook of Brownian Motion - Facts and Formulae, 2nd
Edn.,
Birkhauser Verlag.
[18] L. Arnold (1974), “Stochastic differential equations”, Wiley (Translated from Russian).
11. International Journal of Network Security & Its Applications (IJNSA), Vol.3, No.6, November 2011
Hemraj Saini is a faculty member in the Department of Computer Science &
Engineering, Alwar Institute of Engineering & Technology, Alwar,
He received his B.Tech. in CS&E from NIT Hamirpur (H.P.) and M.Tech. degree in
Information Technology from the Pun
respectively. He has submitted his Ph.D. in Utkal University, Vani Vihar,
Bhubaneswar. His main professional interests are in Mathematical Modeling,
Simulation, Cyber Defense, Network Security and Intelligen
T. C. Panda is a Retd. Professor of Mathematics (Berhampur University, India),
Founder Professor of Mathematics & Computer Sc. (Mizoram Central University,
India) and currently associated as Principal with Orissa Engineering College,
Bhubaneswar, Orissa, India-752050. He received his Masters from Banaras Hindu
University in 1968 and Ph. D. from Berhampur University in 1975. His main interests
are Fluid Dynamics, Air Pollution Modeling, Monsoon Dynamics, Numerical Weather
Prediction, Meso-Scale Modeling, Remote Sensing Techniques, Numerical Solution of
Partial Differential Equations and Cyber Defense.
Minaketan Panda is an Engineer SPANCO
received his B.Tech. in E&TCE from ABIT, Cuttack (Orissa.) and M.Tech.
Computer Science & Engineering from the IIIT, Bhubaneswar, Orissa in 2005 and
2009 respectively. His main professional interests are in Networking, Enterprise
Resource Planning, mobile Computing, Cyber Defense, Network Security and
Intelligent Techniques.
International Journal of Network Security & Its Applications (IJNSA), Vol.3, No.6, November 2011
is a faculty member in the Department of Computer Science &
Alwar Institute of Engineering & Technology, Alwar, India – 752050.
He received his B.Tech. in CS&E from NIT Hamirpur (H.P.) and M.Tech. degree in
Information Technology from the Punjabi University Patiala, Punjab in 1999 and 2005
respectively. He has submitted his Ph.D. in Utkal University, Vani Vihar,
Bhubaneswar. His main professional interests are in Mathematical Modeling,
Simulation, Cyber Defense, Network Security and Intelligent Techniques
a Retd. Professor of Mathematics (Berhampur University, India),
Founder Professor of Mathematics & Computer Sc. (Mizoram Central University,
India) and currently associated as Principal with Orissa Engineering College,
752050. He received his Masters from Banaras Hindu
University in 1968 and Ph. D. from Berhampur University in 1975. His main interests
are Fluid Dynamics, Air Pollution Modeling, Monsoon Dynamics, Numerical Weather
le Modeling, Remote Sensing Techniques, Numerical Solution of
Partial Differential Equations and Cyber Defense.
is an Engineer SPANCO-TELE, a multinational company. He
received his B.Tech. in E&TCE from ABIT, Cuttack (Orissa.) and M.Tech. degree in
Computer Science & Engineering from the IIIT, Bhubaneswar, Orissa in 2005 and
2009 respectively. His main professional interests are in Networking, Enterprise
Resource Planning, mobile Computing, Cyber Defense, Network Security and
International Journal of Network Security & Its Applications (IJNSA), Vol.3, No.6, November 2011
171