1 7 th IEEE International Conference on Mobile Ad-hoc and Sensor Systems IEEE MASS 2010 San Francisco, CA (United States), November 8 – 12, 2010 Optimization.

Slides:

Advertisements

Similar presentations

Routing across wired and wireless mesh networks Experimental compound internetworking with OSPF Juan Antonio CorderoMatthias PhilippEmmanuel Baccelli INRIA.

Advertisements

Juan-Antonio CorderoPhilippe JacquetEmmanuel Baccelli Orlando, FL -- March 29 th, 2012 Impact of Jitter-based Techniques on Flooding over Wireless Ad hoc.

Mobility Increase the Capacity of Ad-hoc Wireless Network Matthias Gossglauser / David Tse Infocom 2001.

1 Mobile IPv6-Based Ad Hoc Networks: Its Development and Application Advisor: Dr. Kai-Wei Ke Speaker: Wei-Ying Huang.

1 4 th International Conference on Systems and Network Communications IEEE ICSNC 2009 Porto, September 2009 Multi-Point Relaying Techniques with.

1 GPSR: Greedy Perimeter Stateless Routing for Wireless Networks B. Karp, H. T. Kung Borrowed slides from Richard Yang.

CS710 IEEE Transactions on vehicular technology 2005 A Distributed Algorithm for the Dead End Problem of Location Based Routing in Sensor Networks Le Zou,

1 5 th IEEE Workshop on Wireless Mesh Networks IEEE WiMESH 2010 Boston, 21 June 2010 Using Relative Neighborhood Graphs for Reliable Database Synchronization.

Multicasting in Mobile Ad-Hoc Networks (MANET)

A Performance Comparison of Multi-Hop Wireless Ad Hoc Network Routing Protocols By Josh Broch, David A. Maltz, David B. Johnson, Yih- Chun Hu, Jorjeta.

Real Time Flow Handoff in Ad Hoc Wireless Networks using Mobility Prediction William Su Mario Gerla Comp Science Dept, UCLA.

Evaluation of Ad hoc Routing Protocols under a Peer-to-Peer Application Authors: Leonardo Barbosa Isabela Siqueira Antonio A. Loureiro Federal University.

Ad-Hoc Networking Course Instructor: Carlos Pomalaza-Ráez D. D. Perkins, H. D. Hughes, and C. B. Owen: ”Factors Affecting the Performance of Ad Hoc Networks”,

Volcano Routing Scheme Routing in a Highly Dynamic Environment Yashar Ganjali Stanford University Joint work with: Nick McKeown SECON 2005, Santa Clara,

Random Access MAC for Efficient Broadcast Support in Ad Hoc Networks Ken Tang, Mario Gerla Computer Science Department University of California, Los Angeles.

Performance Comparison of Routing Protocols for Ad Hoc Networks PATTERN ENDIF Ferrara.

QoS Constraint Routing Protocols for Mobile Ad Hoc

Distributed Token Circulation in Mobile Ad Hoc Networks Navneet Malpani, Intel Corp. Nitin Vaidya, Univ. Illinois Urbana-Champaign Jennifer Welch, Texas.

1 GPSR: Greedy Perimeter Stateless Routing for Wireless Networks B. Karp, H. T. Kung Borrowed some Richard Yang‘s slides.

Study of Distance Vector Routing Protocols for Mobile Ad Hoc Networks Yi Lu, Weichao Wang, Bharat Bhargava CERIAS and Department of Computer Sciences Purdue.

1 A Novel Mechanism for Flooding Based Route Discovery in Ad hoc Networks Jian Li and Prasant Mohapatra Networks Lab, UC Davis.

Component-Based Routing for Mobile Ad Hoc Networks Chunyue Liu, Tarek Saadawi & Myung Lee CUNY, City College.

Ogier - 1 OSPF-MDR Position draft-ogier-ospf-mdr-position-00.txt Richard Ogier Presented by Tom Henderson March 23, 2006 IETF Meeting - OSPF WG.

Network Coding vs. Erasure Coding: Reliable Multicast in MANETs Atsushi Fujimura*, Soon Y. Oh, and Mario Gerla *NEC Corporation University of California,

Wireless internet routing Philippe Jacquet. Internet and networking Internet –User plurality connected to –Sources plurality.

INRIA Hitachi Ecole Polytechnique 1 MPR Extension for OSPF on MANETs draft-baccelli-ospf-mpr-ext-01.txt Emmanuel Baccelli 65 th IETF OSPF WG in Dallas,

1 CS 4396 Computer Networks Lab Dynamic Routing Protocols - II OSPF.

1 Enabling Large Scale Network Simulation with 100 Million Nodes using Grid Infrastructure Hiroyuki Ohsaki Graduate School of Information Sci. & Tech.

A Cooperative Diversity- Based Robust MAC Protocol in wireless Ad Hoc Networks Sangman Moh, Chansu Yu Chosun University, Cleveland State University Korea,

Performance Analysis of AODV and SAODV Routing Protocols in Ad-Hoc Mesh Networks- A Simulation Study Sangeeta Ghangam Division of Computing Studies, Arizona.

OSPF-MDR - 1 OSPF-MDR: Extension of OSPF for Mobile Ad Hoc Networks draft-ietf-ospf-manet-mdr-02.txt Richard Ogier September 17, 2008.

Routing Protocol Evaluation David Holmer

1 BitHoc: BitTorrent for wireless ad hoc networks Jointly with: Chadi Barakat Jayeoung Choi Anwar Al Hamra Thierry Turletti EPI PLANETE 28/02/2008 MAESTRO/PLANETE.

Analysis of the Impact and Interactions of Protocol and Environmental Parameters on Overall MANET Performance Michael W. Totaro and Dmitri D. Perkins Center.

Improving QoS Support in Mobile Ad Hoc Networks Agenda Motivations Proposed Framework Packet-level FEC Multipath Routing Simulation Results Conclusions.

IEEE Globecom 2010 Tan Le Yong Liu Department of Electrical and Computer Engineering Polytechnic Institute of NYU Opportunistic Overlay Multicast in Wireless.

OSPF-MDR - 1 Comparison of Three MANET Extensions of OSPF draft-ogier-ospf-manet-mdr-or-compare-00.txt draft-ogier-ospf-manet-mdr-mpr-compare-00.txt Richard.

Small-Scale and Large-Scale Routing in Vehicular Ad Hoc Networks Wenjing Wang 1, Fei Xie 2 and Mainak Chatterjee 1 1 School of Electrical Engineering and.

SRI International 1 A Simulation Comparison of TBRPF, OLSR, and AODV Richard Ogier SRI International July 2002.

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,

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.

1 OSPF and MANET WG meetings, IETF64 OSPF MANET Design Team outbrief November, 2005 Tom Henderson Design team members:

Doc.: IEEE /0406r0 Submission March 2007 James P. Hauser, Naval Research LabSlide 1 A Comparison of Broadcast Routing Protocols Notice: This document.

PRIN WOMEN PROJECT Research Unit: University of Naples Federico II G. Ferraiuolo

An Improved Vehicular Ad Hoc Routing Protocol for City Environments Moez Jerbi, Sidi-Mohammed Senouci, and Rabah Meraihi France Telecom R&D, Core Network.

Sharp Hybrid Adaptive Routing Protocol for Mobile Ad Hoc Networks

Self-stabilizing energy-efficient multicast for MANETs.

1 OSPF and MANET WG meetings, IETF63 OSPF MANET Design Team update August 1-5, 2005 Tom Henderson (in absentia)

Design Considerations for a Wireless OSPF Interface draft-spagnolo-manet-ospf-design Tom Henderson, Phil Spagnolo, Gary Pei

Energy-Efficient, Application-Aware Medium Access for Sensor Networks Venkatesh Rajenfran, J. J. Garcia-Luna-Aceves, and Katia Obraczka Computer Engineering.

Load Balanced Link Reversal Routing in Mobile Wireless Ad Hoc Networks Nabhendra Bisnik, Alhussein Abouzeid ECSE Department RPI Costas Busch CSCI Department.

Using Ant Agents to Combine Reactive and Proactive strategies for Routing in Mobile Ad Hoc Networks Fredrick Ducatelle, Gianni di caro, and Luca Maria.

Denial of Service Resilience in Ad Hoc Networks (MobiCom 2004) Imad Aad, Jean-Pierre Hubaux, and Edward W. Knightly November 21 th, 2006 Jinkyu Lee.

Cluster-Adaptive Two-Phase Coding Multi-Channel MAC Protocol (CA-TPCMMP) for MANETs 1 Lili Zhang, 1 Boon-Hee Soong, and 2 Wendong Xiao 1 School of Electrical.

Doc.: IEEE /r0 Submission November 2005 Xin Yu and Hang LiuSlide 1 Implementation and Evaluation of AODV with Proactive Route Announcements.

Copyright © 2002 OPNET Technologies, Inc. 1 Random Waypoint Mobility Model Empirical Analysis of the Mobility Factor for the Random Waypoint Model 1542.

Performance Comparison of Ad Hoc Network Routing Protocols Presented by Venkata Suresh Tamminiedi Computer Science Department Georgia State University.

An Efficient Routing Protocol for Green Communications in Vehicular Ad-hoc Networks Jamal Toutouh, Enritue Alba GECCO’ 11, July Presented by 劉美妙.

HoWL: An Efficient Route Discovery Scheme Using Routing History in Mobile Ad Hoc Networks Faculty of Environmental Information Mika Minematsu

1 OSPF WG meeting, IETF65 OSPF MANET update March 23, 2006 Tom Henderson

Indian Institute Of Technology, Delhi Page 1 Enhancements in Security, Performance Modeling and Optimization in Vehicular Networks Ashwin Rao 2006SIY7513.

A Cluster-based Routing Protocol for Mobile Ad hoc Networks

Author：Zarei.M.；Faez.K. ；Nya.J.M.

OSPF extension for MANET based on MPR

Analysis the performance of vehicles ad hoc network simulation based

Mesh-based Geocast Routing Protocols in an Ad Hoc Network

GeoTORA: A Protocol for Geocasting in Mobile Ad Hoc Networks

A Proximity-based Routing Protocol for Wireless Multi-hop Networks

Improving Routing & Network Performances using Quality of Nodes

Presentation transcript:

1 7 th IEEE International Conference on Mobile Ad-hoc and Sensor Systems IEEE MASS 2010 San Francisco, CA (United States), November 8 – 12, 2010 Optimization of Critical Data Synchronization via Link Overlay RNG in Mobile Ad hoc Networks Emmanuel BaccelliJuan Antonio CorderoPhilippe Jacquet Équipe Hipercom, INRIA Saclay (France) MASS

2 Agenda Optimization of Critical Data Synchronization via Link Overlay RNG in Mobile Ad hoc Networks IEEE MASS 2010  Rationale  Our Proposal: SLO-T  An SLO-T Overlay Example  SLO-T Analysis  Application: SLO-T in OSPF  Rationale

3 Rationale (1) Reliable communication of critical data in MANETs Synchronized Overlay Optimization of Critical Data Synchronization via Link Overlay RNG in Mobile Ad hoc Networks IEEE MASS 2010

4  MANET link synchronization is costly  Overlay requirements:  Low overlay density  Low overlay link change rate Rationale (and 2) Optimization of Critical Data Synchronization via Link Overlay RNG in Mobile Ad hoc Networks IEEE MASS 2010

5 Agenda  Rationale  Our Proposal: SLO-T  An SLO-T Overlay Example  SLO-T Analysis  Application: SLO-T in OSPF Optimization of Critical Data Synchronization via Link Overlay RNG in Mobile Ad hoc Networks IEEE MASS 2010

6 Our Proposal: SLO-T Synchronized Link Overlay – Triangular (SLOT) SLOT Uniform Costs SLOT Distance-based Costs Relative Neighborhood Graph (RNG) Optimization of Critical Data Synchronization via Link Overlay RNG in Mobile Ad hoc Networks IEEE MASS 2010

7 Our Proposal Relative Neighbor Graph (RNG)  Mathematical definition (Toussaint, 1980)  Intuitive definition Optimization of Critical Data Synchronization via Link Overlay RNG in Mobile Ad hoc Networks IEEE MASS 2010 uv

8 Distance-based cost (SLOT-D) C A B C A B Our Proposal Synchronized Link Overlay – Triangular (SLOT)  Mathematical definition  Intuitive definition SLOT-D SLOT-U Unit cost (SLOT-U) Optimization of Critical Data Synchronization via Link Overlay RNG in Mobile Ad hoc Networks IEEE MASS 2010

9 Agenda  Rationale  Our Proposal: SLO-T  An SLO-T Overlay Example  SLO-T Analysis  Application: SLO-T in OSPF Optimization of Critical Data Synchronization via Link Overlay RNG in Mobile Ad hoc Networks IEEE MASS 2010

10 Synchronized Link Overlay – Triangular Example (1)  Network graph  N: 30 nodes  Grid: 400x400m  Radio range: 150 m Network link SLOT-U link SLOT-D link Optimization of Critical Data Synchronization via Link Overlay RNG in Mobile Ad hoc Networks IEEE MASS 2010

11 Synchronized Link Overlay – Triangular Example (2)  SLOT-U subgraph Network link SLOT-U link SLOT-D link Optimization of Critical Data Synchronization via Link Overlay RNG in Mobile Ad hoc Networks IEEE MASS 2010

12 Synchronized Link Overlay – Triangular Example (3)  SLOT-D subgraph Network link SLOT-U link SLOT-D link Optimization of Critical Data Synchronization via Link Overlay RNG in Mobile Ad hoc Networks IEEE MASS 2010

13 Synchronized Link Overlay – Triangular Example (and 4) Network link SLOT-U link SLOT-D link  SLOT-D subgraph (distance-based metrics) Optimization of Critical Data Synchronization via Link Overlay RNG in Mobile Ad hoc Networks IEEE MASS 2010

14 Agenda  Rationale  Our Proposal: SLO-T  An SLO-T Overlay Example  SLO-T Analysis  Application: SLO-T in OSPF Optimization of Critical Data Synchronization via Link Overlay RNG in Mobile Ad hoc Networks IEEE MASS 2010

15 Synchronized Link Overlay – Triangular Analytical Model  Graph model: Unit disk graph (UDG)  Speed: Constant node speed s  Node distribution:Uniform node density  Mobility: Independent, isotropic random walk Optimization of Critical Data Synchronization via Link Overlay RNG in Mobile Ad hoc Networks IEEE MASS 2010

16 Synchronized Link Overlay – Triangular Analysis 2D (1)  Avg. number of links per node All links SLOT-D SLOT-U  3,60 2,56 Optimization of Critical Data Synchronization via Link Overlay RNG in Mobile Ad hoc Networks IEEE MASS 2010

17 Synchronized Link Overlay – Triangular Analysis 2D (and 2)  Avg. rate of link creation All links SLOT-D SLOT-U for a fixed node speed s Optimization of Critical Data Synchronization via Link Overlay RNG in Mobile Ad hoc Networks IEEE MASS 2010

18 Synchronized Link Overlay – Triangular Analysis Summary Avg number of overlay links 2 2,56 2,94 2,77 3,60 2,50 Avg rate of link creation 2 2,73 1,02 2 3,60 1,44 dim SLOT-D SLOT-U (  ) Optimization of Critical Data Synchronization via Link Overlay RNG in Mobile Ad hoc Networks IEEE MASS 2010

19 Agenda  Rationale  Our Proposal: SLO-T  An SLO-T Overlay Example  SLO-T Analysis  Application: SLO-T in OSPF Optimization of Critical Data Synchronization via Link Overlay RNG in Mobile Ad hoc Networks IEEE MASS 2010

20 Application: SLOT in OSPF  OSPF: Link-state routing protocol  MANET extension: RFC 5449  Components: Topology selection LSA flooding LSDB synchronization (Adjacencies) SLOT for Unit Cost (SLOT-U) Optimization of Critical Data Synchronization via Link Overlay RNG in Mobile Ad hoc Networks IEEE MASS 2010

21 Application: SLOT in OSPF  Adjacencies (synchronized links) Optimization of Critical Data Synchronization via Link Overlay RNG in Mobile Ad hoc Networks IEEE MASS 2010

22 Application: SLOT in OSPF  Control Traffic Overhead Optimization of Critical Data Synchronization via Link Overlay RNG in Mobile Ad hoc Networks IEEE MASS 2010

23 Application: SLOT in OSPF  Data Delivery Ratio Optimization of Critical Data Synchronization via Link Overlay RNG in Mobile Ad hoc Networks IEEE MASS 2010

24 Conclusions & Future Work  Synchronized overlay requirements: low density / low link change rate  SLOT: number of overlay links/node is independent from density  SLOT-OSPF: overhead reduction leads to better behaviors in dense networks  SLOT-D better than SLOT-U (in terms of overlay size)  But requires a distance-based metric  factor in link formation rate Optimization of Critical Data Synchronization via Link Overlay RNG in Mobile Ad hoc Networks IEEE MASS 2010

25 Questions ? Optimization of Critical Data Synchronization via Link Overlay RNG in Mobile Ad hoc Networks IEEE MASS 2010

26 Backup Slides Optimization of Critical Data Synchronization via Link Overlay RNG in Mobile Ad hoc Networks IEEE MASS 2010

27 Impact of Distance in SLOT Link Selection Optimization of Critical Data Synchornization via Link Overlay RNG in Mobile Ad hoc Networks IEEE MASS 2010

28 Synchronized Link Overlay (SLO) Optimization of Critical Data Synchornization via Link Overlay RNG in Mobile Ad hoc Networks IEEE MASS 2010  Mathematical definition  Intuitive definition AB C1C1 C2C

29 Analytical Model Formulae (1) Optimization of Critical Data Synchornization via Link Overlay RNG in Mobile Ad hoc Networks IEEE MASS 2010 SLOT with distance-based metrics

30 Analytical Model Formulae (2) SLOT with unit-cost metrics Optimization of Critical Data Synchornization via Link Overlay RNG in Mobile Ad hoc Networks IEEE MASS 2010

31 Analytical Model Formulae (and 3) Further details  E. Baccelli, J. A. Cordero, P. Jacquet: Optimization of Critical Data Synchronization via Link Overlay RNG in Mobile Ad Hoc Networks. INRIA Research Report RR April (publicly available in the Internet: ) Optimization of Critical Data Synchornization via Link Overlay RNG in Mobile Ad hoc Networks IEEE MASS 2010

32 The SLO-T Algorithm Relative Neighbor Graph (RNG) AB C1 C2 C3 Synchronized Link Overlay, Triangle elimination AB C SLO-T (unit cost) Optimization of Critical Data Synchornization via Link Overlay RNG in Mobile Ad hoc Networks IEEE MASS 2010

33 Documentation of OSPF MANET Extensions  Simulations run over the Georgia Tech Network Simulator (GTNetS)  Implementation based on the Quagga/Zebra OSPFv3 daemon (ospf6d)  Source code for OSPF MANET extensions  Following the IETF RFC 5449 “OSPF Multipoint Relay (MPR) Extension for Ad Hoc Networks” from E. Baccelli, P. Jacquet, D. Nguyen and T. Clausen  SLO-T mechanism following the INRIA Research Report n. 6148, by P. Jacquet.  Implementation provided by INRIA, publicly available in Optimization of Critical Data Synchornization via Link Overlay RNG in Mobile Ad hoc Networks IEEE MASS 2010

34 Simulation Environment General Simulation Parameters  20 samples/experiment  Data traffic pattern  Constant Bit Rate UDP flow  Packet size:1472 bytes  Packet rate: 85 pkts/sec  Scenario  Square grid  Grid size: 400x400 m  Node configuration  Radio range:150 m  MAC protocol:IEEE b  Node mobility  Random waypoint model  Pause: 40 sec  Speed: 0, 5, 10, 15 m/s (constant)‏ Performed Experiments  Fixed size grid OSPF Configuration  Standard Parameters  HelloInterval: 2 sec  DeadInterval: 6 sec  RxmtInterval: 5 sec  MinLSInterval: 5 sec  MinLSArrival: 1 sec  RFC 5449  AckInterval:1,8 sec  Adj. persistency:Disabled  SLOT-OSPF  AckInterval:1,8 sec Optimization of Critical Data Synchornization via Link Overlay RNG in Mobile Ad hoc Networks IEEE MASS 2010

35 The α parameter Optimization of Critical Data Synchornization via Link Overlay RNG in Mobile Ad hoc Networks IEEE MASS 2010