Classification of Media Access

and Routing Protocols

Seminar: Mobile Ad-Hoc Systeme

Name: Manuel Lang

1
MAC-Protocol Design Issues

ƒ Bandwidth Efficiency
small radio spectrum => available communication bandwidth is limited

ƒ Hidden and Exposed Terminal Problems

hidden terminal:
CS (Carrier Sense) fails ->
collision near B
CD (Collision Detection) fails A detects no collision -> A is
A
hidden from C
B C
sender receiver sender

Exposed terminal:
unnecessary delay if B is sending, and C wants send
D

data to D
2
...Design Issues

„ Near and Far Terminals

C receives stronger signal from B,
signal of A gets lost => power
A B C

control is necessary (UMTS 1500/s)

„ Distributed Nature
ƒ no central coordination
ƒ additional control overhead must be considered

ƒ Mobility
ƒ topology changes
ƒ some protocols use bandwidth reservation, this reservation must be
released if a node gets out of range

3
Media Access Procedures (1)
„ Classical Aloha
„ time multiplex without control
„ random access
„ collision if two transmissions at the same time
„ Slotted Aloha
„ Extension: time slots to avoid partly collisions
„ doubled throughput (from 18% to 36%)
„ exactly time-synchronisation is required
„ no bandwidth guarantees possible
„ Carrier Sense Multiple Access
„ access only to a free medium
„ CSMA with Collision Avoidance in wireless networks
„ use of waiting periods to reduce collisions

4
Media Access Procedures (2)
„ Demand Assigned Multiple Access
„ use (Slotted)Aloha in reservation phase -> collisions are possible
„ use TDM for a collision-free payload transmission

„ TDMA with reservation

„ rigidly reservation and payload-transmission phases + spontaneously access

„ MACA Multiple Access with Collision Avoidance

„ Solves hidden-terminal problem, using RTC/CTS Packets to control medium
access

5
Media Access Procedures (3)
„ Spread Aloha Multiple Access

„ CDMA is efficient, but to complex for ad-hoc nodes

-> a node must know all spread-codes of its communication partners
„ Aloha is simple, but not very efficient
„ combination of booth -> only one shared code is used

„ code characteristics :
n

„ high autocorrelation ->

a *a = ∑a
i =1
i
2
high scalar product with itself

„ e.g. Barker Code: a = (+1, -1, +1, +1, -1, +1, +1, +1, -1, -1, -1)
„ a*a = 11

„ low correlation ->

a * a _ shift = ∑ a * a _ shift
i =1
i i
low scalar product with shifted code

„ shifted Barker Code a_shift = (-1, +1, +1, -1, +1, +1, +1, -1, -1, -1, +1)
„ a*a_shift = 1

6
 Media Access Procedures (4)
collision

sender A 1 0 1

t
narrow band 1) classical aloha
sender B
0 1 1

short pulse, 2) it‘s possible to decrease the pulse-time, if

but with more power
t the transmitting power is high enough

3) spread booth signals with a marginal time

t shift
signal spread with 110101 sequence

ƒ with exactly synchronisation between sender and receiver, the receiver is able to recognize the signal
-> because of the code characteristics, signals from other senders are noticed as noise

ƒ number of active senders at the same time must be less than 0,1 - 0,2*s (s....spread-factor)

7
 Classification Tree
MAC Protocols for
Ad - Hoc Wireless
Networks

Contention-Based
Contention-Based
Protocols with
Protocols
Reservation Mechanisms
Contention-Based
Protocols with Other MAC Protocols
Scheduling Mechanism

Sender-Initiated Receiver-Initiated Synchronous Asynchronous

Protocols Protocols Protocols Protocols

Single-Channel Multi-Channel
Protocols Protocols

8
Contention-Based Protocols

„ a node does not make any resource reservation a

priori

„ competes with its neighbours for access to shared

channel

„ no bandwidth reservation possible => no QoS

9
Contention-Based Protocols with
Reservation Mechanism

„ for real-time traffic which requires QoS

„ reserving bandwidth a priori

„ Synchronous protocols
ƒ require time synchronisation => TDMA-Protocols
ƒ time synchronisation is generally difficult to achieve

„ Asynchronous protocols
ƒ No synchronisation -> relative time information is used

10
Contention-Based Protocols with
Scheduling Mechanisms
„ use scheduling to give nodes access to channel
„ no node is starved of bandwidth

„ Some scheduling schemes also take in consideration

battery characteristics and remaining battery power

11
 Extended Classification Tree
MAC Protocols for
Ad - Hoc Wireless
Networks

Contention-Based Contention-Based
Contention-Based
Protocols with Protocols with Other MAC Protocols
Protocols
Reservation Mechanisms Scheduling Mechanism

DPS Protocols using

Sender-Initiated Receiver-Initiated Synchronous Asynchronous Directional Antennas
Protocols Protocols Protocols Protocols

DWOP
MMAC

DLPS
Single-Channel Multi-Channel RI-BTMA D-PRMA MACA/PR
MCSMA
Protocols Protocols

MACA-BI CATA RTMAC PCM

MACAW BTMA HRMA

MARCH RBAR

FAMA DBTMA SRMA/PA

ICSMA FPRP

12
Routing Protocols

„ Why no wired protocols like RIP or OSPF?

- compare to MAC-Protocols, similar background ->

mobility, limited resources…

13
…other aspects

ƒ infrastructure without a base-station

ƒ destination-node could be outside from source range

ƒ most nodes should be able to pass on packets

ƒ asymmetric connections are common

ƒ wired strategies convergence to slow (distance-vector)

or produces to much traffic (link-state)

ƒ interferences makes transmission more difficult

14
Alternative metrics

„ Why?
- hop-count only, does not consider interferences and heavy
varying connection-quality

- improve routing with weighted metrics

cost = alpha*h + beta*i + gamma*r + delta*e…
h=hops
i=possible interferences
r=responsibility
e=error-rate

15
 Least interference Routing

N2
N1

E1

S1

a longer path (more hops) could be

N3 N4
a better alternative, because it’s
less influenced by interferences

N6 E2
N5
S2

N7 N8 N9

16
 Classification Tree

Routing Protocols
for Ad Hoc Networks

Based on Routing Based on the Use of Miscellaneous

Based on Topology
Information Update Temporal Information for Classification Based on
Information Organization
Mechanism Routing Utilization of Specific Resources

Path Selection Path Selection Routing Using Routing with

Table-Driven On-Demand Flat Hierarchical Power-Aware
Hybrid Using Past Using Geographical Efficient
(Proactive) (Reactive) Routing Routing Routing
History Prediction Information Flooding

17
Based on the Routing Information
Update Mechanism (1)

„ Proactive/table-driven
„ periodically or event based flooding of routing-tables
-> based on link-state
„ distant routing-entries are rarely send
+ guarantee regarding on connection establishment-duration or delay
- a lot of unnecessary traffic when the payload is small

„ Reactive/on-demand
„ obtains necessary path when it is required
+ good scalability when traffic is small
- initial delay
- no guarantees

18
Based on the Routing Information
Update Mechanism (2)
„ Hybrid

„ combine the best features of the above two categories

„ each node defines a zone around itself
„ within this zone proactive routing is used

„ beyond this zone reactive routing is used

19
Based on the Use of Temporal
Information for Routing

„ Path Selection Using Past History

„ uses information about the past status of the links to make routing
decisions
„ provides a path that may be stable at time of path-finding

„ Path Selection Using Prediction

„ Use expected future status to make approximate routing decisions
„ Future status information includes
„ lifetime of a node (remaining battery, charge discharge rate)
„ prediction of location

20
Based on Topology Information
Organization (1)

„ Flat Routing

„ no hierarchy of groups which contain special nodes

„ every node performs the same routing-tasks

„ flat addressing

- only for small networks useful

21
 Based on Topology Information
Organization (2)

Internet
head/gateway
„ Hierarchical Routing
base-station „useful for bigger networks,
because its more scalable
„ different routing protocols
within and between groups
reduces the overhead
group
„ unimportant changes from
other groups are hidden
super group „its difficult to maintain the
group-hierarchy in very dynamic
networks

22
Based on Utilization of specific
Resources

„ Routing Using Geographical Information

ƒ routing-information is send within a geographical region

ƒ addresses are based on graphical information instead of

numbers

ƒ GPS is a possibility to determine this information

+ control overhead is reduced

23
 Extended Classification Tree
Routing Protocols
for Ad Hoc Networks

Based on Routing Based on the Use of Miscellaneous

Based on Topology
Information Update Temporal Information for Classification Based on
Information Organization
Mechanism Routing Utilization of Specific Resources

Path Selection Path Selection Routing Using Routing with

Table-Driven On-Demand Flat Hierarchical Power-Aware
Hybrid Using Past Using Geographical Efficient
(Proactive) (Reactive) Routing Routing Routing
History Prediction Information Flooding

PAR LAR

DSDV DSR CEDAR DSDV FORP DSR CGSR Table-Driven On-Demand

WRP AODV ZRP WRP RABR AODV FSR OLSR PLBR

CGSR ABR ZHLS STAR LBR ABR HSR

STAR SSA DSR SSA

OLSR FORP AODV FORP

FSR PLBR FSR PLBR

HSR HSR

GSR GSR

24
Questions?

25