RELIABLE MULTISOURCE MULTICAST ROUTING PROTOCOL OVER MANET Speaker: Wu, Chun-Ting Advisor: Ke,...
-
date post
19-Dec-2015 -
Category
Documents
-
view
220 -
download
3
Transcript of RELIABLE MULTISOURCE MULTICAST ROUTING PROTOCOL OVER MANET Speaker: Wu, Chun-Ting Advisor: Ke,...
RELIABLE MULTISOURCE MULTICAST ROUTING PROTOCOL OVER MANET
Speaker: Wu, Chun-Ting Advisor: Ke, Kai-Wei
2
Outline
1. 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
3
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
4
MAODV Review
Data Delivery Process Unicast Multicast
Group Managements Join Leave Repair Merge
5
Unicast Delivery
Source
Destination
RREQ
Source
Destination
RREP
Source
Destination
Data
6
Multicast Delivery
Leader Source Leader Source
Source broadcast RREQsto find the group leader
7
Multicast Delivery
Leader Source Leader Source
The data passed to Leader and flooded to the tree
Leader respond a RREP
8
Join
Group Leader
member
router
join node
Broadcast Join RREQ across network
9
Join
Group Leader
member
router
join node
Members respond with RREPs
10
Join
Group Leader
member
router
join node
Send a MACT back
11
Join
Group Leader
member
router
join node
Become a member
12
Leave
Group Leader
member
router
leaving node
Send a MACT to Parent
13
Leave
Group Leader
member
router
leaving node
Leave the group
14
Repair Link breakage
15
Merge Partition
Group Leader 1
Group Leader 2
MGL1Group Hello
RREQ
(1)
RREP
(2)
RREQ (3)
RREQ (4)
RREP (5)
RREP (6)
RREQ/RREP Message
Group Hello Message
MGL2
Group Leader
Group Member
16
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• RepairRREQ
• Reply• PermissionRREP
• Establish• PruneMACT
17
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
S
D
S
D
18
ERS – 2
Efficient Expanding Ring Search [11]
Collect local topology information Reduce the overhead of pure flooding
E
B
A
C
DE
B
A
C
D
Relay: falsePredAddr: A
Relay: falsePredAddr:
Relay: falsePredAddr: A
Relay: falsePredAddr: A
Relay: falsePredAddr:
Relay: falsePredAddr: A
Relay: truePredAddr:
Relay: falsePredAddr: A
Relay: falsePredAddr: A
Relay: falsePredAddr: B
19
ERS – 3
E
B
A
C
D
E
B
A
C
D
Relay: falsePredAddr: A
Relay: truePredAddr:
Relay: truePredAddr: A
Relay: falsePredAddr: A
Relay: falsePredAddr: B
Relay: falsePredAddr: A
Relay: truePredAddr:
Relay: truePredAddr: A
Relay: falsePredAddr: B
Relay: falsePredAddr: B
20
ERS – 4
A → B → D
E
B
A
C
D
Relay: falsePredAddr: A
Relay: truePredAddr:
Relay: truePredAddr: A
Relay: falsePredAddr: B
Relay: falsePredAddr: B
21
3. Mobility Prediction (MP)
Motivation Establish a stable routing path
Objective Cluster concept Reduce possibility of repairing
GPS supported
22
Link Expiration Time
A (Xa, Ya) B (Xb, Yb)
Ta Tb
VaVb
ba
bbaa
ba
bbaa
ab
YYs
TVTVr
XXq
TVTVp
whererp
qrpsTxrprspqLET
sinsin
coscos
,)()()(
22
2222
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
A
D
C
EB
9
8
9
2
1
24
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
25
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
5
7 5
25
3
26
Root Recovery
27
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
28
4. Virtual Mesh (VM)
Group HelloCandidate Leader: MC
Current Leader
MA MC MB
Multicast Tree Link
Mesh Link
Sub-tree Sub-tree Sub-tree
Group Leader
Group Member
Candidate LeaderMC MA
RREQ
(1)
RREQ/RREP Message
MB
RREP (4
)
RREQ (1)
RREP (2)
RREQ (1)
RREP (2)
Group Leader Group Member
RREQ (2)RREP (3
)
Network Node
RREQ (1)
RREP (2)
29
VM Example 1
12
3
12
3
1
2
3
Group Leader
Candidate Leader
New partition leader
30
VM Example 2 – 1
AB
C
Group Hello: Candidate=A
Current Leader
CandidateA
D E
B
C
F
31
VM Example 2 – 2
A
D E
B
C
FMACT_GLA
D
E
B
C
F
32
5. Bidirectional multicast data delivery
Multicast Reverse Path Forwarding
Degree↑Delay↓
33
Bidirectional multicast data delivery
Leader Source Leader Source
Members respond RREPs back to Source
Source broadcast RREQsto find the group member
34
Bidirectional multicast data delivery
Leader Source
Source first send the data to that member, andthe member deliver data by RPF
35
Benefits
More stable tree topology Reduce the control overhead Fast root recovery
ERS
MP
VM
36
6. Numerical Results
Parameter Value
Simulation time 300s
Play ground 1000*1000m2
Nodes (network size) 10, 20, 30, 40, 50
MAC 802.11
Bit-rate 2 Mbps
Tx power 100mW
Join 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 point
Move speed Uniform[0, 5mps]
Simulation Environments
37
Repair Frequency (RMMRP vs. MMAODV)
10 20 30 40 500
50
100
150
200
250
300
RMMRPMMAODV
節點個數
修復次數
38
Control Overhead (RMMRP vs. MMAODV)
10 20 30 40 500
1000
2000
3000
4000
5000
6000
7000
8000
RMMRP_RREQRMMRP_RREPRMMRP_MACTMMAODV_RREQMMAODV_RREPMMAODV_MACT
節點個數
控制封包量
39
Control Overhead (RMMRP vs. MMAODV+ERS)
10 20 30 40 500
1000
2000
3000
4000
5000
6000
7000
8000
RMMRP_RREQRMMRP_RREPRMMRP_MACTMMAODV+ERS_RREQMMAODV+ERS_RREPMMAODV+ERS_MACT
節點個數
控制封包量
40
Control Overhead
10 20 30 40 500
2000
4000
6000
8000
10000
12000
14000
16000
RMMRPMMAODV+ERS+MPMMAODV+ERSMMAODV
節點個數
控制封包量
41
Delivery Ratio (RMMRP vs. MMAODV)
10 20 30 40 500
0.1
0.2
0.3
0.4
0.5
0.6
0.7
0.8
0.9
RMMRP_UnicastRMMRP_MulticastMMAODV_UnicastMMAODV_Multicast
節點個數
傳送成功率
42
Delivery Ratio (RMMRP vs. MMAODV+ERS)
10 20 30 40 500
0.1
0.2
0.3
0.4
0.5
0.6
0.7
0.8
0.9
RMMRP_UnicastRMMRP_MulticastMMAODV+ERS_UnicastMMAODV+ERS_Multicast
節點個數
傳送成功率
43
Pure Multicast
10 20 30 40 500
0.1
0.2
0.3
0.4
0.5
0.6
0.7
0.8
0.9
RMMRPMMAODV+ERS+MPMMAODV+ERSMMAODV
節點個數
傳送成功率
44
Pure Multicast (RMMRP vs. MMAODV)
10 20 30 40 500
0.1
0.2
0.3
0.4
0.5
0.6
0.7
0.8
0.9
RMMRP_10sRMMRP_2sRMMRP_0.4sMMAODV_10sMMAODV_2sMMAODV_0.4s
節點個數
傳送成功率
45
Speed (RMMRP vs. MMAODV)
0-5 5-10 10-15 15-200
0.1
0.2
0.3
0.4
0.5
0.6
0.7
0.8
RMMRP_UnicastRMMRP_MulticastMMAODV_UnicastMMAODV_Multicast
移動速率 Uniform(a, b) (m/s)
傳送成功率
46
Mobility model (RMMRP vs. MMAODV)
10 20 30 40 500
0.1
0.2
0.3
0.4
0.5
0.6
0.7
0.8
0.9
RMMRP_RWPRMMRP_MassRMMRP_BaseMMAODV_RWPMMAODV_MassMMAODV_Base
節點個數
傳送成功率
47
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
48
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