Mobile ad-hoc networks(MANET) is the collection of mobile nodes which are self organizing and are
connected by wireless links where nodes which are not in the direct range communicate with each other
relying on the intermediate nodes. As a result of trusting other nodes in the route, a malicious node can
easily compromise the security of the network. A black-hole node is the malicious node which drops the
entire packet coming to it and always shows the fresh route to the destination, even if the route to
destination doesn't exist. This paper describes a scheme that will detect the intrusion in the network in the
presence of black-hole node and its performance is compared with the previous technique. This novel
technique helps to increase the network performance by reducing the overhead in the network.
Selective watchdog technique for intrusion detection in mobile ad hoc networkgraphhoc
Mobile ad-hoc networks(MANET) is the collection of mobile nodes which are self organizing and are
connected by wireless links where nodes which are not in the direct range communicate with each other
relying on the intermediate nodes. As a result of trusting other nodes in the route, a malicious node can
easily compromise the security of the network. A black-hole node is the malicious node which drops the
entire packet coming to it and always shows the fresh route to the destination, even if the route to
destination doesn't exist. This paper describes a scheme that will detect the intrusion in the network in the
presence of black-hole node and its performance is compared with the previous technique. This novel
technique helps to increase the network performance by reducing the overhead in the network
A novel defence scheme against selfish Node attack in manetijcsa
This document proposes a new intrusion detection system (IDS) algorithm to defend against selfish node attacks in mobile ad hoc networks (MANETs). Selfish nodes flood the network with false information and drop packets from other nodes. The proposed IDS identifies selfish node behavior and blocks their activities. Simulation results show the IDS enhances network performance from negligible to 92% and prevents infection from attacks. The IDS is integrated with the AODV routing protocol to detect and eliminate selfish nodes within its transmission range.
The document summarizes a research paper that proposes a new mechanism to detect and prevent selfish nodes exhibiting packet dropping attacks in mobile ad hoc networks (MANETs). The mechanism works by calculating the Local Forward Percentage (LFP) of nodes based on the Principle of Flow Conservation, and identifying paths with LFP below a threshold as malicious. It modifies the Ad Hoc On-Demand Distance Vector (AODV) routing protocol to suppress route replies for detected malicious paths, preventing those paths from being used for future data transmission. The mechanism aims to address limitations in existing acknowledgement-based schemes for detecting misbehaving nodes in MANETs.
S IMULATION B ASED S TUDY OF C OOPERATIVE B LACK H OLE A TTACK R ESOLU...pijans
An Ad hoc Network is a pool of wireless mobile node
s energetically forming a network without the use o
f
any pre-accessible network infrastructure or centra
lized administrator. These nodes communicate with
each other by hop-to-hop communication. This dynami
c topology of mobile ad-hoc networks (MANETs)
allows nodes to get attached and leave the network
at any second of time. Thus MANET can be used in a
variety of fields. Current MANETs are designed prim
ary for military utility. This generic characterist
ic of
MANET has rendered its vulnerability to security at
tacks. Due to which unprotected attacks of the
malicious nodes can occur at any time. This paper f
ocuses on one such attack known as “Black hole
attack” and the routing protocol being used here is
AODV
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
A survey on mitigation methods to black hole attack on aodv routing protocolAlexander Decker
This document summarizes research on mitigation methods for black hole attacks on the AODV routing protocol in mobile ad hoc networks. It first provides background on AODV and describes how black hole attacks work by having malicious nodes advertise fake routes. It then surveys two existing mitigation methods: 1) a method that verifies the next hop in route replies is trustworthy, but has limitations against cooperative black hole attacks, and 2) a neighborhood-based detection scheme that recovers reliable routes but could be evaded if attackers selectively forge replies and cannot detect cooperative attacks. The document aims to investigate vulnerabilities in AODV against black hole attacks.
This document discusses enhancing security in mobile ad hoc networks (MANETs) using a hybrid cryptography algorithm. It first provides background on MANETs and existing intrusion detection systems like EAACK that use digital signatures. The proposed system aims to improve on EAACK by using a hybrid of symmetric (AES) and asymmetric (RSA) cryptography. RSA would provide authentication through digital signatures, while AES would handle integrity and confidentiality in a way that reduces network overhead compared to using digital signatures alone. The goal is to achieve better security and integrity than EAACK through this combined cryptographic approach.
Black Hole Detection in AODV Using Hexagonal Encryption in Manet’sIJMER
In MANETs (mobile ad hoc network), security is common problem and lack of issues in
MANET network. When comparing to wired network, MANETs are harmed to security attacks due to the
scarcity of a trusted centralized enforce authority and limited resources. This paper proposed a technique
to avoid Blackhole node behaviour in AODV (Ad Hoc On-Demand Distance Vector) using Hexagonal
Encryption inNS2. Hexagonal Encryption has been chosen for low cost and high computation speed up.
Compared to existing blackhole detection technique, this proposed technique obtains better result by
stimulating in NS2.
Selective watchdog technique for intrusion detection in mobile ad hoc networkgraphhoc
Mobile ad-hoc networks(MANET) is the collection of mobile nodes which are self organizing and are
connected by wireless links where nodes which are not in the direct range communicate with each other
relying on the intermediate nodes. As a result of trusting other nodes in the route, a malicious node can
easily compromise the security of the network. A black-hole node is the malicious node which drops the
entire packet coming to it and always shows the fresh route to the destination, even if the route to
destination doesn't exist. This paper describes a scheme that will detect the intrusion in the network in the
presence of black-hole node and its performance is compared with the previous technique. This novel
technique helps to increase the network performance by reducing the overhead in the network
A novel defence scheme against selfish Node attack in manetijcsa
This document proposes a new intrusion detection system (IDS) algorithm to defend against selfish node attacks in mobile ad hoc networks (MANETs). Selfish nodes flood the network with false information and drop packets from other nodes. The proposed IDS identifies selfish node behavior and blocks their activities. Simulation results show the IDS enhances network performance from negligible to 92% and prevents infection from attacks. The IDS is integrated with the AODV routing protocol to detect and eliminate selfish nodes within its transmission range.
The document summarizes a research paper that proposes a new mechanism to detect and prevent selfish nodes exhibiting packet dropping attacks in mobile ad hoc networks (MANETs). The mechanism works by calculating the Local Forward Percentage (LFP) of nodes based on the Principle of Flow Conservation, and identifying paths with LFP below a threshold as malicious. It modifies the Ad Hoc On-Demand Distance Vector (AODV) routing protocol to suppress route replies for detected malicious paths, preventing those paths from being used for future data transmission. The mechanism aims to address limitations in existing acknowledgement-based schemes for detecting misbehaving nodes in MANETs.
S IMULATION B ASED S TUDY OF C OOPERATIVE B LACK H OLE A TTACK R ESOLU...pijans
An Ad hoc Network is a pool of wireless mobile node
s energetically forming a network without the use o
f
any pre-accessible network infrastructure or centra
lized administrator. These nodes communicate with
each other by hop-to-hop communication. This dynami
c topology of mobile ad-hoc networks (MANETs)
allows nodes to get attached and leave the network
at any second of time. Thus MANET can be used in a
variety of fields. Current MANETs are designed prim
ary for military utility. This generic characterist
ic of
MANET has rendered its vulnerability to security at
tacks. Due to which unprotected attacks of the
malicious nodes can occur at any time. This paper f
ocuses on one such attack known as “Black hole
attack” and the routing protocol being used here is
AODV
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
A survey on mitigation methods to black hole attack on aodv routing protocolAlexander Decker
This document summarizes research on mitigation methods for black hole attacks on the AODV routing protocol in mobile ad hoc networks. It first provides background on AODV and describes how black hole attacks work by having malicious nodes advertise fake routes. It then surveys two existing mitigation methods: 1) a method that verifies the next hop in route replies is trustworthy, but has limitations against cooperative black hole attacks, and 2) a neighborhood-based detection scheme that recovers reliable routes but could be evaded if attackers selectively forge replies and cannot detect cooperative attacks. The document aims to investigate vulnerabilities in AODV against black hole attacks.
This document discusses enhancing security in mobile ad hoc networks (MANETs) using a hybrid cryptography algorithm. It first provides background on MANETs and existing intrusion detection systems like EAACK that use digital signatures. The proposed system aims to improve on EAACK by using a hybrid of symmetric (AES) and asymmetric (RSA) cryptography. RSA would provide authentication through digital signatures, while AES would handle integrity and confidentiality in a way that reduces network overhead compared to using digital signatures alone. The goal is to achieve better security and integrity than EAACK through this combined cryptographic approach.
Black Hole Detection in AODV Using Hexagonal Encryption in Manet’sIJMER
In MANETs (mobile ad hoc network), security is common problem and lack of issues in
MANET network. When comparing to wired network, MANETs are harmed to security attacks due to the
scarcity of a trusted centralized enforce authority and limited resources. This paper proposed a technique
to avoid Blackhole node behaviour in AODV (Ad Hoc On-Demand Distance Vector) using Hexagonal
Encryption inNS2. Hexagonal Encryption has been chosen for low cost and high computation speed up.
Compared to existing blackhole detection technique, this proposed technique obtains better result by
stimulating in NS2.
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.
Mobile ad hoc network (MANET) is an autonomous system of mobile nodes. Each node operates not only as an end system, but also as a router to forward packets. The nodes are free to move about and organize themselves into a network. These cause extra challenges on security. In this paper, evaluation of prominent on-demand routing protocol i.e. AODV,MAODV,RAODV has been done by varying the network size. An effort has been carried out to do the performance evaluation of these protocols using random way point model. The simulator used is NS 2.34. The performance of either protocol has been studied by using a self created network scenario with respect to pause time.
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
The peer-reviewed International Journal of Engineering Inventions (IJEI) is started with a mission to encourage contribution to research in Science and Technology. Encourage and motivate researchers in challenging areas of Sciences and Technology.
AN ENHANCED DETECTION AND ENERGYEFFICIENT EN-ROUTE FILTERING SCHEME IN WIRELE...ieijjournal
Wireless sensor networks (WSNs), due to their small size, low cost, and untethered communication over a short-range, have great potential for applications and services. Due to hostile environments and an unattended nature, they are prone to many types of attacks by adversaries. False data injection attacks compromise data accuracy at the sink node and cause undesirable energy depletion at the sink and intermediate nodes. In order to detect and counter false data attacks, a number of en-route filtering schemes have been proposed. However, they lack a strong false report detection capacity or cannot support network dynamics well. Commutative cipher-based en-route filtering (CCEF) is based on fixed paths, and a
fixed detection probability, and does not consider the residual energy of a node. In an enhanced detectioncapacity and energy-efficient en-route filtering (EDEF) scheme, we use a fuzzy logic system which considers the residual energy, false traffic ratio (FTR), and number of message authentication codes
(MACs) in a report to evaluate the fitness of a node to be a verification node. This helps to balance network
energy usage and reduce the number of hops a false report may travel. The simulation results demonstrate the validity of our scheme with increased energy-efficiency (4.55 to 13.92%) and detection power (99.95%) against false report attacks in WSNs.
Mobile Ad-hoc Network is group of wireless mobile device with restricted broadcast range and no use of base Infrastructure. The secure routing model helps for reduced honest elicitation and free riding problem. The term honest elicitation means it forward high recommendation for malicious node in order to avoid itself. It means the high recommendation for colludingmalicious node. When operating in hostile or suspicious setting, MANETs require privacy and ,communication security in routing protocol. In this paper we present the type of attacks and operation on network layer with routing protocol technique i.e. based on an on-demand locationbased anonymous MANET routing protocol called SMRT (secure MANET routing technique ,with trust model) that achieves security and privacy against insider and outsider adversaries.
The document discusses techniques for secure neighbor discovery and position verification in mobile ad hoc networks (MANETs). It proposes a distributed protocol called Neighbor Position Verification (NPV) that allows nodes to verify the positions of neighboring nodes without relying on trusted third parties. The NPV protocol uses a 4-step message exchange and distance calculations to classify neighbor nodes as verified, faulty, or unverifiable. It aims to minimize false positives and negatives while being robust against adversarial attacks. The document also discusses extending NPV to dynamic source routing to allow for verification of mobile nodes rather than static node positions. This improves security and network performance for MANETs.
A NOVEL INTRUSION DETECTION SYSTEM FOR DETECTING BLACK-HOLE NODES IN MANETSFransiskeran
The document summarizes a research paper that proposes a novel intrusion detection system to detect black-hole nodes in mobile ad hoc networks (MANETs). It first provides background on MANETs and the black-hole attack. It then describes how the Ad hoc On-Demand Distance Vector (AODV) routing protocol works and its vulnerabilities. Next, it discusses existing work on detecting black-hole attacks and outlines the proposed algorithm, which will detect black-hole nodes by implementing changes to the AODV routing protocol and simulating it using the NS-2 network simulator.
Shortest path algorithm for data transmission in wireless ad hoc sensor networksijasuc
Wireless sensor networks determine probable in military, environments, health and commercial
applications. The process of transferring of information from a remote sensor node to other nodes in a
network holds importance for such applications. Various constraints such as limited computation, storage
and power makes the process of transferring of information routing interesting and has opened new arenas
for researchers. The fundamental problem in sensor networks states the significance and routing of
information through a real path as path length decides some basic performance parameters for sensor
networks. This paper strongly focuses on a shortest path algorithm for wireless adhoc networks. The
simulations are performed on NS2 and the results obtained discuss the role of transferring of information
through a shortest path.
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.
1) The document proposes a new network construction method called k-SBCCS Protocol for strong k-barrier coverage using wireless sensor nodes for border security systems.
2) It aims to prolong network lifetime by establishing a balanced energy usage across nodes. The k-SBCCS Protocol uses a divide-and-conquer approach to construct local barriers in segmented regions and coordinate barrier coverage across segments.
3) Simulation results show that the k-SBCCS Protocol can reduce communication overhead and computation costs compared to centralized algorithms, and strengthens local barrier coverage through coordinated barriers across segments.
New generation communication networks are moving towards autonomous wireless infrastructures which are very popular in the application of multimedia broadcasting and mobile communication where N numbers of data are transfer through the wireless network every day. In such applications security of transmitted signal is very important in wireless communication network. So the proposed work creates a methodology to increase the security of the data and communication using chaotic encryption algorithm to transfer the data from the wireless network. A proposed new structure is based on coupling of chaotic system. We combine the text message with the chaotic signals to reduce the attack and improve the security of the data. The performance of BER in AWGN channel are verified and analyzed with MATLAB toolbox.
This document summarizes research on the performance impact of black hole attacks on mobile ad hoc networks (MANETs) using different routing protocols. The researchers conducted simulations using OPNET to evaluate the effects of black hole attacks on network throughput, delay, and load under three routing protocols: AODV, OLSR, and DSR. With AODV, the presence of black hole attackers significantly reduced throughput and increased delay by discarding packets. OLSR was not significantly affected by attackers. With DSR, throughput increased over time with attackers due to increasing discarded packets. The research analyzed how black hole attacks degrade MANET performance depending on the routing protocol used.
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.
This document summarizes a research paper that simulates the Ad Hoc On-Demand Distance Vector (AODV) routing protocol under black hole attacks in mobile ad hoc networks (MANETs). The paper analyzes how black hole attacks affect key AODV routing metrics like packet delivery ratio and end-to-end delay. Through simulations with varying numbers of nodes, the paper finds that black hole attacks significantly reduce packet delivery ratios by diverting traffic to malicious nodes. The simulations provide insight into how AODV performance degrades under such attacks.
Prevention and Detection of Misbehaving Node in WSN Based On the Intrusion De...theijes
This document proposes an intrusion detection system called EAACK to prevent and detect misbehaving nodes in wireless sensor networks. EAACK aims to overcome some of the shortcomings of existing systems like Watchdog. It consists of three parts: ACK, S-ACK and MRA. ACK provides end-to-end acknowledgment between nodes. S-ACK involves three successive nodes cooperating to detect misbehavior. MRA authenticates misbehavior reports to prevent false reports. The document analyzes EAACK's performance compared to existing systems, finding it has lower packet loss and higher delivery rates. It concludes EAACK provides effective attack detection and key management to ensure security while being able to extend to other attack types in the future.
Mobile Ad Hoc Network (MANET) is one kind of new wireless network
structures which is also known as infrastructure less network. Unlike devices in traditional
wireless LAN solution, all nodes are movable and the topology of the network is changing
dynamically in an Ad Hoc Network, which brings great challenges to the security of Mobile
Ad Hoc Networks. MANET is particularly vulnerable to various types of security attacks
due to its fundamental characteristics e.g. the lack of centralized monitoring, dynamic
network topology, open medium, autonomous terminal and management. As a result,
attackers can take advantage of flaws in routing protocols to carry out various attacks. The
black hole attack is one of such security issue in MANET. It could disturb the routing
protocol and bring about huge damage to the network’s topology. In this attack, a malicious
node gives false information of having shortest route to the destination node so as to get all
data packets and drops it. In this paper, we propose an algorithm which mitigates the
impact of black hole attack in AODV routing.
Mobile Ad hoc Network is a collection of wireless mobile nodes forming a network without
using any existing infrastructure. MANET is a collection of mobile nodes along with wireless
transmitter and receiver that with each other via a bi-directional links either directly or indirectly. A
new intrusion detection system named communicates Enhanced Adaptive Acknowledgment
(EAACK) specially designed for MANETs. It is based on the digital signature algorithm (DSA). To
enhance the security in the mobile adhoc networks, we introduce a new approach called Hybrid
cryptography algorithm that provides integrity, confidentiality and authentication. This hybrid
cryptography algorithm is based on two cryptography algorithms such as RSA and AES. Encryption is
achieved by using, RSA algorithm for authentication and symmetric algorithm for the integrity. By
using the symmetric and asymmetric cryptographic algorithm, we can achieve better security and
integrity than the EAACK
A Novel Acknowledgement based Intrusion Detection System for MANETsIJMER
In Mobile Ad Hoc Networks(MANETs), a set of interacting nodes should cooperatively
implement the routing functions to enable end-to-end communication along dynamic paths composed by
multi-hop wireless links. Several multi-hop routing protocols have been proposed for ad hoc networks,
and most popular ones include: Dynamic Source Routing (DSR), Optimized Link-State Routing (OLSR),
Ad Hoc On-Demand Distance Vector (AODV) and Destination- Sequenced Distance-Vector (DSDV).
Most of these protocols rely on the assumption of a trustworthy cooperation among all participating
nodes; unfortunately, this may not be a realistic assumption in real hosts. Malicious hosts could exploit
the weakness of MANET to launch various kinds of attacks. Node mobility on ad hoc network cannot be
restricted. As results, many Intrusion Detection System(IDS) solutions have been proposed for the wired
network, which they are defined on strategic points such as switches, gateways, and routers, can not be
implemented on the MANET. Thus, the wired network IDS characteristics must be modified prior to be
implemented in the ad hoc network. Thus an IDS should be added to enhance the security level of
MANETs. If MANET can detect the attackers as soon as they enter the network, we will be able to
completely eliminate the potential vulnerabilities caused by compromised nodes at the first time. IDSs
usually act as the second layer in MANETs. This paper presents an novel IDS for MANETs which is
based on acknowledgements.
This document describes a proposed system called Enhanced Adaptive Acknowledgement (EAACK) for detecting misbehaving nodes in mobile ad hoc networks (MANETs). The system uses three components - ACK, Secure ACK, and Misbehavior Report Analysis. ACK provides end-to-end acknowledgment, S-ACK provides acknowledgment between three consecutive nodes, and MRA confirms any misbehavior reports. Digital signatures are also used to validate acknowledgments. The system is simulated using the NS-2 network simulator and results show it can effectively detect misbehaving nodes while maintaining good network performance.
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.
Mobile ad hoc network (MANET) is an autonomous system of mobile nodes. Each node operates not only as an end system, but also as a router to forward packets. The nodes are free to move about and organize themselves into a network. These cause extra challenges on security. In this paper, evaluation of prominent on-demand routing protocol i.e. AODV,MAODV,RAODV has been done by varying the network size. An effort has been carried out to do the performance evaluation of these protocols using random way point model. The simulator used is NS 2.34. The performance of either protocol has been studied by using a self created network scenario with respect to pause time.
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
The peer-reviewed International Journal of Engineering Inventions (IJEI) is started with a mission to encourage contribution to research in Science and Technology. Encourage and motivate researchers in challenging areas of Sciences and Technology.
AN ENHANCED DETECTION AND ENERGYEFFICIENT EN-ROUTE FILTERING SCHEME IN WIRELE...ieijjournal
Wireless sensor networks (WSNs), due to their small size, low cost, and untethered communication over a short-range, have great potential for applications and services. Due to hostile environments and an unattended nature, they are prone to many types of attacks by adversaries. False data injection attacks compromise data accuracy at the sink node and cause undesirable energy depletion at the sink and intermediate nodes. In order to detect and counter false data attacks, a number of en-route filtering schemes have been proposed. However, they lack a strong false report detection capacity or cannot support network dynamics well. Commutative cipher-based en-route filtering (CCEF) is based on fixed paths, and a
fixed detection probability, and does not consider the residual energy of a node. In an enhanced detectioncapacity and energy-efficient en-route filtering (EDEF) scheme, we use a fuzzy logic system which considers the residual energy, false traffic ratio (FTR), and number of message authentication codes
(MACs) in a report to evaluate the fitness of a node to be a verification node. This helps to balance network
energy usage and reduce the number of hops a false report may travel. The simulation results demonstrate the validity of our scheme with increased energy-efficiency (4.55 to 13.92%) and detection power (99.95%) against false report attacks in WSNs.
Mobile Ad-hoc Network is group of wireless mobile device with restricted broadcast range and no use of base Infrastructure. The secure routing model helps for reduced honest elicitation and free riding problem. The term honest elicitation means it forward high recommendation for malicious node in order to avoid itself. It means the high recommendation for colludingmalicious node. When operating in hostile or suspicious setting, MANETs require privacy and ,communication security in routing protocol. In this paper we present the type of attacks and operation on network layer with routing protocol technique i.e. based on an on-demand locationbased anonymous MANET routing protocol called SMRT (secure MANET routing technique ,with trust model) that achieves security and privacy against insider and outsider adversaries.
The document discusses techniques for secure neighbor discovery and position verification in mobile ad hoc networks (MANETs). It proposes a distributed protocol called Neighbor Position Verification (NPV) that allows nodes to verify the positions of neighboring nodes without relying on trusted third parties. The NPV protocol uses a 4-step message exchange and distance calculations to classify neighbor nodes as verified, faulty, or unverifiable. It aims to minimize false positives and negatives while being robust against adversarial attacks. The document also discusses extending NPV to dynamic source routing to allow for verification of mobile nodes rather than static node positions. This improves security and network performance for MANETs.
A NOVEL INTRUSION DETECTION SYSTEM FOR DETECTING BLACK-HOLE NODES IN MANETSFransiskeran
The document summarizes a research paper that proposes a novel intrusion detection system to detect black-hole nodes in mobile ad hoc networks (MANETs). It first provides background on MANETs and the black-hole attack. It then describes how the Ad hoc On-Demand Distance Vector (AODV) routing protocol works and its vulnerabilities. Next, it discusses existing work on detecting black-hole attacks and outlines the proposed algorithm, which will detect black-hole nodes by implementing changes to the AODV routing protocol and simulating it using the NS-2 network simulator.
Shortest path algorithm for data transmission in wireless ad hoc sensor networksijasuc
Wireless sensor networks determine probable in military, environments, health and commercial
applications. The process of transferring of information from a remote sensor node to other nodes in a
network holds importance for such applications. Various constraints such as limited computation, storage
and power makes the process of transferring of information routing interesting and has opened new arenas
for researchers. The fundamental problem in sensor networks states the significance and routing of
information through a real path as path length decides some basic performance parameters for sensor
networks. This paper strongly focuses on a shortest path algorithm for wireless adhoc networks. The
simulations are performed on NS2 and the results obtained discuss the role of transferring of information
through a shortest path.
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.
1) The document proposes a new network construction method called k-SBCCS Protocol for strong k-barrier coverage using wireless sensor nodes for border security systems.
2) It aims to prolong network lifetime by establishing a balanced energy usage across nodes. The k-SBCCS Protocol uses a divide-and-conquer approach to construct local barriers in segmented regions and coordinate barrier coverage across segments.
3) Simulation results show that the k-SBCCS Protocol can reduce communication overhead and computation costs compared to centralized algorithms, and strengthens local barrier coverage through coordinated barriers across segments.
New generation communication networks are moving towards autonomous wireless infrastructures which are very popular in the application of multimedia broadcasting and mobile communication where N numbers of data are transfer through the wireless network every day. In such applications security of transmitted signal is very important in wireless communication network. So the proposed work creates a methodology to increase the security of the data and communication using chaotic encryption algorithm to transfer the data from the wireless network. A proposed new structure is based on coupling of chaotic system. We combine the text message with the chaotic signals to reduce the attack and improve the security of the data. The performance of BER in AWGN channel are verified and analyzed with MATLAB toolbox.
This document summarizes research on the performance impact of black hole attacks on mobile ad hoc networks (MANETs) using different routing protocols. The researchers conducted simulations using OPNET to evaluate the effects of black hole attacks on network throughput, delay, and load under three routing protocols: AODV, OLSR, and DSR. With AODV, the presence of black hole attackers significantly reduced throughput and increased delay by discarding packets. OLSR was not significantly affected by attackers. With DSR, throughput increased over time with attackers due to increasing discarded packets. The research analyzed how black hole attacks degrade MANET performance depending on the routing protocol used.
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.
This document summarizes a research paper that simulates the Ad Hoc On-Demand Distance Vector (AODV) routing protocol under black hole attacks in mobile ad hoc networks (MANETs). The paper analyzes how black hole attacks affect key AODV routing metrics like packet delivery ratio and end-to-end delay. Through simulations with varying numbers of nodes, the paper finds that black hole attacks significantly reduce packet delivery ratios by diverting traffic to malicious nodes. The simulations provide insight into how AODV performance degrades under such attacks.
Prevention and Detection of Misbehaving Node in WSN Based On the Intrusion De...theijes
This document proposes an intrusion detection system called EAACK to prevent and detect misbehaving nodes in wireless sensor networks. EAACK aims to overcome some of the shortcomings of existing systems like Watchdog. It consists of three parts: ACK, S-ACK and MRA. ACK provides end-to-end acknowledgment between nodes. S-ACK involves three successive nodes cooperating to detect misbehavior. MRA authenticates misbehavior reports to prevent false reports. The document analyzes EAACK's performance compared to existing systems, finding it has lower packet loss and higher delivery rates. It concludes EAACK provides effective attack detection and key management to ensure security while being able to extend to other attack types in the future.
Mobile Ad Hoc Network (MANET) is one kind of new wireless network
structures which is also known as infrastructure less network. Unlike devices in traditional
wireless LAN solution, all nodes are movable and the topology of the network is changing
dynamically in an Ad Hoc Network, which brings great challenges to the security of Mobile
Ad Hoc Networks. MANET is particularly vulnerable to various types of security attacks
due to its fundamental characteristics e.g. the lack of centralized monitoring, dynamic
network topology, open medium, autonomous terminal and management. As a result,
attackers can take advantage of flaws in routing protocols to carry out various attacks. The
black hole attack is one of such security issue in MANET. It could disturb the routing
protocol and bring about huge damage to the network’s topology. In this attack, a malicious
node gives false information of having shortest route to the destination node so as to get all
data packets and drops it. In this paper, we propose an algorithm which mitigates the
impact of black hole attack in AODV routing.
Mobile Ad hoc Network is a collection of wireless mobile nodes forming a network without
using any existing infrastructure. MANET is a collection of mobile nodes along with wireless
transmitter and receiver that with each other via a bi-directional links either directly or indirectly. A
new intrusion detection system named communicates Enhanced Adaptive Acknowledgment
(EAACK) specially designed for MANETs. It is based on the digital signature algorithm (DSA). To
enhance the security in the mobile adhoc networks, we introduce a new approach called Hybrid
cryptography algorithm that provides integrity, confidentiality and authentication. This hybrid
cryptography algorithm is based on two cryptography algorithms such as RSA and AES. Encryption is
achieved by using, RSA algorithm for authentication and symmetric algorithm for the integrity. By
using the symmetric and asymmetric cryptographic algorithm, we can achieve better security and
integrity than the EAACK
A Novel Acknowledgement based Intrusion Detection System for MANETsIJMER
In Mobile Ad Hoc Networks(MANETs), a set of interacting nodes should cooperatively
implement the routing functions to enable end-to-end communication along dynamic paths composed by
multi-hop wireless links. Several multi-hop routing protocols have been proposed for ad hoc networks,
and most popular ones include: Dynamic Source Routing (DSR), Optimized Link-State Routing (OLSR),
Ad Hoc On-Demand Distance Vector (AODV) and Destination- Sequenced Distance-Vector (DSDV).
Most of these protocols rely on the assumption of a trustworthy cooperation among all participating
nodes; unfortunately, this may not be a realistic assumption in real hosts. Malicious hosts could exploit
the weakness of MANET to launch various kinds of attacks. Node mobility on ad hoc network cannot be
restricted. As results, many Intrusion Detection System(IDS) solutions have been proposed for the wired
network, which they are defined on strategic points such as switches, gateways, and routers, can not be
implemented on the MANET. Thus, the wired network IDS characteristics must be modified prior to be
implemented in the ad hoc network. Thus an IDS should be added to enhance the security level of
MANETs. If MANET can detect the attackers as soon as they enter the network, we will be able to
completely eliminate the potential vulnerabilities caused by compromised nodes at the first time. IDSs
usually act as the second layer in MANETs. This paper presents an novel IDS for MANETs which is
based on acknowledgements.
This document describes a proposed system called Enhanced Adaptive Acknowledgement (EAACK) for detecting misbehaving nodes in mobile ad hoc networks (MANETs). The system uses three components - ACK, Secure ACK, and Misbehavior Report Analysis. ACK provides end-to-end acknowledgment, S-ACK provides acknowledgment between three consecutive nodes, and MRA confirms any misbehavior reports. Digital signatures are also used to validate acknowledgments. The system is simulated using the NS-2 network simulator and results show it can effectively detect misbehaving nodes while maintaining good network performance.
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.
A network is nothing but multiple nodes are
connected with each other in some manner. The communication
between each node and the topology of the network are important
to make the environment more efficient. The communications
between systems are broadly categorized into two; that are wired
and wireless communication. In wired network, each node will be
connected through physical wires and follows a topology. But in
wireless network the communication between each node will be
happen a centralized node called Access Point. In wireless
environment a special wireless network is called MANET, in
which there will be no centralized Access Points. MANET is
nothing but Mobile Ad-hoc NETwork. In MANET each node acts
as a sender and receiver. And there is no fixed route between
nodes. Based on the nodes reachable, node will change the
routing table dynamically. So the mobility and scalability of the
nodes will not impact the MANET. The self-configuring ability of
the MANET made it popular in military applications and
emergency recovery. So the communication between each node
should be more secure and trustable. And it’s important to
identify the malicious nodes in MANET too. The malicious nodes
are nodes which are not able to sends packets further or the
nodes which are sends false report to the sender. To identify these
malicious nodes and sends the messages with more secure with
authorization need to implement new Intrusion Identification
System called Digital Signature with Acknowledgement name as
Enhanced Adaptive Acknowledgement. The objective of MANET
is fast communication. So its need to analyze the network
throughput also once the new Intrusion Identification System
introduced.
TRIDNT: THE TRUST-BASED ROUTING PROTOCOL WITH CONTROLLED DEGREE OF NODE SELFI...IJNSA Journal
In Mobile ad-hoc network, nodes must cooperate to achieve the routing purposes. Node misbehaviour due to selfish or malicious intention could significantly degrade the performance of MANET because most existing routing protocols in MANET are aiming at finding most efficiency path. In this paper, we propose a Two node-disjoint Routes protocol for Isolating Dropper Node in MANET (TRIDNT) to deal with misbehaviour in MANET. TRIDNT allows some degree of selfishness to give an incentive to the selfish nodes to declare itself to its neighbours, which reduce the misbehaving nodes searching time. In TRIDNT two node-disjoint routes between the source and destination are selected based on their trust values. We use both DLL-ACK and end-to-end TCP-ACK to monitor the behaviour of routing path nodes: if a malicious behaviour is detected then the path searching tool starts to identify the malicious nodes and isolate them. Finally by using a mathematical analysis we find that our proposed protocol reduces the searching time of malicious nodes comparing to the route expected life time, and avoids the isolated misbehaving node from sharing in all future routes, which improve the overall network throughput.
Using Homomorphism Linear Signature Auditing Detection of Routing Packet Drop...IJMTST Journal
In wireless ad hoc network packets are loosed due to two conditions one is due to the perturbance in the
channel and another one is due to the intrusion (i.e.) intruder discard the packet. In this paper we fixate on
the inner attack (i.e.) the assailment caused by the intruder who malevolently discards the packets. The
malevolent node pretends to be an one of the node in the routing path and cause the assailment.
Conventional algorithm does not provide the efficient detection of packet loss so, In order to ameliorate the
detection accurately we propose correlation function and withal for the correct calculation of correlation we
implement BLS predicated Homomorphism Linear Authenticator to check the information provided by the
node are true. The HLA architecture provides privacy preserving, collusion proof and sanctions low
communication and storage overheads.
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.
INFRINGEMENT PRECLUSION SYSTEM VIA SADEC: STEALTHY ATTACK DETECTION AND COUNT...ijp2p
In this paper we are providing a implementation details about simulated solution of stealthy packet drop
attack. Stealthy packet drop attack is a suite of four attack types, includes colluding collision, packet
misrouting, identity delegation and power control. Stealthy packet drop attacks disrupts the packet from
reaching to it’s destination through malicious behaviour. These attacks can be easily breakdown the
multi-hop wireless ad-hoc networks. Most widely preferred method for detecting attacks in wireless
network is behaviour based detection method. In this method a normal network overhears
communication from its neighbourhood. Here we are implementing a SADEC protocol which is
proposed solution of stealthy packet drop attacks. SADEC overlaid the base line local monitoring. In
base line local monitoring each neighbour maintains additional information about routing path also it
adds some checking responsibility to all its neighbours. SADEC proves more efficient than baseline local
monitoring to mitigate successfully all the stealthy attack types.
INFRINGEMENT PRECLUSION SYSTEM VIA SADEC: STEALTHY ATTACK DETECTION AND COUNT...ijp2p
In this paper we are providing a implementation details about simulated solution of stealthy packet drop
attack. Stealthy packet drop attack is a suite of four attack types, includes colluding collision, packet
misrouting, identity delegation and power control. Stealthy packet drop attacks disrupts the packet from
reaching to it’s destination through malicious behaviour. These attacks can be easily breakdown the
multi-hop wireless ad-hoc networks. Most widely preferred method for detecting attacks in wireless
network is behaviour based detection method. In this method a normal network overhears
communication from its neighbourhood. Here we are implementing a SADEC protocol which is
proposed solution of stealthy packet drop attacks. SADEC overlaid the base line local monitoring. In
base line local monitoring each neighbour maintains additional information about routing path also it
adds some checking responsibility to all its neighbours. SADEC proves more efficient than baseline local
monitoring to mitigate successfully all the stealthy attack types.
INFRINGEMENT PRECLUSION SYSTEM VIA SADEC: STEALTHY ATTACK DETECTION AND COUNT...ijp2p
In this paper we are providing a implementation details about simulated solution of stealthy packet drop
attack. Stealthy packet drop attack is a suite of four attack types, includes colluding collision, packet
misrouting, identity delegation and power control. Stealthy packet drop attacks disrupts the packet from
reaching to it’s destination through malicious behaviour. These attacks can be easily breakdown the
multi-hop wireless ad-hoc networks. Most widely preferred method for detecting attacks in wireless
network is behaviour based detection method. In this method a normal network overhears
communication from its neighbourhood. Here we are implementing a SADEC protocol which is
proposed solution of stealthy packet drop attacks. SADEC overlaid the base line local monitoring. In
base line local monitoring each neighbour maintains additional information about routing path also it
adds some checking responsibility to all its neighbours. SADEC proves more efficient than baseline local
monitoring to mitigate successfully all the stealthy attack types.
INFRINGEMENT PRECLUSION SYSTEM VIA SADEC: STEALTHY ATTACK DETECTION AND COUNT...ijp2p
In this paper we are providing a implementation details about simulated solution of stealthy packet drop
attack. Stealthy packet drop attack is a suite of four attack types, includes colluding collision, packet
misrouting, identity delegation and power control. Stealthy packet drop attacks disrupts the packet from
reaching to it’s destination through malicious behaviour. These attacks can be easily breakdown the
multi-hop wireless ad-hoc networks. Most widely preferred method for detecting attacks in wireless
network is behaviour based detection method. In this method a normal network overhears
communication from its neighbourhood. Here we are implementing a SADEC protocol which is
proposed solution of stealthy packet drop attacks. SADEC overlaid the base line local monitoring. In
base line local monitoring each neighbour maintains additional information about routing path also it
adds some checking responsibility to all its neighbours. SADEC proves more efficient than baseline local
monitoring to mitigate successfully all the stealthy attack types.
INFRINGEMENT PRECLUSION SYSTEM VIA SADEC: STEALTHY ATTACK DETECTION AND COUNT...ijp2p
In this paper we are providing a implementation details about simulated solution of stealthy packet drop
attack. Stealthy packet drop attack is a suite of four attack types, includes colluding collision, packet
misrouting, identity delegation and power control. Stealthy packet drop attacks disrupts the packet from
reaching to it’s destination through malicious behaviour. These attacks can be easily breakdown the
multi-hop wireless ad-hoc networks. Most widely preferred method for detecting attacks in wireless
network is behaviour based detection method. In this method a normal network overhears
communication from its neighbourhood. Here we are implementing a SADEC protocol which is
proposed solution of stealthy packet drop attacks. SADEC overlaid the base line local monitoring. In
base line local monitoring each neighbour maintains additional information about routing path also it
adds some checking responsibility to all its neighbours. SADEC proves more efficient than baseline local
monitoring to mitigate successfully all the stealthy attack types.
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.
A Survey of various Methods of Preventing and Detecting Attacks on AODV-based...IJERD Editor
Mobile Ad hoc Network (MANET) is constructed from a collection of nodes that can move
anywhere and anytime in different areas without any infrastructure that means MANET is infrastructure less.
Each node works at the same time as router and host. Lack of a fixed infrastructure, wireless medium and
dynamic topology makes MANET vulnerable to different kinds of attacks like Gray hole and Black hole. In this
paper, we investigate different mechanisms that have designed to detect or prevent black or gray hole attacks in
AODV protocol. We discuss about advantages and disadvantages of the different methods.
DETECTING PACKET DROPPING ATTACK IN WIRELESS AD HOC NETWORKIJCI JOURNAL
In wireless ad hoc network, packet loss is a serious issue. Either it is caused by link errors or by malicious
packet dropping. The malicious nodes in a route can intentionally drop the packets during the transmission
from source to destination. It is difficult to distinct the packet loss due to link errors and malicious
dropping. Here is a mechanism which will detect the malicious packet dropping by using the correlation
between packets. An auditing architecture based on homomorphic linear authenticator can be used to
ensure the proof of reception of packets at each node. Also to ensure the forwarding of packets at each
node, a reputation mechanism based on indirect reciprocity can be used.
The document summarizes research on preserving source location privacy in wireless sensor networks. It proposes using computer-based image recognition to analyze traffic patterns and detect modified data packets. The key points are:
1) Wireless sensor networks are vulnerable to traffic analysis attacks that can reveal the location of data sources. Existing solutions have limitations like increased energy use.
2) The paper proposes using computer-based image recognition to analyze traffic and identify packets whose delivery was delayed, indicating modification by an attacker.
3) If the attacking node is identified, it would be removed from the network. This approach aims to effectively preserve source location privacy against traffic analysis attacks.
Review on Detection & Prevention Methods for Black Hole Attack on AODV based ...IJERD Editor
Dynamic nature of Mobile Ad-hoc networks (MANET) challenges the quality of service (QoS)
because route failure probability is increased in MANET due to the mobility of nodes. Lack of fixed
infrastructure, wireless shared medium and dynamic topology makes MANET prone to different types of
attacks. Ad-hoc On-Demand Distance Vector (AODV) routing protocol in MANETs which is vulnerable to a
variety of security threats in ad-hoc networks. Black hole attack is an attack that drop considerable number of
packet by performing packet forwarding misbehaviour and violate the security to cause Denial-of-Service
(DoS) in Mobile Ad-hoc networks (MANET). In this paper we investigate different mechanism to detect and
prevent black hole attack in AODV protocol. We also discuss about advantages and disadvantages of the
methods.
Similar to SELECTIVE WATCHDOG TECHNIQUE FOR INTRUSION DETECTION IN MOBILE AD-HOC NETWORK (20)
IMPACT OF ENERGY AND LINK QUALITY INDICATOR WITH LINK QUALITY ESTIMATORS IN W...Fransiskeran
The Link Quality Indicator (LQI) and Residual Energy have a fundamental impact on the network
performance in Wireless Sensor Networks (WSNs) and affects as well in the life time of nodes. This paper
will provide a comparative of Link Quality Estimator, the Link Quality Estimator with Link Quality
Indicator and Link Quality Estimator with Residual Energy. In this paper we develop a Collect Tree
Protocol (CTP) and compare the performance of LQI and Residual Energy, and show their effect on the
packet delivery ratio and throughput, covering the characteristics of low-power links, and their
performance to the best of our knowledge, we believe that our efforts would have implementations on
embedded application.
CA-MWSN: CLUSTERING ALGORITHM FOR MOBILE WIRELESS SENOR NETWORKFransiskeran
This paper proposes a centralized clustering algorithm (CA-MWSN) for selecting cluster heads in mobile wireless sensor networks. The base station first performs dynamic clustering based on sensor location updates. It then runs CA-MWSN, which uses fuzzy logic to calculate each node's "chance" of being elected cluster head based on residual energy, expected residual energy, and mobility. The node with the highest chance is selected as the cluster head for that round. Dynamic clustering and CA-MWSN aim to provide uniform energy distribution in mobile sensor networks where nodes may become densely or sparsely distributed.
ON ALGORITHMIC PROBLEMS CONCERNING GRAPHS OF HIGHER DEGREE OF SYMMETRYFransiskeran
Since the ancient determination of the five platonic solids the study of symmetry and regularity has always
been one of the most fascinating aspects of mathematics. One intriguing phenomenon of studies in graph
theory is the fact that quite often arithmetic regularity properties of a graph imply the existence of many
symmetries, i.e. large automorphism group G. In some important special situation higher degree of
regularity means that G is an automorphism group of finite geometry. For example, a glance through the
list of distance regular graphs of diameter d < 3 reveals the fact that most of them are connected with
classical Lie geometry. Theory of distance regular graphs is an important part of algebraic combinatorics
and its applications such as coding theory, communication networks, and block design. An important tool
for investigation of such graphs is their spectra, which is the set of eigenvalues of adjacency matrix of a
graph. Let G be a finite simple group of Lie type and X be the set homogeneous elements of the associated
geometry.
AN APPLICATION OF Gd -METRIC SPACES AND METRIC DIMENSION OF GRAPHSFransiskeran
The idea of metric dimension in graph theory was introduced by P J Slater in [2]. It has been found
applications in optimization, navigation, network theory, image processing, pattern recognition etc.
Several other authors have studied metric dimension of various standard graphs. In this paper we
introduce a real valued function called generalized metric → + Gd
: X × X × X R where X = r(v /W) =
{(d(v,v1
),d(v,v2
),...,d(v,vk
/) v∈V (G))}, denoted Gd
and is used to study metric dimension of graphs. It
has been proved that metric dimension of any connected finite simple graph remains constant if Gd
numbers of pendant edges are added to the non-basis vertices.
METRIC DIMENSION AND UNCERTAINTY OF TRAVERSING ROBOTS IN A NETWORKFransiskeran
Metric dimension in graph theory has many applications in the real world. It has been applied to the
optimization problems in complex networks, analyzing electrical networks; show the business relations,
robotics, control of production processes etc. This paper studies the metric dimension of graphs with
respect to contraction and its bijection between them. Also an algorithm to avoid the overlapping between
the robots in a network is introduced.
EVEN GRACEFUL LABELLING OF A CLASS OF TREESFransiskeran
A labelling or numbering of a graph G with q edges is an assignment of labels to the vertices of G that
induces for each edge uv a labelling depending on the vertex labels f(u) and f(v). A labelling is called a
graceful labelling if there exists an injective function f: V (G) → {0, 1,2,......q} such that for each edge xy,
the labelling │f(x)-f(y)│is distinct. In this paper, we prove that a class of Tn trees are even graceful.
SWARM INTELLIGENCE FROM NATURAL TO ARTIFICIAL SYSTEMS: ANT COLONY OPTIMIZATIONFransiskeran
This document summarizes research on ant colony optimization (ACO), a metaheuristic algorithm inspired by the foraging behavior of ants. It describes how real ant colonies use pheromone trails to efficiently find short paths between their nest and food sources through decentralized cooperation. The document then explains how ACO works by simulating artificial ants that probabilistically construct solutions and update pheromone values to guide future construction. Several standard ACO algorithms are outlined, including Ant System, Ant Colony System, Max-Min Ant System, and Rank-Based Ant System. Applications of ACO discussed include the traveling salesman problem.
LADDER AND SUBDIVISION OF LADDER GRAPHS WITH PENDANT EDGES ARE ODD GRACEFULFransiskeran
The ladder graph plays an important role in many applications as Electronics, Electrical and Wireless
communication areas. The aim of this work is to present a new class of odd graceful labeling for the ladder
graph. In particular, we show that the ladder graph Ln with m-pendant Ln mk1 is odd graceful. We also
show that the subdivision of ladder graph Ln with m-pendant S(Ln) mk1 is odd graceful. Finally, we
prove that all the subdivision of triangular snakes ( k snake ) with pendant edges
1
( ) k S snake mk are odd graceful.
FURTHER RESULTS ON ODD HARMONIOUS GRAPHSFransiskeran
In [1] Abdel-Aal has introduced the notions of m-shadow graphs and n-splitting graphs, for all m, n ≥ 1.
In this paper, we prove that, the m-shadow graphs for paths and complete bipartite graphs are odd
harmonious graphs for all m ≥ 1. Also, we prove the n-splitting graphs for paths, stars and symmetric
product between paths and null graphs are odd harmonious graphs for all n≥ 1. In addition, we present
some examples to illustrate the proposed theories. Moreover, we show that some families of graphs admit
odd harmonious libeling.
The Neighborhood Broadcast Problem in Wireless Ad Hoc Sensor NetworksFransiskeran
This document discusses the neighborhood broadcast problem in wireless ad hoc sensor networks. It presents the k-Hop Bouncing Flood (k-HBF) network protocol to distribute a message to all neighbors of a network node without that node's participation. The k-HBF protocol is proven to guarantee delivery if k is greater than or equal to 2d-1, where d is the local connectivity distance of the node. It involves resetting the transmission counter at neighbors of the target node to bounce the message within its neighborhood. Simulations show the protocol has very high success rates for low values of k.
In this work we have devoted to some proposed analytical methods to simulate these attacks, and node
mobility in MANET. The model used to simulate the malicious nodes mobility attacks is based on graphical
theory, which is a tool for analyzing the behavior of nodes. The model used to simulate the Blackhole
cooperative, Blackmail, Bandwidth Saturation and Overflow attacks is based on malicious nodes and the
number of hops. We conducted a simulation of the attacks with a C implementation of the proposed
mathematical models.
Thinking of getting a dog? Be aware that breeds like Pit Bulls, Rottweilers, and German Shepherds can be loyal and dangerous. Proper training and socialization are crucial to preventing aggressive behaviors. Ensure safety by understanding their needs and always supervising interactions. Stay safe, and enjoy your furry friends!
This slide is special for master students (MIBS & MIFB) in UUM. Also useful for readers who are interested in the topic of contemporary Islamic banking.
it describes the bony anatomy including the femoral head , acetabulum, labrum . also discusses the capsule , ligaments . muscle that act on the hip joint and the range of motion are outlined. factors affecting hip joint stability and weight transmission through the joint are summarized.
A review of the growth of the Israel Genealogy Research Association Database Collection for the last 12 months. Our collection is now passed the 3 million mark and still growing. See which archives have contributed the most. See the different types of records we have, and which years have had records added. You can also see what we have for the future.
Assessment and Planning in Educational technology.pptxKavitha Krishnan
In an education system, it is understood that assessment is only for the students, but on the other hand, the Assessment of teachers is also an important aspect of the education system that ensures teachers are providing high-quality instruction to students. The assessment process can be used to provide feedback and support for professional development, to inform decisions about teacher retention or promotion, or to evaluate teacher effectiveness for accountability purposes.
How to Build a Module in Odoo 17 Using the Scaffold MethodCeline George
Odoo provides an option for creating a module by using a single line command. By using this command the user can make a whole structure of a module. It is very easy for a beginner to make a module. There is no need to make each file manually. This slide will show how to create a module using the scaffold method.
Strategies for Effective Upskilling is a presentation by Chinwendu Peace in a Your Skill Boost Masterclass organisation by the Excellence Foundation for South Sudan on 08th and 09th June 2024 from 1 PM to 3 PM on each day.
Physiology and chemistry of skin and pigmentation, hairs, scalp, lips and nail, Cleansing cream, Lotions, Face powders, Face packs, Lipsticks, Bath products, soaps and baby product,
Preparation and standardization of the following : Tonic, Bleaches, Dentifrices and Mouth washes & Tooth Pastes, Cosmetics for Nails.
Exploiting Artificial Intelligence for Empowering Researchers and Faculty, In...Dr. Vinod Kumar Kanvaria
Exploiting Artificial Intelligence for Empowering Researchers and Faculty,
International FDP on Fundamentals of Research in Social Sciences
at Integral University, Lucknow, 06.06.2024
By Dr. Vinod Kumar Kanvaria
A workshop hosted by the South African Journal of Science aimed at postgraduate students and early career researchers with little or no experience in writing and publishing journal articles.
SELECTIVE WATCHDOG TECHNIQUE FOR INTRUSION DETECTION IN MOBILE AD-HOC NETWORK
1. International Journal on Applications of Graph Theory in Wireless Ad hoc Networks and Sensor Networks
(GRAPH-HOC) Vol.6, No.3, September 2014
DOI:10.5121/jgraphoc.2014.6302 7
SELECTIVE WATCHDOG TECHNIQUE FOR
INTRUSION DETECTION IN MOBILE AD-HOC
NETWORK
DEEPIKA DUA AND ATUL MISHRA
Department of Computer Engineering, YMCA University of Science & Technology,
Haryana, India
ABSTRACT
Mobile ad-hoc networks(MANET) is the collection of mobile nodes which are self organizing and are
connected by wireless links where nodes which are not in the direct range communicate with each other
relying on the intermediate nodes. As a result of trusting other nodes in the route, a malicious node can
easily compromise the security of the network. A black-hole node is the malicious node which drops the
entire packet coming to it and always shows the fresh route to the destination, even if the route to
destination doesn't exist. This paper describes a scheme that will detect the intrusion in the network in the
presence of black-hole node and its performance is compared with the previous technique. This novel
technique helps to increase the network performance by reducing the overhead in the network.
KEYWORDS
MANET, Intrusion, Intrusion Detection system, Attacks
1. INTRODUCTION
Mobile ad-hoc network is formed by the collection of some mobile nodes which can act both as a
sender as well as receiver for data communication. They are decentralized networks which are
self organizing and self maintaining. There is no fixed infrastructure in the network, the topology
changes dynamically [1]. As a result of continuously changing topology, there is no fixed
boundary of the network. The nodes cooperate with each other to forward the data packet. In such
a network where there is no well-defined boundary, open medium, nodes rely on one other to
forward the data packet, firewalls cannot be applied for securing these networks. Intrusion
detection system [2] is used in these networks to detect the misbehaviour in the network.
Intrusion detection system acts as a second layer in mobile ad-hoc networks [3]. Intrusion
detection system can be network based [4] or host based [5] on the basis of the audit data
collection or it can be signature based, anomaly based or specification based on the basis of the
detection technique [6].
In this paper, a scheme is proposed which detects the misbehaving nodes in the network in the
presence of black-hole attack [7] [8] and reduces the network overhead.
Rest of the paper is organized as follows. In section 2, literature survey is presented. In section 3,
scheme description is present, the methodology used is described. In section 4, simulation
environment and results of the simulation are presented. And finally conclusion is presented in
2. International Journal on Applications of Graph Theory in Wireless Ad hoc Networks and Sensor Networks
(GRAPH-HOC) Vol.6, No.3, September 2014
8
section5.
2. RELATED WORK
Marti el al [9] proposed a scheme named Watchdog which is a reputation based scheme [10], in
which after detecting the malicious node, information is propagated throughout the network so to
avoid that node in future routes.
The watchdog scheme works in two parts-in the first part the watchdog detects the malicious node
by promiscuously listening to its next neighbour’s transmission. If a node doesn't forward the
packet after a threshold, then watchdog declares that node as malicious. And then the path rater
finds the new route to the destination excluding that malicious node. In this scheme malicious
node is detected instead of malicious link there are six weaknesses that are mentioned by Marti
[9]. They are 1)Receiver Collision problem 2)Ambiguous collision 3)Limited Transmission
power 4) False misbehaviour 5) collusion 6) Partial Dropping.
Liu at al [10] proposed a scheme named TWOACK, which detects the misbehaving links in the
ad-hoc network instead of misbehaving nodes. It is an acknowledgement based scheme in which
every third node in the route from sender to receiver requires to send an acknowledgement packet
to the first node down the reverse route.
Figure 1.TWOACK
In figure 1, node Q sends a packet to node R which further forwards it to node S. When node S
receives the packet and as it is third node in the path, it will send a TWOACK packet to the node
Q acknowledging that it receives the packet successfully. All the nodes in the path work in the
similar way.
It solves the receiver collision problem and limited power problem of the watchdog scheme. But
due to the exchange of too many acknowledgement packets, this scheme consumes too much
battery power and hence can degrade the network performance. It works on DSR (Dynamic
source routing) protocol.
Sheltami et al. [11] proposed a scheme named Adaptive acknowledgment (AACK) which is
based on TWOACK scheme. This scheme also works on DSR routing protocol. It is an
advancement of the TWOACK scheme. It reduces the battery consumption by making the scheme
a combination of end-to-end acknowledgement and TACK, which is similar to TWOACK. When
the sender sends a data packet to destination, it waits for some time for the destination to
acknowledge that data packet, but if the acknowledgement doesn't come within per-defined time,
then it switches to TACK mode, where every third node sends the TACK packet to the nodes two
hops away from it down the route.
3. International Journal on Applications of Graph Theory in Wireless Ad hoc Networks and Sensor Networks
(GRAPH-HOC) Vol.6, No.3, September 2014
9
Figure 2: ACK scheme
Figure 2 shows the ack scheme in which source P waits for the destination T to acknowledge the
data packet. If acknowledgment from T doesn’t receive within specified time, then it switches to
TACK mode by sending TACK packet.
Nidal Nasser and Yunfeng Chen [12] proposed an approach called Ex-Watchdog. It was basically
an improvement over the Watchdog scheme proposed by Marti [9].Out of the six weaknesses
mentioned in the Watchdog [9] scheme it solves the false misbehaviour problem. In this scheme,
each node maintains a table having entries of source address, destination address, and the
statistics of the packets received, forwarded and stored. If any node reports a node as being
misbehaving, then instead of trusting that node immediately, a new route to destination is found
excluding the reported malicious node and number of packets received is checked at the
destination node. If it is equal to the number of packets sent, then it is a false misbehaviour report
and whosoever generated is declared as malicious .Then, pathrater or routeguard cooperated with
the routing protocol and update the rating of node in their corresponding tables. This scheme fails
to detect the misbehaviour when the misbehaving node is in all the routes from source to
destination.
Elhadi M. Shashuki, Nan Kang and Tarek R. Sheltami [13] proposed an approach called EAACK
(Enhanced AACK) which solves receiver collisions problem, limited battery problem and false
misbehaviour problem of the watchdog scheme. It is also an acknowledgement based scheme and
to protect the acknowledgement packet from forging, this scheme makes use of digital signature.
It is composed of three parts:-
ACK- It is an end-to-end acknowledgement as described in AACK scheme. Sender waits for the
destination to acknowledge data packets but if the acknowledgement doesn't come within a
specified time, then it switches to S-ACK mode.
S-ACK- In this mode, similar to TWOACK scheme, consecutive node works in a group i.e. every
third node sends an S-ACK packet to its first node which is in the reverse directions. The
difference between the S-ACK and TWOACK is that TWOACK immediately trusts the
misbehaviour report and declares the node as malicious. But in this scheme, we switch to MRA
mode to confirm the misbehaviour report.
MRA- It stands for misbehaviour report authentication. This mode cooperates with the routing
protocol to find a new route to the destination which excludes the reported misbehaviour node.
Destination is checked for the data packet using the new route. If the data packet is found at the
destination, then it is a false misbehaviour report and the node which generated this report will be
declared as malicious, else the misbehaviour report is trusted and the node would be declared as
misbehaving.
4. International Journal on Applications of Graph Theory in Wireless Ad hoc Networks and Sensor Networks
(GRAPH-HOC) Vol.6, No.3, September 2014
10
3. PROPOSED APPROACH
We proposed an algorithm that detects the intrusion in the presence of black hole node in the
network. The proposed technique is an improvement over the Watchdog technique[9].In
Watchdog each node continuously hears its next node transmission but in the proposed selective
Watchdog technique only when the acknowledgment would not be received ,then IDS would
start.Morever,in watchdog[9] technique all nodes monitor their neighbours but in proposed
selective watchdog technique ,network of nodes are divided into clusters and only nodes in the
cluster which have value greater than threshold monitor their neighbours. The pseudo code for the
black-hole attack is shown in the algorithm. The input parameters for the algorithm are set of all
the nodes, a threshold value which gets updated dynamically, source node, destination node and
all the nodes which send the route reply to the source node.
The algorithm works as follows:-
The source waits for the destination to send acknowledgement to it after every 10th
packet. If
source receives the acknowledgement, then there is no misbehaviour in the network and process
continues as such. But if the destination fails to acknowledge the data packets for a time period,
then IDS starts its functionality.
As in black-hole attack, there is a greater possibility that black-hole node will send the highest
sequence number to the source in route reply. The proposed IDS algorithm maintains the list of
all the nodes which send the route reply to the source with sequence number greater than the
threshold value.
The IDS will be applied only on those nodes which are in the list maintained by ids.
Algorithm 1: Algorithm for detecting IDS
Input: Threshold_seq_no. Set_of_all_nodes; Set_of_nodes_who_sent_route_reply; source;
destination.
5. International Journal on Applications of Graph Theory in Wireless Ad hoc Networks and Sensor Networks
(GRAPH-HOC) Vol.6, No.3, September 2014
11
1. Begin
2. If(pkt_received_by_dest==pkt_sent_by_source) then
3. network does not shows any malicious behaviour
4. Else if(pkt_received_by_dest < certain percentage of pkt sent by source over the network)
5. {
6. Then the network shows malicious behaviour and IDS is applied to detect malicious behaviour
7. For(int i=0; i<no._of_nodes_who_sent_route_reply; i++)
8. {
9. If(seq_no[route_reply[Node]] > Threshold_seq_no) then
10. List. add(next[Node])
11. List. add(Node)
12. List. add(prev[Node])
13. result= Segment_watchdog(List);
14. If(result==true) then //(i.e. if malicious node is found)
15. Exit;
16. ENDIF
17. Else
18. Continue
19. EndElse
20. }
21. }
Algorithm: Segmented_Watchdog (List)
1. BEGIN
2. Result=false
3. malicious= Null
4. Node1= list. get(0)
5. Node2= list. get(1)
6. Node3=list. get(2)
7. //Chk(Sent_pkt[Node2]);
8. If(sent_pkt[Node2] == Received_pkt_by_node2) THEN
9. Monitor Node3
10. ENDIF
11. If(Sent_pkt_by_Node3==Received_pkt_by_Node3) THEN
12. No malicious activity detected in this segment
13. RETURN Result
14. END IF
15. Else if(Sent_pkt_by_Node1 < Received_pkt_by_Node1) THEN
16. Malicious= Node1
17. Result= True
18. RETURN Result
19. END ELSEIF
20. Else if(Sent_pkt_by_Node2 < Received_pkt_by_Node2) THEN
21. Malicious= Node2
22. Result=True
23. RETURN Result
24. END ELSEIF
25. Else if(Sent_pkt_by_Node1 < Received_pkt_by_Node1) THEN
26. Malicious= Node1
27. Result=True
28. RETURN Result
29. END ELSEIF
30. END
6. International Journal on Applications of Graph Theory in Wireless Ad hoc Networks and Sensor Networks
(GRAPH-HOC) Vol.6, No.3, September 2014
12
For every node in the list, segment watchdog method gets called. In this method, the number of
packets send and received by the node is checked. If number of send and received are equal, then
its successor node in the route is checked else its predecessor node in the route is evaluated in the
same way.
The Flowchart of the technique is shown in figure3
Figure 3(a). Flowchart of proposed technique
7. International Journal on Applications of Graph Theory in Wireless Ad hoc Networks and Sensor Networks
(GRAPH-HOC) Vol.6, No.3, September 2014
13
Figure 3(b). Flowchart of selective Watchdog
4. SIMULATION RESULTS
4.1. Assumptions
• We have assumed the bi-directionality in the links.
• Secondly, we have assumed that both the sender and receiver are trusted nodes, i.e. they
are non-malicious.
• Duplicate MAC address doesn't exist.
• Lastly we have assumed that the nodes can overhear the transmission of their immediate
neighbours.
4.2. Simulation Configuration
The Simulation is carried out using the tool Network Simulator 2 (NS-2) version 2.35 on Linux
operating system Ubuntu version 12.10.The system runs on a laptop with Core 2 Duo T6500
processor with 4-GB RAM. For plotting graph, trace-graph version 202 is used.
• Grid Size: 500x500
8. International Journal on Applications of Graph Theory in Wireless Ad hoc Networks and Sensor Networks
(GRAPH-HOC) Vol.6, No.3, September 2014
14
• Number of Nodes: 10 of which 5 were communicating
• Packet traffic: CBR (Constant bit rate) on UDP
• Packet Size: 512B
• Packet Interval: 0.25
• Routing Protocol: AODV
4.3. Simulation Scenarios
To simulate our result we have taken two scenarios.
Scenario 1: In this scenario, Watchdog technique is implemented with one malicious node in path
between source and destination.
Scenario 2: In this, Proposed Technique is implemented with same parameters taken in scenario
1.
4.4. Performance Evaluation
Scenario 1
In the first case, watchdog technique is implemented with a malicious node between the source
and destination. Figure 4 shows the results that it detects the misbehaviour in the network of 10
nodes in 27.39 sec of neighbour detection.
Figure 4: Screenshot of Watchdog Technique
Scenario 2
In this scenario, proposed Selective Watchdog technique is implemented and then results are
compared with the results of scenario 1.
Figure 5 show that it took 27.36 sec for our scheme to detect the intrusion in the network.
9. International Journal on Applications of Graph Theory in Wireless Ad hoc Networks and Sensor Networks
(GRAPH-HOC) Vol.6, No.3, September 2014
15
Figure 5: Screenshot of proposed technique
Figure 6 shows the graph of comparison between the proposed scheme and the watchdog scheme.
From the graph, it is clearly shown that the proposed scheme performs better than the watchdog
scheme in terms of detection time to detect the intrusion in the network.
Figure6 Detection Time Comparison of proposed scheme and watchdog scheme
• Quantitative Analysis
For a network of n nodes, Watchdog scheme have n-2 promiscuous listening. As every node have
to monitor its next neighbour except the source which is not monitored by any node and the
destination which will not monitor any node?
10. International Journal on Applications of Graph Theory in Wireless Ad hoc Networks and Sensor Networks
(GRAPH-HOC) Vol.6, No.3, September 2014
16
For our proposed Selective Watchdog scheme, each cluster is of size say l, suppose we break the
network of n nodes into K number of Clusters where K<<n i.e. n/l.
Let say a threshold value of T qualifies n/l*1/t, where t is a qualifier and its value will determine
the number of clusters to be checked.
Promiscuous listening in a cluster of size l would be (l-2) in case both source and destination are
included in the cluster and it would be l in other cases.
Total promiscuous listening in proposed study is l*(nl-2) + 2*(l-2)
This formula calculates the number of promiscuous listening and it is for only one data packet.
Varying the number of cluster size and number of nodes taken, we can get different number of
promiscuous listening.
Table 1 shows the different values taken using the above formula. For n=12,l=3,the number of
promiscuous listening in Watchdog technique is 10 and in proposed technique is 8.Similarly,for
other values shown in table , number of promiscuous listening is calculated.
Table 1. Promiscuous listening with varying number of nodes and cluster size
N=12 N=24 N=36
L=3 8 20 32
L=4 7 16 25
L=6 8 14 20
Watchdog
Technique
10 22 34
Figure 7 shows the graph for number of promiscuous listening for the proposed approach and the
watchdog technique, plotted using the data provided in the table 1. The graph is plotted by
varying the number of nodes and the size of cluster taken for each case.
Figure 7 Number of nodes Vs Promiscuous Listening for proposed scheme
11. International Journal on Applications of Graph Theory in Wireless Ad hoc Networks and Sensor Networks
(GRAPH-HOC) Vol.6, No.3, September 2014
17
• Experimental Analysis
Number of nodes and size of cluster is varied and values are calculated by simulation. Table 2
shows the result of simulation.
Table 2. Experimental value of promiscuous listening
N
12
N
24
N
36
L=3 238 580 900
L=4 234 536 779
L=6 220 448 589
Watchdog
Technique
1109 2230 3689
From these values, the graph is plotted. Figure 8 show the graph plotted using the above values.
Figure 8 Number of nodes vs. Promiscuous listening
Table 3 shows the statistics of the number of packets sent, number of packets received and
percentage of packets received and drop in all three scenarios i.e. in absence of malicious node, in
its presence without IDS and with IDS. The statistics shows that with the presence of IDS in the
network, the network performance gets improved.
12. International Journal on Applications of Graph Theory in Wireless Ad hoc Networks and Sensor Networks
(GRAPH-HOC) Vol.6, No.3, September 2014
18
Table 3: Statistics of simulation data
5. CONCLUSION
Security is the major concern in the ad-hoc networks as nodes can be easily captured or
compromised. Black-hole attack drops all the packets going through the malicious node. As a
result network performance decrease drastically. The proposed scheme detects the intrusion in the
presence of black-hole attack in the network and then routes the packets through secured path.
The results obtained in various test scenarios suggest that proposed selective technique is better
than conventional Watchdog technique in terms of time to detect the intrusion and number of
promiscuous listening amongst the neighbours. The threshold reference removes many
promiscuous listening as a big set of node lying under the value are not subjected to any detection
related messages listening and associated networking cost. The graphs further show that making
the cluster and starting the IDS only when acknowledgement not received further improves the
network throughput as there would be further less network overhead. The proposed technique
scales well with the increase in network size as shown in result graphs. A mathematical model
capturing the costs discussed in the paper has been presented with results matching the
experimental data.
REFERENCES
[1] T. Anantvalee and J. Wu, “A Survey on Intrusion Detection in Mobile Ad Hoc Networks,” in
Wireless/Mobile Security. New York: Springer-Verlag, 2008
[2] Giovanni Vigna and Richard A. Kemmerer, “NetSTAT: A network-based intrusion detection system
,”, Journal of computer security,1999,pp.37-71.
[3] B. Sun, “Intrusion detection in mobile ad hoc networks,” Ph.D. dissertation, Texas A&M Univ.,
College Station, TX, 2004.
[4] David Wagner and Paolo Soto ,”Mimicry Attacks on Host-Based Intrusion Detection Systems”,in
ACM, Nov.2002
[5] Giovanni Vigna and Richard A. Kemmerer, “NetSTAT: A network-based intrusion detection
system,”, Journal of computer security,1999,pp.37-71.
13. International Journal on Applications of Graph Theory in Wireless Ad hoc Networks and Sensor Networks
(GRAPH-HOC) Vol.6, No.3, September 2014
19
[6] D. Sterne1, P. Balasubramanyam2, D. Carman1, B. Wilson1,R. Talpade3, C. Ko1,R. Balupari1, C-Y.
Tseng2, T. Bowen3, K. Levitt2 and J. Rowe2 "A General Cooperative Intrusion Detection
Architecture for MANETs.
[7] Arun Kumar. R, Abhishek M. K et.al. ,”A Review on Intrusion Detection Systems in MANET,”,in
International Journal of Engineering Science and Innovative Technology,vol.2,pp 609-618,March
2013
[8] Deepika Dua and Atul Mishra , “Intrusion Detection in Mobile Ad-hoc Network, “ in International
Journal of Advanced Research in Computer and Communication Engg. ,vol.2,no.2,pp.5691-5694.
[9] S. Marti, T.J.Giuli, K.Lai, and M.Baker,”Mitigating routing misbehavior in mobile ad hoc
networks,”in Proc. 6Th Annu.Int. Conf. Mobile Comput. Netw., Boston, MA, 2000, pp.255-265.
[10] K.Liu, J.Deng, P.K.Varshney, and K.Balakrishnan , “An acknowledgment-based approach for the
detection of routing misbehaviour in MANETs,”IEEE Trans Mobile Comput.,vol.6,no.5,pp.536-550
,May 2007
[11] T.Sheltami et al. “AACK:Adaptive Acknowledgment Intrusion Detection for Manet with Node
detection Enhancement, “in Proc. 24th IEEE International Conference on Advanced Information
Networking and Applications,2010,pp 634-640
[12] N.Nasser and Y.Chen,”Enhanced Intrsuion detection system for discovering mailicious nodes in
mobile ad hoc network,”in Proc.IEEE Int. Conf. Commun.,Glasgow,Scotland,Jun. 24-28 ,2007 ,
pp.1154-1159
[13] Elhadi M. Shashuki, Nan Kang and Tarek R. Sheltami“EAACK-A Secure Intrusion-Detection System
for MANET's”,in Proc. IEEE Transactions On Industrial Electronics,Vol 60,No.3,March 2013,pp
1089-1098
Authors
Deepika Dua1
received her Mtech (Computer Engineering-networking) from YMCA
University of Science and Technology, Faridabad in the year 2014.Her research interests
include mobile ad-hoc networks.
Atul Mishra2 is working as an Associate Professor in the Department. of Computer
Engineering, YMCA University of Science and Technology, Haryana, India. He holds a
Masters Degree in Computer Science and Technology, from University of Roorkee (now IIT,
Roorkee) and obtained his PhD in Computer Science and Engg. from MD University,
Rohtak. He has about 16 years of work experience in the Optical Telecommunication
Industry specializing in Optical Network Planning and Network Management tools development. His
research interests include Cloud Computing, SOA, Network Management & Mobile Agents.