Advanced Computer Networks
Unicast routing-– MANETs
Dr. Zulfiqar Ali
Comsats University,
Islamabad Fall, 2024
Material with thanks to the University of California, Santa,
Cruz, USA
1
Announcements
• Project proposals.
– Feedback
• Note: Adhere to formatting and layout
instructions provided.
2
Today
3
4
Why MANET routing is challenging?
5
Mobility
6
Discrete Mobility
Example: In a battlefield MANET, a group of soldiers moves from one tactical
position to another, and during each movement, nodes establish new routes
after reaching the next point.
Stepwise movement:,
Nodes move in a sequence of defined steps with pauses between movements.
Handover and Routing:
After each movement, the network may need to update routing tables or
reassess communication links, which can lead to interruptions in data
transmission.
Impact on Routing: Because movements are not continuous, routing protocols
may need to reestablish routes after every movement, potentially causing route
discovery delays or packet drops.
Energy Consumption: Energy usage can vary because nodes might pause for
longer periods and only use power when they move or need to re-establish
connections.
Continuous Mobility
In continuous mobility, nodes in the MANET are constantly moving without significant
pauses or steps. The movement is smooth and fluid, and nodes maintain network
connectivity as they move.
Seamless movement: Nodes move fluidly, and their positions are
continuously updated.
Dynamic Routing: Routing protocols need to handle frequent changes in
node positions in real-time, adjusting routes continuously to ensure that the
communication paths are optimal.
Impact on Routing: Continuous mobility requires routing algorithms that can
quickly adapt to changing topology, such as reactive protocols like AODV (Ad
hoc On-Demand Distance Vector) or proactive ones like OLSR (Optimized Link
State Routing).
Energy Consumption: More energy may be consumed as the nodes are
constantly moving, requiring frequent route updates and communication
overhead.
Structured mobility
Structured Mobility refers to the organized movement of entities within a network,
often seen in mobile ad hoc networks (MANETs) or vehicular ad hoc networks (VANETs).
Movements of nodes are based on defined patterns or routes, making it easier to
anticipate their locations over time.
The network topology can be managed more effectively due to the predictable
movements, allowing for better routing protocols.
Resources (e.g., bandwidth, energy) can be allocated more efficiently, as the expected
movement patterns can inform decisions on data transmission and relay strategies.
For Example, Urban Transportation Systems.
Un-Structured mobility
Unstructured Mobility refers to a scenario where the movement of entities (such as
nodes in a network) is random and unpredictable.
This can significantly impact communication protocols, routing strategies, and overall
network performance.
Random Movement, Dynamic Topology, etc.
Security Issues in MANET
Manet is mobile in nature so this causes many problems.
- Identifying and fixing the problem is too difficult when compared to
traditional networks.
- Due to dynamic topology the several security attacks can be done in
physical layers itself an intruder can cause,
- Jamming
- Overloading
- Paralyzing
Snooping
Snooping in MANETs (Mobile Ad Hoc Networks) refers to the act of
intercepting and analyzing network traffic by unauthorized entities within the
network.
Since MANETs are typically decentralized and operate without fixed
infrastructure, they are particularly vulnerable to various security threats,
including snooping.
Spoofing
Eavesdropping
Eavesdropping is the act of listening to someone else’s
private conversation.
Eavesdroppers can intercept a phone call, video call, instant
message and even fax transmissions to acquire sensitive or
desirable information and data.
Wormhole Attacks
A wants to send packets to E.
Attacker 1 receives the Packt, and tunnels it to Attacker 2.
By this way packet, didn’t received by E.
This tunnel between attackers is known as wormhole.
Black Hole Attack
A wants to send packets to E. A broadcast the pckt.
E told A, that I have a hop count of 4.
But M told, that I can help you to reach E with a hop count of 2.
Byzantine Attack
A & C are Attacker nodes.
C can create loop with A.
C can send packet to non-optimal path, with more number of hops.
Information Disclosure
B is compromised node.
D is un-authorized node.
B can give information of A & C to D.
Resource Consumption Attacks
Malicious node B consumes a lot of resources of A & C.
Periodically send update messages to A & C to consume its resources.
MANET Routing Requirements
23
MANET Unicast Routing
24
25
DV or LS?
26
Distributed Computation
Local Information: Each router maintains only local information about its directly
connected neighbors.
This means that each node cannot see the entire network topology, leading to
decisions based only on partial information.
Periodic Updates: Distance Vector algorithms typically rely on periodic updates
where each node sends its distance vector (the cost to reach every other node) to
its neighbors.
This distributed approach can lead to delays and inconsistencies, as updates may
not be synchronized across the network.
Asynchronous Communication: Routers operate independently and communicate
asynchronously.
If one router updates its distance vector and another router hasn’t received this
update yet, inconsistencies can arise in the routing tables.
28
MANET Unicast Routing Taxonomy
29
Trade-offs?
30
Trade-offs?
31
32
Flooding for Data Delivery
33
Flooding
39
Flooding
40
Flooding for the Control Plane
41
Dynamic Source Routing (DSR) [Johnson96]
42
Route Discovery in DSR
43
Route Discovery in DSR
44
Route Discovery in DSR
45
Route Discovery in DSR
46
Route Discovery in DSR
47
Route Discovery in DSR
48
Route Discovery in DSR
49
Route Reply in DSR
50
Route Reply in DSR
51
Processing RREP
52
53
DSR Optimization: Route Caching
54
Use of Route Caching
55
Use of Route Caching
56
57
58
Route Caching: Beware!
59
DSR: Advantages
60
DSR: Disadvantages
61
DSR: Disadvantages
62
DSR: Disadvantages
63
(Ad hoc On-Demand Distance Vector Routing)
64
AODV
65
Route Requests in AODV
66
Route Requests in AODV
67
Route Requests in AODV
68
AODV Route Discovery: Observations
69
Destination Sequence Number
70
71
72
73
Route Reply in AODV
74
Route Reply Example
75
76
Data Delivery in AODV
77
Timeouts
78
• Note:
Reading of the related papers is
compulsory to these handouts please.
1.Dynamic source routing in ad hoc
wireless networks, David B. Johnson,
David A. Maltz, in Mobile Computing,
editor T. Imielinski and Hank Korth,
Kluwer, 1996.
2. Charles E Perkins, Elizabeth M Royer,
Ad hoc On Demand Distance Vector
Routing, 2003. 79
