Security Benefits of Electric-Field-Based Routing

Slides:



Advertisements
Similar presentations
ACHIEVING NETWORK LEVEL PRIVACY IN WIRELESS SENSOR NETWORKS.
Advertisements

Security in Mobile Ad Hoc Networks
Multicasting in Mobile Ad hoc Networks By XIE Jiawei.
Capacity of wireless ad-hoc networks By Kumar Manvendra October 31,2002.
Wide Area Wi-Fi Sam Bhoot. Wide Area Wi-Fi  Definition: Wi-Fi (Wireless Fidelity) n. – popular term for high frequency wireless local area networks operating.
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)
Multicast in Wireless Mesh Network Xuan (William) Zhang Xun Shi.
Intrusion Detection for Black Hole and Gray Hole in MANETs.
Optimal Jamming Attacks and Network Defense Policies in Wireless Sensor Networks Mingyan Li, Iordanis Koutsopoulos, Radha Poovendran (InfoComm ’07) Presented.
Packet Leashes: Defense Against Wormhole Attacks Authors: Yih-Chun Hu (CMU), Adrian Perrig (CMU), David Johnson (Rice)
Monday, June 01, 2015 ARRIVE: Algorithm for Robust Routing in Volatile Environments 1 NEST Retreat, Lake Tahoe, June
MOBILITY SUPPORT IN IPv6
© 2003 By Default! A Free sample background from Slide 1 SAVE: Source Address Validity Enforcement Protocol Authors: Li,
Denial of Service Resilience in Ad Hoc Networks Imad Aad, Jean-Pierre Hubaux, and Edward W. Knightly Designed by Yao Zhao.
Routing Security in Ad Hoc Networks
Secure routing for structured peer-to-peer overlay networks (by Castro et al.) Shariq Rizvi CS 294-4: Peer-to-Peer Systems.
Security of wireless ad-hoc networks. Outline Properties of Ad-Hoc network Security Challenges MANET vs. Traditional Routing Why traditional routing protocols.
Highly Dynamic Destination- Sequenced Distance-Vector Routing (DSDV) for Mobile Computers C. E. Perkins & P. Bhagwat Presented by Paul Ampadu.
 Structured peer to peer overlay networks are resilient – but not secure.  Even a small fraction of malicious nodes may result in failure of correct.
ROUTING PROTOCOLS Rizwan Rehman. Static routing  each router manually configured with a list of destinations and the next hop to reach those destinations.
Network Topologies.
CECS 5460 – Assignment 3 Stacey VanderHeiden Güney.
Slicing the Onion: Anonymity Using Unreliable Overlays Sachin Katti Jeffrey Cohen & Dina Katabi.
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,
SECURITY-AWARE AD-HOC ROUTING FOR WIRELESS NETWORKS Seung Yi, Prasad Naldurg, Robin Kravets Department of Computer Science University of Illinois at Urbana-Champaign.
 Network Segments  NICs  Repeaters  Hubs  Bridges  Switches  Routers and Brouters  Gateways 2.
10/8/2015CST Computer Networks1 IP Routing CST 415.
The Way Networks Work Computer Networks Kwangwoon University.
Overview of computer communication and Networking Communication VS transmission Computer Network Types of networks Network Needs Standards.
1 Detecting and Evading Wormholes in Mobile Ad-hoc Wireless Networks Asad Amir Pirzada and Chris McDonald.
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.
Secure and Energy-Efficient Disjoint Multi-Path Routing for WSNs Presented by Zhongming Zheng.
Computer Science 1 Using Directional Antennas to Prevent Wormhole Attacks Presented by: Juan Du Nov 16, 2005.
NETWORKING FUNDAMENTALS. Network+ Guide to Networks, 4e2.
Routing Security in Wireless Ad Hoc Networks Chris Zingraf, Charisse Scott, Eileen Hindmon.
1 Routing security against Threat models CSCI 5931 Wireless & Sensor Networks CSCI 5931 Wireless & Sensor Networks Darshan Chipade.
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.
Securing Interconnect Networks By: Bryan Roberts.
By Jannatul Ferdousi M.TECH(MCNT) Roll no GNIT With guidance of Mr.Dipankar.
Spatial Aware Geographic Forwarding for Mobile Ad Hoc Networks Jing Tian, Illya Stepanov, Kurt Rothermel {tian, stepanov,
William Stallings Data and Computer Communications 7th Edition
IMPROVING OF WIRELESS MESH NETWORKS.
Mesh-Network VoIP Call Capacity
Lecture 28 Mobile Ad hoc Network Dr. Ghalib A. Shah
Introduction to Wireless Sensor Networks
Packet Leashes: Defense Against Wormhole Attacks
Internet Networking recitation #4
THE NETWORK LAYER.
任課教授:陳朝鈞 教授 學生:王志嘉、馬敏修
Routing in Wireless Ad Hoc Networks by Analogy to Electrostatic Theory
William Stallings Data and Computer Communications 7th Edition
DARPA Proposer’s Day for
Mobile ad hoc networking: imperatives and challenges
High Throughput Route Selection in Multi-Rate Ad Hoc Wireless Networks
William Stallings Data and Computer Communications 7th Edition
Inference Integrity in Wireless Networks
Flyspec – a network for silicon fly sensors
Path key establishment using multiple secured paths in wireless sensor networks CoNEXT’05 Guanfeng Li  University of Pittsburgh, Pittsburgh, PA Hui Ling.
ITIS 6010/8010 Wireless Network Security
Andy Wang Operating Systems COP 4610 / CGS 5765
Capacity of Ad Hoc Networks
Routing.
ECE 753: FAULT-TOLERANT COMPUTING
Protocols.
WJEC GCSE Computer Science
Introduction to Course
Security in Wide Area Networks
Protocols.
Presentation transcript:

Security Benefits of Electric-Field-Based Routing Secure Spatially Disjoint Routes in MANETs An-I Andy Wang • Florida State University • awang@cs.fsu.edu Abstract Electric-Field-Based Routing (EFR) is designed to defend pair-wise communication channels in MANETs. In particular, EFR is resilient to black-hole routers, man-in-the-middle attacks, and Byzantine and geographically localized failures. EFR is inspired by nature’s way of forming electric field lines. By locally applying electric-field equations at each node, we can globally define a family of spatially disjoint routes (similar to the shapes of field lines) for all communicating pairs. This insight allows a source-destination pair (assigned with opposite polarities) to reconfigure routes and route memberships constantly and rapidly without further route coordination, thus making mobility and failures the common case. Motivation Goal: Defend pair-wise communication channels in MANETs Question: How do we protect against black-hole routers, man-in-the-middle attacks, and Byzantine and geographically localized failures? Solution: Electric-field-based routing (EFR), inspired by nature’s way of forming electric field lines Locally apply electric-field equations at each node Globally define spatially disjoint routes for all communicating pairs No further route coordination EFR + - An EFR node uses its position relative to the source and destination to compute the forwarding hops, based on the electric-field equation. Since a node determines its route membership at packet arrival times and maintains no route states, route constructions require no coordination among routes. Globally, given an adequate node density, packets sent in distinct directions will reach the destination through spatially disjoint paths. EFR provides the following benefits: (1) Spatially disjoint and redundant paths protect against geographically localized failures, Byzantine failures, and associated service degradation. (2) EFR can apply threshold-based cryptography to communicate in the presence of broken routes and intercepts packets. (3) EFR can detect data integrity breaches with redundant information transmitted along multiple paths. (4) EFR is resilient to black-hole routers because the forwarding node selection is based on the context of a node relative to field lines. EFR Properties Rapid reconfiguration regardless of failures and mobility Disjointness of routes easily configurable by initial send angles Route memberships decided at packet arrival times No maintenance of route participation Constantly and rapidly changing route memberships Failures and mobility as the common case Different angled routes Field line Ideal next hop Next hop Current node min(D) min() Transmission range Source Destination Security Benefits of Electric-Field-Based Routing Defense against black-hole routers: The next hop selection Defense against geographically localized and Byzantine is based on the context of a node relative to field lines. A router failures: Routes are spatially disjoint even near both source cannot claim to be the ideal next hop for all nodes. and destination. Defense against integrity breaches: Redundant information Defense against multiple interceptions: Use threshold- can be sent through redundant routes to detect data integrity based cryptography to reconstruct encrypted data in the breaches. presence of failures. STOP STOP