1 / 34

5 th IEEE Workshop on Wireless Mesh Networks IEEE WiMESH 2010 Boston, 21 June 2010

Using Relative Neighborhood Graphs for Reliable Database Synchronization in MANETs. Emmanuel Baccelli Juan Antonio Cordero Philippe Jacquet Équipe Hipercom, INRIA Saclay (France). 5 th IEEE Workshop on Wireless Mesh Networks IEEE WiMESH 2010 Boston, 21 June 2010.

lana-mccall
Download Presentation

5 th IEEE Workshop on Wireless Mesh Networks IEEE WiMESH 2010 Boston, 21 June 2010

An Image/Link below is provided (as is) to download presentation Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author. Content is provided to you AS IS for your information and personal use only. Download presentation by click this link. While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server. During download, if you can't get a presentation, the file might be deleted by the publisher.

E N D

Presentation Transcript

  1. Using Relative Neighborhood Graphs for Reliable Database Synchronization in MANETs Emmanuel Baccelli Juan Antonio Cordero Philippe Jacquet Équipe Hipercom, INRIA Saclay (France) 5th IEEE Workshop on Wireless Mesh Networks IEEE WiMESH 2010 Boston, 21 June 2010

  2. Using Relative Neighborhood Graphs for Reliable Database Synchronization in MANETs IEEE SECON WiMESH 2010 • Motivation Agenda • Motivation • Our Proposal: SLO-T • An SLO-T Overlay Example • SLO-T Analysis • Application: SLO-T in OSPF

  3. Using Relative Neighborhood Graphs for Reliable Database Synchronization in MANETs IEEE SECON WiMESH 2010 Synchronized Overlay Motivation Reliable communication of critical data in MANETs

  4. Using Relative Neighborhood Graphs for Reliable Database Synchronization in MANETs IEEE SECON WiMESH 2010 Motivation (2) • MANET link synchronization is costly • Overlay requirements: • Low overlay density • Low overlay link change rate

  5. Using Relative Neighborhood Graphs for Reliable Database Synchronization in MANETs IEEE SECON WiMESH 2010 Agenda • Motivation • Our Proposal: SLO-T • An SLO-T Overlay Example • SLO-T Analysis • Application: SLO-T in OSPF

  6. Using Relative Neighborhood Graphs for Reliable Database Synchronization in MANETs IEEE SECON WiMESH 2010 Relative Neighborhood Graph (RNG) Synchronized Link Overlay (SLO) SLOT Uniform Costs SLOT Distance-based Costs Our Proposal Synchronized Link Overlay – Triangular (SLOT)

  7. Using Relative Neighborhood Graphs for Reliable Database Synchronization in MANETs IEEE SECON WiMESH 2010 Our Proposal Relative Neighbor Graph (RNG) • Mathematical definition • Intuitive definition u v

  8. Using Relative Neighborhood Graphs for Reliable Database Synchronization in MANETs IEEE SECON WiMESH 2010 Our Proposal Synchronized Link Overlay (SLO) • Mathematical definition • Intuitive definition 10 A B 2 2 C1 2 C2

  9. Using Relative Neighborhood Graphs for Reliable Database Synchronization in MANETs IEEE SECON WiMESH 2010 42 13 Unit cost (SLOT-U) Distance-based cost (SLOT-D) 37 42 A A 3 3 13 5 C 5 C 4 4 37 B B Our Proposal Synchronized Link Overlay – Triangular (SLOT) • Mathematical definition SLOT-D SLOT-U • Intuitive definition

  10. Using Relative Neighborhood Graphs for Reliable Database Synchronization in MANETs IEEE SECON WiMESH 2010 Agenda • Motivation • Our Proposal: SLO-T • An SLO-T Overlay Example • SLO-T Analysis • Application: SLO-T in OSPF

  11. Using Relative Neighborhood Graphs for Reliable Database Synchronization in MANETs IEEE SECON WiMESH 2010 Network link SLOT-U link SLOT-D link Synchronized Link Overlay – TriangularExample (1) • Network graph • N: 30 nodes • Grid: 400x400m • Radio range: 150 m

  12. Using Relative Neighborhood Graphs for Reliable Database Synchronization in MANETs IEEE SECON WiMESH 2010 Network link SLOT-U link SLOT-D link Synchronized Link Overlay – TriangularExample (2) • SLOT-U • subgraph

  13. Using Relative Neighborhood Graphs for Reliable Database Synchronization in MANETs IEEE SECON WiMESH 2010 Network link SLOT-U link SLOT-D link Synchronized Link Overlay – TriangularExample (3) • SLOT-D • subgraph

  14. Using Relative Neighborhood Graphs for Reliable Database Synchronization in MANETs IEEE SECON WiMESH 2010 Network link SLOT-U link SLOT-D link Synchronized Link Overlay – TriangularExample (4) • SLOT-D • subgraph (distance-based metrics)

  15. Using Relative Neighborhood Graphs for Reliable Database Synchronization in MANETs IEEE SECON WiMESH 2010 Agenda • Motivation • Our Proposal: SLO-T • An SLO-T Overlay Example • SLO-T Analysis • Application: SLO-T in OSPF

  16. Using Relative Neighborhood Graphs for Reliable Database Synchronization in MANETs IEEE SECON WiMESH 2010 Synchronized Link Overlay – Triangular Analytical Model • Graph model: Unit disk graph • Speed: Constant node speed s • Node distribution: Uniform node density  • Mobility: Independent, isotropic random walk

  17. Using Relative Neighborhood Graphs for Reliable Database Synchronization in MANETs IEEE SECON WiMESH 2010 All links SLOT-D SLOT-U 3,60 2,56  Synchronized Link Overlay – TriangularAnalysis 2D (1) • Avg. number of links per node

  18. Using Relative Neighborhood Graphs for Reliable Database Synchronization in MANETs IEEE SECON WiMESH 2010 All links SLOT-D SLOT-U Synchronized Link Overlay – TriangularAnalysis 2D (2) • Avg. rate of link creation for a fixed relative speed (s)

  19. Using Relative Neighborhood Graphs for Reliable Database Synchronization in MANETs IEEE SECON WiMESH 2010 Synchronized Link Overlay – Triangular Analysis Summary Avg number of overlay links Avg rate of link creation dim () SLOT-D 1 2 2 2 2,56 2,73 3 2,94 1,02 SLOT-U 1 2,77 2 2 3,60 3,60 3 2,50 1,44

  20. Using Relative Neighborhood Graphs for Reliable Database Synchronization in MANETs IEEE SECON WiMESH 2010 Agenda • Motivation • Our Proposal: SLO-T • An SLO-T Overlay Example • SLO-T Analysis • Application: SLO-T in OSPF

  21. Using Relative Neighborhood Graphs for Reliable Database Synchronization in MANETs IEEE SECON WiMESH 2010 42 13 37 42 13 37 SLOT for Unit Cost (SLOT-U) Application: SLOT in OSPF • OSPF: Link-state routing protocol • MANET extension: RFC 5449 • Components: Neighbor sensing (Hello exchange) LSA flooding LSDB synchronization (Adjacencies)

  22. Using Relative Neighborhood Graphs for Reliable Database Synchronization in MANETs IEEE SECON WiMESH 2010 Application: SLOT in OSPF • Adjacencies (synchronized links)

  23. Using Relative Neighborhood Graphs for Reliable Database Synchronization in MANETs IEEE SECON WiMESH 2010 Application: SLOT in OSPF • Control Traffic Overhead

  24. Using Relative Neighborhood Graphs for Reliable Database Synchronization in MANETs IEEE SECON WiMESH 2010 Application: SLOT in OSPF • Data Delivery Ratio

  25. Using Relative Neighborhood Graphs for Reliable Database Synchronization in MANETs IEEE SECON WiMESH 2010 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

  26. Using Relative Neighborhood Graphs for Reliable Database Synchronization in MANETs IEEE SECON WiMESH 2010 Questions ? E-mail: cordero@lix.polytechnique.fr

  27. Using Relative Neighborhood Graphs for Reliable Database Synchronization in MANETs IEEE SECON WiMESH 2010 Backup Slides

  28. Using Relative Neighborhood Graphs for Reliable Database Synchronization in MANETs IEEE SECON WiMESH 2010 Analytical Model Formulae (1) SLOT with distance-based metrics

  29. Using Relative Neighborhood Graphs for Reliable Database Synchronization in MANETs IEEE SECON WiMESH 2010 Analytical Model Formulae (2) SLOT with unit-cost metrics

  30. Using Relative Neighborhood Graphs for Reliable Database Synchronization in MANETs IEEE SECON WiMESH 2010 Analytical Model Formulae (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-7272. April 2010.(publicly available in the Internet: http://hal.inria.fr/docs/00/47/96/89/PDF/RR-7272.pdf)

  31. Using Relative Neighborhood Graphs for Reliable Database Synchronization in MANETs IEEE SECON WiMESH 2010 The SLO-T Algorithm Relative Neighbor Graph (RNG) A B C1 C3 C2 Synchronized Link Overlay, Triangle elimination A B C 42 SLO-T (unit cost) 13 37

  32. Using Relative Neighborhood Graphs for Reliable Database Synchronization in MANETs IEEE SECON WiMESH 2010 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 www.emmanuelbaccelli.org/ospf

  33. Using Relative Neighborhood Graphs for Reliable Database Synchronization in MANETs IEEE SECON WiMESH 2010 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 802.11b • 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

  34. Using Relative Neighborhood Graphs for Reliable Database Synchronization in MANETs IEEE SECON WiMESH 2010 The α parameter

More Related