Download File - Computer Networks & Information Security
Download File - Computer Networks & Information Security Download File - Computer Networks & Information Security
Geographic Distance Routing (GEDIR) [Lin98] Location of the destination node is assumed known Each node knows location of its neighbors Each node forwards a packet to its neighbor closest to the destination Route taken from S to D shown below S A B C H G D E F obstruction 76
Geographic Distance Routing (GEDIR) [Stojmenovic99] The algorithm terminates when same edge traversed twice consecutively Algorithm fails to route from S to E Node G is the neighbor of C who is closest from destination E, but C does not have a route to E S A B C H G D E F obstruction 77
- Page 25 and 26: Overview of Unicast 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
- Page 75: Relative Distance Micro-Discovery R
- Page 79 and 80: Grid Location Service (GLS) [Li00Mo
- Page 81 and 82: Query Localization [Castaneda99Mobi
- Page 83 and 84: G F E B A S C D Query Localization:
- Page 85 and 86: Broadcast Storm Problem [Ni99Mobico
- Page 87 and 88: Solutions for Broadcast Storm Prob
- Page 89 and 90: Solutions for Broadcast Storms Dis
- Page 91 and 92: Ad Hoc On-Demand Distance Vector Ro
- Page 93 and 94: A B Route Requests in AODV H S E C
- Page 95 and 96: A B Route Requests in AODV H S E C
- Page 97 and 98: A Reverse Path Setup in AODV B H S
- Page 99 and 100: A B Route Reply in AODV H S E C I G
- Page 101 and 102: A Forward Path Setup in AODV B H S
- Page 103 and 104: Timeouts A routing table entry mai
- Page 105 and 106: Route Error When node X is unable
- Page 107 and 108: Link Failure Detection Hello messa
- Page 109 and 110: Why Sequence Numbers in AODV A B C
- Page 111 and 112: Summary: AODV Routes need not be i
- Page 113 and 114: Link Reversal Algorithm [Gafni81] A
- Page 115 and 116: Link Reversal Algorithm A B F C E G
- Page 117 and 118: Link Reversal Algorithm A B F C E G
- Page 119 and 120: Link Reversal Algorithm A B F C E G
- Page 121 and 122: Link Reversal Algorithm Attempts t
- Page 123 and 124: Partial Reversal Method A B F C E G
- Page 125 and 126: Partial Reversal Method A B F C E G
Geographic Distance Routing (GEDIR)<br />
[Stojmenovic99]<br />
The algorithm terminates when same edge traversed<br />
twice consecutively<br />
Algorithm fails to route from S to E<br />
Node G is the neighbor of C who is closest from destination<br />
E, but C does not have a route to E<br />
S<br />
A<br />
B<br />
C<br />
H<br />
G<br />
D<br />
E<br />
F<br />
obstruction<br />
77