Ameer Shakayb Arsalaan

Embed Size (px)

Citation preview

  • 8/3/2019 Ameer Shakayb Arsalaan

    1/35

    Evaluating Contact-Ignorant and

    History-Based Routing Protocols of

    Disrupted Mobile Networks

    Presented by Ameer Shakayb Arsalaan

    1 Frontiers of Information Technology, 2011

  • 8/3/2019 Ameer Shakayb Arsalaan

    2/35

    Disrupted and Challenged Networks

    Acoustic Network Sensor Network Monitoring Wild Life

    Vehicular Mobile NetworkMilitary Network Deep Space Network

    2 Frontiers of Information Technology, 2011

  • 8/3/2019 Ameer Shakayb Arsalaan

    3/35

    Properties of Disrupted Networks

    ` Lack of end-to-end contacts

    ` Asymmetric data rate on both the directions

    ` No infrastructure available

    ` High BER

    ` Long and variable delays

    3 Frontiers of Information Technology, 2011

  • 8/3/2019 Ameer Shakayb Arsalaan

    4/35

    Types of Disrupted Networks

    ` Highly Mobile` VANET

    ` Small radio ranges

    ` Small contact durations

    ` Highly changing topology

    ` Often go to sleep mode so that to preserve battery power

    ` Static Network Nodes/ Partitioned Network

    ` Little chances of connectivity

    ` Needs some special devices to enhance reachability

    4 Frontiers of Information Technology, 2011

  • 8/3/2019 Ameer Shakayb Arsalaan

    5/35

    WhyTraditional Routing Protocols Fail in

    Disrupted Networks?

    ` Traditional Routing Protocols` Build routing tables

    ` Perform routing by following best path on the basis of some

    metric

    ` Disrupted Networks` Highly Changing topology (Mobile Network)

    ` No frequent connections (Partitioned Network)

    ` Routing tables if generated may be useless when needed

    5 Frontiers of Information Technology, 2011

  • 8/3/2019 Ameer Shakayb Arsalaan

    6/35

    Routing Protocols of Disrupted Network

    ` Contact-Ignorant

    ` Movement of nodes is random

    ` Future contacts are opportunistic

    ` Future is unpredictable

    ` E.g.: Sensor nodes flowing with the direction and waves of water (place on river to

    monitor pollution).

    ` History Based

    ` History of past encounter among nodes are stored

    ` This history is used to predict future encounters and their times

    ` The network must be predictable

    ` It should be somewhat periodic in nature

    ` Deep-space networks where satellites travel within their orbits, they come within eachothers range at certain points in time

    ` Real life scenario

    A student goes to university in morning, comes back to home at noon, visits his

    friend at evening and so on

    6 Frontiers of Information Technology, 2011

  • 8/3/2019 Ameer Shakayb Arsalaan

    7/35

    Prominent Contact-Ignorant

    Routing Protocols

    7 Frontiers of Information Technology, 2011

  • 8/3/2019 Ameer Shakayb Arsalaan

    8/35

    1. Direct Delivery (Contact-Ignorant)

    ` Source delivers bundle directly to destination

    A

    D E

    B C C

    E

    BA

    D

    DA

    BC

    E

    A

    D

    B

    CE

    8 Frontiers of Information Technology, 2011

    (3) (4)

    (2)(1)

  • 8/3/2019 Ameer Shakayb Arsalaan

    9/35

    2. First Contact (Contact Ignorant)

    ` Source Hands over bundle to the first encountered Node

    A

    D

    E

    B C C

    E

    BA

    D

    DA

    B C

    E

    A

    D

    B

    CE

    9 Frontiers of Information Technology, 2011

    (3)

    (1) (2)

    (4)

  • 8/3/2019 Ameer Shakayb Arsalaan

    10/35

    3. Epidemic (Contact-Ignorant)` A node holding bundle floods it via the whole network

    A

    DE

    B C C

    E

    BA

    D

    DA

    B C

    E

    A

    D

    B

    CE

    10 Frontiers of Information Technology, 2011

    (1) (2)

    (4)(3)

  • 8/3/2019 Ameer Shakayb Arsalaan

    11/35

    4. Spray and Wait Binary (Contact-Ignorant)

    . Source generate 2k bundle copies

    .A node containing more than one bundle copies hands over half to the encountered node

    .When a node is left with single copy it is given only to the destination

    A

    DE

    B C4 C

    E

    BA

    22

    D

    D

    1A

    1

    B C

    1 1

    E

    A

    D

    B

    CE

    1

    1

    1

    1

    11 Frontiers of Information Technology, 2011

    (1) (2)

    (3) (4)

  • 8/3/2019 Ameer Shakayb Arsalaan

    12/35

    5. Spray and Wait Normal (Contact-Ignorant). Source generate L bundle copies

    .A node containing more than one bundle copies hands over one copy to the

    encountered node

    .When a node is left with single copy it is given only to the destination

    A

    DE

    B C3 C

    E

    BA

    21

    D

    D

    1A

    1

    B C1

    E

    A

    D

    B

    C

    E1 1

    1

    12 Frontiers of Information Technology, 2011(3)

    (1) (2)

    (4)

  • 8/3/2019 Ameer Shakayb Arsalaan

    13/35

    Prominent History-Based

    Routing Protocols

    13 Frontiers of Information Technology, 2011

  • 8/3/2019 Ameer Shakayb Arsalaan

    14/35

    1. Probabilistic Routing with History of Encounters

    and Transitivity- PRoPHET (History-Based)

    ` A variable called Delivery Predictability (DP) is maintained between any two nodes

    X and Y

    ` Encounter: DP(X,Y) is high when X and Y frequently encounter each other and

    vice versa

    ` Transitivity: DP(X,Y) is increased if DP(X,Z) and DP(Y,Z) if increased

    ` Aging: While X and Y are out of range their mutual DP will decrease gradually

    ` Single Copy Protocol

    ` Routing is done intelligent

    ` If X wants to transmit a message to Z and X encounters Y,

    ` If DP(X,Z) < DP(Y,Z), then X will hand over message to Y

    14 Frontiers of Information Technology, 2011

  • 8/3/2019 Ameer Shakayb Arsalaan

    15/35

    1. PRoPHET (History-Based)DP(B,E)=0.5 , DP(A,E)=0.7, DP(D,E)=0.9

    A

    DE

    B C C

    E

    BA

    D

    DA

    B C

    E

    A

    D

    BC

    E

    15 Frontiers of Information Technology, 2011

    (3)

    (1)

    (4)

    (2)

  • 8/3/2019 Ameer Shakayb Arsalaan

    16/35

    2. Neighborhood Contact History Routing

    Protocol (NECTAR History-Based)

    ` Neighborhood Index (NI) is a variable that showscontact history between any two nodes

    ` NI(X,Y) increases when X and Y encounters and during

    their contact duration

    ` NI(X,Y) decreases while X and Y are away from one another

    ` Routing Strategy

    ` Conditional message replication is performed if message is

    quite new in the network and the encountered node has

    free space more than a specific threshold value` After condition fails intelligent routing is performed on the

    basis of NI

    16 Frontiers of Information Technology, 2011

  • 8/3/2019 Ameer Shakayb Arsalaan

    17/35

    Strategy for Conditional Message Replication

    ` Perimeters` initialTTL= Value of bundles TTL at its creation (e.g. 10)

    ` currTTL= Current TTL value of the bundle (e.g. 9)

    ` Threshold= storage space (e.g. 5MB)

    ` minEV= min epidemic value (e.g 2)

    ` maxEV=max epidemic value (e.g. 4)` Strategy

    ` When a node containing bundle encounters an other node it checks following

    condition

    ` If((initialTTL-currTTL)

  • 8/3/2019 Ameer Shakayb Arsalaan

    18/35

  • 8/3/2019 Ameer Shakayb Arsalaan

    19/35

    Four Metrics On the Basis of whichRouting Protocols are Evaluated

    19 Frontiers of Information Technology, 2011

  • 8/3/2019 Ameer Shakayb Arsalaan

    20/35

    ` Data delivery delay (T1-T0)- Fig(a)

    (a)

    T0 T1

    ` Load laid upon the system in terms of bundle replicas generated (4)-Fig(b)

    (b)

    ` Load laid upon the system in terms of number of contacts used (3)-Fig(b)

    ` Data delivery ratio (50%)-Fig (c)(c)

    S D

    S

    A

    B

    D

    S

    A

    B

    D

    20 Frontiers of Information Technology, 2011

  • 8/3/2019 Ameer Shakayb Arsalaan

    21/35

    Case Study

    21 Frontiers of Information Technology, 2011

  • 8/3/2019 Ameer Shakayb Arsalaan

    22/35

    Evaluating Routing Protocols in Disrupted

    Mobile Network

    DTN-Rsim v1.1 (Simulator)` An event-based routing simulator built in Java

    ` It has ability to evaluate contact-Ignorant, history-based and device-

    based routing scheme

    ` Mobility patterns can be

    Random Pseudorandom

    Map-Based

    ` Network can be

    Static/ Highly mobile/ Partitioned with limited mobility

    ` Deployment Type Real world/ Grid-based/ Random deployment

    Any number, type, speed and radio-range of nodes

    22 Frontiers of Information Technology, 2011

  • 8/3/2019 Ameer Shakayb Arsalaan

    23/35

    Case Study

    ` Perimeters for Simulation

    ` Simulation Environment: Highly Mobile -Total Number of Nodes: 20(R1-R20)

    ` Buffer Space: 20MB - Speed: 80 m/s -Radio range:5m

    ` Mobility Pattern=Random for CI and pseudorandom for HB

    ` Number of Simuations=3

    End Nodes and Their Bundles

    Table 1. Detailsend-nodesandtheirbundles

    23 Frontiers of Information Technology, 2011

  • 8/3/2019 Ameer Shakayb Arsalaan

    24/35

    Direct Delivery

    24 Frontiers of Information Technology, 2011

  • 8/3/2019 Ameer Shakayb Arsalaan

    25/35

    First Contact

    25 Frontiers of Information Technology, 2011

  • 8/3/2019 Ameer Shakayb Arsalaan

    26/35

    Epidemic Routing Protocol

    26 Frontiers of Information Technology, 2011

  • 8/3/2019 Ameer Shakayb Arsalaan

    27/35

    Spray and Wait Binary

    27 Frontiers of Information Technology, 2011

  • 8/3/2019 Ameer Shakayb Arsalaan

    28/35

  • 8/3/2019 Ameer Shakayb Arsalaan

    29/35

    PRoPHET

    29 Frontiers of Information Technology, 2011

  • 8/3/2019 Ameer Shakayb Arsalaan

    30/35

    NECTAR

    30 Frontiers of Information Technology, 2011

  • 8/3/2019 Ameer Shakayb Arsalaan

    31/35

    Result And Discussion

    31 Frontiers of Information Technology, 2011

  • 8/3/2019 Ameer Shakayb Arsalaan

    32/35

    Tabular Result

    32 Frontiers of Information Technology, 2011

  • 8/3/2019 Ameer Shakayb Arsalaan

    33/35

    Better Analysis via Chart

    33 Frontiers of Information Technology, 2011

  • 8/3/2019 Ameer Shakayb Arsalaan

    34/35

    Conclusion

    ` Contact-Ignorant Routing Protocols` Simple Algorithm, work in unpredictable environment

    ` High Reliability Stress on network (More message copies/ high bandwidth utilization)

    ` High Data Delivery Ratio Flooding/ Multiple message replicas

    ` Low Data Delivery Latency Flooding/ Multiple message replicas

    ` (Single Copy)Better utilization of network resources Great Latency, low delivery

    ratio

    ` History Based Routing Protocols

    ` Complex Algorithms, needs much processing time

    ` Much Lower Latency and almost 100% delivery rate with multi-copy intelligent routing

    strategy

    Best Routing Strategy Depends Upon Knowledge about Network and

    Quality of Service Needed

    Frontiers of Information Technology, 201134

  • 8/3/2019 Ameer Shakayb Arsalaan

    35/35

    END

    35 Frontiers of Information Technology, 2011