Download File - Computer Networks & Information Security
Download File - Computer Networks & Information Security Download File - Computer Networks & Information Security
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 Overhead of route discovery/maintenance Reactive protocols may have lower overhead since routes are determined only if needed Proactive protocols can (but not necessarily) result in higher overhead due to continuous route updating Which approach achieves a better trade-off depends on the traffic and mobility patterns 24
Overview of Unicast Routing Protocols 25
- Page 1 and 2: Mobile Ad Hoc Networks: Routing, MA
- Page 3 and 4: Introduction Unicast routing Mult
- Page 5 and 6: Coverage Not intended to be exhaus
- Page 7 and 8: Mobile Ad Hoc Networks Formed by w
- Page 9 and 10: Mobile Ad Hoc Networks (MANET) Mob
- Page 11 and 12: Many Applications Personal area ne
- Page 13 and 14: Many Variations Traffic characteri
- Page 15 and 16: Challenges Limited wireless transm
- Page 17 and 18: Research on Mobile Ad Hoc Networks
- Page 19 and 20: Assumption Unless stated otherwise
- Page 21 and 22: Why is Routing in MANET different ?
- Page 23: Proactive protocols Routing Protoco
- Page 27 and 28: A Flooding for Data Delivery B H S
- Page 29 and 30: A Flooding for Data Delivery B H S
- Page 31 and 32: A Flooding for Data Delivery B H S
- Page 33 and 34: A Flooding for Data Delivery B H
- Page 35 and 36: Flooding for Data Delivery: Advanta
- Page 37 and 38: Flooding of Control Packets Many p
- Page 39 and 40: A B Route Discovery in DSR H S E C
- Page 41 and 42: A B Route Discovery in DSR H S E C
- Page 43 and 44: A B Route Discovery in DSR H S E C
- Page 45 and 46: Route Discovery in DSR Destination
- Page 47 and 48: Route Reply in DSR Route Reply can
- Page 49 and 50: A B Data Delivery in DSR H DATA [S,
- Page 51 and 52: DSR Optimization: Route Caching Ea
- Page 53 and 54: A B Use of Route Caching [S,E,F,J,D
- Page 55 and 56: Use of Route Caching: Can Reduce Pr
- Page 57 and 58: Route Caching: Beware! Stale cache
- Page 59 and 60: Dynamic Source Routing: Disadvantag
- Page 61 and 62: Flooding of Control Packets How to
- Page 63 and 64: X = last known location of node D,
- Page 65 and 66: LAR Only nodes within the request
- Page 67 and 68: LAR Variations: Adaptive Request Zo
- Page 69 and 70: Location-Aided Routing The basic p
- Page 71 and 72: Detour Routing Using Location Infor
- Page 73 and 74: Distance Routing Effect Algorithm f
Trade-Off<br />
Latency of route discovery<br />
Proactive protocols may have lower latency since routes are<br />
maintained at all times<br />
Reactive protocols may have higher latency because a route<br />
from X to Y will be found only when X attempts to send to Y<br />
Overhead of route discovery/maintenance<br />
Reactive protocols may have lower overhead since routes<br />
are determined only if needed<br />
Proactive protocols can (but not necessarily) result in higher<br />
overhead due to continuous route updating<br />
Which approach achieves a better trade-off depends<br />
on the traffic and mobility patterns<br />
24