This document summarizes and compares four routing algorithms for mobile ad hoc networks: Disjoint Multipath Routing, Trust based Multipath Routing, Message Trust based Multipath Routing, and a new proposed algorithm called Friend Based Ad-hoc Routing. It describes the key mechanisms of each algorithm, including how they establish routes, incorporate trust levels, and handle packet routing. The proposed FACES algorithm aims to improve security and efficiency by using friend, unauthenticated, and question mark lists to identify trusted routes and avoid malicious nodes.
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
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.
Exclusion of Denial of Service Attack using Graph Theory in MANETSIRJET Journal
This document proposes a method to detect and prevent denial of service (DoS) attacks in mobile ad hoc networks using a trust-based mechanism. It involves calculating trust values for each node based on their behavior and activity, including the number of routing packets sent and received. Nodes with low trust values that are suspected of attacks will be isolated from the network. The method was tested in an ad hoc network simulation using NS-2 and showed improved performance metrics like higher packet delivery ratio, lower delay, jitter and dropping ratio compared to a network under DoS attack. This demonstrates that the trust-based mechanism can effectively detect DoS attackers and secure routing in the mobile ad hoc network.
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
An Ad hoc network in a wireless system consist of an autonomous system, without centralization which results forming of mobile nodes. In MANET, each node works in a dual form that consists of a router as well as hosts. These nodes configure dynamically and communicate using hop to hop. Due to its simplicity it is used in mobile conferencing, military communication. In MANET nodes can join and leave the network so MANET becomes vulnerable. Certain factors like dynamic network configures, distribution cooperation, open medium terrorized in routing which give rise to security issues. Once such protocol AODV has been a victim of security. In existing, MANET faces a severe problem known as the Black Hole problem. This Black hole problem is mostly found in reactive routing protocol called AODV.The black hole conducts its malicious node during route discovery process. Black hole node is a severe threat in AODV protocol that easily employed and becomes vulnerable in MANET. In this paper various techniques are discussed to overcome the Black hole attack.
Performance investigation of re shuffling packet attack on transport layer pr...eSAT Journals
Abstract Over the past decade, the wireless world has experienced significant developments. The emergence and proliferation of radio frequency networking products, wireless devices like handheld, wearable and portable computers, Personal Digital Assistants (PDA)s, cellular phone have given rise to a kind of wireless revolution. A mobile ad hoc network is much more assailable to attacks than a wired network due to its limited physical security, high mobility and lack of centralized administration. In this paper, we present and analyze the effects of re-shuffling attack on TCP based mobile ad-hoc networks named as Packet Re-Shuffling. In the packet reshuffling attack the malicious node will reorder the packets in its FIFO buffer before forwarding them towards their destination. Due to the out of order delivery the retransmission time out of the packet is triggered and the source TCP and UDP has to retransmit the packet. In this way it also stops the TCP to perform the congestion avoidance technique. A malicious node will always participate in route setup operations. For example, if source routing is employed, malicious nodes always relay Route Request packets in order to have as many routes as possible flowing through themselves; if distance vector routing is employed, malicious nodes will also obey all control-plane protocol specifications. However, once a route is established, attacking nodes will thwart the end-to-end throughput of the flow via above mentioned attacks. The effect of the proposed attack is analyzed with the simulation results generated using the trial version of the simulator known as Exata Cyber 2.0. The simulation results are given in terms of metrics such as data flow throughput, Packet Retransmission, average end-to-end delay and packet delivery ratio. In this paper, we are giving The study on UDP and TCP. Keywords: MANETs; Multimedia Streaming; Routing protocols; QoS; Topology; Node Mobility; Network Scalability;
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.
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.
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
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.
Exclusion of Denial of Service Attack using Graph Theory in MANETSIRJET Journal
This document proposes a method to detect and prevent denial of service (DoS) attacks in mobile ad hoc networks using a trust-based mechanism. It involves calculating trust values for each node based on their behavior and activity, including the number of routing packets sent and received. Nodes with low trust values that are suspected of attacks will be isolated from the network. The method was tested in an ad hoc network simulation using NS-2 and showed improved performance metrics like higher packet delivery ratio, lower delay, jitter and dropping ratio compared to a network under DoS attack. This demonstrates that the trust-based mechanism can effectively detect DoS attackers and secure routing in the mobile ad hoc network.
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
An Ad hoc network in a wireless system consist of an autonomous system, without centralization which results forming of mobile nodes. In MANET, each node works in a dual form that consists of a router as well as hosts. These nodes configure dynamically and communicate using hop to hop. Due to its simplicity it is used in mobile conferencing, military communication. In MANET nodes can join and leave the network so MANET becomes vulnerable. Certain factors like dynamic network configures, distribution cooperation, open medium terrorized in routing which give rise to security issues. Once such protocol AODV has been a victim of security. In existing, MANET faces a severe problem known as the Black Hole problem. This Black hole problem is mostly found in reactive routing protocol called AODV.The black hole conducts its malicious node during route discovery process. Black hole node is a severe threat in AODV protocol that easily employed and becomes vulnerable in MANET. In this paper various techniques are discussed to overcome the Black hole attack.
Performance investigation of re shuffling packet attack on transport layer pr...eSAT Journals
Abstract Over the past decade, the wireless world has experienced significant developments. The emergence and proliferation of radio frequency networking products, wireless devices like handheld, wearable and portable computers, Personal Digital Assistants (PDA)s, cellular phone have given rise to a kind of wireless revolution. A mobile ad hoc network is much more assailable to attacks than a wired network due to its limited physical security, high mobility and lack of centralized administration. In this paper, we present and analyze the effects of re-shuffling attack on TCP based mobile ad-hoc networks named as Packet Re-Shuffling. In the packet reshuffling attack the malicious node will reorder the packets in its FIFO buffer before forwarding them towards their destination. Due to the out of order delivery the retransmission time out of the packet is triggered and the source TCP and UDP has to retransmit the packet. In this way it also stops the TCP to perform the congestion avoidance technique. A malicious node will always participate in route setup operations. For example, if source routing is employed, malicious nodes always relay Route Request packets in order to have as many routes as possible flowing through themselves; if distance vector routing is employed, malicious nodes will also obey all control-plane protocol specifications. However, once a route is established, attacking nodes will thwart the end-to-end throughput of the flow via above mentioned attacks. The effect of the proposed attack is analyzed with the simulation results generated using the trial version of the simulator known as Exata Cyber 2.0. The simulation results are given in terms of metrics such as data flow throughput, Packet Retransmission, average end-to-end delay and packet delivery ratio. In this paper, we are giving The study on UDP and TCP. Keywords: MANETs; Multimedia Streaming; Routing protocols; QoS; Topology; Node Mobility; Network Scalability;
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.
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.
Performance Evaluation and Comparison of On Demand Multicast Reactive Routing...CSCJournals
This document analyzes and compares the performance of the multicast routing protocols MAODV and ODMRP under black hole attacks in MANETs. Simulation results show that both protocols experience a significant reduction in packet delivery ratio in the presence of black hole attackers. However, the impact is greater on MAODV compared to ODMRP due to ODMRP's use of alternate data delivery paths. The packet delivery ratio and average end-to-end delay are negatively affected by increased node mobility and number of attackers. ODMRP generally performs better than MAODV under black hole attacks due to its mesh-based structure providing redundant routes.
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.
MANET is a dynamic network with large number of mobile nodes .As the traffic increases over the manet it will leads to number of problems i.e congestion and packet loss .This congestion and packet loss problems occurs due to the attack in manet .one of attack is black hole attack .As a result some packet loss over the network and slows the communication process.In this paper we are providing the solution against black hole attack which is based on fuzzy rule .fuzzy rule based solution identify the infected node as well as provide the solution to reduce data loss over network.
This document summarizes a research paper that proposes a new algorithm to defend against selective forwarding attacks in mobile ad hoc networks (MANETs). The algorithm aims to provide secure data transmission and detect malicious nodes launching selective forwarding attacks. It does so in three steps: (1) calculating trust values for each node to select secure routing paths, (2) authenticating nodes to prevent unauthorized access, and (3) performing secure route discovery and maintenance across nodes. The algorithm is claimed to detect malicious nodes while still delivering data to legitimate destinations, improving upon existing acknowledgement-based defenses against selective forwarding attacks.
The document describes a source location privacy scheme for wireless sensor networks. It aims to hide the location of transmitting nodes from unauthorized parties. The scheme uses cluster-based anonymization and random routing. Node identities are anonymized by cluster heads assigning random numbers. Messages are then randomly routed across the network before reaching the base station. The scheme is evaluated using an information theoretic privacy measure index that considers the degree of privacy from anonymization and routing. Simulation results show the scheme achieves high privacy levels over 70% while increasing average message delay by a factor of 10 compared to schemes without privacy protections.
Impact of black hole attack on aodv routing protocolZac Darcy
A
m
obile
a
d
-
hoc
n
etwork (MANET)
is a
collection
of wireless mobile nodes
that dynamically self
-
organize
to form an
arbitrary and temporary network.
The mobile nodes can communicate wit
h each other
without
any fixed infrastructure.
MANET
can be set
up quickly to facilitate communication in a hostile environment
such as battlefield or emergency situation.
The various severe security threats are
increasing
on the
MANET
. One of these secur
ity threats is black hole attack which drops all received data packets intended
for forwarding. In this paper, we are simulating and analyzing the impact of black hole attack on Ad Hoc
On
-
Demand Distance Vector (AODV) protocol. Th
e simulation is carried on
NS
-
2 and t
he simulation
results are analyzed
on
various network performance
metric
s such as packet delivery ratio, normalized
routing overhead
and
average end
-
to
-
end delay
Intrusion detection in heterogeneous network by multipath routing based toler...eSAT Publishing House
This document summarizes a research paper that proposes a new scheme called weighted-based voting to overcome the problem of "badmouthing" attacks in wireless sensor networks with multipath routing. Badmouthing occurs when malicious nodes fail to drop packets even after knowing the packet was already delivered. The weighted-based voting protocol assigns weights based on success rates to identify trusted nodes. It uses weighted voting to make multipath routing decisions and remove malicious nodes detected by a distributed intrusion detection system based on votes from random voter nodes. The goal is to maximize network lifetime while satisfying quality of service requirements in heterogeneous wireless sensor networks.
Intrusion detection in heterogeneous network by multipath routing based toler...eSAT Journals
Abstract The key theory of our redundancy management is to achieve the tradeoff between energy consumption vs. the gain in timeliness, security, and reliability to increase the system useful lifetime. A Innovative probability model to analyze the best redundancy level in terms of source redundancy, path redundancy and as well as the best intrusion detection settings in terms of the number of voters and the intrusion invocation break under which the lifetime of a HWSN [Heterogeneous Wireless Sensor Network] is maximized. In redundancy management “badmouthing” is the major problem in managing the redundancy. This badmouthing is malicious node which will never drop the packet even after knowing that the packet has been sent already. In this paper we propose a new scheme to overcome the problem of badmouthing by weighted based voting, this protocol will weight (Success Rate) all the nodes in the network to find the non-malicious node in the network which having more packet drop. In “weighted voting” main function is to find trust/reputation of neighbor nodes, as well as to tackle the “what paths to use” problem in multipath routing decision making for intrusion tolerance in WSNs. Keywords: Bad mouthing, Wireless Sensor Network, Weighted Based Voting, HWSN.
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
Detecting Misbehavior Nodes Using Secured Delay Tolerant NetworkIRJET Journal
This document proposes a method called Statistical-based Detection of Blackhole and Greyhole attackers (SDBG) to detect misbehaving nodes in delay tolerant networks. SDBG can detect both individual misbehaving nodes as well as nodes that are colluding together. It works by having each node record encounter data with other nodes, including the number of messages sent and received. Individual nodes that drop many messages can be detected based on having a low message forwarding ratio. Colluding nodes can be detected because they will have sent many messages to each other to fake good behavior. The method aims to accurately detect misbehaving nodes while keeping false positives low. Extensive simulations showed it can work well across different network conditions.
PRIVACY ENHANCEMENT OF NODE IN OPPORTUNISTIC NETWORK BY USING VIRTUAL-IDijsc
An entrepreneurial system is one of the sort of remote system. Delay resistance system is correspondence
organizing proposition which empowers the correspondence in such a situation where end to end way
might never be exist. Message is forward on the premise of chance. Time interim to convey a message is
long we can't evaluate or anticipate the time until we get the message. There is a security issue in these
sorts of system. In this paper we will proposed another procedure which will expand the protection of the
system and build execution of the system.
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.
International Journal of Computational Engineering Research(IJCER) is an intentional online Journal in English monthly publishing journal. This Journal publish original research work that contributes significantly to further the scientific knowledge in engineering and Technology
An Efficient Secured And Inspection of Malicious Node Using Double Encryption...IRJET Journal
This document proposes a method called Statistical-based Detection of Black hole and Grey hole attackers (SDBG) to detect both individual and colluding attacks in delay tolerant networks (DTNs). SDBG works by having a trusted authority monitor nodes' behavior based on their encounter records, message records, and forwarding histories. It aims to improve detection accuracy and reduce the impact of false positives compared to existing detection methods. The methodology involves network and authority creation, route finding and data forwarding, and detecting colluding attacks based on monitoring nodes' interactions and messages. Simulation results show SDBG can effectively detect attacks with varying drop rates even under collusion with high accuracy and low false positives.
Multicasting in Delay Tolerant Networks: Implementation and Performance AnalysisNagendra Posani
Delay Tolerant Networks(DTN) are a class of emerg- ing networks which experience intermittent connectivity and lack end-to-end paths due to absence of well-defined infrastructure. In this paper we explore the nuances of multicasting in DTNs. Multicasting enables efficient distribution of messages to a group of users, a paradigm that can be applicable in the context of DTNs. While multicasting in internet and ad-hoc networks has been studied extensively, realizing the same in DTNs is non- trivial given that many factors have to be considered. This paper, presents an implementation of multicast routing for various protocols in DTNs using ONE simulator. It also provides the analysis and performance results for the various protocols studies against the different movement models.
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.
This document discusses the performance analysis and minimization of black hole attacks in mobile ad hoc networks (MANETs). It begins with an introduction to MANETs and discusses how they are vulnerable to black hole attacks. The document then describes the AODV routing protocol and how black hole attacks exploit vulnerabilities in the route discovery process. Existing detection and prevention techniques are outlined. The document proposes modifying the AODV protocol to implement an intrusion detection system (IDSAODV) that can detect and discard fraudulent route replies from black hole nodes, improving packet delivery. Simulation scenarios of varying node counts with and without black holes are used to analyze black hole behavior and evaluate the effectiveness of the IDSAODV approach.
PERUSAL OF INTRUSION DETECTION AND PREVENTION SYSTEM ON A MANET WITH BLACK HO...ijsptm
MANET is a self configuring network of nodes which is a wireless . The nodes in this network move
randomly .Mobility of nodes is more. The nodes are dynamic and infrastructure less ,self maintainable. In
MANET there are many types of security attacks like Blackhole, greyhole attack, wormhole, jellyfish etc.
When the MANET is under blackhole attack there is a loss of energy which is high at the node resulting in
loss of battery backup and also excess of bandwidth may be consumed by the attacker. The attacker is an
insider. Among various mobility models to generate mobility patterns the Random waypoint mobility
model is used .To solve these issues an IDPS framework for MANET using image processing techniques
under blackhole attack is proposed to detect the blackhole attack RREP by providing security services like
authentication and confidentiality.
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
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
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
The document describes a genetic algorithm approach to optimizing the design of steel-concrete composite plane frames to minimize cost. The algorithm uses design variables like beam and column cross-sectional properties to represent potential solutions. It evaluates solutions based on structural analysis and design constraints like moments, shear, buckling and axial forces. The best solution from each generation is preserved to guide the evolution toward an optimal, cost-effective frame design. The approach is demonstrated on example frames.
Performance Evaluation and Comparison of On Demand Multicast Reactive Routing...CSCJournals
This document analyzes and compares the performance of the multicast routing protocols MAODV and ODMRP under black hole attacks in MANETs. Simulation results show that both protocols experience a significant reduction in packet delivery ratio in the presence of black hole attackers. However, the impact is greater on MAODV compared to ODMRP due to ODMRP's use of alternate data delivery paths. The packet delivery ratio and average end-to-end delay are negatively affected by increased node mobility and number of attackers. ODMRP generally performs better than MAODV under black hole attacks due to its mesh-based structure providing redundant routes.
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.
MANET is a dynamic network with large number of mobile nodes .As the traffic increases over the manet it will leads to number of problems i.e congestion and packet loss .This congestion and packet loss problems occurs due to the attack in manet .one of attack is black hole attack .As a result some packet loss over the network and slows the communication process.In this paper we are providing the solution against black hole attack which is based on fuzzy rule .fuzzy rule based solution identify the infected node as well as provide the solution to reduce data loss over network.
This document summarizes a research paper that proposes a new algorithm to defend against selective forwarding attacks in mobile ad hoc networks (MANETs). The algorithm aims to provide secure data transmission and detect malicious nodes launching selective forwarding attacks. It does so in three steps: (1) calculating trust values for each node to select secure routing paths, (2) authenticating nodes to prevent unauthorized access, and (3) performing secure route discovery and maintenance across nodes. The algorithm is claimed to detect malicious nodes while still delivering data to legitimate destinations, improving upon existing acknowledgement-based defenses against selective forwarding attacks.
The document describes a source location privacy scheme for wireless sensor networks. It aims to hide the location of transmitting nodes from unauthorized parties. The scheme uses cluster-based anonymization and random routing. Node identities are anonymized by cluster heads assigning random numbers. Messages are then randomly routed across the network before reaching the base station. The scheme is evaluated using an information theoretic privacy measure index that considers the degree of privacy from anonymization and routing. Simulation results show the scheme achieves high privacy levels over 70% while increasing average message delay by a factor of 10 compared to schemes without privacy protections.
Impact of black hole attack on aodv routing protocolZac Darcy
A
m
obile
a
d
-
hoc
n
etwork (MANET)
is a
collection
of wireless mobile nodes
that dynamically self
-
organize
to form an
arbitrary and temporary network.
The mobile nodes can communicate wit
h each other
without
any fixed infrastructure.
MANET
can be set
up quickly to facilitate communication in a hostile environment
such as battlefield or emergency situation.
The various severe security threats are
increasing
on the
MANET
. One of these secur
ity threats is black hole attack which drops all received data packets intended
for forwarding. In this paper, we are simulating and analyzing the impact of black hole attack on Ad Hoc
On
-
Demand Distance Vector (AODV) protocol. Th
e simulation is carried on
NS
-
2 and t
he simulation
results are analyzed
on
various network performance
metric
s such as packet delivery ratio, normalized
routing overhead
and
average end
-
to
-
end delay
Intrusion detection in heterogeneous network by multipath routing based toler...eSAT Publishing House
This document summarizes a research paper that proposes a new scheme called weighted-based voting to overcome the problem of "badmouthing" attacks in wireless sensor networks with multipath routing. Badmouthing occurs when malicious nodes fail to drop packets even after knowing the packet was already delivered. The weighted-based voting protocol assigns weights based on success rates to identify trusted nodes. It uses weighted voting to make multipath routing decisions and remove malicious nodes detected by a distributed intrusion detection system based on votes from random voter nodes. The goal is to maximize network lifetime while satisfying quality of service requirements in heterogeneous wireless sensor networks.
Intrusion detection in heterogeneous network by multipath routing based toler...eSAT Journals
Abstract The key theory of our redundancy management is to achieve the tradeoff between energy consumption vs. the gain in timeliness, security, and reliability to increase the system useful lifetime. A Innovative probability model to analyze the best redundancy level in terms of source redundancy, path redundancy and as well as the best intrusion detection settings in terms of the number of voters and the intrusion invocation break under which the lifetime of a HWSN [Heterogeneous Wireless Sensor Network] is maximized. In redundancy management “badmouthing” is the major problem in managing the redundancy. This badmouthing is malicious node which will never drop the packet even after knowing that the packet has been sent already. In this paper we propose a new scheme to overcome the problem of badmouthing by weighted based voting, this protocol will weight (Success Rate) all the nodes in the network to find the non-malicious node in the network which having more packet drop. In “weighted voting” main function is to find trust/reputation of neighbor nodes, as well as to tackle the “what paths to use” problem in multipath routing decision making for intrusion tolerance in WSNs. Keywords: Bad mouthing, Wireless Sensor Network, Weighted Based Voting, HWSN.
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
Detecting Misbehavior Nodes Using Secured Delay Tolerant NetworkIRJET Journal
This document proposes a method called Statistical-based Detection of Blackhole and Greyhole attackers (SDBG) to detect misbehaving nodes in delay tolerant networks. SDBG can detect both individual misbehaving nodes as well as nodes that are colluding together. It works by having each node record encounter data with other nodes, including the number of messages sent and received. Individual nodes that drop many messages can be detected based on having a low message forwarding ratio. Colluding nodes can be detected because they will have sent many messages to each other to fake good behavior. The method aims to accurately detect misbehaving nodes while keeping false positives low. Extensive simulations showed it can work well across different network conditions.
PRIVACY ENHANCEMENT OF NODE IN OPPORTUNISTIC NETWORK BY USING VIRTUAL-IDijsc
An entrepreneurial system is one of the sort of remote system. Delay resistance system is correspondence
organizing proposition which empowers the correspondence in such a situation where end to end way
might never be exist. Message is forward on the premise of chance. Time interim to convey a message is
long we can't evaluate or anticipate the time until we get the message. There is a security issue in these
sorts of system. In this paper we will proposed another procedure which will expand the protection of the
system and build execution of the system.
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.
International Journal of Computational Engineering Research(IJCER) is an intentional online Journal in English monthly publishing journal. This Journal publish original research work that contributes significantly to further the scientific knowledge in engineering and Technology
An Efficient Secured And Inspection of Malicious Node Using Double Encryption...IRJET Journal
This document proposes a method called Statistical-based Detection of Black hole and Grey hole attackers (SDBG) to detect both individual and colluding attacks in delay tolerant networks (DTNs). SDBG works by having a trusted authority monitor nodes' behavior based on their encounter records, message records, and forwarding histories. It aims to improve detection accuracy and reduce the impact of false positives compared to existing detection methods. The methodology involves network and authority creation, route finding and data forwarding, and detecting colluding attacks based on monitoring nodes' interactions and messages. Simulation results show SDBG can effectively detect attacks with varying drop rates even under collusion with high accuracy and low false positives.
Multicasting in Delay Tolerant Networks: Implementation and Performance AnalysisNagendra Posani
Delay Tolerant Networks(DTN) are a class of emerg- ing networks which experience intermittent connectivity and lack end-to-end paths due to absence of well-defined infrastructure. In this paper we explore the nuances of multicasting in DTNs. Multicasting enables efficient distribution of messages to a group of users, a paradigm that can be applicable in the context of DTNs. While multicasting in internet and ad-hoc networks has been studied extensively, realizing the same in DTNs is non- trivial given that many factors have to be considered. This paper, presents an implementation of multicast routing for various protocols in DTNs using ONE simulator. It also provides the analysis and performance results for the various protocols studies against the different movement models.
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.
This document discusses the performance analysis and minimization of black hole attacks in mobile ad hoc networks (MANETs). It begins with an introduction to MANETs and discusses how they are vulnerable to black hole attacks. The document then describes the AODV routing protocol and how black hole attacks exploit vulnerabilities in the route discovery process. Existing detection and prevention techniques are outlined. The document proposes modifying the AODV protocol to implement an intrusion detection system (IDSAODV) that can detect and discard fraudulent route replies from black hole nodes, improving packet delivery. Simulation scenarios of varying node counts with and without black holes are used to analyze black hole behavior and evaluate the effectiveness of the IDSAODV approach.
PERUSAL OF INTRUSION DETECTION AND PREVENTION SYSTEM ON A MANET WITH BLACK HO...ijsptm
MANET is a self configuring network of nodes which is a wireless . The nodes in this network move
randomly .Mobility of nodes is more. The nodes are dynamic and infrastructure less ,self maintainable. In
MANET there are many types of security attacks like Blackhole, greyhole attack, wormhole, jellyfish etc.
When the MANET is under blackhole attack there is a loss of energy which is high at the node resulting in
loss of battery backup and also excess of bandwidth may be consumed by the attacker. The attacker is an
insider. Among various mobility models to generate mobility patterns the Random waypoint mobility
model is used .To solve these issues an IDPS framework for MANET using image processing techniques
under blackhole attack is proposed to detect the blackhole attack RREP by providing security services like
authentication and confidentiality.
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
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
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
The document describes a genetic algorithm approach to optimizing the design of steel-concrete composite plane frames to minimize cost. The algorithm uses design variables like beam and column cross-sectional properties to represent potential solutions. It evaluates solutions based on structural analysis and design constraints like moments, shear, buckling and axial forces. The best solution from each generation is preserved to guide the evolution toward an optimal, cost-effective frame design. The approach is demonstrated on example frames.
This document discusses software security metrics and validating UML diagrams using metrics. It provides background on using metrics to measure quality attributes of object-oriented designs. Traditional code-level security metrics are insufficient and evaluating security at the design level is important. The paper proposes a system that applies design-level security metrics using genetic algorithms to generate secure design options from a UML diagram. It then implements code from the designs and applies the same metrics at the code level to validate that the code matches the intended secure design. This allows discovering and fixing security issues earlier in the development process.
The document proposes two new authentication schemes for PDAs that use session passwords. Session passwords are one-time passwords generated for each login. The first scheme generates passwords based on pairs of letters from a secret text password and their intersections on a grid. The second scheme has users rate colors during registration, and session passwords are generated by the intersections of those colors on a color grid and number grid displayed during login. Both schemes aim to be resistant to dictionary attacks, brute force attacks, and shoulder surfing by changing the grids each time. The techniques were proposed to provide authentication for PDAs but require further testing for usability and effectiveness.
This document summarizes a research paper that proposes a machine learning approach for detecting phishing websites. It discusses using heuristic features from CANTINA to train machine learning models. A new domain top-page similarity feature is introduced to improve accuracy. Various modules are described, including site training, site capturing, a phishing dictionary, and image correlation to measure similarity. Experimental results show the approach achieves up to 92.5% f-measure and a 7.5% error rate for phishing detection.
This document summarizes a research paper that proposes using a genetic algorithm to generate high-quality association rules for measuring data quality. The genetic algorithm evaluates rules based on four metrics: confidence, completeness, comprehensibility, and interestingness. It aims to discover high-level prediction rules that perform better than traditional greedy rule induction algorithms at handling attribute interactions. The genetic algorithm represents rules as chromosomes and uses the four metrics as an objective fitness function to evaluate the quality of each rule.
This document describes the design and development of a microcontroller-based system for measuring blood glucose levels. The system uses an amperometric method that relies on glucose oxidase enzymes and a mediator compound to transfer electrons from blood glucose to an electrode, generating an electrical signal. A PIC 18F4520 microcontroller processes, amplifies and converts the signal to a display on an LCD module. The system is intended to be low-cost, portable, and provide frequent blood glucose monitoring to help control diabetes and reduce complications. It works by measuring the current produced from the reaction of blood glucose with glucose oxidase and a mediator compound.
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
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
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
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
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
The document discusses the characterization and numerical optimization of chromium-free nickel alloy filler materials for dissimilar welding between stainless steel SS304. Eight alloys with compositions ranging from 40-43.5% Ni, 4-20% Mo, 0-16% Co, 10% Cu, 22-25% Fe, 0.5% Al, 1% Ti, and 0.001% C were analyzed. JMatPro software was used to simulate phases present at different temperatures. Welding simulations using ANSYS evaluated residual stresses in the welds. The alloy with 43.499% Ni, 0.5% Al, 14% Co, 6% Mo, 10% Cu, 23% Fe, 2% Mn, 1
This document presents a study on using color texture feature analysis to detect surface defects on pomegranates. The researchers developed a method involving cropping images of pomegranates, converting them to HSI color space, generating SGDM matrices to extract 18 texture features for each image, and using support vector machines (SVM) classification to identify the best features for detecting infections. The optimal features identified were cluster shade, product moment, and mean intensity, achieving classification accuracy of 99.88%, 99.88%, and 99.81% respectively.
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
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
Este documento contiene definiciones de términos informáticos comunes. Explica conceptos como software, hardware, sistemas operativos, redes, programación, seguridad informática y más. Algunos de los términos definidos incluyen ActiveX, ADSL, antivirus, cookie, CPU, disco duro, firewall, HTML, internet, mouse, tarjeta de red, procesador, RAM y virus.
O documento descreve o mito grego de Procrusto, que forçava viajantes a se encaixarem em sua cama, cortando ou esticando seus corpos. Também discute como esse mito é usado como metáfora para criticar tentativas de impor padrões únicos, e como a escola precisa se adaptar aos alunos ao invés de forçá-los a se encaixarem em um "leito de Procrusto". A atividade proposta conta a história de dois alunos que sofreram tentativas de impor pad
A survey on trust based secure routing in manetcsandit
A mobile ad hoc network is a wireless network in which no infrastructure is available. MANET is a selfconfiguring
network. Due to dynamic nature of MANET it is very challenging work to employ a secure
route. The intermediate nodes cooperate with each other as there is no such base station or access point.
The routing protocols play important role in transferring data. Cryptographic mechanisms are used in
routing protocols to secure data packets while transmitted in the network. But cryptographic techniques
incur a high computational cost and can’t identify the nodes with malicious intention. So, employing
cryptographic techniques in MANET are quite impractical as MANETs have limited resource and
vulnerable to several security attacks. Trust mechanism is used as an alternative to cryptographic
technique. Trust mechanism secures data forwarding by isolating nodes with malicious intention using trust
value on the nodes. In this paper we survey different trust based protocols of MANET and compare their
performances.
A SURVEY ON TRUST BASED SECURE ROUTING IN MANET cscpconf
A mobile ad hoc network is a wireless network in which no infrastructure is available. MANET is a selfconfiguring
network. Due to dynamic nature of MANET it is very challenging work to employ a secure route. The intermediate nodes cooperate with each other as there is no such base station or access point.The routing protocols play important role in transferring data. Cryptographic mechanisms are used in
routing protocols to secure data packets while transmitted in the network. But cryptographic techniques incur a high computational cost and can’t identify the nodes with malicious intention. So, employing cryptographic techniques in MANET are quite impractical as MANETs have limited resource and
vulnerable to several security attacks. Trust mechanism is used as an alternative to cryptographic technique. Trust mechanism secures data forwarding by isolating nodes with malicious intention using trust value on the nodes. In this paper we survey different trust based protocols of MANET and compare their
performances.
Mitigating Various Attacks in Mobile Ad-hoc Networks Using Trust Based ApproachIJLT EMAS
A Mobile ad hoc network (MANET) is self-organizing,
decentralized and infrastructure-less wireless network. The
successful transmission of the data packet depends on the
complete cooperation of each node in the network. These types of
network don’t have permanent base station, so each node in the
network acts as a router. Due to openness, decentralized, selforganizing
nature of MANET, it is vulnerable to various attacks.
So security is the main concern in MANET.
In this project, we have considered 2 attacks; Vampire
attack and DDoS attacks. Vampire attack drains the energy of
the nodes. DDoS attack exhausts the resources available to a
network, such that the node cannot provide any services. Here,
we discuss methods 2 methods as a solution to our problem; one
is to prevent the attack from happening and other to detect and
recover from the attacks.
MANET (Mobile Ad-hoc Network) is hot spot for research due to its various advantages and
disadvantages. Providing safe communication between mobile nodes, recognization the position of
nodes, reducing overhead, handling misbehavior and location updates are such a difficult issues in
ad-hoc network, so providing trust schemes is an important in this network. MANET provides some
basic functions like routing, communication, network management and packet forwarding etc over
self organized network. Because MANET has not a fixed topology, in which mobile nodes comes and
leaves the network within a random period of time. It effects energy, bandwidth and memory
computations of network. Providing trust in MANET is such a crucial task because it doesn’t having
centralized infrastructure. In this paper, we survey the different trust model schemes of MANET with
their unique features, merits and demerits & findings.
This document summarizes research on the performance impact of black hole attacks on mobile ad hoc networks (MANETs) using different routing protocols. The researchers conducted simulations using OPNET to evaluate the effects of black hole attacks on network throughput, delay, and load under three routing protocols: AODV, OLSR, and DSR. With AODV, the presence of black hole attackers significantly reduced throughput and increased delay by discarding packets. OLSR was not significantly affected by attackers. With DSR, throughput increased over time with attackers due to increasing discarded packets. The research analyzed how black hole attacks degrade MANET performance depending on the routing protocol used.
DESIGN OF A SCHEME FOR SECURE ROUTING IN MOBILE AD HOC NETWORKScscpconf
Security has become a primary concern in order to provide protected communication between
mobile nodes in a hostile environment. Unlike the wireline networks, the unique characteristics
of mobile ad hoc networks pose a number of nontrivial challenges to security design, such as
open peer-to-peer network architecture, shared wireless medium, stringent resource constraints,
and highly dynamic network topology. These challenges clearly make a case for building
multifence security solutions that achieve both broad protection and desirable network
performance. So,we focus on the fundamental security problem of protecting the multihop
network connectivity between mobile nodes in a MANET. We identify the security issues related
to this problem, discuss the challenges to security design, and review the state of-the-art security
proposals that protect the MANET link- and network-layer operations of delivering packets over the multihop wireless channel.
A comparative study on different trust based routing schemes in manetijwmn
This document summarizes and compares different trust-based routing schemes for mobile ad hoc networks (MANETs). It first provides background on MANETs and discusses some common security attacks. It then introduces the concept of trust mechanisms as an alternative to cryptographic techniques for securing routing in MANETs. The document proceeds to overview existing trust-based routing protocols like Trusted AODV and CONFIDANT, describing how they calculate and use trust values. Finally, it compares the performances of different trust-based protocols.
Secure Routing Path Using Trust Values for Wireless Sensor Networks ijcisjournal
Traditional cryptography-based security mechanisms such as authentication and authorization are not effective against insider attacks like wormhole, sinkhole, selective forwarding attacks, etc., Trust based approaches have been widely used to counter insider attacks in wireless sensor networks. It provides a quantitative way to evaluate the trustworthiness of sensor nodes. An untrustworthy node can wreak considerable damage and adversely affect the quality and reliability of data. Therefore, analyzing the trust level of a node is important. In this paper we focused about indirect trust mechanism, in which each node monitors the forwarding behavior of its neighbors in order to detect any node that behaves selfishly and does not forward the packets it receives. For this, we used a link state routing protocol based indirect trusts which forms the shortest route and finds the best trustworthy route among them by comparing the values of all the calculated route trusts as for each route present in the network. And finally, we compare our work with similar routing protocols and show its advantages over them.
Secure routing path using trust values forijcisjournal
Traditional cryptography-based security mechanisms such as authentication and authorization are not
effective against insider attacks like wormhole, sinkhole, selective forwarding attacks, etc., Trust based
approaches have been widely used to counter insider attacks in wireless sensor networks. It provides a
quantitative way to evaluate the trustworthiness of sensor nodes. An untrustworthy node can wreak
considerable damage and adversely affect the quality and reliability of data. Therefore, analyzing the trust
level of a node is important. In this paper we focused about indirect trust mechanism, in which each node
monitors the forwarding behavior of its neighbors in order to detect any node that behaves selfishly and
does not forward the packets it receives. For this, we used a link state routing protocol based indirect
trusts which forms the shortest route and finds the best trustworthy route among them by comparing the
values of all the calculated route trusts as for each route present in the network. And finally, we compare
our work with similar routing protocols and show its advantages over them.
1) The document analyzes the performance of the OLSR routing protocol in MANETs in terms of throughput and delay. It implements RSA encryption at the protocol level to detect and prevent black hole attacks.
2) The simulation results show that OLSR with the RSA-based security mechanism is effective at improving security against black hole attacks. It analyzes throughput and delay under different network conditions using the OLSR protocol.
3) Common routing protocols for MANETs like DSDV, DSR, AODV, and OLSR are discussed. Security is a major challenge for MANETs due to the open wireless medium and lack of centralized monitoring. The paper aims to enhance OLSR
Ensure Security and Scalable Performance in Multiple Relay NetworksEditor IJCATR
A relay network is a broad class of network topology commonly used in networks, where the source and destination are
interconnected by means of a some nodes. In such a network the source and destination cannot transmit to each other directly because
the distance between the source and destination is greater than the transmission range of both of them, hence the demand for
intermediate node(s) to relay. The problem of detecting malicious relay nodes in single source, multi-relay networks has been studied
in the literature for different relaying schemes. Relay nodes in apply network coding while those in and follow the decode-and-forward
protocol. The authors consider a peer-to-peer (P2P) network in which peers receive and forward a linear combination of the exogenous
data packets. To check out the integrity of the received packets, a key signature vector is generated at the source node and broadcasted
to all nodes where it is used to check the integrity of the received packets. In and several information theoretic algorithms for
mitigating falsified data injection effects are proposed. The network modeling used in these works is composed of a single source,
multiple intermediate nodes which utilize network coding. We consider a multiple access relay network where multiple sources send
independent data to a single destination through multiple relays, which may interject falsified data into the network. To detect the
malevolent relays and dispose (efface) data from them, trace bits are embedded in the information data at each source node.
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.
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.
Secure signature based cedar routing in mobile adhoc networkseSAT Journals
This document summarizes a research paper that proposes using group signatures with the CEDAR routing protocol to provide both security and quality of service in mobile ad hoc networks. CEDAR is used to route data between nodes while satisfying bandwidth requirements. Group signatures authenticate messages and ensure integrity and non-repudiation. The core nodes in each cluster sign and verify messages using group keys. This allows communication between clusters to be secure and bandwidth demands to be met, overcoming threats in mobile ad hoc networks.
The document reviews different secured routing protocols for mobile ad hoc networks and their vulnerabilities. It discusses three main categories of secured routing protocols:
1. Trust oriented protocols which use node trust values to determine routing, but are still vulnerable to malicious nodes gaining control.
2. Incentive oriented protocols which aim to discourage attacks through incentives like credits, but require online access or tamper-proof hardware.
3. Detection and isolation protocols which identify misbehaving nodes but have issues like high overhead, inability to detect certain attacks, and vulnerability to false accusations.
In conclusion, while existing protocols address some attacks, they remain vulnerable or impractical in many cases. A robust, lightweight approach is still needed to
Enhance the Throughput of Wireless Network Using Multicast RoutingIOSR Journals
Abstract: Wireless Mesh Network is designed static or limited mobility environment .In multicast routing for wireless mesh networks has focused on metrics that estimate link quality to maximize throughput andtoprovide secure communication. Nodes must collaborate in order to compute the path metric and forward data.Node identify the novel attacks against high- throughput multicast protocols in wireless mesh network.. The attacks exploit the local estimation and global aggregation of the metric to allow attackers to attract a large amount of traffic These attacks are very effective based on high throughput metrics. The aggressive path selection is a double-edged sword: It is maximizes throughput, it also increases attack effectiveness. so Rate guard mechanism will be used.Rate guard mechanism means combines Measurement-based detection and accusation-based reaction techniques.The attacks and the defense using ODMRP, a representative multicast protocol for wireless mesh networks, and SPP, an adaptation of the well-known ETX unicast metric to the multicast setting. Keywords— Wireless mesh network,high throughput metrics, secure multicast routing,metric manipulation attacks, Byzantine attacks
Enhance the Throughput of Wireless Network Using Multicast RoutingIOSR Journals
Wireless Mesh Network is designed static or limited mobility environment .In multicast routing for
wireless mesh networks has focused on metrics that estimate link quality to maximize throughput
andtoprovide secure communication. Nodes must collaborate in order to compute the path metric and
forward data.Node identify the novel attacks against high- throughput multicast protocols in wireless
mesh network.. The attacks exploit the local estimation and global aggregation of the metric to allow
attackers to attract a large amount of traffic These attacks are very effective b a s e d on high
throughput metrics. The aggressive path selection is a double-edged sword: It is maximizes throughput,
it also increases attack effectiveness. so Rate guard mechanism will be used.Rate guard mechanism
means combines Measurement-based detection and accusation-based reaction techniques.The attacks
and the defense using ODMRP, a representative multicast protocol for wireless mesh networks, and
SPP, an adaptation of the well-known ETX unicast metric to the multicast setting
The document summarizes routing security in ad hoc wireless networks. It discusses the characteristics of ad hoc wireless networks and routing protocols used, including proactive, reactive, and hybrid protocols. It then covers various security attacks on routing protocols like passive attacks, active attacks, impersonation attacks, and attacks using modification or fabrication. Finally, it discusses some security mechanisms and routing protocols that aim to provide security, such as SEAD, Ariadne, SAR, and SRP.
Mobile ad hoc are gaining popularity because of availability of low-cost mobile devices and its ability to provide instant wireless networking capabilities where implementation of wired network is not possible or costly. MANETs are vulnerable to various types of attack because of its features like continuous changing topology, resource constraints and unavailability of any centralized infrastructure. Many denials of service type of attacks are possible in the MANET and one of these type attacks is flooding attack in which malicious node sends the useless packets to consume the valuable network resources. Flooding attack is possible in all most all on demand routing protocol. In this paper we present a novel technique to mitigate the effect of RREQ flooding attack in MANET using trust estimation function in DSR on demand routing protocol.
Mobile ad hoc are gaining popularity because of availability of low-cost mobile devices and its ability to provide instant wireless networking capabilities where implementation of wired network is not possible or costly. MANETs are vulnerable to various types of attack because of its features like continuous changing topology, resource constraints and unavailability of any centralized infrastructure. Many denials of service type of attacks are possible in the MANET and one of these type attacks is flooding attack in which malicious node sends the useless packets to consume the valuable network resources. Flooding attack is possible in all most all on demand routing protocol. In this paper we present a novel technique to mitigate the effect of RREQ flooding attack in MANET using trust estimation function in DSR on demand routing protocol
1. Mohana , Dr.N.K. Srinath / International Journal of Engineering Research and Applications
(IJERA) ISSN: 2248-9622 www.ijera.com
Vol. 2, Issue4, July-August 2012, pp.1213-1219
Performance Analysis Of Secure And Trust Based Routing
Algorithms For Mobile Ad-Hoc Network.
Mohana ¹, Dr.N.K. Srinath ²
¹ M.Tech student, Dept. of CSE, R.V. college of Engineering, Bangalore-59, India
2
Professor and Head of Department, Dept. of CSE, R.V college of Engineering, Bangalore-59, India
ABSTRACT
Mobile Ad-hoc Networks (MANETs) Keywords - Classes of Traffic, Data Rating, Dynamic
comprises set of nodes connected by wireless links. Source Routing, Friend Rating, Net Rating, Route
The network is ad hoc because it does not rely on a Discovery Time, Trust Level, Time To Live Period.
preexisting infrastructure, such as routers in wired
networks. Routing in MANETs is a challenging task 1. Disjoint Multipath Routing (DMR)
due to dynamic topology and error prone shared Initially secure connection has been
environment. established between source node to destination node.
The DMR algorithm will find out the multiple routes
Data is sent between nodes in a MANET by from source to destination using DSR algorithm [1] [5].
hopping through intermediate nodes, which must After finding multiple routes, all the routes are sorted
make decisions about where and how to route the based on the route discovery time. Then it will choose
data. MANET faces several problems because of the best four routes which are having minimum time
node mobility, network traffic, network size, and the delay. In this method the message is split into parts.
possibility of node faults. The efficiency and This protocol takes advantage of the shortest path
behavior of a MANET depends on how well between the source node to destination node. Then it
information can be passed around and delivered. routes the four encrypted parts through four different
routes. In this method to decrypt the original message
In today’s world the security vulnerabilities all the encrypted parts are required. The security of this
are increasing day by day. It is really difficult to method lies in the fact that enemy node needs all the
route the packet with minimum packet loss. In this encrypted parts to decrypt the original message.
paper a new routing protocol is presented which
would route the packets in a highly efficient way by 2. Trust based Multipath Routing (TMR)
introducing the concept of friend list, TMR provides a method of message security
unauthenticated list and question mark list. The using trust based multipath routing. In this approach,
algorithm will avoid the malicious node by studying less trusted nodes are given lesser number of self
the network in an intelligent way. The proposed encrypted parts of a message, thereby making it
algorithm is also compared with other multipath difficult for malicious nodes to gain access to the
routing algorithms namely Disjoint Multipath minimum information required to break through the
Routing (DMR), Trust based multipath routing encryption strategy [2]. Using trust levels, it makes
(TMR), Message Trust based multipath Routing multipath routing flexible enough to be usable in
(MTMR) and the performance analysis proves that networks with “vital” nodes and absence of necessary
the proposed method will have better performance redundancy. In addition, using trust levels, it avoids the
with respect to number of hops, route discovery non trusted nodes in the routes that may use brute force
time, and packet loss. attacks and may decrypt messages if enough parts of
the message are available to them.
The performance metric considered for Secure connection has been established between source
proposed work are number of malicious nodes node to destination node. The TMR algorithm will find
detected, number of hops, route discovery time, out the multiple routes from source to destination using
packet loss, The simulation results show that DSR algorithm. After finding multiple routes, all the
FACES protocol works much better and provides routes are sorted based on the trust level. Then it will
more security than the other multipath routing choose the best route which is having maximum trust
protocols. level. In this method the message is split into parts.
Then it routes the encrypted parts through best single
route. The following table gives the description about
1213 | P a g e
2. Mohana , Dr.N.K. Srinath / International Journal of Engineering Research and Applications
(IJERA) ISSN: 2248-9622 www.ijera.com
Vol. 2, Issue4, July-August 2012, pp.1213-1219
the trust levels and the trust levels are varied between -1 The new routing algorithm will make use of
to 4 [2] [3]. following parameters
Sl Trust Meaning Description Question Mark List (QML): The list of nodes which
No Value are deemed suspicious by a particular node. This list is
1 -1 Distrust Completely stored for each and every node in its data structure.
untrustworthy.
2 0 Ignorance Cannot make trust- Unauthenticated List (UL): The list of nodes of which
related judgment about no security information is present.
entity.
3 1 Minimal Lowest possible trust. Friend List (FL): This is the list of nodes which
convey trust. Like the question mark list, a friend list is
4 2 Average Mean trustworthiness. also stored for each node in its data structure. Friends
5 3 Good More trustworthy than are rated on a scale of 0 to 10.
most entities.
6 4 Complete Completely trust this FREQ: Friend Sharing Request, this is a control packet
entity. which is used to initiate friend sharing. A node
Table1: Trust levels. receiving this packet replies with the nodes in its friend
list, unauthenticated list and the question mark list.
3. MTMR Routing Algorithm
MTMR uses a trust assignment and updating DR: Data Rating, this is the rating given to nodes after
strategy which can be used to identify and isolate they transmit some amount of data for the source node.
malicious nodes. The MTMR algorithm will find the
routes by using the DSR algorithm. If the route has FR: Friend Rating, this is the rating computed when
been fined for the first time then the MTMR algorithm nodes share their friend lists.
will have the all routes obtained from DSR with trust
level of zero. The MTMR algorithm will then choose a NR: Net Rating, this rating is computed as a weighted
route with minimum time delay. Then if the route mean of DR and FR.
contains the malicious node then the trust level of the
node is decremented otherwise the trust levels of all the OR: Obtained Rating, rating received during the friend
nodes in the best route will be incremented [4]. sharing stage.
Unlike TMR MTMR routing algorithm does
not assign random trust levels instead the trust levels 4.1 SHARE FRIEND STAGE ALGORITHM
are assigned only to those nodes which behave properly This is the stage in which a node will
and deliver the packets successfully. exchange the friend list with other node in the network
The following figure (1) gives brief
4. Friend Based Ad-hoc Routing (FACES) information about the share friend stage for various
This protocol is used to find out the secure cases between two nodes namely A and B.
route from source to destination. It will route the
packets in a highly efficient way by introducing the
concept of friend list, unauthenticated list and question
mark list. The algorithm will avoid the malicious node
by studying the network in an intelligent way. If any
malicious node will come in the best route, it will detect
that node and it will put it in the question mark list.
Source node will pick the intermediate node
from the friend list. If the Friend List is empty then the
node will obtain the unauthenticated list and pick one of
the node as intermediate node. The value of TTL is
decremented each time intermediate node is picked.
Once the TTL becomes zero we have to use min hop Figure1:Friend sharing stage
routing so that the packet can be delivered to the
destination at the faster rate. Friend sharing is a periodic process which is
chiefly responsible for the security of the algorithm. To
1214 | P a g e
3. Mohana , Dr.N.K. Srinath / International Journal of Engineering Research and Applications
(IJERA) ISSN: 2248-9622 www.ijera.com
Vol. 2, Issue4, July-August 2012, pp.1213-1219
accomplish friend sharing we use the control packet
FREQ (Friend sharing request). The node receiving the 2. After the Friend Sharing Process has finished, each
FREQ replies with the nodes in its friend list, node adds up the OR from various nodes and divides
unauthenticated list and the question mark list. The them with the sum of the rating of those nodes from
rules for friend sharing are as follows: which it obtained the OR. In other words, the FR is the
weighted average of the Net Ratings obtained during
1. Any node can ask for a friend sharing request. the Friend Sharing stage, where the weights are
2. After friend sharing, challenges are initiated for those basically the Net rating of the friend responding to a
nodes which were not in the friend list. particular Friend Sharing request.
3. If a node is already in the friend list the node updates
its friend list. Net Rating: The idea behind calculating DR and FR is
to have two opinions in front of each node. This is done
Let us consider that the node A shares a list with node because malicious nodes can identify some nodes for
B. Then the friend sharing process is carried out as which they would work properly while for some they
follows: would drop packets. The DR acts as the soul opinion of
the host node and FR acts as the opinion of its friend
STEP 1: As the network is initialized each node starts nodes. The Net Rating (NR) would be a weighted mean
the friend sharing process, which leads up to a of the two ratings as given in equation (3):
challenge to start with the formation of friend list. W1 DR W2 FR
NR ………… (3)
STEP 2: If node B is in the list of node A, then if a W1 W 2
particular friend of node B is not present in the list of Where W1 and W2 would be the weights assigned to
node A, node A includes it in its list and initializes the DR and FR respectively. The values of W1and W2 are
Friend Rating as the Obtained Rating from B and the network dependant and can be learnt with experience.
Data Rating to Zero. Net Rating is calculated on the
basis of pre determined weights. 4.2 Form Un-Authenticated List
The nodes will find out the nodes in the
STEP 3: if the node B is in the list of node A and if a transmission range or within the coverage area and then
Particular friend of node B is present in the list of node it maintains a list of nodes which are reachable by the
A then the Friend Rating is calculated. nodes on its data structure.
Data Rating: The data rating is updated by a node for 4.3 Sequential challenges
its friend on the basis of amount of data it transfers for When a source discovers that the data was not
it. The DR of a friend node varies according to the transmitted properly it initiates a sequential challenge.
number of data packets transferred through it. The net To explain it let us consider the path
DR is calculated as a moving average of the last five as, S A B C D where S and D are the
data ratings. Equation (1) describes the moving average source and the destination nodes and A, B, C are the
relation between a data rating i and the previous five intermediate nodes. On discovering data transmission
data ratings: problem after waiting for a back off interval the
following process takes place.
DR(i 1) DR(i 2) DR(i 3) DR(i 4) DR(i 5)
DR(i)
5 Step1.The source challenges node A. If it is not able to
…… (1) complete the challenge it removes it from the friend list
Friend Rating: During the Friend Sharing stage a node and places it in the question mark list. It then tries to
A asks for the friend list of node B and incorporates the route the data through the next best path.
rating of friends in the following way:
1. If the node A and node B have a common friend C, Step 2. If A successfully completes the challenge, it
then node A obtains the rating of node C from the node challenges its neighbor and reports the result backward
B as: To A. Node A then takes action similar to Step 1.
Net rating of B in list ofA Net rating of C in list of B
obtaine d rating
10
……. (2) Step 3. Similarly, if the node B is also authenticated, it
The idea behind equation (2) is to incorporate challenges its neighbor node C and reports backwards
the trust that node A has on node B while obtaining the to node A.
rating of node C from it.
1215 | P a g e
4. Mohana , Dr.N.K. Srinath / International Journal of Engineering Research and Applications
(IJERA) ISSN: 2248-9622 www.ijera.com
Vol. 2, Issue4, July-August 2012, pp.1213-1219
Step 4. If every node is authenticated then node D gets Source Destination Coverage
to know the result of the sequential authentication, Node Node Area
when node C tries to authenticate it, it responds to it
5 45 30
and sends a backward message attaching the number of
data packets received by it. Since everyone is Table 2: Inputs to Routing Algorithms
authenticated no one lies, and attaches the
corresponding packets truthfully. The source thus 1. DMR Algorithm Output
comes to know where the packet drops has taken place.
Output of Stage1 for DMR Algorithm
We emphasize here that during the sequential
challenge process no node would be able to detect
whether it is a sequential challenge or a regular friend
sharing process till it is authenticated. And thus a
malicious node would be caught in the process and
eliminated from the list of trusted node.
4.4 FRIEND ROUTING PROTOCOL
The Friend routing protocol will perform the
following steps
Step 1.The Source Node will first find the set of
intermediate nodes by doing a lookup in its Friend List.
Step 2.If the friend list is empty then the source node
will look into the unauthenticated List. Figure 2: Multiple Routes Discovered using DSR,
data payload to be send.
Step 3. If the unauthenticated list is empty the friend list
has no other choice of picking the node from question Figure 2 shows the multiple routes that have been
mark list. discovered from source node to a destination node
using DSR (Dynamic Source Routing) algorithm and
Step 4. The source node will check whether it contains there corresponding Route Discovery time as well. The
the destination node in its list if yes then the faces user is also entering the data payload that has to be sent
protocol will transmit the data directly to the from source node to destination node.
intermediate node.
Output of DMR Algorithm
Step 5.The intermediate node will then become the
source node (picked up during either the steps 1 2 and
3).
Step 6.The process repeats until the Time to live period
expires or destination node is reached.
Step 7. If the TTL =0 then the current node will always
pick a node which is closer to destination so that the
destination can be reached at a faster rate.
5. Simulation Analysis Figure3: Routes Chosen by DMR
The simulations have been performed using
IDE, java eclipse Galileo. Database used My SQL and Figure-3 shows the multiple routes that are discovered
some of the software packages used are Jdk 1.6, Jre6 using DMR algorithm from source node to the
and Jar files of Structs framework. Data is exported destination node. DMR will select best four routes
using Toad software and performance graphs are which is having a less route discovery time.
plotted using MATLAB.
1216 | P a g e
5. Mohana , Dr.N.K. Srinath / International Journal of Engineering Research and Applications
(IJERA) ISSN: 2248-9622 www.ijera.com
Vol. 2, Issue4, July-August 2012, pp.1213-1219
Figure-6 shows the MTMR algorithm having multiple
routes from source node to the destination node. The
MTMR algorithm will choose a route which is having
the maximum Trust from Source Node to Destination
node in the network. The additional thing happening in
MTMR is the nodes which are in the best route will
have their corresponding trust levels incremented by a
factor of 1.
Figure4: Packet Formation Output 4. Friend based Ad-hoc Routing output
Figure4 shows the Packet Formed using the Triple Des The Friend will also take TTL has an additional input
Encryption for the data fragments. These data parameter as compared to other algorithms.
fragments would be sent over multiple independent
routes from source node to destination node.
2. TMR Algorithm Output
Figure-7: Friend Routing Algorithm Output
Figure-5: TMR Algorithm Output Figure-7 shows the Friend Based Routing Algorithm
output .As seen from the figure the Friend Routing
Figure-5 shows the TMR algorithm having multiple Protocol has discovered all the routes by picking based
routes from source node to the destination node. The on the combination of friend rating, data rating and net
TMR algorithm will choose a route which is having the rating. The Friend Routing has chosen the route which
maximum Trust from Source Node to Destination node
is having the maximum rating as the best route.
in the network. The encrypted data fragments will be
sent in the single best route. Share Friend Stage Output
3. MTMR Algorithm Output
MTMR Routing Algorithm takes an additional
parameter as input i.e threshold trust of a
route.Threshold Trust=40
Figure-6: M TMR Algorithm Output
Figure-8: Friend Sharing Stage Output
1217 | P a g e
6. Mohana , Dr.N.K. Srinath / International Journal of Engineering Research and Applications
(IJERA) ISSN: 2248-9622 www.ijera.com
Vol. 2, Issue4, July-August 2012, pp.1213-1219
Figure 8 shows the output of Friend Sharing Stage As figure conclude that the route discovery time taken by
seen in the figure the friend list of Friend Stage FACES algorithm is less as compared to DMR, TMR
Initiator is shown where the Node Id are friend node and MTMR
ids , Friend Rating from giver is rating allocated from
node 5. Friend Rating from initiator is as per node 4. 3. Packet Loss
Similarly Data Rating and Net Rating are shared Figure 11 shows the packet loss taken for all
between two nodes Node 4 and Node5. the routes from source to destination for all four
algorithms. DMR is having a more number of packet
6. Performance Analysis of Algorithms losses. Packet drop is minimal in FACES, as it will
detect more malicious nodes and efficiently discards
1. No of Hops routes containing malicious nodes. But other multipath
Figure 9 shows the number of hops taken from routing protocols drop a larger number of packets as
source to destination for all four algorithms DMR, they route through a greater number of nodes and thus
TMR, MTMR and FACES. DMR will take more increasing the chances of routing data through
number of hops.TMR and MTMR will take almost malicious nodes. From the figure conclude that FACES
equal number of hops. FACES will take less number of algorithm is the best when compared to DMR, TMR,
hops. From the figure conclude that FACES algorithm and MTMR
is the best w. r. t number of hops.
Figure-9: Number of hops
Figure-11: Packet Loss
2. Route Discovery Time
7. Conclusion and Future work
Mobile Ad-hoc network (MANETs) due to its
dynamic nature has many challenges. Some of the
major challenges are number of malicious nodes
detected, number of hops, route discovery time and
packet loss.
Many Routing algorithms namely DMR,
TMR, MTMR and FACES have their own way in order
to establish the trust and transmit packet securely. But
Friend based protocol proved to be best in terms of
number of malicious nodes detected, number of hops,
route discovery time and packet loss.
Figure-10: Route Discovery Time
In future we plan to implement the existing
Figure-10 shows the route discovery time taken for all secure routing protocols such as the ARIADNE and
the routes from source to destination for all four ARAN and compare them with the FACES protocol.
algorithms. DMR and MTMR are taking more time to The system handles only text as message for data
establish path between source node to destination node. packets does not handle multimedia data packets. In
TMR is taking medium route discovery time. From the
1218 | P a g e
7. Mohana , Dr.N.K. Srinath / International Journal of Engineering Research and Applications
(IJERA) ISSN: 2248-9622 www.ijera.com
Vol. 2, Issue4, July-August 2012, pp.1213-1219
future it can be enhanced to include multimedia Compact Wireless and Wired Sensing Systems.
packets. Boca Raton, FL: CRC, 2005, pp. 32:1–32:20.
[9] W. Diffie and M. E. Hellman, “New directions
References in cryptography,” IEEE Trans. Inform. Theory,
vol. IT-22, no. 6, pp. 644–654, 1976.
[1] David B. Johnson David A. Maltz Josh Broch [10] M. S. Obaidat and N. Boudriga, Security of e-
“DSR: The Dynamic Source Routing Protocol Systems and Computer Networks. Cambridge,
for Multi-Hop Wireless Ad Hoc Networks” U.K.: Cambridge Univ. Press, 2007.
Computer Science Department, Carnegie [11] K. Sanzgiri, B. N. Levine, C. Shields, B.
Mellon University. Dahill, and E. M. Belding- Royer, “A secure
[2] Alfarez Abdul-Rahman & Stephen Hailes “A routing protocol for ad hoc networks,” in Proc.
Distributed Trust Model” Department of 10th IEEE Int. Conf. Network Protocols
Computer Science, University College London, (ICNP), Paris, France, Nov. 12–15, 2002, pp.
Gower Street, London WC1E 6BT, United 78–89.
Kingdom. [12] Y. Hu, A. Perrig, and D. B. Johnson,
[3] A.A. PIRZADA and C. McDONALD “Trust “Ariadne: A secure on-demand routing
Establishment in Pure Ad-hoc Networks” protocol for ad hoc networks,”Wireless Netw.,
School of Computer Science & Software vol. 11, no. 1–2, pp. 21–38, Jan. 2005.
Engineering, The University of Western [13] S. Marti, T. J. Giuli, K. Lai, and M. Baker,
Australia, 35 Stirling Highway, Crawley, W.A. “Mitigating routing misbehavior in mobile ad
6009, Australia, Wireless Personal hoc networks,” in Proc. MobiCom 2000,
Communications (2006) 37: 139–163, DOI: Boston, MA, Aug. 2000, pp. 255–265.
10.1007/s11277-006-1574-5 C _ Springer
2006.
[4] Su Bing, Ma Zheng-Hua,Sun Yu-Qiang“A
Trusted-Based Encryption Mechanism for
Efficient Communication Over Wireless
Network” Wireless Communications,
Networking and Mobile Computing, 2008.
WiCOM ’08 4th International Conference,
Digital Object Identifier:
10.1109/WiCom.2008.1111
[5] Al-Mekhlafi Z.G, Hassan R, “Evaluation study
on routing information protocol and dynamic
source routing in Ad-Hoc network”,
Information Technology in Asia (CITA 11),
2011 7th International Conference, E-ISBN :
978-1-61284-130-4, INSPEC Accession
Number: 12208218 Digital Object Identifier
:10.1109/CITA.2011.5999535 Issue Date : 30
August 2011, pp 1-4.
[6] L.Wang and N.-T. Zhang, “Locally forwarding
management in ad-hoc networks,” in Proc.
IEEE Int. Conf. Communications, Circuits and
Systems and West Sino Expositions, Jun./Jul.
2002, pp. 160–164.
[7] D. Johnson and D. Maltz, “Dynamic source
routing in ad hoc wireless networks,” in Book
Chapter inMobile Computing, T. Imielinski
andH. Korth, Eds. Dordrecht, The
Netherlands: Kluwer, 1996, pp. 131–181.
[8] A. Wood and J. A. Stankovic, “A taxonomy
for denial-of-service attacks in wireless sensor
networks,” in Handbook of Sensor Networks:
1219 | P a g e