By Jannatul Ferdousi M.TECH(MCNT) Roll no-1431260008 GNIT With guidance of Mr.Dipankar.

Slides:



Advertisements
Similar presentations
Dynamic Source Routing (DSR) algorithm is simple and best suited for high mobility nodes in wireless ad hoc networks. Due to high mobility in ad-hoc network,
Advertisements

1 A Review of Current Routing Protocols for Ad-Hoc Mobile Wireless Networks By Lei Chen.
Mitigating Routing Misbehavior in Mobile Ad-Hoc Networks Reference: Mitigating Routing Misbehavior in Mobile Ad Hoc Networks, Sergio Marti, T.J. Giuli,
Multicasting in Mobile Ad Hoc Networks Ravindra Vaishampayan Department of Computer Science University of California Santa Cruz, CA 95064, U.S.A. Advisor:
Collaborative Attacks on Routing Protocols in Ad hoc Networks Neelima Gupta University of Delhi India.
Intrusion Detection for Black Hole and Gray Hole in MANETs.
MANETs Routing Dr. Raad S. Al-Qassas Department of Computer Science PSUT
Edith C. H. Ngai1, Jiangchuan Liu2, and Michael R. Lyu1
Secure Routing and Intrusion Detection For Mobile Ad Hoc Networks Secure Routing and Intrusion Detection For Mobile Ad Hoc Networks Anand Patwardhan Jim.
On Security Study of Two Distance Vector Routing Protocols for Ad Hoc Networks Weichao Wang, Yi Lu, Bharat Bhargava CERIAS and Department of Computer Sciences.
1 Spring Semester 2007, Dept. of Computer Science, Technion Internet Networking recitation #4 Mobile Ad-Hoc Networks AODV Routing.
Nov.6, 2002 Secure Routing Protocol for Ad Hoc Networks Li Xiaoqi.
Effects of Applying Mobility Localization on Source Routing Algorithms for Mobile Ad Hoc Network Hridesh Rajan presented by Metin Tekkalmaz.
ITIS 6010/8010 Wireless Network Security Dr. Weichao Wang.
Routing Security in Ad Hoc Networks
Milano, 4-5 Ottobre 2004 IS-MANET The Virtual Routing Protocol for Ad Hoc Networks ISTI – CNR S. Chessa.
Study of Distance Vector Routing Protocols for Mobile Ad Hoc Networks Yi Lu, Weichao Wang, Bharat Bhargava CERIAS and Department of Computer Sciences Purdue.
Mobile and Wireless Computing Institute for Computer Science, University of Freiburg Western Australian Interactive Virtual Environments Centre (IVEC)
BLACK HOLE IN MANET SUBMITTED TO:--SUBMITTED BY:-- Dr. SAPNA GAMBHIRINDRAJEET KUMAR CSE DEPTT.MNW/887/2K11.
SOAR: Simple Opportunistic Adaptive Routing Protocol for Wireless Mesh Networks Authors: Eric Rozner, Jayesh Seshadri, Yogita Ashok Mehta, Lili Qiu Published:
© Janice Regan, CMPT 128, CMPT 371 Data Communications and Networking BGP, Flooding, Multicast routing.
A Simple and Effective Cross Layer Networking System for Mobile Ad Hoc Networks Wing Ho Yuen, Heung-no Lee and Timothy Andersen.
CBRP: A Cluster-based Routing Protocol for Mobile Ad hoc Networks Authors : Mingliang Jiang Jinyang Li Y.C. Tay Presented by: Hiren Shah.
Institut für Betriebssysteme und Rechnerverbund Technische Universität Braunschweig Multi hop Connectivity in Mobile Ad hoc Networks (MANETs) Habib-ur.
1 Spring Semester 2009, Dept. of Computer Science, Technion Internet Networking recitation #3 Mobile Ad-Hoc Networks AODV Routing.
Securing AODV Routing Protocol in Mobile Ad-hoc Networks Phung Huu Phu, Myeongjae Yi, and Myung-Kyun Kim Network-based Automation Research Center and School.
Denial of Service (DoS) Attacks in Green Mobile Ad–hoc Networks Ashok M.Kanthe*, Dina Simunic**and Marijan Djurek*** MIPRO 2012, May 21-25,2012, Opatija,
Ad hoc On-demand Distance Vector (AODV) Routing Protocol ECE 695 Spring 2006.
Ad-hoc On-Demand Distance Vector Routing (AODV) and simulation in network simulator.
A survey of Routing Attacks in Mobile Ad Hoc Networks Bounpadith Kannhavong, Hidehisa Nakayama, Yoshiaki Nemoto, Nei Kato, and Abbas Jamalipour Presented.
RFC 3561 AODV Routing Protocol Mobile Ad Hoc Networking Working Group Charles E. Perkins INTERNET DRAFT Nokia Research Center 19 June 2002 Elizabeth M.
Tonghong Li, Yuanzhen Li, and Jianxin Liao Department of Computer Science Technical University of Madrid, Spain Beijing University of Posts & Telecommunications.
Ad Hoc Routing: The AODV and DSR Protocols Speaker : Wilson Lai “Performance Comparison of Two On-Demand Routing Protocols for Ad Hoc Networks”, C. Perkins.
Fault-Tolerant Papers Broadband Network & Mobile Communication Lab Course: Computer Fault-Tolerant Speaker: 邱朝螢 Date: 2004/4/20.
Load-Balancing Routing in Multichannel Hybrid Wireless Networks With Single Network Interface So, J.; Vaidya, N. H.; Vehicular Technology, IEEE Transactions.
Security in Ad Hoc Networks. What is an Ad hoc network? “…a collection of wireless mobile hosts forming a temporary network without the aid of any established.
Presentation of Wireless sensor network A New Energy Aware Routing Protocol for Wireless Multimedia Sensor Networks Supporting QoS 王 文 毅
AODV: Introduction Reference: C. E. Perkins, E. M. Royer, and S. R. Das, “Ad hoc On-Demand Distance Vector (AODV) Routing,” Internet Draft, draft-ietf-manet-aodv-08.txt,
S Master’s thesis seminar 8th August 2006 QUALITY OF SERVICE AWARE ROUTING PROTOCOLS IN MOBILE AD HOC NETWORKS Thesis Author: Shan Gong Supervisor:Sven-Gustav.
BLACK HOLE ATTACK AND ITS COUNTER MEASURES IN AODV ROUTING PROTOCOL Varsha Patidar, Rakesh Verma Mengfei Peng.
SRL: A Bidirectional Abstraction for Unidirectional Ad Hoc Networks. Venugopalan Ramasubramanian Ranveer Chandra Daniel Mosse.
KAIS T High-throughput multicast routing metrics in wireless mesh networks Sabyasachi Roy, Dimitrios Koutsonikolas, Saumitra Das, and Y. Charlie Hu ICDCS.
A Scalable Routing Protocol for Ad Hoc Networks Eric Arnaud Id:
KAIS T SIGF : A Family of Configurable, Secure Routing Protocols for WSNs Sep. 20, 2007 Presented by Kim, Chano Brian Blum, Tian He, Sang Son, Jack Stankovic.
Routing Security in Wireless Ad Hoc Networks Chris Zingraf, Charisse Scott, Eileen Hindmon.
Ad-hoc On Demand Distance Vector Protocol Hassan Gobjuka.
CSR: Cooperative Source Routing Using Virtual MISO in Wireless Ad hoc Networks IEEE WCNC 2011 Yang Guan, Yao Xiao, Chien-Chung Shen and Leonard Cimini.
A Framework for Reliable Routing in Mobile Ad Hoc Networks Zhenqiang Ye Srikanth V. Krishnamurthy Satish K. Tripathi.
A Receiver-Initiated Approach for Channel-Adaptive On-Demand Routing in Ad Hoc Mobile Computing Networks Xiao-Hui Lin, Yu-Kwong Kwok, and Vincent K. N.
Remote Deployment of Sensor Networks Presentation 3: Providing connectivity between sensor nodes and uplinks.
Ad Hoc On-Demand Distance Vector Routing (AODV) ietf
A Multicast Routing Algorithm Using Movement Prediction for Mobile Ad Hoc Networks Huei-Wen Ferng, Ph.D. Assistant Professor Department of Computer Science.
Using Ant Agents to Combine Reactive and Proactive strategies for Routing in Mobile Ad Hoc Networks Fredrick Ducatelle, Gianni di caro, and Luca Maria.
RIP Routing Protocol. 2 Routing Recall: There are two parts to routing IP packets: 1. How to pass a packet from an input interface to the output interface.
Improving Fault Tolerance in AODV Matthew J. Miller Jungmin So.
DETECTION AND IGNORING BLACK HOLE ATTACK IN VANET NETWORKS BASED LATENCY TIME CH. BENSAID S.BOUKLI HACENE M.K.FAROUAN 1.
Fundamentals of Computer Networks ECE 478/578
Peter Pham and Sylvie Perreau, IEEE 2002 Mobile and Wireless Communications Network Multi-Path Routing Protocol with Load Balancing Policy in Mobile Ad.
National Taiwan University Department of Computer Science and Information Engineering Vinod Namboodiri and Lixin Gao University of Massachusetts Amherst.
Author:Zarei.M.;Faez.K. ;Nya.J.M.
Internet Networking recitation #4
CBRP: A Cluster-based Routing Protocol for Mobile Ad hoc Networks
任課教授:陳朝鈞 教授 學生:王志嘉、馬敏修
A Probabilistic Routing Protocol for Mobile Ad Hoc Networks
Security Benefits of Electric-Field-Based Routing
ITIS 6010/8010 Wireless Network Security
Routing.
Vinay Singh Graduate school of Software Dongseo University
Cross-layer Analysis for detecting Wireless Misbehavior
Routing in Mobile Wireless Networks Neil Tang 11/14/2008
Presentation transcript:

By Jannatul Ferdousi M.TECH(MCNT) Roll no GNIT With guidance of Mr.Dipankar Chatterjee (Asst professor of Computer Application department)

1. Review of some existing solutions that detect black hole node(single as well as cooperative) In mobile ad-hoc network. 2. Enhance or modify two of the solutions to minimize some of its drawbacks. 3. Create a new solution to detect single as well as cooperative black hole node in Mobile ad hoc network.

 Sept-Oct: Up to 1 st project preview: Definition of Intruder, Intrusion Detection system, Intrusion Detection Technique,Types of Intrusion Detection, Mobile ad- hoc network, Intrusion detection in Mobile ad-hoc network.  Oct-Nov: Up to 2 nd project preview: AODV routing protocol, Black Hole node’s definition, Black Hole Attack, review of some of existing solution to detect Black Hole attack in Mobile ad-hoc network..  Jan-March: Up to 3 rd project preview: I have enhanced or modified two of the solutions for minimizing some of its drawbacks.

AODV routing protocol: Every node in ad-hoc network maintains routing table. It contains information about the route to the particular destination. Black Hole Attack: A black hole attack is one kind of denial of service attack where a malicious node can attract all packets by falsely claiming a fresh route to the destination and then absorb them without forwarding them to the destination. cooperative black hole attack: If these malicious nodes work together as a group then the damage will be very serious. This type of attack is called cooperative black hole attack.

 This solution proposed a method for identifying multiple black hole nodes in group.  The methodology works with slightly modified AODV protocol by using Fidelity table contains fidelity level that acts as a measure of reliability of participating node.  If fidelity level of participating node drops to zero then it is considered to be a malicious node term as a Black Hole and it is eliminated. 

 Main drawback is time delay because source node waits for RREP packet, again waits to collect the acks and then decides only a safe route.  Another drawback is that finding route contains a node which has malicious tendencies but not a black hole node.

 I propose a solution for black hole node detection using concept of threshold value and using the concept of reputation table and weight of the node. This solution has less network overhead compared to before solution.  This solution is solved by following working principle.  1.Reputation Table  2.Choosing route  3.Updating reputation table  4.Detecting black hole node

 Reputation table contains node_id, Packet forwarded, Packet received. Weight of reputation table=Packet forwarded/packet received *10 Reputation is of three types- Weight>=8 then reputation is reliable 4<=weight<=7 then reputation is suspicious Weight<4 then reputation is malicious.  Choosing route- Then route is choose with the highest average weight value of responding node and next hop node and least hop count.  After a choosing route if RACK is received within timer event then increment the weight values of all intermediate nodes along the path by 1.  If weight value of node will drop less than 4.then it is black hole node.

 Time is delay of this modified solution because this proposed solution is lengthy. If set timer is decreased then received packets will be less. For overhead, network traffic will be increased. If network traffic is decreased then no of nodes will be less then RREQ will reach to DN at more time. BHN will be less.

I propose a solution for black hole node detection using concept of Estimation table and cross checking where estimation table is maintained by each node. Estimation table Each node contains: node field-stands the power range of the node from field-stands data packet sent from the neighboring nodes through field-stands data packet routed from itself to neighboring nodes RTS/CTS field- stands ratio of received and transmitted packets of the neighboring nodes.

If I consider fig1 NODE FROM THROUGH RTS/CTS SUSPICIOUS 4 F F 10 T 5 F T 5 T 6 T F 2 F 8 T T 1 F

 Choosing fresh route-. If a node has already routed data packets from and through some neighboring node, that node should be a normal one. Suspected route- If a node has not successfully routed any data packets from or through some neighboring node, that particular node may be a black hole node and needs to be inspected further A node with high receiving/transmission ratio should be inspected with higher priority.

source node suspicious node next hop node RREQ packet RREP packet Frq packet Frq packet Frp packet Frp packet

 Suspicious node is considered as black hole node If RREQ packet from source node is not passing through suspicious node and sends RREP packet within timer event.

1. First objective have already reviewed. 2. After reviewing I have got some drawbacks then I have enhanced and minimized two of that solution. 3. I will simulate every solution by network simulator-2(ns-2) with relative to the base protocol AODV.

Thank you