Reliable multisource multicast routing protocol over manet
This presentation is the property of its rightful owner.
Sponsored Links
1 / 50

Reliable Multisource multicast routing protocol over manet PowerPoint PPT Presentation


  • 97 Views
  • Uploaded on
  • Presentation posted in: General

Reliable Multisource multicast routing protocol over manet. Speaker: Wu, Chun-Ting Advisor : Ke , Kai-Wei. Outline. Introduction Efficient Expanding Ring Search (ERS) Mobility Prediction (MP) Virtual Mesh (VM) Bidirectional multicast data delivery (BMD) Numerical Results

Download Presentation

Reliable Multisource multicast routing protocol over manet

An Image/Link below is provided (as is) to download presentation

Download Policy: Content on the Website is provided to you AS IS for your information and personal use and may not be sold / licensed / shared on other websites without getting consent from its author.While downloading, if for some reason you are not able to download a presentation, the publisher may have deleted the file from their server.


- - - - - - - - - - - - - - - - - - - - - - - - - - E N D - - - - - - - - - - - - - - - - - - - - - - - - - -

Presentation Transcript


Reliable multisource multicast routing protocol over manet

Reliable Multisource multicast routing protocol over manet

Speaker: Wu, Chun-Ting Advisor: Ke, Kai-Wei


Outline

Outline

  • Introduction

  • Efficient Expanding Ring Search (ERS)

  • Mobility Prediction (MP)

  • Virtual Mesh (VM)

  • Bidirectional multicast data delivery (BMD)

  • Numerical Results

  • Future works & Conclusions


1 introduction

1. Introduction

  • My Research – Reliable Multisource Multicast Routing Protocol (RMMRP)

  • Motivation

    • Improve the efficiency of Multisource multicast over MANET

  • Objective

    • Reduce control overhead

    • More stable topology

    • Fast recovery


Maodv review

MAODV Review

  • Data Delivery Process

    • Unicast

    • Multicast

  • Group Managements

    • Join

    • Leave

    • Repair

    • Merge


Unicast delivery

Unicast Delivery

RREQ

Source

Source

Source

Data

RREP

Destination

Destination

Destination


Multicast delivery

Multicast Delivery

Leader

Source

Leader

Source

Source broadcast RREQs

to find the group leader


Multicast delivery1

Multicast Delivery

Leader

Source

Leader

Source

Leader respond a RREP

The data passed to Leader

and flooded to the tree


Reliable multisource multicast routing protocol over manet

Join

Group Leader

member

router

join node

Broadcast Join RREQ across network


Reliable multisource multicast routing protocol over manet

Join

Group Leader

member

router

join node

Members respond with RREPs


Reliable multisource multicast routing protocol over manet

Join

Group Leader

member

router

join node

Send a MACT back


Reliable multisource multicast routing protocol over manet

Join

Group Leader

member

router

join node

Become a member


Leave

Leave

Group Leader

member

router

leaving node

Send a MACT to Parent


Leave1

Leave

Group Leader

member

router

leaving node

Leave the group


Repair link breakage

Repair Link breakage


Merge partition

Merge Partition


Proposed rmmrp

Proposed RMMRP

  • Methodology

    • Apply ERS to reduce RREQ overhead

    • Modify MP to reduce recovery frequency

    • Propose VM to speed up topology recovery

    • Propose BMD to support fast multicast data delivery


2 efficient expanding ring search ers 1

2. Efficient Expanding Ring Search (ERS) – 1

  • Expanding Ring Search [8]

  • Motivation

    • Reduce RREQ overhead

  • Objective

    • Power-saving

    • Avoid channel contentions as possible

  • TTL concept applied

D

S

D

S


Ers 2

ERS – 2

  • Efficient Expanding Ring Search [11]

  • Collect local topology information

  • Reduce the overhead of pure flooding

Relay: false

PredAddr: A

Relay: false

PredAddr: A

Relay: false

PredAddr: A

B

Relay: false

PredAddr:

Relay: false

PredAddr: A

B

Relay: false

PredAddr: B

D

E

A

D

E

A

Relay: false

PredAddr:

Relay: true

PredAddr:

Relay: false

PredAddr: A

C

Relay: false

PredAddr: A

C


Ers 3

ERS – 3

Relay: true

PredAddr: A

B

Relay: false

PredAddr: A

Relay: false

PredAddr: B

D

E

A

Relay: true

PredAddr:

C

Relay: false

PredAddr: A

Relay: true

PredAddr: A

B

Relay: false

PredAddr: A

Relay: false

PredAddr: B

D

E

A

Relay: true

PredAddr:

C

Relay: false

PredAddr: B


Ers 4

ERS – 4

  • A → B → D

Relay: true

PredAddr: A

B

Relay: false

PredAddr: A

Relay: false

PredAddr: B

D

E

A

Relay: true

PredAddr:

C

Relay: false

PredAddr: B


3 mobility prediction mp

3. Mobility Prediction (MP)

  • Motivation

    • Establish a stable routing path

  • Objective

    • Cluster concept

    • Reduce possibility of repairing

  • GPS supported


Link expiration time

Vb

Va

Ta

Tb

A (Xa, Ya)

B (Xb, Yb)

Link Expiration Time


Mobility prediction example

Mobility Prediction Example

  • LET: Link Expiration Time

    • The amount of time that a certain link will remain connected

  • RET: Route Expiry Time

    • The minimum of the LET values of all links on a path

  • Two paths

    • A-B-C-D

      • RET=8

    • A-E-D

      • RET=1

  • Select path with larger RET

A

9

2

B

E

8

1

C

9

D


Join procedure modified for stable

Join Procedure (modified for stable)

  • MAODV

    • RREP: <R_Flag, U_Flag, Dest_Addr, Dest_Seq, Hop_Cnt, Lifetime, Mgroup_Hop, Group_Leader_Addr>

  • Mgroup_Hop indicates the distance of the tree

  • Lifetime is a constant

  • RMMRP

    • RREP: <R_Flag, U_Flag, Dest_Addr, Dest_Seq, Hop_Cnt, Lifetime, Group_Leader_Addr>

  • Lifetime means the expiration time of the path from tree


Join procedure modified for topology stability

Join Procedure (modified for topology stability)

Group Leader

Group Leader

member

5

5

router

2

3

join node

7

5

Join node send a MACT

along the longest RET path

Members respond with RREPs

including the LET


Root recovery

Root Recovery


Root recovery1

Root Recovery

  • rte_discovery_timeout = 1 sec

  • rreq_retries = 2 times

  • MAODV’s root recovery takes at least 3 sec on waiting

  • Merging several partitions takes lots of time as well


4 virtual mesh vm

4. Virtual Mesh (VM)


Vm example 1

VM Example 1

1

1

3

2

3

2

1

3

2

Group Leader

Candidate Leader

New partition leader


Vm example 2 1

VM Example 2 – 1

Current Leader

A

Candidate

Group Hello: Candidate=A

F

A

C

E

C

B

D

B


Vm example 2 2

VM Example 2 – 2

D

A

MACT_GL

F

A

F

E

C

D

E

C

B

B


5 bidirectional multicast data delivery

5. Bidirectional multicast data delivery

  • Multicast Reverse Path Forwarding

Degree↑

Delay↓


Bidirectional multicast data delivery

Bidirectional multicast data delivery

Leader

Source

Leader

Source

Source broadcast RREQs

to find the group member

Members respond RREPs

back to Source


Bidirectional multicast data delivery1

Bidirectional multicast data delivery

Leader

Source

Source first send the data to that member, and

the member deliver data by RPF


Benefits

Benefits

  • More stable tree topology

  • Reduce the control overhead

  • Fast root recovery


6 numerical results

6. Numerical Results

Simulation Environments


Repair frequency rmmrp vs mmaodv

Repair Frequency (RMMRP vs. MMAODV)


Control overhead rmmrp vs mmaodv

Control Overhead (RMMRP vs. MMAODV)


Control overhead rmmrp vs mmaodv ers

Control Overhead (RMMRP vs. MMAODV+ERS)


Control overhead

Control Overhead


Delivery ratio rmmrp vs mmaodv

Delivery Ratio (RMMRP vs. MMAODV)


Delivery ratio rmmrp vs mmaodv ers

Delivery Ratio (RMMRP vs. MMAODV+ERS)


Pure multicast

Pure Multicast


Pure multicast rmmrp vs mmaodv

Pure Multicast (RMMRP vs. MMAODV)


Speed rmmrp vs mmaodv

Speed (RMMRP vs. MMAODV)


Mobility model rmmrp vs mmaodv

Mobility model (RMMRP vs. MMAODV)


7 conclusions and future works

7. Conclusions and future works

Conclusions

  • Modified core-based tree structure by

    • Virtual mesh

    • Bidirectional multicast data delivery

  • Proposed a reliable multisource multicast with

    • Fast recovery

    • Low control overhead

    • Higher delivery ratio

  • Verified the performance through intensive simulations


Future works

Future Works

  • Improve delivery ratio

    • Cross-layered design (e.g. Network layer with MAC)

    • Other wireless medium

  • More performance metric

    • End-to-end delay

    • QoS


Thanks for your attention

Thanks for your attention

Q & A


Reference

Reference

  • Royer, E.M. and Perkins, “Multicast operation of the ad-hoc on-demand distance vector routing protocol,” Proceedings of the 5th annual ACM/IEEE international conference on Mobile computing and networking ACM, 1999, pp. 207-218

  • Pham, N.D. and Choo, H., “Energy ERS for Route Discovery in MANETs,” Communications, 2008. ICC '08. IEEE International Conference on 2008, pp. 3002-3006

  • William Su, Sung-Ju L., and Mario Gerla, “Mobility Prediction In Wireless Networks,” MILCOM 2000. 21st Century Military Communications Conference Proceedings, 22-25 Oct. 2000, pp. 491-495, vol.1


  • Login