Routing in Ad Hoc Networks Audun Søberg Henriksen Truls Becken.
-
Upload
claude-doyle -
Category
Documents
-
view
215 -
download
0
Transcript of Routing in Ad Hoc Networks Audun Søberg Henriksen Truls Becken.
![Page 1: Routing in Ad Hoc Networks Audun Søberg Henriksen Truls Becken.](https://reader030.fdocuments.us/reader030/viewer/2022032605/56649e845503460f94b864d4/html5/thumbnails/1.jpg)
Routing in Ad Hoc Networks
Audun Søberg Henriksen
Truls Becken
![Page 2: Routing in Ad Hoc Networks Audun Søberg Henriksen Truls Becken.](https://reader030.fdocuments.us/reader030/viewer/2022032605/56649e845503460f94b864d4/html5/thumbnails/2.jpg)
Overview
Short introduction Example of a basic routing algorithm Routing protocols IP configuring Security
![Page 3: Routing in Ad Hoc Networks Audun Søberg Henriksen Truls Becken.](https://reader030.fdocuments.us/reader030/viewer/2022032605/56649e845503460f94b864d4/html5/thumbnails/3.jpg)
Short introduction to wireless multihop networks
Two or more nodes equippedwith wireless communicationsand networking capability
Base station is not necessary A node can communicate directly
with another node that is immediately within radio range To communicate with nodes outside its own radio range an
intermediate node is used to forward the packet The network is self-organizing and adaptive
(autonomous distributed control is required) Nodes are able to detect the presence of other nodes and
join them into the network The nodes don’t need to be of the same type
(phone, PDA, laptop, sensor, etc.)
![Page 4: Routing in Ad Hoc Networks Audun Søberg Henriksen Truls Becken.](https://reader030.fdocuments.us/reader030/viewer/2022032605/56649e845503460f94b864d4/html5/thumbnails/4.jpg)
Application areas
Tactical military Emergencies Disaster relief Sensor Meetings/conferences
![Page 5: Routing in Ad Hoc Networks Audun Søberg Henriksen Truls Becken.](https://reader030.fdocuments.us/reader030/viewer/2022032605/56649e845503460f94b864d4/html5/thumbnails/5.jpg)
Challenges
Dynamic topologies Bandwidth-constrained, variable
capacity links Energy-constrained Limited physical security Scalability
![Page 6: Routing in Ad Hoc Networks Audun Søberg Henriksen Truls Becken.](https://reader030.fdocuments.us/reader030/viewer/2022032605/56649e845503460f94b864d4/html5/thumbnails/6.jpg)
Simple routing protocol example
Propagation of routing table Routing and transmitting
![Page 7: Routing in Ad Hoc Networks Audun Søberg Henriksen Truls Becken.](https://reader030.fdocuments.us/reader030/viewer/2022032605/56649e845503460f94b864d4/html5/thumbnails/7.jpg)
Routing table
Destination terminal
Nextnode
A A
B A
C E
D D
… …
Each terminal has its own routing table(in proactive routing algorithms)
![Page 8: Routing in Ad Hoc Networks Audun Søberg Henriksen Truls Becken.](https://reader030.fdocuments.us/reader030/viewer/2022032605/56649e845503460f94b864d4/html5/thumbnails/8.jpg)
Position notification packet
ID of terminal which the created the packet
Timestamp for the created packet
ID of hop source terminal
Hop count
Contents of the packet:
Used to make and update the Routing Table Broadcasted in a limited area
![Page 9: Routing in Ad Hoc Networks Audun Søberg Henriksen Truls Becken.](https://reader030.fdocuments.us/reader030/viewer/2022032605/56649e845503460f94b864d4/html5/thumbnails/9.jpg)
Renewal of Position Notification Packet
A B D
t =1 t =2 t =3 t =4
A A A B A C
A 1 A 1 A 1 B 2 A 1 C 3
C
B B CC
![Page 10: Routing in Ad Hoc Networks Audun Søberg Henriksen Truls Becken.](https://reader030.fdocuments.us/reader030/viewer/2022032605/56649e845503460f94b864d4/html5/thumbnails/10.jpg)
Routing
A
B
Routing Table in D
D
G
E
I
C
HF
To F
Dest Next
A A
B B
C E
D -
E E
F I
G E
H I
I I
![Page 11: Routing in Ad Hoc Networks Audun Søberg Henriksen Truls Becken.](https://reader030.fdocuments.us/reader030/viewer/2022032605/56649e845503460f94b864d4/html5/thumbnails/11.jpg)
Routing
A
B
D
G
E
I
C
HF
To F
Routing Table in I Dest Next
A D
B D
C C
D D
E E
F H
G E
H H
I -
![Page 12: Routing in Ad Hoc Networks Audun Søberg Henriksen Truls Becken.](https://reader030.fdocuments.us/reader030/viewer/2022032605/56649e845503460f94b864d4/html5/thumbnails/12.jpg)
Routing
A
B
D
G
E
I
C
HF
To F
Routing Table in H Dest Next
A I
B I
C C
D I
E I
F F
G C
H -
I I
![Page 13: Routing in Ad Hoc Networks Audun Søberg Henriksen Truls Becken.](https://reader030.fdocuments.us/reader030/viewer/2022032605/56649e845503460f94b864d4/html5/thumbnails/13.jpg)
Basic transmitting procedure
Request to send (RTS) Clear to send (CTS)
Ready to receive (RTR)
![Page 14: Routing in Ad Hoc Networks Audun Søberg Henriksen Truls Becken.](https://reader030.fdocuments.us/reader030/viewer/2022032605/56649e845503460f94b864d4/html5/thumbnails/14.jpg)
Topology problem Hidden terminal problem Exposed terminal problem
Busy tones
![Page 15: Routing in Ad Hoc Networks Audun Søberg Henriksen Truls Becken.](https://reader030.fdocuments.us/reader030/viewer/2022032605/56649e845503460f94b864d4/html5/thumbnails/15.jpg)
Ad Hoc routing protocols
Proactive– Large overhead
Reactive– Delay before first packet– Doesn’t scale
Hybrid scheme– Clusters
![Page 16: Routing in Ad Hoc Networks Audun Søberg Henriksen Truls Becken.](https://reader030.fdocuments.us/reader030/viewer/2022032605/56649e845503460f94b864d4/html5/thumbnails/16.jpg)
Destination Sequenced Distance Vector (DSDV) Periodic routing Distance vector
– dest, next hop, distance, seq no Two ways to update neighbors
– Full dump– Incremental update
![Page 17: Routing in Ad Hoc Networks Audun Søberg Henriksen Truls Becken.](https://reader030.fdocuments.us/reader030/viewer/2022032605/56649e845503460f94b864d4/html5/thumbnails/17.jpg)
Dynamic Source Routing (DSR)
On demand Source routing
– Each packet contains full route Route discovery
– Flood RREQ packets– RREP returned when route found
Route maintenance– RERR when route is broken
![Page 18: Routing in Ad Hoc Networks Audun Søberg Henriksen Truls Becken.](https://reader030.fdocuments.us/reader030/viewer/2022032605/56649e845503460f94b864d4/html5/thumbnails/18.jpg)
Ad-hoc On-demand Distance Vector (AODV) From DSR
– Route discovery– Route maintenance
From DSDV– Hop-by-hop routing– Sequence numbers
![Page 19: Routing in Ad Hoc Networks Audun Søberg Henriksen Truls Becken.](https://reader030.fdocuments.us/reader030/viewer/2022032605/56649e845503460f94b864d4/html5/thumbnails/19.jpg)
Zone Routing Protocol (ZRP)
Predefined zones– Centered around each node
Proactive local routing Reactive global routing
![Page 20: Routing in Ad Hoc Networks Audun Søberg Henriksen Truls Becken.](https://reader030.fdocuments.us/reader030/viewer/2022032605/56649e845503460f94b864d4/html5/thumbnails/20.jpg)
IP address assignment
No centralized logic Small address room in IPv4 Network splitting Network merging
![Page 21: Routing in Ad Hoc Networks Audun Søberg Henriksen Truls Becken.](https://reader030.fdocuments.us/reader030/viewer/2022032605/56649e845503460f94b864d4/html5/thumbnails/21.jpg)
Two approaches
A leader– Responsible for all addresses
Buddy system– Start with one node responsible for all
addresses– Joining node gets half of the addresses
from an existing node
![Page 22: Routing in Ad Hoc Networks Audun Søberg Henriksen Truls Becken.](https://reader030.fdocuments.us/reader030/viewer/2022032605/56649e845503460f94b864d4/html5/thumbnails/22.jpg)
Routing security vulnerabilities
Open medium Dynamic topology Distributed cooperation
(absence of central authorities)
Constrained capability(energy)
![Page 23: Routing in Ad Hoc Networks Audun Søberg Henriksen Truls Becken.](https://reader030.fdocuments.us/reader030/viewer/2022032605/56649e845503460f94b864d4/html5/thumbnails/23.jpg)
Types of attacks
Black hole Denial of service Routing table overflow Impersonation Energy consummation