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.
Defending against collaborative attacks byranjith kumar
Dear Student,
DREAMWEB TECHNO SOLUTIONS is one of the Hardware Training and Software Development centre available in
Trichy. Pioneer in corporate training, DREAMWEB TECHNO SOLUTIONS provides training in all software
development and IT-related courses, such as Embedded Systems, VLSI, MATLAB, JAVA, J2EE, CIVIL,
Power Electronics, and Power Systems. It’s certified and experienced faculty members have the
competence to train students, provide consultancy to organizations, and develop strategic
solutions for clients by integrating existing and emerging technologies.
ADD: No:73/5, 3rd Floor, Sri Kamatchi Complex, Opp City Hospital, Salai Road, Trichy-18
Contact @ 7200021403/04
phone: 0431-4050403
In remote sensor arrange messages are exchanged between the different source and goal matches agreeably such way that multi-jump parcel transmission is utilized. These information bundles are exchanged from the middle of the road hub to sink hub by sending a parcel to goal hubs. Where each hub overhears transmission close neighbor hub. To dodge this we propose novel approach with proficient steering convention i.e. most brief way directing and conveyed hub steering calculation. Proposed work additionally concentrates on Automatic Repeat Request and Deterministic Network coding. We spread this work by the end to end message encoding instrument. To upgrade hub security match shrewd key era is utilized, in which combined conveying hub is allocated with combine key to making secure correspondence. End to end. We dissect both single and numerous hubs and look at basic ARQ and deterministic system coding as strategies for transmission.
JPN1422 Defending Against Collaborative Attacks by Malicious Nodes in MANETs...chennaijp
Get the latest IEEE ns2 projects in JP INFOTECH; we are having following category wise projects like Industrial Informatics, Vehicular Technology, Networking, WSN and Manet.
For More Details:
http://jpinfotech.org/final-year-ieee-projects/2014-ieee-projects/ns2-projects/
EAASR: Enhanced AASR Protocol to Reduce Traffic and Eliminate the Malicious N...paperpublications3
1) The document proposes an enhanced authenticated anonymous secure routing (EAASR) protocol for mobile ad hoc networks to improve security, reduce delay, and eliminate malicious nodes. EAASR uses dummy nodes, group elliptical signature, and onion routing techniques to provide anonymity and prevent traffic analysis attacks.
2) Simulation results show that EAASR achieves lower packet loss and end-to-end delay than existing protocols like AASR, ANODR, and AODV. EAASR misleads attackers by using dummy nodes for neighborhood communication while the actual communication path between source and destination remains anonymous and reliable.
3) Future work will focus on improving security by only using validated secure paths and avoiding unwanted
A Secure message exchange and anti-jamming mechanism in manetIJSRD
Secure neighbor discovery is the fundamental process in the MANET deployed in aggressive environment. It refers to the process that nodes exchange messages to discover and authenticate each other. It is defenseless to the jamming attack in which the adversary intentionally transmits signals to prevent neighboring nodes from exchanging messages. Existing anti-jamming communications depends on JR-SND. The JR-SND, a jamming-resilient secure neighbor discovery scheme for MANETs based on Random spread-code pre-distribution and Direct Sequence Spread Spectrum (DSSS). In Existing, they prevent the jamming and introduce the anti-jamming mechanism using DSSS introduce the secure message exchange mechanism and prevent the collisions during packet transmission. But in this we lack of introducing to detect the selfish and malicious nodes in the network. For this, in the Future Work we will enhance the work by detecting the selfish nodes using Watchdog and Neighbor Coverage-based Probabilistic Rebroadcast Protocol (NCPR).
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.
Enhancing msf for mobile ad hoc network security though active handshaking &a...ijctet
This document summarizes a research paper that proposes a new security framework called Multipath Security Framework (MSF) to enhance security in mobile ad hoc networks. MSF divides messages into encrypted shares that are transmitted across multiple network paths to increase confidentiality and robustness. Even if an attacker obtains some shares, it is difficult for them to reconstruct the original message. The framework includes multipath routing, node authentication through handshaking, and encryption of message shares. The goal is to improve security against eavesdropping, active and passive attacks, and jamming in mobile ad hoc networks.
Defending against collaborative attacks byranjith kumar
Dear Student,
DREAMWEB TECHNO SOLUTIONS is one of the Hardware Training and Software Development centre available in
Trichy. Pioneer in corporate training, DREAMWEB TECHNO SOLUTIONS provides training in all software
development and IT-related courses, such as Embedded Systems, VLSI, MATLAB, JAVA, J2EE, CIVIL,
Power Electronics, and Power Systems. It’s certified and experienced faculty members have the
competence to train students, provide consultancy to organizations, and develop strategic
solutions for clients by integrating existing and emerging technologies.
ADD: No:73/5, 3rd Floor, Sri Kamatchi Complex, Opp City Hospital, Salai Road, Trichy-18
Contact @ 7200021403/04
phone: 0431-4050403
In remote sensor arrange messages are exchanged between the different source and goal matches agreeably such way that multi-jump parcel transmission is utilized. These information bundles are exchanged from the middle of the road hub to sink hub by sending a parcel to goal hubs. Where each hub overhears transmission close neighbor hub. To dodge this we propose novel approach with proficient steering convention i.e. most brief way directing and conveyed hub steering calculation. Proposed work additionally concentrates on Automatic Repeat Request and Deterministic Network coding. We spread this work by the end to end message encoding instrument. To upgrade hub security match shrewd key era is utilized, in which combined conveying hub is allocated with combine key to making secure correspondence. End to end. We dissect both single and numerous hubs and look at basic ARQ and deterministic system coding as strategies for transmission.
JPN1422 Defending Against Collaborative Attacks by Malicious Nodes in MANETs...chennaijp
Get the latest IEEE ns2 projects in JP INFOTECH; we are having following category wise projects like Industrial Informatics, Vehicular Technology, Networking, WSN and Manet.
For More Details:
http://jpinfotech.org/final-year-ieee-projects/2014-ieee-projects/ns2-projects/
EAASR: Enhanced AASR Protocol to Reduce Traffic and Eliminate the Malicious N...paperpublications3
1) The document proposes an enhanced authenticated anonymous secure routing (EAASR) protocol for mobile ad hoc networks to improve security, reduce delay, and eliminate malicious nodes. EAASR uses dummy nodes, group elliptical signature, and onion routing techniques to provide anonymity and prevent traffic analysis attacks.
2) Simulation results show that EAASR achieves lower packet loss and end-to-end delay than existing protocols like AASR, ANODR, and AODV. EAASR misleads attackers by using dummy nodes for neighborhood communication while the actual communication path between source and destination remains anonymous and reliable.
3) Future work will focus on improving security by only using validated secure paths and avoiding unwanted
A Secure message exchange and anti-jamming mechanism in manetIJSRD
Secure neighbor discovery is the fundamental process in the MANET deployed in aggressive environment. It refers to the process that nodes exchange messages to discover and authenticate each other. It is defenseless to the jamming attack in which the adversary intentionally transmits signals to prevent neighboring nodes from exchanging messages. Existing anti-jamming communications depends on JR-SND. The JR-SND, a jamming-resilient secure neighbor discovery scheme for MANETs based on Random spread-code pre-distribution and Direct Sequence Spread Spectrum (DSSS). In Existing, they prevent the jamming and introduce the anti-jamming mechanism using DSSS introduce the secure message exchange mechanism and prevent the collisions during packet transmission. But in this we lack of introducing to detect the selfish and malicious nodes in the network. For this, in the Future Work we will enhance the work by detecting the selfish nodes using Watchdog and Neighbor Coverage-based Probabilistic Rebroadcast Protocol (NCPR).
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.
Enhancing msf for mobile ad hoc network security though active handshaking &a...ijctet
This document summarizes a research paper that proposes a new security framework called Multipath Security Framework (MSF) to enhance security in mobile ad hoc networks. MSF divides messages into encrypted shares that are transmitted across multiple network paths to increase confidentiality and robustness. Even if an attacker obtains some shares, it is difficult for them to reconstruct the original message. The framework includes multipath routing, node authentication through handshaking, and encryption of message shares. The goal is to improve security against eavesdropping, active and passive attacks, and jamming in mobile ad hoc networks.
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.
Modified AODV Algorithm using Data Mining Process: Classification and Clusteringidescitation
Security of Wireless Ad hoc network has a primary
concern to provide protected communication between mobile
nodes. When we routing some packet it can use both malicious
node or authenticate node for forwarding and receiving data.
Malicious node can attack like black hole, misuse of data or
hacked information. Our aim is to discuss the feasibility of
monitoring the node of different networks, to analyze it for
providing better security in AODV routing protocol. We
implement data mining techniques for search large amount
of data according characteristic rules and patterns to detect
malicious node. We have used growing neural gas (GNS)
clustering algorithm to make clusters and analysis data. Using
soft computing technique we find patterns, analysis node and
take decision based on decision tree.
Secure multipath routing scheme using keyijfcstjournal
Multipath routing in WSN has been a long wish in security scenario where nodes on next-hop may be
targeted to compromise. Many proposals of Multipath routing has been proposed in ADHOC Networks but
under constrained from keying environment most seems ignorant. In WSN where crucial data is reported by
nodes in deployment area to their securely located Sink, route security has to be guaranteed. Under
dynamic load and selective attacks, availability of multiple secure paths is a boon and increases the
attacker efforts by many folds. We propose to build a subset of neighbors as our front towards destination
node. We also identified forwarders for query by base station. The front is optimally calculated to maintain
the security credential and avail multiple paths. According to our knowledge ours is a novel secure
multipath routing protocol for WSN. We established effectiveness of our proposal with mathematical
analysis.
Hiding message from hacker using novel network techniquesPriyangaRajaram
we address the trouble of selective jamming attacks in wireless networks. In these assaults, the adversary is energetic best for a brief period of time, selectively concentrated on messages of excessive significance. We illustrate the benefits of selective jamming in phrases of network performance degradation and adversary effort with the aid of offering case research. A selective assault on TCP and one on routing. We show that selective jamming attacks can be launched with the aid of performing actual-time packet classification at the physical layer. To mitigate these attacks, we develop 3 schemes that prevent actual-time packet class via combining cryptographic primitives with physical-layer attributes. We analyze the security of our strategies and examine their computational and communication overhead.
Preventing Malicious Node and Provide Secure Routing In ManetIOSR Journals
This document proposes SIEVE, a decentralized technique to identify malicious nodes in mobile ad hoc networks (MANETs). SIEVE uses rateless coding and the LT decoding process to detect corrupted data packets. It constructs a factor graph based on "checks" that nodes generate when decoding data. These checks contain information about which nodes provided packet data and whether the data was corrupted. SIEVE runs belief propagation on the factor graph to compute the probability that each node is malicious based on the checks. Simulation results show that SIEVE can accurately identify malicious nodes and is robust against various attacks, while having low computational and communication costs suitable for MANETs.
This document discusses preventing and isolating black hole attacks in mobile ad hoc networks (MANETs) using alarm packets. It begins with background on MANETs and security attacks they face such as black hole attacks. Then, it reviews existing literature on detecting and preventing black hole attacks. Next, it describes how black hole attacks work in MANETs by having malicious nodes advertise short paths to destinations and drop packets. The proposed solution will use alarm packets to isolate and prevent black hole attacks in MANETs.
Iaetsd an efficient and accurate misbehavior detectionIaetsd Iaetsd
This document proposes a probabilistic misbehavior detection scheme called iTrust to detect misbehavior in delay tolerant networks (DTNs). iTrust introduces a periodically available Trusted Authority (TA) that estimates nodes' behaviors based on collected routing evidence. It associates detection probability with nodes' reputations for effective inspection. The key contributions are a framework for generating forwarding evidence that can detect misbehaviors and be compatible with various routing protocols, and using the TA and evidence to detect malicious nodes and reduce packet dropping.
This document proposes a Tiered Authentication scheme called TAM for multicast traffic in ad-hoc networks. TAM exploits network clustering to reduce overhead and ensure scalability. Within a cluster, one-way hash chains authenticate message sources by appending an authentication code to messages. Between clusters, messages include multiple authentication codes based on different keys from the source to authenticate it. TAM aims to securely deliver multicast traffic while addressing challenges like resource constraints and packet loss in ad-hoc networks.
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
IJERA (International journal of Engineering Research and Applications) is International online, ... peer reviewed journal. For more detail or submit your article, please visit www.ijera.com
Efficient security approaches in mobile ad hoc networks a surveyeSAT Publishing House
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology
A Review of Network Layer Attacks and Countermeasures in WSNiosrjce
This document reviews network layer attacks and countermeasures in wireless sensor networks (WSNs). It discusses six major network layer attacks: wormhole attacks, flooding attacks, selective forwarding attacks, sinkhole attacks, Sybil attacks, and replay attacks. For each attack, it examines existing countermeasure approaches proposed in previous research. It also identifies some open research challenges in providing comprehensive security solutions for WSNs given their resource constraints and deployment environments.
A Novel Approach To Detect Trustworthy Nodes Using Audit Based Scheme For WSNIJERDJOURNAL
ABSTRACT: In multi-hop ad hoc networks there exists a problem of identifying and isolating misbehaving nodes which refuses to forward packets. Audit-based Misbehavior Detection (AMD) is a comprehensive system that effectively and efficiently isolates both continuous and selective packet droppers. The AMD system integrates reputation management, trustworthy route discovery, and identification of misbehaving nodes based on behavioral audits. Compared to previous methods, AMD evaluates node behavior on a per-packet basis, without employing energy-expensive overhearing techniques or intensive acknowledgment schemes. Moreover, AMD can detect selective dropping attacks even if end-to-end traffic is encrypted and can be applied to multichannel networks or networks consisting of nodes with directional antennas. This work implements the AMD approach by considering the rushing attack. The analysis of the results confirms that AMD based method with rushing attack performs better as compared to the non rushing attack.
A Mobile Ad-Hoc Network (MANET) is a self configuring, infrastructure less network of mobile devices
connected by wireless links. Loopholes like wireless medium, lack of a fixed infrastructure, dynamic
topology, rapid deployment practices, and the hostile environments in which they may be deployed, make
MANET vulnerable to a wide range of security attacks and Wormhole attack is one of them. During this
attack a malicious node captures packets from one location in the network, and tunnels them to another
colluding malicious node at a distant point, which replays them locally. This paper presents a cluster based
Wormhole attack avoidance technique. The concept of hierarchical clustering with a novel hierarchical 32-
bit node addressing scheme is used for avoiding the attacking path during the route discovery phase of the
DSR protocol, which is considered as the under lying routing protocol. Pinpointing the location of the
wormhole nodes in the case of exposed attack is also given by using this method.
Consensus Routing And Environmental Discrete Trust Based Secure AODV in MANETsIJCNCJournal
The Mobile Adhoc Network (MANET) is a wireless network model for infrastructure-less communication, and it provides numerous applications in different areas. The MANET is vulnerable to a Black-hole attack, and it affects routing functionality by dropping all the incoming packets purposefully. The Black-hole attackers pretend that it always has the best path to the destination node to mislead the source nodes. Trust is the critical factor for detecting and isolating the Black-hole attackers from the network. However, the harsh channel conditions make it difficult to differentiate the Black-hole routing activities and accurate trust measurement. Hence, incorporating the consensus-based trust evidence collection from the neighbouring nodes improves the accuracy of trust. For improving the accuracy of trust, this work suggests Consensus Routing and Environmental DIscrete Trust (CREDIT) Based Secure AODV. The CREDIT incorporates Discrete and Consensus trust information. The Discrete parameters represent the specific characteristics of the Black-hole attacks, such as routing behaviour, hop count deviation, and sequence number deviation. The direct trust accurately differentiates the Black-hole attackers using Discrete parameters, only when the nodes perform sufficient communication between the nodes. To solve such issues, the CREDIT includes the Consensus-based trust information. However, secure routing against the Black-hole attack is challenging due to incomplete preferences. The in-degree centrality and Importance degree measurement on the collected consensus-based trust from decisionmakers solve the incomplete preference issue as well as improves the accuracy of trust. The performance of the proposed scheme is evaluated using Network Simulator-2 (NS2). From the simulation results, it is proved that the detection accuracy and throughput of the proposed CREDIT are substantially high and the proposed CREDIT scheme outperforms the existing work.
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.
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.
Survey of wormhole attack in wireless sensor networksCSITiaesprime
From the last decade, a wireless sensor network (WSN) has a very important role over the networks. The primary features of WSN include satellite communication, broadcast channel, hostile environment, medical system and data gathering. There are a lot of attacks available in WSN. In wormhole attack scenario is brutal from other attacks, which is smoothly resolved in networks but tough to observe. This survey paper is an experiment to observing threats and also focuses on some different method to identify the wormhole attacks.
This document provides an overview of network layer attacks on cognitive radio networks and discusses potential solutions. It begins by introducing network security and the importance of securing the network layer. The paper then describes several common network layer attacks, including sinkhole attacks and Sybil attacks. For each attack, the document outlines the attack methodology and discusses existing detection techniques and potential countermeasures. Overall, the paper aims to survey current research on network layer threats, detection methods, and solutions to improve the security of cognitive radio networks.
PACKET DROP ATTACK DETECTION TECHNIQUES IN WIRELESS AD HOC NETWORKS: A REVIEWIJNSA Journal
Wireless ad hoc networks have gained lots of attention due to their ease and low cost of deployment. This has made ad hoc networks of great importance in numerous military and civilian applications. But, the lack of centralized management of these networks makes them vulnerable to a number of security attacks. One of the attacks is packet drop attack, where a compromised node drops packets maliciously. Several techniques have been proposed to detect the packet drop attack in wireless ad hoc networks. Therefore, in this paper we review some of the packet drop attack detection techniques and comparatively analyze them basing on; their ability to detect the attack under different attack strategies (partial and or cooperate attacks), environments and the computational and communication overheads caused in the process of detection.
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.
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.
Modified AODV Algorithm using Data Mining Process: Classification and Clusteringidescitation
Security of Wireless Ad hoc network has a primary
concern to provide protected communication between mobile
nodes. When we routing some packet it can use both malicious
node or authenticate node for forwarding and receiving data.
Malicious node can attack like black hole, misuse of data or
hacked information. Our aim is to discuss the feasibility of
monitoring the node of different networks, to analyze it for
providing better security in AODV routing protocol. We
implement data mining techniques for search large amount
of data according characteristic rules and patterns to detect
malicious node. We have used growing neural gas (GNS)
clustering algorithm to make clusters and analysis data. Using
soft computing technique we find patterns, analysis node and
take decision based on decision tree.
Secure multipath routing scheme using keyijfcstjournal
Multipath routing in WSN has been a long wish in security scenario where nodes on next-hop may be
targeted to compromise. Many proposals of Multipath routing has been proposed in ADHOC Networks but
under constrained from keying environment most seems ignorant. In WSN where crucial data is reported by
nodes in deployment area to their securely located Sink, route security has to be guaranteed. Under
dynamic load and selective attacks, availability of multiple secure paths is a boon and increases the
attacker efforts by many folds. We propose to build a subset of neighbors as our front towards destination
node. We also identified forwarders for query by base station. The front is optimally calculated to maintain
the security credential and avail multiple paths. According to our knowledge ours is a novel secure
multipath routing protocol for WSN. We established effectiveness of our proposal with mathematical
analysis.
Hiding message from hacker using novel network techniquesPriyangaRajaram
we address the trouble of selective jamming attacks in wireless networks. In these assaults, the adversary is energetic best for a brief period of time, selectively concentrated on messages of excessive significance. We illustrate the benefits of selective jamming in phrases of network performance degradation and adversary effort with the aid of offering case research. A selective assault on TCP and one on routing. We show that selective jamming attacks can be launched with the aid of performing actual-time packet classification at the physical layer. To mitigate these attacks, we develop 3 schemes that prevent actual-time packet class via combining cryptographic primitives with physical-layer attributes. We analyze the security of our strategies and examine their computational and communication overhead.
Preventing Malicious Node and Provide Secure Routing In ManetIOSR Journals
This document proposes SIEVE, a decentralized technique to identify malicious nodes in mobile ad hoc networks (MANETs). SIEVE uses rateless coding and the LT decoding process to detect corrupted data packets. It constructs a factor graph based on "checks" that nodes generate when decoding data. These checks contain information about which nodes provided packet data and whether the data was corrupted. SIEVE runs belief propagation on the factor graph to compute the probability that each node is malicious based on the checks. Simulation results show that SIEVE can accurately identify malicious nodes and is robust against various attacks, while having low computational and communication costs suitable for MANETs.
This document discusses preventing and isolating black hole attacks in mobile ad hoc networks (MANETs) using alarm packets. It begins with background on MANETs and security attacks they face such as black hole attacks. Then, it reviews existing literature on detecting and preventing black hole attacks. Next, it describes how black hole attacks work in MANETs by having malicious nodes advertise short paths to destinations and drop packets. The proposed solution will use alarm packets to isolate and prevent black hole attacks in MANETs.
Iaetsd an efficient and accurate misbehavior detectionIaetsd Iaetsd
This document proposes a probabilistic misbehavior detection scheme called iTrust to detect misbehavior in delay tolerant networks (DTNs). iTrust introduces a periodically available Trusted Authority (TA) that estimates nodes' behaviors based on collected routing evidence. It associates detection probability with nodes' reputations for effective inspection. The key contributions are a framework for generating forwarding evidence that can detect misbehaviors and be compatible with various routing protocols, and using the TA and evidence to detect malicious nodes and reduce packet dropping.
This document proposes a Tiered Authentication scheme called TAM for multicast traffic in ad-hoc networks. TAM exploits network clustering to reduce overhead and ensure scalability. Within a cluster, one-way hash chains authenticate message sources by appending an authentication code to messages. Between clusters, messages include multiple authentication codes based on different keys from the source to authenticate it. TAM aims to securely deliver multicast traffic while addressing challenges like resource constraints and packet loss in ad-hoc networks.
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
IJERA (International journal of Engineering Research and Applications) is International online, ... peer reviewed journal. For more detail or submit your article, please visit www.ijera.com
Efficient security approaches in mobile ad hoc networks a surveyeSAT Publishing House
IJRET : International Journal of Research in Engineering and Technology is an international peer reviewed, online journal published by eSAT Publishing House for the enhancement of research in various disciplines of Engineering and Technology. The aim and scope of the journal is to provide an academic medium and an important reference for the advancement and dissemination of research results that support high-level learning, teaching and research in the fields of Engineering and Technology. We bring together Scientists, Academician, Field Engineers, Scholars and Students of related fields of Engineering and Technology
A Review of Network Layer Attacks and Countermeasures in WSNiosrjce
This document reviews network layer attacks and countermeasures in wireless sensor networks (WSNs). It discusses six major network layer attacks: wormhole attacks, flooding attacks, selective forwarding attacks, sinkhole attacks, Sybil attacks, and replay attacks. For each attack, it examines existing countermeasure approaches proposed in previous research. It also identifies some open research challenges in providing comprehensive security solutions for WSNs given their resource constraints and deployment environments.
A Novel Approach To Detect Trustworthy Nodes Using Audit Based Scheme For WSNIJERDJOURNAL
ABSTRACT: In multi-hop ad hoc networks there exists a problem of identifying and isolating misbehaving nodes which refuses to forward packets. Audit-based Misbehavior Detection (AMD) is a comprehensive system that effectively and efficiently isolates both continuous and selective packet droppers. The AMD system integrates reputation management, trustworthy route discovery, and identification of misbehaving nodes based on behavioral audits. Compared to previous methods, AMD evaluates node behavior on a per-packet basis, without employing energy-expensive overhearing techniques or intensive acknowledgment schemes. Moreover, AMD can detect selective dropping attacks even if end-to-end traffic is encrypted and can be applied to multichannel networks or networks consisting of nodes with directional antennas. This work implements the AMD approach by considering the rushing attack. The analysis of the results confirms that AMD based method with rushing attack performs better as compared to the non rushing attack.
A Mobile Ad-Hoc Network (MANET) is a self configuring, infrastructure less network of mobile devices
connected by wireless links. Loopholes like wireless medium, lack of a fixed infrastructure, dynamic
topology, rapid deployment practices, and the hostile environments in which they may be deployed, make
MANET vulnerable to a wide range of security attacks and Wormhole attack is one of them. During this
attack a malicious node captures packets from one location in the network, and tunnels them to another
colluding malicious node at a distant point, which replays them locally. This paper presents a cluster based
Wormhole attack avoidance technique. The concept of hierarchical clustering with a novel hierarchical 32-
bit node addressing scheme is used for avoiding the attacking path during the route discovery phase of the
DSR protocol, which is considered as the under lying routing protocol. Pinpointing the location of the
wormhole nodes in the case of exposed attack is also given by using this method.
Consensus Routing And Environmental Discrete Trust Based Secure AODV in MANETsIJCNCJournal
The Mobile Adhoc Network (MANET) is a wireless network model for infrastructure-less communication, and it provides numerous applications in different areas. The MANET is vulnerable to a Black-hole attack, and it affects routing functionality by dropping all the incoming packets purposefully. The Black-hole attackers pretend that it always has the best path to the destination node to mislead the source nodes. Trust is the critical factor for detecting and isolating the Black-hole attackers from the network. However, the harsh channel conditions make it difficult to differentiate the Black-hole routing activities and accurate trust measurement. Hence, incorporating the consensus-based trust evidence collection from the neighbouring nodes improves the accuracy of trust. For improving the accuracy of trust, this work suggests Consensus Routing and Environmental DIscrete Trust (CREDIT) Based Secure AODV. The CREDIT incorporates Discrete and Consensus trust information. The Discrete parameters represent the specific characteristics of the Black-hole attacks, such as routing behaviour, hop count deviation, and sequence number deviation. The direct trust accurately differentiates the Black-hole attackers using Discrete parameters, only when the nodes perform sufficient communication between the nodes. To solve such issues, the CREDIT includes the Consensus-based trust information. However, secure routing against the Black-hole attack is challenging due to incomplete preferences. The in-degree centrality and Importance degree measurement on the collected consensus-based trust from decisionmakers solve the incomplete preference issue as well as improves the accuracy of trust. The performance of the proposed scheme is evaluated using Network Simulator-2 (NS2). From the simulation results, it is proved that the detection accuracy and throughput of the proposed CREDIT are substantially high and the proposed CREDIT scheme outperforms the existing work.
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.
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.
Survey of wormhole attack in wireless sensor networksCSITiaesprime
From the last decade, a wireless sensor network (WSN) has a very important role over the networks. The primary features of WSN include satellite communication, broadcast channel, hostile environment, medical system and data gathering. There are a lot of attacks available in WSN. In wormhole attack scenario is brutal from other attacks, which is smoothly resolved in networks but tough to observe. This survey paper is an experiment to observing threats and also focuses on some different method to identify the wormhole attacks.
This document provides an overview of network layer attacks on cognitive radio networks and discusses potential solutions. It begins by introducing network security and the importance of securing the network layer. The paper then describes several common network layer attacks, including sinkhole attacks and Sybil attacks. For each attack, the document outlines the attack methodology and discusses existing detection techniques and potential countermeasures. Overall, the paper aims to survey current research on network layer threats, detection methods, and solutions to improve the security of cognitive radio networks.
PACKET DROP ATTACK DETECTION TECHNIQUES IN WIRELESS AD HOC NETWORKS: A REVIEWIJNSA Journal
Wireless ad hoc networks have gained lots of attention due to their ease and low cost of deployment. This has made ad hoc networks of great importance in numerous military and civilian applications. But, the lack of centralized management of these networks makes them vulnerable to a number of security attacks. One of the attacks is packet drop attack, where a compromised node drops packets maliciously. Several techniques have been proposed to detect the packet drop attack in wireless ad hoc networks. Therefore, in this paper we review some of the packet drop attack detection techniques and comparatively analyze them basing on; their ability to detect the attack under different attack strategies (partial and or cooperate attacks), environments and the computational and communication overheads caused in the process of detection.
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.
This document surveys different types of black hole attacks in wireless mobile ad hoc networks and various detection schemes that have been proposed. It discusses single black hole attacks, where a single malicious node drops packets to disrupt routing, and collaborative black hole attacks, where multiple nodes work together. The document analyzes and compares detection schemes for single black hole attacks in terms of the routing protocol used, detection method, results reported, and limitations. It finds that while many schemes can effectively detect a single attacker, they often fail against collaborative black hole attacks.
This document summarizes a research paper on reducing packet loss in mobile ad hoc networks (MANETs). The paper discusses how MANETs are vulnerable to various security threats like black hole attacks that can cause packet dropping. It evaluates existing authentication schemes like ACK-based schemes that have overhead issues. The paper then proposes a modified ACK-based scheme using finite state automata to overcome decision ambiguity and minimize packet dropping while authenticating nodes in the MANET. Simulation results show that the proposed approach improves packet delivery ratio, throughput and reduces routing load compared to not using secure authentication.
Secure routing and data transmission in mobileIJCNCJournal
In this paper, we present an identity (ID) based protocol that secures AODV and TCP so that it can be used
in dynamic and attack prone environments of mobile ad hoc networks. The proposed protocol protects
AODV using Sequential Aggregate Signatures (SAS) based on RSA. It also generates a session key for each
pair of source-destination nodes of a MANET for securing the end-to-end transmitted data. Here each node
has an ID which is evaluated from its public key and the messages that are sent are authenticated with a
signature/ MAC. The proposed scheme does not allow a node to change its ID throughout the network
lifetime. Thus it makes the network secure against attacks that target AODV and TCP in MANET. We
present performance analysis to validate our claim.
Secure dynamic source routing protocol for defending black hole attacks in mo...nooriasukmaningtyas
Wireless Ad Hoc Network is a dynamically organized network on emergency
situations, in which a group of wireless devices send data among themselves
without requiring any base stations for forwarding data. Here the nodes itself
perform the functions of routing. This important characteristic of mobile ad
hoc networks allows the hassle free set up of the network for
communications in different crisis such as battlefield and natural disaster
zones. Multi hop communication in MANET is achieved by the cooperation
of nodes in forwarding data packets. This feature of MANET is largely
exploited to launch a security attack called black hole attack. A light weight
solution called SEC-DSR is proposed to defend the network from black hole
attack and enables communication among nodes even in the presence of
attackers. In this scheme, by analyzing only the control packets used for
routing in the network, the compromised nodes launching the attack are
identified. From the collective judgment by the participating nodes in the
routing path, a secure route free of black hole nodes is selected for
communication by the host. Simulation results validate and ensure the
effectiveness of the proposed solution tested on an ad hoc network with
compromised black hole nodes.
WDA: Wormhole Attack Detection Algorithm based on measuring Round Trip Delay ...ijsrd.com
The recent advancements in the wireless arena and their wide-spread utilization have introduced new security vulnerabilities. The wireless media being shared is exposed to outside world, so it is susceptible to various attacks at different layers of OSI network stack. For example, jamming and device tampering at the physical layer; disruption of the medium access control (MAC) layer; routing attacks like Blackhole, rushing, wormhole; targeted attacks on the transport protocol like session hijacking, SYN flooding or even attacks intended to disrupt specific applications through viruses, worms and Trojan Horses. Wormhole attack is one of the serious routing attacks amongst all the network layer attacks launched on MANET. Wormhole attack is launched by creation of tunnels and it leads to total disruption of the routing paths on MANET. In this paper, Wormhole detection algorithm (WDA) is proposed based on modifying the forwarding packet process that detects and isolates wormhole nodes in ad hoc on demand distance vector (AODV) routing protocol.
A SYMMETRIC TOKEN ROUTING FOR SECURED COMMUNICATION OF MANET cscpconf
The communication should be much secured in Mobile Adhoc Networks in the
protective environment such as Military atmosphere and in a disaster relief. Due to the attackers,
Mobile Adhoc Networks resulting in denial of Service attacks modify packets, Error packets,
Missing Packets, Theft of Nodes, etc. To overcome this problem, We propose a new Symmetric
Token Routing Protocol (STRP) for mobile ad hoc networks provides much security against
MANET. The proposed protocol distributed a secured shared symmetric token for each node to
provide security against hackers and attackers. Simulation results shows the better delivery against
the existing protocol in MANET.
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 discusses secure routing in mobile ad hoc networks (MANETs). It begins with an introduction to MANETs and wireless sensor networks, and some of the key issues in designing them including routing and security. The document then discusses several routing protocols for MANETs, including DSDV and WRP. It also analyzes security threats to routing like black hole attacks, wormhole attacks, and selfish node behavior. The document proposes analyzing routing protocols like OLSR to understand their security vulnerabilities. Finally, it discusses future research directions like generalizing the security threat analysis methodology to other routing protocols and types.
TRUST VALUE ALGORITHM: A SECURE APPROACH AGAINST PACKET DROP ATTACK IN WIRELE...IJNSA Journal
Wireless ad-hoc networks are widely used because these are very easy to deploy. However, there are
various security issues and problems. Two most important issues are interoperability and interaction
among various security technologies which are very important to consider for configuration and
management point of view. The packet drop ratio in the wireless network is very high as well as packets
may be easily delayed by the attacker. Ii is very difficult to detect intruders, so it results into high false
positive rate. Packets may be dropped or delayed by intruders as well as external nodes in wireless
networks. Hence, there is the need of effective intrusion detection system which can detect maximum
number of intruders and the corresponding packets be forwarded through some alternate paths in the
network. In this paper we propose an alternate solution to detect the intruders/adversary with help of trust
value. It would remove the need of inbuilt IDS in the wireless networks and result into improving the
performance of WLAN.
TRUST VALUE ALGORITHM: A SECURE APPROACH AGAINST PACKET DROP ATTACK IN WIRELE...IJNSA Journal
Wireless ad-hoc networks are widely used because these are very easy to deploy. However, there are various security issues and problems. Two most important issues are interoperability and interaction among various security technologies which are very important to consider for configuration and management point of view. The packet drop ratio in the wireless network is very high as well as packets may be easily delayed by the attacker. Ii is very difficult to detect intruders, so it results into high false positive rate. Packets may be dropped or delayed by intruders as well as external nodes in wireless networks. Hence, there is the need of effective intrusion detection system which can detect maximum number of intruders and the corresponding packets be forwarded through some alternate paths in the network. In this paper we propose an alternate solution to detect the intruders/adversary with help of trust value. It would remove the need of inbuilt IDS in the wireless networks and result into improving the performance of WLAN
International Journal of Engineering Research and Applications (IJERA) is an open access online peer reviewed international journal that publishes research and review articles in the fields of Computer Science, Neural Networks, Electrical Engineering, Software Engineering, Information Technology, Mechanical Engineering, Chemical Engineering, Plastic Engineering, Food Technology, Textile Engineering, Nano Technology & science, Power Electronics, Electronics & Communication Engineering, Computational mathematics, Image processing, Civil Engineering, Structural Engineering, Environmental Engineering, VLSI Testing & Low Power VLSI Design etc.
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
Performance Analysis of Malicious Node in the Different Routing Algorithms in...ijsrd.com
This document analyzes the performance of malicious nodes in different routing algorithms in mobile ad hoc networks (MANETs). It simulates the "black hole" attack in the AODV and DSR routing protocols using the NS2 simulator. The results show that DSR experiences around 45-55% data loss with black hole attacks, while AODV sees 35-40% data loss. Therefore, AODV shows better performance than DSR in the presence of malicious nodes like black holes, with only minimal additional delay and overhead.
Secure Multicast Communication using Behavioural Measurement Technique in MANET Editor Jacotech
In MANET communication between two mobile nodes are carried out by routing protocol. In MANET each mobile node can directly communicate with other mobile node if both mobile nodes are within transmission range. Otherwise the nodes present in between have to forward the packets for them on network. dynamic and cooperative nature of ad hoc networks presents substantial challenges in securing and detecting attacks in these networks. In this paper we proposed a novel Intrusion Detection and Prevention Scheme (IDPS) for protecting network against Blackhole attack. During the attack, a malicious node captures the data after the positive reply of route existence. Routing in Ad hoc networks has been a challenging task ever since the wireless networks came into existence. In multicasting the sender and communicated with multiple receivers. The routing misbehavior in multicast ODMRP is secured by proposed scheme. The proposed IDPS scheme first to detect the malicious nodes and after that block the activities of malicious nodes. The performance of proposed scheme is evaluated through performance metrics that shows the attacker routing misbehavior and proposed security scheme is provides secure and
vigorous performance in presence blackhole attacker.
A new ids scheme against blackhole attack to enhance security in wireless net...eSAT Journals
Abstract The aim of this paper is to protect the wireless network against the blackhole attack. Blackhole attack, as the name suggest, drops all the packets forwarded to it. In this paper, we have proposed an intrusion detection system (IDS) scheme to detect the malicious node (blackhole node) and to nullify its effect in the network. The proposed IDS scheme in the presence of blackhole attack gives approximately similar result as that of in the absence of attack. The network comprises for the three modules (i) Default AODV, (ii) AODV in the presence of blackhole attack and (iii) IDS scheme in the presence of attack by considering some parameters such as end to end delay, throughput, packet delivery ratio, normalized routing load etc. The proposed algorithm has been simulated on Network Simulator version-2 (NS-2). Key Words: AODV, Blackhole attack, DSN, IDS scheme, routing misbehavior, security
Similar to CLUSTER BASED FIDELITY TO SECURE DSDV PROTOCOL AGAINST BLACK HOLE ATTACKS (20)
Performance Evaluation of Vehicular Ad Hoc Network (Vanet) Using Clustering A...pijans
Vehicular ad hoc networks (VANETS) have actually attracted a lot of attention over the last few years as
being used to improve road safety. In this paper, cluster based technique has been introduced in VANET.
As VANET is a new form of MANET, so with this cluster based technique in VANET, several handoff
problems have been removed, which were actually difficult to remove in MANET. For this traffic
infrastructure cluster based routing has been used, with two routing protocols i.e. AODV and AODV+. The
network simulator NS2 has been used for removing unpredictable movements that may arise in the network.
An Optimized Mechanism for Adaptive and Dynamic Policy Based Handover in Clus...pijans
On-going revolution in ever-improving wireless communication enforces the necessity of a self configuring,
rapidly deployable and infrastructure less network. MANET is such an autonomous wireless network that
meets the requirements. At the same time MANET’s random behavior and absence of any central
intelligence to gather unambiguous knowledge about user contexts complexes QoS maintenance and
hampers proper utilization of network resources resulting into unnecessary handovers. In past, few policy
driven handover approaches have been proposed for MANET but none of them explores a comprehensive
policy design. Therefore in this paper we propose an adaptive and optimized policy based handover
mechanism which is based on explicitly designed policies like load balancing, service discovery and next
hop selection .Efficient procedures for these policies are also explored .This work predicts the high time of
handover need on the basis of application specific needs of individual freely roaming mobile nodes,
avoiding unnecessary handovers and provides efficient handover procedure with optimized resource
consumption, reduced latency and interruption time.
An Efficient Routing Protocol for Mobile Ad Hoc Network for Secured Communica...pijans
Security and reliable communication is challenging task in mobile Ad Hoc network. Through mobility of network device compromised with attack and loss of data. For the prevention of attack and reliable communication, various authors proposed a method of secured routing protocol such as SAODV and SBRP (secured backup routing protocol). The process of these methods work along with route discovery and route maintains, discovery and route maintained needed more power consumption for that process. The power of devices is decrease during such process and network lifetimes expire. In this paper, we modified the secured stateless protocol for secured routing and minimized the utilization of power during path discovering and establishment. For the authentication of group node used group signature technique and sleep mode threshold concept for power minimization. Our proposed technique is simulated in ns-2 and compare to other routing protocol gives a better performance in comparison to energy consumption and throughput of network.
As-Puma : Anycast Semantics In Parking Using Metaheuristic Approachpijans
The number of vehicle used in the world are increasing day by day resulting in the obvious problem of
parking of these vehicle’s in residential and vocational areas. We perceive the problem of vehicles parking
in vocational establishments / malls. Today majority of parking systems are manual parking systems where
in, on the spot, parking of the vehicle is done and a parking slip is generated and handed over to customer.
This is cumbersome technique wherein various parking attendants in the parking areas manually keeps on
informing the Parking inspector on how many free parking slots available so that only that many number of
parking slips/tickets are generated as the number of free parking slots. We address the problem of parking
in Delay Tolerant Network (DTN) by proposing metaheuristic driven approach of Ant Colony optimization
(ACO) technique with anycast semantics models . Here we propose the parking architecture to solve the
problem of parking especially in commercial areas with their design diagrams . In this architecture we
apply the delivery model to deliver the packet correctly to the intended receiver. Using this we can book
various parking’s through remote areas so that the customer can get the information about availability of
various parking’s inside an area and the parking fare for each category of the automobile. Using this
architecture the customer can get the prior knowledge about various vacant parking slots inside a parking
area and he can book the corresponding parking from his location.
A Survey of Enhanced Routing Protocols for Manetspijans
Mobile Ad Hoc Networks (MANETs) form a class of dynamic multi-hop networks consisting of a set of
mobile nodes that intercommunicate on shared wireless channels. MANETs are self-organizing and selfconfiguring multi-hop wireless networks, where the network structure changes dynamically due to the node
mobility. There exists no fixed topology due to the mobility of nodes, interference, multipath propagation
and path loss. Hence efficient dynamic routing protocols are required for these networks to function
properly. Many routing protocols have been developed to accomplish this task. In this paper we survey
various new routing protocols that have been developed as extensions or advanced versions of previously
existing routing protocols for MANETs such as DSR, AODV, OLSR etc.
Black Hole Attack Prevention Using Random Dispersive Routing for Mobile Adhoc...pijans
Mobile Adhoc Networks is a wireless network and it has become an important technology in current years
in which security has become an important problem. Black hole Attack is one of the promising and severe
security attacks in mobile ad hoc networks which block the communication of secret data during packet
delivery. Black hole attack directly attacks the node’s data traffic on the path and with intent drops, alters
or delays the data traffic passing through that node. In other type of black hole attack which misleadingly
replies for the route request which comes from the node which initiates the route discovery process that it
has as much as necessary routes to the destination even it does not have path to the destination. This paper
deals with prevention of black hole attacks using Shamir’s secret sharing and Random Multipath Routing
Algorithm
Performance Analysis of Mtpr Routing Protocol in Power Deficient Nodepijans
Power conservation in Mobile Ad hoc Network (MANET) is a major challenge even today for researchers.
To conserve it various power aware routing protocols have been proposed. These protocols do not take into
consideration the residual power left in nodes. To find the impact of the same a simulator was designed in
MATLAB-7.01. The routing protocol used in our simulation is Minimum Total Power Routing (MTPR) and
different performance metrics such as path optimality, throughput and hop count were recorded in
presence and absence of power scarce node. The result shows significant impact of power scarce node on
MANET performance.
Path Duration Analysis in Vehicular Ad Hoc Networkpijans
In Vehicular Ad hoc Networks (VANETs) the mobility of the nodes is the main concern. This mobility of
nodes makes the route unstable and unreliable for the information exchange and communication between
two nodes in the network. To enhance the performance and throughput of the VANETs, routes between
nodes must be reliable and stable. In this paper, we study the significance of path duration and link
duration in Vehicular Ad hoc Networks (VANETs). Because of this mobility, connectivity graphs changes
very frequently and it affects the performance of VANETs. Therefore, path duration can be used to predict
the behaviour of the mobile nodes in the network. Estimation of the path duration in VANETs can be a key
factor to improve the performance of the routing protocol. Estimation of path duration is a challenging task
to perform as it depends on many parameters including node density, transmission range, numbers of hops,
and velocity of nodes. This paper will provide a comprehensive study for estimating the path duration in
VANETs.
Study of Various Schemes for Link Recovery in Wireless Mesh Networkpijans
As there is a growing need for the cost effective and highly dynamic large-bandwidth networks over large
coverage area , the Wireless Mesh Network provide first step towards effective communication. A Wireless
Mesh Network is one of the most advanced wireless network used for communication. During their
operating period , the wireless mesh network may suffer from frequent link failure which results in poor
performance of network. Link failure detection plays crucial role in performance of WMN. The proposed
paper presents the review of various techniques used for detection of link failure and the techniques used
for recovery of wireless mesh network.
A Survey on Security Issues to Detect Wormhole Attack in Wireless Sensor Networkpijans
Sensor nodes, when deployed to form Wireless sensor network operating under control of central authority
i.e. Base station are capable of exhibiting interesting applications due to their ability to be deployed
ubiquitously in hostile & pervasive environments. But due to same reason security is becoming a major
concern for these networks. Wireless sensor networks are vulnerable against various types of external and
internal attacks being limited by computation resources, smaller memory capacity, limited battery life,
processing power & lack of tamper resistant packaging. This survey paper is an attempt to analyze threats
to Wireless sensor networks and to report various research efforts in studying variety of routing attacks
which target the network layer. Particularly devastating attack is Wormhole attack- a Denial of Service
attack, where attackers create a low-latency link between two points in the network. With focus on survey of
existing methods of detecting Wormhole attacks, researchers are in process to identify and demarcate the
key research challenges for detection of Wormhole attacks in network layer.
This document is Intended for the purpose of Enabling the power of social media to Empower Ridesharing.
this entails the creation of an ad-ridesharing Initiative with a view to tackling real-world problems such as
traffic congestion and the ever-increasing fuel prices. The main objectives include creating applications,
both web and mobile based, to seamlessly integrate the app’s functionality into and everyday user’s
routine.
Performance Analysis of Improved Autonomous Power Control Mac Protocol (IAPCM...pijans
Power Control in Mobile Ad Hoc networks is a critical issue, since nodes are powered by batteries.The
main idea of power control schemes is to use different power levels for RTS/CTS and DATA/ACK. These
schemes may degrade network throughput and reduce energy efficiency of the network. In this paper we
have evaluated the performance of Improved Autonomous Power Control MAC Protocol (IAPCMP),that
allows nodes to dynamically adjust power levels for transmission of DATA/ACK according to the distance
between the transmitter and its neighbors.In IAPCMP power level for transmission of RTS/CTS is also
adjustable. This also used maximum power level for transmitting DATA/ACK periodically to make
neighboring nodes aware about ongoing transmission. The performance of IAPCMP is evaluated through
the metrics namely, packet delivery ratio and rate of energy efficiency.The simulation results show
significant improvement in protocol.
A Survey of Using Directional Antennas in Ad Hoc Networkspijans
In this paper, we present a comprehensive overview on Ad hoc networking by directional antennas. Use of
Directional antennas can largely reduce the interference, increase the spatial reuse and due to their longer
range we can have routes with fewer hop for two distant nodes. However the main problem of using
directional antennas in Ad hoc networks is due to the dynamic nature of the network. Neighbour discovery,
maintenance the track of moving neighbours, exploitation of the benefit of long range and directional MAC
protocols are the most challenging issues. We present three Directional MAC protocols and two
combinational protocols and system which give solutions to MAC and Neighbour discovery and compare
the throughput of them with 802.11 with omnidirectional antennas.
Wireless Evolution: IEEE 802.11N, 802.11AC, and 802.11AX Performance Comparisonpijans
The widespread adoption of IEEE 802.11 WLANs is attributed to their inherent mobility, flexibility, and
cost-effectiveness. Within the IEEE 802 working group, a dedicated task group is diligently advancing
WLAN technologies, particularly tailored for dense network scenarios. Amidst these advancements, the
802.11ac protocols have emerged as a preferred choice, delivering superior data transfer rates compared
to the preceding 802.11n standard. Significantly, the sixth-generation wireless protocol, IEEE 802.11ax,
has been introduced, showcasing enhanced performance capabilities that outpace its fifth-generation
predecessor, 802.11ac.In this pioneering investigation, we engage in an in-depth simulation-based scrutiny
of prominentWLAN protocols—namely, IEEE 802.11n, IEEE 802.11ac, and the cutting-edge IEEE
802.11ax. Our exhaustive analyses traverse a spectrum of critical metrics, encompassing throughput,
coverage, spectral efficiency, Tx/Rx gain, and Tx/Rx power.In a single-user and SISO scenario, both
802.11ac and 802.11ax outperform 802.11n. Significantly, 802.11ax surpasses the previous 802.11n/ac
standards, highlighting substantial advancements in wireless performance.
Performance Improvement of Multiple Connections in AODV with the Concern of N...pijans
Mobile Ad-hoc Networks (MANETS) consists of a collection of mobile nodes without having a central
coordination. In MANET, node mobility and dynamic topology play an important role in the performance.
MANET provide a solution for network connection at anywhere and at any time. The major features of
MANET are quick set up, self organization and self maintenance. Routing is a major challenge in MANET
due to it’s dynamic topology and high mobility. Several routing algorithms have been developed for
routing. This paper studies the AODV protocol and how AODV is performed under multiple connections in
the network. Several issues have been identified. The bandwidth is recognized as the prominent factor
reducing the performance of the network. This paper gives an improvement of normal AODV for
simultaneous multiple connections under the consideration of bandwidth of node.
An Efficient Call Admission Control Scheme for Handling Handoffs in Wireless ...pijans
Personal Communication Network (PCN) is an emerging wireless network that promises many new
services for the telecommunication industry. The proliferation of demands for extending wireless services
to integrated services, which supports the transmission of data and multimedia information, has resulted in
the need for broadband wireless systems that are able to provide service capabilities similar to those of
wire line networks. The ATM cell - relay paradigm is one possible approach to provide broadband wireless
transmission with PCN’s using the ATM switching networks for interconnection of PCN cells. As traffic in
these mobile cellular networks increases, Handoffs will become an increasingly important issue. As cell
sizes shrink to accommodate an increasingly large demand of services, newer more efficient handoff
schemes need to be used. In this paper, the authors describe the use of novel and efficient data structure
which dynamically allocates guard channel for handoffs and introduces the concept of channel borrowing
strategy. The proposed scheme allocates the guard channels for handoff requests dynamically, based on the
traffic load for certain time period. A new originating call in the cell coverage area also uses these guard
channels if they are unused. Our basic idea is to allow Guard channels to be shared between new calls and
handoff calls. This approach maximizes the channel utilization. The simulation results prove that the
channel borrowing scheme improves the overall throughput.
Design and Implementation of Low-Cost Electric Vehicles (EVs) Supercharger: A...pijans
This article presents a probabilistic modeling method utilizing smart meter data and an innovative agentbased simulator for electric vehicles (EVs). The aim is to assess the effects of different cost-driven EV charging strategies on the power distribution network (PDN). We investigate the effects of a 40% EV adoption on three parts of Frederiksberg's low voltage distribution network (LVDN), a densely urbanized municipality in Denmark. Our findings indicate that cable and transformer overloading especially pose a challenge. However, the impact of EVs varies significantly between each LVDN area and charging scenario. Across scenarios and LVDNs, the share of cables facing congestion ranges between 5% and 60%. It is also revealed that time-of-use (ToU)-based and single-day cost-minimized charging could be beneficial for LVDNs with moderate EV adoption rates. In contrast, multiple-day optimization will likely lead to severe congestion, as such strategies concentrate demand on a single day that would otherwise be distributed over several days, thus raising concerns about how to prevent it. The broader implications of our research suggest that, despite initial worries primarily centered on congestion due to unregulated charging during peak hours, a transition to cost-based smart charging, propelled by an increasing awareness of time-dependent electricity prices, may lead to a significant rise in charging synchronization, bringing about undesirable consequences for the power distribution network (PDN).
Design and Implementation of Low-Cost Electric Vehicles (EVs) Supercharger: A...pijans
This article presents a probabilistic modeling method utilizing smart meter data and an innovative agentbased simulator for electric vehicles (EVs). The aim is to assess the effects of different cost-driven EV
charging strategies on the power distribution network (PDN). We investigate the effects of a 40% EV
adoption on three parts of Frederiksberg's low voltage distribution network (LVDN), a densely urbanized
municipality in Denmark. Our findings indicate that cable and transformer overloading especially pose a
challenge. However, the impact of EVs varies significantly between each LVDN area and charging
scenario. Across scenarios and LVDNs, the share of cables facing congestion ranges between 5% and
60%. It is also revealed that time-of-use (ToU)-based and single-day cost-minimized charging could be
beneficial for LVDNs with moderate EV adoption rates. In contrast, multiple-day optimization will likely
lead to severe congestion, as such strategies concentrate demand on a single day that would otherwise be
distributed over several days, thus raising concerns about how to prevent it. The broader implications of
our research suggest that, despite initial worries primarily centered on congestion due to unregulated
charging during peak hours, a transition to cost-based smart charging, propelled by an increasing
awareness of time-dependent electricity prices, may lead to a significant rise in charging synchronization,
bringing about undesirable consequences for the power distribution network (PDN).
Multilayer Perceptron Guided Key Generation through Mutation with Recursive R...pijans
In this paper, a multilayer perceptron guided key generation for encryption/decryption (MLPKG) has been
proposed through recursive replacement using mutated character code generation for wireless
communication of data/information. Multilayer perceptron transmitting systems at both ends accept an
identical input vector, generate an output bit and the network are trained based on the output bit which is
used to form a protected variable length secret-key. For each session, different hidden layer of multilayer
neural network is selected randomly and weights or hidden units of this selected hidden layer help to form
a secret session key. The plain text is encrypted using mutated character code table. Intermediate cipher
text is yet again encrypted through recursive replacement technique to from next intermediate encrypted
text which is again encrypted to form the final cipher text through chaining , cascaded xoring of multilayer
perceptron generated session key. If size of the final block of intermediate cipher text is less than the size of
the key then this block is kept unaltered. Receiver will use identical multilayer perceptron generated
session key for performing deciphering process for getting the recursive replacement encrypted cipher text
and then mutated character code table is used for decoding. Parametric tests have been done and results
are compared in terms of Chi-Square test, response time in transmission with some existing classical
techniques, which shows comparable results for the proposed technique.
Performance Analysis of Mobile Adhoc Network Routing Protocols Over Tcppijans
In order to reduce the communication cost and time we are looking forward for successful implementation
of an infrastructure less network like Mobile Ad Hoc Network in all arena of wireless mobile
communication. But still it is a challenge to decide a most appropriate routing protocol for MANET. In
MANET there is no fixed topology due to the mobility of nodes, interference, multipath propagation and
path loss. Since MANET does not use fixed infrastructure rather it always have to find suitable router and
routing path for each communication, existing established routing protocol is not suitable for MANET to
function properly. Different Routing protocols have been proposed to meet the challenges with MANETs.
This paper evaluates the performances of four MANET routing protocols which are DSDV, AODV, DSR
and TORA over TCP, a Transport Layer Protocol. The performance metrics which are considered in this
paper are packet delivery fractions, normalized routing overload, end to end delay and throughput. DSDV
is a proactive protocol and the others are reactive protocols.
Batteries -Introduction – Types of Batteries – discharging and charging of battery - characteristics of battery –battery rating- various tests on battery- – Primary battery: silver button cell- Secondary battery :Ni-Cd battery-modern battery: lithium ion battery-maintenance of batteries-choices of batteries for electric vehicle applications.
Fuel Cells: Introduction- importance and classification of fuel cells - description, principle, components, applications of fuel cells: H2-O2 fuel cell, alkaline fuel cell, molten carbonate fuel cell and direct methanol fuel cells.
Rainfall intensity duration frequency curve statistical analysis and modeling...bijceesjournal
Using data from 41 years in Patna’ India’ the study’s goal is to analyze the trends of how often it rains on a weekly, seasonal, and annual basis (1981−2020). First, utilizing the intensity-duration-frequency (IDF) curve and the relationship by statistically analyzing rainfall’ the historical rainfall data set for Patna’ India’ during a 41 year period (1981−2020), was evaluated for its quality. Changes in the hydrologic cycle as a result of increased greenhouse gas emissions are expected to induce variations in the intensity, length, and frequency of precipitation events. One strategy to lessen vulnerability is to quantify probable changes and adapt to them. Techniques such as log-normal, normal, and Gumbel are used (EV-I). Distributions were created with durations of 1, 2, 3, 6, and 24 h and return times of 2, 5, 10, 25, and 100 years. There were also mathematical correlations discovered between rainfall and recurrence interval.
Findings: Based on findings, the Gumbel approach produced the highest intensity values, whereas the other approaches produced values that were close to each other. The data indicates that 461.9 mm of rain fell during the monsoon season’s 301st week. However, it was found that the 29th week had the greatest average rainfall, 92.6 mm. With 952.6 mm on average, the monsoon season saw the highest rainfall. Calculations revealed that the yearly rainfall averaged 1171.1 mm. Using Weibull’s method, the study was subsequently expanded to examine rainfall distribution at different recurrence intervals of 2, 5, 10, and 25 years. Rainfall and recurrence interval mathematical correlations were also developed. Further regression analysis revealed that short wave irrigation, wind direction, wind speed, pressure, relative humidity, and temperature all had a substantial influence on rainfall.
Originality and value: The results of the rainfall IDF curves can provide useful information to policymakers in making appropriate decisions in managing and minimizing floods in the study area.
artificial intelligence and data science contents.pptxGauravCar
What is artificial intelligence? Artificial intelligence is the ability of a computer or computer-controlled robot to perform tasks that are commonly associated with the intellectual processes characteristic of humans, such as the ability to reason.
› ...
Artificial intelligence (AI) | Definitio
Embedded machine learning-based road conditions and driving behavior monitoringIJECEIAES
Car accident rates have increased in recent years, resulting in losses in human lives, properties, and other financial costs. An embedded machine learning-based system is developed to address this critical issue. The system can monitor road conditions, detect driving patterns, and identify aggressive driving behaviors. The system is based on neural networks trained on a comprehensive dataset of driving events, driving styles, and road conditions. The system effectively detects potential risks and helps mitigate the frequency and impact of accidents. The primary goal is to ensure the safety of drivers and vehicles. Collecting data involved gathering information on three key road events: normal street and normal drive, speed bumps, circular yellow speed bumps, and three aggressive driving actions: sudden start, sudden stop, and sudden entry. The gathered data is processed and analyzed using a machine learning system designed for limited power and memory devices. The developed system resulted in 91.9% accuracy, 93.6% precision, and 92% recall. The achieved inference time on an Arduino Nano 33 BLE Sense with a 32-bit CPU running at 64 MHz is 34 ms and requires 2.6 kB peak RAM and 139.9 kB program flash memory, making it suitable for resource-constrained embedded systems.
Optimizing Gradle Builds - Gradle DPE Tour Berlin 2024Sinan KOZAK
Sinan from the Delivery Hero mobile infrastructure engineering team shares a deep dive into performance acceleration with Gradle build cache optimizations. Sinan shares their journey into solving complex build-cache problems that affect Gradle builds. By understanding the challenges and solutions found in our journey, we aim to demonstrate the possibilities for faster builds. The case study reveals how overlapping outputs and cache misconfigurations led to significant increases in build times, especially as the project scaled up with numerous modules using Paparazzi tests. The journey from diagnosing to defeating cache issues offers invaluable lessons on maintaining cache integrity without sacrificing functionality.
Null Bangalore | Pentesters Approach to AWS IAMDivyanshu
#Abstract:
- Learn more about the real-world methods for auditing AWS IAM (Identity and Access Management) as a pentester. So let us proceed with a brief discussion of IAM as well as some typical misconfigurations and their potential exploits in order to reinforce the understanding of IAM security best practices.
- Gain actionable insights into AWS IAM policies and roles, using hands on approach.
#Prerequisites:
- Basic understanding of AWS services and architecture
- Familiarity with cloud security concepts
- Experience using the AWS Management Console or AWS CLI.
- For hands on lab create account on [killercoda.com](https://killercoda.com/cloudsecurity-scenario/)
# Scenario Covered:
- Basics of IAM in AWS
- Implementing IAM Policies with Least Privilege to Manage S3 Bucket
- Objective: Create an S3 bucket with least privilege IAM policy and validate access.
- Steps:
- Create S3 bucket.
- Attach least privilege policy to IAM user.
- Validate access.
- Exploiting IAM PassRole Misconfiguration
-Allows a user to pass a specific IAM role to an AWS service (ec2), typically used for service access delegation. Then exploit PassRole Misconfiguration granting unauthorized access to sensitive resources.
- Objective: Demonstrate how a PassRole misconfiguration can grant unauthorized access.
- Steps:
- Allow user to pass IAM role to EC2.
- Exploit misconfiguration for unauthorized access.
- Access sensitive resources.
- Exploiting IAM AssumeRole Misconfiguration with Overly Permissive Role
- An overly permissive IAM role configuration can lead to privilege escalation by creating a role with administrative privileges and allow a user to assume this role.
- Objective: Show how overly permissive IAM roles can lead to privilege escalation.
- Steps:
- Create role with administrative privileges.
- Allow user to assume the role.
- Perform administrative actions.
- Differentiation between PassRole vs AssumeRole
Try at [killercoda.com](https://killercoda.com/cloudsecurity-scenario/)
CLUSTER BASED FIDELITY TO SECURE DSDV PROTOCOL AGAINST BLACK HOLE ATTACKS
1. International Journal on AdHoc Networking Systems (IJANS) Vol. 9, No. 4, October 2019
DOI: 10.5121/ijans.2019.9401 1
CLUSTER BASED FIDELITY TO SECURE DSDV
PROTOCOL AGAINST BLACK HOLE ATTACKS
Sara Boujaada, Youssef Qaraai, Said Agoujil
E3MI Team, Department of Computer Science, Sciences and Technologies Faculty,
Moulay Ismail University, BP 509 Boutalamine 52000 Errachidia, Morocco.
ABSTRACT
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.
KEYWORDS
Ad-hoc, Vulnerable, Black hole attacks, Clustering, Cluster head, Fidelity, Network performance,
Network Simulator.
1. INTRODUCTION
An ad-hoc network is a wireless network that is capable, to be organized without infrastructure
previously defined. It is an autonomous system of mobile nodes, linked by wireless links whose
union forms an arbitrary graph. Each node in the network is free to join, leave and move
independently. As a result, the network topology changes instantly. To meet the need, the
network may change spontaneously and configures in an autonomous way according to the
existing connections between nodes. In the ad-hoc networks,
node should have the capability to function in the same time routers and terminals [1].
Moreover, the communication between nodes is ensured dynamically [2]. Routing protocols act
as binding force in mobile ad-hoc and facilitate communication between nodes belonging in the
network beyond the physical wireless range of the nodes [3] [4] [5]. In the hierarchical
architecture nodes are divided into a number of clusters each of which is managed by a cluster
head that makes control decisions for cluster members [6]. Only cluster heads nodes are
participating in the routing.
The security in the routing operations represents technical challenges. Indeed, due to lack of
such infrastructure or assumption of central administration, in contrast the traditional security
solutions are not adapted to cope with the features of the ad-hoc networks. Several
vulnerabilities exist in these networks: manufacturing, modification, selfish or malicious nodes,
2. International Journal on AdHoc Networking Systems (IJANS) Vol. 9, No. 2, October 2019
2
usurpation of identity or suppression of the traffic in the network, the black hole attack [7], the
worm hole attack [8]...
Cluster heads (CH) are responsible for monitoring all the routing activities within the cluster
itself; in contrast each CH represents a point of vulnerability [9]. In particular, if no mechanism
is set up to make it possible for each CH to determine the good performance and to check the
coherence of the routing data, the node accepts the information of routing coming from any
other node in the cluster. That is an attacker can send messages containing incorrect information
on the network, in order to conduct a malicious action. For this reason, the traditional
mechanisms of security and the protocols are not directly applicable and require a suitable
securing in the ad-hoc networks. Several researches explored a variety of mechanisms to answer
the problems of data security and a certain number of secure routing protocols have been
suggested in order to prevent different types of attacks.
In this work, which is part of the security in an ad-hoc network, the routing is assumed to be
provided using proactive routing protocol DSDV. In this case, we talk about an autonomous
system. When the system is subject to disturbances, as the case of the black hole type, it may be
that it prevents the good routing performance because of the presence of the malicious nodes.
Thus, we are interested with the problem of controlling the data routed through DSDV in the
presence of such a disturbance. To secure the ad-hoc networks, we envisage a clustered
architecture and we will include security aspects for selection CH. Our approach named cluster
based fidelity to secure DSDV protocol (CBFS) is based on the regrouping of network in
clusters with each cluster is represented by a particular node called cluster head CH taking into
account the level of fidelity of each node. The selected CH is responsible to manage the nodes
in the same cluster and to communicate with nodes from the other Clusters.
This paper is organized as follows: In section 2 we give an overview of the DSDV routing
protocol and the black hole attack. After dealing with some protocols introduced to secure
DSDV protocol, we give a detailed approach followed by our proposed algorithm in the third
section. The last section will be devoted to the simulation tests by considering three metrics
while varying the number of black hole attacks.
2. ROUTING AND ATTACKS
2.1. DSDV Protocol
The dynamic destination-sequenced distance-vector (DSDV) is one of the proactive
protocols [10]. This protocol inherits the feature and concept of Bellman-Ford algorithm and
customs a table driven methodology. Each node stores a routing table containing all possible
destinations with three entries: destination address, hop count and sequence number (SN). Every
node i maintains for each destination x a set of distances dij(x) for each node j that is a neighbor
of i. Node i treats neighbor k as a next hop for a packet destined to x if dik(x) equals min{dij(x)}.
The succession of next hops chosen in this manner leads to x along the shortest path. The
sequence number is used to know the most recent information. So as to keep the distance
estimates up to date, each node in the network monitors the cost of its outgoing links and
periodically broadcasts to all of its neighbors its current estimate of the shortest distance to
every other node. The distance vector which is periodically broadcasted contains one entry for
each node in the network which includes the distance from the advertising node to the
destination.
3. International Journal on AdHoc Networking Systems (IJANS) Vol. 9, No. 2, October 2019
3
Fig.1: Illustration of DSDV
Fig.2: Example of DSDV
The DSDV initiate an interchange of routing information with its neighboring whenever a new
update happens in a network. The routing updates could be sent in two ways: one is known as a
"full dump", which is a packet that carries all the Information about a change and another is
"incremental" will be used where only the entries that require changes are sent [11]. The nodes
causes to links break when they move. When a link to the next hop is broken, the route through
the next hop is assigned to infinity metric with updated sequence
number [12]. Sequence numbers assigned by the origin nodes are even numbers and to infinity
metrics are odd. A node receives infinity metric, when it has an equal or later sequence number
with a finite metric; it triggers to update the route, and the route with infinity metric will get
replaced by a new route. When a mobile node receives new route packets then it is updated and
it compares the existing with the previous in the table. DSDV updates its routing tables
regularly.
2.2. Black Hole Attack
Routing protocols are having a variety of attacks in which a malicious can attract all packets by
falsely claiming a fresh route to the destination and does not participate in forwarding the
packets to next node; we talk about black hole attack. In other words, a malicious node uses the
routing protocol (such as DSDV) to promote false information of having shortest path to the
destination node or to the packet it wants to intercept, then black hole will have the accessibility
in replying to the route request and creates a reply where an extremely short route is advertised.
4. International Journal on AdHoc Networking Systems (IJANS) Vol. 9, No. 2, October 2019
4
If the malicious reply reaches node before the reply from the actual node, a forged route is
created. When the attacker inserts itself between the communicating nodes, it is able to drag the
packets towards them. And when the source receives these false packets, it starts transmitting
the data packets to the black hole node instead of transmitting them to the destination. Below we
give an extract of black hole algorithm.
Fig.3: Example of black hole attack
Algorithm 1:
Else if ((rt and blackhole = = 1)) Then
assert (rq → rq_dst = = rt → rt_dst);
sendReverse (rq ≥ rq_src); // IP Destination
rq → rq_timestamp); // timestamp
rt → pc_insert(rt0 → rt_nexthop);
rt0 → pc_insert(rt → rt_nexthop);
Packet::free(p);
End If
3. RELATED WORKS
Security is an important research topic for mobile ad- hoc networks (MANETs), typically
striving for goals like integrity to guarantee that the messages of routing exchanged between the
entities were never corrupted. Authentication to verify the identity of an entity or a node in the
network and the non-repudiation to verify that the sender and recipient are parties that they say
have respectively sent or received the message. In recent years, there has been some proposed
approaches to protect the network from black hole with the DSDV protocol.
3.1. Secured DSDV
In [13], a secure efficient ad-hoc distance vector routing protocol namely SEAD is a proactive
secure ad-hoc routing protocol, based on DSDV. SEAD makes it possible to authenticate the
sender of routing information, and other information provided such as the number of
intermediate nodes and the sequence numbers. In order to avoid costly signatures, SEAD uses a
one-way hash chain for its own entries in periodic updates, to authenticate the sequence number
and metric values "hash" strings. However SEAD makes the hypothesis of a mechanism
allowing a node to distribute an authentic element of the hash chain. SEAD does not regard the
modification of other fields such as the next hop or the destination. It also does not protect
against manufacturing and sending a new update message to another node by using the same
5. International Journal on AdHoc Networking Systems (IJANS) Vol. 9, No. 2, October 2019
5
metric and sequence number as a recent update message. Thus, a dishonest node can modify
fields that are not protected or make and inject messages where the data that will be verified are
new while the rest is false.
The Secured-Destination Sequenced Distance Vector (SDSDV) [14] is a proactive secured
routing protocol which aims at improving QoS requirements of the network. It uses the concept
of bandwidth and Residual Energy of the node to determine the path. It uses Intruder Detection
Methodology which uses threshold value and Advanced Encryption Standard (AES) algorithm
for data encryption.
3.2. Clusterisation
Many clustering algorithms have been proposed in ad-hoc networks to choose cluster heads.
Let’s mention for example the Lowest-ID heuristic method [15] which is based on the node
identifiers where each node is assigned a distinct ID and periodically broadcast the list of nodes
that it capable to detect all its neighbors. The formation of clusters follows the following rules:
If a node u has the lowest ID in its neighborhood, it will be selected as a cluster head. The
Highest degree heuristic proposed by Gerla and Parekh [16] chooses the node having maximum
number of neighbors (maximum degree) as cluster head. A node x is considered to be a
neighbor of another node y if x lies within the transmission range of y. The weighted clustering
algorithm (WCA) is a combined metric algorithm that uses a weighted sum of four metrics into
consideration. These metrics are the degree deference D (u), the distance summation to all its
neighboring nodes P(u), the mobility M(u) and the remaining battery power P(u) [6].
Poids (u) = αD (u) + βP (u) + γM (u) + δT (u) (1)
With
α + β + γ + δ= 1
4. PROPOSED APPROACH
In [17], we proposed a new method to control the AODV protocol against Black Hole attacks. It
is the PC-AODV- BH protocol, a combination between the security mechanisms (digital
signatures and hash functions) with the fidelity concept. In this work we will follow the same
approach but in a clustering architecture in order to minimize the network load, the routing is
supposed to be provided by the DSDV protocol which is the object of an black hole attack.
4.1. Description of the Proposed Architecture
The concept of security proposed in this architecture is based on the following ideas:
• Define an ad-hoc architecture based on the division of the network with a single leader (CH)
by group (Cluster).
• Create an atmosphere of fidelity between all the nodes of the group; fidelity is a counter that is
associated with a node, which is increased whenever it forwards a data packet successfully.
• In each group, elect a Cluster Head from among the nodes that have a smallest Poids (u) and a
higher fidelity level.
• Implement cryptography to secure interactions between groups.
• Maintain security architecture as long as possible.
6. International Journal on AdHoc Networking Systems (IJANS) Vol. 9, No. 2, October 2019
6
4.2. Clustering
In a clustering the mobile nodes are divided into several groups or substructures, called as
clusters, they are allocated geographically adjacent into the same cluster according to some rules
with different behaviors [18]. A typical cluster structure is shown in Fig.4. It can be seen that
the nodes are divided into a number of groups (with the dotted lines) based on certain rules.
Mobile nodes are classified into cluster head (CH), cluster gateway and cluster member. A
cluster head normally serves as a local coordinator to manage the nodes of its own cluster and to
communicate with other clusters, performing intra-cluster transmission arrangement, data
forwarding, and so on. A cluster gateway is a non-cluster head node with inter-cluster links, so
it can access neighboring clusters and forward information between clusters. A cluster member
is usually called an ordinary node, which is a non-cluster head node without any inter-cluster
links. CH is selected by basing on a specific metric or combination of metrics. Some of the
parameters are residual energy, connection density and fidelity level of the node.
Fig.4: Cluster structure illustration
4.3. Fidelity
The proposed methodology is based on secure clustering approach for prevention of cooperative
black hole attack. The proposed fidelity model is to provide the necessary mechanisms to
associating a fidelity level to each node of the system via its routing table. In each node in
clusters, the fidelity is basically considered as an integer number or a counter that is associated
with it. This concept contributes to maintain the security of the network while measuring what
one calls the fidelity levels Sara et al [17]. In other words, when the data packets are forwarded
successfully, this counter is increased. According to the loyal participation of nodes in the
network, their fidelity levels are updated. After successful reception of the packets by the
destination node, this latter replies by sending an acknowledgement packet to the source.
Fidelity level will be incremented and the packet is exchanged. If no acknowledgement is
received by the source node within a timer event, the intermediate node level will be
decremented and also of the next hop of the intermediate node. The fidelity tables are
exchanged periodically between the participating nodes in the cluster. The fidelity level of every
intermediate node i is linked to be the degree of its participation in the network operation. In
other words; it is through the reports of transfer and reception of each node. Thus, the fidelity
level φi of the node i is given by:
7. International Journal on AdHoc Networking Systems (IJANS) Vol. 9, No. 2, October 2019
7
Where MT (resp. MR) is the number of forward messages (resp. received) by the node i and [X]
indicate the integer part of the real X.
4.4. CBFS-DSDV-BH Algorithm
In this part we present the procedure of our approach which consists of six principal steps as
described in the algorithm below.
Algorithm 2:
Step1: Initialization by some parameters such as;
x_range and y_range // x-axis and y-axis boundary.
N // the number of nodes.
Max_disp // maximum displacement of nodes.
S1, S2, S3... Sn // cluster size.
RUN_TIME // the simulation time.
tx _range // transmission range.
φi // Fidelity level.
Step2: Determination of the specific location for each node in the network.
Step3: Computation of the distance between any node and others lying in the same transmission
range.
Step4: Cluster head (CH) election procedure
Calculating degree of every node d(u). CH is selected based on the node with maximum
number of neighbors in the same transmission range;
Compute the degree difference for each node;
Compute the speed for every node till current time T.
Calculate energy of every node;
Determinate the combined weight for every node;
W (u) = αD(u) + βP (u) + γM (u) + δT (u)
Step5: Integration of the fidelity concept associated with the nodes in each cluster.
int φ = [
mt
mr
];
Select the node with maximum φ as a cluster head.
for n=1:N
If (φ of a CH == 0)) then
remove the CH from neighbor table and fidelity table
Update CH election
end
•
8. International Journal on AdHoc Networking Systems (IJANS) Vol. 9, No. 2, October 2019
8
end
Take the node with the smallest W(u) and a higher fidelity level φmax as the cluster head
CH
Step6: Update the node position (the entire nodes move randomly after some unit time).
Whenever we observe that the fidelity value of a particular node is greater that of another node
then we can conclude that the one having the greater value is a more durable node than the other
from who's its value is greater. It is quite logical because a node with greater value indicates that
it is an experienced node in the network and it has transmitted packets most dutifully than other
nodes and it will be selected as a CH in cluster. In the case where the level of CH or any node in
cluster drops to 0, it is considered to be a malicious node, termed as a "black hole" and it is
eliminated, a new election of cluster head will be made. The detection of a black hole has to be
intimated to the other participating nodes in clusters. This is accomplished by sending alarm
packets. When a node receives an alarm packet, it will identify the black hole and so can
eliminate the use of that node from then on.
5. SIMULATIONS
Performance Evaluation
To illustrate our proposed approach, we will test the CBFS-DSDV-BH Algorithm on an
example of an ad-hoc network according to three metrics using NS simulator. The number of
network nodes is fixed in 42 which move in an area of 1440m*1440m. We use a CBR
application (Constant Bit Rate) where the traffic between nodes is produced using a traffic
generator which creates randomly CBR connections that start at moments which are uniformly
distributed between 0 and 10 seconds (with a pause time equal to 1 second). The size of the
transferred data is assumed to be equal to 512 bytes. The simulation parameters are summarized
in table 1 below.
Before presenting the performance results of the considered network, we present in the fig.5 the
simulation scenario obtained using equation (1) where the four parameters are given by: α =
0.45, β = 0.05, γ = 0.45 and δ = 0.05.
9. International Journal on AdHoc Networking Systems (IJANS) Vol. 9, No. 2, October 2019
9
Fig.5: The proposed cluster architecture
Table 1: Simulation parameters
Parameter Value
Simulator NS2
Number of Nodes 42 nodes
Traffic Type Constant Bit Ratio CBR
Transmission rang 250m
Terrain area 1440m*1440m
Simulation Time 10 seconds
Packet Size 512 bytes
Routing Protocols DSDV
Pause Time 1 seconds
In order to evaluate the performance of concerned routing protocol, we recall these three
definitions.
1) Average Delay: the average delay is defined as the time difference between the sending
data packets by the source and the receiving data packets by the destination node.
𝐴𝐷 =
1
𝑛
(∑ 𝑃𝑘𝑡𝑅𝑒𝑐𝑣𝑑𝑇𝑖𝑚𝑒 – 𝑃𝑘𝑡𝑆𝑒𝑛𝑡𝑇𝑖𝑚𝑒)
𝑛
𝑖=0
2) Throughput: is the average of successful messages delivered to the destination by a
communication channel according to a given time interval
𝑇ℎ𝑟𝑜𝑢𝑔ℎ𝑝𝑢𝑡 =
∑ 𝑃𝑘𝑡𝑠𝑅𝑒𝑐𝑣𝑑 ∗ 𝑃𝑘𝑡𝑆𝑖𝑧𝑒𝑛
𝑖=0
1000
3) Packets loss: it is the difference between the amount of generated and received packets
during a time of communication.
10. International Journal on AdHoc Networking Systems (IJANS) Vol. 9, No. 2, October 2019
10
The variation of these three metrics is given according to time, and they are related to the
autonomous, disturbed and controlled cases of the DSDV routing protocol state.
Autonomous system: From the table 1, the performance evaluation of the network according to
the three metric ones above, while using the routing protocol DSDV, gave the following results
(figs 6, 7 and 8).
Fig.6: Average delay
Fig.7: Throughput of communication
11. International Journal on AdHoc Networking Systems (IJANS) Vol. 9, No. 2, October 2019
11
Fig.8: Packets loss
Disturbed system: Now, we assume that the network described in the table 1 is vulnerable
because of the black hole attacks. In order to describe the impact of malicious nodes on the
behavior of the DSDV routing, we consider two situations of black hole attack: 1 and 3. Thus
we obtain the figs 9, 10 and 11.
Fig.9: Average delay with black hole attacks
12. International Journal on AdHoc Networking Systems (IJANS) Vol. 9, No. 2, October 2019
12
Fig.10: Throughput of communication with black hole
Attacks
Fig.11: Packets loss with black hole attacks
Controlled system: When the network described in table 1 undergoes a disturbance of the type
1 or 3 black holes, our objective is to be able to cancel their effects using the fidelity level in
clustering architecture, and then to compare in terms of effectiveness of safety of DSDV routing
deal with such threats. Therefore, an implementation of the two protocols enables us to obtain
the figs 12 - 17.
Fig.9: Average delay with black hole attacks
13. International Journal on AdHoc Networking Systems (IJANS) Vol. 9, No. 2, October 2019
13
Fig.12: Controlled average delay with one black hole
Fig.13: Controlled throughput of communication with
one black hole
14. International Journal on AdHoc Networking Systems (IJANS) Vol. 9, No. 2, October 2019
14
Fig.14: Controlled packets loss with one black hole
Fig.15: Controlled average delay with three black holes Attacks
Fig.16: Controlled throughput of communication with three black hole attacks
15. International Journal on AdHoc Networking Systems (IJANS) Vol. 9, No. 2, October 2019
15
Fig.17: Controlled packets loss with three black hole Attacks
Discussion results: The figures 6, 7 and 8 represent respectively the variation, according to the
time, of the average delay, the throughput of communication and the quantity of packages lost
in the DSDV routing protocol. It is about a normal evolution of this protocol, because what
concerns us is the control of this protocol facing the black hole attacks.
In the presence of this kind of attack, the behavior of DSDV is modified. Indeed, the figure 9
shows that the average delay is proportional to the number of black hole attacks over the entire
interval of time. As this metric is a major challenge which any ad-hoc network seeks to
minimize, its increase based on malicious nodes is due to the cooperation of the latter for the
degradation of the receptions in the entire network. In a similar way, the increase in the quantity
of the packets loss, figure 11 is mainly the result of the black hole attack which consists in
falsifying the borrowed routes and the cooperation of the attackers as well.
The figure 10 shows the effect of black holes attacks on the throughput of communication in the
network. The observed decrease is due to the fact that the bandwidth is also shared by malicious
nodes that cooperate and contribute to the transfer and the reception of the data by emulating the
source by erroneous information.
The objective of our approach is to be able to make the disturbed system in its autonomous state
by using an protector control. From the figures 12 - 17, we note that the curves obtained by the
implementation of the improved version of DSDV: Cluster Based Fidelity to Secure DSDV
(CBFS) is approximately close to those corresponding to the case of the routing DSDV in the
autonomous case. In other words, these one is not only made it possible to decrease the average
delay and packets loss, but increased the throughput of communication. The improved version
of DSDV protocol (CBFS) remain effective for the protection of the DSDV protocol against
black hole attacks, since malicious nodes share the channel or bandwidth with other nodes in the
network.
That being, one notes that the protocol of control is able to defend the routing in the two
situations of attacks (1 and 3 black holes), for the considered metric. Moreover, the figures 12 -
17 show that our proposed scheme CBFS is approximately close to the DSDV protocol, and it’s
appear efficient to secure this protocol. That is a consequence of the use of the fidelity levels
and an optimal CH in each cluster for choosing the safest route
6. CONCLUSIONS
In the mobile ad-hoc networks, there is a big problem of the presence of a malicious node. In
this project, we have proposed an algorithm to secure the DSDV routing protocol against black
hole attacks in an ad-hoc mobile network. Our proposed approach consists in combining the
clustering technique with a fidelity concept. The election of node control is made taking into
account the maximum value of degree's nodes in the network. This control node is considered as
the cluster head (CH) one. By consequence, the secure communication between clusters is
answered by applying the routing DSDV protocol using the CH nodes.
The implementation of the resulting algorithm under NS simulator, according to the end to end
delay, throughput of communication and packets loss, has shown that the proposed method
made it possible to answer the objective of this work.
16. International Journal on AdHoc Networking Systems (IJANS) Vol. 9, No. 2, October 2019
16
In the rest of this work, we intend to extend these results by comparing them with other existing
secure variants of DSDV such as SDSDV, SEAD ... On the other hand, a hybrid security
approach will be considered by combining the routing protocols AODV (reactive) and DSDV
(proactive).
REFERENCES
[1] P. Tomar V. Sejwar P. Suman, D. Bisen and R. Shukla. Comparative study of routing protocols for
mobile ad-hoc networks. International Journal of Information Technology and Knowledge
Management, 2009.
[2] Chlamtac I Conti M and Liu JJ. Mobile ad-hoc networking: imperatives and challenges. ad-hoc
Networks, 2003.
[3] Jasvinder and Monika Sachdeva. A survey of behavior of manet routing protocols under black hole
attack. International Journal of Advanced Research in Computer Science and Software Engineering,
2013.
[4] Biradar R and Patil V. Classification and comparison of routing techniques in wireless ad-hoc
networks. In ad-hoc and Ubiquitous Computing. ISAUHC06. International Symposium, page pages
712, 2006.
[5] P. Chenna Reddy and P ChandraSekhar Reddy. Performance analysis of adhoc network routing
protocols. In ad-hoc and Ubiquitous Computing. ISAUHC 06. International Symposium, page pages
186187, 2006.
[6] Chatterjee M and Turgut D Das SK. Wca: a weighted clustering algorithm for mobile ad hoc
networks. Journal of Cluster Computing, 05(02):193–204, 2002.
[7] S. Sharma and R. Gupta. Simulation study of blackhole attack in the mobile ad-hoc networks.
Journal of Engineering Science and Technology, 4(2):243–250, 2009.
[8] Amos J Paul and Vishnu K. Detection and removal of cooperative black/gray hole attack in mobile
adhoc networks. International Journal of Computer Applications (ISSN NO. 0975 - 8887), 1(22),
(2010).
[9] P. S. Mann Harmanpreet Kaur. Prevention of black hole attack in manets using clustering based dsr
protocol. IJCST, 2014.
[10] C.E. Perkins and E.M. Royer. : Ad-hoc on-demand distance vector routing. In: Proceedings of the
2nd IEEE Workshop on Mobile Computing Systems and Applications, page 90–100, (1997).
[11] G.Vijaya Kumar and Dr.M.Nagendra Y.Vasudeva Reddyr. Current research work on routing
protocols for manet: A literature survey. International Journal on Computer Science and
Engineering, Vol. 02(No. 03):706–713, 2010.
[12] Prof. A Rama Rao,MKalyani, B Sravanthi, K Pradeep Chandra, and G N Mohan. Performance
evaluation of aodv and dsdv routing protocols through clustering in manets. International Journal of
Scientific and Engineering