Securing OLSR Using Node Locations Daniele Raffo Cédric Adjih Thomas Clausen Paul Mühlethaler 11 th European Wireless Conference 2005 (EW 2005) April 10-13.

Slides:



Advertisements
Similar presentations
Ou Liang, Ahmet Sekercioglu and Nallasamy Mani
Advertisements

Chris Karlof and David Wagner
Secure Location Verification with Hidden and Mobile Base Stations -TMC Apr, 2008 Srdjan Capkun, Kasper Bonne Rasmussen, Mario Cagalj, Mani Srivastava.
Denial of Service in Sensor Networks Anthony D. Wood and John A. Stankovic.
A Survey of Secure Wireless Ad Hoc Routing
Design and Implementation of the OLSR Protocol in an Ad Hoc Framework Juan Gutiérrez Plaza Supervisor: Raimo Kantola Instructor: José Costa Requena Networking.
Packet Leashes: Defense Against Wormhole Attacks Authors: Yih-Chun Hu (CMU), Adrian Perrig (CMU), David Johnson (Rice)
Introduction to Sensor Networks Rabie A. Ramadan, PhD Cairo University 4.
Edith C. H. Ngai1, Jiangchuan Liu2, and Michael R. Lyu1
An Advanced Signature System for OLSR Daniele Raffo Cédric Adjih Thomas Clausen Paul Mühlethaler 2004 ACM Workshop on Security of Ad Hoc and Sensor Networks.
Mobile and Wireless Computing Institute for Computer Science, University of Freiburg Western Australian Interactive Virtual Environments Centre (IVEC)
Optimized Link State Protocol Version 2 Assaf Israel, Eli Nazarov, Asi Bross Version 2 Assaf Israel, Eli Nazarov, Asi Bross.
1-1 CMPE 259 Sensor Networks Katia Obraczka Winter 2005 Security.
Effects of Applying Mobility Localization on Source Routing Algorithms for Mobile Ad Hoc Network Hridesh Rajan presented by Metin Tekkalmaz.
Duplicate address detection and autoconfiguration in OLSR Saadi Boudjit; Cedric Adjih; Anis Laouiti; Paul Muhlethaler Hipercom Project National Institute.
Secure Routing in Sensor Networks: Attacks and Countermeasures First IEEE International Workshop on Sensor Network Protocols and Applications 5/11/2003.
Coping with Communication Gray Zones in IEEE b based Ad hoc Networks, H. Lundgren, E. Nordström, and C. Tschudin Anne Saaranen.
Packet Leashes: A Defense against Wormhole Attacks in Wireless Networks Yih-Chun Hu (Carnegie Mellon University) Adrian Perrig (Carnegie Mellon University)
Mesh Networks A.k.a “ad-hoc”. Definition A local area network that employs either a full mesh topology or partial mesh topology Full mesh topology- each.
Yih-Chun Hu Carnegie Mellon University
UM-OLSR OLSR routing protocol in NS2
ITIS 6010/8010 Wireless Network Security Dr. Weichao Wang.
© 2007 Levente Buttyán and Jean-Pierre Hubaux Security and Cooperation in Wireless Networks Chapter 6: Securing neighbor discovery.
Security Risks for Ad Hoc Networks and how they can be alleviated By: Jones Olaiya Ogunduyilemi Supervisor: Jens Christian Godskesen © Dec
Ad hoc Network 江崎研究室 修士1年 中島 亮. What is Ad hoc Network?  Meaning of Ad hoc Network Ad hoc =その場限りの Node to node → ノード間で一時的に形成されるネットワーク.
Interference-Aware QoS OLSR for Mobile Ad-hoc Network Routing SAWN 2005, May 24 P. Minet & D-Q. Nguyen.
A Distance Routing Effect Algorithm for Mobility (DREAM)* Stefano Basagni Irnrich Chlamtac Violet R. Syrotiuk Barry A. Woodward.
1 29 September 2010 NATO IST-092 Symposium New Capabilities in Security and QoS Using the Updated MANET Routing Protocol OLSRv2 Christopher Dearlove
Network Topologies.
Wireless internet routing Philippe Jacquet. Internet and networking Internet –User plurality connected to –Sources plurality.
ENHANCING AND EVALUATION OF AD-HOC ROUTING PROTOCOLS IN VANET.
Routing in mobile ad-hoc networks (MANETs). 1. WHAT IS A MANET ? A MANET can be defined as a system of autonomous mobile nodes A MANET can be defined.
Secure Cell Relay Routing Protocol for Sensor Networks Xiaojiang Du, Fengiing Lin Department of Computer Science North Dakota State University 24th IEEE.
1 Spring Semester 2009, Dept. of Computer Science, Technion Internet Networking recitation #3 Mobile Ad-Hoc Networks AODV Routing.
An efficient secure distributed anonymous routing protocol for mobile and wireless ad hoc networks Authors: A. Boukerche, K. El-Khatib, L. Xu, L. Korba.
MANETs & Routing.
Mobile Adhoc Network: Routing Protocol:AODV
Security in Mobile Ad Hoc Networks (MANETs) Group : ►NS. Farid Zafar Sheikh ►NS. Muhammad Zulkifl Khalid ►NS. Muhammad Ali Akbar ►NS. Wasif Mehmood Awan.
Security for the Optimized Link- State Routing Protocol for Wireless Ad Hoc Networks Stephen Asherson Computer Science MSc Student DNA Lab 1.
Carlos Rodrigo Aponte OLSRv2 High Level Overview.
Using Directional Antennas to Prevent Wormhole Attacks Lingxuan HuDavid Evans Department of Computer Science University of Virginia.
A survey of Routing Attacks in Mobile Ad Hoc Networks Bounpadith Kannhavong, Hidehisa Nakayama, Yoshiaki Nemoto, Nei Kato, and Abbas Jamalipour Presented.
Outline Wireless introduction Wireless cellular (GSM, CDMA, UMTS) Wireless LANs, MAC layer Wireless Ad hoc networks – routing: proactive routing, on-demand.
Routing Protocols in Ad-hoc Networks, OLSR Self configuring systems (SCS) TTM3 – Høst 2004 Jørn Andre Berntzen 22/10/2004.
Authors: Yih-Chun Hu, Adrian Perrig, David B. Johnson
Secure routing in wireless sensor network: attacks and countermeasures Presenter: Haiou Xiang Author: Chris Karlof, David Wagner Appeared at the First.
Secure Routing in Wireless Sensor Networks: Attacks and Countermeasures Chris Karlof and David Wagner (modified by Sarjana Singh)
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.
Simulation of the OLSRv2 Protocol First Report Presentation.
Doc.: IEEE /1047r0 Submission Month 2000August 2004 Avinash Joshi, Vann Hasty, Michael Bahr.Slide 1 Routing Protocols for MANET Avinash Joshi,
Ad Hoc Network.
Link State Routing David Holmer Generic Link State Routing  Each node monitors neighbors/local links and advertises them to the network.
Scalable Routing Protocols for
SEAD: Secure Efficient Distance Vector Routing for Mobile Wireless Ad Hoc Network Raymond Chang March 30, 2005 EECS 600 Advanced Network Research, Spring.
Ad-hoc On Demand Distance Vector Protocol Hassan Gobjuka.
Intro DSR AODV OLSR TRBPF Comp Concl 4/12/03 Jon KolstadAndreas Lundin CS Ad-Hoc Routing in Wireless Mobile Networks DSR AODV OLSR TBRPF.
Security and Cooperation in Wireless Networks Georg-August University Göttingen Secure routing in multi-hop wireless networks (I) Secure routing in multi-hop.
Security in Wireless Networks Mike Swift CSE b Summer 2003.
Computer Science Using Directional Antennas to Prevent Wormhole Attacks Stephen Thomas Acknowledgement: Portions of this presentation have been donated.
1 Routing security against Threat models CSCI 5931 Wireless & Sensor Networks CSCI 5931 Wireless & Sensor Networks Darshan Chipade.
CS 6401 Intra-domain Routing Outline Introduction to Routing Distance Vector Algorithm.
1 Optimized Link State Routing Protocol for Ad Hoc Networks Jacquet, p IEEE INMIC Dec park gi won
An Efficient Routing Protocol for Green Communications in Vehicular Ad-hoc Networks Jamal Toutouh, Enritue Alba GECCO’ 11, July Presented by 劉美妙.
Mobile Ad Hoc Networking By Shaena Price. What is it? Autonomous system of routers and hosts connected by wireless links Can work flawlessly in a standalone.
Lecture 28 Mobile Ad hoc Network Dr. Ghalib A. Shah
Packet Leashes: Defense Against Wormhole Attacks
Mobile Ad hoc Network: Secure Issues In Multi-Hop Routing Protocols
任課教授:陳朝鈞 教授 學生:王志嘉、馬敏修
Mobile Computing CSE 40814/60814 Spring 2018.
Vinay Singh Graduate school of Software Dongseo University
Presentation transcript:

Securing OLSR Using Node Locations Daniele Raffo Cédric Adjih Thomas Clausen Paul Mühlethaler 11 th European Wireless Conference 2005 (EW 2005) April Nicosia, Cyprus

Index The OLSR protocol Attacks against OLSR Overview of the GPS-based security extension to OLSR The SIGLOC control message Evaluating a node’s distance Evaluating a node’s movement Evaluating a node’s position Possible improvements to standard OLSR Securing OLSR Using Node Locations Daniele Raffo EW / 12

The OLSR protocol OLSR is a proactive link state routing protocol for ad hoc networks. Control messages containing topology information are sent periodically: HELLOslinks with neighbors (link state), MPR selection 1 hop only, not forwarded TCsbi-directional links with nodes flooded via MPRs in the entire network Securing OLSR Using Node Locations Daniele Raffo EW / 12

The OLSR protocol Flooding is optimized via Multipoint Relays (MPRs). Each node selects MPRs from among its neighbors, such that a message emitted by that node and relayed by its MPRs will be received by all nodes 2 hops away. standard flooding MPR broadcast Securing OLSR Using Node Locations Daniele Raffo EW / 12

Attacks against OLSR Incorrect control traffic generation Identity spoofing (spoofed originator of a HELLO or TC)  Wrong topology Link spoofing (false HELLO or TC)  Connectivity loss / Wrong MPR selection Incorrect control traffic relaying Failure to forward traffic  Connectivity loss Packet tampering  Wrong topology / Denial of Service Replay attack / Wormhole attack  Wrong topology Securing OLSR Using Node Locations Daniele Raffo EW / 12

Overview The network is secured with a PKI, but a node X may have been compromised. Problem: How to evaluate the correctness of X ’s control messages? (from the point of view of link state, topological information, etc) Solution: Add redundant information to control messages. Information about node location (obtained by an embedded GPS device) is included in control messages to bound the node’s area of effect. The position information is cross-checked with link state information to spot any inconsistency. Securing OLSR Using Node Locations Daniele Raffo EW / 12

SIGLOC control message | Sign. Method | Reserved | MSN Referrer | | Node location | | Timestamp | | Signature | Securing OLSR Using Node Locations Daniele Raffo EW / 12 This is done via a new OLSR control message (SIGLOC), which contains GPS information as well as a timestamped signature. Each node also maintains a Position Table storing a set of tuples containing the most recent geographical positions of all other nodes.

Evaluating a node’s distance p A position of node A receiving B ’s message at time t A (A ’s clock) p B position of sending node B at time t B (B ’s clock)  tmax error of synchronization between nodes  dmax error in position information vmax velocity of nodes rmax transmission range Securing OLSR Using Node Locations Daniele Raffo EW / 12

Evaluating a node’s distance When this formula is false, the distance AB is too great for the message to be heard. Therefore, the message is probably a fake. Protection against wormholing: A receives a control message from B. A checks if B is truly a neighbor by evaluating the distance AB. Securing OLSR Using Node Locations Daniele Raffo EW / 12

Evaluating a node’s distance Protection against link spoofing: A advertises a link with B. C receives A ’s control message and checks the likelihood of the AB link by evaluating the distance AB. Securing OLSR Using Node Locations Daniele Raffo EW / 12

Evaluating a node’s movement Protection against false position information: Let p A and p B be the position of the same node at instants t A and t B respectively. For r=0, this formula can be used to check if the node is lying about its geographical location. The values of p A, p B, t A, t B are retrieved from the Position Table. If the formula is false, the node is lying about where it pretends to be (or about where it pretended to be in the past). Securing OLSR Using Node Locations Daniele Raffo EW / 12

Evaluating a node’s position Additional security comes from the use of a directional antenna. This allows a node to evaluate the direction from which the signal is coming. In this case, the node can use this formula to derive the sector in which the sender should be. Securing OLSR Using Node Locations Daniele Raffo EW / 12

Improvements to standard OLSR Geographical information could also be used to improve the standard OLSR protocol: improved MPR selection improved MPR flooding forecast of link breaks Securing OLSR Using Node Locations Daniele Raffo EW / 12