DARPA Proposer’s Day for

Slides:



Advertisements
Similar presentations
A feedback–based scheme for improving TCP performance in Ad Hoc Wireless Networks Group : Manish Mehta Aditya Barve.
Advertisements

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 By XIE Jiawei.
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.
BY PAYEL BANDYOPADYAY WHAT AM I GOING TO DEAL ABOUT? WHAT IS AN AD-HOC NETWORK? That doesn't depend on any infrastructure (eg. Access points, routers)
Maximum Battery Life Routing to Support Ubiquitous Mobile Computing in Wireless Ad Hoc Networks By C. K. Toh.
A Distributed Security Framework for Heterogeneous Wireless Sensor Networks Presented by Drew Wichmann Paper by Himali Saxena, Chunyu Ai, Marco Valero,
Optimal Jamming Attacks and Network Defense Policies in Wireless Sensor Networks Mingyan Li, Iordanis Koutsopoulos, Radha Poovendran (InfoComm ’07) Presented.
TOPOLOGIES FOR POWER EFFICIENT WIRELESS SENSOR NETWORKS ---KRISHNA JETTI.
Introduction to Sensor Networks Rabie A. Ramadan, PhD Cairo University 4.
CSE University of Washington Multipath Routing Protocols in AdHoc Networks.
Edith C. H. Ngai1, Jiangchuan Liu2, and Michael R. Lyu1
Monday, June 01, 2015 ARRIVE: Algorithm for Robust Routing in Volatile Environments 1 NEST Retreat, Lake Tahoe, June
Mobile and Wireless Computing Institute for Computer Science, University of Freiburg Western Australian Interactive Virtual Environments Centre (IVEC)
1 Spring Semester 2007, Dept. of Computer Science, Technion Internet Networking recitation #4 Mobile Ad-Hoc Networks AODV Routing.
SUMP: A Secure Unicast Messaging Protocol for Wireless Ad Hoc Sensor Networks Jeff Janies, Chin-Tser Huang, Nathan L. Johnson.
Security of wireless ad-hoc networks. Outline Properties of Ad-Hoc network Security Challenges MANET vs. Traditional Routing Why traditional routing protocols.
Security Risks for Ad Hoc Networks and how they can be alleviated By: Jones Olaiya Ogunduyilemi Supervisor: Jens Christian Godskesen © Dec
CSE 461: Distance Vector Routing. Next Topic  Focus  How do we calculate routes for packets?  Routing is a network layer function  Routing Algorithms.
Load Balancing Routing Scheme in Mars Sensor Network CS 215 Winter 2001 Term Project Prof : Mario Gerla Tutor: Xiaoyan Hong Student : Hanbiao Wang & Qingying.
Network Topologies.
IEEE TRANSACTIONS ON PARALLEL AND DISTRIBUTED SYSTEMS 2007 (TPDS 2007)
1 Spring Semester 2009, Dept. of Computer Science, Technion Internet Networking recitation #3 Mobile Ad-Hoc Networks AODV Routing.
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,
A survey of Routing Attacks in Mobile Ad Hoc Networks Bounpadith Kannhavong, Hidehisa Nakayama, Yoshiaki Nemoto, Nei Kato, and Abbas Jamalipour Presented.
ENERGY-EFFICIENT FORWARDING STRATEGIES FOR GEOGRAPHIC ROUTING in LOSSY WIRELESS SENSOR NETWORKS Presented by Prasad D. Karnik.
Secure routing in wireless sensor network: attacks and countermeasures Presenter: Haiou Xiang Author: Chris Karlof, David Wagner Appeared at the First.
Load-Balancing Routing in Multichannel Hybrid Wireless Networks With Single Network Interface So, J.; Vaidya, N. H.; Vehicular Technology, IEEE Transactions.
Rushing Attacks and Defense in Wireless Ad Hoc Network Routing Protocols ► Acts as denial of service by disrupting the flow of data between a source and.
GPSR: Greedy Perimeter Stateless Routing for Wireless Networks EECS 600 Advanced Network Research, Spring 2005 Shudong Jin February 14, 2005.
Secure and Energy-Efficient Disjoint Multi-Path Routing for WSNs Presented by Zhongming Zheng.
Performance of Adaptive Beam Nulling in Multihop Ad Hoc Networks Under Jamming Suman Bhunia, Vahid Behzadan, Paulo Alexandre Regis, Shamik Sengupta.
Routing Security in Wireless Ad Hoc Networks Chris Zingraf, Charisse Scott, Eileen Hindmon.
Tufts Wireless Laboratory School Of Engineering Tufts University Paper Review “An Energy Efficient Multipath Routing Protocol for Wireless Sensor Networks”,
A Framework for Reliable Routing in Mobile Ad Hoc Networks Zhenqiang Ye Srikanth V. Krishnamurthy Satish K. Tripathi.
Energy Efficient Data Management for Wireless Sensor Networks with Data Sink Failure Hyunyoung Lee, Kyoungsook Lee, Lan Lin and Andreas Klappenecker †
1 Routing security against Threat models CSCI 5931 Wireless & Sensor Networks CSCI 5931 Wireless & Sensor Networks Darshan Chipade.
Peter Pham and Sylvie Perreau, IEEE 2002 Mobile and Wireless Communications Network Multi-Path Routing Protocol with Load Balancing Policy in Mobile Ad.
Day 13 Intro to MANs and WANs. MANs Cover a larger distance than LANs –Typically multiple buildings, office park Usually in the shape of a ring –Typically.
-1/16- Maximum Battery Life Routing to Support Ubiquitous Mobile Computing in Wireless Ad Hoc Networks C.-K. Toh, Georgia Institute of Technology IEEE.
PROJECT DOMAIN : NETWORK SECURITY Project Members : M.Ananda Vadivelan & E.Kalaivanan Department of Computer Science.
Spatial Aware Geographic Forwarding for Mobile Ad Hoc Networks Jing Tian, Illya Stepanov, Kurt Rothermel {tian, stepanov,
IMPROVING OF WIRELESS MESH NETWORKS.
Delay-Tolerant Networks (DTNs)
Overview of Wireless Networks:
Lecture 28 Mobile Ad hoc Network Dr. Ghalib A. Shah
CONTRA Camouflage of Network Traffic to Resist Attack (Intrusion Tolerance Using Masking, Redundancy and Dispersion) DARPA OASIS PI Meeting – Hilton Head.
Internet Networking recitation #4
Introduction to Wireless Sensor Networks
Net 435: Wireless sensor network (WSN)
任課教授:陳朝鈞 教授 學生:王志嘉、馬敏修
Environment-Aware Reputation Management for Ad Hoc Networks
Packetizing Error Detection
by Saltanat Mashirova & Afshin Mahini
Hidden Terminal Decoding and Mesh Network Capacity
Mobile ad hoc networking: imperatives and challenges
Packetizing Error Detection
Security Benefits of Electric-Field-Based Routing
Computer networking In this section of notes you will learn the rudiments of networking, the components of a network and how to secure a network.
TCP in Mobile Ad-hoc Networks
Path key establishment using multiple secured paths in wireless sensor networks CoNEXT’05 Guanfeng Li  University of Pittsburgh, Pittsburgh, PA Hui Ling.
Abhinandan Ramaprasath, Anand Srinivasan,
The Network Layer Network Layer Design Issues:
TCP in Wireless Ad-hoc Networks
ITIS 6010/8010 Wireless Network Security
Detecting Denial-of-Service Attacks against Sensor Networks
Protocols.
Leader Election Bernard Chen.
Protocols.
Presentation transcript:

Electric-Field-Based Routing: Secure Spatially Disjoint Routes in MANETs DARPA Proposer’s Day for Defense Against Cyber Attacks on Mobile Ad Hoc Networks An-I (Andy) Wang Florida State University awang@cs.fsu.edu Hello, everyone, I’m Andy Wang from the Florida State University. I’m going to tell you about the electric-field-based routing, an innovative way to form secure spatially disjoint routes in mobile ad hoc networks.

Goal Defend pair-wise communication channels in MANETs Electric-Field-Based Routing (EFR) defends against Black-hole routers Man-in-the-middle attacks Byzantine and geographically localized failures Service degradation The goal of EFR is to defend against pair-wise communication channels in MANETs. In particular, EFR is designed to defend against black-hole routers, certain types of man-in-the-middle attacks, Byzantine and geographically localized failures, and service degradation.

Electric-Field-Based Routing With two opposite poles Locally apply electric-field equations at each node Globally define spatially disjoint routes for all communicating pairs No further route coordination The idea of EFR is inspired by nature’s way of forming electric field lines. The observation is that with two opposite charges, you can easily construct spatially disjoint lines along the electric field lines. In the case of networking, we assign the source and the destination with opposite charges, and we can locally apply electric-field equations at each node. And by doing so, we have globally defined spatially disjoint routes for all communicating pairs at all possible positions. And the construction of spatially disjoint routes will require no further route coordination + -

Rapid Reconfiguration for Failures and Mobility One important property of EFR is that it can reconfigure rapidly and constantly for failures and mobility. Suppose you have some tanks. The red tank is the source, and the blue tank is the destination. If you want to talk through EFR, you just simply send out packets at distinct angles and they will reach the destination through disjoint paths. The route memberships are determined at packet arrival times; therefore, each node effectively functions as a switch and does not maintain states regarding its route participation.

Rapid Reconfiguration for Failures and Mobility As a consequence, if you have some helicopters that enters the scene, you can quickly use them to construct disjoint routes. In this case, EFR can statelessly construct 3D spatially disjoint routes. Stateless 3D routing

EFR vs. Black-Hole Routers STOP Now let’s see how EFR can handle black hole routers. Suppose one of the nodes is a black-hole router, and you will lose all the packets along that path. However, its surround nodes of the black hole are not affected because the forwarding decision is based on a node’s relative position to the source-destination pair. Therefore, a black hole router cannot claim to be on all field lines for all communication pairs. Contextual routing

EFR vs. Black-Hole Routers STOP The destination randomly sends acknowledgements to the source via different routes. After a while, the source will assume failure and find another path Contextual routing

EFR vs. Black-Hole Routers STOP Contextual routing

EFR vs. Localized Failures Now, let’s see how EFR can handle localized failures. Suppose a region of node fails simultaneously, possibly due to a bomb. This geographically localized failure is unlikely to break all disjoiint paths, since electric field lines are spatially disjoint. Spatially disjoint routes

EFR vs. Localized Failures Spatially disjoint routes

EFR vs. Localized Failures After a timeout period, the source will find alternative route to recover the broken route. Spatially disjoint routes

EFR vs. Integrity Breaches To handle integrity breaches, the source can send duplicate information over disjoint routes. If a node compromises a route, the destination can easily detect the integrity breaches Redundant routes and information

EFR vs. Integrity Breaches Redundant routes and information

EFR vs. Multiple Interceptions STOP To prevent interceptions, we need encryption. To survive multiple failures, we can apply threshold-based encryption on top of threshold-based encoding. In this case, we have 5 choose 3 encoding, where any three surviving paths can reconstruct the original encrypted message. STOP Threshold-based encryption + encoding

EFR vs. Multiple Interceptions STOP In this case, we have two intercepted paths, but we can still reconstruct the original encrypted message through the remaining three paths. STOP Threshold-based encryption + encoding

Research Challenges Evaluate EFR under different attacks Overcome practical deployment constraints Build obstacle/corridor conforming routes Balance energy consumptions Explore other stateless approaches of constructing secure spatially disjoint routes We still need to to quantify EFR’s performance characteristics in terms of security, under various types of attacks. Also, to be deployable, ideally EFR can construct spatially disjoint routes that can conform to physical obstacles and corridors. Currently, we are exploring ways to compute the local center of mass at each node to shape the electric-field lines. Of course, there are other extensions to better cope with the wireless environment. For example, we can adapt wear-leveling to lengthen the battery life of each node. We also want to explore other stateless approaches of constructing secure spatially disjoint routes.

Electric-Field-Based Routing Questions Electric-Field-Based Routing An-I (Andy) Wang awang@cs.fsu.edu

How to select the next hop min() min(D) Next hop Field line Current node Ideal next hop Transmission range