Presentation is loading. Please wait.

Presentation is loading. Please wait.

Header Store & Haul Improving Mobile Ad-Hoc Network Connectivity through Repeated Controlled Flooding Thesis Presentation Robert Tyson Thedinger Department.

Similar presentations


Presentation on theme: "Header Store & Haul Improving Mobile Ad-Hoc Network Connectivity through Repeated Controlled Flooding Thesis Presentation Robert Tyson Thedinger Department."— Presentation transcript:

1 header Store & Haul Improving Mobile Ad-Hoc Network Connectivity through Repeated Controlled Flooding Thesis Presentation Robert Tyson Thedinger Department of Electrical Engineering and Computer Science University of Kansas 5/16/2019 Store & Haul 1

2 Store & Haul Abstract This work investigates the benefits and drawbacks of repeating controlled flooding at different intervals in mobile ad hoc networks (MANETs) to overcome episodic connectivity. Specifically, the thesis examines the efficiencies in repeating transmissions by quantifying the packet delivery ratio (PDR) and recording the resulting delays in different types of MANET scenarios. These scenarios mainly focus on partitions within the simulated networks by varying node density and mobility. The nodes store transmitted data and haul it across the MANET in the hope that it will come in range of the destination. A customized version of Network Simulator 2 (ns-2) is used to create the simulations. A qualitative analysis follows and conclusions are drawn as to what types of scenarios benefit or suffer from increased transmissions at varied time intervals.

3 Store & Haul Introduction
header Store & Haul Introduction Background S&H with RCF Simulations Analysis Conclusions Questions 5/16/2019 Store & Haul 3 3 3

4 Store & Haul Background
header Store & Haul Background Background Controlled Flooding Problems with flooding… Epidemic S&H with RCF Simulations Analysis Conclusions Questions 5/16/2019 Store & Haul 4 4 4

5 Store & Haul Background
header Store & Haul Background Background Controlled Flooding MANETs Common Routing Protocols 5/16/2019 Store & Haul 5 5 5

6 Store & Haul Background
header Store & Haul Background DTNs IPN Epidemic Message Ferrying SCF 5/16/2019 Store & Haul 6 6 6

7 Store & Haul Controlled Flooding
header Store & Haul Controlled Flooding Controlled Flooding A B 5/16/2019 Store & Haul 7 7 7

8 Store & Haul Controlled Flooding
header Store & Haul Controlled Flooding Controlled Flooding - Problems A B Node Density Decreased – More Partitioned Network 5/16/2019 Store & Haul 8 8 8

9 header Store & Haul Epidemic Epidemic A B 5/16/2019 Store & Haul 9 9 9

10 Store & Haul S&H with RCF
header Store & Haul S&H with RCF Background S&H with RCF Simulations Analysis Conclusions Questions 5/16/2019 Store & Haul 10 10 10

11 Store & Haul S&H with RCF
header Store & Haul S&H with RCF S&H with RCF Take S&H from Epidemic Do not store messages permanently in memory Repeat the Controlled Flooding 5/16/2019 Store & Haul 11 11 11

12 Store & Haul S&H with RCF
header Store & Haul S&H with RCF Flooding – Problems (revisited) A B 5/16/2019 Store & Haul 12 12 12

13 Store & Haul S&H with RCF
header Store & Haul S&H with RCF S&H with RCF A B 5/16/2019 Store & Haul 13 13 13

14 Store & Haul S&H with RCF
header Store & Haul S&H with RCF More S&H with RCF… A B 5/16/2019 Store & Haul 14 14 14

15 Store & Haul S&H with RCF
header Store & Haul S&H with RCF Stop Stop Stop Fwd up stack Drop Packet Drop Packet Yes Yes Yes Destination? Already Recvd? n ≤ 0? Start Recv Packet Repeat Tx (n-1) n = total number of transmissions tD = interval between tranmissions (assumes n>1) Wait Interval tD 5/16/2019 Store & Haul 15 15 15

16 Store & Haul S&H with RCF
header Store & Haul S&H with RCF Considerations Node Speed Node Density Simulation Variables Network Density (P) Number of Transmissions (n) Interval Between Transmissions (Δt) 5/16/2019 Store & Haul 16 16 16

17 Store & Haul Simulations
header Store & Haul Simulations Background S&H with RCF Simulations Analysis Conclusions Questions 5/16/2019 Store & Haul 17 17 17

18 Store & Haul Simulations
header Store & Haul Simulations Simulations ns-2 Trace Files ns-2 Modifications 5/16/2019 Store & Haul 18 18 18

19 Store & Haul Simulations
header Store & Haul Simulations Simulation Parameters Parameter Value _ Routing S&H with RCF Area 1000m x 1000m Num of nodes 30 Simulation time 1000 [s] MAC type 802.11 Mobility model Random Waypoint Bandwidth 54Mbps Antenna direction Omni 5/16/2019 Store & Haul 19 19 19

20 Store & Haul Simulations
header Store & Haul Simulations Simulation Scenarios Variable Description Possible Values _ n Number of Transmissions (total) 2 tx, 3 tx, 5 tx Δt Interval between Transmissions 1 s, 3 s, 5 s, 10 s 20 s, 40 s, 60 s 1 part (contiguous), 2 part, 3 part, 5 part, 8 part, 10 part, 12 part P Average Number of Partitions 5/16/2019 Store & Haul 20 20 20

21 Store & Haul Analysis Background S&H with RCF Simulations Analysis
header Store & Haul Analysis Background S&H with RCF Simulations Analysis Conclusions Questions 5/16/2019 Store & Haul 21 21 21

22 header Store & Haul Analysis Analysis of Δt in 1 s, 3 s, 5 s scenarios (PDR and Delay) 5/16/2019 Store & Haul 22 22 22

23 header Store & Haul Analysis Analysis of n in 2 tx, 3 tx, 5 tx scenarios (PDR and Delay) 5/16/2019 Store & Haul 23 23 23

24 header Store & Haul Analysis Analysis of n in 2 tx, 3 tx, 5 tx scenarios (PDR and Delay) 5/16/2019 Store & Haul 24 24 24

25 header Store & Haul Analysis Analysis of P in 2, 5, 8, and 12 partition scenarios (PDR and Delay) 5/16/2019 Store & Haul 25 25 25

26 header Store & Haul Analysis Analysis of Δt in 1 s, 3 s, 5 s scenarios (PDR and Delay) 5/16/2019 Store & Haul 26 26 26

27 header Store & Haul Analysis Analysis of P in 2, 5, 8, and 12 partition scenarios (PDR and Delay) 5/16/2019 Store & Haul 27 27 27

28 Store & Haul Conclusions
header Store & Haul Conclusions Background S&H with RCF Simulations Analysis Conclusions Future Work Questions 5/16/2019 Store & Haul 28 28 28

29 Store & Haul Conclusions
header Store & Haul Conclusions Conclusions New paradigm can bring increased PDR to segregated MANETs Simple yet effective There are limitations and tradeoffs 5/16/2019 Store & Haul 29 29 29

30 Store & Haul Conclusions
header Store & Haul Conclusions Future Work Direct comparison to Epidemic More extensive testing to find plateaus and trends Real time adjustments Different combinations – progressive combinations (1, 3, 5) Energy consumption Security concerns 5/16/2019 Store & Haul 30 30 30

31 Store & Haul Questions Background S&H with RCF Simulations Analysis
header Store & Haul Questions Background S&H with RCF Simulations Analysis Conclusions Questions 5/16/2019 Store & Haul 31 31 31

32 Store & Haul Question and Answer
header Store & Haul Question and Answer Questions? 5/16/2019 Store & Haul 32 32 32

33 Store & Haul Introduction
header Store & Haul Introduction Segregated Regions in MANETs 5/16/2019 Store & Haul 33 33 33

34 Store & Haul Introduction
header Store & Haul Introduction Segregated Regions in MANETs 5/16/2019 Store & Haul 34 34 34


Download ppt "Header Store & Haul Improving Mobile Ad-Hoc Network Connectivity through Repeated Controlled Flooding Thesis Presentation Robert Tyson Thedinger Department."

Similar presentations


Ads by Google