Graduate Student Orientation Prof. Fusun Ozguner ECE Graduate Studies Chair [email protected] 1.
A Cross-Layer Multihop Data Delivery Protocol With Fairness Guarantees for Vehicular Networks Gokhan...
-
Upload
nora-patterson -
Category
Documents
-
view
214 -
download
0
description
Transcript of A Cross-Layer Multihop Data Delivery Protocol With Fairness Guarantees for Vehicular Networks Gokhan...
A Cross-Layer Multihop Data Delivery Protocol With Fairness Guarantees for
Vehicular Networks
Gokhan Korkmaz, Eylem Ekici, and Fusun OzgunerDepartment of Electrical and Computer Engineering, Ohio State University
IEEE TRANSACTIONS ON VEHICULAR TECHNOLOGY, TVT 2006
Outline
• Introduction• Controlled Vehicular Internet Access (CVIA)• Simulation• Conclusion
Introduction• As mobile wireless devices became the essential parts of our lives,
“anytime, anywhere” connectivity gains a growing importance.
• Inasmuch as an average user spends hours in the traffic everyday, Internet access from vehicles is in great demand.
Introduction• DSRC(Dedicated Short Range Communication) is one of the
ITS(Intelligent Transport System) standards that allows high-speed communications between vehicles and the roadside, or between vehicles.
• DSRC systems use the IEEE 802.11 protocol as their MAC layer.
• Multihopping with the IEEE 802.11 protocol suffers from several problems, leading to low throughput and starvation of packets originating from vehicles far away from gateways.
2R2R2R
Goal
• To increase the end-to-end throughput.
• Achieving fairness in bandwidth usage between vehicles.
• Mitigating the hidden node problem .
• Avoiding contention.
Network Assumption• Vehicular network that accesses the Internet through fixed IGWs
(Internet gateways) along the road.
• Gateways send periodic service announcements to indicate the availability of the service in their service area.
• The uplink and the downlink packets are transmitted over two frequency-separated channels.
Network Assumption• Vehicles are equipped with GPS devices used for time synchronization
and obtaining vehicle positions.
• Vehicle positions obtained via GPS are exchanged among one-hop neighbors.
Basic Idea• Divides the time into slots and the service area of the gateway into
segments.
• Controls time slots the vehicles are allowed to transmit in, how the vehicles access the channel, and to which vehicles the packets are sent.
CVIA-Overview
S6 S5 S4 S3 S2 S1
Segment Length=R
VTR (Virtual Transmission Radius)
VTR length N=5
Slot1 Slot2 Slot3 Slot4 Slot5 Slot6 Slot7 time
Slot Length=Tslot
S6 S5 S4 S3 S2 S1
CVIA-Overview
Si + : The neighboring segment in the same direction of the packet dissemination.
Si - : The neighboring segment in the opposite direction of the packet dissemination.
S6 S5 S4 S3 S2 S1
the direction of packet dissemination
Si Si +Si -
CVIA-Overview
𝑟 = interference range𝑅 ඈ+ 1 Interference parameter (r) :S6 S5 S4 S3 S2 S1
Segment Length=R
interference range𝑅 ≤ 1 ⟹ 𝑟 = 2
1 < interference range𝑅 ≤ 2 ⟹ 𝑟= 3
CVIA-Overview
Active segment : Si is active in TSj if (i mod r)=(j mod r)
For example, r=2when the current time slot is T5 , the segments S1, S3, and S5 become active.
S6 S5 S4 S3 S2 S1
when the current time slot is T6 , the segments S2, S4, and S6 become active.
𝑟 = interference range𝑅 ඈ+ 1 Interference parameter (r) :
Si - Si Si +
CVIA-Overview
S6 S5 S4 S3 S2 S1
Inbound temporary router ( ) : The vehicle closet to Si - . All packets entering a segment go through .
Outbound temporary router ( ) : The vehicle closet to Si + . All packets leaving the segment go through .
TR𝑖out
TR𝑖in TR𝑖in
TR𝑖out
TR𝑖out TR𝑖in TR𝑖+in TR𝑖−out
S6 S5 S4 S3 S2 S1
CVIA-Overview
Si - Si Si +
1. deliver packet train to . TR𝑖out TR𝑖in
TR𝑖out TR𝑖in TR𝑖−out TR𝑖+in
the direction of packet dissemination
2. gather local packets.TR𝑖out
3. move out packet train to .TR𝑖out TR𝑖+in
CVIA-State diagram
New active slot
tu
Routers are selected
End of packet train
End of active slot
tg
CVIA
CVIA - Inactive
Vehicles in inactive segments do not access the channel.
Si is active in TSj if (i mod r)=(j mod r)
i = , ∆d : The distance of the vehicle to the gateway.
j = , ∆t : The time passed since an absolute reference point.
Vehicles obtain their positions and synchronize their clocks using GPS.
Vehicles learn the positions of gateways from a digital road map database or the service announcement packets broadcast periodically by gateways.
∆𝑑𝑅ඈ
∆𝑡𝑇slotඈ
S5 S4 S3 S2 S1
Δd
R
CVIA
CVIA - Vehicle Position Update Phase
tu : A time interval reserved for position update packets (PUPs).tPUP : The duration of a PUP.
Vehicles pick a random waiting time (RWT) from [0,tu-tPUP).After an RWT, vehicles access the channel using DCF method of the IEEE 802.11 protocol.The length of a PUP is short, RTS/CTS handshake is not used before sending PUP.
Si - Si Si +
TR𝑖out TR𝑖in
CVIA
CVIA - Temporary Router Selection Phase
New and are selected by .
The selected routers are called and until they become active.
Use “router lifetime” and “safe area” concept.
TR𝑖out TR𝑖in TR𝑖in TR𝑖,nextout TR𝑖,nextin
Si - Si Si +
TR𝑖out TR𝑖in TR𝑖,nextout
TR𝑖,nextin TR𝑖out TR𝑖in
CVIA - Temporary Router Selection Phase
Temporary router must stay inside the segment for an amount of time called the router lifetime.
When and are selected at the beginning of TSj .TR𝑖,nextout TR𝑖,nextin
Si - Si Si +TR𝑖in
TR𝑖out TR𝑖+in TR𝑖−out
is responsible for
1. Receiving packet train relayed by .
2. Gathering local packets.
3. Creating a new packet train and sending this train out of Si to .
TR𝑖out TR𝑖in
TR𝑖+in
CVIA - Temporary Router Selection Phase
Temporary router must stay inside the segment for an amount of time called the router lifetime.
When and are selected at the beginning of TSj .
is responsible for
1. Receiving packet train relayed by .
2. Gathering local packets.
3. Creating a new packet train and sending this train out of Si to .
becomes active immediately and stays active until the end of TSj .
TR𝑖,nextout TR𝑖,nextin TR𝑖out TR𝑖in
TR𝑖out
TR𝑖+in
Slotj Slotj+1 Slotj+2 … Slotj+r time
…
lifetime of is TslotTR𝑖out
CVIA - Temporary Router Selection Phase
Temporary router must stay inside the segment for an amount of time called the router lifetime.
When and are selected at the beginning of TSj .
is responsible for
1. Receiving packet train coming from in TSj+1.
2. Selecting and announcing and at the beginning of TSj+r .
3. Relaying the packet train to in TSj+r .
TR𝑖,nextout TR𝑖,nextin TR𝑖in
TR𝑖,nextout TR𝑖,nextin TR𝑖out
TR𝑖−out
Si - Si Si +TR𝑖in
TR𝑖out TR𝑖+in TR𝑖−out
CVIA - Temporary Router Selection Phase
Temporary router must stay inside the segment for an amount of time called the router lifetime.
When and are selected at the beginning of TSj .
is responsible for
1. Receiving packet train coming from in TSj+1.
2. Selecting and announcing and at the beginning of TSj+r .
3. Relaying the packet train to in TSj+r .
becomes active throughout TSj+1 and TSj+r .
TR𝑖,nextout TR𝑖,nextin TR𝑖in
TR𝑖,nextin
TR𝑖,nextout TR𝑖,nextin TR𝑖out
TR𝑖−out
Slotj Slotj+1 Slotj+2 … Slotj+r time
…
lifetime of is (r+1)TslotTR𝑖in
CVIA - Temporary Router Selection Phase
Temporary router must be away from the segment border for a certain amount of distance (xmargin) to stay inside to stay inside the segment during the router lifetime.
xmargin +: measured from the segment borders associated with (lifetime=1∙Tslot) .
xmargin -: measured from the segment borders associated with (lifetime=(r+1)∙Tslot).
TR𝑖out TR𝑖in
xmargin + ,v = (∆tpu,v + 1∙Tslot)∙Vmax
xmargin - ,v = (∆tpu,v + (r+1) ∙Tslot)∙Vmax
∆tpu,v : The elapsed time since the last powsition update from vehicle v.
CVIA - Temporary Router Selection Phase
Si - Si Si +
If vehicle v’s distance to segment borders is more than xmargin + ,v , the vehicle can safely be selected as .
If vehicle v’s distance to segment borders is more than xmargin - ,v , the vehicle can safely be selected as .
TR𝑖,nextout TR𝑖,nextin
Distance to segment borderxmargin + ,v xmargin - ,v v1
v2
Among the vehicles inside the safe area, selects
the vehicle closest to Si + as and
the vehicle closest to Si - as
TR𝑖,nextout TR𝑖,nextin
TR𝑖in
TR𝑖,nextout
TR𝑖,nextin v1
v1,v2
TR𝑖,nextout TR𝑖,nextin
CVIA
CVIA - Intra-segment Packet Train Movement Phase
delivering the packet train coming from Si - to .
To avoid contention, has the highest access priority and waits only SIFS duration before accessing the channel.
TR𝑖out TR𝑖in
TR𝑖in
Si - Si Si +TR𝑖in
TR𝑖out TR𝑖+in TR𝑖−out
CVIA
CVIA - Local Packet Gathering Phase
Si - Si Si +
TR𝑖out TR𝑖+in TR𝑖−out
Vehicles directly send their packets to .
Each vehicle starts this phase with a random backoff counter.
has the highest channel access priority in this phase.
TR𝑖out
TR𝑖out
CVIA - Local Packet Gathering Phase
accesses the channel and ends the LPG phase in 2 cases :1.When the total number of packets queued up in reaches .
2.When the time left in the active slot is just enough to move out all packets in the queues.
TR𝑖out TR𝑖out ൬CN൰ሺN− i + 1ሻ
Si - Si Si +TR𝑖+in
TR𝑖−out TR𝑖out
S5 S4 S3 S2 S1
100 packets
20 packets20 packets20 packets20 packets20 packets 100 packets80 packets60 packets40 packets20 packets
CVIA
CVIA - Inter-segment Packet Train Movement Phase
Si - Si Si +
TR𝑖out TR𝑖+in TR𝑖−out
forms a packet train and moved to before the end of TSj .
There is only one in Si + , does not need to specify the vehicle ID of the destination in the data train.
TR𝑖out TR𝑖+in TR𝑖+in TR𝑖out
CVIA
CVIA-State diagram-Download
CVIA-State diagram-Download
CVIA-State diagram-Download
CVIA - Download Local Packet Distriburion and Intra-segment Packet Train Movement Phase
delivering the packet train coming from Si - to .
Some packets leave the train, and a shorter train keeps moving away from the gateway.
TR𝑖out TR𝑖in
Si - Si Si +TR𝑖in
TR𝑖out TR𝑖+in TR𝑖−out
Performance EvaluationSimulation scenarios
Density 34 vehicles/km
Speed 90 ±5 km/h (do not change during simulation)
Transmission range 350 m
Data rate 27 Mbps
Payload 2312 or 500 bytes
Base protocol 802.11a
Interference range to transmission range ratio 1
Maximum number of packet retrials 10
Simulation time 10 s
Simulation repetitions 20
Performance Evaluation
Scenario payload VTRI 2304 bytes 4R (N=4)
II 500 bytes 4R (N=4)
III 2304 bytes 8R (N=8)
CVIA parametersTslot 100 ms
N 4 or 8
r 2
Performance EvaluationScenario I
Throughput Detailed segment throughputs
Performance EvaluationScenario II
Throughput Detailed segment throughputs
Performance EvaluationFairness
Fairness Index (FI) =
Thri : the throughput of segment i
ሺσ Thr𝑖𝑁𝑖=1 ሻ2𝑁∙σ Thr𝑖2𝑁𝑖=1
Performance EvaluationFailed packets
In LPG phase, the contention-based channel access is used.
Probability of packet collision ≈ 0.3
Probability of packet dropping ≈ 0.310
≈ 5×10-6
Conclusion• Mitigates the hidden node problem.
• Avoids contention while moving packets among road segments.
• Provides fairness among segments by controlling the contents of the packet trains.
• Unnecessary RTS/CTS overhead while moving packets among road segments.
• The throughput gain obtained using the proposed CVIA protocol is higher for short payload scenario.