270 likes | 765 Vues
VANET-DSRC Protocol for Reliable Broadcasting of Life Safety Messages. Mostafa M. I. Taha Electrical Engineering Dept., Assiut University, Arab Republic of Egypt. IEEE ISSPIT 2007. Reliable Broadcasting of Life Safety Messages. Outline : Introduction to VANET technology
E N D
VANET-DSRC Protocol for Reliable Broadcasting of Life Safety Messages Mostafa M. I. TahaElectrical Engineering Dept., Assiut University, Arab Republic of Egypt IEEE ISSPIT 2007
Reliable Broadcasting of Life Safety Messages • Outline: • Introduction to VANET technology • Categories of broadcasting protocols • Proposed protocol • Conclusion
Internet RSU OBU What is a VANET? VANET: Vehicular Ad-Hoc Network (VANET) DSRC: Dedicated Short Range Communications
Why VANET? • Increase traveler safety • Decrease traveling time and fuel consumption • Increase on board luxury
VANET Applications • Public Safety • Co-operative Collision warning [V-V] • Intersection Collision Warning • Approaching Emergency Vehicle • Work Zone Warning [R-V] The main categorized applications of VANETs are • Non-Public Safety • Electronic Toll Collection • Data Transfer • Parking Lot Payment • Traffic Information
VANET characteristics • High mobility nodes • Predictable topology (using digital map) • Critical latency requirements • Slow migration rate • No problem with power • Security and privacy The main characteristics of VANETs
VANET challenging problems • Broadcasting: • should be reliable with very low latency. • Routing: • High mobile Ad-Hoc network • Security: • Anonymity to prevent car tracking. • Authenticity to prevent false alarms • Integrity to prevent hacking • Accountability to ensure punishment for bad actions
Broadcasting in VANETs • Requirements: • Reliability • Minimum collisions • Minimum latency • High dissemination speed • Problems: • No prior control messaging • High mobility • Hidden terminal problem • Different traffic volumes • Different environments (Urban or rural)
Categories of Broadcasting Protocols • Dissemination protocols, a coordination between nodes to have a broadcast that covers all nodes in the message propagation direction Problems: Multi-hop without any control messaging Metrics: Receipt rate, Dissemination speed and Redundancy
Categories of Broadcasting Protocols • Minimum Connected Dominating Set: is the minimum set of connected nodes that, every other node in the network is one–hop connected with a node in this set. MCDS gives theoretical optimal performance
Categories of Broadcasting Protocols • Flooding: it is each node responsibility to determine if it will rebroadcast the message. • Single relay: it is the source node responsibility to determine the next hop
Categories of Broadcasting Protocols • Reliable protocols, a single source trials to cover a single communication range with highest possible reliability Problems: No feedback Metrics: Receipt rate, Latency, and Collision rate
Categories of Broadcasting Protocols • Rebroadcast: where the source node retransmits the same message for many times • Selective ACK: where the source node requires ACK from small set of the neighbors
Why not IEEE 802.11 • Not reliable • CSAM/CA • Hidden terminal problem • Static contention window size (CW)
The Proposed Protocol • Main Ideas • Application adaptive • Time-based segmentation • Non-equal segments • Headway Model • Methodology • A RTB/CTB with node using adaptive segmentation algorithm
Headway Model Headway Time Headway Semi-Poisson Headway Model
P3 P1 P2 Time-based segmentation • Divide range into N adjacent and non-overlapping segment of non-equal lengths • Lengths are in Headway second • Monotonically increasing (Traffic concept)
P3 P1 P2 S3 S1 S2 P3 P1 P2 S1 S3 S2 P1 P3 P2 S3 S1 S2 Modes of Operation
Proposed Algorithm • Algorithm Steps • Actions of Source Node • Actions of Other Nodes
Proposed Algorithm • Actions of Source Node start Send RTB yes no Received CTB within SIFS+(N+1)Ts? Again? yes no Continue session end
Set DIFS= SIFS+(N+2)TS Check mode no Is a following Vehicle yes Find segment number Si Received CRB within SIFS+(i-1)Ts? yes no Send CTB Continue session start end Proposed Algorithm • Actions of Other Nodes
DIFS RTB Source DATA SIFS SIFS SIFS Destination CTB ACK Simulation methodology 1- Contention starting time = DIFS + RTB 2- Success broadcast time = SIFS + CTB + SIFS + DATA + SIFS + ACK 3- Collision time = DIFS + RTB + SIFS + CTB 4- Waiting time = a single time slot Delay sources
Simulation Results • Points of segmentation for minimum collision probability in different number of segments for Mode I
3-seg 4-seg 5-seg 6-seg 7-seg UMB SB Simulation Results Latency (usec) Distance (sec)
Discussion • Broadcasting beyond single transmission range. • Hidden terminal problem at far range nodes. • Superior of the time-based segmentation. • The use of RTB/CTB instead of the message directly
Conclusion • A new broadcasting protocol with these novel features: • Application adaptive with special care for public safety and emergency applications • Time-based segmentation • Include effects of human behaviors (headway model) • non-equal segmentation for best performance
Q&A Thank you Questions?