Secret Sharing Schemes Based on Minimum Bandwidth Regenerating Codes
Fair Sharing of Bandwidth in VANETs · 2007-12-07 · Fair Sharing of Bandwidth in VANETs 2nd...
Transcript of Fair Sharing of Bandwidth in VANETs · 2007-12-07 · Fair Sharing of Bandwidth in VANETs 2nd...
Fair Sharing of Bandwidth in VANETs
2nd Workshop on Vehicular Ad Hoc Networks
2nd September 2005, Cologne, Germany
Marc Torrent-Moreno, University of Karlsruhe, Germany
Paolo Santi, Consiglio Nazionale delle Ricerche, Italy
Hannes Hartenstein, University of Karlsruhe, Germany
VANET‘05 Marc Torrent-MorenoUniversität Karlsruhe (TH)
Marc Torrent-Moreno - 2Universität Karlsruhe (TH)VANET‘05
Which Problem are we looking at?
Simple scenario:
Simple question:
- Which transmission power should I use?
Not so simple constraint:
- Safety
Marc Torrent-Moreno - 3Universität Karlsruhe (TH)VANET‘05
Structure of this talk
» Introduction
» Motivation
» The challenge
» Our approach – Fairness
» FPAV Algorithm
» Experiments
» Discussion – Current work
» Summary
Marc Torrent-Moreno - 4Universität Karlsruhe (TH)VANET‘05
Introduction – Context
» In a VANET every vehicle will send/receive into/from shared medium
» In the USA, FCC: 7 channels, 1 control channel
» Control channel: Exchange of safety information
» 2 types of safety related messages:– Event driven– Periodic
» Periodic messages will essentially contain the state of the vehicle :– Position– Direction– Speed– …
Marc Torrent-Moreno - 5Universität Karlsruhe (TH)VANET‘05
Motivation
» Amount of load resulting from beaconing should be limited
Why?
– Leave some bandwidth for unexpected emergency situations
– 802.11p is a variant of 802.11a with 10MHz channels (half data-rates)
– CSMA/CA is an asynchronous approach, not able to manage bandwidth efficiently
– Safety messages are mainly broadcast (~Hidden terminal problem)
– Potential high node density scenarios
How?
– Prioritization – Admission control
– Adjusting packet generation rate
– Adjusting transmission power
Marc Torrent-Moreno - 6Universität Karlsruhe (TH)VANET‘05
The Challenge
» Constraint: The load in the channel must be limited – MBL (Maximum Beaconing Load)
» … how do I make sure that the beaconing load is lower than MBL everywhere in a reasonable way?
» Options for power level assignments:– Capacity– Connectivity
VANETs main goal is Safety!
Marc Torrent-Moreno - 7Universität Karlsruhe (TH)VANET‘05
How do we achieve safety?
» … being fair: Fairness from the system perspective
» How can we adjust transmission power in a fair approach?
Fair Power Control: All vehicles in a certain (busy) area must restrict their beacons’ transmission power by the same ratio
– Maximize the minimum transmission power– Maximize individual coverage
Marc Torrent-Moreno - 8Universität Karlsruhe (TH)VANET‘05
Our Approach to Fairness – Assumptions
» Assumptions:– The Carrier Sense Range is monotonicAlso in the paper for clarity reasons:– All nodes have the same beaconing frequency and packet sizes– All nodes have the same Maximum Transmission Power (Pmax)
» In this case, MBL can be counted in:– bits per second– # of overlapping Carrier Sense Ranges
BL=2BL=3
Marc Torrent-Moreno - 9Universität Karlsruhe (TH)VANET‘05
Our Approach to Fairness – Definition
» Problem Statement:
» Challenge:
– Beaconing Max-Min Tx Power
– Per node maximal power assignment
BL=2BL=3
PA(1) PA(3) PA(n)PA(2)
BL(PA) ≤ MBL
• PA: Power Assignment• PA(i)×Pmax: Transmission Power
where PA(i)∈[0,1]
Marc Torrent-Moreno - 10Universität Karlsruhe (TH)VANET‘05
FPAV Algorithm
» FPAV: Fair Power Adjustment for Vehicular environments
» First approach – Optimal Solution:
– Totally centralized
– Global knowledge
» Two stages:
– Stage 1: Compute an optimal solution to BMMTxP
– Stage 2: Augment the solution into a per-node maximal power assignment
Marc Torrent-Moreno - 11Universität Karlsruhe (TH)VANET‘05
FPAV – Stage 1
Input: a set of nodes
Output: a power assignment PA which is an ( ε×Pmax-aproximation of an) optimal solution to BMMTxP
}{ nuuN ,...,1=
ε
ε
−=∈∀
+=∈∀≤
=∈∀
)()(,whileend
)()(,do))((while
0)(,
iPAiPANu
iPAiPANuMBLPABLiPAsetNu
i
i
i
Marc Torrent-Moreno - 12Universität Karlsruhe (TH)VANET‘05
FPAV – Stage 1 – Visualization
BL MBL = 2
12
Marc Torrent-Moreno - 13Universität Karlsruhe (TH)VANET‘05
FPAV – Stage 2
Input: an optimal solution to BMMTxP, denoted PA
Output: a power assignment PA which is a ( ε×Pmax-aproximation of a) per node maximal power assignment following strict fairness
whileendforend
ifend)(
)()(then))((if
)()(do)1(for
do)set,(!while)(set,
trueieachedTopRiPAiPA
MBLPABLiPAiPA
ntoitrueeachedTopRNu
falseieachedTopRNu
i
i
=−=
>+=
==∈∀
=∈∀
ε
ε
Marc Torrent-Moreno - 14Universität Karlsruhe (TH)VANET‘05
FPAV – Stage 2 – Visualization
BL MBL = 2
Please, take a look at the paper for the proofs
12
Marc Torrent-Moreno - 15Universität Karlsruhe (TH)VANET‘05
Experiments
Configuration Distribution
Packet generation rate 10 pckts/s
Packet size 250B
Loadvehicle 20Kbps
Data Rate 6Mbps
Maximum beaconing load 3Mbps
Communication range 250m
Carrier Sense range 500m
Step size ε 0.01
Vehicle density 20veh./100m
0
50
100
150
200
250
0 500 1000 1500 2000 2500 3000 3500 4000
Veh
icle
Den
sity
(V
ehic
les/
1000
m)
Position in the road
Random Vehicle DensityDeterministic Vehicle Density
#Cars
1
4
m
Marc Torrent-Moreno - 16Universität Karlsruhe (TH)VANET‘05
Experiments – Results
Deterministic Distribution ‘Random’ Distribution
0
1000
2000
3000
4000
5000
0 500 1000 1500 2000 2500 3000 3500 4000 0
0.2
0.4
0.6
0.8
1
1.2
1.4
1.6
1.8
2
Load
(K
bps)
PA
Position in the road
PA values
Offered LoadMaxBeaconingLoad
Adjusted LoadPA value
0
1000
2000
3000
4000
5000
0 500 1000 1500 2000 2500 3000 3500 4000 0
0.2
0.4
0.6
0.8
1
1.2
1.4
1.6
1.8
2
Load
(K
bps)
PA
Position in the road
PA values
Offered LoadMaxBeaconingLoad
Adjusted LoadPA value
Marc Torrent-Moreno - 17Universität Karlsruhe (TH)VANET‘05
Discussion – Current Work
» Centralized or synchronous approaches are not feasible in VANETs
» Challenge: iterative (feedback) schemes are likely to fail due to high dynamics
Current Work:
» How to implement FPAV in a fully distributed, asynchronous fashion– Let each node run FPAV internally with local knowledge– How close to centralized FPAV can we get?
Marc Torrent-Moreno - 18Universität Karlsruhe (TH)VANET‘05
Summary
» We addressed the limited channel capacity of VANETs to support safety-related information exchange
» We propose to limit the wireless channel load resulting from periodic messages
» We propose strict FAIRNESS due to SAFETY nature of VANETs
» Formally defined the challenge in terms of Max-Min optimization problem extending it to obtain per-node maximality
» We proposed a centralized algorithm FPAV and briefly point the issues to bring it into a real scenario
» Our goal is to come up with a fully distributed, localized and asynchronous implementation
Thank you very much for your attention !
http://dsn.tm.uka.de
VANET‘05 Marc Torrent-MorenoUniversität Karlsruhe (TH)