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.
Elimination of wormhole attacker node in manet using performance evaluation m...Alexander Decker
This document summarizes a research paper that proposes a new method for detecting wormhole attacker nodes in mobile ad hoc networks (MANETs). The method detects malicious nodes based on analyzing hop counts and time delays in routes, without requiring any special hardware or protocol modifications. The proposed method is simulated using OPNET software with scenarios of 50 nodes, both with and without wormhole attacks. The results show that without prevention, a wormhole attack decreases average hop count and increases delays. However, when the proposed method is applied, it is able to detect the attacker nodes and avoid their paths, regaining normal hop counts and delays.
Selective jamming attack prevention based on packet hiding methods and wormholesIJNSA Journal
Because of the widespread use of wireless sensor ne
tworks in many applications, and due to the nature
of
the specifications of these networks (WSN) in terms
of wireless communication, the network contract
specifications, and published it in difficult envir
onments. All this leads to the network exposure to
many
types of external attacks. Therefore, the protectio
n of these networks from external attacks is consid
ered the
one of the most important researches at this time.
In this paper we investigated the security in wirel
ess
sensor networks, Limitations of WSN, Characteristic
Values for some types of attacks, and have been
providing protection mechanism capable of detecting
and protecting wireless sensor networks from a wid
e
range of attacks
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.
CLUSTER BASED FIDELITY TO SECURE DSDV PROTOCOL AGAINST BLACK HOLE ATTACKSpijans
In this paper, we introduce and discuss an approach that will be used to secure the DSDV routing protocol in an ad-hoc network. Due to mobility and absence of infrastructure, nodes are more vulnerable to several malicious attacks. The secure routing is essential to transmit packets from source to the destination. Our approach consists to model and manage fidelity concept in an ad-hoc clustering architecture. Clustering makes it possible to group the mobile nodes and to send data simultaneously to the each group. Our security model thus aims to integrate mechanisms against black hole attacks, forcing cooperation between nodes and detecting failing behaviors. The nodes present in the clusters will work more efficiently and the message passing within the nodes will also get more authenticated from the cluster heads. The simulation of our proposed algorithm is carried out using NS2 network simulator by evaluating some network performances such as average delay, throughput of communication and packets loss.
Wireless Sensor Network (WSN) consists of large number of sensor nodes capable of forming
instantaneous network with dynamic topology. Each node simultaneously as both router and
host. Number of nodes in a WSN can vary either due to the mobility or death of nodes due to
drained conditions. Low Energy Aware Cluster Hierarchy (LEACH) is a most popular dynamic
clustering protocol for WSN. Deployment in unattended environment, limited memory, limited
power and low computational power of a sensor node make these networks susceptible to
attacks launched by malicious nodes. This paper provides an overview of LEACH protocol and
how LEACH can be compromised by malicious nodes. We propose a attack on LEACH –
Snooze attack. This paper we present a way to simulate this attack on NS-2 which is
demonstrative on throughput. We observe that during simulation throughput drops as an effect
of attack. It is observed that the effect of the attack gets aggregated as we increase the number
of attackers.
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.
Effective Identification of Packet Droppers and Modifiers in Wireless Sensor ...IJMTST Journal
In Wireless sensor network, sensor nodes are used to monitor physical or environmental condition. Sensor
networks are often deployed in an unattended and hostile environment to perform the monitoring and data
collection tasks. When it is deployed in such an environment, it lacks physical protection and subjected to
node compromise. After compromising one or multiple sensor nodes, an adversary may launch various
attacks to disrupt the in-network communication. Among these attacks, two common ones are dropping
packets and modifying packet. In this paper, we propose a simple yet effective scheme to identify
misbehaving forwarders that drop or modify packets. Node Categorization algorithm and Global Ranking
algorithm are
A Novel Method for Preventing Selective Jamming Attacks in Wireless NetworksIJMER
The document proposes three novel methods to prevent selective jamming attacks in wireless networks:
1. Strong Hiding Commitment Scheme (SHCS) which uses asymmetric cryptography to commit a sender to a value while keeping it hidden.
2. Cryptographic Puzzle Hiding Scheme which generates puzzles that force attackers to spend time solving before obtaining secret keys.
3. Hiding based on All-Or-Nothing Transformation which partitions messages into blocks that are meaningless individually, preventing selective jamming until all blocks are received.
Elimination of wormhole attacker node in manet using performance evaluation m...Alexander Decker
This document summarizes a research paper that proposes a new method for detecting wormhole attacker nodes in mobile ad hoc networks (MANETs). The method detects malicious nodes based on analyzing hop counts and time delays in routes, without requiring any special hardware or protocol modifications. The proposed method is simulated using OPNET software with scenarios of 50 nodes, both with and without wormhole attacks. The results show that without prevention, a wormhole attack decreases average hop count and increases delays. However, when the proposed method is applied, it is able to detect the attacker nodes and avoid their paths, regaining normal hop counts and delays.
Selective jamming attack prevention based on packet hiding methods and wormholesIJNSA Journal
Because of the widespread use of wireless sensor ne
tworks in many applications, and due to the nature
of
the specifications of these networks (WSN) in terms
of wireless communication, the network contract
specifications, and published it in difficult envir
onments. All this leads to the network exposure to
many
types of external attacks. Therefore, the protectio
n of these networks from external attacks is consid
ered the
one of the most important researches at this time.
In this paper we investigated the security in wirel
ess
sensor networks, Limitations of WSN, Characteristic
Values for some types of attacks, and have been
providing protection mechanism capable of detecting
and protecting wireless sensor networks from a wid
e
range of attacks
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.
CLUSTER BASED FIDELITY TO SECURE DSDV PROTOCOL AGAINST BLACK HOLE ATTACKSpijans
In this paper, we introduce and discuss an approach that will be used to secure the DSDV routing protocol in an ad-hoc network. Due to mobility and absence of infrastructure, nodes are more vulnerable to several malicious attacks. The secure routing is essential to transmit packets from source to the destination. Our approach consists to model and manage fidelity concept in an ad-hoc clustering architecture. Clustering makes it possible to group the mobile nodes and to send data simultaneously to the each group. Our security model thus aims to integrate mechanisms against black hole attacks, forcing cooperation between nodes and detecting failing behaviors. The nodes present in the clusters will work more efficiently and the message passing within the nodes will also get more authenticated from the cluster heads. The simulation of our proposed algorithm is carried out using NS2 network simulator by evaluating some network performances such as average delay, throughput of communication and packets loss.
Wireless Sensor Network (WSN) consists of large number of sensor nodes capable of forming
instantaneous network with dynamic topology. Each node simultaneously as both router and
host. Number of nodes in a WSN can vary either due to the mobility or death of nodes due to
drained conditions. Low Energy Aware Cluster Hierarchy (LEACH) is a most popular dynamic
clustering protocol for WSN. Deployment in unattended environment, limited memory, limited
power and low computational power of a sensor node make these networks susceptible to
attacks launched by malicious nodes. This paper provides an overview of LEACH protocol and
how LEACH can be compromised by malicious nodes. We propose a attack on LEACH –
Snooze attack. This paper we present a way to simulate this attack on NS-2 which is
demonstrative on throughput. We observe that during simulation throughput drops as an effect
of attack. It is observed that the effect of the attack gets aggregated as we increase the number
of attackers.
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.
Effective Identification of Packet Droppers and Modifiers in Wireless Sensor ...IJMTST Journal
In Wireless sensor network, sensor nodes are used to monitor physical or environmental condition. Sensor
networks are often deployed in an unattended and hostile environment to perform the monitoring and data
collection tasks. When it is deployed in such an environment, it lacks physical protection and subjected to
node compromise. After compromising one or multiple sensor nodes, an adversary may launch various
attacks to disrupt the in-network communication. Among these attacks, two common ones are dropping
packets and modifying packet. In this paper, we propose a simple yet effective scheme to identify
misbehaving forwarders that drop or modify packets. Node Categorization algorithm and Global Ranking
algorithm are
A Novel Method for Preventing Selective Jamming Attacks in Wireless NetworksIJMER
The document proposes three novel methods to prevent selective jamming attacks in wireless networks:
1. Strong Hiding Commitment Scheme (SHCS) which uses asymmetric cryptography to commit a sender to a value while keeping it hidden.
2. Cryptographic Puzzle Hiding Scheme which generates puzzles that force attackers to spend time solving before obtaining secret keys.
3. Hiding based on All-Or-Nothing Transformation which partitions messages into blocks that are meaningless individually, preventing selective jamming until all blocks are received.
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.
This document discusses using threshold cryptography and maximum distance separable (MDS) codes for key management in mobile ad hoc networks (MANETs). It begins with an introduction to MANETs and the need for distributed key management approaches. It then provides background on threshold cryptography and MDS codes. The document proposes using threshold cryptography combined with MDS codes to create a distributed cooperative key management system for MANETs that generates and distributes encryption keys among network nodes in a secure and fault-tolerant manner.
EAASR: Enhanced AASR Protocol to Reduce Traffic and Eliminate the Malicious N...paperpublications3
1) The document proposes an enhanced authenticated anonymous secure routing (EAASR) protocol for mobile ad hoc networks to improve security, reduce delay, and eliminate malicious nodes. EAASR uses dummy nodes, group elliptical signature, and onion routing techniques to provide anonymity and prevent traffic analysis attacks.
2) Simulation results show that EAASR achieves lower packet loss and end-to-end delay than existing protocols like AASR, ANODR, and AODV. EAASR misleads attackers by using dummy nodes for neighborhood communication while the actual communication path between source and destination remains anonymous and reliable.
3) Future work will focus on improving security by only using validated secure paths and avoiding unwanted
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.
Modeling and prevention of cell counting based attacks on toreSAT Journals
Abstract Many anonymous networks came into existence. For instance Tor allows its users to gain access to services anonymously. This network causes most of the attacks as the adversaries can hide their identity and make attacks successfully from a remote place. By making a new attack on Tor can find the vulnerability of the Tor. Ling et al. presented a new cell counting mechanism for making an attack on Tor. In this paper we implemented a custom simulator that models a Tor and demonstrates the cell counting attack by simulating nodes like sender, receiver, onion router and attacker. The experimental results revealed that the proposed attack mechanism is effective. Keywords: Anonymous network, Tor, attacker model, cell counting
Efficient security approaches in mobile ad hoc networks a surveyeSAT Publishing House
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology
Prevention of Packet Hiding Methods In Selective Jamming AttackIJCERT
The sharing nature of wireless medium provides various challenging features among various set of users. It is very important in real world and it provides better transfer rate but authentication is ignored. The limitations of existing wired network are overcome by wireless network. These networks act as source for various types of jamming attacks. In analysis and detection of jamming attack various methods are available but sometime they fail. In case of external threat the analysis and reporting of jamming attack is very easy model but it is quite difficult in terms of internal threat model, these internal term uses the knowledge about network secrets and network protocols to launch various attacks with very low effort. Various cryptographic techniques are implemented to prevent these attacks. The main goal of this project is to prevent the information at the wireless physical layer and allowed the safe transmission among communicated nodes although the attacker is present.
Malicious Node Detection Mechanism for Wireless Ad Hoc NetworkCSCJournals
With the popularity of intelligent electronics which rely on wireless communication in the post-PC era, computing devices have become cheaper, smaller, more mobile and more pervasive in daily lives. Construction of wireless ad hoc network becomes more and more convenient. However, the deployment of sensor nodes in an unattended environment makes the networks vulnerable to a variety of potential attacks. We present a malicious node detection mechanism. In using a monitoring mechanism to detect suspicious behavior, and on the basis of the responses from other monitoring nodes, if the number of suspicious entries concerning a particular node reaches a set threshold, that node is declared malicious. The simulation results show that the time it takes to detect a malicious node is decreased when there are more nodes in the network, and that it provides a fast and efficient way to detect malicious nodes.
This document proposes a scalable authentication scheme for wireless sensor networks based on elliptic curve cryptography. The proposed scheme allows nodes to transmit an unlimited number of messages without suffering from the threshold problem that exists in polynomial-based schemes. It provides hop-by-hop authentication to verify messages as they are forwarded and also provides source privacy by anonymizing the message sender. Both theoretical analysis and simulation results show the proposed scheme has lower communication and computation overhead than polynomial-based schemes under comparable security levels, while providing source anonymity.
This document proposes a scalable authentication scheme for wireless sensor networks based on elliptic curve cryptography. The proposed scheme allows nodes to transmit an unlimited number of messages without suffering from the threshold problem that exists in polynomial-based schemes. It provides hop-by-hop authentication to verify messages as they are forwarded and also provides source privacy by anonymizing the message sender. Both theoretical analysis and simulation results show the proposed scheme has lower communication and computation overhead than polynomial-based schemes under comparable security levels, while providing source anonymity.
A new ids scheme against blackhole attack to enhance security in wireless net...eSAT Journals
Abstract The aim of this paper is to protect the wireless network against the blackhole attack. Blackhole attack, as the name suggest, drops all the packets forwarded to it. In this paper, we have proposed an intrusion detection system (IDS) scheme to detect the malicious node (blackhole node) and to nullify its effect in the network. The proposed IDS scheme in the presence of blackhole attack gives approximately similar result as that of in the absence of attack. The network comprises for the three modules (i) Default AODV, (ii) AODV in the presence of blackhole attack and (iii) IDS scheme in the presence of attack by considering some parameters such as end to end delay, throughput, packet delivery ratio, normalized routing load etc. The proposed algorithm has been simulated on Network Simulator version-2 (NS-2). Key Words: AODV, Blackhole attack, DSN, IDS scheme, routing misbehavior, security
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
Secure multipath routing scheme using keyijfcstjournal
Multipath routing in WSN has been a long wish in security scenario where nodes on next-hop may be
targeted to compromise. Many proposals of Multipath routing has been proposed in ADHOC Networks but
under constrained from keying environment most seems ignorant. In WSN where crucial data is reported by
nodes in deployment area to their securely located Sink, route security has to be guaranteed. Under
dynamic load and selective attacks, availability of multiple secure paths is a boon and increases the
attacker efforts by many folds. We propose to build a subset of neighbors as our front towards destination
node. We also identified forwarders for query by base station. The front is optimally calculated to maintain
the security credential and avail multiple paths. According to our knowledge ours is a novel secure
multipath routing protocol for WSN. We established effectiveness of our proposal with mathematical
analysis.
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.
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.
Performance Comparison of Cluster based and Threshold based Algorithms for De...Eswar Publications
In mobile ad-hoc networks (MANET), the movement of the nodes may quickly change the networks topology resulting in the increase of the overhead message in topology maintenance. The nodes communicate with each other by exchanging the hello packet and constructing the neighbor list at each node. MANET is vulnerable to attacks such as black hole attack, gray hole attack, worm hole attack and sybil attack. A black hole attack makes a serious impact on routing, packet delivery ratio, throughput, and end to end delay of packets. In this paper, the performance comparison of clustering based and threshold based algorithms for detection and prevention of
cooperative in MANETs is examined. In this study every node is monitored by its own cluster head (CH), while server (SV) monitors the entire network by channel overhearing method. Server computes the trust value based on sent and receive count of packets of the receiver node. It is implemented using AODV routing protocol in the NS2 simulations. The results are obtained by comparing the performance of clustering based and threshold based methods by varying the concentration of black hole nodes and are analyzed in terms of throughput,
packet delivery ratio. The results demonstrate that the threshold based method outperforms the clustering based method in terms of throughput, packet delivery ratio and end to end delay.
WDA: Wormhole Attack Detection Algorithm based on measuring Round Trip Delay ...ijsrd.com
The recent advancements in the wireless arena and their wide-spread utilization have introduced new security vulnerabilities. The wireless media being shared is exposed to outside world, so it is susceptible to various attacks at different layers of OSI network stack. For example, jamming and device tampering at the physical layer; disruption of the medium access control (MAC) layer; routing attacks like Blackhole, rushing, wormhole; targeted attacks on the transport protocol like session hijacking, SYN flooding or even attacks intended to disrupt specific applications through viruses, worms and Trojan Horses. Wormhole attack is one of the serious routing attacks amongst all the network layer attacks launched on MANET. Wormhole attack is launched by creation of tunnels and it leads to total disruption of the routing paths on MANET. In this paper, Wormhole detection algorithm (WDA) is proposed based on modifying the forwarding packet process that detects and isolates wormhole nodes in ad hoc on demand distance vector (AODV) routing protocol.
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.
CLUSTER BASED FIDELITY TO SECURE DSDV PROTOCOL AGAINST BLACK HOLE ATTACKSpijans
In this paper, we introduce and discuss an approach that will be used to secure the DSDV routing
protocol in an ad-hoc network. Due to mobility and absence of infrastructure, nodes are more vulnerable
to several malicious attacks. The secure routing is essential to transmit packets from source to the
destination. Our approach consists to model and manage fidelity concept in an ad-hoc clustering
architecture. Clustering makes it possible to group the mobile nodes and to send data simultaneously to
the each group. Our security model thus aims to integrate mechanisms against black hole attacks, forcing cooperation between nodes and detecting failing behaviors. The nodes present in the clusters will work
more efficiently and the message passing within the nodes will also get more authenticated from the
cluster heads. The simulation of our proposed algorithm is carried out using NS2 network simulator by evaluating some network performances such as average delay, throughput of communication and packets
loss
CLUSTER BASED FIDELITY TO SECURE DSDV PROTOCOL AGAINST BLACK HOLE ATTACKSpijans
In this paper, we introduce and discuss an approach that will be used to secure the DSDV routing
protocol in an ad-hoc network. Due to mobility and absence of infrastructure, nodes are more vulnerable
to several malicious attacks. The secure routing is essential to transmit packets from source to the
destination. Our approach consists to model and manage fidelity concept in an ad-hoc clustering
architecture. Clustering makes it possible to group the mobile nodes and to send data simultaneously to
the each group. Our security model thus aims to integrate mechanisms against black hole attacks, forcing
cooperation between nodes and detecting failing behaviors. The nodes present in the clusters will work
more efficiently and the message passing within the nodes will also get more authenticated from the
cluster heads. The simulation of our proposed algorithm is carried out using NS2 network simulator by
evaluating some network performances such as average delay, throughput of communication and packets
loss.
CLUSTER BASED FIDELITY TO SECURE DSDV PROTOCOL AGAINST BLACK HOLE ATTACKSpijans
In this paper, we introduce and discuss an approach that will be used to secure the DSDV routing
protocol in an ad-hoc network. Due to mobility and absence of infrastructure, nodes are more vulnerable
to several malicious attacks. The secure routing is essential to transmit packets from source to the
destination. Our approach consists to model and manage fidelity concept in an ad-hoc clustering
architecture. Clustering makes it possible to group the mobile nodes and to send data simultaneously to
the each group. Our security model thus aims to integrate mechanisms against black hole attacks, forcing
cooperation between nodes and detecting failing behaviors. The nodes present in the clusters will work
more efficiently and the message passing within the nodes will also get more authenticated from the
cluster heads. The simulation of our proposed algorithm is carried out using NS2 network simulator by
evaluating some network performances such as average delay, throughput of communication and packets
loss.
Reactive Routing approach for preventing wormhole attack using hybridized WHOPIOSR Journals
This document describes a proposed approach to prevent wormhole attacks in mobile ad hoc networks. Wormhole attacks involve tunneling packets between two distant nodes, making routes through the wormhole appear shorter than actual routes. The proposed approach hybridizes the WHOP wormhole detection protocol with time synchronization to more efficiently detect wormholes and reduce routing delays. It works by having the source node send a "hound packet" after route discovery to check for inconsistencies that could indicate a wormhole. Receiving nodes process the hound packet to detect abnormal hop counts or delays that would out a wormhole. Simulation results show this approach can secure data transmission while minimizing delays without expensive hardware.
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.
This document discusses using threshold cryptography and maximum distance separable (MDS) codes for key management in mobile ad hoc networks (MANETs). It begins with an introduction to MANETs and the need for distributed key management approaches. It then provides background on threshold cryptography and MDS codes. The document proposes using threshold cryptography combined with MDS codes to create a distributed cooperative key management system for MANETs that generates and distributes encryption keys among network nodes in a secure and fault-tolerant manner.
EAASR: Enhanced AASR Protocol to Reduce Traffic and Eliminate the Malicious N...paperpublications3
1) The document proposes an enhanced authenticated anonymous secure routing (EAASR) protocol for mobile ad hoc networks to improve security, reduce delay, and eliminate malicious nodes. EAASR uses dummy nodes, group elliptical signature, and onion routing techniques to provide anonymity and prevent traffic analysis attacks.
2) Simulation results show that EAASR achieves lower packet loss and end-to-end delay than existing protocols like AASR, ANODR, and AODV. EAASR misleads attackers by using dummy nodes for neighborhood communication while the actual communication path between source and destination remains anonymous and reliable.
3) Future work will focus on improving security by only using validated secure paths and avoiding unwanted
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.
Modeling and prevention of cell counting based attacks on toreSAT Journals
Abstract Many anonymous networks came into existence. For instance Tor allows its users to gain access to services anonymously. This network causes most of the attacks as the adversaries can hide their identity and make attacks successfully from a remote place. By making a new attack on Tor can find the vulnerability of the Tor. Ling et al. presented a new cell counting mechanism for making an attack on Tor. In this paper we implemented a custom simulator that models a Tor and demonstrates the cell counting attack by simulating nodes like sender, receiver, onion router and attacker. The experimental results revealed that the proposed attack mechanism is effective. Keywords: Anonymous network, Tor, attacker model, cell counting
Efficient security approaches in mobile ad hoc networks a surveyeSAT Publishing House
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology
Prevention of Packet Hiding Methods In Selective Jamming AttackIJCERT
The sharing nature of wireless medium provides various challenging features among various set of users. It is very important in real world and it provides better transfer rate but authentication is ignored. The limitations of existing wired network are overcome by wireless network. These networks act as source for various types of jamming attacks. In analysis and detection of jamming attack various methods are available but sometime they fail. In case of external threat the analysis and reporting of jamming attack is very easy model but it is quite difficult in terms of internal threat model, these internal term uses the knowledge about network secrets and network protocols to launch various attacks with very low effort. Various cryptographic techniques are implemented to prevent these attacks. The main goal of this project is to prevent the information at the wireless physical layer and allowed the safe transmission among communicated nodes although the attacker is present.
Malicious Node Detection Mechanism for Wireless Ad Hoc NetworkCSCJournals
With the popularity of intelligent electronics which rely on wireless communication in the post-PC era, computing devices have become cheaper, smaller, more mobile and more pervasive in daily lives. Construction of wireless ad hoc network becomes more and more convenient. However, the deployment of sensor nodes in an unattended environment makes the networks vulnerable to a variety of potential attacks. We present a malicious node detection mechanism. In using a monitoring mechanism to detect suspicious behavior, and on the basis of the responses from other monitoring nodes, if the number of suspicious entries concerning a particular node reaches a set threshold, that node is declared malicious. The simulation results show that the time it takes to detect a malicious node is decreased when there are more nodes in the network, and that it provides a fast and efficient way to detect malicious nodes.
This document proposes a scalable authentication scheme for wireless sensor networks based on elliptic curve cryptography. The proposed scheme allows nodes to transmit an unlimited number of messages without suffering from the threshold problem that exists in polynomial-based schemes. It provides hop-by-hop authentication to verify messages as they are forwarded and also provides source privacy by anonymizing the message sender. Both theoretical analysis and simulation results show the proposed scheme has lower communication and computation overhead than polynomial-based schemes under comparable security levels, while providing source anonymity.
This document proposes a scalable authentication scheme for wireless sensor networks based on elliptic curve cryptography. The proposed scheme allows nodes to transmit an unlimited number of messages without suffering from the threshold problem that exists in polynomial-based schemes. It provides hop-by-hop authentication to verify messages as they are forwarded and also provides source privacy by anonymizing the message sender. Both theoretical analysis and simulation results show the proposed scheme has lower communication and computation overhead than polynomial-based schemes under comparable security levels, while providing source anonymity.
A new ids scheme against blackhole attack to enhance security in wireless net...eSAT Journals
Abstract The aim of this paper is to protect the wireless network against the blackhole attack. Blackhole attack, as the name suggest, drops all the packets forwarded to it. In this paper, we have proposed an intrusion detection system (IDS) scheme to detect the malicious node (blackhole node) and to nullify its effect in the network. The proposed IDS scheme in the presence of blackhole attack gives approximately similar result as that of in the absence of attack. The network comprises for the three modules (i) Default AODV, (ii) AODV in the presence of blackhole attack and (iii) IDS scheme in the presence of attack by considering some parameters such as end to end delay, throughput, packet delivery ratio, normalized routing load etc. The proposed algorithm has been simulated on Network Simulator version-2 (NS-2). Key Words: AODV, Blackhole attack, DSN, IDS scheme, routing misbehavior, security
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
Secure multipath routing scheme using keyijfcstjournal
Multipath routing in WSN has been a long wish in security scenario where nodes on next-hop may be
targeted to compromise. Many proposals of Multipath routing has been proposed in ADHOC Networks but
under constrained from keying environment most seems ignorant. In WSN where crucial data is reported by
nodes in deployment area to their securely located Sink, route security has to be guaranteed. Under
dynamic load and selective attacks, availability of multiple secure paths is a boon and increases the
attacker efforts by many folds. We propose to build a subset of neighbors as our front towards destination
node. We also identified forwarders for query by base station. The front is optimally calculated to maintain
the security credential and avail multiple paths. According to our knowledge ours is a novel secure
multipath routing protocol for WSN. We established effectiveness of our proposal with mathematical
analysis.
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.
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.
Performance Comparison of Cluster based and Threshold based Algorithms for De...Eswar Publications
In mobile ad-hoc networks (MANET), the movement of the nodes may quickly change the networks topology resulting in the increase of the overhead message in topology maintenance. The nodes communicate with each other by exchanging the hello packet and constructing the neighbor list at each node. MANET is vulnerable to attacks such as black hole attack, gray hole attack, worm hole attack and sybil attack. A black hole attack makes a serious impact on routing, packet delivery ratio, throughput, and end to end delay of packets. In this paper, the performance comparison of clustering based and threshold based algorithms for detection and prevention of
cooperative in MANETs is examined. In this study every node is monitored by its own cluster head (CH), while server (SV) monitors the entire network by channel overhearing method. Server computes the trust value based on sent and receive count of packets of the receiver node. It is implemented using AODV routing protocol in the NS2 simulations. The results are obtained by comparing the performance of clustering based and threshold based methods by varying the concentration of black hole nodes and are analyzed in terms of throughput,
packet delivery ratio. The results demonstrate that the threshold based method outperforms the clustering based method in terms of throughput, packet delivery ratio and end to end delay.
WDA: Wormhole Attack Detection Algorithm based on measuring Round Trip Delay ...ijsrd.com
The recent advancements in the wireless arena and their wide-spread utilization have introduced new security vulnerabilities. The wireless media being shared is exposed to outside world, so it is susceptible to various attacks at different layers of OSI network stack. For example, jamming and device tampering at the physical layer; disruption of the medium access control (MAC) layer; routing attacks like Blackhole, rushing, wormhole; targeted attacks on the transport protocol like session hijacking, SYN flooding or even attacks intended to disrupt specific applications through viruses, worms and Trojan Horses. Wormhole attack is one of the serious routing attacks amongst all the network layer attacks launched on MANET. Wormhole attack is launched by creation of tunnels and it leads to total disruption of the routing paths on MANET. In this paper, Wormhole detection algorithm (WDA) is proposed based on modifying the forwarding packet process that detects and isolates wormhole nodes in ad hoc on demand distance vector (AODV) routing protocol.
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.
CLUSTER BASED FIDELITY TO SECURE DSDV PROTOCOL AGAINST BLACK HOLE ATTACKSpijans
In this paper, we introduce and discuss an approach that will be used to secure the DSDV routing
protocol in an ad-hoc network. Due to mobility and absence of infrastructure, nodes are more vulnerable
to several malicious attacks. The secure routing is essential to transmit packets from source to the
destination. Our approach consists to model and manage fidelity concept in an ad-hoc clustering
architecture. Clustering makes it possible to group the mobile nodes and to send data simultaneously to
the each group. Our security model thus aims to integrate mechanisms against black hole attacks, forcing cooperation between nodes and detecting failing behaviors. The nodes present in the clusters will work
more efficiently and the message passing within the nodes will also get more authenticated from the
cluster heads. The simulation of our proposed algorithm is carried out using NS2 network simulator by evaluating some network performances such as average delay, throughput of communication and packets
loss
CLUSTER BASED FIDELITY TO SECURE DSDV PROTOCOL AGAINST BLACK HOLE ATTACKSpijans
In this paper, we introduce and discuss an approach that will be used to secure the DSDV routing
protocol in an ad-hoc network. Due to mobility and absence of infrastructure, nodes are more vulnerable
to several malicious attacks. The secure routing is essential to transmit packets from source to the
destination. Our approach consists to model and manage fidelity concept in an ad-hoc clustering
architecture. Clustering makes it possible to group the mobile nodes and to send data simultaneously to
the each group. Our security model thus aims to integrate mechanisms against black hole attacks, forcing
cooperation between nodes and detecting failing behaviors. The nodes present in the clusters will work
more efficiently and the message passing within the nodes will also get more authenticated from the
cluster heads. The simulation of our proposed algorithm is carried out using NS2 network simulator by
evaluating some network performances such as average delay, throughput of communication and packets
loss.
CLUSTER BASED FIDELITY TO SECURE DSDV PROTOCOL AGAINST BLACK HOLE ATTACKSpijans
In this paper, we introduce and discuss an approach that will be used to secure the DSDV routing
protocol in an ad-hoc network. Due to mobility and absence of infrastructure, nodes are more vulnerable
to several malicious attacks. The secure routing is essential to transmit packets from source to the
destination. Our approach consists to model and manage fidelity concept in an ad-hoc clustering
architecture. Clustering makes it possible to group the mobile nodes and to send data simultaneously to
the each group. Our security model thus aims to integrate mechanisms against black hole attacks, forcing
cooperation between nodes and detecting failing behaviors. The nodes present in the clusters will work
more efficiently and the message passing within the nodes will also get more authenticated from the
cluster heads. The simulation of our proposed algorithm is carried out using NS2 network simulator by
evaluating some network performances such as average delay, throughput of communication and packets
loss.
Reactive Routing approach for preventing wormhole attack using hybridized WHOPIOSR Journals
This document describes a proposed approach to prevent wormhole attacks in mobile ad hoc networks. Wormhole attacks involve tunneling packets between two distant nodes, making routes through the wormhole appear shorter than actual routes. The proposed approach hybridizes the WHOP wormhole detection protocol with time synchronization to more efficiently detect wormholes and reduce routing delays. It works by having the source node send a "hound packet" after route discovery to check for inconsistencies that could indicate a wormhole. Receiving nodes process the hound packet to detect abnormal hop counts or delays that would out a wormhole. Simulation results show this approach can secure data transmission while minimizing delays without expensive hardware.
PACKET DROP ATTACK DETECTION TECHNIQUES IN WIRELESS AD HOC NETWORKS: A REVIEWIJNSA Journal
Wireless ad hoc networks have gained lots of attention due to their ease and low cost of deployment. This
has made ad hoc networks of great importance in numerous military and civilian applications. But, the lack
of centralized management of these networks makes them vulnerable to a number of security attacks. One
of the attacks is packet drop attack, where a compromised node drops packets maliciously. Several
techniques have been proposed to detect the packet drop attack in wireless ad hoc networks. Therefore, in
this paper we review some of the packet drop attack detection techniques and comparatively analyze them
basing on; their ability to detect the attack under different attack strategies (partial and or cooperate
attacks), environments and the computational and communication overheads caused in the process of
detection.
SELECTIVE JAMMING ATTACK PREVENTION BASED ON PACKET HIDING METHODS AND WORMHOLESIJNSA Journal
The wireless networks are more sensitive to the Denial-of-Service (DoS) attacks. The existing system is based on Spread Spectrum (SS). This technique mainly focuses on an external threat model. In wireless network the communications between nodes take place through broadcast communication. That is why, if an attacker present within the network can easily eavesdrop the message sent by any node. The main attack present in the wireless network is the selective jamming attack. This type of attack mainly focuses a single node termed as target node. Attacker always tries to block the message sent by the target node. This leads to the Denial-of-Service attack. We are proposing a new method to prevent the selective jamming attack in an internal threat model.
A wormhole is used, which will generate an alarm to indicate the presence of jammer and sent IP address of jammer node to all other nodes in the network. Using a method called packet hiding, we can send message through the network even though a jammer is present. This method is based on the technique called Strong Hiding Commitment Scheme (SHCS). Here, the access point in a network region becomes the wormhole whenever it finds out any node that violates the rules in a particular network region. That node is then considered as a jammer node. The wormhole sends IP address of jammer to all other nodes. Wormhole then prevents the jamming activity of the jammer by encrypting the source ID of message along with the message packet.So that the jammer is unable to identify its target node and the source can forward its message safely through jammer node itself.
DTADA: Distributed Trusted Agent Based Detection Approach For Doline And Sen...IOSR Journals
This document proposes a distributed trusted agent-based approach (DTADA) to detect and defend against cloning attacks and sinkhole attacks in wireless sensor networks. DTADA uses mobile agents that can move between nodes to detect attacks in a distributed manner without relying on a centralized authority. The mobile agents are programmed to identify inconsistencies that would indicate a cloning or sinkhole attack has occurred. The document reviews related work on centralized and local detection methods and their limitations. It then describes how DTADA uses mobile agents to efficiently detect attacks in a distributed way without high communication or energy costs.
Malicious attack detection and prevention in ad hoc network based on real tim...eSAT Publishing House
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology.
Malicious attack detection and prevention in ad hoc network based on real tim...eSAT Journals
Abstract This paper deals with Real Time Operating System (RTOS) based secure wormhole detection and prevention in ad hoc networks. The wormhole attack can form a serious threat to wireless networks, especially against many ad hoc network routing protocols and location based wireless security systems. A wormhole is created in the ad hoc network by introducing two malicious nodes. These two nodes form a worm hole link and message is transmitted through this link. The next part of the work is to detect the wormhole link by defining worm hole detection and prevention algorithm. After detecting suspicious links, one node performs a verification procedure for each suspicious link. The detection procedure and verifying procedure of suspicious worm link are used for further prevention of wormhole attack in the ad hoc network.
Modified AODV Algorithm using Data Mining Process: Classification and Clusteringidescitation
Security of Wireless Ad hoc network has a primary
concern to provide protected communication between mobile
nodes. When we routing some packet it can use both malicious
node or authenticate node for forwarding and receiving data.
Malicious node can attack like black hole, misuse of data or
hacked information. Our aim is to discuss the feasibility of
monitoring the node of different networks, to analyze it for
providing better security in AODV routing protocol. We
implement data mining techniques for search large amount
of data according characteristic rules and patterns to detect
malicious node. We have used growing neural gas (GNS)
clustering algorithm to make clusters and analysis data. Using
soft computing technique we find patterns, analysis node and
take decision based on decision tree.
Welcome to International Journal of Engineering Research and Development (IJERD)IJERD Editor
The document proposes a new Randomized, Efficient, and Distributed (RED) protocol for detecting clone attacks in wireless sensor networks. It analyzes existing solutions and identifies their shortcomings. The key contributions are:
1) Analyzing desirable properties for distributed clone detection mechanisms.
2) Showing that existing solutions like LSM do not fully meet these requirements.
3) Proposing the new RED protocol and proving it satisfies the requirements. Extensive simulations show RED is more efficient and effective at clone detection than other distributed protocols.
RTOS BASED SECURE SHORTEST PATH ROUTING ALGORITHM IN MOBILE AD- HOC NETWORKSIJNSA Journal
Increase of number of the nodes in the wireless computing environment leads to different issues like power, data rate, QoS, simulators and security. Among these the security is the peak issue faced by most of the wireless networks. Especially networks without having a centralized system (MANETS) is facing severe security issues. One of the major security issues is the wormhole attack while finding the shortest path. The aim of this paper is to propose an algorithm to find a secure shortest path against wormhole attack. Existing algorithms are mainly concentrated on detecting the malicious node but they are hardware specific like directional antennas and synchronized clocks. But the proposed algorithm is both software and hardware specific. RTOS is included to make the ad hoc network a real time application.
Wireless Sensor Network (WSN) consists of large number of sensor nodes capable of forming instantaneous network with dynamic topology. Each node simultaneously as both router and
host. Number of nodes in a WSN can vary either due to the mobility or death of nodes due to
drained conditions. Low Energy Aware Cluster Hierarchy (LEACH) is a most popular dynamic
clustering protocol for WSN. Deployment in unattended environment, limited memory, limited power and low computational power of a sensor node make these networks susceptible to attacks launched by malicious nodes. This paper provides an overview of LEACH protocol and how LEACH can be compromised by malicious nodes. We propose a attack on LEACH – Snooze attack. This paper we present a way to simulate this attack on NS-2 which is demonstrative on throughput. We observe that during simulation throughput drops as an effect of attack. It is observed that the effect of the attack gets aggregated as we increase the number of attackers.
Responsive Parameter based an AntiWorm Approach to Prevent Wormhole Attack in...IDES Editor
The recent advancements in the wireless technology
and their wide-spread deployment have made remarkable
enhancements in efficiency in the corporate and industrial
and Military sectors The increasing popularity and usage of
wireless technology is creating a need for more secure wireless
Ad hoc networks. This paper aims researched and developed
a new protocol that prevents wormhole attacks on a ad hoc
network. A few existing protocols detect wormhole attacks but
they require highly specialized equipment not found on most
wireless devices. This paper aims to develop a defense against
wormhole attacks as an Anti-worm protocol which is based on
responsive parameters, that does not require as a significant
amount of specialized equipment, trick clock synchronization,
no GPS dependencies.
This document discusses preventing and isolating black hole attacks in mobile ad hoc networks (MANETs) using alarm packets. It begins with background on MANETs and security attacks they face such as black hole attacks. Then, it reviews existing literature on detecting and preventing black hole attacks. Next, it describes how black hole attacks work in MANETs by having malicious nodes advertise short paths to destinations and drop packets. The proposed solution will use alarm packets to isolate and prevent black hole attacks in MANETs.
Vampire attack a novel method for detecting vampire attacks in wireless ad –h...IJLT EMAS
Ad-hoc wireless networks are dynamic in nature. Adhoc
networks are not depends on any predefined infrastructure.
Whenever there is need of communication at that point these
network can be deployed. In this paper we discuss Vampire
attacks. All protocols susceptible for vampire attack. Vampire
attacks are very easy to carry out throughout the network and
difficult to detect. Wireless sensor networks (WSNs) are the
foremost promising research direction in sensing and pervasive
computing. Previous security work has focused totally on denial
of service at the routing or medium access management levels.
Earlier, the resource depletion attacks are thought about solely
as a routing drawback, very recently these are classified into new
category as “vampire attacks”. Planned work examines the
resource depletion attacks at the routing protocol layer that
disable networks permanently by quickly debilitating node’s
battery power.
This document proposes and evaluates a decentralized wormhole detection mechanism for wireless mesh networks. It simulates wireless mesh networks with 50 and 100 nodes using GlomoSim and introduces one or two wormholes. The proposed mechanism detects affected nodes without special hardware. Results show the wormhole's impact on network connectivity and performance metrics like throughput and packet delivery ratio. Introducing more wormholes significantly reduces performance. The decentralized approach detects wormholes using only local connectivity information, making it suitable for wireless mesh networks.
PACKET DROP ATTACK DETECTION TECHNIQUES IN WIRELESS AD HOC NETWORKS: A REVIEWIJNSA Journal
Wireless ad hoc networks have gained lots of attention due to their ease and low cost of deployment. This has made ad hoc networks of great importance in numerous military and civilian applications. But, the lack of centralized management of these networks makes them vulnerable to a number of security attacks. One of the attacks is packet drop attack, where a compromised node drops packets maliciously. Several techniques have been proposed to detect the packet drop attack in wireless ad hoc networks. Therefore, in this paper we review some of the packet drop attack detection techniques and comparatively analyze them basing on; their ability to detect the attack under different attack strategies (partial and or cooperate attacks), environments and the computational and communication overheads caused in the process of detection.
Similar to A NOVEL CLUSTER BASED WORMHOLE AVOIDANCE ALGORITHM FOR MOBILE ADHOC NETWORKS (20)
ANALYSIS OF LAND SURFACE DEFORMATION GRADIENT BY DINSAR cscpconf
The progressive development of Synthetic Aperture Radar (SAR) systems diversify the exploitation of the generated images by these systems in different applications of geoscience. Detection and monitoring surface deformations, procreated by various phenomena had benefited from this evolution and had been realized by interferometry (InSAR) and differential interferometry (DInSAR) techniques. Nevertheless, spatial and temporal decorrelations of the interferometric couples used, limit strongly the precision of analysis results by these techniques. In this context, we propose, in this work, a methodological approach of surface deformation detection and analysis by differential interferograms to show the limits of this technique according to noise quality and level. The detectability model is generated from the deformation signatures, by simulating a linear fault merged to the images couples of ERS1 / ERS2 sensors acquired in a region of the Algerian south.
4D AUTOMATIC LIP-READING FOR SPEAKER'S FACE IDENTIFCATIONcscpconf
A novel based a trajectory-guided, concatenating approach for synthesizing high-quality image real sample renders video is proposed . The lips reading automated is seeking for modeled the closest real image sample sequence preserve in the library under the data video to the HMM predicted trajectory. The object trajectory is modeled obtained by projecting the face patterns into an KDA feature space is estimated. The approach for speaker's face identification by using synthesise the identity surface of a subject face from a small sample of patterns which sparsely each the view sphere. An KDA algorithm use to the Lip-reading image is discrimination, after that work consisted of in the low dimensional for the fundamental lip features vector is reduced by using the 2D-DCT.The mouth of the set area dimensionality is ordered by a normally reduction base on the PCA to obtain the Eigen lips approach, their proposed approach by[33]. The subjective performance results of the cost function under the automatic lips reading modeled , which wasn’t illustrate the superior performance of the
method.
MOVING FROM WATERFALL TO AGILE PROCESS IN SOFTWARE ENGINEERING CAPSTONE PROJE...cscpconf
Universities offer software engineering capstone course to simulate a real world-working environment in which students can work in a team for a fixed period to deliver a quality product. The objective of the paper is to report on our experience in moving from Waterfall process to Agile process in conducting the software engineering capstone project. We present the capstone course designs for both Waterfall driven and Agile driven methodologies that highlight the structure, deliverables and assessment plans.To evaluate the improvement, we conducted a survey for two different sections taught by two different instructors to evaluate students’ experience in moving from traditional Waterfall model to Agile like process. Twentyeight students filled the survey. The survey consisted of eight multiple-choice questions and an open-ended question to collect feedback from students. The survey results show that students were able to attain hands one experience, which simulate a real world-working environment. The results also show that the Agile approach helped students to have overall better design and avoid mistakes they have made in the initial design completed in of the first phase of the capstone project. In addition, they were able to decide on their team capabilities, training needs and thus learn the required technologies earlier which is reflected on the final product quality
PROMOTING STUDENT ENGAGEMENT USING SOCIAL MEDIA TECHNOLOGIEScscpconf
This document discusses using social media technologies to promote student engagement in a software project management course. It describes the course and objectives of enhancing communication. It discusses using Facebook for 4 years, then switching to WhatsApp based on student feedback, and finally introducing Slack to enable personalized team communication. Surveys found students engaged and satisfied with all three tools, though less familiar with Slack. The conclusion is that social media promotes engagement but familiarity with the tool also impacts satisfaction.
A SURVEY ON QUESTION ANSWERING SYSTEMS: THE ADVANCES OF FUZZY LOGICcscpconf
In real world computing environment with using a computer to answer questions has been a human dream since the beginning of the digital era, Question-answering systems are referred to as intelligent systems, that can be used to provide responses for the questions being asked by the user based on certain facts or rules stored in the knowledge base it can generate answers of questions asked in natural , and the first main idea of fuzzy logic was to working on the problem of computer understanding of natural language, so this survey paper provides an overview on what Question-Answering is and its system architecture and the possible relationship and
different with fuzzy logic, as well as the previous related research with respect to approaches that were followed. At the end, the survey provides an analytical discussion of the proposed QA models, along or combined with fuzzy logic and their main contributions and limitations.
DYNAMIC PHONE WARPING – A METHOD TO MEASURE THE DISTANCE BETWEEN PRONUNCIATIONS cscpconf
Human beings generate different speech waveforms while speaking the same word at different times. Also, different human beings have different accents and generate significantly varying speech waveforms for the same word. There is a need to measure the distances between various words which facilitate preparation of pronunciation dictionaries. A new algorithm called Dynamic Phone Warping (DPW) is presented in this paper. It uses dynamic programming technique for global alignment and shortest distance measurements. The DPW algorithm can be used to enhance the pronunciation dictionaries of the well-known languages like English or to build pronunciation dictionaries to the less known sparse languages. The precision measurement experiments show 88.9% accuracy.
INTELLIGENT ELECTRONIC ASSESSMENT FOR SUBJECTIVE EXAMS cscpconf
In education, the use of electronic (E) examination systems is not a novel idea, as Eexamination systems have been used to conduct objective assessments for the last few years. This research deals with randomly designed E-examinations and proposes an E-assessment system that can be used for subjective questions. This system assesses answers to subjective questions by finding a matching ratio for the keywords in instructor and student answers. The matching ratio is achieved based on semantic and document similarity. The assessment system is composed of four modules: preprocessing, keyword expansion, matching, and grading. A survey and case study were used in the research design to validate the proposed system. The examination assessment system will help instructors to save time, costs, and resources, while increasing efficiency and improving the productivity of exam setting and assessments.
TWO DISCRETE BINARY VERSIONS OF AFRICAN BUFFALO OPTIMIZATION METAHEURISTICcscpconf
African Buffalo Optimization (ABO) is one of the most recent swarms intelligence based metaheuristics. ABO algorithm is inspired by the buffalo’s behavior and lifestyle. Unfortunately, the standard ABO algorithm is proposed only for continuous optimization problems. In this paper, the authors propose two discrete binary ABO algorithms to deal with binary optimization problems. In the first version (called SBABO) they use the sigmoid function and probability model to generate binary solutions. In the second version (called LBABO) they use some logical operator to operate the binary solutions. Computational results on two knapsack problems (KP and MKP) instances show the effectiveness of the proposed algorithm and their ability to achieve good and promising solutions.
DETECTION OF ALGORITHMICALLY GENERATED MALICIOUS DOMAINcscpconf
In recent years, many malware writers have relied on Dynamic Domain Name Services (DDNS) to maintain their Command and Control (C&C) network infrastructure to ensure a persistence presence on a compromised host. Amongst the various DDNS techniques, Domain Generation Algorithm (DGA) is often perceived as the most difficult to detect using traditional methods. This paper presents an approach for detecting DGA using frequency analysis of the character distribution and the weighted scores of the domain names. The approach’s feasibility is demonstrated using a range of legitimate domains and a number of malicious algorithmicallygenerated domain names. Findings from this study show that domain names made up of English characters “a-z” achieving a weighted score of < 45 are often associated with DGA. When a weighted score of < 45 is applied to the Alexa one million list of domain names, only 15% of the domain names were treated as non-human generated.
GLOBAL MUSIC ASSET ASSURANCE DIGITAL CURRENCY: A DRM SOLUTION FOR STREAMING C...cscpconf
The document proposes a blockchain-based digital currency and streaming platform called GoMAA to address issues of piracy in the online music streaming industry. Key points:
- GoMAA would use a digital token on the iMediaStreams blockchain to enable secure dissemination and tracking of streamed content. Content owners could control access and track consumption of released content.
- Original media files would be converted to a Secure Portable Streaming (SPS) format, embedding watermarks and smart contract data to indicate ownership and enable validation on the blockchain.
- A browser plugin would provide wallets for fans to collect GoMAA tokens as rewards for consuming content, incentivizing participation and addressing royalty discrepancies by recording
IMPORTANCE OF VERB SUFFIX MAPPING IN DISCOURSE TRANSLATION SYSTEMcscpconf
This document discusses the importance of verb suffix mapping in discourse translation from English to Telugu. It explains that after anaphora resolution, the verbs must be changed to agree with the gender, number, and person features of the subject or anaphoric pronoun. Verbs in Telugu inflect based on these features, while verbs in English only inflect based on number and person. Several examples are provided that demonstrate how the Telugu verb changes based on whether the subject or pronoun is masculine, feminine, neuter, singular or plural. Proper verb suffix mapping is essential for generating natural and coherent translations while preserving the context and meaning of the original discourse.
EXACT SOLUTIONS OF A FAMILY OF HIGHER-DIMENSIONAL SPACE-TIME FRACTIONAL KDV-T...cscpconf
In this paper, based on the definition of conformable fractional derivative, the functional
variable method (FVM) is proposed to seek the exact traveling wave solutions of two higherdimensional
space-time fractional KdV-type equations in mathematical physics, namely the
(3+1)-dimensional space–time fractional Zakharov-Kuznetsov (ZK) equation and the (2+1)-
dimensional space–time fractional Generalized Zakharov-Kuznetsov-Benjamin-Bona-Mahony
(GZK-BBM) equation. Some new solutions are procured and depicted. These solutions, which
contain kink-shaped, singular kink, bell-shaped soliton, singular soliton and periodic wave
solutions, have many potential applications in mathematical physics and engineering. The
simplicity and reliability of the proposed method is verified.
AUTOMATED PENETRATION TESTING: AN OVERVIEWcscpconf
The document discusses automated penetration testing and provides an overview. It compares manual and automated penetration testing, noting that automated testing allows for faster, more standardized and repeatable tests but has limitations in developing new exploits. It also reviews some current automated penetration testing methodologies and tools, including those using HTTP/TCP/IP attacks, linking common scanning tools, a Python-based tool targeting databases, and one using POMDPs for multi-step penetration test planning under uncertainty. The document concludes that automated testing is more efficient than manual for known vulnerabilities but cannot replace manual testing for discovering new exploits.
CLASSIFICATION OF ALZHEIMER USING fMRI DATA AND BRAIN NETWORKcscpconf
Since the mid of 1990s, functional connectivity study using fMRI (fcMRI) has drawn increasing
attention of neuroscientists and computer scientists, since it opens a new window to explore
functional network of human brain with relatively high resolution. BOLD technique provides
almost accurate state of brain. Past researches prove that neuro diseases damage the brain
network interaction, protein- protein interaction and gene-gene interaction. A number of
neurological research paper also analyse the relationship among damaged part. By
computational method especially machine learning technique we can show such classifications.
In this paper we used OASIS fMRI dataset affected with Alzheimer’s disease and normal
patient’s dataset. After proper processing the fMRI data we use the processed data to form
classifier models using SVM (Support Vector Machine), KNN (K- nearest neighbour) & Naïve
Bayes. We also compare the accuracy of our proposed method with existing methods. In future,
we will other combinations of methods for better accuracy.
VALIDATION METHOD OF FUZZY ASSOCIATION RULES BASED ON FUZZY FORMAL CONCEPT AN...cscpconf
The document proposes a new validation method for fuzzy association rules based on three steps: (1) applying the EFAR-PN algorithm to extract a generic base of non-redundant fuzzy association rules using fuzzy formal concept analysis, (2) categorizing the extracted rules into groups, and (3) evaluating the relevance of the rules using structural equation modeling, specifically partial least squares. The method aims to address issues with existing fuzzy association rule extraction algorithms such as large numbers of extracted rules, redundancy, and difficulties with manual validation.
PROBABILITY BASED CLUSTER EXPANSION OVERSAMPLING TECHNIQUE FOR IMBALANCED DATAcscpconf
In many applications of data mining, class imbalance is noticed when examples in one class are
overrepresented. Traditional classifiers result in poor accuracy of the minority class due to the
class imbalance. Further, the presence of within class imbalance where classes are composed of
multiple sub-concepts with different number of examples also affect the performance of
classifier. In this paper, we propose an oversampling technique that handles between class and
within class imbalance simultaneously and also takes into consideration the generalization
ability in data space. The proposed method is based on two steps- performing Model Based
Clustering with respect to classes to identify the sub-concepts; and then computing the
separating hyperplane based on equal posterior probability between the classes. The proposed
method is tested on 10 publicly available data sets and the result shows that the proposed
method is statistically superior to other existing oversampling methods.
CHARACTER AND IMAGE RECOGNITION FOR DATA CATALOGING IN ECOLOGICAL RESEARCHcscpconf
Data collection is an essential, but manpower intensive procedure in ecological research. An
algorithm was developed by the author which incorporated two important computer vision
techniques to automate data cataloging for butterfly measurements. Optical Character
Recognition is used for character recognition and Contour Detection is used for imageprocessing.
Proper pre-processing is first done on the images to improve accuracy. Although
there are limitations to Tesseract’s detection of certain fonts, overall, it can successfully identify
words of basic fonts. Contour detection is an advanced technique that can be utilized to
measure an image. Shapes and mathematical calculations are crucial in determining the precise
location of the points on which to draw the body and forewing lines of the butterfly. Overall,
92% accuracy were achieved by the program for the set of butterflies measured.
SOCIAL MEDIA ANALYTICS FOR SENTIMENT ANALYSIS AND EVENT DETECTION IN SMART CI...cscpconf
Smart cities utilize Internet of Things (IoT) devices and sensors to enhance the quality of the city
services including energy, transportation, health, and much more. They generate massive
volumes of structured and unstructured data on a daily basis. Also, social networks, such as
Twitter, Facebook, and Google+, are becoming a new source of real-time information in smart
cities. Social network users are acting as social sensors. These datasets so large and complex
are difficult to manage with conventional data management tools and methods. To become
valuable, this massive amount of data, known as 'big data,' needs to be processed and
comprehended to hold the promise of supporting a broad range of urban and smart cities
functions, including among others transportation, water, and energy consumption, pollution
surveillance, and smart city governance. In this work, we investigate how social media analytics
help to analyze smart city data collected from various social media sources, such as Twitter and
Facebook, to detect various events taking place in a smart city and identify the importance of
events and concerns of citizens regarding some events. A case scenario analyses the opinions of
users concerning the traffic in three largest cities in the UAE
SOCIAL NETWORK HATE SPEECH DETECTION FOR AMHARIC LANGUAGEcscpconf
The anonymity of social networks makes it attractive for hate speech to mask their criminal
activities online posing a challenge to the world and in particular Ethiopia. With this everincreasing
volume of social media data, hate speech identification becomes a challenge in
aggravating conflict between citizens of nations. The high rate of production, has become
difficult to collect, store and analyze such big data using traditional detection methods. This
paper proposed the application of apache spark in hate speech detection to reduce the
challenges. Authors developed an apache spark based model to classify Amharic Facebook
posts and comments into hate and not hate. Authors employed Random forest and Naïve Bayes
for learning and Word2Vec and TF-IDF for feature selection. Tested by 10-fold crossvalidation,
the model based on word2vec embedding performed best with 79.83%accuracy. The
proposed method achieve a promising result with unique feature of spark for big data.
GENERAL REGRESSION NEURAL NETWORK BASED POS TAGGING FOR NEPALI TEXTcscpconf
This article presents Part of Speech tagging for Nepali text using General Regression Neural
Network (GRNN). The corpus is divided into two parts viz. training and testing. The network is
trained and validated on both training and testing data. It is observed that 96.13% words are
correctly being tagged on training set whereas 74.38% words are tagged correctly on testing
data set using GRNN. The result is compared with the traditional Viterbi algorithm based on
Hidden Markov Model. Viterbi algorithm yields 97.2% and 40% classification accuracies on
training and testing data sets respectively. GRNN based POS Tagger is more consistent than the
traditional Viterbi decoding technique.
Philippine Edukasyong Pantahanan at Pangkabuhayan (EPP) CurriculumMJDuyan
(𝐓𝐋𝐄 𝟏𝟎𝟎) (𝐋𝐞𝐬𝐬𝐨𝐧 𝟏)-𝐏𝐫𝐞𝐥𝐢𝐦𝐬
𝐃𝐢𝐬𝐜𝐮𝐬𝐬 𝐭𝐡𝐞 𝐄𝐏𝐏 𝐂𝐮𝐫𝐫𝐢𝐜𝐮𝐥𝐮𝐦 𝐢𝐧 𝐭𝐡𝐞 𝐏𝐡𝐢𝐥𝐢𝐩𝐩𝐢𝐧𝐞𝐬:
- Understand the goals and objectives of the Edukasyong Pantahanan at Pangkabuhayan (EPP) curriculum, recognizing its importance in fostering practical life skills and values among students. Students will also be able to identify the key components and subjects covered, such as agriculture, home economics, industrial arts, and information and communication technology.
𝐄𝐱𝐩𝐥𝐚𝐢𝐧 𝐭𝐡𝐞 𝐍𝐚𝐭𝐮𝐫𝐞 𝐚𝐧𝐝 𝐒𝐜𝐨𝐩𝐞 𝐨𝐟 𝐚𝐧 𝐄𝐧𝐭𝐫𝐞𝐩𝐫𝐞𝐧𝐞𝐮𝐫:
-Define entrepreneurship, distinguishing it from general business activities by emphasizing its focus on innovation, risk-taking, and value creation. Students will describe the characteristics and traits of successful entrepreneurs, including their roles and responsibilities, and discuss the broader economic and social impacts of entrepreneurial activities on both local and global scales.
The chapter Lifelines of National Economy in Class 10 Geography focuses on the various modes of transportation and communication that play a vital role in the economic development of a country. These lifelines are crucial for the movement of goods, services, and people, thereby connecting different regions and promoting economic activities.
How to Setup Warehouse & Location in Odoo 17 InventoryCeline George
In this slide, we'll explore how to set up warehouses and locations in Odoo 17 Inventory. This will help us manage our stock effectively, track inventory levels, and streamline warehouse operations.
This document provides an overview of wound healing, its functions, stages, mechanisms, factors affecting it, and complications.
A wound is a break in the integrity of the skin or tissues, which may be associated with disruption of the structure and function.
Healing is the body’s response to injury in an attempt to restore normal structure and functions.
Healing can occur in two ways: Regeneration and Repair
There are 4 phases of wound healing: hemostasis, inflammation, proliferation, and remodeling. This document also describes the mechanism of wound healing. Factors that affect healing include infection, uncontrolled diabetes, poor nutrition, age, anemia, the presence of foreign bodies, etc.
Complications of wound healing like infection, hyperpigmentation of scar, contractures, and keloid formation.
2. 234 Computer Science & Information Technology (CS & IT)
The remaining paper is organized as follows: in section 2 we give the literature review. In section
3 we give our proposed scheme with our assumptions and cluster formation technique. Different
types of Wormhole attacks and there countermeasures have been given in section 4 and 5. The
complete algorithm in pseudo code is presented in section 6, and we finally conclude the paper in
section 7.
2. RELATED WORKS
Y. Hu et al. in [1] introduced two Wormhole attack detection and prevention schemes. One is
called the Temporal Leashes which is a time based solution. An-other is Geographical Leashes
which is location based solution. Though both of the Leashes are reliable and have a high
detection rate, Temporal Leashes suffers from need of tightly synchronized clocks and the
Geographical Leashes suffers from some hardware need like GPS information.
S. Jen et al. proposed simple Hop-Count Analysis based scheme [2] for avoiding Wormhole
attacks in MANET called MHA. MHA uses the observation that the route under the Wormhole
attack has a smaller hop-count than normal. As a result, users who avoid routes with relatively
small hop-counts can avoid most Wormhole attacks. Delay per Hop Indication (DelPHI) [3] is
another hop count analysis based solution that uses delay as a parameter for detecting Wormhole
attack in MANET.
Wormhole Attack Prevention Algorithm (WAP) [4] is a neighbour monitoring based solution. In
WAP all nodes monitor their neighbours’ behaviour when they send RREQ messages to the
destination, to detect neighbours that are not within the maximum transmission range but pretend
to be neighbours. When a source node sends RREQ it starts a Wormhole prevention timer (WPT).
If it receives some RREP messages after the timer got expire it detects a route under Wormhole
attack among the routes. Once Wormhole node is detected, source node records them in the
Wormhole node list. All the neighbour monitoring based solutions are less energy efficient. It
assumes that a node can always monitor ongoing transmissions even if the node it-self is not the
intended receiver.
D. B. Roy et al. proposed the first cluster based Wormhole attack detection method [5]. They
divided the entire network in clusters. Each cluster has a cluster head and there is a guard node in
the intersection of two overlapping clusters. A cluster head in the inner layer detects a malicious
activity and informs the cluster head of the outer layer, and then the outer layer cluster head has
the responsibility to inform the other nodes in the network about the malicious nodes. D. B. Roy
et al. did not provide a practical method for cluster formation, the cluster head selection and the
guard node selection. Also the method cannot pin point the location of the Wormhole and it
cannot detect multiple Wormhole attack.
A detailed literature survey on Wormhole attack and their existing countermeasures with a
comparison can be found in our previous work [6].
3. PROPOSED SCHEME
Now we will present our cluster based Wormhole attack avoidance mechanism. Where the
receiver can identify whether there is a Wormhole in the routing path and avoid it during the route
discovery phase of the DSR protocol. The proposed cluster based hierarchical mobile ad-hoc
network model is shown in fig.1.
3. Computer Science & Information Technology (CS & IT) 235
3.1. Cluster Formation:
Figure 1. Hierarchical cluster formation and addressing
3.1.1. Hierarchy Definition
Here we consider a hierarchical (up to level-3) cluster model as described in [7]. All mobile nodes
are first grouped into few disjoint level-0 clusters, and among them one node is selected as the
cluster head (we will describe the cluster head selection criteria in “3 Cluster head selection”). All
nodes in the cluster are in the direct communication range from the cluster head. All the level-0
clusters are grouped into few overlapping level-1 clusters and in every level-1 cluster a node is
selected as the cluster head of that cluster. Then the level-1 and level2 clusters are formed
recursively using the same procedure as level-0.
3.1.2. Hierarchical Node Addressing
Here we introduce a hierarchical addressing scheme for the nodes in the network. In the next
section we will use the addressing scheme for detecting and preventing the Wormhole attack. All
cluster heads at level-2 will get the address in this format X.0.0.0. The level-1 cluster heads will
get the address like X.Y.0.0. The level-0 cluster head address is in the format X.Y.Z.0. And
finally the nodes in the level-0 cluster will get the address in the format X.Y.Z.W where X, Y, Z,
and W are any integer value in the range 0 to 255, e.g. 25.45.68.50.
3.1.3. Cluster head selection criteria
• Remaining Power: In order to ensure event dissipation of power by all the nodes and for
increasing the overall network life time we need to select the cluster heads from among the nodes
periodically on the basis of the maximum remaining power of a node power.
• Reliability: A node is a reliable one if other nodes in the network previously route the packet
through it. In our approach each node should maintains a Neighbour Reliability table that stores
the node id and the reliability value.
• Node Mobility: Node with the low mobility is selected as the cluster head. If the cluster head
change its link to other nodes very frequently then we have to select a new cluster head.
4. 236 Computer Science & Information Technology (CS & IT)
3.1.4. Cluster Creation
Once the cluster head has been selected according to the previously defined criteria it creates the
HELLO packets, and set its TTL value to 1. Then flood the packet to discover all 1-hop
neighbours. Then it creates a level-0 cluster. To organize the level-0 clusters level-1 clusters are
created. After level-1 clusters have been created they create the level-2 clusters using the same
technique described above.
4. PROPOSED SCHEME
Our proposed hierarchical cluster based mobile ad-hoc network model is susceptible of the
following four types of attacks:
1) Intra level intra cluster Wormhole attack
2) Inter level-0 Intra level-1 cluster Wormhole attack
3) Inter level-0 inter level-1 cluster Wormhole attack
4) Inter level inter cluster Wormhole attack.
4.1. Intra Level Intra Cluster Wormhole Attack:
During this attack the attacker first place two malicious nodes in the same cluster, and then
establish a Wormhole link between them. Consider the e.g. illustrated in fig.2 a Wormhole link is
created between the nodes 1.1.2.1 and 1.1.2.2 by using two malicious nodes X and X’. During the
root discovery the sender 1.1.2.2 floods the RREQ packet within the cluster. The cluster head
1.1.2.0 and the malicious node X will receive the packet, and then X encapsulates it to a packet
destined to X’. X’ then send it to the destination 1.1.2.2. Due to the encapsulation the hop count
value of the packet does not increase and as a result the destination will find the source to its
closed neighbour. And then it may select the compromised path (going through the malicious
nodes) with low hop count. Afterwards the malicious nodes can drop the packets or spying on the
content of the packets going through the compromised path.
Figure 2. Intra level intra cluster Wormhole attack
4.2. Inter Level-0 Intra Level-1 Cluster Wormhole Attack:
During this attack two nodes which are in two different level-0 clusters are used for creating a
Wormhole link between the sender and receiver which belongs to a same level-1 cluster. Consider
the e.g. illustrated in fig. 3, where a wormhole link is created between the nodes 1.1.2.1 and
1.1.1.2 (which are in the same level-1 cluster but belongs to two different level-0 clusters) by
using two malicious nodes Y and Y’. And then during the route discovery the Inter Level-0 Intra
Lev-el-1 Cluster Wormhole attack is carried out by these malicious nodes described as above
scenario.
5. Computer Science & Information Technology (CS & IT) 237
Figure 3. Inter level-0 intra level-1 cluster Wormhole attack
4.3. Inter Level-0 Inter Level-1 Cluster Wormhole Attack:
During this attack two nodes which belong to two different level-0 clusters are used for creating a
Wormhole link between the sender and receiver which belongs to two different level-1 clusters.
Consider the e.g. illustrated in fig. 4 a Wormhole link is created between the nodes 1.1.2.2 and
1.3.3.1 (which are in two different level-0 and level-1 clusters) by using two malicious nodes W
and W’. During the route discovery phase the malicious nodes use the wormhole link between
them to carry out the Inter Level-0 Inter Level-1 Wormhole attack same as previous.
Figure 4. Inter level-0 inter level-1 Wormhole attack
4.4. Inter Level Inter Cluster Wormhole Attack:
To carry out this attack the attacker first place two malicious nodes in two different level clusters,
and then establish a Wormhole link between them. Consider the e.g. illustrated in fig. 5 a
wormhole link is created between the nodes 1.1.2.2 and 1.2.0.0 (which are in two different level
clusters) by using two malicious nodes Z and Z’. And then during the route discovery phase the
Inter Level Inter Cluster Wormhole attack is carried out by these malicious nodes described as
above scenario.
Figure 5. Inter level inter cluster Wormhole Attack
6. 238 Computer Science & Information Technology (CS & IT)
5. PROCEDURE FOR WORMHOLE ATTACK AVOIDANCE
Now in the next section we will show how our proposed algorithm avoids the above mentioned
four types of Wormhole attacks with example.
5.1. Intra Level Intra Cluster Wormhole Attack Avoidance:
Consider the fig. 2 when the receiver receives the RREQ packet it extracts the source and
destination addresses from it, in our example which are 1.1.2.1 and 1.1.2.2 respectively. After this
destination will invoke a procedure which computes the intermediate cluster heads addresses like
this: first it checks the level-2 id of the corresponding addresses, if same then checks level-1 id
and after this level-0 and node id will be checked. In our example the destination observe that
only the node id differs in two addresses, so it identify that the both sender and receiver nodes are
within the same cluster, so there exist only one path between the sender and receiver via the
cluster head of that cluster whose address is 1.1.2.0. Now the destination checks the RREQ
packets that it received for the valid path (as we are using the DSR protocol the RREQ packet
contains all the intermediate node ids), here which is 1.1.2.1→1.1.2.0→1.1.2.2.
5.2. Level-0 Intra Level-1 Wormhole Attack Avoidance:
Consider the fig. 3 when the receiver 1.1.1.2 receives the RREQ packet it extracts the source and
destination addresses from it, in our example which are 1.1.2.1 and 1.1.1.2 respectively. Now the
destination can see that the level-0 id differs in two addresses, so it identify that the both sender
and receiver nodes belong to two different level-0 cluster, and the sender should send the packet
through the cluster head at level-1, whose address is 1.1.0.0, then the receiver node search for the
legitimate intermediate nodes address in the RREQ packet, and reject the packets that don’t
contain all the legitimate intermediate nodes address. Otherwise it accept the packet and sends a
RREP through the reverse path contained in the DSR packet i.e., 1.1.1.2 −> 1.1.1.0 −> 1.1.0.0 −>
1.1.2.0 −> 1.1.2.1.
5.3. Inter Level-0 Inter Level-1 Wormhole Attack Avoidance:
Consider the fig. 4 after RREQ packet has been received; the destination extracts the source and
destination addresses from the packet which are 1.3.3.1 and 1.1.2.2 respectively. Now the
destination can see that the level-2 id differs in two addresses, so it identify that the both sender
and receiver nodes belong to two different level-1 cluster, and the sender should send the packet
through the cluster head at level-2, whose address is 1.0.0.0. Now the receiver searches the RREQ
packet for the intermediate nodes address, and reject the packets that don’t contain the cluster
head id 1.0.0.0. Otherwise in case of a valid RREQ it sends a RREP through the reverse path
contained in the DSR packet i.e., 1.1.2.2 −> 1.1.2.0 −> 1.1.0.0 −> 1.0.0.0 −> 1.3.0.0 −> 1.3.3.0
−> 1.3.3.1.
5.4. Inter Level Inter Cluster Wormhole Attack Avoidance:
Consider the fig. 5 after the destination receives a RREQ packet it extracts the source and
destination addresses from the packet which are 1.1.2.2 and 1.2.0.0 respectively. Now the
destination starts to match the addresses from MSB and find that the level-1 id differs in two
addresses, so it identify that the both sender and receiver nodes belong to two different level
cluster one is in level-0 and one is in level-1, and the sender should send the packet through the
cluster head at level-2, whose address is 1.0.0.0. Now the receiver checks the intermediate nodes
address in the RREQ packet, and reject the packets that don’t contain the cluster head id 1.0.0.0.
7. Computer Science & Information Technology (CS & IT) 239
After that it sends a RREP through the reverse path contained in the legitimate RREQ packet i.e.,
1.1.2.2−> 1.1.2.0 −> 1.1.0.0 −> 1.0.0.0 −> 1.2.0.0.
6. PROPOSED ALGORITHM
Algorithm: RREQ packet forwarding and Wormhole attack avoidance
Step 1. The sender node initiates a route discovery by flooding the RREQ packets within the
cluster.
Step 2. The cluster head of this cluster that the sender belongs to, receives the packet.
Step 3. The Cluster head extracts the source and destination addresses from the packet, and
identify the mode of communication – a) Intra cluster b) Inter cluster c) Intra level or d)
Inter level and also sets the Next_Hop address like follows:
3.1.The cluster head starts matching the receiver address with its own address from the MSB
(during the matching the cluster head considers only the non zero bits of the addresses).
3.2.If (mismatch occurs) then
3.2.1. Set the Next_Hop address value = Current cluster head address.
3.2.2. Replace the first right most non zero bit of Next_Hop address value with zero.
Else
3.2.3. Set the Next_Hop address value = Current cluster head address.
3.2.4. Replace the first left most zero bit value of Next_Hop address with the
corresponding receiver address value.
End if
Step 4. The cluster head sends the packet to the address specified in the Next_Hop address.
Step 5. Repeat step – 3 to 4 until the packet reaches the destination.
Step 6. After the destination receives a RREQ packets, it can drop the packets if it came through
a Wormhole link as follows:
6.1.It first extracts the source and the destination address from the packet.
6.2.Starts matching the two addresses and take the decision as follows:
Step 7.
7.1.If (the level-1 id mismatches) then
/*sender and receiver belongs to two different level-1 clusters*/
7.1.1. Case 1: both the level-0 id and node id are non zero
/*both of them are non cluster head nodes*/
The receiver calculates the level-2 and level-1 and level-0 cluster heads ids addresses from the
source address. As a legal RREQ packet is suppose to pass through all the determined cluster
heads, therefore, the destination node searches the entire routing path recorded in the RREQ
packet for the respective cluster heads ids. Even if a single cluster head id is missing from the
8. 240 Computer Science & Information Technology (CS & IT)
routing path in the packet, it means that the packet has come through some compromised path. In
that case the packet is rejected by the receiver.
7.1.2. Case 2: only the node id is zero
/*sender is a level-0 cluster head*/
The receiver calculates the level-1 and level-2 cluster heads ids, and validates the route
information stored in the packet using the procedure described in Case1. If the validation is
successful then the receiver keeps the packet, otherwise it rejects it.
7.1.3. Case 3: both the level-0 id and node id are zero
/*sender is a level-1 cluster head*/
The receiver only calculates the level-2 cluster head id and validates the route information stored
in the packet using the procedure described in Case1. If the validation is successful then the
receiver keeps the packet, otherwise it rejects it.
7.2.Else if (the level-0 id mismatches AND the node id is non zero ) then
/*sender and receiver belongs to two different level-0 clusters*/
Then the sender calculates only the level-1 cluster head id and validates the route information
stored in the packet using the procedure described in Case1. If the validation is successful then
the receiver keeps the packet, otherwise it rejects it.
7.3.Else if (the node id mismatches) then
/*sender and receiver belongs to same level-0 cluster*/
Then the sender calculates only the level-0 cluster head id using the procedure previously
described. Then it rejects the RREQ packet that does not contain that id.
Step 8. After this the receiver sends a RREP packet through the valid reverse path contained in
the packet which has come through the valid path.
Step 9. After the sender receives the RREP packet, a link is established between the sender and
the receiver through the path contained in the RREP packet and then the data transmission
continuous using the path.
Step 10. End.
7. CONCLUSION
The main advantage of our proposed method is that it is an avoidance technique and the receiver
can detect that a packet has come through some compromised (Wormhole) path during the route
discovery phase of the DSR protocol. So, it does not need another phase or a periodically
checking for the existence of the Wormhole in the path during data transmission. Our proposed
countermeasure unlike of its predecessors neither requires any special H/W nor tightly
synchronized clocks. It also does not use any statistical analysis or data. It detects if there is a
Wormhole during the route discovery phase of the DSR protocol and avoids this path during
9. Computer Science & Information Technology (CS & IT) 241
further communication. So, nodes do not need to monitor its neighbour behaviour during the data
transmission, and also the detection process is carried out in the route discovery phase of the DSR
so it does not require a separate phase for it.
REFERENCES
[1] Y. Hu , A. Perrig & D. Johnson, (2002) "Packet Leashes: A Defense against Wormhole Attacks in
Wireless Networks", IEEE INFOCOM.
[2] Shang-Ming Jen, Chi-Sung Laih & Wen-Chung Kuo, (2009) “A HopCount Analysis Scheme for
Avoiding Wormhole Attacks in MANET”, Sensors (Basel), Vol. 9, No. 6, pp 5022-5039.
[3] H. S. Chiu & K-S. Lui, (2006), “DelPHI: Wormhole Detection Mechanism for Ad Hoc Wireless
Networks”, International Symposium on Wireless Pervasive Computing, Phuket, Thailand.
[4] C. Sun, K. Doo-young, L. Do-hyeon, & J. Jae-il, (2008) "WAP: Wormhole Attack Prevention
Algorithm in Mobile Ad Hoc Networks," IEEE International Conference on Sensor Networks,
Ubiquitous, and Trustworthy Computing (SUTC), pp 343-348.
[5] D. B. Roy, R. Chaki, N. Chaki, (2009), “A new cluster-based Wormhole intrusion detection algorithm
for mobile ad-hoc network”, Journal of Network Security & Its Applications , Vol. 1, No. 1, pp 44-52.
[6] S. Banerjee, & K. Majumder, (2012), “A Comparative Study on Wormhole Attack Prevention
Schemes in Mobile Ad-Hoc Network”. Recent Trends in Computer Networks and Distributed
Systems Security, Vol. 335, pp 372-384.
[7] J. Sucec, I. Marsic, (2002), “Clustering overhead for hierarchical routing in mobile ad hoc networks”,
INFOCOM, pp 1698-1706
AUTHORS
Subhashis Banerjee has received his B. Sc. (Honours) and M. Sc. degrees in Computer
Science in the year 2009 and 2011 respectively. He has obtained M. Tech. degree in
Software Engineering in the year 2013 from West Bengal University of Technology,
Kolkata, India. He is presently working as a researcher at Machine Intelligence Unit,
Indian Statistical Institute, Kolkata, India. He has published several papers in
International journals and conferences.
Koushik Majumder has received his B.Tech and M.Tech degrees in Computer
Science and Engineering and Information Technology in the year 2003 and 2005
respectively from University of Calcutta, Kolkata, India. He obtained his PhD degree
in the field of Mobile Ad Hoc Networking in 2012 from Jadavpur University,
Kolkata, India. Before coming to the teaching profession he has worked in reputed
international software organizations like Tata Consultancy Services and Cognizant
Technology Solutions. He is presently working as an Assistant Professor in the Dept.
of Computer Science & Engineering in West Bengal University of Technology,
Kolkata, India. He has published several papers in International and National level journals and
conferences. He is a senior Member of IEEE.