Cluster-Based Multi-Channel Communications Protocols in Vehicle Ad Hoc Networks

07/25/11

IEEE Wireless Communications october2006, vol.13 No. 5

Outline
07/25/11

INTRODUCTION SYSTEM ARCHITECTURE FUNCTIONS AND DESIGNS OF PROTOCOLS THE CLUSTER CONFIGURATION PROTOCOL THE INTRACLUSTER COORDINATION AND COMMUNICATION PROTOCOL SIMULATION EVALUATIONS CONCLUSIONS

INTRODUCTION(1/2)
07/25/11

What is DSRC(Dedicated Short Range Communication)? V2V-based VANETs and V2R-based VANETs. The data transmitted over the VANETs can be classified into the real-time traffic and the non-real-time traffic.

DSRC
07/25/11

DSRC/802.11p
The

standard of 802.11p is based on IEEE 802.11a PHY layer and IEEE 802.11 MAC layer
Seven 10 MHz channels at 5.9GHz one control channel and six service channels

Vehicle to vehicle

Service channel

Service channel

Control channel

Optionally combined service channels

Intersection

CH 172 5.855 5.865

CH 174 5.875

CH 176 5.885

CH 178 5.895

CH 180 5.905

CH 182 5.915

CH 184 5.925

Frequency (GHz)

V2V-BASED VANETS AND V2R-BASED VANETS

07/25/11

THE DATA TRANSMITTED OVER THE VANETS

07/25/11

real-time
such

traffic

as safety messages and video/audio signals

non-real-time
such

traffic

as e-maps and road/vehicletraffic/weather information

INTRODUCTION(2/2)
07/25/11

Our proposed scheme mainly consists of following three core protocols.

Cluster

Configuration Protocol Intracluster Coordination and Communication Protocol Intercluster Communication Protocol

SYSTEM ARCHITECTURE
07/25/11

Four
1. 2. 3. 4.

Broadcasting Strategies

Probability-based Location-based Neighbor-based Cluster-based

FOUR BROADCASTING STRATEGIES

07/25/11

1.

Probability-based:

given PDF determines the decision, for example depending on the number of copies a node has received. The strategy is often dynamic.
PDF

= probability distribution function

PROBABILITY-BASED
07/25/11

C A ar PD = 0.8 F

C B ar PD = 0.5 F
F arding N choose orw ode

10

FOUR BROADCASTING STRATEGIES

07/25/11

Location-based
The

selection criterion is the amount of additional area that would be covered by enabling a node to forward. Some proposal also computes position prediction as useful input information.

11

LOCATION-BASED
07/25/11

Target Car A

Car B wants to turn right

Forwarding Node choose

12

FOUR BROADCASTING STRATEGIES

07/25/11

Neighbor-based
A

node is selected depending on its neighbors status (for instance, the status concerns how a neighbor is connected to the network).

13

NEIGHBOR-BASED
07/25/11
Target

Collect

Car A the inform ation of

neighbors

Car B

Forwarding N choose ode

14

FOUR BROADCASTING STRATEGIES

07/25/11

Cluster-based
Nodes

are grouped in clusters represented by an elected cluster-head. Only clusterheads forward packets. Nodes in the same cluster share some features (e.g., relative speed in VANETs). Reclustering on-demand or periodically.

15

CLUSTER-BASED
07/25/11

C luster -H eader G atew ay -N ode

C luster -H eader

Forw arding N choose ode

16

SYSTEM ARCHITECTURE
07/25/11

17

SYSTEM ARCHITECTURE
07/25/11

Our

proposed scheme handles the following three tasks

Cluster-membership

management Real-time traffic (such as safety messages delivery) Non-real-time data communications (such as e-maps download, movies download, etc.)
18

SYSTEM ARCHITECTURE
07/25/11

19

 ( FINITE STATE MACHINE, FSM)

07/25/11

20

FUNCTIONS AND DESIGNS OF PROTOCOLS

07/25/11

We

use the Finite State Machine (FSM) Each vehicle operates under one and only one of the following four states at any given time:
cluster-head

(CH) quasi-cluster-head (QCH) cluster-member (CM) quasi-cluster-member (QCM)

21

FUNCTIONS AND DESIGNS OF PROTOCOLS

07/25/11

Finite state machine of our proposed scheme. T1 and T2 represent Transceiver 1 and Transceiver 2

22

THE INTRACLUSTER COORDINATION AND COMMUNICATION PROTOCOL

07/25/11

Time division in the CRC channel

23

THE INTRACLUSTER COORDINATION AND COMMUNICATION PROTOCOL

07/25/11

Tt = N = gap = v = Lc = Nlane =
24

THE INTRACLUSTER COORDINATION AND COMMUNICATION PROTOCOL

07/25/11

T = repetition period( 200ms) R = channel rate Tsafety = Hsafety = packet size 200bytes

25

SIMULATION EVALUATIONS
07/25/11

3 2100

180 35m/s 15m2 / s2

26

SIMULATION EVALUATIONS
07/25/11

Matlab 25m 5m 150m 400ms 150ms 50ms 200bytes

27

SIMULATION EVALUATIONS
07/25/11

The performance of three protocols against non-realtime traffic arrival rate: a) Probability of safetymessage-delivery failure; and b) aggregate throughput of non-real-time traffics. The size of the non-real-time traffic packet is 512 bytes.

28

SIMULATION EVALUATIONS
07/25/11

Channel busy rates of the seven different channels. The size of the non-real-time traffic packet is 512 bytes and the packet arrival rate of the non real-time traffic is 200packets/sec/vehicle.

29

CONCLUSIONS
07/25/11

Reduce data-congestion Support QoS for real-time delivery of safety messages High throughput

30