TY - GEN
T1 - Efficient certificate distribution for vehicle heartbeat messages
AU - Blum, Jeremy J.
AU - Tararakin, Alexey
AU - Eskandarian, Azim
PY - 2008
Y1 - 2008
N2 - Vehicle heartbeat messages will enable a wide range of safety and efficiency applications. These messages, containing the position, kinematics, and state of a vehicle, will be sent over a wireless network to nearby vehicles at a high frequency. These messages will include a digital signature and a public key certificate to allow message recipients to validate the contents of a message. To minimize on the overhead, standards governing this network allow for the transmission of short certificate IDs instead of the full certificate. This paper proposes two distributed Certificate ID Scheduling algorithms, one in which a certificate is sent every nth message and another in which vehicles send full certificates only when a new neighbor is detected. Privacy considerations for certificate ID scheduling are analyzed, and the effectiveness of the protocols is evaluated through simulation of these heart-beat messages in a highway environment. These simulations show the first algorithm is most appropriate for high density, two-way traffic while the second algorithm can produce bandwidth savings that are close to the maximum for one-way or low density traffic.
AB - Vehicle heartbeat messages will enable a wide range of safety and efficiency applications. These messages, containing the position, kinematics, and state of a vehicle, will be sent over a wireless network to nearby vehicles at a high frequency. These messages will include a digital signature and a public key certificate to allow message recipients to validate the contents of a message. To minimize on the overhead, standards governing this network allow for the transmission of short certificate IDs instead of the full certificate. This paper proposes two distributed Certificate ID Scheduling algorithms, one in which a certificate is sent every nth message and another in which vehicles send full certificates only when a new neighbor is detected. Privacy considerations for certificate ID scheduling are analyzed, and the effectiveness of the protocols is evaluated through simulation of these heart-beat messages in a highway environment. These simulations show the first algorithm is most appropriate for high density, two-way traffic while the second algorithm can produce bandwidth savings that are close to the maximum for one-way or low density traffic.
UR - http://www.scopus.com/inward/record.url?scp=58149125058&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=58149125058&partnerID=8YFLogxK
U2 - 10.1109/VETECF.2008.453
DO - 10.1109/VETECF.2008.453
M3 - Conference contribution
AN - SCOPUS:58149125058
SN - 9781424417223
T3 - IEEE Vehicular Technology Conference
BT - The 68th IEEE Vehicular Technology Conference, VTC 2008-Fall
T2 - 68th Semi-Annual IEEE Vehicular Technology, VTC 2008-Fall, Conference
Y2 - 21 September 2008 through 24 September 2008
ER -