Upload
diane-stanley
View
213
Download
0
Embed Size (px)
Citation preview
Month 2000August 2004
Avinash Joshi, Vann Hasty, Michael Bahr.Slide 1
doc.: IEEE 802.11-00/1047r0
Submission
Routing Protocols for MANET
Avinash Joshi, Vann Hasty, MeshNetworks Inc.Michael Bahr, Siemens Corporate Technology
Month 2000August 2004
Avinash Joshi, Vann Hasty, Michael Bahr.Slide 2
doc.: IEEE 802.11-00/1047r0
Submission
Overview
• Introduction• Different Routing Protocols
– Reactive Routing Protocols– Proactive Routing Protocols– Hybrid Routing Protocols
• IETF MANET Group• Other Active work• 802.11s and MANET• Conclusion
Month 2000August 2004
Avinash Joshi, Vann Hasty, Michael Bahr.Slide 3
doc.: IEEE 802.11-00/1047r0
Submission
Introduction
Mobile Ad hoc Network (MANET)• Collection of wireless mobile nodes• Without using a pre-existing infrastructure• Routes between nodes may potentially
contain multiple hopsThis presentation• Considers only routing protocols discussed
in IETF MANET working group
Month 2000August 2004
Avinash Joshi, Vann Hasty, Michael Bahr.Slide 4
doc.: IEEE 802.11-00/1047r0
Submission
Typical Ad hoc Network
A
EC
H
F
ID
B
J
G
Node
TransmissionRange
Month 2000August 2004
Avinash Joshi, Vann Hasty, Michael Bahr.Slide 5
doc.: IEEE 802.11-00/1047r0
Submission
Different Routing Protocols
• Proactive Routing Protocols
• Reactive Routing Protocols
• Hybrid Routing Protocols
Month 2000August 2004
Avinash Joshi, Vann Hasty, Michael Bahr.Slide 6
doc.: IEEE 802.11-00/1047r0
Submission
Proactive Routing Protocols
• Main features:– Maintain routing information on all nodes in the network at all times.
This can be achieved by event driven routing information distribution and regular distribution of updated routing information.
• Advantages:– Lower route setup latency
• Disadvantages:– High routing overhead (periodic distribution of routing information)– Stale routing information in highly dynamic topologies.
• Protocol examples:– Optimized Link State Routing (OLSR)– Topology Dissemination Based on Reverse Path Forwarding (TBRPF)
Month 2000August 2004
Avinash Joshi, Vann Hasty, Michael Bahr.Slide 7
doc.: IEEE 802.11-00/1047r0
Submission
Reactive Routing Protocols
• Main features:– maintain routing information for the nodes which are needed and
only for the time when they are needed (Also called on-demand routing protocols.)
• Advantages:– Lower routing overhead
• Disadvantages:– Larger route set up latency– Route discovery packet flooding
• Protocol examples:– Dynamic Source Routing (DSR)– Ad hoc On-demand Distance Vector (AODV)
Month 2000August 2004
Avinash Joshi, Vann Hasty, Michael Bahr.Slide 8
doc.: IEEE 802.11-00/1047r0
Submission
Hybrid Routing Protocols
• Main features:– The routing is proactive for short distances and reactive for long
distances.• Advantages:
– Reduces impact of disadvantages of proactive and reactive routing protocols
– No route setup latency for short distance connections – Lower routing overhead due to reactive routing for further away
destinations• Disadvantages:
– More complex• Protocol examples:
– Zone Routing Protocol (ZRP)
Month 2000August 2004
Avinash Joshi, Vann Hasty, Michael Bahr.Slide 9
doc.: IEEE 802.11-00/1047r0
Submission
IETF MANET Working Group
Description:• To standardize IP routing protocol functionality suitable
for wireless routing application within both static and dynamic topoligies
• In the past, focused on exploring a broad range of MANET problems, performance issues, and related candidate protocols
• Promotion of a number of core routing protocol specifications to EXPERIMENTAL RFC status
• http://www.ietf.org/html.charters/manet-charter.html
Month 2000August 2004
Avinash Joshi, Vann Hasty, Michael Bahr.Slide 10
doc.: IEEE 802.11-00/1047r0
Submission
IETF MANET Working Group
Current Status:• Reached all milestones• 3 Experimental RFCs (AODV – RFC 3561, OLSR – RFC
3626, TBRPF – RFC 3684)• DSR submitted as Experimental RFC• Recharter in November
– decide on single reactive routing protocol and on single proactive routing protocol
– aspects of security and congestion control in the designed routing protocol/protocols.
• OSPF-MANET in OSPF working group
Month 2000August 2004
Avinash Joshi, Vann Hasty, Michael Bahr.Slide 11
doc.: IEEE 802.11-00/1047r0
Submission
Example of a Proactive Routing Protocol
• Optimized Link State Routing (OLSR)
• Experimental RFC 3626
• Authors: Thomas Clausen, Philippe Jacquet, et al, Project Hipercom, INRIA (France)
Month 2000August 2004
Avinash Joshi, Vann Hasty, Michael Bahr.Slide 12
doc.: IEEE 802.11-00/1047r0
Submission
OLSR
• Optimization of pure link state protocol– Reduced size of control packets (Only links to
multipoint relay selector nodes are advertised)– Minimized flooding (only multipoint relay
(MPR) nodes forward the packets)
Month 2000August 2004
Avinash Joshi, Vann Hasty, Michael Bahr.Slide 13
doc.: IEEE 802.11-00/1047r0
Submission
MPR Selection
Reference Node
One Hop Neighbors
Two Hop Neighbors
Month 2000August 2004
Avinash Joshi, Vann Hasty, Michael Bahr.Slide 14
doc.: IEEE 802.11-00/1047r0
Submission
MPR Selection
Selected MPRs
Month 2000August 2004
Avinash Joshi, Vann Hasty, Michael Bahr.Slide 15
doc.: IEEE 802.11-00/1047r0
Submission
MPR Selection
MPR can reach all the two hop neighborhood
Month 2000August 2004
Avinash Joshi, Vann Hasty, Michael Bahr.Slide 16
doc.: IEEE 802.11-00/1047r0
Submission
MPR Selection
MPR can reach all the two hop neighborhood
Month 2000August 2004
Avinash Joshi, Vann Hasty, Michael Bahr.Slide 17
doc.: IEEE 802.11-00/1047r0
Submission
OLSR Neighbor Sensing
• Periodic Hello messages detect the 2-hop neighborhood
A
EC
H
F
ID
B
J
G
Month 2000August 2004
Avinash Joshi, Vann Hasty, Michael Bahr.Slide 18
doc.: IEEE 802.11-00/1047r0
Submission
Multi Point Relay Selection
• MPR nodes are selected
A
EC
H
F
ID
B
J
G
K
reference node1-hop neighborsMulti Point Relays2-hop neighbors
Month 2000August 2004
Avinash Joshi, Vann Hasty, Michael Bahr.Slide 19
doc.: IEEE 802.11-00/1047r0
Submission
Multi Point Relay Selection• Only Multi Point
Relays (MPRs) retransmit broadcast packets from their MPR selector
A
EC
H
F
ID
B
J
G
K
reference node1-hop neighborsMulti Point Relays2-hop neighbors
Month 2000August 2004
Avinash Joshi, Vann Hasty, Michael Bahr.Slide 20
doc.: IEEE 802.11-00/1047r0
Submission
Topology Info Dissemination• EVERY node MPR-
broadcasts its links between itself and neighbors that selected this node as MPR
A
EC
H
F
ID
B
J
G
K
reference node1-hop neighborsMulti Point Relays2-hop neighbors
Month 2000August 2004
Avinash Joshi, Vann Hasty, Michael Bahr.Slide 21
doc.: IEEE 802.11-00/1047r0
Submission
Topology Info Dissemination• EVERY node MPR-
broadcasts its links between itself and neighbors that selected this node as MPR
A
EC
H
F
ID
B
J
G
K
reference node1-hop neighborsMulti Point Relays2-hop neighbors
Month 2000August 2004
Avinash Joshi, Vann Hasty, Michael Bahr.Slide 22
doc.: IEEE 802.11-00/1047r0
Submission
Path Computation• iterative shortest path
algorithm using information from neighbor table and topology table
A
EC
H
F
ID
B
J
G
K
Month 2000August 2004
Avinash Joshi, Vann Hasty, Michael Bahr.Slide 23
doc.: IEEE 802.11-00/1047r0
Submission
Route Break
• compute new MPR set• broadcast TC message
A
EC
H
F
ID
B
J
G
K
LinkBreak
Month 2000August 2004
Avinash Joshi, Vann Hasty, Michael Bahr.Slide 24
doc.: IEEE 802.11-00/1047r0
Submission
Route Break
• compute new MPR set• broadcast TC message• compute new path
A
EC
H
F
ID
B
J
G
K
LinkBreak
Month 2000August 2004
Avinash Joshi, Vann Hasty, Michael Bahr.Slide 25
doc.: IEEE 802.11-00/1047r0
Submission
Example of a Reactive Routing Protocol
• Ad hoc On-Demand Distance Vector (AODV)
• Experimental RFC 3561
• Authors: Charles Perkins, Elizabeth Belding-Royer, Samir Das
Month 2000August 2004
Avinash Joshi, Vann Hasty, Michael Bahr.Slide 26
doc.: IEEE 802.11-00/1047r0
Submission
AODV
Main Functions
• Route Discovery
• Route Maintenance
• Uses Destination Sequence Number to avoid loops and “Counting to Infinity” problem
Month 2000August 2004
Avinash Joshi, Vann Hasty, Michael Bahr.Slide 27
doc.: IEEE 802.11-00/1047r0
Submission
AODV: Route Discovery
A
EC
H
F
ID
B
J
G
K
Month 2000August 2004
Avinash Joshi, Vann Hasty, Michael Bahr.Slide 28
doc.: IEEE 802.11-00/1047r0
Submission
AODV: Route Discovery
A
EC
H
F
ID
B
J
G
K
A – Source
J - Destination
Month 2000August 2004
Avinash Joshi, Vann Hasty, Michael Bahr.Slide 29
doc.: IEEE 802.11-00/1047r0
Submission
AODV: Route Discovery
A
EC
H
F
ID
B
J
G
K
‘A’ Broadcast a routerequest (RREQ) packet with Initial TTL =1
Broadcast RREQ
Month 2000August 2004
Avinash Joshi, Vann Hasty, Michael Bahr.Slide 30
doc.: IEEE 802.11-00/1047r0
Submission
AODV: Route Discovery
A
EC
H
F
ID
B
J
G
K
Nodes receiving the RREQsets up Reverse Routes to the source
Broadcast RREQ
Reverse Route
Month 2000August 2004
Avinash Joshi, Vann Hasty, Michael Bahr.Slide 31
doc.: IEEE 802.11-00/1047r0
Submission
AODV: Route Discovery
A
EC
H
F
ID
B
J
G
K
‘A’ times out and re-broadcast a Route Request (RREQ) packet with TTL = 2
Broadcast RREQ
Reverse Route
Month 2000August 2004
Avinash Joshi, Vann Hasty, Michael Bahr.Slide 32
doc.: IEEE 802.11-00/1047r0
Submission
AODV: Route Discovery
A
EC
H
F
ID
B
J
G
K
Other Nodes Rebroadcasts the Route Request (RREQ) packet
Note: Nodes B, C and F receives RREQMultiple times but forward it only once
Month 2000August 2004
Avinash Joshi, Vann Hasty, Michael Bahr.Slide 33
doc.: IEEE 802.11-00/1047r0
Submission
AODV: Route Discovery
A
EC
H
F
ID
B
J
G
K
‘A’ times out and re-broadcast a Route Request (RREQ) packet with TTL = 4
Broadcast RREQ
Reverse Route
Month 2000August 2004
Avinash Joshi, Vann Hasty, Michael Bahr.Slide 34
doc.: IEEE 802.11-00/1047r0
Submission
AODV: Route Discovery
A
EC
H
F
ID
B
J
G
K
Route Request EventuallyReaches the Destination J
Broadcast RREQ
Reverse Route
Month 2000August 2004
Avinash Joshi, Vann Hasty, Michael Bahr.Slide 35
doc.: IEEE 802.11-00/1047r0
Submission
AODV: Route Discovery
A
EC
H
F
ID
B
J
G
K
Destination send routeReply (RREP) back tosource using the reverseroute
RREP
Month 2000August 2004
Avinash Joshi, Vann Hasty, Michael Bahr.Slide 36
doc.: IEEE 802.11-00/1047r0
Submission
AODV: Route Discovery
A
EC
H
F
ID
B
J
G
K
Node Receiving the RREPsets up a Forward Path tothe Destination
Route Reply
Forward Path
Month 2000August 2004
Avinash Joshi, Vann Hasty, Michael Bahr.Slide 37
doc.: IEEE 802.11-00/1047r0
Submission
AODV: Route Discovery
A
EC
H
F
ID
B
J
G
K
Node Receiving the RREPsets up a Forward Path tothe Destination
Route Reply
Forward Path
Month 2000August 2004
Avinash Joshi, Vann Hasty, Michael Bahr.Slide 38
doc.: IEEE 802.11-00/1047r0
Submission
AODV: Route Discovery
A
EC
H
F
ID
B
J
G
K
Node Receiving the RREPsets up a Forward Path tothe Destination
‘A’ now has a route to ‘J’
Month 2000August 2004
Avinash Joshi, Vann Hasty, Michael Bahr.Slide 39
doc.: IEEE 802.11-00/1047r0
Submission
AODV: Route Discovery
A
EC
H
F
ID
B
J
G
K
A can now use the forward route created
Month 2000August 2004
Avinash Joshi, Vann Hasty, Michael Bahr.Slide 40
doc.: IEEE 802.11-00/1047r0
Submission
AODV: Route Discovery
A
EC
H
F
ID
B
J
G
K
Month 2000August 2004
Avinash Joshi, Vann Hasty, Michael Bahr.Slide 41
doc.: IEEE 802.11-00/1047r0
Submission
AODV: Route Discovery
A
EC
H
F
ID
B
J
G
K
B – Source
J - Destination
Month 2000August 2004
Avinash Joshi, Vann Hasty, Michael Bahr.Slide 42
doc.: IEEE 802.11-00/1047r0
Submission
AODV: Route Discovery
A
EC
H
F
ID
B
J
G
K
‘B’ Broadcast a routerequest (RREQ) packet
Month 2000August 2004
Avinash Joshi, Vann Hasty, Michael Bahr.Slide 43
doc.: IEEE 802.11-00/1047r0
Submission
AODV: Route Discovery
A
EC
H
F
ID
B
J
G
K
‘A’ and ‘C’ replies
RREP
RREP
Month 2000August 2004
Avinash Joshi, Vann Hasty, Michael Bahr.Slide 44
doc.: IEEE 802.11-00/1047r0
Submission
AODV: Route Discovery
A
EC
H
F
ID
B
J
G
K
‘B’ picks the minimum hop route (which is through C)
Month 2000August 2004
Avinash Joshi, Vann Hasty, Michael Bahr.Slide 45
doc.: IEEE 802.11-00/1047r0
Submission
AODV: Route Error
A
EC
H
F
ID
B
J
G
K
A – Source
J - Destination
Month 2000August 2004
Avinash Joshi, Vann Hasty, Michael Bahr.Slide 46
doc.: IEEE 802.11-00/1047r0
Submission
AODV: Route Break
A
EC
H
F
ID
B
J
G
K
Data is flowing between A and J
Month 2000August 2004
Avinash Joshi, Vann Hasty, Michael Bahr.Slide 47
doc.: IEEE 802.11-00/1047r0
Submission
AODV: Route Error
A
EC
H
F
ID
B
J
G
K
LinkBreak
Link between E and J breaks due to
•RF reasons, or
•movement
Month 2000August 2004
Avinash Joshi, Vann Hasty, Michael Bahr.Slide 48
doc.: IEEE 802.11-00/1047r0
Submission
AODV: Route Error
A
EC
H
F
ID
B
J
G
K
LinkBreak
All nodes maintain a precursor list of nodes who might use a link
Month 2000August 2004
Avinash Joshi, Vann Hasty, Michael Bahr.Slide 49
doc.: IEEE 802.11-00/1047r0
Submission
AODV: Route Error
A
EC
H
F
ID
B
J
G
K
LinkBreak
Route Error message is sent to the source
Month 2000August 2004
Avinash Joshi, Vann Hasty, Michael Bahr.Slide 50
doc.: IEEE 802.11-00/1047r0
Submission
AODV: Route Error
A
EC
H
F
ID
B
J
G
K
LinkBreak
Route to J is removed and Route Discovery is reinitiated
Month 2000August 2004
Avinash Joshi, Vann Hasty, Michael Bahr.Slide 51
doc.: IEEE 802.11-00/1047r0
Submission
IRTF RRG Ad hoc Network Systems Research Subgroup
• Study of Ad hoc Network Systems (ANS)
• Inter-layer Protocol Interaction, Quality of Service Routing, Routing Scalability, Network Auto-Configuration, Interoperation with a wired infrastructure
• Currently not very active
• http://www.flarion.com/ans-research/
Month 2000August 2004
Avinash Joshi, Vann Hasty, Michael Bahr.Slide 52
doc.: IEEE 802.11-00/1047r0
Submission
Difference between IEEE 802.11s and IETF MANET
IETF MANET• Layer3
• Distributed Architecture
• Hop Based Metrics
• No QoS
• No Security Standard
• No Multicast Standard
• Mobility?
• Up to Large Scale
802.11s• Layer 2
• Presence of Gateways
• LQ/Hop Based Metrics
• QoS
• Security
• Multicast
• Mobility?
• Reduced Scale
Month 2000August 2004
Avinash Joshi, Vann Hasty, Michael Bahr.Slide 53
doc.: IEEE 802.11-00/1047r0
Submission
Current Research
• Link Quality (MIT)
• Integration of MANETs into existing Internet (several Internet drafts, EU project “Daidalos”)
• Security
• Energy-awareness
Month 2000August 2004
Avinash Joshi, Vann Hasty, Michael Bahr.Slide 54
doc.: IEEE 802.11-00/1047r0
Submission
Conclusion
• Many general insights into routing/path finding
• Many concepts available, each with its advantages and disadvantages
• Concepts and experiences from MANETs can be used for TGs
Month 2000August 2004
Avinash Joshi, Vann Hasty, Michael Bahr.Slide 55
doc.: IEEE 802.11-00/1047r0
Submission
References
• Ad Hoc Networking by Charles E. Perkins • http://moment.cs.ucsb.edu/AODV/aodv.html
• http://hipercom.inria.fr/olsr/
• http://w3.antd.nist.gov/wctg/manet/manet_bibliog.html