Radio Disjoint Multi-Path Routing in MANET - PowerPoint PPT Presentation

1 / 26
About This Presentation
Title:

Radio Disjoint Multi-Path Routing in MANET

Description:

Center of Excellence. Wireless and Information Technology. CEWIT 2005 ... Dr. rer. nat. degree and Habilitation, Department of Electrical Engineering, ... – PowerPoint PPT presentation

Number of Views:26
Avg rating:3.0/5.0
Slides: 27
Provided by: ca33138
Category:
Tags: manet | disjoint | multi | path | radio | rer | routing

less

Transcript and Presenter's Notes

Title: Radio Disjoint Multi-Path Routing in MANET


1
Radio Disjoint Multi-Path Routing in MANET
  • Carmelita Görg
  • Mobile Technology Research Center
  • TZI-ikom University of Bremen

2
Abstract
  • MANET research with focus on maintaining multiple
    routing paths mostly concentrate on the
    utilization of multiple paths as backup paths due
    to failures in the main routing path.
  • Simultaneous use of multiple paths could be used
    to split packets of a flow or independent flows.
  • This paper discusses an approach to choose
    multiple paths to be used simultaneously,
    reducing the effect of interference between nodes
    as far as possible, which is termed as radio
    disjoint paths.
  • This paper discusses
  • Simulation results of the use of multi-path
    routing considering the interference between them
    and different load conditions
  • Implementation details of the algorithm to select
    the radio disjoint paths in DYMO protocol

3
Biography
  • Prof. Dr. Carmelita Görg MTRC Mobile Technology
    Research CenterSFB 637 Collaborative Research
    Center tzi-ikom University of Bremen, Germany
  • Diploma degree, Department of Computer Science,
    University of Karlsruhe, Germany
  • Dr. rer. nat. degree and Habilitation,
    Department of Electrical Engineering, Aachen
    University of Technology, Germany
  • Research Interests Performance Analysis of
    Mobile and Wireless Communication Networks,
    Stochastic Simulation, Mobility Support
  • Joint work MTRC (K. Kuladinithi, M. Becker) and
    CEWIT (Samir Das)

4
Agenda
  • Previous research in multi-path routing
    motivation
  • Detailed analysis of the Flow in the Middle
    Problem with simultaneous use of multi-path
    routing
  • How to select multiple routing paths to have
    better performance
  • Implementation details (in DYMO in OPNET)
  • Summary

5
Research in Multi-path (Reactive MANET)
  • Reactive MANET Protocols (Route Discovery Route
    Maintenance) Standards only keep a single path
  • Multi-Path Routing for Reactive Protocols
  • Use of an Alternate/Backup Path (to reduce the
    frequency of route discoveries)
  • AODV-BR, AOMDV, SMR, etc.
  • Load Balancing per packet basis (SMR)

6
Motivation
  • Use of Multi-Path Routing simultaneously
  • Balance the load in the network (Reduce the
    congestion/packet loss in the network)
  • but
  • Probability of interference is higher when using
    multiple routes simultaneously (MANET nodes
    share the same channel)
  • Higher interference -gt Lower performance
  • How to select Multiple Routing Paths with less
    interference (i.e. Radio Disjoint Multi-Path
    Routing)?

7
Radio Disjoint Multi-Path Routing
  • Multiple Routes with less interference,
  • Try to avoid Flow in the Middle Problem
  • Simulation of the Flow in the Middle Problem
  • WLAN nodes set to ad hoc mode
  • In a statically configured environment
  • All nodes use the same frequency channel at 11Mbps

8
Flow in the Middle Problem Simulation Setup
  • LP, MP RP
  • FD (Fully Radio Disjoint) All 3 paths are not
    in the interference of each other
  • PD (Partially Radio Disjoint) Only the MP is in
    the interference of LP and RP
  • ND (Non Radio Disjoint) All 3 paths are in the
    interference of each other

Right Path (RP)
Left Path (LP)
Middle Path (MP)
9
Flow in the Middle Problem (cont.)
  • Results were taken for different loads
  • LL (Low Load)
  • ML (Medium Load)
  • HL (Heavy Load) causes losses at the WLAN layer
    due to congestion (buffer overflows)
  • 2 types of applications
  • Unreliable Transmission, UDP (Video Transmission)
  • Reliable Transmission, TCP (FTP Downloads)

10
Flow in the Middle Problem - FTP
FTP Download Response Time in Seconds
LL (10,000 bytes) LL (10,000 bytes) LL (10,000 bytes) ML (100,000 bytes) ML (100,000 bytes) ML (100,000 bytes) HL (1MB) HL (1MB) HL (1MB)
LP MP RP LP MP RP LP MP RP
FD 0.273 0.281 0.289 1.015 1.018 1.016 11.280 9.189 9.084
FD 0.371 - 0.275 1.841 - 1.035 17.649 - 12.396
FD 0.375 1.830 17.711
PD 0.300 0.331 0.303 1.016 5.244 1.065 9.298 18.487 9.388
PD 0.345 - 0.277 1.860 - 1.005 17.528 - 9.305
PD 0.348 1.869 14.654
ND 0.348 0.405 0.411 5.179 1.743 5.557 20.632 20.754 24.618
ND 0.451 - 0.326 1.348 - 5.380 24.737 - 17.705
ND 0.452 5.520 23.277
No Flow in the Middle Problem
35
-11.6
1.8
0.4
11
Flow in the Middle Problem - FTP
When using a download of 100,000 bytes PD case
Use of 2 Paths Simultaneously (No flow in the
middle problem)
Use of 3 Paths Simultaneously
12
FTP Results Analysis
  • FD case
  • No interference between 3 paths
  • Performance degrades for the Heavy Load due to
    congestion
  • PD case
  • LL Flow in the middle Problem is not visible
    for low loads
  • ML Avoiding MP (No flow in the middle problem)
    causes the performance to improve by
    35
  • HL Avoiding MP will not help due to the
    congestion
  • ND case
  • All 3 paths are suffering heavily due to mutual
    interference
  • Avoiding MP helps to gain 2 performance
    improvement

13
Flow in the Middle Problem Video Transmission
Mean Packets end-to-end delay in ms
LL (5.6kbps) LL (5.6kbps) LL (5.6kbps) ML (56kbps) ML (56kbps) ML (56kbps) HL (840kbps) HL (840kbps) HL (840kbps)
LP MP RP LP MP RP LP MP RP
FD 6.91 6.83 6.75 23.85 23.51 23.72 23.72 23.66 23.67
FD 6.92 - 6.78 28.87 - 23.97 94.57 - 23.69
FD 7.00 41.87 96.29
PD 6.92 6.75 6.88 28.95 36.77 30.36 85.49 3120 85.11
PD 7.16 - 6.86 25.20 - 24.06 95.33 - 23.66
PD 7.12 27.11 94.92
ND 7.01 8.80 11.40 50.51 48.70 49.04 2990 4145 2738
ND 7.40 - 11.41 34.78 - 49.78 2316 - 1342
ND 12.36 54.41 2323
20.5
?
6
?
Packets are lost due to congestion
14
Flow in the Middle Problem Video Transmission
LL (5.6kbps) LL (5.6kbps) LL (5.6kbps) ML (56kbps) ML (56kbps) ML (56kbps) HL (840kbps) HL (840kbps) HL (840kbps)
Delay in WLAN (ms) Data Dropped (bps) Pts Delay Variation (ms) Delay in WLAN (ms) Data Dropped (bps) Pts Delay Variation (ms) Delay in WLAN (ms) Data Dropped (bps) Pts Delay Variation (ms)
FD 1.67 X 3x10-3 4.99 X 10x10-3 5.07 X 23.66
FD 1.71 X 10x10-3 6.73 X 37x10-3 125.52 117,662 49.64
PD 1.69 X 7x10-3 6.40 X 72x10-3 214.30 83,946 886
PD 1.72 X 13x10-3 5.41 X 17x10-3 125.46 117,280 19.41
ND 2.20 X 43x10-3 10.12 86 243x10-3 835.41 227,763 1451
ND 2.54 X 30x10-3 9.80 20 234x10-3 469.27 224,174 428.78
Increase of Load and use of 3 paths
simultaneously (except for FD case) causes -
Higher Packets delay variation (at the
application) - Higher Delay in WLAN - More
Data dropped at WLAN
15
Result Analysis Video Transmission
  • FD case
  • No interference between 3 paths
  • Performance degrades for Heavy Load due to
    congestion
  • PD case
  • LL Flow in the middle Problem is not visible
    for low loads
  • ML Avoiding MP causes performance to improve by
    20
  • HL Avoiding MP will not help due to congestion
    (due to unreliable transmission)
  • ND case
  • All 3 paths are suffering heavily due to mutual
    interference
  • Avoiding MP helps to increase the performance by
    6

16
Comparison of Single Path vs. Simultaneous use of
Multi-Paths
  • Scenario 1
  • FTP 1 Download Response time for multiple
    downloads of the size of 100,000 bytes at each 5
    sec.
  • Video1 Mean of packets end to end delay for
    uni-directional video transmission at the rate of
    350bytes X 2 (5.6 kbps)
  • Video2 Mean of packets end to end delay for
    uni-directional video transmission at the rate of
    350bytes X 2 (5.6 kbps)
  • Scenario 2
  • FTP 1 Download Response time for multiple
    downloads of the size of 100,000 bytes at 5 sec
    each.
  • FTP 2 Download Response time for multiple
    downloads of the size of 100,000 bytes at 5 sec
    each.
  • Video 1 Mean of packets end to end delay for
    uni-directional video transmission at the rate of
    350bytes X 2 (5.6 kbps)

17
Comparison of Single Path vs Simultaneous use of
Multi-Paths
Scenario 1
w.r.t. delays in single path
LP MP RP LP MP RP LP MP RP
FTP 1 (ms) 1043 - - 991 - - 1175 - -
Video 1 (ms) 27.1 - - - - 6.8 - 9.5 -
Video 2 (ms) 32.2 - - - - 6.9 - - 6.9
Radio Disjoint Non-Radio Disjoint
FTP 5 -12.6
Video 77 72
Scenario 2
LP MP RP LP MP RP LP MP RP
FTP 1 2176 - - 1372 - - 3447 - -
FTP 2 2065 - - - - 1941 - 3046 -
Video 1 92.4 - - - - 22.1 - - 9.0
Radio Disjoint Non-Radio Disjoint
FTP 22 -53
Video 76 90
WLAN Delay
Single Path
Radio Disjoint Multi-Path
Non-Radio Disjoint Multi-Path
18
Simultaneous Use of Multi-Path Routing to Improve
Performance
  • Selection of Multi-Path Routing
  • Less Interference
  • Best Use of Fully Radio Disjoint Paths
  • Ok Use of Partially Radio Disjoint
  • Less Load on a path (to avoid congestion)
  • Distribution of Flows (Applications) to Multiple
    Paths
  • Distribute the load so that paths will not be
    overloaded (to avoid congestion)
  • To know the remaining capacity of the path and
    the capacity of application

19
How to Compute Interference Level and Load of a
Path?
  • NL Node Load, PL Path Load, HC Hop Count
  • NL (packets transmitted and received by the
    node X) (packets heard from other nodes in
    the vicinity Y)
  • X Current Load of the Node
  • Y Interference Level of the Node
  • NL is computed by a weighted average over a
    periodical interval to consider the latest value

20
How to Compute the Node Load?
X packets transmitted and received by the
node Y packets heard from other nodes in the
vicinity
IP addr
MAC addr
X1 Y1
X2 Y2
X3 Y3
X4 Y4
X2 Y2
X3 Y3
X4 Y4
X5 Y5
  • Example NL is measured at each 1 sec and up to
    4 measurements are held to compute weighted
    average of the NL (i.e. Avg. Of the past 4 sec)
  • Current Node Load,
  • NL 0.1 (X2Y2) 0.2 (X3Y3) 0.3(X4Y4)
    0.4(X5Y5)

Weighted average to consider the latest values
21
How to Compute Interference Level between Paths?
  • Pathload PL max NL1, NL2 , NL3 , NL4 .. NLm
    , where m Number of nodes in a path
  • Best Path min(PL) considering also the Hop
    Count
  • A path with less interference and less load
  • Implementation Requirements
  • 1. How to compute the path load during the route
    discovery?
  • RREQ should be extended to include NL of each
    node
  • Implementation with interface set to
    promiscuous mode, X Y could be computed and
    packets should be identified based on the MAC
    address
  • 2. Max, number of paths to be selected
  • Threshold value should be defined for max. number
    of routing paths to be used
  • 3. Computation of path load periodically
  • Sending a periodic packet to compute the path
    load even after the first route discovery

22
Details of Simulation
  • Based on DYMO Protocol (OPNET Simulator)
  • DYMO Reactive Protocol like AODV, but with path
    accumulation feature

I1
I2
I3
D
S
RREQ
RREQ
RREQ
RREQ
RREQ
RE-S
RE-S
RE-S
RE-S
RE-I1
RE-I1
RE-I1
RE-I2
RE-I2
RE-I3
RREP
RE-S Route Element with NL of S RE-I1 Route
Element with NL of I1
23
Details of Simulation
Weighted Avg of NL
IP addr
X Y
IP addr
MAC addr
X1 Y1
X2 Y2
X3 Y3
X4 Y4
  • Open Issues
  • Period for the computation of weighted average
  • Any weight between X Y?

24
Summary
  • Investigated the behavior of flow in the middle
    problem in a statically configured environment
  • Simultaneous Use of Multiple Paths in MANET
  • To achieve best performance while selecting less
    interfered and less loaded paths
  • Discussed the implementation of radio disjoint
    multi-path routing in one of the reactive MANET
    protocols (DYMO)

25
Thank YouQuestions Answers
26
Scenario 2
Back
Write a Comment
User Comments (0)
About PowerShow.com