enhanced maodv
Post on 06-Feb-2016
95 Views
Preview:
DESCRIPTION
TRANSCRIPT
1
ENHANCED MAODVSpeaker: Wu, Chun-Ting Advisor: Ke, Kai-Wei
2
Outline
Protocol Overview Enhanced Ring Search Flow-Oriented Routing Virtual Mesh Simulation results Work to be done Reference
3
My Research – Enhanced Multisource MAODV for MANET
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
Enhancing MAODV for MMR
Methodology Apply ERS for reducing RREQ overhead Modify FORP to apply the Join Procedure Propose VM to fast recover topology broken Propose RPF to support fast multicast delivery
• Join• RepairRREQ
• Reply• PermissionRREP
• Establish• PruneMACT
17
Ring Search
Motivation Reduce RREQ
overhead Objective
Power-saving Avoid channel
contentions as possible
TTL concept applied
S
D
S
D
18
Enhanced Ring Search (ERS) – 1 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
Enhanced Ring Search (ERS) – 2
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
Enhanced Ring Search (ERS) – 3 A → B → D
E
B
A
C
D
Relay: falsePredAddr: A
Relay: truePredAddr:
Relay: truePredAddr: A
Relay: falsePredAddr: B
Relay: falsePredAddr: B
21
Flow-Oriented Routing Protocol 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
Flow-Oriented 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 1-5-10-12-13
RET=5 1-5-4-8-13
RET=7 Select path with larger RET
15
14 13
1211
10
9
8
76 5
4
32
1
8
9
5
7
9
89
Flow-SETUP
Flow-REQ
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
M-MAODV 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 stable)
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
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
Virtual Mesh (VM)
12
3
12
3
1
2
3
Group Leader
Candidate Leader
New partition leader
30
Multicast Delivery (modification) Multicast RPF
Degree↑Delay↓
31
Multicast Delivery (modification)
Leader Source Leader Source
Members respond RREPs back to Source
Source broadcast RREQsto find the group member
32
Multicast Delivery (modification)
Leader Source
Source first send the data to that member, andthe member deliver data by RPF
33
Benefits
More stable tree topology Reduce the control overhead Fast root recovery
ERS
FORP
VM
34
Simulation EnvironmentParameter Value
Simulation time 300s
Play ground 1000*1000m2
Nodes (network size) 10, 20, 30, 40, 50
MAC 802.11b
Bit-rate 1/2/5.5/11 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, (5/10/15/20)mps]
35
Delivery Ratio (Proposed vs. MAODV)
10 20 30 40 500
0.1
0.2
0.3
0.4
0.5
0.6
0.7
0.8
0.9
Enhanced-UnicastEnhanced-MulticastMaodv-UnicastMaodv-Multicast
36
Delivery Ratio (Proposed vs. MAODV+ERS)
10 20 30 40 500
0.1
0.2
0.3
0.4
0.5
0.6
0.7
0.8
0.9
Enhanced-UnicastERS-UnicastEnhanced-MulticastERS-Multicast
37
Delivery Ratio (Proposed vs. MAODV)
10 20 30 40 500
0.1
0.2
0.3
0.4
0.5
0.6
0.7
0.8
0.9
Maodv-MulticastEnhanced-Multicast
38
Control Overhead (Proposed vs. MAODV)
10 20 30 40 500
1000
2000
3000
4000
5000
6000
7000
8000
Enhanced-RREQMaodv-RREQEnhanced-RREPMaodv-RREPEnhanced-MACTMaodv-MACT
39
Control Overhead (Proposed vs. MAODV+ERS)
10 20 30 40 500
1000
2000
3000
4000
5000
6000
7000
8000
Enhanced-RREQEnhanced-RREPEnhanced-MACTERS-RREQERS-RREPERS-MACT
40
Repair Frequency
10 20 30 40 500
50
100
150
200
250
300
Enhanced-RepairMaodv-Repair
41
Speed (Proposed vs. Original)
0-5 0-10 0-15 0-200
0.1
0.2
0.3
0.4
0.5
0.6
0.7
0.8
Enhanced-UnicastEnhanced-MulticastMaodv-UnicastMaodv-Multicast
42
Issue
Local vs. Global stable TTL Flow-Oriented
Reduce the possibility of out-of-range broken
Cannot optimize whole network
43
Work to be done
Summarize existed MMC algorithm and comparison
Effect of variable packet sizes and mobility
44
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
Ngoc Duy Pham, Hyunseung Choo, “Energy Efficient Expanding Ring Search for Route Discovery in MANETs,” Communications, 2008. ICC ‘08. IEEE International Conference on , vol., no., pp.3002-3006, 19-23 May 2008
William Su, Sung-Ju Lee, and Mario Gerla, “Mobility Prediction In Wireless Networks,” MILCOM 2000. 21st Century Military Communications Conference Proceedings , Volume: 1 , 22-25 Oct. 2000 Pages:491 - 495 vol.1
top related