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.
PERUSAL OF INTRUSION DETECTION AND PREVENTION SYSTEM ON A MANET WITH BLACK HO...ijsptm
MANET is a self configuring network of nodes which is a wireless . The nodes in this network move
randomly .Mobility of nodes is more. The nodes are dynamic and infrastructure less ,self maintainable. In
MANET there are many types of security attacks like Blackhole, greyhole attack, wormhole, jellyfish etc.
When the MANET is under blackhole attack there is a loss of energy which is high at the node resulting in
loss of battery backup and also excess of bandwidth may be consumed by the attacker. The attacker is an
insider. Among various mobility models to generate mobility patterns the Random waypoint mobility
model is used .To solve these issues an IDPS framework for MANET using image processing techniques
under blackhole attack is proposed to detect the blackhole attack RREP by providing security services like
authentication and confidentiality.
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
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
BER ANALYSIS FOR DOWNLINK MIMO-NOMA SYSTEMS OVER RAYLEIGH FADING CHANNELSIJCNCJournal
The Multiple-input multiple-output (MIMO) technique combined with non-orthogonal multiple access (NOMA) has been considered to enhance total system performance. This paper studies the bit error rate of two-user power-domain NOMA systems using successive interference cancellation receivers, with zeroforcing equalization over quasi-static Rayleigh fading channels. Successive interference cancellation technique at NOMA receivers has been the popular research topic due to its simple implementation, despite its vulnerability to error propagation. Closed-form expressions are derived for downlink NOMA in single-input single-output and uncorrelated quasi-static MIMO Rayleigh fading channel. Analytical results are consolidated with Monte Carlo simulation.
PERFORMANCE STUDY AND SIMULATION OF AN ANYCAST PROTOCOL FOR WIRELESS MOBILE A...ijwmn
This paper conducts a detailed simulation study of stateless anycast routing in a mobile wireless ad hoc
network. The model covers all the fundamental aspects of such networks with a routing mechanism using
a scheme of orientation-dependent inter-node communication links. The simulation system Winsim is used
which explicitly represents parallelism of events and processes in the network. The purpose of these
simulations is to investigate the effect of node’s maximum speed, and different TTL over the network
performance under two different scenarios. Simulation study investigates five practically important
performance metrics of a wireless mobile ad hoc network and shows the dependence of this metrics on
the transmission radius, link availability, and maximal possible node speed
PERUSAL OF INTRUSION DETECTION AND PREVENTION SYSTEM ON A MANET WITH BLACK HO...ijsptm
MANET is a self configuring network of nodes which is a wireless . The nodes in this network move
randomly .Mobility of nodes is more. The nodes are dynamic and infrastructure less ,self maintainable. In
MANET there are many types of security attacks like Blackhole, greyhole attack, wormhole, jellyfish etc.
When the MANET is under blackhole attack there is a loss of energy which is high at the node resulting in
loss of battery backup and also excess of bandwidth may be consumed by the attacker. The attacker is an
insider. Among various mobility models to generate mobility patterns the Random waypoint mobility
model is used .To solve these issues an IDPS framework for MANET using image processing techniques
under blackhole attack is proposed to detect the blackhole attack RREP by providing security services like
authentication and confidentiality.
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
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
BER ANALYSIS FOR DOWNLINK MIMO-NOMA SYSTEMS OVER RAYLEIGH FADING CHANNELSIJCNCJournal
The Multiple-input multiple-output (MIMO) technique combined with non-orthogonal multiple access (NOMA) has been considered to enhance total system performance. This paper studies the bit error rate of two-user power-domain NOMA systems using successive interference cancellation receivers, with zeroforcing equalization over quasi-static Rayleigh fading channels. Successive interference cancellation technique at NOMA receivers has been the popular research topic due to its simple implementation, despite its vulnerability to error propagation. Closed-form expressions are derived for downlink NOMA in single-input single-output and uncorrelated quasi-static MIMO Rayleigh fading channel. Analytical results are consolidated with Monte Carlo simulation.
PERFORMANCE STUDY AND SIMULATION OF AN ANYCAST PROTOCOL FOR WIRELESS MOBILE A...ijwmn
This paper conducts a detailed simulation study of stateless anycast routing in a mobile wireless ad hoc
network. The model covers all the fundamental aspects of such networks with a routing mechanism using
a scheme of orientation-dependent inter-node communication links. The simulation system Winsim is used
which explicitly represents parallelism of events and processes in the network. The purpose of these
simulations is to investigate the effect of node’s maximum speed, and different TTL over the network
performance under two different scenarios. Simulation study investigates five practically important
performance metrics of a wireless mobile ad hoc network and shows the dependence of this metrics on
the transmission radius, link availability, and maximal possible node speed
A black-hole attack in the Mobile Ad-hoc NETwork (MANET) is an attack occurs due to malicious nodes,
which attracts the data packets by falsely advertising a fresh route to the destination. In this paper, we
present a clustering approach in Ad-hoc On-demand Distance Vector (AODV) routing protocol for the
detection and prevention of black-hole attack in MANETs. In this approach every member of the cluster will
ping once to the cluster head, to detect the peculiar difference between the number of data packets received
and forwarded by the node. If anomalousness is perceived, all the nodes will obscure the malicious nodes
from the network.
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.
THE IMPACT OF MOBILE NODES ARRIVAL PATTERNS IN MANETS USING POISSON MODELSIJMIT JOURNAL
Mobile Ad hoc Networks (MANETs) are dynamic networks populated by mobile stations, or mobile nodes
(MNs). Specifically, MANETs consist of a collection of nodes randomly placed in a line (not necessarily
straight). MANETs do appear in many real-world network applications such as a vehicular MANETs built
along a highway in a city environment or people in a particular location. MNs in MANETs are usually
laptops, PDAs or mobile phones. These devices may use Bluetooth and/or IEEE 802.11 (Wi-Fi) network
interfaces and communicate in a decentralized manner. Mobility is a key feature of MANETs. Each node
may work as a router and the network can dynamically change with time; when new nodes can join, and
other nodes can leave the network.
This paper presents comparative results that have been carried out via Matlab software simulation. The
study investigates the impact of mobile nodes’ parameters such as the speed, the arrival rate and the size of
mobile nodes in a given area using Poisson distribution. The results have indicated that mobile nodes’
arrival rates may have influence on MNs population (as a larger number) in a location.
PREDICTION OF MALICIOUS OBJECTS IN COMPUTER NETWORK AND DEFENSEIJNSA Journal
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.
S IMULATION B ASED S TUDY OF C OOPERATIVE B LACK H OLE A TTACK R ESOLU...pijans
An Ad hoc Network is a pool of wireless mobile node
s energetically forming a network without the use o
f
any pre-accessible network infrastructure or centra
lized administrator. These nodes communicate with
each other by hop-to-hop communication. This dynami
c topology of mobile ad-hoc networks (MANETs)
allows nodes to get attached and leave the network
at any second of time. Thus MANET can be used in a
variety of fields. Current MANETs are designed prim
ary for military utility. This generic characterist
ic of
MANET has rendered its vulnerability to security at
tacks. Due to which unprotected attacks of the
malicious nodes can occur at any time. This paper f
ocuses on one such attack known as “Black hole
attack” and the routing protocol being used here is
AODV
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.
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;
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
The Quality of the New Generator Sequence Improvent to Spread the Color Syste...TELKOMNIKA JOURNAL
This paper shows a new technic applicable for the digital devices that are the result of the finite’s
effect precision in the chaotic dynamics used in the coupled technic and the chaotic map’s perturbation
technics used for the generation of a Pseudo-Random Number Generator (PRNGs).The use of the
pseudo- chaotic sequences coupled to the orbit perturbation method in the chaotic logistic map and the
NewPiece-Wise Linear Chaotic Map (NPWLCM). The pseudo random number generator’s originality
proposed from the perturbation of the chaotic recurrence. Furthermore the outputs of the binary sequences
with NPWLCM are reconstructed conventionally with the Bernoulli’s sequences shifts map to change the
shapes with the bitwise permetation then the results in simulation are shown in progress.After being
perturbed, the chaotic system can generate the chaotic binary sequences in uniform distribution and the
statistical properties invulnerable analysis. This generator also has many advantages in the possible useful
applications of spread spectrum digitalimages, such as sensitive secret keys, random uniform distribution
of pixels in Crypto system in secure and synchronize communication.
A novel cluster based wormhole avoidance algorithm for mobile adhoc networkscsandit
A severe type of network layer security attack called Wormhole attack can occur in MANET,
during which 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 hierarchical cluster based Wormhole attack avoidance technique to avoid such
scenario. 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.
FUZZY LOGIC-BASED EFFICIENT MESSAGE ROUTE SELECTION METHOD TO PROLONG THE NET...IJCNCJournal
Recently, sensor networks have been used in a wide range of applications, and interest in sensor node
performance has increased. A sensor network is composed of tiny nodes with limited resources. The sensor
network communicates between nodes in a configured network through self-organization. An energyefficient security protocol with a hierarchy structure with various advantages has been proposed to
prolong the network lifetime of sensor networks. But due to structural problems in traditional protocols,
nodes located upstream tend to consume relatively high energy compared to other nodes. A network
protocol should be considered to provide minimal security and efficient allocation of energy consumption
by nodes to increase the network lifetime. In this paper, we introduce a solution to solve the bottleneck
problem through an efficient message route selection method. The proposed method selects an efficient
messaging path using GA and fuzzy logic composed of multiple rules. Message route selection plays an
important role in controlling the load balancing of nodes. A principal benefit of the proposed scheme is the
potential portability of the clustering-based protocol. In addition, the proposed method is updated to find
the optimal path through the genetic algorithm to respond to various environments. We demonstrated the
effectiveness of the proposed method through an experiment in which the proposed method is applied to a
probabilistic voting-based filtering scheme that is one of the cluster-based security schemes.
SYMMETRIC KEY MANAGEMENT SCHEME FOR HIERARCHICAL WIRELESS SENSOR NETWORKSIJNSA Journal
Wireless Sensor Networks (WSNs) are critical component in many applications that used for data collection. Since sensors have limited resource, Wireless Sensor Networks are more vulnerable to attacks than other wireless networks. It is necessary to design a powerful key management scheme for WSNs and take in consideration the limited characteristics of sensors. To achieve security of communicated data in the network and to extend the WSNs lifetime; this paper proposes a new scheme called Symmetric Key Management Scheme (SKMS). SKMS used Symmetric Key Cryptography that depends only on a Hash function and XOR operation for securing homogeneous and heterogeneous hierarchical WSNs. Symmetric Key Cryptography is less computation than Asymmetric Key Cryptography. Simulation results show that the proposed scheme provides security, save the energy of sensors with low computation overhead.
International Journal of Computational Engineering Research(IJCER)ijceronline
International Journal of Computational Engineering Research(IJCER) is an intentional online Journal in English monthly publishing journal. This Journal publish original research work that contributes significantly to further the scientific knowledge in engineering and Technology.
Spectrum requirement estimation for imt systems in developing countriesijdpsjournal
In this paper
we analyze the methodology develope
d by
the
International Telecommunication Union (ITU)
for
estimat
ing
the spectrum requirement for International Mobile Telecommunications (IMT) systems.
The
International
Telecommunication Union estimates spectrum requirement
s
by following ITU
-
R
-
Rec.M1768.
Although
this
methodology is adopted by ITU
-
R
,
there are
discrepancies
for
estimat
ing
the spectrum
requirement for developing countries. ITU estimates the spectrum requirement by considering technica
l
and market
parameters
that
were provided by the
most de
veloped countries with high income and high
development index
. Developed countries have
a very rapid expansible telecom
market
due to the high level
of penetration
,
dominant
user density
and usage of high
-
volume multimedia services.
In contrast,
developing
countries
use less bandwidth
-
intensive services such as voice communication,
low rate data
,
low and medium multimedia.
However,
while
the input parameters are adequate for developed countries
,
they
do not reflect the status of developing countries. For th
is reason
the
ITU spectrum estimation
overestimate
s
the exact requirement
s
of spectrum for IMT systems for developing countries. This paper
presents an approach based on the technical and market related parameters, which is thought to be
applicable
for
ove
rcom
ing
the shortcomings of
the
current ITU methodology in estimatin
g
the spectrum
requirement
for developing
countries like Bangladesh
HIGHLY SCALABLE, PARALLEL AND DISTRIBUTED ADABOOST ALGORITHM USING LIGHT WEIG...ijdpsjournal
AdaBoost is an important algorithm in machine learning and is being widely used in object detection.
AdaBoost works by iteratively selecting the best amongst weak classifiers, and then combines several weak
classifiers to obtain a strong classifier. Even though AdaBoost has proven to be very effective, its learning
execution time can be quite large depending upon the application e.g., in face detection, the learning time
can be several days. Due to its increasing use in computer vision applications, the learning time needs to
be drastically reduced so that an adaptive near real time object detection system can be incorporated. In
this paper, we develop a hybrid parallel and distributed AdaBoost algorithm that exploits the multiple
cores in a CPU via light weight threads, and also uses multiple machines via a web service software
architecture to achieve high scalability. We present a novel hierarchical web services based distributed
architecture and achieve nearly linear speedup up to the number of processors available to us. In
comparison with the previously published work, which used a single level master-slave parallel and
distributed implementation [1] and only achieved a speedup of 2.66 on four nodes, we achieve a speedup of
95.1 on 31 workstations each having a quad-core processor, resulting in a learning time of only 4.8
seconds per feature.
Survey comparison estimation of various routing protocols in mobile ad hoc ne...ijdpsjournal
MANET is
an autonomous system of mobile nodes attached by wireless links. It represents
a complex and
dynamic distributed systems that consist of mobile wireless nodes that can freely self organize into
an ad
-
hoc network topology. The devices in the network may hav
e limited transmission
range therefore multiple
hops may be needed by one node to transfer data to another node in network. This leads to the need f
or an
effective routing protocol. In this paper we study various classifications of routing protocols and
th
eir types
for wireless mobile ad
-
hoc networks like DSDV, GSR, AODV, DSR, ZRP, FSR, CGSR, LAR, and Geocast
Protocols. In this paper we also compare different routing proto
cols on based on a given set of
parameters
Scalability, Latency, Bandwidth, Control
-
ov
erhead, Mobility impact
Management of context aware software resources deployed in a cloud environmen...ijdpsjournal
In cloud computing environments, context information is continuously created by context providers and
consumed by the applications on mobile devices. An important characteristic of cloud-based context aware
services is meeting the service level agreements (SLAs) to deliver a certain quality of service (Qos), such as
guarantees on response time or price. The response time to a request of context-aware software is affected
by loading extensive context data from multiple resources on the chosen server. Therefore, the speed of
such software would be decreased during execution time. Hence, proper scheduling of such services is
indispensable because the customers are faced with time constraints. In this research, a new scheduling
algorithm for context aware services is proposed which is based on classifying similar context consumers
and dynamically scoring the requests to improve the performance of the server hosting highly-requested
context-aware software while reducing costs of cloud provider. The approach is evaluated via simulation
and comparison with gi-FIFO scheduling algorithm. Experimental results demonstrate the efficiency of the
proposed approach.
A black-hole attack in the Mobile Ad-hoc NETwork (MANET) is an attack occurs due to malicious nodes,
which attracts the data packets by falsely advertising a fresh route to the destination. In this paper, we
present a clustering approach in Ad-hoc On-demand Distance Vector (AODV) routing protocol for the
detection and prevention of black-hole attack in MANETs. In this approach every member of the cluster will
ping once to the cluster head, to detect the peculiar difference between the number of data packets received
and forwarded by the node. If anomalousness is perceived, all the nodes will obscure the malicious nodes
from the network.
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.
THE IMPACT OF MOBILE NODES ARRIVAL PATTERNS IN MANETS USING POISSON MODELSIJMIT JOURNAL
Mobile Ad hoc Networks (MANETs) are dynamic networks populated by mobile stations, or mobile nodes
(MNs). Specifically, MANETs consist of a collection of nodes randomly placed in a line (not necessarily
straight). MANETs do appear in many real-world network applications such as a vehicular MANETs built
along a highway in a city environment or people in a particular location. MNs in MANETs are usually
laptops, PDAs or mobile phones. These devices may use Bluetooth and/or IEEE 802.11 (Wi-Fi) network
interfaces and communicate in a decentralized manner. Mobility is a key feature of MANETs. Each node
may work as a router and the network can dynamically change with time; when new nodes can join, and
other nodes can leave the network.
This paper presents comparative results that have been carried out via Matlab software simulation. The
study investigates the impact of mobile nodes’ parameters such as the speed, the arrival rate and the size of
mobile nodes in a given area using Poisson distribution. The results have indicated that mobile nodes’
arrival rates may have influence on MNs population (as a larger number) in a location.
PREDICTION OF MALICIOUS OBJECTS IN COMPUTER NETWORK AND DEFENSEIJNSA Journal
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.
S IMULATION B ASED S TUDY OF C OOPERATIVE B LACK H OLE A TTACK R ESOLU...pijans
An Ad hoc Network is a pool of wireless mobile node
s energetically forming a network without the use o
f
any pre-accessible network infrastructure or centra
lized administrator. These nodes communicate with
each other by hop-to-hop communication. This dynami
c topology of mobile ad-hoc networks (MANETs)
allows nodes to get attached and leave the network
at any second of time. Thus MANET can be used in a
variety of fields. Current MANETs are designed prim
ary for military utility. This generic characterist
ic of
MANET has rendered its vulnerability to security at
tacks. Due to which unprotected attacks of the
malicious nodes can occur at any time. This paper f
ocuses on one such attack known as “Black hole
attack” and the routing protocol being used here is
AODV
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.
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;
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
The Quality of the New Generator Sequence Improvent to Spread the Color Syste...TELKOMNIKA JOURNAL
This paper shows a new technic applicable for the digital devices that are the result of the finite’s
effect precision in the chaotic dynamics used in the coupled technic and the chaotic map’s perturbation
technics used for the generation of a Pseudo-Random Number Generator (PRNGs).The use of the
pseudo- chaotic sequences coupled to the orbit perturbation method in the chaotic logistic map and the
NewPiece-Wise Linear Chaotic Map (NPWLCM). The pseudo random number generator’s originality
proposed from the perturbation of the chaotic recurrence. Furthermore the outputs of the binary sequences
with NPWLCM are reconstructed conventionally with the Bernoulli’s sequences shifts map to change the
shapes with the bitwise permetation then the results in simulation are shown in progress.After being
perturbed, the chaotic system can generate the chaotic binary sequences in uniform distribution and the
statistical properties invulnerable analysis. This generator also has many advantages in the possible useful
applications of spread spectrum digitalimages, such as sensitive secret keys, random uniform distribution
of pixels in Crypto system in secure and synchronize communication.
A novel cluster based wormhole avoidance algorithm for mobile adhoc networkscsandit
A severe type of network layer security attack called Wormhole attack can occur in MANET,
during which 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 hierarchical cluster based Wormhole attack avoidance technique to avoid such
scenario. 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.
FUZZY LOGIC-BASED EFFICIENT MESSAGE ROUTE SELECTION METHOD TO PROLONG THE NET...IJCNCJournal
Recently, sensor networks have been used in a wide range of applications, and interest in sensor node
performance has increased. A sensor network is composed of tiny nodes with limited resources. The sensor
network communicates between nodes in a configured network through self-organization. An energyefficient security protocol with a hierarchy structure with various advantages has been proposed to
prolong the network lifetime of sensor networks. But due to structural problems in traditional protocols,
nodes located upstream tend to consume relatively high energy compared to other nodes. A network
protocol should be considered to provide minimal security and efficient allocation of energy consumption
by nodes to increase the network lifetime. In this paper, we introduce a solution to solve the bottleneck
problem through an efficient message route selection method. The proposed method selects an efficient
messaging path using GA and fuzzy logic composed of multiple rules. Message route selection plays an
important role in controlling the load balancing of nodes. A principal benefit of the proposed scheme is the
potential portability of the clustering-based protocol. In addition, the proposed method is updated to find
the optimal path through the genetic algorithm to respond to various environments. We demonstrated the
effectiveness of the proposed method through an experiment in which the proposed method is applied to a
probabilistic voting-based filtering scheme that is one of the cluster-based security schemes.
SYMMETRIC KEY MANAGEMENT SCHEME FOR HIERARCHICAL WIRELESS SENSOR NETWORKSIJNSA Journal
Wireless Sensor Networks (WSNs) are critical component in many applications that used for data collection. Since sensors have limited resource, Wireless Sensor Networks are more vulnerable to attacks than other wireless networks. It is necessary to design a powerful key management scheme for WSNs and take in consideration the limited characteristics of sensors. To achieve security of communicated data in the network and to extend the WSNs lifetime; this paper proposes a new scheme called Symmetric Key Management Scheme (SKMS). SKMS used Symmetric Key Cryptography that depends only on a Hash function and XOR operation for securing homogeneous and heterogeneous hierarchical WSNs. Symmetric Key Cryptography is less computation than Asymmetric Key Cryptography. Simulation results show that the proposed scheme provides security, save the energy of sensors with low computation overhead.
International Journal of Computational Engineering Research(IJCER)ijceronline
International Journal of Computational Engineering Research(IJCER) is an intentional online Journal in English monthly publishing journal. This Journal publish original research work that contributes significantly to further the scientific knowledge in engineering and Technology.
Spectrum requirement estimation for imt systems in developing countriesijdpsjournal
In this paper
we analyze the methodology develope
d by
the
International Telecommunication Union (ITU)
for
estimat
ing
the spectrum requirement for International Mobile Telecommunications (IMT) systems.
The
International
Telecommunication Union estimates spectrum requirement
s
by following ITU
-
R
-
Rec.M1768.
Although
this
methodology is adopted by ITU
-
R
,
there are
discrepancies
for
estimat
ing
the spectrum
requirement for developing countries. ITU estimates the spectrum requirement by considering technica
l
and market
parameters
that
were provided by the
most de
veloped countries with high income and high
development index
. Developed countries have
a very rapid expansible telecom
market
due to the high level
of penetration
,
dominant
user density
and usage of high
-
volume multimedia services.
In contrast,
developing
countries
use less bandwidth
-
intensive services such as voice communication,
low rate data
,
low and medium multimedia.
However,
while
the input parameters are adequate for developed countries
,
they
do not reflect the status of developing countries. For th
is reason
the
ITU spectrum estimation
overestimate
s
the exact requirement
s
of spectrum for IMT systems for developing countries. This paper
presents an approach based on the technical and market related parameters, which is thought to be
applicable
for
ove
rcom
ing
the shortcomings of
the
current ITU methodology in estimatin
g
the spectrum
requirement
for developing
countries like Bangladesh
HIGHLY SCALABLE, PARALLEL AND DISTRIBUTED ADABOOST ALGORITHM USING LIGHT WEIG...ijdpsjournal
AdaBoost is an important algorithm in machine learning and is being widely used in object detection.
AdaBoost works by iteratively selecting the best amongst weak classifiers, and then combines several weak
classifiers to obtain a strong classifier. Even though AdaBoost has proven to be very effective, its learning
execution time can be quite large depending upon the application e.g., in face detection, the learning time
can be several days. Due to its increasing use in computer vision applications, the learning time needs to
be drastically reduced so that an adaptive near real time object detection system can be incorporated. In
this paper, we develop a hybrid parallel and distributed AdaBoost algorithm that exploits the multiple
cores in a CPU via light weight threads, and also uses multiple machines via a web service software
architecture to achieve high scalability. We present a novel hierarchical web services based distributed
architecture and achieve nearly linear speedup up to the number of processors available to us. In
comparison with the previously published work, which used a single level master-slave parallel and
distributed implementation [1] and only achieved a speedup of 2.66 on four nodes, we achieve a speedup of
95.1 on 31 workstations each having a quad-core processor, resulting in a learning time of only 4.8
seconds per feature.
Survey comparison estimation of various routing protocols in mobile ad hoc ne...ijdpsjournal
MANET is
an autonomous system of mobile nodes attached by wireless links. It represents
a complex and
dynamic distributed systems that consist of mobile wireless nodes that can freely self organize into
an ad
-
hoc network topology. The devices in the network may hav
e limited transmission
range therefore multiple
hops may be needed by one node to transfer data to another node in network. This leads to the need f
or an
effective routing protocol. In this paper we study various classifications of routing protocols and
th
eir types
for wireless mobile ad
-
hoc networks like DSDV, GSR, AODV, DSR, ZRP, FSR, CGSR, LAR, and Geocast
Protocols. In this paper we also compare different routing proto
cols on based on a given set of
parameters
Scalability, Latency, Bandwidth, Control
-
ov
erhead, Mobility impact
Management of context aware software resources deployed in a cloud environmen...ijdpsjournal
In cloud computing environments, context information is continuously created by context providers and
consumed by the applications on mobile devices. An important characteristic of cloud-based context aware
services is meeting the service level agreements (SLAs) to deliver a certain quality of service (Qos), such as
guarantees on response time or price. The response time to a request of context-aware software is affected
by loading extensive context data from multiple resources on the chosen server. Therefore, the speed of
such software would be decreased during execution time. Hence, proper scheduling of such services is
indispensable because the customers are faced with time constraints. In this research, a new scheduling
algorithm for context aware services is proposed which is based on classifying similar context consumers
and dynamically scoring the requests to improve the performance of the server hosting highly-requested
context-aware software while reducing costs of cloud provider. The approach is evaluated via simulation
and comparison with gi-FIFO scheduling algorithm. Experimental results demonstrate the efficiency of the
proposed approach.
On the fly porn video blocking using distributed multi gpu and data mining ap...ijdpsjournal
Preventing users from accessing adult videos and at the same time allowing them to access good
educational videos and other materials through campus wide network is a big challenge for organizations.
Major existing web filtering systems are textual content or link analysis based. As a result, potential users
cannot access qualitative and informative video content which is available online. Adult content detection
in video based on motion features or skin detection requires significant computing power and time.
Judgment to identify pornography videos is taken based on processing of every chunk from video,
consisting specific number of frames, sequentially one after another. This solution is not feasible in real
time when user has started watching the video and decision about blocking needs to be taken within few
seconds.
In this paper, we propose a model where user is allowed to start watching any video; at the backend porn
detection process using extracted video and image features shall run on distributed nodes with multiple
GPUs (Graphics Processing Units). The video is processed on parallel and distributed platform in shortest
time and decision about filtering the video is taken in real time. Track record of blocked content and
websites is cached, too. For every new video downloads, cache is verified to prevent repetitive content
analysis. On the fly blocking is feasible due to latest GPU architecture, CUDA (Compute Unified Device
Architecture) and CUDA aware MPI (Message Passing Interface). It is possible to achieve coarse grained
as well as fine grained parallelism. Video Chunks are processed parallel on distributed nodes. Porn
detection algorithm on frames of chunks of videos can also achieve parallelism using GPUs on single node.
It ultimately results into blocking porn video on the fly and allowing educational and informative videos.
Implementing database lookup method in mobile wimax for location management a...ijdpsjournal
The mobile WiMAX plays a vital role in accessing the delay sensitive audio, video streaming and mobi
le
IPTV. To minimize the handover delay, a Location
Management Area (LMA) based Multicast and
Broadcast Service (MBS) zone is established. The handover delay is increased based on the size of th
e MBS
zone. In this paper, Location Management Area is easily identified by using Database Lookup Method t
o
obtai
n efficient bandwidth utilization along with reduced handover delay and increased throughput. The
handover delay and throughput is calculated by implementing this scenario in OPNET tool.
Design Of Elliptic Curve Crypto Processor with Modified Karatsuba Multiplier ...ijdpsjournal
ECDSA stands for “Elliptic Curve Digital Signature Algorithm”, it’s used to create a digital signature of
data (a file for example) in order to allow you to verify its authenticity without compromising its security.
This paper presents the architecture of finite field multiplication. The proposed multiplier is hybrid
Karatsuba multiplier used in this processor. For multiplicative inverse we choose the Itoh-Tsujii
Algorithm(ITA). This work presents the design of high performance elliptic curve crypto processor(ECCP)
for an elliptic curve over the finite field GF(2^233). The curve which we choose is the standard curve for
the digital signature. The processor is synthesized for Xilinx FPGA.
Advanced delay reduction algorithm based on GPS with Load Balancingijdpsjournal
A Mobile Ad-Hoc Network (MANET) is a self-configuring network of mobile nodes connected by wireless
links, to form an arbitrary topology. The nodes are free to move arbitrarily in the topology. Thus, the
network's wireless topology may be random and may change quickly. An ad Hoc network is formed by
sensor networks consisting of sensing, data processing, and communication components. There is frequent
occurrence of congested links in such a network as wireless links inherently have significantly lower
capacity than hardwired links and are therefore more prone to congestion. Here we proposed a algorithm
which involves the reduction in the delay with the help of Request_set created on the basis of the location
information of the destination node. Across the paths found in the Route_reply (RREP) packets the load is
equally distributed
SURVEY ON QOE\QOS CORRELATION MODELS FORMULTIMEDIA SERVICESijdpsjournal
This paper presents a brief review of some existing correlation models which attempt to map Quality of
Service (QoS) to Quality of Experience (QoE) for multimedia services. The term QoS refers to deterministic
network behaviour, so that data can be transported with a minimum of packet loss, delay and maximum
bandwidth. QoE is a subjective measure that involves human dimensions; it ties together user perception,
expectations, and experience of the application and network performance. The Holy Grail of subjective
measurement is to predict it from the objective measurements; in other words predict QoE from a given set
of QoS parameters or vice versa. Whilst there are many quality models for multimedia, most of them are
only partial solutions to predicting QoE from a given QoS. This contribution analyses a number of previous
attempts and optimisation techniquesthat can reliably compute the weighting coefficients for the QoS/QoE
mapping.
A LIGHT-WEIGHT DISTRIBUTED SYSTEM FOR THE PROCESSING OF REPLICATED COUNTER-LI...ijdpsjournal
In order to increase availability in a distributed system some or all of the data items are replicated and
stored at separate sites. This is an issue of key concern especially since there is such a proliferation of
wireless technologies and mobile users. However, the concurrent processing of transactions at separate
sites can generate inconsistencies in the stored information. We have built a distributed service that
manages updates to widely deployed counter-like replicas. There are many heavy-weight distributed
systems targeting large information critical applications. Our system is intentionally, relatively lightweight
and useful for the somewhat reduced information critical applications. The service is built on our
distributed concurrency control scheme which combines optimism and pessimism in the processing of
transactions. The service allows a transaction to be processed immediately (optimistically) at any
individual replica as long as the transaction satisfies a cost bound. All transactions are also processed in a
concurrent pessimistic manner to ensure mutual consistency
Crypto multi tenant an environment of secure computing using cloud sqlijdpsjournal
Today’s most modern research area of computing is cloud comput
ing due to its ability to diminish the costs
associated with virtualization, high availability, dynamic resource pools and increases the efficien
cy of
computing. But still it contains some drawbacks such as privacy, security, etc. This paper is thorou
ghly
focused on the security of data of multi tenant model obtains from the virtualization feature of clo
ud
computing. We use AES
-
128 bit algorithm and cloud SQL to protect sensitive data before storing in the
cloud. When the authorized customer arises for usag
e of data, then data firstly decrypted after that
provides to the customer. Multi tenant infrastructure is supported by Google, which prefers pushing
of
contents in short iteration cycle. As the customer is distributed and their demands can arise anywhe
re,
anytime so data can’t store at particular site it must be available different sites also. For this f
aster
accessing by different users from different places Google is the best one. To get high reliability a
nd
availability data is stored in encrypted befor
e storing in database and updated every time after usage. It is
very easy to use without requiring any software. This authenticate user can recover their encrypted
and
decrypted data, afford efficient and data storage security in the cloud.
BREAST CANCER DIAGNOSIS USING MACHINE LEARNING ALGORITHMS –A SURVEYijdpsjournal
Breast cancer has become a common factor now-a-days. Despite the fact, not all general hospitals
have the facilities to diagnose breast cancer through mammograms. Waiting for diagnosing a breast
cancer for a long time may increase the possibility of the cancer spreading. Therefore a computerized
breast cancer diagnosis has been developed to reduce the time taken to diagnose the breast cancer and
reduce the death rate. This paper summarizes the survey on breast cancer diagnosis using various machine
learning algorithms and methods, which are used to improve the accuracy of predicting cancer. This survey
can also help us to know about number of papers that are implemented to diagnose the breast cancer.
STUDY OF VARIOUS FACTORS AFFECTING PERFORMANCE OF MULTI-CORE PROCESSORSijdpsjournal
Advances in Integrated Circuit processing allow for more microprocessor design options. As Chip Multiprocessor system (CMP) become the predominant topology for leading microprocessors, critical components of the system are now integrated on a single chip. This enables sharing of computation resources that was not previously possible. In addition the virtualization of these computation resources exposes the system to a mix of diverse and competing workloads. On chip Cache memory is a resource of primary concern as it can be dominant in controlling overall throughput. This Paper presents analysis of various parameters affecting the performance of Multi-core Architectures like varying the number of cores, changes L2 cache size, further we have varied directory size from 64 to 2048 entries on a 4 node, 8 node 16 node and 64 node Chip multiprocessor which in turn presents an open area of research on multicore processors with private/shared last level cache as the future trend seems to be towards tiled architecture executing multiple parallel applications with optimized silicon area utilization and excellent performance.
EFFICIENT SCHEDULING STRATEGY USING COMMUNICATION AWARE SCHEDULING FOR PARALL...ijdpsjournal
In the area of Computer Science, Parallel job scheduling is an important field of research. Finding a best
suitable processor on the high performance or cluster computing for user submitted jobs plays an
important role in measuring system performance. A new scheduling technique called communication aware
scheduling is devised and is capable of handling serial jobs, parallel jobs, mixed jobs and dynamic jobs.
This work focuses the comparison of communication aware scheduling with the available parallel job
scheduling techniques and the experimental results show that communication aware scheduling performs
better when compared to the available parallel job scheduling techniques.
Target Detection System (TDS) for Enhancing Security in Ad hoc Networkijdpsjournal
The idea of an ad hoc network is a new pattern that allows mobile hosts (nodes) to converse without relying
on a predefined communications to keep the network connected. Most nodes are implicit to be mobile and
communication is implicit to be wireless. Ad-hoc networks are collaborative in the sense that each node is
assumed to relay packets for other nodes that will in return relay their packets. Thus all nodes in an ad-hoc
network form part of the network’s routing infrastructure. The mobility of nodes in an ad-hoc network
denotes that both the public and the topology of the network are extremely active. It is very difficult to
design a once-for-all target detection system. Instead, an incremental enrichment strategy may be more
feasible. A safe and sound protocol should at least include mechanisms against known assault types. In
addition, it should provide a system to easily add new security features in the future. Due to the
significance of MANET routing protocols, we focus on the recognition of attacks targeted at MANET
routing protocols.
Intrusion detection techniques for cooperation of node in MANET have been chosen as the security
parameter. This includes Watchdog and Path rater approach. It also nearby Reputation Based Schemes in
which Reputation concerning every node is measured and will be move to every node in network.
Reputation is defined as Someone’s donation to network operation. CONFIDANT [23], CORE [25],
OCEAN [24] schemes are analyzed and will be here also compared based on various parameters.
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
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
Fuzzy-Based Multiple Path Selection Method for Improving Energy Efficiency in...aciijournal
In wireless sensor networks, adversaries can easily compromise sensors because the sensor resources are
limited. The compromised nodes can inject false data into the network injecting false data attacks. The
injecting false data attack has the goal of consuming unnecessary energy in en-route nodes and causing
false alarms in a sink. A bandwidth-efficient cooperative authentication scheme detects this attack based on
the random graph characteristics of sensor node deployment and a cooperative bit-compressed
authentication technique. Although this scheme maintains a high filtering probability and high reliability in
the sensor network, it wastes energy in en-route nodes due to a multireport solution. In this paper, our
proposed method effectively selects a number of multireports based on the fuzzy rule-based system. We
evaluated the performance in terms of the security level and energy savings in the presence of the injecting
false data attacks. The experimental results indicate that the proposed method improves the energy
efficiency up to 10% while maintaining the same security level as compared to the existing scheme.
NUMBER OF NEIGHBOUR NODES BASED NEXT FORWARDING NODES DETERMINATION SCHEME FO...ijcsity
Wireless Sensor Networks (Wsn) Are Used In Various Areas. These Networks Are Deployed In An Open Environment. So, They Are Very Weak Against An Attack, And Easily Damaged.The Wsn Has Limited Resources In Terms Of Battery Life, Computing Power, Communication Bandwidth And So On. Many Attacks Aim At That Point.The False Report Injection Attack Is One Of Them. Yu Et Al. Proposed A Dynamic En-Route Filtering Scheme (Def),To Prevent A False Report Injection Attack.In This Paper, We Propose An Energy Enhancement Scheme For Def Using A Fuzzy System. The Def Is Divided Into Three Phases (Key Pre-Distribution Phase, Key Dissemination Phase, Report Forwarding Phase). We Applied Our Scheme At The Next Forwarding Node Determination. So We Used Three Input Factors Of A Fuzzy System To Make A Determination. These Are The Availability Of Energy, Distance To The Base Station,
And Usage Count.Through The Experiments, Our Proposed Method Shows Up To 8.2% Energy Efficiency,Compared With The Def. If The Networks Consume More Energy, Our Proposed Method Shows More Efficiency For The Energy.
An Opportunistic AODV Routing Scheme : A Cognitive Mobile Agents Approachijasuc
In Manet’s Dynamics and Robustness are the key features of the nodes and are governed by several routing protocols such as AODV, DSR and so on. However in the network the growing resource demand leads to resource scarcity. The Node Mobility often leads to the link breakages and high routing overhead
decreasing the stability and reliability of the network connectivity. In this context, the paper proposes a novel opportunistic AODV routing scheme which implements a cognitive agent based intelligent technique to set up a stable connectivity over the Manet. The Scheme computes the routing metric (rf) based on the collaboration sensitivity levels of the nodes obtained based through the knowledge-based decision. This Routing Metric is subsequently used to set up the stable path for network connectivity. Thus minimizes the route overhead and increases the stability of the path. The Performance evaluation is conducted in comparison with the AODV and sleep AODV routing protocol and validated.
An Opportunistic AODV Routing Scheme : A Cognitive Mobile Agents Approachjake henry
In Manet’s Dynamics and Robustness are the key feat
ures of the nodes and are governed by several routi
ng
protocols such as AODV, DSR and so on. However in t
he network the growing resource demand leads to
resource scarcity. The Node Mobility often leads to
the link breakages and high routing overhead
decreasing the stability and reliability of the net
work connectivity. In this context, the paper propo
ses a
novel opportunistic AODV routing scheme which imple
ments a cognitive agent based intelligent technique
to set up a stable connectivity over the Manet. The
Scheme computes the routing metric (rf) based on t
he
collaboration sensitivity levels of the nodes obtai
ned based through the knowledge-based decision. Thi
s
Routing Metric is subsequently used to set up the s
table path for network connectivity. Thus minimizes
the
route overhead and increases the stability of the p
ath. The Performance evaluation is conducted in
comparison with the AODV and sleep AODV routing pro
tocol and validated
An Opportunistic AODV Routing Scheme : A Cognitive Mobile Agents Approachijasuc
In Manet’s Dynamics and Robustness are the key features of the nodes and are governed by several routing protocols such as AODV, DSR and so on. However in the network the growing resource demand leads to resource scarcity. The Node Mobility often leads to the link breakages and high routing overhead
decreasing the stability and reliability of the network Connectivity. In this context, the paper proposes a novel opportunistic AODV routing scheme which implements a cognitive agent based intelligent technique to set up a stable connectivity over the Manet. The Scheme computes the routing metric (rf) based on the collaboration sensitivity levels of the nodes obtained based through the knowledge-based decision. This Routing Metric is subsequently used to set up the stable path for network connectivity. Thus minimizes the route overhead and increases the stability of the path. The Performance evaluation is conducted in comparison with the AODV and sleep AODV routing protocol and validated.
AN OPPORTUNISTIC AODV ROUTING SCHEME: A COGNITIVE MOBILE AGENTS APPROACHijasuc
In Manet’s Dynamics and Robustness are the key features of the nodes and are governed by several routing
protocols such as AODV, DSR and so on. However in the network the growing resource demand leads to
resource scarcity. The Node Mobility often leads to the link breakages and high routing overhead
decreasing the stability and reliability of the network connectivity. In this context, the paper proposes a
novel opportunistic AODV routing scheme which implements a cognitive agent based intelligent technique
to set up a stable connectivity over the Manet. The Scheme computes the routing metric (rf) based on the
collaboration sensitivity levels of the nodes obtained based through the knowledge-based decision. This
Routing Metric is subsequently used to set up the stable path for network connectivity. Thus minimizes the
route overhead and increases the stability of the path. The Performance evaluation is conducted in
comparison with the AODV and sleep AODV routing protocol and validated.
BLACKLIST MANAGEMENT USING A VERIFICATION REPORT TO IMPROVE THE ENERGY EFFICI...ijwmn
Recently, the applications scope of Wireless Sensor Networks (WSNs) has been broadened. WSN communication security is important because sensor nodes are vulnerable to various security attacks when deployed in an open environment. An adversary could exploit this vulnerability to inject false reports into the network. En-route filtering techniques have been researched to block false reports. The CFFS scheme
filters the false report by collaboratively validating the report by clustering the nodes. However, CFFS is not considered effective against repetitive attacks. Repeated attacks have a significant impact on network lifetime. In this paper, we propose a method to detect repetitive attacks with cluster-based false data
filtering and to identify the compromised nodes and quickly block them. The proposed scheme uses fuzzy logic to determine the distribution of additional keys according to the network conditions, thereby improving energy efficiency.
Enhancing AODV Routing Protocol to Eliminate Black Hole Attack in MANET.......................................1
Ei Ei Khin and Thandar Phyu
Adaptive Search Information Technology in the University Library ........................................................ 15
Andriy Andrukhiv and Dmytro Tarasov
Educational Data Mining: Performance Evaluation of Decision Tree and Clustering Techniques Using
WEKA Platform........................................................................................................................................... 26
Ritika Saxena
Hamiltonian cycle in graphs 흈4 ≥ ퟐn....................................................................................................... 38
Nguyen Huu Xuan Truong and Vu Dinh Hoa
Mobile ad hoc network (MANET) is an autonomous system of mobile nodes. Each node operates not only as an end system, but also as a router to forward packets. The nodes are free to move about and organize themselves into a network. These cause extra challenges on security. In this paper, evaluation of prominent on-demand routing protocol i.e. AODV,MAODV,RAODV has been done by varying the network size. An effort has been carried out to do the performance evaluation of these protocols using random way point model. The simulator used is NS 2.34. The performance of either protocol has been studied by using a self created network scenario with respect to pause time.
A security method for multiple attacks in sensor networks against the false r...ijitjournal
In a large scale wireless sensor network, various attacks rapidly spread damages in the network from
inside and outside attacks such as the false report injection attack and the sinkhole attack, respectively.
These attacks drain finite energy resources and devastate constructed routing paths via compromised
nodes. The security methods like SEF (statistical en-route filtering scheme) and LEAP (localized encryption
and authentication protocol) try to cope with these attacks. When these attacks occur at the same time, SEF
and LEAP should be operated simultaneously in the sensor network thus, it introduces some inefficiency. In
this paper, we propose a security method which improves the energy efficiency while maintaining the
security level compared to the simultaneous application of SEF and LEAP. The proposed method is
designed by identifying and eliminating the redundancies within the simultaneous application of the two
methods and providing more efficient functionalities. In the proposed method, two types of new keys are
designed and provided for simultaneous detection of the attacks. Four types of keys are used in each sensor
node – a P1 for encrypting information, a PK (pairwise key) for keeping secure paths, a P2 for verifying a
specific cluster, and a GK (group key) for encrypting message. Among these keys, P1 and P2 are newly
provided keys. We have evaluated the effectiveness of the proposed method compared to the simultaneous
application of SEF and LEAP when the multiple attacks occur. The experiment results show that our
proposed method saves energy up to 10% while maintaining the detection power
Shortest path algorithm for data transmission in wireless ad hoc sensor networksijasuc
Wireless sensor networks determine probable in military, environments, health and commercial
applications. The process of transferring of information from a remote sensor node to other nodes in a
network holds importance for such applications. Various constraints such as limited computation, storage
and power makes the process of transferring of information routing interesting and has opened new arenas
for researchers. The fundamental problem in sensor networks states the significance and routing of
information through a real path as path length decides some basic performance parameters for sensor
networks. This paper strongly focuses on a shortest path algorithm for wireless adhoc networks. The
simulations are performed on NS2 and the results obtained discuss the role of transferring of information
through a shortest path.
A Novel Approach to Detect & Prevent Wormhole Attack over MANET & Sensor n/w ...IOSR Journals
Abstract: In Mobile Ad hoc Network (MANET) mobile node is responsible for route establishment using
wireless link where each node may behave like both as a host and router. MANET encounters number of
security threats because of its open entrusted environment, with little security arrangement, security over
MANET can be enhance up to some satisfactory level because of its inherent characteristics. Among some of
the prominent security threats wormhole attack is considered to be a very serious security threat over MANET.
In wormhole two selfish node which is geographically very far away to each other makes tunnel between each
other to hide their actual location and give the illusion that they are true neighbours and attract other nodes to
make conversation through the wormhole tunnel. Many researchers focused on detecting wormhole attack and
its prevention mechanism. It seems that in the previous technique there is a need to improve their results in the
brink of false negative rate, routing overhead etc. The present paper has proposed the hybrid model in order to
detect and prevent the wormhole attack. This approach has been work with neighbour node and hop count
method.
Keywords: Mobile Ad hoc Network, Selfish node, Malicious node, AODV
Generating images from a text description is as challenging as it is interesting. The Adversarial network
performs in a competitive fashion where the networks are the rivalry of each other. With the introduction of
Generative Adversarial Network, lots of development is happening in the field of Computer Vision. With
generative adversarial networks as the baseline model, studied Stack GAN consisting of two-stage GANS
step-by-step in this paper that could be easily understood. This paper presents visual comparative study of
other models attempting to generate image conditioned on the text description. One sentence can be related
to many images. And to achieve this multi-modal characteristic, conditioning augmentation is also
performed. The performance of Stack-GAN is better in generating images from captions due to its unique
architecture. As it consists of two GANS instead of one, it first draws a rough sketch and then corrects the
defects yielding a high-resolution image.
Survey of wormhole attack in wireless sensor networksCSITiaesprime
From the last decade, a wireless sensor network (WSN) has a very important role over the networks. The primary features of WSN include satellite communication, broadcast channel, hostile environment, medical system and data gathering. There are a lot of attacks available in WSN. In wormhole attack scenario is brutal from other attacks, which is smoothly resolved in networks but tough to observe. This survey paper is an experiment to observing threats and also focuses on some different method to identify the wormhole attacks.
A mobile ad-hoc network (MANET) is a self structured infrastructure less network of mobile devices
connected by wireless. Each device in a MANET is free to move independently in any direction, and will
therefore change its links to other devices frequently. Load balancing is a technique to share out workload
across network links, to achieve maximize throughput, minimize response time, and avoid overload. Load
imbalance is a one of the critical issue in the ad-hoc network. Particle Swarm Optimization (PSO) method
is used to implement our proposed technique. In this Paper two algorithms are used for balancing the
nodes in the network. Identify the unfair nodes location next allocate and balance the load between the
nodes in the network. The simulation results show that this approach is more effective in terms of packet
delivery ratio, average end-to-end delay, load distribution, packet delay variation, packet reordering, and
throughput.
Survey on Routing in Opportunistic Networks
this paper basically overviews and disused those potential methods and Techniques to select next hop to forward the packets (message) to destination.
Similar to Derivative threshold actuation for single phase wormhole detection with reduced false alarm rate (20)
GDG Cloud Southlake #33: Boule & Rebala: Effective AppSec in SDLC using Deplo...James Anderson
Effective Application Security in Software Delivery lifecycle using Deployment Firewall and DBOM
The modern software delivery process (or the CI/CD process) includes many tools, distributed teams, open-source code, and cloud platforms. Constant focus on speed to release software to market, along with the traditional slow and manual security checks has caused gaps in continuous security as an important piece in the software supply chain. Today organizations feel more susceptible to external and internal cyber threats due to the vast attack surface in their applications supply chain and the lack of end-to-end governance and risk management.
The software team must secure its software delivery process to avoid vulnerability and security breaches. This needs to be achieved with existing tool chains and without extensive rework of the delivery processes. This talk will present strategies and techniques for providing visibility into the true risk of the existing vulnerabilities, preventing the introduction of security issues in the software, resolving vulnerabilities in production environments quickly, and capturing the deployment bill of materials (DBOM).
Speakers:
Bob Boule
Robert Boule is a technology enthusiast with PASSION for technology and making things work along with a knack for helping others understand how things work. He comes with around 20 years of solution engineering experience in application security, software continuous delivery, and SaaS platforms. He is known for his dynamic presentations in CI/CD and application security integrated in software delivery lifecycle.
Gopinath Rebala
Gopinath Rebala is the CTO of OpsMx, where he has overall responsibility for the machine learning and data processing architectures for Secure Software Delivery. Gopi also has a strong connection with our customers, leading design and architecture for strategic implementations. Gopi is a frequent speaker and well-known leader in continuous delivery and integrating security into software delivery.
Transcript: Selling digital books in 2024: Insights from industry leaders - T...BookNet Canada
The publishing industry has been selling digital audiobooks and ebooks for over a decade and has found its groove. What’s changed? What has stayed the same? Where do we go from here? Join a group of leading sales peers from across the industry for a conversation about the lessons learned since the popularization of digital books, best practices, digital book supply chain management, and more.
Link to video recording: https://bnctechforum.ca/sessions/selling-digital-books-in-2024-insights-from-industry-leaders/
Presented by BookNet Canada on May 28, 2024, with support from the Department of Canadian Heritage.
Elevating Tactical DDD Patterns Through Object CalisthenicsDorra BARTAGUIZ
After immersing yourself in the blue book and its red counterpart, attending DDD-focused conferences, and applying tactical patterns, you're left with a crucial question: How do I ensure my design is effective? Tactical patterns within Domain-Driven Design (DDD) serve as guiding principles for creating clear and manageable domain models. However, achieving success with these patterns requires additional guidance. Interestingly, we've observed that a set of constraints initially designed for training purposes remarkably aligns with effective pattern implementation, offering a more ‘mechanical’ approach. Let's explore together how Object Calisthenics can elevate the design of your tactical DDD patterns, offering concrete help for those venturing into DDD for the first time!
UiPath Test Automation using UiPath Test Suite series, part 4DianaGray10
Welcome to UiPath Test Automation using UiPath Test Suite series part 4. In this session, we will cover Test Manager overview along with SAP heatmap.
The UiPath Test Manager overview with SAP heatmap webinar offers a concise yet comprehensive exploration of the role of a Test Manager within SAP environments, coupled with the utilization of heatmaps for effective testing strategies.
Participants will gain insights into the responsibilities, challenges, and best practices associated with test management in SAP projects. Additionally, the webinar delves into the significance of heatmaps as a visual aid for identifying testing priorities, areas of risk, and resource allocation within SAP landscapes. Through this session, attendees can expect to enhance their understanding of test management principles while learning practical approaches to optimize testing processes in SAP environments using heatmap visualization techniques
What will you get from this session?
1. Insights into SAP testing best practices
2. Heatmap utilization for testing
3. Optimization of testing processes
4. Demo
Topics covered:
Execution from the test manager
Orchestrator execution result
Defect reporting
SAP heatmap example with demo
Speaker:
Deepak Rai, Automation Practice Lead, Boundaryless Group and UiPath MVP
Key Trends Shaping the Future of Infrastructure.pdfCheryl Hung
Keynote at DIGIT West Expo, Glasgow on 29 May 2024.
Cheryl Hung, ochery.com
Sr Director, Infrastructure Ecosystem, Arm.
The key trends across hardware, cloud and open-source; exploring how these areas are likely to mature and develop over the short and long-term, and then considering how organisations can position themselves to adapt and thrive.
Generating a custom Ruby SDK for your web service or Rails API using Smithyg2nightmarescribd
Have you ever wanted a Ruby client API to communicate with your web service? Smithy is a protocol-agnostic language for defining services and SDKs. Smithy Ruby is an implementation of Smithy that generates a Ruby SDK using a Smithy model. In this talk, we will explore Smithy and Smithy Ruby to learn how to generate custom feature-rich SDKs that can communicate with any web service, such as a Rails JSON API.
UiPath Test Automation using UiPath Test Suite series, part 3DianaGray10
Welcome to UiPath Test Automation using UiPath Test Suite series part 3. In this session, we will cover desktop automation along with UI automation.
Topics covered:
UI automation Introduction,
UI automation Sample
Desktop automation flow
Pradeep Chinnala, Senior Consultant Automation Developer @WonderBotz and UiPath MVP
Deepak Rai, Automation Practice Lead, Boundaryless Group and UiPath MVP
The Art of the Pitch: WordPress Relationships and SalesLaura Byrne
Clients don’t know what they don’t know. What web solutions are right for them? How does WordPress come into the picture? How do you make sure you understand scope and timeline? What do you do if sometime changes?
All these questions and more will be explored as we talk about matching clients’ needs with what your agency offers without pulling teeth or pulling your hair out. Practical tips, and strategies for successful relationship building that leads to closing the deal.
Accelerate your Kubernetes clusters with Varnish CachingThijs Feryn
A presentation about the usage and availability of Varnish on Kubernetes. This talk explores the capabilities of Varnish caching and shows how to use the Varnish Helm chart to deploy it to Kubernetes.
This presentation was delivered at K8SUG Singapore. See https://feryn.eu/presentations/accelerate-your-kubernetes-clusters-with-varnish-caching-k8sug-singapore-28-2024 for more details.
DevOps and Testing slides at DASA ConnectKari Kakkonen
My and Rik Marselis slides at 30.5.2024 DASA Connect conference. We discuss about what is testing, then what is agile testing and finally what is Testing in DevOps. Finally we had lovely workshop with the participants trying to find out different ways to think about quality and testing in different parts of the DevOps infinity loop.
Derivative threshold actuation for single phase wormhole detection with reduced false alarm rate
1. International Journal of Distributed and Parallel Systems (IJDPS) Vol.5, No.1/2/3, May 2014
DOI : 10.5121/ijdps.2014.5303 29
DERIVATIVE THRESHOLD ACTUATION FOR SINGLE
PHASE WORMHOLE DETECTION WITH REDUCED
FALSE ALARM RATE
K.Aathi Dharshini1
C.Susil Kumar2
E.Babu Thirumangai Alwar3
1,2
Department of Electronics and Communication Engineering, VCET,Madurai.
3
Department of Computer Science Engineering,Hindusthan Institute of Technology,
Coimbatore.
ABSTRACT
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 merely 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 node 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 dissimilar
characteristics.
KEYWORDS
MANET, wormhole, Traffic prediction, parametric threshold implication, derivational approach.
1. INTRODUCTION
A mobile unintended network (MANET) could be a self configuration infrastructure less network
with non centralized administration. A mobile Ad hoc or unintended network is an autonomous
assortment of mobile devices (laptops, smart phones, sensors, etc.,)that communicate with one
another over wireless links and collaborate in a distributed manner so as to produce the required
network practically within the absence of a fixed infrastructure. Every device in a MANET is
unengaged to move independently in any direction, and can amend its links to different devices
often. This type of network, operating as a complete network or with one or multiple points of
attachments to cellular networks or the web, paves the approach for variable new and exciting
applications. Application scenarios embrace, however are not restricted to: emergency and rescue
operations, conferences are field settings, automobile networks, personal networking, etc. In
wormhole attack, malicious node receives knowledge packet at one point within the network and
tunnels them to a different malicious node. The tunnel existing between two malicious nodes is
named as a wormhole. The tunnel gets the information from one network and replicates to
different network. A wormhole therefore permits an attacker to form two attacker controlled
choke points which may be utilized by the attacker to degrade or analyze traffic at a desired point.
2. International Journal of Distributed and Parallel Systems (IJDPS) Vol.5, No.1/2/3, May 2014
30
TPIDS is a lightweight traffic prediction intrusion detection theme that tumbling the value of
communication and energy by hastily detecting the behaviour of the intrusions. Some work has
been done to wormhole attack in mobile unintended networks however it cause excessive false
alarm rate. In this paper we are focusing on reducing warning rate by choosing optimum
threshold value to save lots of wastage of energy and information measure of mobile nodes in
sleuthing wormholes. The remaining components of this paper is organized as follows: section III
provides traffic prediction supported ARMA, section IV provides experimental analysis and
results, section V presents relation between attributes of the network and threshold values, section
VI presents threshold selection, finally conclusion is conferred in section VII.
2. RELATED WORK
The discussion starts by Yu Bo’s paper, that relies on the discovery of multi-hop recognition
theme to detect attacks caused by the selection of transmitting the irregular packet loss. In this
theme, a region of the transmission path, nodes are going to be randomly selected for testing.
Detection point is going to be generated for every incident packet to the upstream transmission
methods, any node within the middle, if not adequately recognized package, can generate warning
data of abnormal packet loss and to submit a multi-hop to the supply node. Here, we have
considered ton choosing transmission attack is taken into account, that introduces larger
communications and computing prices. Then khin sandar win [6] proposes solely an analysis of
detecting wormhole attack in wireless network, simply by quoting the benefits and drawbacks not
suggesting for the foremost economical one. Han zhijie[1] instructed traffic prediction
methodology, however he didn’t decrease the false alarm rate whereas detecting wormholes.
Faizal M.A.[2] offers regarding solely a way to verify threshold values by using SPC approach
that are more necessary for detection of wormholes and conjointly to scale back false alarm rate
within the MANET. This observation is finished on real time network traffic having the aim of
distinguishing the typical connection created by the host or hosts to single victim among one
second interval.
3. TRAFFIC PREDICTION BASED ON ARMA
The existing traffic prediction model includes Poisson model, Markov model, auto-regressive
model where Poisson is not suitable for the flow characteristics of MANET. This paper gathers
information from Markov model and enhances it in auto-regressive moving average model to
predict MANET traffic and the specific prediction model which is shown below:
Each and every node in MANET has its own random variable sequence X0 , X1 , X 2... is used to
denote the state of the node at the same time; different nodes can be in different modes. Assume
Xn = i that is nodes are in the operational mode i when it is in time domain n and also assume
that the entire state transition take place at the beginning of any time domain, each node has
some fixed probability in the state i .if the next state is j , then this is denoted by Pij.
Pij = P Xm+1 = j | Xm =i (1)
Where
Pij The probability of entering the state j when a node is in the operational state i .
The migration probability of second-order is defined as P2
ij that is, a node in the current state of
3. International Journal of Distributed and Parallel Systems (IJDPS) Vol.5, No.1/2/3, May 2014
31
i will enter the state j after having two state transitions. (i.e.)
This can be calculated by the following formula:
The migration probability of n order is denoted as
which is taken from the chapman- kolomogorov equation: P2
ij
Where
γ can take any arbitrary values between 0 and n.
A further notation of Markov chain for probability is to use M*M matrix of P which is called as
migration probability matrix. In this matrix, the element Pij represents the probability in the i th
row and j th column.
Here, P2
can be calculated by P*P and in general, P(m+n)
=P(m)
*P(n)
which is similar to
By migration probability matrix and the initial X0 of each node, we can build the sequence while
comparing energy consumption and mobility for the entire MANET. If a node travels from ith
state to sth
state, then the number of time domains the node remains in the sth
state is given by:
Assuming that BS is the data transmissible data quantity of a node stays at state s. then after
calculating the number of domains, the total data transmissible quantity is given by the formula:
4. International Journal of Distributed and Parallel Systems (IJDPS) Vol.5, No.1/2/3, May 2014
32
And also the data of each node in the time can be calculated by equation (7).the transmissible data
quantity for the total number of nodes in a cluster is given by
Where
Ck→ it is to represent ith
node, in cluster Ck.
Pis
(t)
→ is the probability from i th state migrating to the sth
state.
4. EXPERIMENTAL ANALYSIS AND RESULTS
Generally, networks of nodes are created which generates its traffic randomly with specific
direction and velocity. Using ARMA algorithm, traffic prediction for single node is found by
equation (7) and also traffic prediction for cluster of different nodes is calculated by equation (8).
Using intrusion detection system, detected traffic for each node is analyzed which results node
with high traffic is finally concluded as wormhole. Further this paper focused on detecting
anomalies caused by the invasion and leaving decision making and counter measures.
5. International Journal of Distributed and Parallel Systems (IJDPS) Vol.5, No.1/2/3, May 2014
33
SCREEN SHOT 1:
This screen capture shows the combined execution of both prediction data algorithm and the
wormhole detection algorithm. Since the predicted data is got from the ARMA algorithm, it uses
probability matrix i.e the probability of a nodes to go from state 'i' to state 'j' after time ‘t’ is
shown in the above result.
In order to deduce the relation between the threshold and network attributes first we have to
stumble on the relationship between the varying network characteristics and the normalized data.
For this we reflect on the data present in each node, number of nodes, time instants etc.
Varying the network attributes like amount of data in nodes, number of nodes, number of time
instants, the results have been simulated.
6. International Journal of Distributed and Parallel Systems (IJDPS) Vol.5, No.1/2/3, May 2014
34
4.1. Analysis Using Data
By varying the amount of data in each node in both prediction algorithm and wormhole detection
algorithm, the total predicted data the actual data in the wormhole and the data in other nodes
after certain number of transmissions is analyzed.
S.NO Data in each node Predicted Data Actual data in
wormhole
Data in other
nodes
1 2,2,2 11.88001 12 5,3
2 2,4,6 28.20005 28 3,7
3 5,10,15 43.2000 55 6,16
4 20,30,40 129.60086 170 21,51
5 60,70,80 189.000031 410 61, 131
6 50,100, 150 180 550 51, 151
Table1.Analysis Using Data
This table (1) describes the relation between the predicted data and actual data in wormhole by
varying the amount of data in each node. The inference is that data in wormhole is more than data
in other nodes. More the increase in data in each node more will be the variation in predicted and
the actual one. With this variation into concern the below graph is plotted.
Fig. 1 Variance Vs Normalized data
The Fig 1 is plotted against variance calculated from the amount of data in each node, and the
normalized data calculated from the formula
Normalized data = Predicted Data – Actual Data (9)
Predicted Data
7. International Journal of Distributed and Parallel Systems (IJDPS) Vol.5, No.1/2/3, May 2014
35
This graph infers that there is a diminishing relation between the amount of data in each node,
and the normalized data which is above calculated.
4.2. Analysis Using Number of nodes
By varying the number of nodes in both prediction algorithm and wormhole detection algorithm,
the total predicted data, the actual data in the wormhole and the data in other nodes after certain
number of transmissions is analyzed.
Table 2.Analysis Using Number of nodes
S.
No
No. of
nodes
Data in each node Prediction
data
Actual
data in
worm
hole
Data in other
nodes
No.
of txm
1 4 20,30,40,50 1783.5 291 22, 51,110 4
2 5 20,30,40,50,60 5723.22 391 22, 51, 91 5
3 6 20,30,40,50,60,70 9007.2 551 22,52,91,110,101 6
4 7 20,30,40,50,60,70,80 25278 651 22,51,91, 111 7
5 8 20,30,40,50,60,
70,80,90
33282 811 22,51,91,111,131 8
6 9 20,30,40,50,60 5116.4 991 22,51,91,111 9
This table 2 infers that while varying the number of nodes a suitable relation is formed between
the predicted data and actual value of data from which a graph is plotted.
Fig. 2 No. of Nodes Vs Normalized data
8. International Journal of Distributed and Parallel Systems (IJDPS) Vol.5, No.1/2/3, May 2014
36
This Fig. 2 infers that there is some linear relation between the varying nodes and the normalized
value calculated from the above equation (9) by tagging the varying number of nodes in the X-
axis.
4.3. Analysis Using Number of Time instants
By varying the time instants in this table (3) a graph with some relation between the normalized
data and the variable instants is plotted.
This fig (3) shows a decreasing relation on comparing the normalized data and the number of
time instants by labelling them in the Y-axis and X- axis respectively.
The scenario of a Mobile Ad hoc network with a source node, destination node, route and
wormholes is shaped in NS2 and the NAM output visualizes the node topology, connectivity,
traffic or packet trace information carried out in MANET.
Comprehensive analysis of node.cc and its header files should be done, alterations should be
made in NS2. Then by varying the parameters one by one threshold is deduced.
Table 3. Analysis using no. of Time Instants
9. International Journal of Distributed and Parallel Systems (IJDPS) Vol.5, No.1/2/3, May 2014
37
Fig.3. No. of Time Instants Vs Normalized Data
5. RELATION BETWEEN NETWORK ATTRIBUTES AND
THRESHOLD VALUES
Assume different threshold values and then experiment it with a network having characteristics
like number of nodes, traffic intensity, node density and also wormhole density. And then, find
false alarm rates for each assumed threshold values. The detection rate performance is highest for
one threshold value for this network of certain parameters. The experiment is then repeated by
varying the characteristics of the network and similar threshold values with best performance are
obtained. Such threshold values of highest detection rate performance are found for each network
with varying parameters. A mathematical relation is then deduced between the parameters of the
network and such obtained threshold values. Based on this relation, an optimal threshold value
with least false alarm rate can be selected for a network with any parameter set. This experiment
is simulated in NS2 and the expected result would be in the form of a mathematical expression
obtained by theoretical analysis.
6. THRESHOLD SELECTION
The normal and the abnormal traffic are differentiated using a threshold value. Thus suitable
selection and the correct threshold value add an extra advantage for IDS to detect anomalies in
the network. Selecting inaccurate threshold value will cause an excessive false alarm especially if
the value is too low or if it is too high, it can cause the intrusion activity being considered as
normal traffic. Most of the research does not propose a proper technique to identify the threshold
technique. Here threshold is determined by dynamic techniques. Dynamic threshold technique
requires prior knowledge of the network traffic before the threshold value can be selected.
7. CONCLUSION
In this paper, anomaly detection and security scheme based on Markov model is used by each
node in MANET to predict traffic (TPIDS). All the above analysis shows that there exists a
perceptible relation obtained by altering the network attributes, with this noticeable relation it is
evident that there prevails an optimal threshold based on this relation. On deriving this relation
wormhole detection can be ended in single phase. This relation is malleable to the protocol
10. International Journal of Distributed and Parallel Systems (IJDPS) Vol.5, No.1/2/3, May 2014
38
DSDV which finds the wormhole by using shortest distance, hence in future work the optimal
threshold for other routing protocols such as AODV etc can be deduced.
REFERENCES
[1] C Han Zhijie, Wang Ruchuang: ‘Intrusion Detection for Wireless Sensor Network Based on Traffic
Prediction Model’, 2012 International Conference on Solid State Devices and Materials Science.
[2] Faizal M. A., Mohd Zaki M., Shahrin S., Robiah Y, Siti Rahayu S., Nazrulazhar B.: ‘Threshold
Verification Technique for Network Intrusion Detection System’, (IJCSIS) International Journal of
Computer Science and Information Security,Vol. 2, No. 1, 2009.
[3] Ankita Gupta,Sanjay Prakash Ranga: ‘Wormhole Detection Methods In Manet’,International Journal
Of Enterprise Computing And Business Systems(IJECBS), Vol. 2 Issue 2 July 2012.
[4] Moutushi Singh, Rupayan Das: ‘A Survey Of Different Techniques For Detection of Wormhole
Attack In Wireless Sensor Network’ , International Journal of Scientific & Engineering Research
Volume 3, Issue 10, October-2012 .
[5] Murad A. Rassam, M.A. Maarof and Anazida Zainal: ‘A Survey of Intrusion Detection Schemes in
Wireless Sensor Networks’ American Journal of Applied Sciences, 2012.
[6] Khin Sandar Win, Pathein Gyi: ‘Analysis of Detecting Wormhole Attack in Wireless Networks’,
World Academy of Science, Engineering and Technology , 2008.
[7] Lukman Sharif and Munir Ahmed, ‘The Wormhole Routing Attack in Wireless Sensor Networks
(WSN)’, Journal of Information Processing Systems, Vol.6, No.2, June 2010.
[8] Jing Deng, Richard Han, and Shivakant Mishra, ‘Defending against Pathbased DoS Attacks in
Wireless Sensor Networks’ SASN’05, November 7, 2005.
[9] Llker Demirkol, Fatih Alag¨oz,Hakan Delic, Cem Ersoy. Wireless Sensor Networks for
IntrusionDetection:PacketTrafficModeling[EB/OL].www.cmpe.boun.edu.tr/~ilker/IlkerDE
MIRKOL_COMML_ext_abstract . pdf.
[10] Onat I , Miri A. ‘An intrusion detection system for wireless sensor networks/Proceedings of the IEEE
International Conference on Wireless and Mobile Computing’ , Networking and Communications
(WiMOB’05) Mont real , Canada , 2005.
Authors
C.Susil Kumar received his B.E degree in Electronics and Instrumentation from
Madras University, India in 2001 and M.Tech degree in Communication Engineering
from Vellore Institute of Technology, India, in 2004. He is working as Assistant
Professor in the Department of Electronics and Communication Engineering,
Velammal College of Engineering and Technology, Madurai. His research interests
include Wireless Communication and Ad hoc Networks.
K.Aathi Dharshini is pursuing M.E Communication systems in Velammal College of
Engineering and Technology,Madurai.She received her B.E degree in R.V.S College
of Engineering and Technology, affiliated under Anna university, India, in 2012. Her
area of interest include Wireless Ad hoc Networks.
E.BabuThirumangaiAlwar received his B.E degree in Electronics and
Communication Engineering from Manonmaniam Sundaranar University, India in
1998 and M.E degree in Computer Science and Engineering from Anna University of
Technology, Tiruchirappalli, India, in 2010. He is working as Assistant Professor in
the Department of Computer Science and Engineering, Hindusthan Institute of
Technology, Coimbatore. His research interests include Wireless Communication
and Adhoc Networks.