Professional Documents
Culture Documents
Lect04 PDF
Lect04 PDF
http://www.cs.tut.fi/kurssit/TLT-2756/
Ad hoc networks D.Moltchanov, TUT, 2009
OUTLINE:
• Problems for MAC to deal with;
• Design goals;
• Classification of MAC protocols
• Contention-based protocols
• Contention-based with reservation mechanism
• Contention-based with scheduling mechanism
• MAC protocols for directional antennas
• Power control MAC protocols
packets packets
t
t+Delta(t)
Figure 3: Network partitioning is one of the biggest problem to deal with at MAC sublayer.
2. Design goals
What we want from MAC protocol:
• allow fair access to the shared radio medium;
• operation of the protocol should be distributed;
• should support real-time traffic;
• the access delay must be minimized;
• available bandwidth must be utilized efficiently;
• fair bandwidth allocation to competing nodes;
• control overhead must be minimized;
• the effects of hidden/exposed terminals must be minimized;
• must be scalable;
• should minimize power consumption;
• should provide synchronization between nodes.
- DPS; - MMAC;
- DWOP; - MCSMA;
sender initiated receiver initiated - DLPS. - PCM;
- RBAR.
- RI-BTMA;
- MACA-BI;
- MARCH.
synchronous asynchronous
single channel multiple channel
- D-PRMA; - MACA/PR;
- CATA; - RTMAC.
- MACAW; - BTMA; - HRMA;
- FAMA. - DBTMA; - SRMA/PA;
- ICSMA. - FPRP.
RTS RTS
CTS CTS
Data Data
ACK ACK
NEIGHBOR
SENDER
CTS ACK
REVEIVER
BACK-OFF
63 1st
127 2nd
255 3rd
511 4th
S1 R S2
Solution:
• the packet header contains the field set to the current back-off value of the transmitting node;
• a node receiving this packet copies this value to its back-off counter (fairness);
• CW = CWmin after every successful transmission.
S1 R S2
BACKOFF
CW=511
S1
RECEIVER
RTS
DATA
CTS
CTS
R1 S1 S2 R2
DATA RTS RTS
no CTS
RTS
CTS
DS
DATA
ACK
RTR RTR
DATA
CTS CTS
DATA
CTS CTS
DATA
CTS
DATA
Chain relaying
A B C D E
Receiver CTS
Frame length
Frame length
SYN SR RR RC DS ACK
pv (n) > pR
d, (1)
where pv (n) is the access priority level of voice node after n reservation attempts.
where ∆pv and ∆pd are priority increments for voice and data services.
• ∆pv and ∆pd is determined as follows:
∆pR
v τS
∆pv = , ∆pd = αlQ , (3)
τr
– τS is the slot duration;
– τr is the residual lifetime for voice service;
– lQ is the queue length;
– α is the scaling coefficient.
The following constraint ensures that the voice source always may get access:
S D P S D P S D P
6 7 2 6 7 2 6 7 2
1 2 7
RTS DATA
Node 3 (neighbor to node 1)
CTS ACK
Node 4 (neighbor to node 2)
S D P S D P S D P
5 6 5 5 6 5 5 6 5
1 2 7
Initial conditions:
- Flow 2 has higher priority that flow 1;
- B and C are not within direct cov. of A;
B - A is not aware that B has a higher priority.
1
A D 2
C Problem:
- A tries to get access;
- flow 2 receives an unfair share.
coverage of 2
coverage of 1
B
1 2 B may have stale entries
A D 3 E F due to collisions at B and C
with flows 1 and 2
C
Solution:
If packets with lower priority, than the node has, are transmitted it removes the oldest entry.
RT S
CT ATA
S
D
Figure 24: Packet transmission using directional antennas.
Directional abntenna at C
DRTS DRTS is blocked
OCTS OCTS
A B C D
DDATA DDATA
DACK DACK
DMAC-1 protocol allows transmissions that are not possible using omnidirectional antennas.
G A B C D
DDATA DDATA
DRTS DACK DACK
DRTS and DACK
In DMAC-2 the sender may send either ORTS or DRTS based on the following:
• if none of directional antennas of the node are blocked, ORTS is sent;
• otherwise, DRTS packet is sent (if that antenna element is not blocked).
The problem in Fig. 26 is resolved e.g., node G is aware of transmission between A and B.
DATA
ns se
ACK
ing S
CT Solution: increase power to pmax during
DATA packet transmission:
RTS A B CTS
pmax
pd
DATA packet