MAX-MIN based Buffer Allocation for VANETs

6th IEEE International Symposium on Wireless Vehicular

Communications
Luis Urquiza-Aguiar1 Andrs Vzquez-Rodas1 Carolina
Tripp-Barba2 Mnica Aguilar Igartua1 Luis J. de la Cruz Llopis1
Emilio Sanvicente Gargallo1
1
Department of Telematics Engineering, Universitat Politcnica de Catalunya, Barcelona, Spain
Email: [ luis.urquiza, andres.vazquez, monica.aguilar, luis.delacruz, e.sanvicente]@entel.upc.edu
2
Faculty of Informatics, Autonomic University of Sinaloa, Mazatlan, Mexico
Email: ctripp@uas.edu.mx

Vancouver, Canada, September 15th 2014

Agenda
Buffer Allocation for
VANETs
L. Urquiza-Aguiar et al
Introduction

Introduction

Background
Buffer Allocation
proposal

Background

Simulation Settings
Simulation Results

Buffer Allocation proposal

Conclusions
References

Simulation Settings
Simulation Results
Conclusions and Future work

22

Dept. of Telematics
Engineering
Technical University of
Catalonia
Spain

Introduction
Buffer Allocation for
VANETs

The MAC specification of the IEEE 802.11p standard uses

the IEEE 802.11e Enhanced Distributed Channel Access
(EDCA) to provide four different Quality of Service (QoS)
levels.

L. Urquiza-Aguiar et al
2

Background
Buffer Allocation
proposal

Many research works focused on the optimization of the

EDCA process to maximize the channel occupancy,
minimize the delay or guarantee reliability in the packet
transmission.

We focus our attention on the queuing process, which

stores packets until an Access Category (AC) can access
the medium.

We propose a buffer allocation algorithm that is able to

share, in a fair and prioritized way, a common buffer. This
approach uses in a better way the buffer room and help to
prevent packet losses.

Introduction

Simulation Settings
Simulation Results
Conclusions
References

22

Dept. of Telematics
Engineering
Technical University of
Catalonia
Spain

QoS in 802.11p I
Buffer Allocation for
VANETs

The IEEE 802.11p

standard uses the IEEE
802.11e Enhanced
Distributed Channel
Access (EDCA) to provide
QoS to the incoming
traffic.

L. Urquiza-Aguiar et al
Introduction
Background
3

QoS in 802.11p
MAX-MIN principle
Buffer sizing for wireless
devices

Buffer Allocation
proposal
Simulation Settings

4 queues Access
Category (AC) background
(BK ), best effort (BE),
video (VI) and voice (VO).

Simulation Results
Conclusions
References

Each queue has different

Arbitration Inter-frame
Space (AIFS), maximum
and minimum contention
window (CWmax , CWmin ).
22

Dept. of Telematics
Engineering
Technical University of
Catalonia
Spain

QoS in 802.11p II
Buffer Allocation for
VANETs
L. Urquiza-Aguiar et al

802.11p implements
independent AC queues
for the control and service
channels (CCH and SCH).

Introduction
Background
4

QoS in 802.11p
MAX-MIN principle
Buffer sizing for wireless
devices

The Channel Coordination

Function (CCF) routes
packets (WAVE and IP
packets) to the proper
channel and enqueues
them in the corresponding
AC.

Buffer Allocation
proposal
Simulation Settings
Simulation Results
Conclusions
References

.
22

Dept. of Telematics
Engineering
Technical University of
Catalonia
Spain

MAX-MIN fair share (MMFS) principle

Buffer Allocation for
VANETs
L. Urquiza-Aguiar et al
Introduction
Background
QoS in 802.11p
5

MMFS (MAX-MIN fair share) guarantee a fair distribution

of a limited resource (buffer space in our case)

MMFS guarantees that none of the parties obtains an

amount of the resource larger than its demand.

When the shared resource is not enough, each party gets

an equal part of the resources.

MAX-MIN principle
Buffer sizing for wireless
devices

Buffer Allocation
proposal
Simulation Settings
Simulation Results
Conclusions
References

22

Dept. of Telematics
Engineering
Technical University of
Catalonia
Spain

Buffer sizing for wireless devices

In a previous work [2], we presented a dynamic buffer sizing
mechanism based on the maximum entropy principle. This
mechanism requires that each node measures two parameters
each time a packet arrives to its queue: the channel utilization
a and the average number of packets in the system Na . With
these two metrics, the buffer size Q that keeps the packet loss
probability below a desired value PL can be computed as:

Q = log

PL

Buffer Allocation for

VANETs
L. Urquiza-Aguiar et al
Introduction
Background
QoS in 802.11p
MAX-MIN principle
6

Buffer sizing for wireless

devices

Buffer Allocation
proposal
Simulation Settings


1

(1)

Simulation Results
Conclusions

where, can be numerically computed by:

Na
1 [(K + 1) K ] K
=
1
1 K
a

References

(2)

where, K = Q + 1, and is equal to:

= a

1
1
1 K

(3)
22

Dept. of Telematics
Engineering
Technical University of
Catalonia
Spain

MAX-MIN inspired Buffer Allocation proposal

Buffer Allocation for
VANETs
L. Urquiza-Aguiar et al
Introduction

Key points
I

The joint of the buffer of the four access categories in a

unique equivalent common buffer.

Background
Buffer Allocation
proposal
7

Key points
Variables
Algorithms

The buffer rooms are allocated according to incoming

demand across the ACs

PMMBA
NewGuaranteeQ
ResizeGuaranteeQ

When the shared buffer is full, our allocation process

releases memory by dropping packets starting from the
lowest to the highest AC priority.

Simulation Settings
Simulation Results
Conclusions
References

22

Dept. of Telematics
Engineering
Technical University of
Catalonia
Spain

Main Variables of proposal

Buffer Allocation for
VANETs

TotalLength

L. Urquiza-Aguiar et al

JoinLength

Introduction

L ENGTH(Qx )

G UARANTEE Q(ACx )

AvailableLength

Background
Buffer Allocation
proposal
Key points
8

Variables
Algorithms

4
X

PMMBA
NewGuaranteeQ

L ENGTH(Qi ) + JoinLength = TotalLength

ResizeGuaranteeQ

i=1

Simulation Settings
Simulation Results

4
X

Conclusions

G UARANTEE Q(ACi ) + AvailableLength

References

i=1

= TotalLength

22

Dept. of Telematics
Engineering
Technical University of
Catalonia
Spain

MAX-MIN inspired Buffer Allocation proposal I

Algorithms
Buffer Allocation for
VANETs
L. Urquiza-Aguiar et al

PMMBA(i, P) This algorithm allocates an incoming packet of

an Access Category (AC).

Introduction
Background

G UARANTEE Q(ACi ) It computes the guarantee size of the

corresponding AC queues
I Fixed length for each Qi

Buffer Allocation
proposal
Key points
Variables
9

Algorithms
PMMBA

TotalLength
G UARANTEE Q(ACi ) =
4
I

NewGuaranteeQ

(4)

ResizeGuaranteeQ

Simulation Settings
Simulation Results

Adaptive length computed at the arrival of a

new packet to the queue Qi
4
X

G UARANTEE Q(ACi ) TotalLength

Conclusions
References

(5)

i=1

22

Dept. of Telematics
Engineering
Technical University of
Catalonia
Spain

MAX-MIN inspired Buffer Allocation proposal II

Algorithms
Buffer Allocation for
VANETs

R ESIZE G UARANTEE Q(i, j, GetLength) is

used when there is no
available room to extend the
G UARANTEE Q of the queue
corresponding to ACi in
GetLength packets.

L. Urquiza-Aguiar et al
Introduction
Background
Buffer Allocation
proposal
Key points
Variables
10

Algorithms
PMMBA
NewGuaranteeQ
ResizeGuaranteeQ

Simulation Settings
Simulation Results
Conclusions
References

22

Dept. of Telematics
Engineering
Technical University of
Catalonia
Spain

Prioritized MAX - MIN Buffer Allocation

Algorithm
Buffer Allocation for
VANETs

PMMBA(i, P)
Require: access category number 1 i 4 and a packet P
Ensure: State of P allocation process.
1: if JoinLength > 0 then
2:
A LLOCATE(P, i) return Success
3: if L ENGTH(Qi ) < G UARANTEE Q(ACi ) then
4:
for all j 4 ,i 6= j do
5:
if L ENGTH(Qj ) > G UARANTEE Q(ACj ) then
6:
D ROP PACKET(Qj )
7:
A LLOCATE(P, i) return Success
8: else
9:
for all j < i do
10:
if L ENGTH(Qj ) > G UARANTEE Q(ACj ) then
11:
D ROP PACKET(Qj )
12:
A LLOCATE(P, i) return Success
return Fail

L. Urquiza-Aguiar et al
Introduction
Background
Buffer Allocation
proposal
Key points
Variables
Algorithms
11

PMMBA
NewGuaranteeQ
ResizeGuaranteeQ

Simulation Settings
Simulation Results
Conclusions
References

22

Dept. of Telematics
Engineering
Technical University of
Catalonia
Spain

Prioritized MAX - MIN Buffer Allocation

Algorithm II
Buffer Allocation for
VANETs
L. Urquiza-Aguiar et al

A LLOCATE(P, i)

Introduction

Require: access category number 1 i 4 and a packet P

Ensure: L ENGTH(Qi ), JoinLength, State of P .
1: JoinLength = JoinLength 1
2: L ENGTH(Qi ) = L ENGTH(Qi ) + 1
3: S TORE(P) return Success

Background
Buffer Allocation
proposal
Key points
Variables
Algorithms
12

PMMBA
NewGuaranteeQ
ResizeGuaranteeQ

D ROP PACKET(Qi )

Simulation Settings
Simulation Results

Require: access category number 1 i 4

Ensure: L ENGTH(Qi ), JoinLength,
1: D ROP L AST PACKET(Qi )
2: JoinLength = JoinLength + 1
3: L ENGTH(Qi ) = L ENGTH(Qi ) 1 return Success

Conclusions
References

22

Dept. of Telematics
Engineering
Technical University of
Catalonia
Spain

New Guarantee queue length I

Buffer Allocation for
VANETs
L. Urquiza-Aguiar et al
Introduction
Background
Buffer Allocation
proposal

N EW G UARANTEE Q(i)

Key points
Variables

Require: access category number 1 i 4

Ensure: G UARANTEE Q(AC
 i )
1: DesiredQi = logi

PLi
i

Algorithms
PMMBA
13

NewGuaranteeQ
ResizeGuaranteeQ

Simulation Settings

2: ExtraLength = DesiredQi G UARANTEE Q(ACi )

3: if AvalaibleLength ExtraLength then
4:
AvalaibleLength = ExtraLength

Simulation Results
Conclusions
References

return (G UARANTEE Q(ACi ) DesiredQi )

22

Dept. of Telematics
Engineering
Technical University of
Catalonia
Spain

New Guarantee queue length II

Buffer Allocation for
VANETs
L. Urquiza-Aguiar et al

5: else
6:
GetLength = ExtraLength AvalaibleLength
7:
j1
8:
while j < i && GetLength > 0 do
9:
R ESIZE G UARANTEE Q(i, j, GetLength)
10:
j++
11:
12:
13:
14:
15:
16:
17:

if GetLength
= 0 then return


G UARANTEE Q(Qi )
limit = TotalLength
4

Introduction
Background
Buffer Allocation
proposal
Key points
Variables
Algorithms
PMMBA
14

NewGuaranteeQ
ResizeGuaranteeQ

Simulation Settings
Simulation Results

GetLength M INIMUM(GetLength, limit)

j i +1
while j < 4 && GetLength > 0 do
R ESIZE G UARANTEE Q(i, j, GetLength)
j++
return

Conclusions
References

22

Dept. of Telematics
Engineering
Technical University of
Catalonia
Spain

Resizing Guarantee Queue length

Buffer Allocation for
VANETs
L. Urquiza-Aguiar et al
Introduction

R ESIZE G UARANTEE Q(i, j, GetLength)

Background

Require: access category number 1 i, j 4

1: && GetLength > 0
Ensure: New G UARANTEE Q(ACi ), G UARANTEE Q(ACj ) && updated
GetLength
TotalLength
2: ToGive = G UARANTEE Q(Qj )
4
3: if ToGive 0 then
4:
nothing to do
5: else
6:
input M INIMUM(GetLength, ToGive)
7:
G UARANTEE Q(Qj ) = input
8:
G UARANTEE Q(Qi )+ = input
9:
GetLength = input
return GetLength

Buffer Allocation
proposal
Key points
Variables
Algorithms
PMMBA
NewGuaranteeQ
15

ResizeGuaranteeQ

Simulation Settings
Simulation Results
Conclusions
References

22

Dept. of Telematics
Engineering
Technical University of
Catalonia
Spain

Simulation Settings
Simulation Scenario
Buffer Allocation for
VANETs
L. Urquiza-Aguiar et al
Introduction
Background
Buffer Allocation
proposal
Simulation Settings
16

Simulation Scenario
Configuration

Simulation Results
Conclusions
References

Eixample district of Barcelona of 1.5 km x 1 km. Buildings from OpenStreetMap. Five

Access Points (APs). 140 Vehicles. Movements obtained with SUMO/C4R

22

Dept. of Telematics
Engineering
Technical University of
Catalonia
Spain

Simulation Settings
Configuration
Buffer Allocation for
VANETs

Parameter
Path loss
Fading model
Power transmission
Receiving sensing
MAC specification
Bandwidth
Packet size
Buffer size
Inter-arrival profile 1
Inter-arrival profile 2
Inter-arrival profile 3
Packet Losses PL
per Access Category
AIFS (slots)
CWmax (slots)
CWmin (slots)
Routing protocol
Simulation time

Value
Empirical IEEE 802.11p [3]
Ricean (LOS) and Rayleigh
(not in LOS)
23 dbm
-82 dbm ( 400 m in LOS)
IEEE 802.11p
6 Mbps
1000 bytes
80 packets (4 x 20)
U (3, 7)
Exp (5), Truncated(2, 10)
Const (5)
0.03(VO), 0.06(VI), 0.09(BE)
0.12(BK )
2(VO), 2(VI), 3(BE), 7(BK )
15(VO), 31(VI), 1023(BE),
1023(BK )
7(VO), 15(VI), 31(BE), 31(BK )
GBSR [4]
120 sec

L. Urquiza-Aguiar et al

The traffic of each

queue is the same
i.e., same rate,
same distribution.
All nodes send the
same traffic.

Introduction
Background
Buffer Allocation
proposal
Simulation Settings
Simulation Scenario
17

The traffic rate used

is low.

Configuration

Simulation Results
Conclusions
References

Notice. These
characteristics make this
scenario one of the most
challenge to test the
proposal.

22

Dept. of Telematics
Engineering
Technical University of
Catalonia
Spain

Simulation Results
Packet Losses
Buffer Allocation for
VANETs
L. Urquiza-Aguiar et al
Introduction
Background
Buffer Allocation
proposal
Simulation Settings
Simulation Results
18

Packet Losses
Delay & Drop Packets

(a) Percentage of packet losses

Traffic type

Buffering Technique

Constant

traditional
PMMBA F

Q
PMMBA D
Q
traditional
PMMBA F
Q
PMMBA D
Q
traditional
PMMBA F
Q
PMMBA D
Q

Exponential

Uniform

AC

AC

Conclusions

Packet losses %
AC
AC
2
1
36.09
35.82
33.48
32.96

References
Total

4
36.25
34.59

3
37.17
35.48

33.34

34.56

32.61

32.58

33.26

32.67
31.47

32.78
31.90

32.92
32.14

32.67
32.33

32.76
31.97

29.55

30.23

30.40

31.14

30.33

32.89
30.87

33.09
31.14

33.23
30.95

32.73
30.74

32.98
30.93

30.33

31.14

31.01

30.75

30.89

36.32
34.13

(b) Packet losses percentage per access category

22

Dept. of Telematics
Engineering
Technical University of
Catalonia
Spain

Simulation Results
Average end-to-end delay And Average drops packets in queues
Buffer Allocation for
VANETs
L. Urquiza-Aguiar et al
Introduction
Background
Buffer Allocation
proposal
Simulation Settings
Simulation Results
Packet Losses

(a) Average end-to-end delay

19

Delay & Drop Packets

Conclusions
References

(b) Average dropped packets per node

22

Dept. of Telematics
Engineering
Technical University of
Catalonia
Spain

Conclusions and Future work

Conclusions
Buffer Allocation for
VANETs
L. Urquiza-Aguiar et al

Prioritized MAX-MIN Buffer allocation (PMMBA) is an

alternative to the default four equal-size independent
queues of IEEE 802.11p

Introduction

PMMBA manages in a fair and prioritized way the

allocation of packets in the different AC queues.

Simulation Settings

PMMBA outperforms the traditional queuing process with

three different traffic patterns tested in a challenging
scenario.

Background
Buffer Allocation
proposal

Simulation Results
Conclusions
20

Conclusions
Future work

References

The best results were achieved when PMMBA worked

together with a dynamic queue sizing that changes the
guaranteed queue size according to the current traffic
characteristics.

22

Dept. of Telematics
Engineering
Technical University of
Catalonia
Spain

Conclusions and Future work

Future work
Buffer Allocation for
VANETs
L. Urquiza-Aguiar et al
Introduction
Background
Buffer Allocation
proposal

The study of our PMMBA algorithm working with other

approaches focused on the optimization of channel
occupancy.
We are interested in the cross configuration between CW
and PL in the queues.

Simulation Settings
Simulation Results
Conclusions
Conclusions
21

Future work

References

22

Dept. of Telematics
Engineering
Technical University of
Catalonia
Spain

Thank you for using your attention

References I
Buffer Allocation for
VANETs

[1] Y. L. Morgan, Notes on DSRC & WAVE Standards Suite:

Its Architecture, Design, and Characteristics, IEEE
Communications Surveys & Tutorials, vol. 12, no. 4, pp.
504518, 2010.
[2] A. Vzquez-Rodas, L. J. de la Cruz Llopis,
M. Aguilar Igartua, and E. Sanvicente Gargallo, Dynamic
buffer sizing for wireless devices via maximum entropy,
Computer Communications, Mar. 2014. [Online]. Available:
http://www.sciencedirect.com/science/article/pii/
S0140366414000899

L. Urquiza-Aguiar et al
Introduction
Background
Buffer Allocation
proposal
Simulation Settings
Simulation Results
Conclusions
21

[3] C. Sommer, D. Eckhoff, R. German, and F. Dressler, A

computationally inexpensive empirical model of ieee
802.11p radio shadowing in urban environments, in
Wireless On-Demand Network Systems and Services
(WONS), 2011 Eighth International Conference on, 2011,
pp. 8490.
22

References

Dept. of Telematics
Engineering
Technical University of
Catalonia
Spain

References II
Buffer Allocation for
VANETs
L. Urquiza-Aguiar et al
Introduction
Background
Buffer Allocation
proposal

[4] C. Tripp Barba, L. Urquiza Aguiar, and M. Aguilar Igartua,

Design and evaluation of GBSR-B, an improvement of
GPSR for VANETs, IEEE Latin America Transactions,
vol. 11, no. 4, pp. 1083 1089, June 2013.

Simulation Settings
Simulation Results
Conclusions
22

22

References

Dept. of Telematics
Engineering
Technical University of
Catalonia
Spain