This presentation discusses securing the AODV routing protocol for mobile ad hoc networks. It reviews three approaches: 1) Using public key cryptography and group session keys to authenticate nodes and encrypt routing packets. 2) Using intrusion detection and response models to identify compromised nodes based on abnormal routing behavior. 3) The Secure AODV (SAODV) protocol which aims to provide source authentication, neighbor authentication, message integrity, and access control to address vulnerabilities like message tampering, dropping, and replays. Experimental results are compared for SAODV and traditional AODV.
The document discusses several routing protocols for mobile ad hoc networks:
- DSR allows nodes to cache and share routing information for more efficient routing but has larger packet headers due to source routing. AODV uses only next hop information, keeping routing tables smaller.
- Both protocols use route discovery and maintenance, but AODV proactively refreshes routes while DSR reacts to failures. AODV also uses sequence numbers to prevent loops and choose fresher routes.
- Overall, DSR is better for networks where routes change infrequently while AODV scales better and maintains only active routes, at the cost of higher routing overhead during route discovery. Security remains a challenge for both protocols.
Ad hoc On-demand Distance Vector (AODV) Routing Protocol by Ashok PanwarAshok Panwar
The document discusses the Ad Hoc On-Demand Distance Vector (AODV) routing protocol. AODV is a reactive routing protocol designed for use in mobile ad hoc networks. It establishes routes using a route discovery process initiated when a node requires a route to a destination. This process uses route request and route reply messages to discover routes. AODV also maintains these routes by periodically broadcasting hello messages and responding to link failures via route error messages. The document provides details on AODV's routing table structure, message types, route discovery and maintenance processes.
AODV (Ad hoc On-demand Distance Vector) VS AOMDV (Ad hoc On-demand Multipath ...Ann Joseph
The document discusses Ad hoc On-demand Multipath Distance Vector (AOMDV), which is a multipath extension of the AODV routing protocol for mobile ad hoc networks. AOMDV discovers multiple loop-free and disjoint paths between source and destination nodes in a single route discovery to improve fault tolerance. It provides benefits like lower end-to-end delay, higher throughput, and reduced route discovery operations compared to AODV, which is a single path routing protocol.
DSR is a source routing protocol for wireless ad hoc networks. It uses source routing whereby the source specifies the complete path to the destination in the packet header. Route discovery is done through route request broadcasts, and routes are cached for future use. Route maintenance is done through acknowledgements; if a link breaks, a route error is sent back to the source. Simulation results showed high packet delivery ratios even with high node mobility. DSR performs well for dynamic wireless networks.
The document compares the AODV and OLSR routing protocols for mobile ad hoc networks. AODV is a reactive protocol that establishes routes on demand, while OLSR is a proactive protocol that maintains routes to all nodes. OLSR generally has lower latency than AODV but higher overhead. Both protocols elect multipoint relays to reduce flooding. AODV uses less bandwidth but requires route discovery, while OLSR maintains all routes continuously.
1) The document describes the Ad Hoc On-Demand Distance Vector (AODV) routing protocol. AODV is a reactive protocol that discovers routes on-demand using a route discovery process.
2) When a node needs to send a packet to an unknown destination, it broadcasts a route request (RREQ) to its neighbors. Neighbors set up reverse paths and rebroadcast the RREQ until it reaches the destination node.
3) The destination or intermediate nodes with a route can send a unicast route reply (RREP) back to the source node using the reverse path. This sets up a forward path from source to destination for data packets.
The document discusses on-demand driven reactive routing protocols. It provides an overview of table-driven vs on-demand routing protocols and describes two popular on-demand protocols - Dynamic Source Routing (DSR) and Ad Hoc On-Demand Distance Vector Routing (AODV) in detail. DSR uses source routing by adding the complete route to packet headers. AODV maintains routing tables at nodes and relies on dynamically establishing next hop information for routes.
The document discusses several routing protocols for mobile ad hoc networks:
- DSR allows nodes to cache and share routing information for more efficient routing but has larger packet headers due to source routing. AODV uses only next hop information, keeping routing tables smaller.
- Both protocols use route discovery and maintenance, but AODV proactively refreshes routes while DSR reacts to failures. AODV also uses sequence numbers to prevent loops and choose fresher routes.
- Overall, DSR is better for networks where routes change infrequently while AODV scales better and maintains only active routes, at the cost of higher routing overhead during route discovery. Security remains a challenge for both protocols.
Ad hoc On-demand Distance Vector (AODV) Routing Protocol by Ashok PanwarAshok Panwar
The document discusses the Ad Hoc On-Demand Distance Vector (AODV) routing protocol. AODV is a reactive routing protocol designed for use in mobile ad hoc networks. It establishes routes using a route discovery process initiated when a node requires a route to a destination. This process uses route request and route reply messages to discover routes. AODV also maintains these routes by periodically broadcasting hello messages and responding to link failures via route error messages. The document provides details on AODV's routing table structure, message types, route discovery and maintenance processes.
AODV (Ad hoc On-demand Distance Vector) VS AOMDV (Ad hoc On-demand Multipath ...Ann Joseph
The document discusses Ad hoc On-demand Multipath Distance Vector (AOMDV), which is a multipath extension of the AODV routing protocol for mobile ad hoc networks. AOMDV discovers multiple loop-free and disjoint paths between source and destination nodes in a single route discovery to improve fault tolerance. It provides benefits like lower end-to-end delay, higher throughput, and reduced route discovery operations compared to AODV, which is a single path routing protocol.
DSR is a source routing protocol for wireless ad hoc networks. It uses source routing whereby the source specifies the complete path to the destination in the packet header. Route discovery is done through route request broadcasts, and routes are cached for future use. Route maintenance is done through acknowledgements; if a link breaks, a route error is sent back to the source. Simulation results showed high packet delivery ratios even with high node mobility. DSR performs well for dynamic wireless networks.
The document compares the AODV and OLSR routing protocols for mobile ad hoc networks. AODV is a reactive protocol that establishes routes on demand, while OLSR is a proactive protocol that maintains routes to all nodes. OLSR generally has lower latency than AODV but higher overhead. Both protocols elect multipoint relays to reduce flooding. AODV uses less bandwidth but requires route discovery, while OLSR maintains all routes continuously.
1) The document describes the Ad Hoc On-Demand Distance Vector (AODV) routing protocol. AODV is a reactive protocol that discovers routes on-demand using a route discovery process.
2) When a node needs to send a packet to an unknown destination, it broadcasts a route request (RREQ) to its neighbors. Neighbors set up reverse paths and rebroadcast the RREQ until it reaches the destination node.
3) The destination or intermediate nodes with a route can send a unicast route reply (RREP) back to the source node using the reverse path. This sets up a forward path from source to destination for data packets.
The document discusses on-demand driven reactive routing protocols. It provides an overview of table-driven vs on-demand routing protocols and describes two popular on-demand protocols - Dynamic Source Routing (DSR) and Ad Hoc On-Demand Distance Vector Routing (AODV) in detail. DSR uses source routing by adding the complete route to packet headers. AODV maintains routing tables at nodes and relies on dynamically establishing next hop information for routes.
This document discusses routing protocols for mobile ad-hoc networks (MANETs). It introduces several routing protocols including proactive (table-driven) protocols like Destination-Sequenced Distance Vector (DSDV), reactive (on-demand) protocols like Ad-hoc On-Demand Distance Vector (AODV) and Dynamic Source Routing (DSR), and hybrid protocols like Zone Routing Protocol (ZRP) that use both proactive and reactive approaches. For each protocol, it provides a brief overview of the routing approach and algorithm. It also compares the characteristics of proactive, reactive and hybrid routing protocols.
Simulation & comparison of aodv & dsr protocolPrafull Johri
This document summarizes and compares two reactive routing protocols - AODV and DSR. It discusses how NS2 was extended to simulate wireless networks and the two protocols. AODV uses route discovery to find paths, maintains route tables, and can locally repair broken links. DSR also uses route discovery but source routes are carried in packet headers. While AODV has lower initial packet loss, DSR performance improves over time, so either protocol can be used for longer simulations.
Ad-hoc On-Demand Distance Vector (AODV) is a routing protocol for wireless ad-hoc networks that allows nodes to communicate with each other by discovering routes on demand using a broadcast route request and unicast route reply process, where each node maintains a routing table with the next hop and number of hops to each known destination. AODV limits routing overhead by maintaining routes only as long as they are needed and repairing broken routes using route error and hello messages.
This document provides a literature review of research papers on detecting and preventing blackhole attacks in the AODV routing protocol for mobile ad hoc networks (MANETs). It summarizes 9 papers that propose various techniques like using sequence numbers, watchdog mechanisms, and route confirmation messages to identify malicious nodes and increase security. The document outlines the key ideas, results, and potential future work from each paper to improve performance and security against blackhole attacks in AODV routing.
Dynamic Source Routing uses route discovery to find routes between nodes. When a node receives a route request (RREQ) message, if it is the destination it returns a route reply (RREP) with the accumulated route record to the sender. If it is an intermediate node, it discards the RREQ if it has the same ID or finds its own address in the route, otherwise it appends its address to the route record and propagates the RREQ to neighbors to continue finding a path to the destination.
ZRP divides routing into intrazone and interzone routing. Intrazone routing uses a proactive approach to route packets within a node's routing zone. Interzone routing uses a reactive approach where the source node sends route requests to peripheral nodes when the destination is outside its zone. The optimal zone radius depends on factors like mobility and query rates, with smaller radii preferred for higher mobility. ZRP aims to reduce routing overhead through techniques like restricting floods and maintaining multiple routes.
AODV is a reactive routing protocol for mobile ad hoc networks. It uses route discovery and maintenance to dynamically discover and maintain routes. Route discovery uses route request (RREQ) and route reply (RREP) messages to find routes between nodes. Route maintenance uses route error (RERR) messages to notify nodes of link breaks. Each node maintains a routing table with next hop and destination information.
- Mobile ad hoc networks (MANETs) are autonomous systems of wireless nodes that can dynamically change topology as nodes move. Routing must adapt to these changes.
- There are two main categories of routing protocols: table-driven protocols proactively maintain consistent, up-to-date routing tables whereas on-demand protocols only determine routes when needed.
- Examples of protocols include DSDV as a table-driven protocol and AODV as an on-demand protocol, with AODV using route requests and replies to discover routes only when transmitting data.
The document summarizes several routing protocols used in wireless networks. It discusses both table-driven protocols like DSDV and on-demand protocols like AODV. It provides details on how each protocol performs routing and maintains routes. It also outlines some advantages and disadvantages of protocols like DSDV, AODV, DSR, and TORA.
Research Inventy : International Journal of Engineering and Scienceresearchinventy
Research Inventy : International Journal of Engineering and Science is published by the group of young academic and industrial researchers with 12 Issues per year. It is an online as well as print version open access journal that provides rapid publication (monthly) of articles in all areas of the subject such as: civil, mechanical, chemical, electronic and computer engineering as well as production and information technology. The Journal welcomes the submission of manuscripts that meet the general criteria of significance and scientific excellence. Papers will be published by rapid process within 20 days after acceptance and peer review process takes only 7 days. All articles published in Research Inventy will be peer-reviewed.
This document discusses clustering-based ad hoc routing protocols. It introduces the Clusterhead Gateway Switch Routing (CSGR) protocol, which uses a hierarchical network topology with mobile nodes grouped into clusters led by cluster heads. Each node maintains a cluster member table mapping nodes to cluster heads and a routing table to select the next hop towards the destination cluster head. The Least Cluster Change algorithm aims to minimize changes to cluster heads. The document provides an example routing from node 1 to node 12 and compares CSGR to the table-driven DSDV protocol.
DSDV is a proactive routing protocol that extends distance-vector routing for mobile ad hoc networks. It adds sequence numbers to routing table updates to prevent routing loops, and uses damping to hold updates for short-lived changes. Each node periodically broadcasts its full routing table or incremental updates to neighbors. When multiple routes to a destination are received, the route with the highest sequence number is chosen.
Ad-hoc routing protocols allow nodes in a mobile ad hoc network to discover the network topology and route packets between nodes that may not be directly connected. The key goals of ad-hoc routing protocols are to minimize control overhead and processing overhead, enable multihop routing between nodes not in direct transmission range, dynamically maintain routes as nodes move, and prevent routing loops. There are three main categories of ad-hoc routing protocols: table-driven protocols that maintain up-to-date routing tables via periodic updates, on-demand protocols that find routes only when needed via flooding, and hybrid protocols that use aspects of both table-driven and on-demand routing.
DSDV is a proactive routing protocol that uses periodic routing table exchanges and sequence numbers to avoid loops. AODV is a reactive protocol based on DSDV that uses on-demand route discovery with broadcast RREQ and unicast RREP messages to find routes, and maintains routing tables at nodes instead of in packet headers like DSR. Both protocols aim to quickly adapt to dynamic links with low overhead.
Networking interview questions and answersAmit Tiwari
CSMA/CD describes the Ethernet access method where many stations can transmit on the same cable without priority. MAC addresses provide unique identification for devices on a LAN. The three types of LAN traffic are unicast, broadcast, and multicast frames. Unicast frames are intended for a single host, broadcast frames for everyone, and multicast frames for a group. Spanning Tree Protocol (STP) dynamically maintains a loop-free network topology by putting redundant links in a blocking state.
Performance Analysis and Simulation of OLSR Routing Protocol in MANET ijcnac
Mobile ad hoc network is a collection of wireless nodes that are communicate other
nodes (router) without using access point, infrastructure . Mobile ad-hoc network is an
autonomous system that means no need for depaentd other nodes it have own capability
to handle and controlling all funcitionlity, to sending and receiving all information form
one device to other device. MANET has power full feature that controlling itself by
dynamic nature, multihop,low power and configuration of the system. In this paper we
analyzing, simulation and implements the TC messages and HELLO Message by MPR of
OLSR routing performance checked at 200 nodes on Qualnet 5.0.2 simulator. In Qualnet
simulator to simulate and implement the performance of OLSR routing protocols takes
various performance metrics like hello message sent (HMS) , hello message received
(HMR), TC message generated (TCMG), TC message replied (TCMR), TC messages
received on Constant Bit Rate (CBR) using random waypoint model. In this paper check
the performance OLSR routing protocol gives effective performance for lage networks.
DSDV is a proactive routing protocol that uses destination sequence numbers to ensure loop-free routing in mobile ad hoc networks. Each node maintains a routing table with destination addresses, next hops, metrics, and sequence numbers. Nodes periodically broadcast their full routing tables, and also broadcast updates immediately after changes to avoid loops and converge quickly. DSDV addresses issues with traditional distance vector routing through the use of sequence numbers and by damping route fluctuations.
Collision Avoidance Protocol for Inter Vehicular Communication Editor IJCATR
Vehicle to vehicle communication can give us better results by avoiding the major problems in road like collision of vehicles, better route selection in case of traffic congestion, fuel consumption, suitable selection of parking place etc. This paper presents a protocol to avoid the collision of vehicles. High mobility and fast topology changes are the characteristics of Vehicular Ad-hoc Networks (VANETs). To establish the real world environment for VANETs, network simulator NS2 is used. Medium Access Control (MAC) Protocol is used to avoid the collision of transmitted data. The Simulation is done using the proposed Vehicular Ad-hoc On-demand Distance Vector (VAODV) routing protocol, which is a modification of Ad-hoc On-demand Distance Vector (AODV) routing protocol. The proposed VAODV protocol is continuously checks the distance, speed of each vehicle and if it finds that the distance between vehicles is continuously decreasing then in this case it will send a warning textual message to those vehicles that are in accidental situation. Based on this textual information these vehicles will take particular action like vehicle may choose new route if it exists or it may slow down its own speed or it may stop moving by pressing brake. The experimental results are used to find out the performance of VAODV protocol. The performance of VAODV protocol is analyzed with different parameters like end to end delay, throughput, packet delivery ratio, normalized routing load etc.
Collision Avoidance Protocol for Inter Vehicular CommunicationEditor IJCATR
This document presents a collision avoidance protocol for vehicle-to-vehicle communication using inter-vehicular ad-hoc networks (VANETs). The protocol continuously monitors the distance and speed of vehicles and sends a warning message if the distance between vehicles is decreasing and could lead to an accident. It simulates four scenarios of vehicle movement and collision situations using the NS2 network simulator. Performance is analyzed based on metrics like end-to-end delay, throughput, packet delivery ratio, and normalized routing load. The results show that the protocol can effectively detect potential collisions and warn vehicles in time for drivers to react and take evasive actions.
This document discusses routing protocols for mobile ad-hoc networks (MANETs). It introduces several routing protocols including proactive (table-driven) protocols like Destination-Sequenced Distance Vector (DSDV), reactive (on-demand) protocols like Ad-hoc On-Demand Distance Vector (AODV) and Dynamic Source Routing (DSR), and hybrid protocols like Zone Routing Protocol (ZRP) that use both proactive and reactive approaches. For each protocol, it provides a brief overview of the routing approach and algorithm. It also compares the characteristics of proactive, reactive and hybrid routing protocols.
Simulation & comparison of aodv & dsr protocolPrafull Johri
This document summarizes and compares two reactive routing protocols - AODV and DSR. It discusses how NS2 was extended to simulate wireless networks and the two protocols. AODV uses route discovery to find paths, maintains route tables, and can locally repair broken links. DSR also uses route discovery but source routes are carried in packet headers. While AODV has lower initial packet loss, DSR performance improves over time, so either protocol can be used for longer simulations.
Ad-hoc On-Demand Distance Vector (AODV) is a routing protocol for wireless ad-hoc networks that allows nodes to communicate with each other by discovering routes on demand using a broadcast route request and unicast route reply process, where each node maintains a routing table with the next hop and number of hops to each known destination. AODV limits routing overhead by maintaining routes only as long as they are needed and repairing broken routes using route error and hello messages.
This document provides a literature review of research papers on detecting and preventing blackhole attacks in the AODV routing protocol for mobile ad hoc networks (MANETs). It summarizes 9 papers that propose various techniques like using sequence numbers, watchdog mechanisms, and route confirmation messages to identify malicious nodes and increase security. The document outlines the key ideas, results, and potential future work from each paper to improve performance and security against blackhole attacks in AODV routing.
Dynamic Source Routing uses route discovery to find routes between nodes. When a node receives a route request (RREQ) message, if it is the destination it returns a route reply (RREP) with the accumulated route record to the sender. If it is an intermediate node, it discards the RREQ if it has the same ID or finds its own address in the route, otherwise it appends its address to the route record and propagates the RREQ to neighbors to continue finding a path to the destination.
ZRP divides routing into intrazone and interzone routing. Intrazone routing uses a proactive approach to route packets within a node's routing zone. Interzone routing uses a reactive approach where the source node sends route requests to peripheral nodes when the destination is outside its zone. The optimal zone radius depends on factors like mobility and query rates, with smaller radii preferred for higher mobility. ZRP aims to reduce routing overhead through techniques like restricting floods and maintaining multiple routes.
AODV is a reactive routing protocol for mobile ad hoc networks. It uses route discovery and maintenance to dynamically discover and maintain routes. Route discovery uses route request (RREQ) and route reply (RREP) messages to find routes between nodes. Route maintenance uses route error (RERR) messages to notify nodes of link breaks. Each node maintains a routing table with next hop and destination information.
- Mobile ad hoc networks (MANETs) are autonomous systems of wireless nodes that can dynamically change topology as nodes move. Routing must adapt to these changes.
- There are two main categories of routing protocols: table-driven protocols proactively maintain consistent, up-to-date routing tables whereas on-demand protocols only determine routes when needed.
- Examples of protocols include DSDV as a table-driven protocol and AODV as an on-demand protocol, with AODV using route requests and replies to discover routes only when transmitting data.
The document summarizes several routing protocols used in wireless networks. It discusses both table-driven protocols like DSDV and on-demand protocols like AODV. It provides details on how each protocol performs routing and maintains routes. It also outlines some advantages and disadvantages of protocols like DSDV, AODV, DSR, and TORA.
Research Inventy : International Journal of Engineering and Scienceresearchinventy
Research Inventy : International Journal of Engineering and Science is published by the group of young academic and industrial researchers with 12 Issues per year. It is an online as well as print version open access journal that provides rapid publication (monthly) of articles in all areas of the subject such as: civil, mechanical, chemical, electronic and computer engineering as well as production and information technology. The Journal welcomes the submission of manuscripts that meet the general criteria of significance and scientific excellence. Papers will be published by rapid process within 20 days after acceptance and peer review process takes only 7 days. All articles published in Research Inventy will be peer-reviewed.
This document discusses clustering-based ad hoc routing protocols. It introduces the Clusterhead Gateway Switch Routing (CSGR) protocol, which uses a hierarchical network topology with mobile nodes grouped into clusters led by cluster heads. Each node maintains a cluster member table mapping nodes to cluster heads and a routing table to select the next hop towards the destination cluster head. The Least Cluster Change algorithm aims to minimize changes to cluster heads. The document provides an example routing from node 1 to node 12 and compares CSGR to the table-driven DSDV protocol.
DSDV is a proactive routing protocol that extends distance-vector routing for mobile ad hoc networks. It adds sequence numbers to routing table updates to prevent routing loops, and uses damping to hold updates for short-lived changes. Each node periodically broadcasts its full routing table or incremental updates to neighbors. When multiple routes to a destination are received, the route with the highest sequence number is chosen.
Ad-hoc routing protocols allow nodes in a mobile ad hoc network to discover the network topology and route packets between nodes that may not be directly connected. The key goals of ad-hoc routing protocols are to minimize control overhead and processing overhead, enable multihop routing between nodes not in direct transmission range, dynamically maintain routes as nodes move, and prevent routing loops. There are three main categories of ad-hoc routing protocols: table-driven protocols that maintain up-to-date routing tables via periodic updates, on-demand protocols that find routes only when needed via flooding, and hybrid protocols that use aspects of both table-driven and on-demand routing.
DSDV is a proactive routing protocol that uses periodic routing table exchanges and sequence numbers to avoid loops. AODV is a reactive protocol based on DSDV that uses on-demand route discovery with broadcast RREQ and unicast RREP messages to find routes, and maintains routing tables at nodes instead of in packet headers like DSR. Both protocols aim to quickly adapt to dynamic links with low overhead.
Networking interview questions and answersAmit Tiwari
CSMA/CD describes the Ethernet access method where many stations can transmit on the same cable without priority. MAC addresses provide unique identification for devices on a LAN. The three types of LAN traffic are unicast, broadcast, and multicast frames. Unicast frames are intended for a single host, broadcast frames for everyone, and multicast frames for a group. Spanning Tree Protocol (STP) dynamically maintains a loop-free network topology by putting redundant links in a blocking state.
Performance Analysis and Simulation of OLSR Routing Protocol in MANET ijcnac
Mobile ad hoc network is a collection of wireless nodes that are communicate other
nodes (router) without using access point, infrastructure . Mobile ad-hoc network is an
autonomous system that means no need for depaentd other nodes it have own capability
to handle and controlling all funcitionlity, to sending and receiving all information form
one device to other device. MANET has power full feature that controlling itself by
dynamic nature, multihop,low power and configuration of the system. In this paper we
analyzing, simulation and implements the TC messages and HELLO Message by MPR of
OLSR routing performance checked at 200 nodes on Qualnet 5.0.2 simulator. In Qualnet
simulator to simulate and implement the performance of OLSR routing protocols takes
various performance metrics like hello message sent (HMS) , hello message received
(HMR), TC message generated (TCMG), TC message replied (TCMR), TC messages
received on Constant Bit Rate (CBR) using random waypoint model. In this paper check
the performance OLSR routing protocol gives effective performance for lage networks.
DSDV is a proactive routing protocol that uses destination sequence numbers to ensure loop-free routing in mobile ad hoc networks. Each node maintains a routing table with destination addresses, next hops, metrics, and sequence numbers. Nodes periodically broadcast their full routing tables, and also broadcast updates immediately after changes to avoid loops and converge quickly. DSDV addresses issues with traditional distance vector routing through the use of sequence numbers and by damping route fluctuations.
Collision Avoidance Protocol for Inter Vehicular Communication Editor IJCATR
Vehicle to vehicle communication can give us better results by avoiding the major problems in road like collision of vehicles, better route selection in case of traffic congestion, fuel consumption, suitable selection of parking place etc. This paper presents a protocol to avoid the collision of vehicles. High mobility and fast topology changes are the characteristics of Vehicular Ad-hoc Networks (VANETs). To establish the real world environment for VANETs, network simulator NS2 is used. Medium Access Control (MAC) Protocol is used to avoid the collision of transmitted data. The Simulation is done using the proposed Vehicular Ad-hoc On-demand Distance Vector (VAODV) routing protocol, which is a modification of Ad-hoc On-demand Distance Vector (AODV) routing protocol. The proposed VAODV protocol is continuously checks the distance, speed of each vehicle and if it finds that the distance between vehicles is continuously decreasing then in this case it will send a warning textual message to those vehicles that are in accidental situation. Based on this textual information these vehicles will take particular action like vehicle may choose new route if it exists or it may slow down its own speed or it may stop moving by pressing brake. The experimental results are used to find out the performance of VAODV protocol. The performance of VAODV protocol is analyzed with different parameters like end to end delay, throughput, packet delivery ratio, normalized routing load etc.
Collision Avoidance Protocol for Inter Vehicular CommunicationEditor IJCATR
This document presents a collision avoidance protocol for vehicle-to-vehicle communication using inter-vehicular ad-hoc networks (VANETs). The protocol continuously monitors the distance and speed of vehicles and sends a warning message if the distance between vehicles is decreasing and could lead to an accident. It simulates four scenarios of vehicle movement and collision situations using the NS2 network simulator. Performance is analyzed based on metrics like end-to-end delay, throughput, packet delivery ratio, and normalized routing load. The results show that the protocol can effectively detect potential collisions and warn vehicles in time for drivers to react and take evasive actions.
Secure multipath routing scheme using keyijfcstjournal
Multipath routing in WSN has been a long wish in security scenario where nodes on next-hop may be
targeted to compromise. Many proposals of Multipath routing has been proposed in ADHOC Networks but
under constrained from keying environment most seems ignorant. In WSN where crucial data is reported by
nodes in deployment area to their securely located Sink, route security has to be guaranteed. Under
dynamic load and selective attacks, availability of multiple secure paths is a boon and increases the
attacker efforts by many folds. We propose to build a subset of neighbors as our front towards destination
node. We also identified forwarders for query by base station. The front is optimally calculated to maintain
the security credential and avail multiple paths. According to our knowledge ours is a novel secure
multipath routing protocol for WSN. We established effectiveness of our proposal with mathematical
analysis.
Quality of service Routing Using Stable Nodes in Mobile Ad hoc Networksijceronline
An efficient and secured routing protocol design is the vital concern for mobile ad hoc networks in view of major problems raising on security issues and loss of the network resources is due to changes within the connections of the network like Node failures, link breakages in the network. Our proposed scheme enhances the secured and reliable transmission of data, which also improves the network constancy, efficient packet delivery ratio and network life time by integrating through the AODV Routing protocol. It unites the authentication, stable routes and signal strength of the nodes to attain the secure and reliable transmission of data through nodes.
The document discusses designing energy efficient routing protocols for mobile ad hoc networks (MANETs). It outlines several key points:
- MANETs are infrastructureless wireless networks formed by mobile nodes without centralized administration. Routing in MANETs is challenging due to the dynamic topology.
- Several routing protocols for MANETs are studied, including AODV, DSR and protocols that optimize power consumption like EPAR.
- The performance of these protocols is evaluated using MATLAB simulations based on metrics like packet delivery ratio, delay and throughput. The goal is to design a protocol that maximizes network lifetime by choosing routes with minimum total transmission power while ensuring nodes have sufficient battery capacity.
The document discusses ad hoc networks and routing protocols. It begins with an introduction to mobile ad hoc networks (MANETs), including their characteristics and applications. Several categories of routing protocols are described, including table-driven protocols like Destination Sequenced Distance Vector Routing (DSDV) and Cluster-head Gateway Switch Routing (CGSR), as well as source-initiated on-demand protocols like Dynamic Source Routing (DSR). The document provides examples and explanations of how these different protocols perform routing in MANETs.
Engineering Research Publication
Best International Journals, High Impact Journals,
International Journal of Engineering & Technical Research
ISSN : 2321-0869 (O) 2454-4698 (P)
www.erpublication.org
ER Publication,
IJETR, IJMCTR,
Journals,
International Journals,
High Impact Journals,
Monthly Journal,
Good quality Journals,
Research,
Research Papers,
Research Article,
Free Journals, Open access Journals,
erpublication.org,
Engineering Journal,
Science Journals,
AODV Improvement by Modification at Source Node and Securing It from Black Ho...IJERA Editor
MANETS suffer from constraints in power, storage and computational resources ,as a result, they are more
vulnerable to various communications security related attacks. therefore we attempt to focus on analyzing and
improving the security of routing protocol for MANETS viz. the Ad hoc On Demand Distance Vector
(AODV)routing protocol. We propose modifications to the AODV we propose an algorithm to counter the
Black hole attack on the routing protocols in MANETs. All the routes has unique sequence number and the
malicious node has the highest Destination Sequence number and it is the first RREP to arrive. So the
comparison is made only to the first entry in the table without checking other entries in the table
The document discusses secure zone routing protocol (SZRP) in mobile ad hoc networks. SZRP combines the advantages of proactive and reactive routing approaches while adding security mechanisms. It uses public/private key pairs to provide packet integrity and data confidentiality. Each node is certified by a trusted certification authority which issues certificates containing the node's public keys and identity. SZRP aims to securely route packets within and between zones in the dynamic ad hoc network environment.
This document summarizes a research paper that proposes a reliable node-disjoint multipath routing protocol for mobile ad-hoc networks (MANETs). The protocol aims to determine all available reliable node-disjoint routes from the source to destination with minimum overhead during route discovery. It selects primary and backup routes based on link quality and route expiration time. If the primary path fails, it uses the next available backup route. The performance is evaluated using simulations in NS-2, which show it reduces packet drop and delay, increasing packet delivery ratio.
This document proposes a new approach for a survivable multicast routing protocol in mobile ad-hoc networks. It aims to ensure sub-source survivability and reduce network maintenance costs by replacing the main source with sub-sources. The proposed solution selects a new sub-source in the absence of a sub-source to continue multicasting data. It uses route request and route reply packets for nodes to dynamically discover routes and transfer data between each other in the infrastructure-less mobile ad-hoc network.
A Mobile Ad-hoc network is a set of mobile terminals moving in different directions at different
speed being wirelessly connected to each-other. In this paper we study the proactive Link State Routing
Protocol – OLSR, which uses hello and topology control (TC) messages to find then distribute link state
data throughout the mobile ad hoc network. Individual nodes use this topology data to calculate next hop
destinations for all nodes within the network using shortest hop forwarding paths. We then suggest ways
by which the existing algorithm can be optimized in terms of delay, throughput, power consumption, jitter
etc. Finally we summarize the applications of OLSR.
Analysis of Blackhole Attack in AODV and DSR IJECEIAES
This document analyzes the blackhole attack in the AODV and DSR routing protocols for mobile ad hoc networks (MANETs). It first provides background on MANETs and describes common routing protocols like AODV and DSR. It then explains what a blackhole attack is, where a malicious node advertises the best route to destinations but drops packets instead of forwarding them. Through simulation, the document evaluates the performance of AODV and DSR under blackhole attacks, finding how the attack disrupts the operation of MANET routing protocols.
Elliptic Curve Cryptography Based Data Transmission against Blackhole Attack ...IJECEIAES
This document discusses securing data transmission against blackhole attacks in mobile ad hoc networks (MANETS) using elliptic curve cryptography (ECC) and the Adhoc On Demand Multipath Distance Vector (AOMDV) routing protocol. It implements ECC to encrypt data packets at the source node before transmission over AOMDV's multiple paths. The performance of this secured approach is analyzed under varying numbers of blackhole attacker nodes based on metrics like average throughput, packet delivery ratio, average end-to-end delay, and normalized routing load. Simulation results show the encrypted packets being transferred between nodes via AOMDV are protected against blackhole attacks.
International Journal of Computational Engineering Research(IJCER)ijceronline
International Journal of Computational Engineering Research (IJCER) is dedicated to protecting personal information and will make every reasonable effort to handle collected information appropriately. All information collected, as well as related requests, will be handled as carefully and efficiently as possible in accordance with IJCER standards for integrity and objectivity.
Routing Protocols in MANET's by Ashok PanwarAshok Panwar
The document discusses routing protocols for mobile ad hoc networks (MANETs). It provides an overview of the key challenges in MANET routing due to the dynamic and distributed nature of the networks. It also summarizes two popular on-demand (reactive) routing protocols for MANETs - Dynamic Source Routing (DSR) and Ad Hoc On-Demand Distance Vector (AODV) routing. DSR uses source routing and route maintenance, while AODV uses hop-by-hop routing, destination sequencing numbers, and periodic route updates to avoid routing loops and adapt to topological changes. Both protocols reduce overhead by only discovering routes on-demand when needed.
Distributed Routing Protocol for Different Packet Size Data Transfer over Wir...IRJET Journal
This document discusses a proposed technique for efficient data transfer of different packet sizes over wireless sensor networks. The technique uses a combination of routing protocols, including AODV, DSDV, and DSR. It aims to improve quality of service for data transmission by using proper packet formatting and compression techniques. The objective is to develop a reliable architecture that can handle both proactive and reactive routing approaches to efficiently manage routing and transmission of data between neighboring nodes. The proposed technique will be implemented and evaluated using a network simulator.
Migrating packet dropping in mobile ad hoc network based on modified ack-base...Alexander Decker
This document discusses migrating packet dropping in mobile ad-hoc networks using a modified ACK-based authentication scheme. It begins by introducing mobile ad-hoc networks and some of the security challenges they face, such as packet dropping attacks. It then discusses existing ACK-based authentication schemes and their limitations, such as generating a large overhead and having ambiguity when nodes refuse acknowledgments. The document proposes a modified ACK-based scheme that uses a secure channel to overcome these limitations and minimize packet dropping. It evaluates the proposed scheme through simulation experiments and finds it improves performance metrics like packet delivery ratio and throughput compared to not using a secure channel. In conclusion, the modified scheme is presented as a way to enhance node authentication and reduce packet dropping in mobile
Similar to Secure Routing with AODV Protocol for MANET by Ashok Panwar (20)
Simulation and Performance Analysis of AODV using NS 2.34 by Ashok PanwarAshok Panwar
This document discusses the Ad-hoc On-demand Distance Vector (AODV) routing protocol. It defines AODV as a reactive, table-driven routing protocol for mobile ad-hoc networks. The key principles of AODV are described, including using routing tables, route requests (RREQs), route replies (RREPs), and route error (RERR) messages for route discovery and maintenance. The document then outlines how to simulate AODV using the ns-2 network simulator, including experimental setup parameters, performance metrics, and Tcl configuration details. Simulation results analyzing the effects of varying node speed, pause time, maximum connections, and number of nodes on performance metrics are also summarized.
Secure Mail Application's by Ashok PanwarAshok Panwar
- Two early secure email systems were PEM (Private Enhanced Mail) and PGP (Pretty Good Privacy). PGP became the de facto standard.
- PGP uses algorithms like IDEA for encryption, RSA for key exchange and signatures, and MD5 for hashing. Version 2.6.3i from the 1990s is often used to explain basic PGP operations.
- PGP can encrypt files locally using a passphrase to derive an IDEA encryption key via MD5 hashing. It can also encrypt emails using a randomly generated IDEA session key which is encrypted with the recipient's RSA public key.
Quality of Information and Malware by Ashok PanwarAshok Panwar
1. The document discusses information security from an engineering and company perspective. It describes information as all the data a company owns, manages, and exchanges both internally and externally.
2. It explains that Claude Shannon's studies in the 1940s helped quantify information and define concepts like entropy and perfect secrecy. These concepts are important for analyzing classic cryptosystems but are not the focus of the document.
3. The document states that a company's information is its most valuable asset, as loss of data would make it difficult for the company to recover and remain competitive. Proper information security policies are vital for protection.
Performance Analysis of AODV Protocol on Black-Hole Attack by Ashok PanwarAshok Panwar
The document discusses the performance analysis of the AODV routing protocol under black hole attacks. It begins with an introduction to AODV and why it is used. It then discusses security issues with AODV and different types of attacks it is susceptible to, focusing on distributed denial of service (DDoS) and black hole attacks. Black hole attacks are explained in more detail, outlining how they work by falsely replying to route requests and dropping packets. The document concludes by stating the author's intention to analyze AODV performance under black hole attacks using a network simulator.
The document discusses network management and summarizes the key aspects. It describes how network management involves five functional areas: fault management, configuration management, security management, performance management, and accounting management. It also summarizes some of the common network management protocols like SNMP and how they are used to monitor devices and exchange information.
Introduction to Security Management by Ashok PanwarAshok Panwar
This document provides an introduction to computer security and cryptography presented by Ashok Panwar. It discusses logical and physical data protection, including authentication protocols, security policies, and physical security procedures. It also covers risk analysis and strategies for determining how much to invest in security protection based on calculating the probability and impact of risks versus the cost of prevention measures. Specific security models and policies are defined, such as the Bell-LaPadula and Clark-Wilson models and access control and flow control policies.
Firewalls & Trusted Systems by Ashok PanwarAshok Panwar
This document discusses firewalls and trusted systems. It begins by outlining firewall design principles, characteristics, and types including packet filtering routers, application-level gateways, and circuit-level gateways. It also discusses common firewall configurations and the concept of trusted systems using a reference monitor to enforce security rules.
This document summarizes Ashok Panwar's presentation on ad hoc networks and the AODV routing protocol. It discusses key characteristics of ad hoc networks such as being peer-to-peer, multi-hop, dynamic, and self-configuring. It also outlines commercial opportunities for ad hoc networks in applications like conferencing, emergency services, and embedded computing. The presentation then covers technical challenges, an overview of on-demand routing protocols including AODV, and methods for integrating ad hoc networks with the Internet such as using gateway nodes and address autoconfiguration. It concludes by discussing the state of ad hoc network research.
HijackLoader Evolution: Interactive Process HollowingDonato Onofri
CrowdStrike researchers have identified a HijackLoader (aka IDAT Loader) sample that employs sophisticated evasion techniques to enhance the complexity of the threat. HijackLoader, an increasingly popular tool among adversaries for deploying additional payloads and tooling, continues to evolve as its developers experiment and enhance its capabilities.
In their analysis of a recent HijackLoader sample, CrowdStrike researchers discovered new techniques designed to increase the defense evasion capabilities of the loader. The malware developer used a standard process hollowing technique coupled with an additional trigger that was activated by the parent process writing to a pipe. This new approach, called "Interactive Process Hollowing", has the potential to make defense evasion stealthier.
Securing BGP: Operational Strategies and Best Practices for Network Defenders...APNIC
Md. Zobair Khan,
Network Analyst and Technical Trainer at APNIC, presented 'Securing BGP: Operational Strategies and Best Practices for Network Defenders' at the Phoenix Summit held in Dhaka, Bangladesh from 23 to 24 May 2024.
Honeypots Unveiled: Proactive Defense Tactics for Cyber Security, Phoenix Sum...APNIC
Adli Wahid, Senior Internet Security Specialist at APNIC, delivered a presentation titled 'Honeypots Unveiled: Proactive Defense Tactics for Cyber Security' at the Phoenix Summit held in Dhaka, Bangladesh from 23 to 24 May 2024.
Discover the benefits of outsourcing SEO to Indiadavidjhones387
"Discover the benefits of outsourcing SEO to India! From cost-effective services and expert professionals to round-the-clock work advantages, learn how your business can achieve digital success with Indian SEO solutions.
Secure Routing with AODV Protocol for MANET by Ashok Panwar
1. Secure Routing with AODV
Protocol for Mobile Ad Hoc
Networks (MANET’s)
Presented by:-
Ashok Panwar
Technical Officer in ECIL (NPCIL)
Tarapur , Mumbai.
2. Papers Reviewed
Perkins, C.E.; Royer, E.M,”Ad-hoc On-Demand Distance Vector
Routing,” Proceedings of the Second IEEE Workshop on Mobile
Computing Systems and Applications, WMCSA ’99
Pirzada, A.A.; McDonald, C,”Secure Routing with the AODV Protocol,”
Proceedings of the Asia-Pacific Conference on Communications, Oct 3-5,
2005
Bhargava, S.; Agrawal, D.P.,”Security Enhancements in AODV protocol
for Wireless Ad Hoc Networks,” Vehicular Technology Conference Oct 7-
11, 2004, IEEE VTS 54th Vol. 4
Yuxia Lin, A. Hamed Mohsenian Rad, Vincent W. S. Wong, Joo-Han
Song,”Experimental Comparisons between SAODV and AODV Routing
Protocols,” Proceedings of the 1st ACM workshop on Wireless Multimedia
Networking and Performance modeling, WMuNeP Oct 2005
2
Presented by:- Ashok Panwar
Technical Officer in ECIL
3. Outline
Mobile Ad Hoc Networks (MANET)
Applications
Security Design Issues in MANET
Motivation
Traditional AODV
Secured AODV
Experimental Comparisons
Closing Remarks
3
Presented by:- Ashok Panwar
Technical Officer in ECIL
4. Mobile Ad Hoc Networks
A collection of wireless mobile hosts forming a temporary network without the
aid of any established infrastructure.
Significant Features:
Dynamic topology of interconnections
No administrator
Short transmission range- routes between nodes has one or more hops
Nodes act as routers or depend on others for routing
movement of nodes invalidates topology information
4
Presented by:- Ashok Panwar
Technical Officer in ECIL
5. Mobile Ad Hoc Networks (cont.)
The network topology can change any time because of node
mobility and nodes may become disconnected very frequently.
5
Presented by:- Ashok Panwar
Technical Officer in ECIL
6. Mobile Ad Hoc Networks (cont.)
Host A and C are out of range from each other’s wireless transmitter.
While exchanging packets, they use routing services of host B.
B is within the transmission range of both of them.
Routing: Source -> Destination
6
Presented by:- Ashok Panwar
Technical Officer in ECIL
7. Applications of MANET
Useful where geographical or terrestrial constrains
demand totally distributed network without fixed base
station.
Military Battlefields
Disaster and Rescue Operations
Conferences
Peer to Peer Networks
7
Presented by:- Ashok Panwar
Technical Officer in ECIL
8. Security Design Issues in MANET
Do not have any centrally administered secure
routers.
Attackers from inside or outside can easily exploit the
network.
Passive eavesdropping, data tampering, active interfering,
leakage of secret information, DoS etc.
Open peer-to-peer architecture.
Shared Wireless Medium.
Dynamic Topology.
8
Presented by:- Ashok Panwar
Technical Officer in ECIL
9. Motivation
Ad Hoc networks are challenged due to
Nodes are constantly mobile
Protocols implemented are co-operative in nature
Lack of fixed infrastructure and central concentration point where IDS
can collect audit data
One node can be compromised in a way that the incorrect and
malicious behaviour cannot be directly noted at all.
Well-established traditional security approaches to routing are
inadequate in MANET.
9
Presented by:- Ashok Panwar
Technical Officer in ECIL
10. Traditional AODV
Ad Hoc On Demand Distance Vector Routing Protocol
Reactive Protocol: discovers a route on demand.
Nodes do not have to maintain routing information.
Route Discovery
Route Maintenance
Hello messages:
used to determine local connectivity.
can reduce response time to routing requests.
can trigger updates when necessary.
10
Presented by:- Ashok Panwar
Technical Officer in ECIL
11. Traditional AODV – Route Discovery
If a source needs a route to a destination for which it does not already have
a route in its cache:
Source broadcasts Route Request (RREQ) message for
specified destination
Intermediate node:
Returns a route reply packet (RREP) (if route information about
destination in its cache), or
forwards the RREQ to its neighbors (if route information about
destination not in its cache).
If cannot respond to RREQ, increments hop count, saves info to
implement a reverse path set up, to use when sending reply
(assumes bidirectional link…)
11
Presented by:- Ashok Panwar
Technical Officer in ECIL
12. Traditional AODV – RREQ
RREQ packet contains: destination
and source IP address, broadcast ID,
source node’s sequence number and
destination node’s sequence number.
Node 1 wants to send data packet to node
7. Node 6 knows a current route to node
7. Node 1 sends a RREQ packet to its
neighbors.
Source_addr =1
dest_addr =7
broadcast_id = broadcast_id +1
source_sequence_# =
source_sequence_# + 1
dest_sequence_# = last dest_sequence_#
for node 7
Type Flag Resvd hopcnt
Broadcast_id
Dest_addr
Dest_sequence_#
Source_addr
Source_Sequence_#
12
Presented by:- Ashok Panwar
Technical Officer in ECIL
13. Traditional AODV (RREQ)
Nodes 2 and 4 verify that this is a new RREQ (source_sequence_# is not stale) with
respect to the reverse route to node 1.
Forward the RREQ, and increment hop_cnt in the RREQ packet.
RREQ reaches node 6 from node 4, which knows a route to 7.
Node 6 verify that the destination sequence number is less than or equal to the
destination sequence number it has recorded for node 7.
Nodes 3 and 5 will forward the RREQ packet to node 6, but it recognizes the
packets as duplicates.
13
Presented by:- Ashok Panwar
Technical Officer in ECIL
14. Traditional AODV (RREP)
Node 6 has a route to destination. It sends a route reply RREP to the
neighbor that sent the RREQ packet.
Intermediate nodes propagate RREP towards the source using cached
reverse route entries.
Other RREP packets discarded unless, dest_seq_# is higher than the
pervious, or same but hop_cnt is smaller.
Cached reverse routes timeout in nodes that do not see RREP packet.
Type Flag prsz hopcnt
Dest_addr
Dest_sequence_#
Source_addr
lifetime
14
Presented by:- Ashok Panwar
Technical Officer in ECIL
15. Traditional AODV (RREP)
Node 6 sends RREP to node 4
Source_addr=1, dest_addr=7, dest_sequence_# = maximum (sequence no.
stored for node 7, dest_sequence_# in RREQ), hop_cnt =1.
Node 4 finds out it is a new route reply and propagates the RREP packet to
Node 1.
15
Presented by:- Ashok Panwar
Technical Officer in ECIL
16. Approach 1 : Secure AODV
Vulnerability issues of AODV (due to intermediate
nodes):
Deceptive incrementing of sequence number
Deceptive decrementing of hop count
To secure AODV, approach 1 divided security issues
into 3 categories:
Key Exchange
Secure Routing
Data Protection
16
Presented by:- Ashok Panwar
Technical Officer in ECIL
17. Approach 1 : Secure AODV (cont.)
Key Exchange:
All nodes before entering the network procure a one-time
public and private key pair from CA and CA’s public key.
After that, nodes can generate a Group Session Key
between immediate neighbors using a suitable ‘Group
keying protocol’.
These session keys are used for securing the routing
process and data flow.
Thus authentication, confidentiality and integrity is
assured.
17
Presented by:- Ashok Panwar
Technical Officer in ECIL
18. Approach 1 : Secure AODV (cont.)
Secure Routing (RREQ):
Node ‘x’ desiring to establish communication with ‘y’, establishes a group session key
Kx between its immediate neighbors.
Creates RREQ packet, encrypts using Kx and broadcasts.
Intermediate recipients that share Kx decrypt RREQ and modify.
Intermediate nodes that do not share Kx initiate ‘group session key exchange protocol’
with the immediate neighbors.
Intermediate nodes encrypt RREQ packet using the new session key and rebroadcast.
18
Presented by:- Ashok Panwar
Technical Officer in ECIL
19. Approach 1 : Secure AODV (cont.)
Secure Routing (RREP)
In response to RREQ, ‘y’ creates RREP.
RREP is encrypted using the last Group session key that
was used to decrypt RREQ and is unicast back to the
original sender.
If any of the intermediate nodes has moved out of wireless
range, a new group session key is established.
Recipient nodes that share the forward group session key
decrypt RREP and modify.
RREP is then encrypted using backward group session key
and unicast to ‘x’.
19
Presented by:- Ashok Panwar
Technical Officer in ECIL
20. Approach 1 : Secure AODV (cont.)
Data Protection
Node ‘x’ desiring to establish end-to-end secure data channel, first establishes
a session key Kxy with ‘y’.
‘x’ symmetrically encrypts the data packet using Kxy and transmits it over the
secure route.
Intermediate nodes forward the packet in the intended direction.
Node ‘y’ decrypts the encrypted data packet using Kxy.
20
Presented by:- Ashok Panwar
Technical Officer in ECIL
21. Security Analysis for Approach 1
Authorized nodes to perform route computation and discovery.
Routing control packets authenticated and encrypted by each
forwarding node.
Minimal exposure of network topology.
Routing information is encrypted, an adversary will gain no
information on the network topology.
Detection of spoofed routing messages.
Initial authentication links a number of identities to each node’s private
key.
Detection of fabricated routing messages.
To fabricate a routing message session key needs to be compromised.
Prevent redirection of routes from shortest paths.
Routing packets accepted only from authenticated nodes, adversary
cannot inject anything unless an authorized node first authenticates it.
21
Presented by:- Ashok Panwar
Technical Officer in ECIL
22. Approach 2: Secure AODV (cont.)
Defines two types of attacks:
Internal & external
Compromised & Selfish nodes
Malicious nodes
To handle the attacks, this approach suggests two
models:
Intrusion Detection Model (IDM)
Intrusion Response Model (IRM)
22
Presented by:- Ashok Panwar
Technical Officer in ECIL
23. Approach 2: Secure AODV (cont.)
Vulnerability issues of AODV (due to internal
attacks):
Distributed false route request
Denial of service
Destination is compromised
Impersonation
23
Presented by:- Ashok Panwar
Technical Officer in ECIL
24. Approach 2: Secure AODV (cont.)
IDM
Each node employs IDM that
utilizes the neighborhood
information to detect
misbehaviors of its neighbors.
When Misbehavior count >
threshold for a node, information
is sent to other nodes about
misbehaving node.
They in turn check their local
MalCount, and add the result to
the initiator’s response.
IDM is present on all the nodes
and monitors and analyzes
behavior of its neighbors to
detect if any node is
compromised.
Secure Communication
Global Response
Intrusion Response Model
(IRM)
Mal
Count
>
Threshol
d
Intrusion Detection Model
(IDM)
Data Collection
24
Presented by:- Ashok Panwar
Technical Officer in ECIL
25. Approach 2: Secure AODV (cont.)
IDM
Distributed False Route Request
Malicious node may generate frequent unnecessary
route requests i.e. false route message.
If done from different radio range it is difficult to
identify the malicious node (RREQ are broadcasts).
When a node receives RREQ > threshold count by a
specific source for a destination in a particular time
interval- tinterval, the node is declared malicious.
25
Presented by:- Ashok Panwar
Technical Officer in ECIL
26. Approach 2: Secure AODV (cont.)
IDM
Denial of Service
A malicious node may launch DoS attack by
transmitting false control packets and using the entire
network resources.
Other nodes are deprived of these resources.
It can be identified if a node is generating the control
packets that is more than threshold count in a particular
time interval – tfrequency.
26
Presented by:- Ashok Panwar
Technical Officer in ECIL
27. Approach 2: Secure AODV (cont.)
IDM - Destination is Compromised
A destination might not reply if it is:
Not in the network
Overloaded
Did not receive route request
Malicious
It is identified when a source does not receive reply from
destination in a particular time interval – twait.
Neighbors generate ‘Hello’ packets to determine connectivity.
If a node is in network and does not respond to RREQ
destined for it, it is identified as malicious.
27
Presented by:- Ashok Panwar
Technical Officer in ECIL
28. Approach 2: Secure AODV (cont.)
IDM
Impersonation
If Sender encrypts the packet with its private
key and other nodes decrypt with public key of
sender , this attack can be avoided.
If Receiver is not able to decrypt the packet, the
sender might not be the real source and packet
will be dropped.
28
Presented by:- Ashok Panwar
Technical Officer in ECIL
29. Approach 2: Secure AODV (cont.)
Intrusion Response Model ( IRM )
A node ‘x’ identifies that another node ‘m’ is compromised when
malcount for that node ‘m’ increases beyond threshold value.
‘x’ propagates to entire network by transmitting ‘Mal’ packet.
If another node ‘y’ suspects node ‘m’, it reports its suspicion to the
network and transmits ‘ReMal’ packet.
If two or more nodes report about a particular node , ‘Purge’ packet is
transmitted to isolate malicious node from the network.
All nodes having a route through the compromised node look for
newer routes.
All packets received from the compromised node are dropped.
29
Presented by:- Ashok Panwar
Technical Officer in ECIL
30. Approach 3: Secure AODV
SAODV
Vulnerability issues of AODV:
Message Tampering Attack [compromised node]
E.g. Hop count made 0 by attacker node
E.g. Hop count made infinite by selfish node.
Message Dropping Attack [selfish node]
Message Replay (wormhole) Attack [malicious node]
Security Requirements for AODV:
Source Authentication
Neighbor Authentication
Message Integrity
Access Control
30
Presented by:- Ashok Panwar
Technical Officer in ECIL
31. Approach 3: Secure AODV (cont.)
Source Authentication
Receiver should be able to confirm the identity of the source.
Neighbor Authentication
Receiver should be able to confirm the identify of the sender (one-hop
previous node)
Message Integrity
Receiver should be able to verify that content of a message has not be
altered either maliciously or accidentally in transit.
Access Control
It is necessary to ensure that mobile nodes seeking to gain access to the
network have the appropriate access rights.
31
Presented by:- Ashok Panwar
Technical Officer in ECIL
32. Approach 3: Secure AODV (cont.)
Route Discovery
Source node selects a random seed number & sets
Maximum hop-count (MHC) value.
Using hash function h, source computes hash value as
h(seed) and Top_Hash as hMHC
(seed).
Intermediate node checks if Top_Hash = hMHC-Hop_Count
(Hash).
Before rebroadcasting RREQ, increments hop-count field by 1 in
RREQ header.
Computes new Hash value by hashing the old value, h(Hash).
32
Presented by:- Ashok Panwar
Technical Officer in ECIL
33. Approach 3: Secure AODV (cont.)
Route Discovery
Except for hop-count field and hhop-count
(seed), all
other fields of RREQ are non-mutable.
Hence can be authenticated by verifying the
signature in RREQ.
Destination generates RREP on receiving RREQ.
33
Presented by:- Ashok Panwar
Technical Officer in ECIL
34. Closing Remarks
Approach 1
Authors proposed Approach 1 for both secure routing and data protection
No Experiments have been discussed.
Approach 2
No Data Security Provided
Routing load of a network increases as malicious nodes generate False Control
Messages.
After implementing, decreases routing load by identifying malicious node and
isolating them from the network.
Approach 3
Ensure both integrity of data and control packets by using hash functions.
Source, Neighbor authentication and access control are ensured by digital
signatures.
Many indoor and outdoor experiments have been performed.
More efficient.
34
Presented by:- Ashok Panwar
Technical Officer in ECIL