routing in large scale ad hoc and sensor networks
DESCRIPTION
Routing in Large Scale Ad Hoc and Sensor Networks. Ten H. Lai Ohio State University. Two Approaches. Traditional routing algorithms adapted to ad hoc networks Geographical routing. Review of Routing. Next-hop routing Source routing Flooding. Next-Hop Routing. X. a. ?. y. c. - PowerPoint PPT PresentationTRANSCRIPT
![Page 1: Routing in Large Scale Ad Hoc and Sensor Networks](https://reader034.vdocuments.us/reader034/viewer/2022050809/56814e91550346895dbc3b6e/html5/thumbnails/1.jpg)
Routing in Large Scale Ad Hoc and Sensor Networks
Ten H. Lai
Ohio State University
![Page 2: Routing in Large Scale Ad Hoc and Sensor Networks](https://reader034.vdocuments.us/reader034/viewer/2022050809/56814e91550346895dbc3b6e/html5/thumbnails/2.jpg)
Two Approaches
Traditional routing algorithms adapted to ad hoc networks
Geographical routing
![Page 3: Routing in Large Scale Ad Hoc and Sensor Networks](https://reader034.vdocuments.us/reader034/viewer/2022050809/56814e91550346895dbc3b6e/html5/thumbnails/3.jpg)
Review of Routing
Next-hop routing Source routing Flooding
![Page 4: Routing in Large Scale Ad Hoc and Sensor Networks](https://reader034.vdocuments.us/reader034/viewer/2022050809/56814e91550346895dbc3b6e/html5/thumbnails/4.jpg)
Next-Hop Routing
destination next hop cost
x a 3
y c 5
...
?
X
c
Which neighbor (next hop)?
a
y
![Page 5: Routing in Large Scale Ad Hoc and Sensor Networks](https://reader034.vdocuments.us/reader034/viewer/2022050809/56814e91550346895dbc3b6e/html5/thumbnails/5.jpg)
Source Routing
X
Which path?
destination path cost
x (a, b, c)
y
...
bc
a
![Page 6: Routing in Large Scale Ad Hoc and Sensor Networks](https://reader034.vdocuments.us/reader034/viewer/2022050809/56814e91550346895dbc3b6e/html5/thumbnails/6.jpg)
Each node periodically broadcasts the link states of its outgoing links to the entire network (by flooding).
As a node receives this information, it updates its view of the network topology and routing table.
Link-State Routing
5
3 4
2
1
3
4
![Page 7: Routing in Large Scale Ad Hoc and Sensor Networks](https://reader034.vdocuments.us/reader034/viewer/2022050809/56814e91550346895dbc3b6e/html5/thumbnails/7.jpg)
Distance-Vector Routing
least-cost(A,B) =
min {cost(A,x) + least-cost(x,B):
for all neighbors, x, of A} Neighbors exchange distance vectors
A
Bx
Destination A B C D E F GDistance 0 10 …
C
![Page 8: Routing in Large Scale Ad Hoc and Sensor Networks](https://reader034.vdocuments.us/reader034/viewer/2022050809/56814e91550346895dbc3b6e/html5/thumbnails/8.jpg)
Routing in MANETs Every node works as a router
![Page 9: Routing in Large Scale Ad Hoc and Sensor Networks](https://reader034.vdocuments.us/reader034/viewer/2022050809/56814e91550346895dbc3b6e/html5/thumbnails/9.jpg)
Challenges
Quick topology changes Scalability
![Page 10: Routing in Large Scale Ad Hoc and Sensor Networks](https://reader034.vdocuments.us/reader034/viewer/2022050809/56814e91550346895dbc3b6e/html5/thumbnails/10.jpg)
Two Approaches
Table-driven Like existing Internet routing protocols
On-demand
![Page 11: Routing in Large Scale Ad Hoc and Sensor Networks](https://reader034.vdocuments.us/reader034/viewer/2022050809/56814e91550346895dbc3b6e/html5/thumbnails/11.jpg)
Table-Driven Routing Protocols
Also called proactive routing protocolsContinuously evaluate the routesAttempt to maintain consistent, up-to-date routing
informationwhen a route is needed, it is ready immediately
When the network topology changesthe protocol responds by propagating updates
throughout the network to maintain a consistent view
![Page 12: Routing in Large Scale Ad Hoc and Sensor Networks](https://reader034.vdocuments.us/reader034/viewer/2022050809/56814e91550346895dbc3b6e/html5/thumbnails/12.jpg)
Also called reactive routing protocols Discover routes when needed by the source
node. Longer delay
On-Demand Routing Protocols
![Page 13: Routing in Large Scale Ad Hoc and Sensor Networks](https://reader034.vdocuments.us/reader034/viewer/2022050809/56814e91550346895dbc3b6e/html5/thumbnails/13.jpg)
Early Ad Hoc Routing Protocols
![Page 14: Routing in Large Scale Ad Hoc and Sensor Networks](https://reader034.vdocuments.us/reader034/viewer/2022050809/56814e91550346895dbc3b6e/html5/thumbnails/14.jpg)
DSDV: Destination Sequence Distance Vector
“Highly Dynamic Destination-Sequence Distance-Vector Routing (DSDV) for Mobile Computers”
Charles E. Perkins & Pravin Bhagwat Computer Communications Review, 1994 pp. 234-244
![Page 15: Routing in Large Scale Ad Hoc and Sensor Networks](https://reader034.vdocuments.us/reader034/viewer/2022050809/56814e91550346895dbc3b6e/html5/thumbnails/15.jpg)
DSDV Overview
DSDV = destination-sequenced distance-vector
Distance-vector routing Each entry is tagged with a sequence
number originated by the destination node.
Destination A B C D E F GDistance 0 10 …
Sequence #
![Page 16: Routing in Large Scale Ad Hoc and Sensor Networks](https://reader034.vdocuments.us/reader034/viewer/2022050809/56814e91550346895dbc3b6e/html5/thumbnails/16.jpg)
DSDV Route Advertisement
Each node periodically broadcasts its distance vector. “broadcast” is limited to one hop. sequence numbers
For the sender’s entry: Sender’s new sequence number (typically, +1)
For other entries: originally “stamped” by the destination nodes
Destination A B C D E F GDistance 0 10 …
Sequence #
![Page 17: Routing in Large Scale Ad Hoc and Sensor Networks](https://reader034.vdocuments.us/reader034/viewer/2022050809/56814e91550346895dbc3b6e/html5/thumbnails/17.jpg)
DSDV Route Updating Rules
Paths with more recent seq. nos. are always preferred.
least-cost(A,B) =
min {cost(A,x) + least-cost(x,B):
for all neighbors, x, of A}
A
Bx
C
![Page 18: Routing in Large Scale Ad Hoc and Sensor Networks](https://reader034.vdocuments.us/reader034/viewer/2022050809/56814e91550346895dbc3b6e/html5/thumbnails/18.jpg)
(Source-Initiated) On-Demand Routing Protocols
DSRAODVABRSSRZRP
![Page 19: Routing in Large Scale Ad Hoc and Sensor Networks](https://reader034.vdocuments.us/reader034/viewer/2022050809/56814e91550346895dbc3b6e/html5/thumbnails/19.jpg)
DSR: Dynamic Source Routing
“Dynamic Source Routing in Ad-Hoc Wireless Networks”
D. B. Johnson and D. A. Maltz Mobile Computing, 1996 pp. 153-181
![Page 20: Routing in Large Scale Ad Hoc and Sensor Networks](https://reader034.vdocuments.us/reader034/viewer/2022050809/56814e91550346895dbc3b6e/html5/thumbnails/20.jpg)
DSR : Outline
Source Routing On-demand Each host maintains a route cache
containing all routes it has learned. Two major parts:
route discovery route maintenance
![Page 21: Routing in Large Scale Ad Hoc and Sensor Networks](https://reader034.vdocuments.us/reader034/viewer/2022050809/56814e91550346895dbc3b6e/html5/thumbnails/21.jpg)
Route Discovery of DSR
To send a packet, a source node first consults its route cache.
If there is an unexpired route, use it. Otherwise, initiate a route discovery.
Route Discovery: Source node launches a ROUTE_REQUEST
by flooding. A ROUTE_REPLY is generated when
the route request reaches the destination an intermediate node has an unexpired route to the
destination
![Page 22: Routing in Large Scale Ad Hoc and Sensor Networks](https://reader034.vdocuments.us/reader034/viewer/2022050809/56814e91550346895dbc3b6e/html5/thumbnails/22.jpg)
Stale Route Cache Problem
Definition: A cached route may become stale before it
expires.
x x
![Page 23: Routing in Large Scale Ad Hoc and Sensor Networks](https://reader034.vdocuments.us/reader034/viewer/2022050809/56814e91550346895dbc3b6e/html5/thumbnails/23.jpg)
Route Maintenance of DSR
When a node detects a link breakage, it generates a ROUTE_ERROR packet. The packet traverses to the source in the
backward direction. The source removes all contaminated routes,
and if necessary, initiates another ROUTE_REQUEST.
Bx x
![Page 24: Routing in Large Scale Ad Hoc and Sensor Networks](https://reader034.vdocuments.us/reader034/viewer/2022050809/56814e91550346895dbc3b6e/html5/thumbnails/24.jpg)
AODV: Ad-Hoc On-Demand Distance Vector Routing
“Ad-hoc On-Demand Distance Vector Routing”
Charles E Perkins, Elizabeth M Royer Proc. 2nd IEEE Wksp. Mobile Comp. Sys.
and Apps., Feb. 1999.
![Page 25: Routing in Large Scale Ad Hoc and Sensor Networks](https://reader034.vdocuments.us/reader034/viewer/2022050809/56814e91550346895dbc3b6e/html5/thumbnails/25.jpg)
AODV : Outline
Next-hop Routing (cf. DSR: source routing)
On-demand Each host maintains a routing table Two major parts:
route discovery (by flooding) route maintenance
![Page 26: Routing in Large Scale Ad Hoc and Sensor Networks](https://reader034.vdocuments.us/reader034/viewer/2022050809/56814e91550346895dbc3b6e/html5/thumbnails/26.jpg)
AODV vs. DSR
DSR: Routes are discovered and cached AODV: Next-hop info is stored
“Performance Comparison of Two On-Demand Routing Protocols for Ad Hoc Networks,” Personal Communications, February 2001
![Page 27: Routing in Large Scale Ad Hoc and Sensor Networks](https://reader034.vdocuments.us/reader034/viewer/2022050809/56814e91550346895dbc3b6e/html5/thumbnails/27.jpg)
ABR: Associativity-Based Routing
“Associativity-Based Routing for Ad-Hoc Mobile Networks,” C.K. Toh.
ABR considers the stability of a link.called the degree of association stability.measured by the number of beacons received
from the other end of the link.The higher degree of a link’s stability, the
lower mobility of the node at the link’s other end.
![Page 28: Routing in Large Scale Ad Hoc and Sensor Networks](https://reader034.vdocuments.us/reader034/viewer/2022050809/56814e91550346895dbc3b6e/html5/thumbnails/28.jpg)
ABR Outline
Route Discovery: Same as DSR except the following. Each ROUTE_REQUEST packet collects the
association stability information along its path to the destination.
The destination node selects the best route in terms of association stability.
![Page 29: Routing in Large Scale Ad Hoc and Sensor Networks](https://reader034.vdocuments.us/reader034/viewer/2022050809/56814e91550346895dbc3b6e/html5/thumbnails/29.jpg)
Route Reconstruction: On route error, a node performs a local search
in hope of repairing the path. If the local search fails, a ROUTE_ERROR is
reported to the source.
localsearched zone
source
destination
![Page 30: Routing in Large Scale Ad Hoc and Sensor Networks](https://reader034.vdocuments.us/reader034/viewer/2022050809/56814e91550346895dbc3b6e/html5/thumbnails/30.jpg)
SSA: Signal Stability-Based Adaptive Routing
“Signal Stability-Based Adaptive Routing (SSA) for Ad Hoc Wireless Networks”
University of Maryland R. Dube, C. D. Rais, K.-Y. Wang & S. K.
Tripathi IEEE Personal Communications, ‘97
![Page 31: Routing in Large Scale Ad Hoc and Sensor Networks](https://reader034.vdocuments.us/reader034/viewer/2022050809/56814e91550346895dbc3b6e/html5/thumbnails/31.jpg)
Basic Idea of SSA
Observation: The ABR only considers the connectivity
stability.
Two more metrics: signal stability:
the strength of signal over a link
location stabilityhow fast a host moves
![Page 32: Routing in Large Scale Ad Hoc and Sensor Networks](https://reader034.vdocuments.us/reader034/viewer/2022050809/56814e91550346895dbc3b6e/html5/thumbnails/32.jpg)
ZRP: Zone Routing Protocol
The Zone Routing Protocol (ZRP) for Ad Hoc Networks
Cornell University Z.J. Haas and M.R. Pearlman draft-ietf-manet-zone-zrp-01.txt, 1998
![Page 33: Routing in Large Scale Ad Hoc and Sensor Networks](https://reader034.vdocuments.us/reader034/viewer/2022050809/56814e91550346895dbc3b6e/html5/thumbnails/33.jpg)
ZRP Outline
Hybrid of table-driven and on-demand!! Each node is associated with a zone. Within a zone: table-driven (proactive)
routing. Inter-zone: on-demand routing (similar to
DSR).
![Page 34: Routing in Large Scale Ad Hoc and Sensor Networks](https://reader034.vdocuments.us/reader034/viewer/2022050809/56814e91550346895dbc3b6e/html5/thumbnails/34.jpg)
Route Discovery
By an operation called “boardercast”: sending the route-request to boarder nodes
![Page 35: Routing in Large Scale Ad Hoc and Sensor Networks](https://reader034.vdocuments.us/reader034/viewer/2022050809/56814e91550346895dbc3b6e/html5/thumbnails/35.jpg)
ZRP Example
![Page 36: Routing in Large Scale Ad Hoc and Sensor Networks](https://reader034.vdocuments.us/reader034/viewer/2022050809/56814e91550346895dbc3b6e/html5/thumbnails/36.jpg)
Scalability Problem in Large-Scale Network Routing
Internet solution
![Page 37: Routing in Large Scale Ad Hoc and Sensor Networks](https://reader034.vdocuments.us/reader034/viewer/2022050809/56814e91550346895dbc3b6e/html5/thumbnails/37.jpg)
Geographic Routing
Make use of location information in routing
![Page 38: Routing in Large Scale Ad Hoc and Sensor Networks](https://reader034.vdocuments.us/reader034/viewer/2022050809/56814e91550346895dbc3b6e/html5/thumbnails/38.jpg)
Assumptions
Each node knows of its own location. outdoor positioning device:
GPS: global positioning systemaccuracy: in about 5 to 50 meters
indoor positioning device:Infraredshort-distance radio
The destination’s location is also known. How? (via a location service)
![Page 39: Routing in Large Scale Ad Hoc and Sensor Networks](https://reader034.vdocuments.us/reader034/viewer/2022050809/56814e91550346895dbc3b6e/html5/thumbnails/39.jpg)
LAR: Location-Aided Routing
Location-Aided Routing (LAR) in mobile ad hoc networks
Young-Bae Ko and Nitin H. Vaidya Texas A&M University Wireless Networks 6 (2000) 307–321
![Page 40: Routing in Large Scale Ad Hoc and Sensor Networks](https://reader034.vdocuments.us/reader034/viewer/2022050809/56814e91550346895dbc3b6e/html5/thumbnails/40.jpg)
Basic Idea of LAR
All packets carry sender’s current location.
This info enables nodes to learn of each other’s location.
![Page 41: Routing in Large Scale Ad Hoc and Sensor Networks](https://reader034.vdocuments.us/reader034/viewer/2022050809/56814e91550346895dbc3b6e/html5/thumbnails/41.jpg)
Basic Idea of LAR (cont.) Same as DSR, except that if the destination’s
location is known, the ROUTE_REQ is only flooded over the “route search zone.”
S
D
Route search zone
Expected zone of D
![Page 42: Routing in Large Scale Ad Hoc and Sensor Networks](https://reader034.vdocuments.us/reader034/viewer/2022050809/56814e91550346895dbc3b6e/html5/thumbnails/42.jpg)
DREAM
A Distance Routing Effect Algorithm for Mobility (DREAM)
S. Basagni, I. Chlamtac, V.R. Syrotiuk, B.A. Woodward
The University of Texas at Dallas Mobicom’98
![Page 43: Routing in Large Scale Ad Hoc and Sensor Networks](https://reader034.vdocuments.us/reader034/viewer/2022050809/56814e91550346895dbc3b6e/html5/thumbnails/43.jpg)
Basic Idea of DREAM
Dissemination of location information: Each node periodically advertises its location
(and movement information) by flooding. This way, nodes have knowledge of one
another’s location.
![Page 44: Routing in Large Scale Ad Hoc and Sensor Networks](https://reader034.vdocuments.us/reader034/viewer/2022050809/56814e91550346895dbc3b6e/html5/thumbnails/44.jpg)
Basic Idea of DREAM
Data Packet carries D’s and S’s locations. Forwarded toward only a certain direction.
S
D
Expected zone of D
![Page 45: Routing in Large Scale Ad Hoc and Sensor Networks](https://reader034.vdocuments.us/reader034/viewer/2022050809/56814e91550346895dbc3b6e/html5/thumbnails/45.jpg)
GRID Routing
“GRID: A Fully Location-Aware Routing Protocol for Mobile Ad Hoc Networks”
Wen-Hwa Liao, Yu-Chee Tseng, Jang-Ping Sheu
NCTU Telecommunication Systems, 2001.
![Page 46: Routing in Large Scale Ad Hoc and Sensor Networks](https://reader034.vdocuments.us/reader034/viewer/2022050809/56814e91550346895dbc3b6e/html5/thumbnails/46.jpg)
Basic Idea of GRID Routing
Partition the physical area into d x d squares called grids.
![Page 47: Routing in Large Scale Ad Hoc and Sensor Networks](https://reader034.vdocuments.us/reader034/viewer/2022050809/56814e91550346895dbc3b6e/html5/thumbnails/47.jpg)
Protocol Overview
In each grid, a leader is elected, called gateway.
Responsibility of gateways: forward route discovery packets propagate data packets to neighbor grids maintain routes which passes the grid
Routing is performed in a grid-by-grid manner.
![Page 48: Routing in Large Scale Ad Hoc and Sensor Networks](https://reader034.vdocuments.us/reader034/viewer/2022050809/56814e91550346895dbc3b6e/html5/thumbnails/48.jpg)
Route Search Range Options
S
D
q
(c) Fan( )q, r
r
S
D
S
D
(a) Rectangle
(d) Two_Fan( )q, r
(b) Bar(w)
w
S
D
q
qr
![Page 49: Routing in Large Scale Ad Hoc and Sensor Networks](https://reader034.vdocuments.us/reader034/viewer/2022050809/56814e91550346895dbc3b6e/html5/thumbnails/49.jpg)
Strength of Grid Routing
x x
![Page 50: Routing in Large Scale Ad Hoc and Sensor Networks](https://reader034.vdocuments.us/reader034/viewer/2022050809/56814e91550346895dbc3b6e/html5/thumbnails/50.jpg)
Gateway Election in a Grid
Any “leader election” protocol in distributed computing can be used.
Multiple leaders in a grid are acceptable. Preference in electing a gateway:
near the physical center of the gridlikely to remain in the grid for longer time
once elected, a gateway remains so until leaving the grid
![Page 51: Routing in Large Scale Ad Hoc and Sensor Networks](https://reader034.vdocuments.us/reader034/viewer/2022050809/56814e91550346895dbc3b6e/html5/thumbnails/51.jpg)
Taxonomy of Geographic Routing Algorithms
Also called position-based routing Three major components of geographic
routing: Location services (dissemination of location
information)Next topic
Forwarding strategies Recovery schemes
![Page 52: Routing in Large Scale Ad Hoc and Sensor Networks](https://reader034.vdocuments.us/reader034/viewer/2022050809/56814e91550346895dbc3b6e/html5/thumbnails/52.jpg)
Forwarding Strategies
Basic greedy methods Directional flooding Geographical source routing Power-aware routing
![Page 53: Routing in Large Scale Ad Hoc and Sensor Networks](https://reader034.vdocuments.us/reader034/viewer/2022050809/56814e91550346895dbc3b6e/html5/thumbnails/53.jpg)
Basic greedy methods
Most Forward within Radius (C), 1984 Nearest Forward Progress (A), 1986 Compass Routing (B) , 1999 Random Progress (X), 1984 The above schemes’ 2-hop variants
![Page 54: Routing in Large Scale Ad Hoc and Sensor Networks](https://reader034.vdocuments.us/reader034/viewer/2022050809/56814e91550346895dbc3b6e/html5/thumbnails/54.jpg)
Directional Flooding
DREAM (in data packet routing) LAR (in route discovery) GRID (in route discovery)
S
D
q
(c) Fan( )q, r
r
S
D
S
D
(a) Rectangle
(d) Two_Fan( )q, r
(b) Bar(w)
w
S
D
q
qr
![Page 55: Routing in Large Scale Ad Hoc and Sensor Networks](https://reader034.vdocuments.us/reader034/viewer/2022050809/56814e91550346895dbc3b6e/html5/thumbnails/55.jpg)
Geographical Source Routing
Source specifies a geographical path Needs an anchor path discovery protocol
Terminode routing GRID
![Page 56: Routing in Large Scale Ad Hoc and Sensor Networks](https://reader034.vdocuments.us/reader034/viewer/2022050809/56814e91550346895dbc3b6e/html5/thumbnails/56.jpg)
Terminode Routing
“Self Organized Terminode Routing,” Blazevic, Giordano, Le Boudec Cluster Computing Journal, Vol.5, No.2, April 2002
Remote destinations: Use geographical routing
Local destinations: Use non-geographical, proactive routing
Similar to Zone Routing in this sense
![Page 57: Routing in Large Scale Ad Hoc and Sensor Networks](https://reader034.vdocuments.us/reader034/viewer/2022050809/56814e91550346895dbc3b6e/html5/thumbnails/57.jpg)
Terminode Routing
Remote Routing Anchored Geodesic Packet Forwarding Geodesic Packet Forwarding (if no anchored
path known) Friend Assisted Path Discovery
Based on Small World Graphs
![Page 58: Routing in Large Scale Ad Hoc and Sensor Networks](https://reader034.vdocuments.us/reader034/viewer/2022050809/56814e91550346895dbc3b6e/html5/thumbnails/58.jpg)
Small World Graphs
Two nodes are connected if they are acquainted
Sparse, small diameter
![Page 59: Routing in Large Scale Ad Hoc and Sensor Networks](https://reader034.vdocuments.us/reader034/viewer/2022050809/56814e91550346895dbc3b6e/html5/thumbnails/59.jpg)
Terminode routing
![Page 60: Routing in Large Scale Ad Hoc and Sensor Networks](https://reader034.vdocuments.us/reader034/viewer/2022050809/56814e91550346895dbc3b6e/html5/thumbnails/60.jpg)
Power-Aware Routing
“Geographical and Energy Aware Routing: a recursive data dissemination protocol for wireless sensor networks”
Y. Yu, R. Govindan, D. Estrin UCLA
![Page 61: Routing in Large Scale Ad Hoc and Sensor Networks](https://reader034.vdocuments.us/reader034/viewer/2022050809/56814e91550346895dbc3b6e/html5/thumbnails/61.jpg)
Recovery Schemes
With any of the above forwarding strategies, packets may get stuck (hitting a hole).
A recovery scheme is invoked to get around the hole. Initiate a route discovery GPSR (enter the perimeter mode)
S
D
Stuck, initiating a recovery procedure
![Page 62: Routing in Large Scale Ad Hoc and Sensor Networks](https://reader034.vdocuments.us/reader034/viewer/2022050809/56814e91550346895dbc3b6e/html5/thumbnails/62.jpg)
GPSR
“GPSR: Greedy Perimeter Stateless Routing for Wireless Networks”
Brad Karp, H.T. Kung Harvard University MobiCom 2000 Two modes:
Greedy (for regular forwarding) Perimeter (for recovery)
![Page 63: Routing in Large Scale Ad Hoc and Sensor Networks](https://reader034.vdocuments.us/reader034/viewer/2022050809/56814e91550346895dbc3b6e/html5/thumbnails/63.jpg)
Perimeter Mode of GPSR
Suppose nodes x and D are connected by a planar graph.
The graph divides the plane into faces. Line xD crosses one or more faces.
D
x
![Page 64: Routing in Large Scale Ad Hoc and Sensor Networks](https://reader034.vdocuments.us/reader034/viewer/2022050809/56814e91550346895dbc3b6e/html5/thumbnails/64.jpg)
Planar Graphs
Graphs without crossing edges.
PlanarNot
![Page 65: Routing in Large Scale Ad Hoc and Sensor Networks](https://reader034.vdocuments.us/reader034/viewer/2022050809/56814e91550346895dbc3b6e/html5/thumbnails/65.jpg)
Planar Subgraph
G: communication graph Relative neighborhood graph (RNG):
Subgraph of G Keep edge (u, v) iff there are no nodes in the
overlapped area.
RNG is planar
u v
![Page 66: Routing in Large Scale Ad Hoc and Sensor Networks](https://reader034.vdocuments.us/reader034/viewer/2022050809/56814e91550346895dbc3b6e/html5/thumbnails/66.jpg)
Evolution
Distance Vector, Link State Proactive On demand Hybrid (zone routing) Geographical routing
Location Service Location-based Forwarding Recovery
![Page 67: Routing in Large Scale Ad Hoc and Sensor Networks](https://reader034.vdocuments.us/reader034/viewer/2022050809/56814e91550346895dbc3b6e/html5/thumbnails/67.jpg)
Next?
Location service Geographical routing without location
services Geocasting:
sending a message to every node within a region.
Geocast region
Geocast group