XOR Network Coding for Data Mule Delay Tolerant Networks (Invited - PowerPoint PPT Presentation

XOR Network Coding for Data Mule Delay Tolerant Networks (Invited Paper for IEEE/CIC ICCC 2015) Qiankun Su, Katia Jaffr` es-Runser, Gentian Jakllari and Charly Poulliat November 4 th , 2015

Outline Introduction 1 Scenario descriptions Motivation Theoretical analysis and simulation results 2 Village-to-village Village-to-village of N v villages Village-to-village with different overlapping intervals Extension to a real network 3 XOR NC for Data Mule DTNs Qiankun SU et al. IEEE/CIC ICCC 2015 1 / 21

Scenario descriptions city village 1 village 2 Fig. 1 : A village-to-village communication network No infrastructure between remote villages and the city XOR NC for Data Mule DTNs Qiankun SU et al. IEEE/CIC ICCC 2015 2 / 21

Scenario descriptions bus 1 city bus 2 village 1 village 2 Fig. 1 : A village-to-village communication network No infrastructure between remote villages and the city Communications rely on data mules: bus1, bus2 Messages take time to arrive XOR NC for Data Mule DTNs Qiankun SU et al. IEEE/CIC ICCC 2015 2 / 21

Scenario descriptions bus 1 city bus 2 village 1 village 2 Fig. 1 : A village-to-village communication network No infrastructure between remote villages and the city Communications rely on data mules: bus1, bus2 Messages take time to arrive Data mule delay tolerant networks XOR NC for Data Mule DTNs Qiankun SU et al. IEEE/CIC ICCC 2015 2 / 21

Problem definition P2 P1 P2 P1 bus 2 bus 1 village 2 village 1 city Fig. 2 : A village-to-village communication network The bandwidth is divided among contending nodes The fair media access control, such as CSMA, TDMA XOR NC for Data Mule DTNs Qiankun SU et al. IEEE/CIC ICCC 2015 3 / 21

Problem definition P2 P1 P2 P1 bus 2 bus 1 village 2 village 1 city Fig. 2 : A village-to-village communication network The bandwidth is divided among contending nodes The fair media access control, such as CSMA, TDMA The bus base station needs twice bandwidth as much as the buse XOR NC for Data Mule DTNs Qiankun SU et al. IEEE/CIC ICCC 2015 3 / 21

Problem definition P2 P1 P2 P1 bus 2 bus 1 village 2 village 1 city Fig. 2 : A village-to-village communication network The bandwidth is divided among contending nodes The fair media access control, such as CSMA, TDMA The bus base station needs twice bandwidth as much as the buse XOR network coding XOR NC for Data Mule DTNs Qiankun SU et al. IEEE/CIC ICCC 2015 3 / 21

XOR network coding benefits P1 P2 1 2 B1 City B2 3 4 (a) without network coding P1 P2 1 2 B1 City B2 3 P3 = P3 P2 = P1 P1 P2 P3 P1 P2 = (b) with network coding Fig. 3 : Inter-session XOR network coding benefit Benefits: Save one transmission Balance the bandwidth between the city and the buses XOR NC for Data Mule DTNs Qiankun SU et al. IEEE/CIC ICCC 2015 4 / 21

Outline Introduction 1 Scenario descriptions Motivation Theoretical analysis and simulation results 2 Village-to-village Village-to-village of N v villages Village-to-village with different overlapping intervals Extension to a real network 3 XOR NC for Data Mule DTNs Qiankun SU et al. IEEE/CIC ICCC 2015 5 / 21

Modelling t c 1 message / Δ unit time 1 message / Δ unit time B1 City B2 t v V1 V2 t v t b t b Fig. 4 : A basic village-to-village communication network model Assumption: A homogeneous setting: the same bus waiting time at villages ( t v ) and the city ( t c ) the same travelling time for buses t b the same arrival and departure time of buses Each packet takes a unit time for transmission XOR NC for Data Mule DTNs Qiankun SU et al. IEEE/CIC ICCC 2015 6 / 21

Analysis (1/2) The delivery probability gain G p = P nc − P where P nc = N nc / (2 · L ), the delivery prob. with network coding P = N / (2 · L ), the delivery prob. without network coding L = T / ∆, number of messages carried by one bus T = 2 t b + t v + t c , round-trip time of a bus Derive a mathematical relationship: G p = f (∆) G p the delivery probability gain ∆ message creation period at villages XOR NC for Data Mule DTNs Qiankun SU et al. IEEE/CIC ICCC 2015 7 / 21

Analysis (2/2) G p = f (∆) t c  G p = ∆ · 6 · T , ∆ < 3 · T / t c     t c G p = 2 − 2 · T · ∆ , ∆ ∈ [3 · T / t c , 4 · T / t c )     G p = 0 , ∆ ≥ 4 · T / t c While ∆ = 3 · T / t c , G p reaches the maximum, i.e., 1 / 2 XOR NC for Data Mule DTNs Qiankun SU et al. IEEE/CIC ICCC 2015 8 / 21

Simulation results (1/2) The ONE (Opportunistic Network Environment) simulator Assign 100 to t v , t b , t c The delivery probability in different intervals 1.0 0.9 0.8 0.48 0.7 The delivery probability 0.6 0.5 0.4 0.3 With XOR, simulation 0.2 Without XOR, simulation With XOR, theory 0.1 Without XOR, theory 0.0 1 3 6 9 12 16 20 The message interval (s) Fig. 5 : The delivery probability for the basic village-to-village scenario XOR NC for Data Mule DTNs Qiankun SU et al. IEEE/CIC ICCC 2015 9 / 21

Simulation results (2/2) The overhead ratio in di ff erent message intervals The average latency in di ff erent message intervals 10 4500 With XOR With XOR Without XOR Without XOR 4000 9 3500 8 The average latency The overhead ratio 3000 7 2500 6 2000 5 1500 4 1000 3 500 1 3 6 9 12 16 20 1 3 6 9 12 16 20 The message interval (s) The message interval (s) Fig. 6 : Overhead ratio (left) and average latency (right) for N v = 2 The overhead ratio The ratio of the number of transmissions to the number of messages delivered. XOR NC for Data Mule DTNs Qiankun SU et al. IEEE/CIC ICCC 2015 10 / 21

Outline Introduction 1 Scenario descriptions Motivation Theoretical analysis and simulation results 2 Village-to-village Village-to-village of N v villages Village-to-village with different overlapping intervals Extension to a real network 3 XOR NC for Data Mule DTNs Qiankun SU et al. IEEE/CIC ICCC 2015 11 / 21

Village-to-village of N v villages N v : the number of villages N v / 2 pair-wise cross flows V n B n city B n/2+2 B 2 V 2 V n/2+2 B n/2 Fig. 7 : Village-to-village communication of N v villages XOR NC for Data Mule DTNs Qiankun SU et al. IEEE/CIC ICCC 2015 12 / 21

Analysis G p = f ( N v , ∆) t c · ∆  G p = N v · ( N v + 1) · T , ∆ ≤ ( N v + 1) · T / t c        G p = t c · ∆ � ( N v + 1) · T , 3 · N v · T �   N v · T − 1 , ∆ ∈   t c 2 · t c  G p = 2 − t c · ∆ � 3 · N v · T , 2 · N v · T �  , ∆ ∈   T · N v 2 · t c t c      ∆ ≥ 2 · N v · T   G p = 0 ,   t c where G p the delivery probability gain ∆ the message creation period N v the number of villages The maximum gain G p = 1 / 2, while ∆ = 3 · N v · T 2 · t c XOR NC for Data Mule DTNs Qiankun SU et al. IEEE/CIC ICCC 2015 13 / 21

Simulation results of 4 villages Assign 100 to t v , t b , t c , 4 to N v The delivery probability in di ff erent message intervals 1 With XOR Without XOR 0.9 0.8 The delivery probability 0.7 0.6 0.5 0.4 0.3 0.2 0.1 0 1 5 10 20 24 32 40 The message interval (s) Fig. 8 : The delivery probability for 4 villages ( N v = 4) XOR NC for Data Mule DTNs Qiankun SU et al. IEEE/CIC ICCC 2015 14 / 21

Outline Introduction 1 Scenario descriptions Motivation Theoretical analysis and simulation results 2 Village-to-village Village-to-village of N v villages Village-to-village with different overlapping intervals Extension to a real network 3 XOR NC for Data Mule DTNs Qiankun SU et al. IEEE/CIC ICCC 2015 15 / 21

Village-to-village with different overlapping intervals t c bus1 overlapping bus2 t 12 t 1 t 2 Fig. 9 : Overlapping intervals With the assumption of t 1 = t 2 , G p = f ( t 12 ) G p = t 12 6 · T · ∆ (the base station cannot drain messages) XOR NC for Data Mule DTNs Qiankun SU et al. IEEE/CIC ICCC 2015 16 / 21

Simulation results Assign 100 to t v , t b , t c , 12 to ∆, The delivery probability in di ff erent overlapping intervals 1 With XOR 0.95 Without XOR 0.9 The delivery probability 0.85 0.8 0.75 0.7 0.65 0.6 0.55 0.5 0.45 0 20 40 60 80 100 The overlapping interval (s) Fig. 10 : The delivery probability in different overlapping intervals ( N v = 2) XOR NC for Data Mule DTNs Qiankun SU et al. IEEE/CIC ICCC 2015 17 / 21

Outline Introduction 1 Scenario descriptions Motivation Theoretical analysis and simulation results 2 Village-to-village Village-to-village of N v villages Village-to-village with different overlapping intervals Extension to a real network 3 XOR NC for Data Mule DTNs Qiankun SU et al. IEEE/CIC ICCC 2015 18 / 21

Extension to a real networks (1/2) Tiss´ eo Toulouse open data the overlapping time of pair of buses the amount of data that two buses can exchange one day 1 D = [ min ( t 1 , t 2) + · t 12] · R (1) 3 2 Dnc = [ min ( t 1 , t 2) + · t 12] · R (2) 3 The throughput gain G t = ( D nc − D ) / D where R , bit rate or transmission rate of base station D , amount of data exchanged without network coding D nc , amount of data exchanged with network coding XOR NC for Data Mule DTNs Qiankun SU et al. IEEE/CIC ICCC 2015 19 / 21