Mobile Ad Hoc Network

Mobile ad hoc networks (MANET)
Circle Lecture Communication Systems

Winter Term 2004/2005
Prof. Dr. M. Zitterbart
Institute of Telematics
Dr.-Ing. Kilian Weniger
Outline
1 Introduction
2 Media access
3 Routing
4 Current research areas
Mobile ad hoc networks 1
www.tm.uka.de
1 Introduction
What are mobile ad hoc networks?
Wireless networks without infrastructure

z
no base station/access points, no backbone
Each terminal is host and router at the same time!

Terminals may be mobile
Packet-based data forwarding
z
Routes between two devices can be several hops long

also called multi-hop ad-hoc networks
Ad-hoc networks are self-organizing

z
No central components
Example
transmission
range r
r
Node
Link
www.tm.uka.de
Example of data packet routing in MANETs
n
io
iss
m
ns
tra nge
ra
www.tm.uka.de
Advantages and applications

Mobile ad-hoc networks: Advantages
Simple, fast and cheap setup of networks

z
transmit power can be reduced compared to wireless infrastructure networks

z
e.g. with 802.11b in the 2.4 GHz (ISM) band: no license required
distance to nearest neighbor can be lower than to the base station
More robust concerning failure of single components due to decentralized structure
Military applications
formations of soldiers, tanks, planes,...
Civil applications
conferences, exhibitions, meetings, lectures

telematics applications in traffic
Extension of cell-based systems (WLAN, UMTS)
Entertainment on travels (file sharing, gaming,... in trains, cars or planes)
sport events
networks for cabs, police,
sensor networks
In case of disasters
In case of infrastructure failure (telephone network,..): e.g. earthquakes
rescue operations, e.g. after avalanches
www.tm.uka.de
Application 1: Sensor networks

Protection against or reaction to
disasters
Situation: Flood disaster
Sandbags protect a dyke
Support by sensor networks
Sandbags are equipped with

sensors
Sensors cooperate to detect
leaks in the dyke
Collection and preprocessing of
data
Source: Timmermann, Uni Rostock

www.tm.uka.de
Application 2: Vehicle networks

Vehicles send immediate reports to other (following) vehicles, e.g. about
Traffic jams
Obstacles
Dangerous spots
Speed controls
...
Demonstrator Fleetnet-Project
www.tm.uka.de
Application 3: Integration with cellular systems

Project IPonAir: Integration of wireless networks with the Internet
Internet access via several
intermediate terminals
Internet
UMTS base station
e.g. no access network

in direct range
load balancing
WLAN access point
Extension of
access network
Ad-hoc communication,
e.g. for P2P or

multi-player games
Ad-hoc
communication
Extension of access
network
Ad-hoc
Communication
www.tm.uka.de
Properties of mobile ad-hoc networks

Highly dynamic network topology
Mobility of devices
Changing properties of the wireless channel (Fading, multipath propagation)
Partitioning and merging of ad-hoc networks possible
No infrastructure
No central always on components
Limited battery power of mobile devices
Worsened by signaling traffic, e.g. of the routing protocol
Limited bandwidth
Worsened by signaling traffic, e.g. of the routing protocol and the MAC protocol
Asymmetric/Unidirectional links
Quality of connections can differ between both directions
www.tm.uka.de
2. Media access
Motivation
Media access control is necessary to enable controlled access to a
medium shared by several devices
MAC algorithms for fixed networks (e.g. CSMA/CD) usually cannot be
applied in a wireless environment:
Construction of transceivers, being able to broadcast and receive on the

same frequency at the same time, is difficult
No collision detection at sender
Signal strength degrades quadratically with the distance
Problem of hidden or exposed terminals
Possible algorithm
IEEE 802.11 in Ad-hoc mode with

Carrier Sense Multiple Access with Collision Avoidance (CSMA/CA)
www.tm.uka.de
802.11 MAC-layer: Distributed Coordination Function

DIFS
Sender
Data frame
SIFS
Receiver
Ack
DIFS
Other
stations
Waiting time
t
Contention period
(backoff)
Station senses medium

Case 1: Medium is free for Distributred InterFrame Space (DIFS)
z
Data frame
Station may send the data frame
Case 2: Medium ist busy

Station waits till medium is free for IFS
z Transmission is delay by random backoff time
z Backoff timer is freezed when other stations are sending
z
Ack for received data frame (after Short IFS)
www.tm.uka.de
Problem of hidden terminals

Hidden terminal
A sends to B
C does not receive A anymore
C wants so send to B, Medium is free for C (CS fails)
Collision at B, A does not recognize this (CD fails)
A is hidden for C
www.tm.uka.de
MAC-layer: DCF with RTS/CTS

Request-to-Send (RTS)/Cleat-to-Send (CTS) option
Sender tansmits RTS first

z
contains Network Allocation Vector (NAV)
Receiver replies with CTS (after SIFS)

Sender sends data frame and receivers sends ack (after SIFS)
Other stations store NAV
z
Virtual reservation
DIFS
Sender
RTS
data
SIFS
CTS SIFS
SIFS
ACK
Receiver
Other
Stations
Waiting time
DIFS
NAV (RTS)
NAV (CTS)
data
t
Backoff
www.tm.uka.de
Exposed terminals
Exposed terminal
B sends to A
C wants to send to D
C must wait: CS signals an that medium is busy
This is unnecessary: A is outside Cs range
C is exposed to B
www.tm.uka.de
3. Unicast routing protocols for mobile ad-hoc networks

Routing protocols developed for fixed networks (e.g. RIP, OSPF, ...) cannot be
applied to mobile ad-hoc networks without modifications
slow convergence
too much overhead
Routing protocols for ad-hoc networks must, in contrast, converge quickly and
use as little bandwidth as possible for control traffic
Different metrics are possible for mobile ad-hoc networks
Minimal number of hops

Minimal delay
Minimal packet loss
Maximal signal stability and route stability over time
Maximal battery runtime of a mobile device
Maximal lifetime of the whole network
z
e.g. until partitioning due to empty batteries of a network node
www.tm.uka.de
Classification
Flooding for data transfer
Most simple protocol: Each node forwards each packet exactly once
very high overhead
Proactive Routing (Table-driven)
Routes to all nodes are maintained

Routes are permanently available
Constantly high control overhead
Reactive Routing (On-demand)
Routes are determined only when needed (Route Discovery)

Time delay at the beginning, as the route must be determined first
Control overhead depends on number of connections
Hybrid Routing
Mixture of proactive and reactive routing
There is not (yet) a one-fits-all routing protocol for mobile ad-hoc networks
Adequacy of a protocol depends on scenario
Standardization of ad-hoc routing protocols: IETF MANET WG
[3]
www.tm.uka.de
Proactive routing protocols

Principle
Nodes constantly determine routes to all other nodes in the network
Approaches
Distance Vector Routing

based on Bellman-Ford Algorithm
z Each node determines for each other node
z
its neighbor (next hop), via which the shortest route to the specific node leads
the length of this route
This information is periodically broadcast to all neighbors

z Example fixed network: Routing Information Protocol (RIP)
z
Link State Routing

Each node periodically broadcasts the status of its links, together with link state
information received from its neighbors
z Therefore, each node knows the whole network topology
z Shortest route to each node can be determined with Dijkstras Shortest Path First
Algorithm
z Example fixed network: Open Shortest Path First (OSPF)
z
www.tm.uka.de
Example: Optimized Link State Routing (OLSR)

Goal: Efficient flooding of Link State Information!
1. Determination of neighborhood
z
Periodic broadcast of HELLO messages. These contain:

Addresses of the nodes from which HELLO messages are currently received
State of the links to these node: symmetric (bidirectional) or asymmetric
(unidirectional)
Neighborhood relationships computable from this information

Y is a 1-hop neighbor of X X receives HELLO message from Y
Y is a 2-hop neighbor of X Y X and X sees Y in a HELLO message
received from Z
Y is a strict 2-hop neighbor of X Y is a 2-hop, but not a 1-hop neighbor of X
Relationships are in each case defined as symmetric and as asymmetric
Example: X sees itself in a HELLO message by Y Y is a symmetric
1-hop neighbor of X
Delete neighborhood information after timeout as a reaction to link breaks
www.tm.uka.de
Multipoint Relays
2. Determination of Multipoint Relays (MPR)
The MPRs of X are a subset of the symmetric 1-hop neighbors of X
z This subset is determined such that each symmetric 2-hop neighbor
of X can be reached via at least one MPR
z Determination of the subset according to heuristics on every change
detected within the 2-hop neigborhood
z Selected MPRs are announced in HELLO messages
z
3. Determination of the MPR Selectors (MS)

The MS of X are the nodes that have chosen X as their MPR
z X gets to know about these nodes in the HELLO messages
received
z
www.tm.uka.de
Example OLSR I
Determination of neighbors, MPR and MS (HELLO messages)
B
Only symmetric links in this

example!
C
Node
A
B
C
D
E
F
G
H
1-hop neighbors
2-hop neighbors
MPR
MS
www.tm.uka.de
Example OLSR II
B
C
Node
A
B
C
D
E
F
G
H
1-hop neighbors
2-hop neighbors
MPR
MS
A
A
A, E
A, G
G
www.tm.uka.de
Example OLSR III

B
C
Node
A
B
C
D
E
F
G
H
1-hop neighbors
F, D
A, D, F
A, D, F
A, E
D
A, G
F, H
G
2-hop neighbors
E, G
E, G
E, G
MPR
D, F
D, F
D, F
MS
www.tm.uka.de
Example OLSR IV
B
C
Node
A
B
C
D
E
F
G
H
1-hop neighbors
B, C, D, F
A, D, F
A, D, F
A, B, C, E
D
A, B, C, G
F, H
G
2-hop neighbors
E, G
E, G
E, G
F
A
D
A
MPR
D, F
D, F
D, F
B
D
B
F
MS
B, C
B, C
www.tm.uka.de
Example OLSR V
B
C
Node
A
B
C
D
E
F
G
H
1-hop neighbors
B, C, D, F
A, D, F
A, D, F
A, B, C, E
D
A, B, C, G
F, H
G
2-hop neighbors
E, G
C, E, G
B, E, G
F
A, B, C
D
A, B, C
MPR
D, F
D, F
D, F
B
D
B
F
MS
D, F
B, C
B, C
www.tm.uka.de
Example OLSR VI
B
C
Node
A
B
C
D
E
F
G
H
1-hop neighbors
B, C, D, F
A, D, F
A, D, F
A, B, C, E
D
A, B, C, G
F, H
G
2-hop neighbors
E, G
C, E, G
B, E, G
F
A, B, C
D, H
A, B, C
F
MPR
D, F
D, F
D, F
B
D
B, G
F
G
MS
D, F
A, B, C, E
A, B, C, G
www.tm.uka.de
Example OLSR VII

B
C
Node
A
B
C
D
E
F
G
H
S
T
A
B
L
E
!
1-hop neighbors
B, C, D, F
A, D, F
A, D, F
A, B, C, E
D
A, B, C, G
F, H
G
2-hop neighbors
E, G
C, E, G
B, E, G
F
A, B, C
D, H
A, B, C
F
MPR
D, F
D, F
D, F
B
D
B, G
F
G
MS
D, F
A, B, C, E
A, B, C, G
F, H
www.tm.uka.de
Optimized Link State Routing (OLSR)

Efficient flooding possible with this algorithm
Source node broadcasts message

Optimization compared to the standard flooding algorithm:
z
Not all nodes forward the message, but only the MPRs
Y forwards a message received from X, if X is an MS of Y
Forwarding also done as a broadcast

z Forwarding of duplicates is avoided by the use of sequence numbers
z
Number of selected MPRs has a direct effect on network load

z
Number of MPRs should be optimal (minimal) to reduce traffic

Standard
flooding
Efficient
flooding with MPR
www.tm.uka.de
S
T
A
B
L
E
!
Example OLSR VIII

Efficient flooding of messages, example: source node B
MPRs of B
www.tm.uka.de
Example OLSR IX
MPR of F
MPR of D
Nodes F and D are MPRs of B and forward the packet received
www.tm.uka.de
Example OLSR X
MPR of G
Node B does not forward the packet received by F and D again (sequence numbers)
Node G is an MPR of F and forwards the packet received from F
Node F does not forward the packet received by G again (sequence numbers)
www.tm.uka.de
Optimized Link State Routing (OLSR)

Efficient flooding of link state information
Each node X with MS periodically sends a TC (Topology Control) message.

It contains:
own address
z complete list of own MS
z
Each node in the network collects information about MS from TC messages

Network topology can be reconstructed to a sufficient extent
z Shortest routes can be determined according to Dijkstra
z
Optimization: Combination (Piggyback) of HELLO and TC messages

z
Reduction of media accesses
Particular effective in networks with a high node density
Only few nodes act as MPR
OLSR is a standard protocol (experimental) in the IETF (RFC 3626)
www.tm.uka.de
Reactive routing protocols

Principle
A node only knows the routes it actually requires

No periodic updates
Tasks of a reactive routing protocol
Finding a route (Route Discovery)

z
Only when a node wants so send data to a node, but does not yet have a route to that
node
Maintaining a Route (Route Maintenance)

z
Only active routes are maintained
Comparison to proactive routing protocols
Advantage
Only routes that are actually needed are determined and maintained
z No periodic transmission of messages necessary less use of resources
z
Disadvantage
Time delay at the beginning of a communication: route has to be determined first
z Control overhead depends on number of connections and mobility
z
www.tm.uka.de
Example: Ad Hoc On Demand Distance Vector Routing (AODV)
Route Discovery
Sender S floods the ad-hoc network with a Route Request (RREQ)

z
RREQ contains source address S and destination address D
Nodes that are involved in forwarding the RREQs store the address of
the node from which they received the RREQ
The so-called Reverse Path into the direction of the sender S is built
up
Only works with bidirectional links!
When the destination node D receives the RREQ, it answers with a

Route Reply (RREP)
z
RREP contains source address S
RREP is forwarded via unicast to node S (use of Reverse Path)

With the forwarding of the RREPs, the so-called Forward Path into the
direction of the destination node D is built up
The Forward Path is used for data traffic
www.tm.uka.de
AODV: Route Request I

Source: N. Vaidya, Tutorial Mobicom 01
Y
Z
S
E
F
G
H
K
I
Node that has received a Route Request (RREQ)

Node in transmission range
www.tm.uka.de
AODV: Route Request II

Y
Broadcast
Z
S
E
F
G
H
K
I
D
N
RREQ
www.tm.uka.de
AODV: Route Request III

Y
Z
S
E
F
G
H
K
I
Reverse Path
Each node stores the address of the neighbor from which a RREQ packet
has been received
Requires state maintenance in all nodes
www.tm.uka.de
AODV: Route Request IV

Y
Z
S
E
F
G
H
K
I
J
D
The Reverse Path from each intermediate node to the sender is built up
www.tm.uka.de
AODV: Route Request V

Quelle: N. Vaidya, Tutorial Mobicom 01
Y
Z
S
E
F
G
H
K
I
www.tm.uka.de
AODV: Route Request VI

Y
Z
S
E
F
G
H
K
I
J
D
When the RREQ has arrived at D, there is a Reverse Path from D to S
www.tm.uka.de
AODV: Route Reply

Y
Forward Path for data
Z
S
E
RREP
G
H
Thereupon, D sends a RREP to S via the Reverse Path

By the RREP, the Forward Path for data traffic from S to D is built up
www.tm.uka.de
AODV: Sequence numbers

Each node has a Destination Sequence Number
Determines the up-to-dateness of routing information

Is only incremented, never decremented
z
Exception: Overflows
RREQ contains last known Destination Sequence Number of the

destination node
Optimization: Destination nodes or intermediate nodes knowing a newer route

(higher Destination Sequence Number) reply with RREP
RREP also contains Destination Sequence Number

If more than one RREP has been received, the RREP with the highest
Destination Sequence Number will be used
z
In case of equal Destination Sequence Numbers, the one with the lowest Hop Count
is selected
May accelerate the establishment of a route and save protocol overhead in

combination with Expanding-Ring-Search
www.tm.uka.de
AODV: Optimizations
Expanding Ring Search
RREQs are not flooded in the whole network

z
z
First, RREQs with low time-to-live (TTL) are sent

If the search fails, a RREQ with a higher TTL is sent
Reduces network load when determining routes to nearby nodes

In case of distant nodes
z
z
Slower route establishment

Nearby nodes have to forward many RREQs
www.tm.uka.de
AODV: Maintenance of a route

Reverse/Forwarding Path entries are deleted after timeout
Soft-state approach
The transport of data along a route refreshes this route
Timers are reseted
Detection of link breaks

Missed HELLO messages
Missed link-layer acknowledgements (Receipts on MAC layer)
Reaction to Link breaks: Sending of a RERR

contains increased Destination Sequence Number
Is forwarded to the source
Source tries to find a new route by issueing a RREQ
www.tm.uka.de
AODV: Maintenance of a route

Destination Sequence Numbers prevent loops
A sends to D, Link from C to D breaks
RERR from C to A gets lost
Later, C wants to send to D
RREQ contains higher Destination Sequence Number
A receives RREQ via C-E-A

A sees higher Destination Sequence Number and does not sent RREP
for D
www.tm.uka.de
AODV: Optimizations
Local Route Repair
In case of a link break, RERR is not sent to the source immediately

z
Node detecting a link break searches a new route to the destination itself
(RREQ)
Can reduce network load in the average

Can lead to worse (longer) routes, as only sections of the route are
newly determined
AODV is a standard protocol (experimental) in the IETF

(RFC 3561)
www.tm.uka.de
4. Current research areas

There are intensive research activities in many areas of mobile ad-hoc
networks (also at our institute)
Multicast-Routing
z
Autoconfiguration
z
Control over topology by variation of transmit power of each device and thereby
minimization of interference between the nodes
Security
z
How can the integration of mobility protocols (Mobile IP) and routing in mobile ad-hoc
networks be realized?
Power Control
z
In a mobile environment, finding mobile services is of crucial importance
Integration with fixed networks

z
dynamic assignment of unique IP addresses with a distributed mechanism
Service Awareness
z
Lots of group applications, like E-Learning, are based on IP-Multicast routing

protocols
Integration of security mechanisms into mobile ad-hoc networks is very difficult
Scalability, ...
www.tm.uka.de
IP-Autoconfiguration in MANETs
Internet Protocol (IP) requires unique IP addresses
Autoconfiguration of the network
Requirements
Efficiency concerning communication complexity

Robustness against packet loss
Support for network partitioning and
merging
z
Resolution of address conflicts
As few address changes as possible

Flexibility concerning routing protocol
z
Address
Hierarchical addressing, if necessary
Rapidness of address assignment
5
path
D
a
t
a
D
4
C
?
2
F
Example of network merging
www.tm.uka.de
The PACMAN concept

Robustness by a hybrid approach as well as coupling with routing
Distributed allocation table and Duplicate Address Detection (DAD)

Implicit support for network merging
Efficiency by cross-layer/passive mechanisms
Passive DAD by anomaly detection in routing protocol traffic

Passive synchronization of the allocation table
Reduction of dependencies by modular architecture
Routing protocol
instance
Application
comm.
Transport.
Network
PACMAN
Data Link
Routing protocol
packets
PACMAN:
Passive Autoconfiguration
for Mobile Ad hoc Networks
Physical
www.tm.uka.de
Example: Neighborhood History (NH) Module

Model of a proactive link-state routing protocol
Nodes periodically send routing protocol messages

Source address (SA)
z Sequence number (SN)
z Set of bidirectional link states (LS)
z
Each node forwards them
Principle of the NH module
SA: 4
SN: 5
LS: 1,2,3
4
D
Utilization of bidirectional
neighborhood relationships
z
Maintenance of an NH table
with addresses which were
neighbors in the past time span td
A
B
NH table(C)
2,3
C 1
NH: Neighborhood History

www.tm.uka.de
Prototype Implementation
Implementation for Pocket

PCs with Linux operating
system
Modification of routing
protocol implementations
not necessary
www.tm.uka.de
Multicast-Routing
Multicast is a 1:n communication which enables group communication
Group of nodes is identified by an IP multicast address

Application only has to send a data packet once
z
Addressed to the IP multicast address of the corresponding group
Multicast data packet is forwarded to all group members
Application scenarios for multicast
Streaming
z
CSCW (Computer Supported Cooperative Work)

z
E.g. Internet radio

E.g. video conferences, whiteboards, distributed editors
Multiplayer games
E-Learning
Service Discovery
www.tm.uka.de
ODOMP - On-demand Overlay Multicast Protocol

Creation of an overlay network between the group members
Group member are connected via IP-in-IP tunnels

Multicast data packets are encapsulated in IP unicast packets
z Routing is done by an arbitrary underlying unicast routing protocol (e.g. AODV)
z
Overlay has the form of a tree

Source node is root of the tree
z Data duplication by none-leaf nodes
z
Group members forward a copy of the multicast data packet to each of their
downstream members
sender
Group member
Non-group member
Real link
Overlay link
www.tm.uka.de
References
[1] C.-K. Toh, Ad Hoc Mobile Wireless Networks: Protocols and Systems,
Prentice Hall, 2002
[2] C. Perkins, Ad-hoc Networking, Addison Wesley, 2000
[3] IETF MANET Working Group, http://www.ietf.org/html.charters/manetcharter.html
www.tm.uka.de

Mobile Ad Hoc Network

Uploaded by

Document Information

Original Title

Copyright

Available Formats

Share this document

Share or Embed Document

Sharing Options

Did you find this document useful?

Is this content inappropriate?

Copyright:

Available Formats

Mobile Ad Hoc Network

Uploaded by

Copyright:

Available Formats

Mobile ad hoc networks (MANET)

Circle Lecture Communication Systems

Mobile ad hoc networks 1

Wireless networks without infrastructure

no base station/access points, no backbone

Each terminal is host and router at the same time!

Routes between two devices can be several hops long

Ad-hoc networks are self-organizing

Mobile ad hoc networks 2

Example of data packet routing in MANETs

Mobile ad hoc networks 3

Advantages and applications

Simple, fast and cheap setup of networks

transmit power can be reduced compared to wireless infrastructure networks

More robust concerning failure of single components due to decentralized structure

formations of soldiers, tanks, planes,...

conferences, exhibitions, meetings, lectures

Mobile ad hoc networks 4

Application 1: Sensor networks

Sandbags protect a dyke

Support by sensor networks

Sandbags are equipped with

Source: Timmermann, Uni Rostock

Application 2: Vehicle networks

Mobile ad hoc networks 6

Application 3: Integration with cellular systems

UMTS base station

e.g. no access network

WLAN access point

e.g. for P2P or

Mobile ad hoc networks 7

Properties of mobile ad-hoc networks

No central always on components

Limited battery power of mobile devices

Worsened by signaling traffic, e.g. of the routing protocol

Quality of connections can differ between both directions

Mobile ad hoc networks 8

Construction of transceivers, being able to broadcast and receive on the

IEEE 802.11 in Ad-hoc mode with

Mobile ad hoc networks 9

802.11 MAC-layer: Distributed Coordination Function

Station senses medium

Station may send the data frame

Case 2: Medium ist busy

Ack for received data frame (after Short IFS)

Mobile ad hoc networks 10

Problem of hidden terminals

Mobile ad hoc networks 11

MAC-layer: DCF with RTS/CTS

Sender tansmits RTS first

contains Network Allocation Vector (NAV)

Receiver replies with CTS (after SIFS)

Mobile ad hoc networks 12

Mobile ad hoc networks 13

3. Unicast routing protocols for mobile ad-hoc networks

Minimal number of hops

e.g. until partitioning due to empty batteries of a network node

Mobile ad hoc networks 14

Proactive Routing (Table-driven)

Routes to all nodes are maintained

Reactive Routing (On-demand)

Routes are determined only when needed (Route Discovery)

Mixture of proactive and reactive routing