Geographical routing presentation
-
Upload
apoorva-nagaraj -
Category
Science
-
view
210 -
download
1
Transcript of Geographical routing presentation
![Page 1: Geographical routing presentation](https://reader038.fdocuments.us/reader038/viewer/2022110307/5561b040d8b42afd708b56f1/html5/thumbnails/1.jpg)
Geographical Routing
![Page 2: Geographical routing presentation](https://reader038.fdocuments.us/reader038/viewer/2022110307/5561b040d8b42afd708b56f1/html5/thumbnails/2.jpg)
Introduction Basically there are 2 approaches of
routing1. Traditional routing algorithm adapted
for Ad Hoc Networks2. Geographical routing
![Page 3: Geographical routing presentation](https://reader038.fdocuments.us/reader038/viewer/2022110307/5561b040d8b42afd708b56f1/html5/thumbnails/3.jpg)
Traditional routing techniques
Next hop routing Source routing Flooding
![Page 4: Geographical routing presentation](https://reader038.fdocuments.us/reader038/viewer/2022110307/5561b040d8b42afd708b56f1/html5/thumbnails/4.jpg)
Next-Hop routing
• The algorithm calculates the next hop which is better to reach the destination.
• As the destination node changes, the next hop also changes.
• In this way, the packet is sent from sender to destination through 1 or more hops which acts as intermediate nodes
![Page 5: Geographical routing presentation](https://reader038.fdocuments.us/reader038/viewer/2022110307/5561b040d8b42afd708b56f1/html5/thumbnails/5.jpg)
Source Routing
x
ba
c
y
Which path??
![Page 6: Geographical routing presentation](https://reader038.fdocuments.us/reader038/viewer/2022110307/5561b040d8b42afd708b56f1/html5/thumbnails/6.jpg)
• In this type of routing, the algorithm calculates the lowest cost path to reach the destination.
• Here, various routes are tabulated and the best path is selected to send the packets.
![Page 7: Geographical routing presentation](https://reader038.fdocuments.us/reader038/viewer/2022110307/5561b040d8b42afd708b56f1/html5/thumbnails/7.jpg)
Flooding In this type, each node sends the status
of its state to every other node. Hence the information about all other nodes in the network is upadated continuously.
At the time of routing, the algorithm selects the node which is currently available and sends the packet.
![Page 8: Geographical routing presentation](https://reader038.fdocuments.us/reader038/viewer/2022110307/5561b040d8b42afd708b56f1/html5/thumbnails/8.jpg)
Disadvantages
Scalability Quick topology Changes
![Page 9: Geographical routing presentation](https://reader038.fdocuments.us/reader038/viewer/2022110307/5561b040d8b42afd708b56f1/html5/thumbnails/9.jpg)
Geographical Routing It makes use of location information in
routing The location of both the sender and the
destination is known.
![Page 10: Geographical routing presentation](https://reader038.fdocuments.us/reader038/viewer/2022110307/5561b040d8b42afd708b56f1/html5/thumbnails/10.jpg)
Assumptions Each node knows of its own location• Outdoor positioning device
GPS: Global Positioning System Accuracy: about 5 to 50 meters
• Indoor positioning device Infrared Short distance radio
![Page 11: Geographical routing presentation](https://reader038.fdocuments.us/reader038/viewer/2022110307/5561b040d8b42afd708b56f1/html5/thumbnails/11.jpg)
The destination location is also known by using the following routing techniques
LAR – Location Aided Routing DREAM – Distant Routing Effect Algorithm
for Mobility. GRID Routing
![Page 12: Geographical routing presentation](https://reader038.fdocuments.us/reader038/viewer/2022110307/5561b040d8b42afd708b56f1/html5/thumbnails/12.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 All packets carry sender’s current
location. This info enables nodes to learn of each
other’s location.
![Page 13: Geographical routing presentation](https://reader038.fdocuments.us/reader038/viewer/2022110307/5561b040d8b42afd708b56f1/html5/thumbnails/13.jpg)
Basic idea of LAR
Same as DSR, except that if the destination’s location is known, the ROUTE_REQ is only flooded over the “route search zone.”
Expected zone
![Page 14: Geographical routing presentation](https://reader038.fdocuments.us/reader038/viewer/2022110307/5561b040d8b42afd708b56f1/html5/thumbnails/14.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 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 15: Geographical routing presentation](https://reader038.fdocuments.us/reader038/viewer/2022110307/5561b040d8b42afd708b56f1/html5/thumbnails/15.jpg)
Basic Idea of DREAM Data Packet carries D’s and S’s
locations. Forwarded toward only a certain
direction.D
Expected zone of D
![Page 16: Geographical routing presentation](https://reader038.fdocuments.us/reader038/viewer/2022110307/5561b040d8b42afd708b56f1/html5/thumbnails/16.jpg)
Grid Routing “GRID: A Fully Location-Aware Routing
Protocol for Mobile Ad Hoc Networks” Wen-Hwa Liao, Yu-Chee Tseng, Jang-Ping
Sheu Partition the physical area into d x d
squares called grids.
![Page 17: Geographical routing presentation](https://reader038.fdocuments.us/reader038/viewer/2022110307/5561b040d8b42afd708b56f1/html5/thumbnails/17.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 18: Geographical routing presentation](https://reader038.fdocuments.us/reader038/viewer/2022110307/5561b040d8b42afd708b56f1/html5/thumbnails/18.jpg)
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
Route Search Range Options
![Page 19: Geographical routing presentation](https://reader038.fdocuments.us/reader038/viewer/2022110307/5561b040d8b42afd708b56f1/html5/thumbnails/19.jpg)
Gateway election in a grid
Any “leader can be used. Multiple leaders in a grid are
acceptable. Preference in electing a gateway:
near the physical center of the grid likely to remain in the grid for longer time
once elected, a gateway remains so until leaving the grid
election” protocol in distributed computing
![Page 20: Geographical routing presentation](https://reader038.fdocuments.us/reader038/viewer/2022110307/5561b040d8b42afd708b56f1/html5/thumbnails/20.jpg)
Taxonomy of Geographical 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 21: Geographical routing presentation](https://reader038.fdocuments.us/reader038/viewer/2022110307/5561b040d8b42afd708b56f1/html5/thumbnails/21.jpg)
Forwarding Strategies
Basic greedy methods Directional flooding Geographical source routing Power-aware routing
![Page 22: Geographical routing presentation](https://reader038.fdocuments.us/reader038/viewer/2022110307/5561b040d8b42afd708b56f1/html5/thumbnails/22.jpg)
Thank You