360 likes | 497 Vues
7 th IEEE International Conference on Mobile Ad-hoc and Sensor Systems IEEE MASS 2010 San Francisco, CA (United States), November 8 – 12, 2010. MASS. Optimization of Critical Data Synchronization via Link Overlay RNG in Mobile Ad hoc Networks.
E N D
7th IEEE International Conference on Mobile Ad-hoc and Sensor Systems IEEE MASS 2010 San Francisco, CA (United States), November 8 – 12, 2010 MASS Optimization of Critical Data Synchronization via Link Overlay RNG in Mobile Ad hoc Networks Emmanuel Baccelli Juan Antonio Cordero Philippe Jacquet Équipe Hipercom, INRIA Saclay (France)
Optimization of Critical Data Synchronization via Link Overlay RNG in Mobile Ad hoc Networks IEEE MASS 2010 • Rationale 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 Synchronized Overlay Rationale (1) Reliable communication of critical data in MANETs
Optimization of Critical Data Synchronization via Link Overlay RNG in Mobile Ad hoc Networks IEEE MASS 2010 Rationale (and 2) • MANET link synchronization is costly • Overlay requirements: • Low overlay density • Low overlay link change rate
Optimization of Critical Data Synchronization via Link Overlay RNG in Mobile Ad hoc Networks IEEE MASS 2010 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 Relative Neighborhood Graph (RNG) SLOT Uniform Costs SLOT Distance-based Costs Our Proposal: SLO-T Synchronized Link Overlay – Triangular (SLOT)
Optimization of Critical Data Synchronization via Link Overlay RNG in Mobile Ad hoc Networks IEEE MASS 2010 Our Proposal Relative Neighbor Graph (RNG) • Mathematical definition (Toussaint, 1980) • Intuitive definition u v
Optimization of Critical Data Synchronization via Link Overlay RNG in Mobile Ad hoc Networks IEEE MASS 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
Optimization of Critical Data Synchronization via Link Overlay RNG in Mobile Ad hoc Networks IEEE MASS 2010 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 Network link SLOT-U link SLOT-D link Synchronized Link Overlay – TriangularExample (1) • Network graph • N: 30 nodes • Grid: 400x400m • Radio range: 150 m
Optimization of Critical Data Synchronization via Link Overlay RNG in Mobile Ad hoc Networks IEEE MASS 2010 Network link SLOT-U link SLOT-D link Synchronized Link Overlay – TriangularExample (2) • SLOT-U • subgraph
Optimization of Critical Data Synchronization via Link Overlay RNG in Mobile Ad hoc Networks IEEE MASS 2010 Network link SLOT-U link SLOT-D link Synchronized Link Overlay – TriangularExample (3) • SLOT-D • subgraph
Optimization of Critical Data Synchronization via Link Overlay RNG in Mobile Ad hoc Networks IEEE MASS 2010 Network link SLOT-U link SLOT-D link Synchronized Link Overlay – TriangularExample (and 4) • SLOT-D • subgraph (distance-based metrics)
Optimization of Critical Data Synchronization via Link Overlay RNG in Mobile Ad hoc Networks IEEE MASS 2010 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 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 All links SLOT-D SLOT-U 3,60 2,56 Synchronized Link Overlay – TriangularAnalysis 2D (1) • Avg. number of links per node
Optimization of Critical Data Synchronization via Link Overlay RNG in Mobile Ad hoc Networks IEEE MASS 2010 All links SLOT-D SLOT-U Synchronized Link Overlay – TriangularAnalysis 2D (and 2) • Avg. rate of link creation for a fixed node speed s
Optimization of Critical Data Synchronization via Link Overlay RNG in Mobile Ad hoc Networks IEEE MASS 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
Optimization of Critical Data Synchronization via Link Overlay RNG in Mobile Ad hoc Networks IEEE MASS 2010 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 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: Topology selection LSA flooding LSDB synchronization (Adjacencies)
Optimization of Critical Data Synchronization via Link Overlay RNG in Mobile Ad hoc Networks IEEE MASS 2010 Application: SLOT in OSPF • Adjacencies (synchronized links)
Optimization of Critical Data Synchronization via Link Overlay RNG in Mobile Ad hoc Networks IEEE MASS 2010 Application: SLOT in OSPF • Control Traffic Overhead
Optimization of Critical Data Synchronization via Link Overlay RNG in Mobile Ad hoc Networks IEEE MASS 2010 Application: SLOT in OSPF • Data Delivery Ratio
Optimization of Critical Data Synchronization via Link Overlay RNG in Mobile Ad hoc Networks IEEE MASS 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
Optimization of Critical Data Synchronization via Link Overlay RNG in Mobile Ad hoc Networks IEEE MASS 2010 Questions ? E-mail: cordero@lix.polytechnique.fr
Optimization of Critical Data Synchronization via Link Overlay RNG in Mobile Ad hoc Networks IEEE MASS 2010 Backup Slides
Optimization of Critical Data Synchornization via Link Overlay RNG in Mobile Ad hoc Networks IEEE MASS 2010 Impact of Distance in SLOT Link Selection
Optimization of Critical Data Synchornization via Link Overlay RNG in Mobile Ad hoc Networks IEEE MASS 2010 Synchronized Link Overlay (SLO) • Mathematical definition • Intuitive definition 10 A B 2 2 C1 2 C2
Optimization of Critical Data Synchornization via Link Overlay RNG in Mobile Ad hoc Networks IEEE MASS 2010 Analytical Model Formulae (1) SLOT with distance-based metrics
Optimization of Critical Data Synchornization via Link Overlay RNG in Mobile Ad hoc Networks IEEE MASS 2010 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 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-7272. April 2010.(publicly available in the Internet: http://hal.inria.fr/docs/00/47/96/89/PDF/RR-7272.pdf)
Optimization of Critical Data Synchornization via Link Overlay RNG in Mobile Ad hoc Networks IEEE MASS 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
Optimization of Critical Data Synchornization via Link Overlay RNG in Mobile Ad hoc Networks IEEE MASS 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
Optimization of Critical Data Synchornization via Link Overlay RNG in Mobile Ad hoc Networks IEEE MASS 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
Optimization of Critical Data Synchornization via Link Overlay RNG in Mobile Ad hoc Networks IEEE MASS 2010 The α parameter