Beruflich Dokumente
Kultur Dokumente
MANET
MANET
Formed by wireless hosts which may be mobile
Without (necessarily) using a pre-existing
infrastructure
Routes between nodes may potentially contain
multiple hops
4/9/2015
MANET
May need to traverse multiple links to reach a
destination
4/9/2015
4/9/2015
4/9/2015
Many Applications
4/9/2015
Many Variations
Fully Symmetric Environment
all nodes have identical capabilities and responsibilities
Asymmetric Capabilities
Asymmetric Responsibilities
only some nodes may route packets
some nodes may act as leaders of nearby nodes (e.g.
cluster head)
Mayank Pandey, MNNIT, Allahabad, India
Many Variations
Traffic characteristics may differ in different ad hoc
networks
bit rate
timeliness constraints
reliability requirements
unicast / multicast / geocast
host-based addressing / content-based addressing
/capability-based addressing
Many Variations
Mobility patterns may be different
Mobility characteristics
speed
Predictability
direction of movement
pattern of movement
Challenges
10
General Assumption
Unless stated otherwise, fully symmetric
environment is assumed implicitly
All nodes have identical capabilities and
responsibilities
11
12
13
Routing Protocols
Proactive protocols
Determine routes independent of traffic pattern
Traditional link-state and distance-vector routing
protocols are proactive
Reactive protocols
Maintain routes only if needed
Hybrid protocols
14
Trade-Off
Latency of route discovery
Proactive protocols may have lower latency since routes are
maintained at all times
Reactive protocols may have higher latency because a route from
X to Y will be found only when X attempts to send to Y
15
Flooding
Sender S broadcasts data packet P to all its
neighbors
Each node receiving P forwards P to its neighbors
Sequence numbers used to avoid the possibility
of forwarding the same packet more than once
Packet P reaches destination D provided that D is
reachable from sender S
Node D does not forward the packet
Mayank Pandey, MNNIT, Allahabad, India
16
Flooding
17
Flooding
18
Flooding
19
Flooding
20
Flooding
21
Flooding
22
Flooding
Flooding completed
Nodes unreachable from S do not receive packet P (e.g., node Z)
Nodes for which all paths from S go through the destination D also do not
receive packet P (example: node N)
Mayank Pandey, MNNIT, Allahabad, India
23
Flooding
Flooding may deliver packets to too many nodes (in the worst
case, all nodes reachable from sender may receive the packet)
Mayank Pandey, MNNIT, Allahabad, India
24
Flooding (Advantages)
Simplicity
May be more efficient than other protocols when rate of
information transmission is low enough that the overhead
of explicit route discovery/maintenance incurred by other
protocols is relatively higher
this scenario may occur, for instance, when nodes transmit small
data packets relatively infrequently, and many topology changes
occur between consecutive packet transmissions
25
Flooding (Disadvantages)
Potentially, very high overhead
Data packets may be delivered to too many nodes who do not
need to receive them
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
4/9/2015
43
4/9/2015
44
4/9/2015
45
4/9/2015
46
DSR (Advantages)
Routes maintained only between nodes who
need to communicate
reduces overhead of route maintenance
47
DSR (Disadvantages)
Packet header size grows with route length due
to source routing
Flood of route requests may potentially reach all
nodes in the network
Care must be taken to avoid collisions between
route requests propagated by neighboring
nodes
insertion of random delays before forwarding RREQ
4/9/2015
48
DSR (Disadvantages)
Increased contention if too many route replies come
back due to nodes replying using their local cache
Route Reply Storm problem
Reply storm may be eased by preventing a node from
sending RREP if it hears another RREP with a shorter route
49
50
AODV
Route Requests (RREQ) are forwarded in a manner
similar to DSR
When a node re-broadcasts a Route Request, it sets
up a reverse path pointing towards the source
AODV assumes symmetric (bi-directional) links
51
4/9/2015
52
4/9/2015
53
4/9/2015
54
4/9/2015
55
4/9/2015
56
4/9/2015
57
4/9/2015
58
59
4/9/2015
60
4/9/2015
61
Timeouts
A routing table entry maintaining a reverse
path is purged after a timeout interval
timeout should be long enough to allow RREP to
come back
A routing table entry maintaining a forward path is
purged if not used for active_route_timeout interval
if no data is being sent using a particular routing
table entry, that entry will be deleted from the
routing table (even if the route may actually still
be valid)
4/9/2015
62
63
Route Error
When node X is unable to forward packet P (from
node S to node D) on link (X,Y), it generates a RERR
message
Node X increments the destination sequence
number for D cached at node X
The incremented sequence number N is included in
the RERR
When node S receives the RERR, it initiates a new
route discovery for D using destination sequence
number at least as large as N
4/9/2015
64
4/9/2015
65
4/9/2015
66
4/9/2015
67
4/9/2015
68
AODV: Summary
Routes need not be included in packet headers
Nodes maintain routing tables containing entries only
for routes that are in active use
At most one next-hop per destination maintained at
each node
Multi-path extensions can be designed
DSR may maintain several routes for a single destination
69