Reliable Multisource multicast routing protocol over manet

transcript

RELIABLE MULTISOURCE MULTICAST ROUTING PROTOCOL OVER MANET

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

Outline1. Introduction2. Efficient Expanding Ring Search (ERS)3. Mobility Prediction (MP)4. Virtual Mesh (VM)5. Bidirectional multicast data delivery

(BMD)6. Numerical Results7. Future works & Conclusions

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 Data Delivery Process

Unicast Multicast

Group Managements Join Leave Repair Merge

Unicast Delivery

Source

Destination

RREQSource

DestinationRREP

Source

Destination

Multicast Delivery

Leader Source Leader Source

Source broadcast RREQsto find the group leader

Multicast Delivery

The data passed to Leader and flooded to the tree

Leader respond a RREP

Group Leader

member

router

join node

Broadcast Join RREQ across network

Group Leader

member

router

join node

Members respond with RREPs

Group Leader

member

router

join node

Send a MACT back

Group Leader

member

router

join node

Become a member

Group Leader

member

router

leaving node

Send a MACT to Parent

Group Leader

member

router

leaving node

Leave the group

Repair Link breakage

Merge Partition Group Leader 1

Group Leader 2

MGL1Group Hello

RREQ (3)

RREQ (4)

RREP (5)

RREP (6)

RREQ/RREP Message

Group Hello Message

Group LeaderGroup Member

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

• Join• Repair

• Reply• Permission

• Establish• Prune

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

ERS – 2 Efficient Expanding Ring Search [11]

Collect local topology information Reduce the overhead of pure flooding

Relay: falsePredAddr: A

Relay: falsePredAddr:

Relay: truePredAddr:

Relay: falsePredAddr: B

ERS – 3

Relay: truePredAddr: A

ERS – 4 A → B → D

3. Mobility Prediction (MP) Motivation

Establish a stable routing path Objective

Cluster concept Reduce possibility of repairing

GPS supported

Link Expiration Time

A (Xa, Ya) B (Xb, Yb)

YYsTVTVr

XXqTVTVp

whererp

qrpsTxrprspqLET

sinsin

coscos

,)()()(

Mobility Prediction Example23

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

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)

Group Leader

Members respond with RREPs including the LET

Group Leader

member

router

join node

Join node send a MACT along the longest RET path

Root Recovery

Root Recovery rte_discovery_tim

eout = 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)

Group HelloCandidate Leader: MC

Current Leader

MA MC MB

Multicast Tree LinkMesh Link

Sub-tree Sub-tree Sub-tree

Group LeaderGroup Member

Candidate LeaderMC MA

RREQ/RREP Message

EP (4)

RREQ (1)

RREP (2)

RREQ (1)

RREP (2)

Group Leader Group Member

RREQ (2)RREP (3)

Network Node

RREQ (1)

RREP (2)

VM Example 1

Group Leader

Candidate Leader

New partition leader

VM Example 2 – 1

Group Hello: Candidate=ACurrent Leader

CandidateA

VM Example 2 – 2

CFMACT_GL A

5. Bidirectional multicast data delivery

Multicast Reverse Path Forwarding

Degree↑Delay↓

Bidirectional multicast data delivery

Members respond RREPs back to Source

Source broadcast RREQsto find the group member

Bidirectional multicast data delivery

Leader Source

Source first send the data to that member, andthe member deliver data by RPF

Benefits

More stable tree topology Reduce the control overhead Fast root recovery

6. Numerical Results

Parameter ValueSimulation time 300sPlay ground 1000*1000m2

Nodes (network size) 10, 20, 30, 40, 50MAC 802.11Bit-rate 2 MbpsTx power 100mWJoin interval Poisson(10s)Leave interval Poisson(20s)Unicast data interval Poisson(5s)Multicast data interval Poisson(10s)Leader die interval Poisson(30s)Mobility model Random way pointMove speed Uniform[0, 5mps]

Simulation Environments

Repair Frequency (RMMRP vs. MMAODV)

10 20 30 40 500

RMMRPMMAODV

節點個數

修復次數

Control Overhead (RMMRP vs. MMAODV)

10 20 30 40 500

RMMRP_RREQRMMRP_RREPRMMRP_MACTMMAODV_RREQMMAODV_RREPMMAODV_MACT

節點個數

控制封包量

Control Overhead (RMMRP vs. MMAODV+ERS)

10 20 30 40 500

RMMRP_RREQRMMRP_RREPRMMRP_MACTMMAODV+ERS_RREQMMAODV+ERS_RREPMMAODV+ERS_MACT

節點個數

控制封包量

Control Overhead

10 20 30 40 500

RMMRPMMAODV+ERS+MPMMAODV+ERSMMAODV

節點個數

控制封包量

Delivery Ratio (RMMRP vs. MMAODV)

10 20 30 40 500

RMMRP_UnicastRMMRP_MulticastMMAODV_UnicastMMAODV_Multicast

節點個數

傳送成功率

Delivery Ratio (RMMRP vs. MMAODV+ERS)

10 20 30 40 500

RMMRP_UnicastRMMRP_MulticastMMAODV+ERS_UnicastMMAODV+ERS_Multicast

節點個數

傳送成功率

Pure Multicast

10 20 30 40 500

RMMRPMMAODV+ERS+MPMMAODV+ERSMMAODV

節點個數

傳送成功率

Pure Multicast (RMMRP vs. MMAODV)

10 20 30 40 500

RMMRP_10sRMMRP_2sRMMRP_0.4sMMAODV_10sMMAODV_2sMMAODV_0.4s

節點個數

傳送成功率

Speed (RMMRP vs. MMAODV)

0-5 5-10 10-15 15-200

RMMRP_UnicastRMMRP_MulticastMMAODV_UnicastMMAODV_Multicast

移動速率 Uniform(a, b) (m/s)

傳送成功率

Mobility model (RMMRP vs. MMAODV)

10 20 30 40 500

RMMRP_RWPRMMRP_MassRMMRP_BaseMMAODV_RWPMMAODV_MassMMAODV_Base

節點個數

傳送成功率

7. Conclusions and future works

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

Conclusions

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

Q & AThanks for your attention

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

Reliable Multisource multicast routing protocol over manet

Documents