The Experts below are selected from a list of 41382 Experts worldwide ranked by ideXlab platform

Tovar Eduardo - One of the best experts on this subject based on the ideXlab platform.

  • Design and Implementation of Secret Key Agreement for Platoon-based Vehicular Cyber-physical Systems
    'Association for Computing Machinery (ACM)', 2120
    Co-Authors: Li Kai, Ni Wei, Emami Yousef, Shen Yiran, Severino Ricardo, Pereira David, Tovar Eduardo
    Abstract:

    In a platoon-based vehicular cyber-physical system (PVCPS), a Lead Vehicle that is responsible for managing the platoon’s moving directions and velocity periodically disseminates control messages to the Vehicles that follow. Securing wireless transmissions of the messages between the Vehicles is critical for privacy and confidentiality of the platoon’s driving pattern. However, due to the broadcast nature of radio channels, the transmissions are vulnerable to eavesdropping. In this article, we propose a cooperative secret key agreement (CoopKey) scheme for encrypting/decrypting the control messages, where the Vehicles in PVCPS generate a unified secret key based on the quantized fading channel randomness. Channel quantization intervals are optimized by dynamic programming to minimize the mismatch of keys. A platooning testbed is built with autonomous robotic Vehicles, where a TelosB wireless node is used for onboard data processing and multihop dissemination. Extensive real-world experiments demonstrate that CoopKey achieves significantly low secret bit mismatch rate in a variety of settings. Moreover, the standard NIST test suite is employed to verify randomness of the generated keys, where the p-values of our CoopKey pass all the randomness tests. We also evaluate CoopKey with an extended platoon size via simulations to investigate the effect of system scalability on performance.info:eu-repo/semantics/publishedVersio

  • Optimal Rate-Adaptive Data Dissemination in Vehicular Platoons
    'Institute of Electrical and Electronics Engineers (IEEE)', 2119
    Co-Authors: Li Kai, Ni Wei, Tovar Eduardo, Guizani Mohsen
    Abstract:

    In intelligent transportation systems, wireless connected Vehicles moving in platoons can improve roads’ throughput. For managing driving status of the platoon, a Lead Vehicle transmits driving information to following autonomous Vehicles by using multi-hop data dissemination. We study a novel data dissemination protocol which investigates a chain-based transmit rate control to reduce data dissemination latency. The optimal resource allocation algorithm is formulated to minimize the total dissemination latency of the platoon under guaranteed bit error rates, and can be judiciously reformulated and solved using standard optimization techniques. A novel dynamic programming algorithm is presented to solve the platooning resource allocation optimization, which uses backward induction to significantly reduce the resource allocation complexity. In addition, we interpret the vehicular platoon as one-dimensional Markov chain, and derive a closed form of dissemination latency. Simulations are carried out to evaluate the performance of the proposed dynamic programming algorithm. The numerical results show that our algorithm achieves optimal solutions with cutting off the complexity by orders of magnitude, while improving dissemination rate in the vehicular platoon.info:eu-repo/semantics/publishedVersio

  • Secret Key Agreement for Data Dissemination in Vehicular Platoons
    'Institute of Electrical and Electronics Engineers (IEEE)', 2119
    Co-Authors: Li Kai, Ni Wei, Tovar Eduardo, Lu Lingyun, Guizani Mohsen
    Abstract:

    In a vehicular platoon, the Lead Vehicle that is responsible for managing the platoon’s moving directions and velocity periodically disseminates messages to the following automated Vehicles in a multi-hop vehicular network. However, due to the broadcast nature of wireless channels, this kind of communication is vulnerable to eavesdropping and message modification. Generating secret keys by extracting the shared randomness in a wireless fading channel is a promising way for wireless communication security. We study a security protocol for data dissemination in the platoon, where the Vehicles cooperatively generate a shared secret key based on the quantized fading channel randomness. To improve conformity of the generated key, the probability of secret key agreement is formulated, and a novel secret key agreement algorithm is proposed to recursively optimize the channel quantization intervals, maximizing the key agreement probability. Numerical evaluations demonstrate that the key agreement probability achieved by our security protocol given different platoon size, channel quality, and number of quantization intervals. Furthermore, by applying our security protocol, the probability that the encrypted data being cracked by an eavesdropper is less than 5%.info:eu-repo/semantics/publishedVersio

  • Cooperative Secret Key Generation for Platoon-Based Vehicular Communications
    'Institute of Electrical and Electronics Engineers (IEEE)', 2119
    Co-Authors: Li Kai, Ni Wei, Tovar Eduardo, Lu Lingyun, Guizani Mohsen
    Abstract:

    In a vehicular platoon, the Lead Vehicle that is responsible for managing the platoon's moving directions and velocity periodically disseminates messages to the following automated Vehicles in a multi-hop vehicular network. However, due to the broadcast nature of wireless channels, Vehicle-to-Vehicle (V2V) communications are vulnerable to eavesdropping and message modification. Generating secret keys by extracting the shared randomness in a wireless fading channel is a promising way for V2V communication security. We study a security scheme for platoon-based V2V communications, where the platooning Vehicles generate a shared secret key based on the quantized fading channel randomness. To improve conformity of the generated key, the probability of secret key agreement is formulated, and a novel secret key agreement algorithm is proposed to recursively optimize the channel quantization intervals, maximizing the key agreement probability. Numerical evaluations demonstrate that the key agreement probability achieved by our security protocol given different platoon size, channel quality, and number of quantization intervals. Furthermore, by applying our security protocol, it is shown that the probability that the encrypted data being cracked by an eavesdropper is less than 5%.info:eu-repo/semantics/publishedVersio

  • LCD: Low Latency Command Dissemination for A Platoon of Vehicles
    'Institute of Electrical and Electronics Engineers (IEEE)', 2119
    Co-Authors: Li Kai, Tovar Eduardo, Guizani Mohsen
    Abstract:

    —In a vehicular platoon, a Lead Vehicle that is responsible for managing the platoon’s moving directions and velocity periodically disseminates control commands to following Vehicles based on Vehicle-to-Vehicle communications. However, reducing command dissemination latency with multiple Vehicles while ensuring successful message delivery to the tail Vehicle is challenging. We propose a new linear dynamic programming algorithm using backward induction and interchange arguments to minimize the dissemination latency of the Vehicles. Furthermore, a closed form of dissemination latency in vehicular platoon is obtained by utilizing Markov chain with M/M/1 queuing model. Simulation results confirm that the proposed dynamic programming algorithm improves the dissemination rate by at least 50.9%, compared to similar algorithms in the literature. Moreover, it also approximates the best performance with the maximum gap of up to 0.2 second in terms of latency.info:eu-repo/semantics/publishedVersio

Li Kai - One of the best experts on this subject based on the ideXlab platform.

  • Design and Implementation of Secret Key Agreement for Platoon-based Vehicular Cyber-physical Systems
    'Association for Computing Machinery (ACM)', 2120
    Co-Authors: Li Kai, Ni Wei, Emami Yousef, Shen Yiran, Severino Ricardo, Pereira David, Tovar Eduardo
    Abstract:

    In a platoon-based vehicular cyber-physical system (PVCPS), a Lead Vehicle that is responsible for managing the platoon’s moving directions and velocity periodically disseminates control messages to the Vehicles that follow. Securing wireless transmissions of the messages between the Vehicles is critical for privacy and confidentiality of the platoon’s driving pattern. However, due to the broadcast nature of radio channels, the transmissions are vulnerable to eavesdropping. In this article, we propose a cooperative secret key agreement (CoopKey) scheme for encrypting/decrypting the control messages, where the Vehicles in PVCPS generate a unified secret key based on the quantized fading channel randomness. Channel quantization intervals are optimized by dynamic programming to minimize the mismatch of keys. A platooning testbed is built with autonomous robotic Vehicles, where a TelosB wireless node is used for onboard data processing and multihop dissemination. Extensive real-world experiments demonstrate that CoopKey achieves significantly low secret bit mismatch rate in a variety of settings. Moreover, the standard NIST test suite is employed to verify randomness of the generated keys, where the p-values of our CoopKey pass all the randomness tests. We also evaluate CoopKey with an extended platoon size via simulations to investigate the effect of system scalability on performance.info:eu-repo/semantics/publishedVersio

  • Optimal Rate-Adaptive Data Dissemination in Vehicular Platoons
    'Institute of Electrical and Electronics Engineers (IEEE)', 2119
    Co-Authors: Li Kai, Ni Wei, Tovar Eduardo, Guizani Mohsen
    Abstract:

    In intelligent transportation systems, wireless connected Vehicles moving in platoons can improve roads’ throughput. For managing driving status of the platoon, a Lead Vehicle transmits driving information to following autonomous Vehicles by using multi-hop data dissemination. We study a novel data dissemination protocol which investigates a chain-based transmit rate control to reduce data dissemination latency. The optimal resource allocation algorithm is formulated to minimize the total dissemination latency of the platoon under guaranteed bit error rates, and can be judiciously reformulated and solved using standard optimization techniques. A novel dynamic programming algorithm is presented to solve the platooning resource allocation optimization, which uses backward induction to significantly reduce the resource allocation complexity. In addition, we interpret the vehicular platoon as one-dimensional Markov chain, and derive a closed form of dissemination latency. Simulations are carried out to evaluate the performance of the proposed dynamic programming algorithm. The numerical results show that our algorithm achieves optimal solutions with cutting off the complexity by orders of magnitude, while improving dissemination rate in the vehicular platoon.info:eu-repo/semantics/publishedVersio

  • Secret Key Agreement for Data Dissemination in Vehicular Platoons
    'Institute of Electrical and Electronics Engineers (IEEE)', 2119
    Co-Authors: Li Kai, Ni Wei, Tovar Eduardo, Lu Lingyun, Guizani Mohsen
    Abstract:

    In a vehicular platoon, the Lead Vehicle that is responsible for managing the platoon’s moving directions and velocity periodically disseminates messages to the following automated Vehicles in a multi-hop vehicular network. However, due to the broadcast nature of wireless channels, this kind of communication is vulnerable to eavesdropping and message modification. Generating secret keys by extracting the shared randomness in a wireless fading channel is a promising way for wireless communication security. We study a security protocol for data dissemination in the platoon, where the Vehicles cooperatively generate a shared secret key based on the quantized fading channel randomness. To improve conformity of the generated key, the probability of secret key agreement is formulated, and a novel secret key agreement algorithm is proposed to recursively optimize the channel quantization intervals, maximizing the key agreement probability. Numerical evaluations demonstrate that the key agreement probability achieved by our security protocol given different platoon size, channel quality, and number of quantization intervals. Furthermore, by applying our security protocol, the probability that the encrypted data being cracked by an eavesdropper is less than 5%.info:eu-repo/semantics/publishedVersio

  • Cooperative Secret Key Generation for Platoon-Based Vehicular Communications
    'Institute of Electrical and Electronics Engineers (IEEE)', 2119
    Co-Authors: Li Kai, Ni Wei, Tovar Eduardo, Lu Lingyun, Guizani Mohsen
    Abstract:

    In a vehicular platoon, the Lead Vehicle that is responsible for managing the platoon's moving directions and velocity periodically disseminates messages to the following automated Vehicles in a multi-hop vehicular network. However, due to the broadcast nature of wireless channels, Vehicle-to-Vehicle (V2V) communications are vulnerable to eavesdropping and message modification. Generating secret keys by extracting the shared randomness in a wireless fading channel is a promising way for V2V communication security. We study a security scheme for platoon-based V2V communications, where the platooning Vehicles generate a shared secret key based on the quantized fading channel randomness. To improve conformity of the generated key, the probability of secret key agreement is formulated, and a novel secret key agreement algorithm is proposed to recursively optimize the channel quantization intervals, maximizing the key agreement probability. Numerical evaluations demonstrate that the key agreement probability achieved by our security protocol given different platoon size, channel quality, and number of quantization intervals. Furthermore, by applying our security protocol, it is shown that the probability that the encrypted data being cracked by an eavesdropper is less than 5%.info:eu-repo/semantics/publishedVersio

  • LCD: Low Latency Command Dissemination for A Platoon of Vehicles
    'Institute of Electrical and Electronics Engineers (IEEE)', 2119
    Co-Authors: Li Kai, Tovar Eduardo, Guizani Mohsen
    Abstract:

    —In a vehicular platoon, a Lead Vehicle that is responsible for managing the platoon’s moving directions and velocity periodically disseminates control commands to following Vehicles based on Vehicle-to-Vehicle communications. However, reducing command dissemination latency with multiple Vehicles while ensuring successful message delivery to the tail Vehicle is challenging. We propose a new linear dynamic programming algorithm using backward induction and interchange arguments to minimize the dissemination latency of the Vehicles. Furthermore, a closed form of dissemination latency in vehicular platoon is obtained by utilizing Markov chain with M/M/1 queuing model. Simulation results confirm that the proposed dynamic programming algorithm improves the dissemination rate by at least 50.9%, compared to similar algorithms in the literature. Moreover, it also approximates the best performance with the maximum gap of up to 0.2 second in terms of latency.info:eu-repo/semantics/publishedVersio

Jinxian Weng - One of the best experts on this subject based on the ideXlab platform.

  • time varying mixed logit model for Vehicle merging behavior in work zone merging areas
    Accident Analysis & Prevention, 2018
    Co-Authors: Jinxian Weng, Gang Du, Dan Li, Yao Yu
    Abstract:

    Abstract This study aims to develop a time-varying mixed logit model for the Vehicle merging behavior in work zone merging areas during the merging implementation period from the time of starting a merging maneuver to that of completing the maneuver. From the safety perspective, Vehicle crash probability and severity between the merging Vehicle and its surrounding Vehicles are regarded as major factors influencing Vehicle merging decisions. Model results show that the model with the use of Vehicle crash risk probability and severity could provide higher prediction accuracy than previous models with the use of Vehicle speeds and gap sizes. It is found that Lead Vehicle type, through Lead Vehicle type, through lag Vehicle type, crash probability of the merging Vehicle with respect to the through lag Vehicle, crash severities of the merging Vehicle with respect to the through Lead and lag Vehicles could exhibit time-varying effects on the merging behavior. One important finding is that the merging Vehicle could become more and more aggressive in order to complete the merging maneuver as quickly as possible over the elapsed time, even if it has high Vehicle crash risk with respect to the through Lead and lag Vehicles.

  • in depth analysis of drivers merging behavior and rear end crash risks in work zone merging areas
    Accident Analysis & Prevention, 2015
    Co-Authors: Jinxian Weng, Ying Yang, Xiaobo Qu
    Abstract:

    This study investigates the drivers’ merging behavior and the rear-end crash risk in work zone merging areas during the entire merging implementation period from the time of starting a merging maneuver to that of completing the maneuver. With the merging traffic data from a work zone site in Singapore, a mixed probit model is developed to describe the merging behavior, and two surrogate safety measures including the time to collision (TTC) and deceleration rate to avoid the crash (DRAC) are adopted to compute the rear-end crash risk between the merging Vehicle and its neighboring Vehicles. Results show that the merging Vehicle has a bigger probability of completing a merging maneuver quickly under one of the following situations: (i) the merging Vehicle moves relatively fast; (ii) the merging Lead Vehicle is a heavy Vehicle; and (iii) there is a sizable gap in the adjacent through lane. Results indicate that the rear-end crash risk does not monotonically increase as the merging Vehicle speed increases. The merging Vehicle's rear-end crash risk is also affected by the Vehicle type. There is a biggest increment of rear-end crash risk if the merging Lead Vehicle belongs to a heavy Vehicle. Although the reduced remaining distance to work zone could urge the merging Vehicle to complete a merging maneuver quickly, it might Lead to an increased rear-end crash risk. Interestingly, it is found that the rear-end crash risk could be generally increased over the elapsed time after the merging maneuver being triggered.

Guizani Mohsen - One of the best experts on this subject based on the ideXlab platform.

  • Optimal Rate-Adaptive Data Dissemination in Vehicular Platoons
    'Institute of Electrical and Electronics Engineers (IEEE)', 2119
    Co-Authors: Li Kai, Ni Wei, Tovar Eduardo, Guizani Mohsen
    Abstract:

    In intelligent transportation systems, wireless connected Vehicles moving in platoons can improve roads’ throughput. For managing driving status of the platoon, a Lead Vehicle transmits driving information to following autonomous Vehicles by using multi-hop data dissemination. We study a novel data dissemination protocol which investigates a chain-based transmit rate control to reduce data dissemination latency. The optimal resource allocation algorithm is formulated to minimize the total dissemination latency of the platoon under guaranteed bit error rates, and can be judiciously reformulated and solved using standard optimization techniques. A novel dynamic programming algorithm is presented to solve the platooning resource allocation optimization, which uses backward induction to significantly reduce the resource allocation complexity. In addition, we interpret the vehicular platoon as one-dimensional Markov chain, and derive a closed form of dissemination latency. Simulations are carried out to evaluate the performance of the proposed dynamic programming algorithm. The numerical results show that our algorithm achieves optimal solutions with cutting off the complexity by orders of magnitude, while improving dissemination rate in the vehicular platoon.info:eu-repo/semantics/publishedVersio

  • Secret Key Agreement for Data Dissemination in Vehicular Platoons
    'Institute of Electrical and Electronics Engineers (IEEE)', 2119
    Co-Authors: Li Kai, Ni Wei, Tovar Eduardo, Lu Lingyun, Guizani Mohsen
    Abstract:

    In a vehicular platoon, the Lead Vehicle that is responsible for managing the platoon’s moving directions and velocity periodically disseminates messages to the following automated Vehicles in a multi-hop vehicular network. However, due to the broadcast nature of wireless channels, this kind of communication is vulnerable to eavesdropping and message modification. Generating secret keys by extracting the shared randomness in a wireless fading channel is a promising way for wireless communication security. We study a security protocol for data dissemination in the platoon, where the Vehicles cooperatively generate a shared secret key based on the quantized fading channel randomness. To improve conformity of the generated key, the probability of secret key agreement is formulated, and a novel secret key agreement algorithm is proposed to recursively optimize the channel quantization intervals, maximizing the key agreement probability. Numerical evaluations demonstrate that the key agreement probability achieved by our security protocol given different platoon size, channel quality, and number of quantization intervals. Furthermore, by applying our security protocol, the probability that the encrypted data being cracked by an eavesdropper is less than 5%.info:eu-repo/semantics/publishedVersio

  • Cooperative Secret Key Generation for Platoon-Based Vehicular Communications
    'Institute of Electrical and Electronics Engineers (IEEE)', 2119
    Co-Authors: Li Kai, Ni Wei, Tovar Eduardo, Lu Lingyun, Guizani Mohsen
    Abstract:

    In a vehicular platoon, the Lead Vehicle that is responsible for managing the platoon's moving directions and velocity periodically disseminates messages to the following automated Vehicles in a multi-hop vehicular network. However, due to the broadcast nature of wireless channels, Vehicle-to-Vehicle (V2V) communications are vulnerable to eavesdropping and message modification. Generating secret keys by extracting the shared randomness in a wireless fading channel is a promising way for V2V communication security. We study a security scheme for platoon-based V2V communications, where the platooning Vehicles generate a shared secret key based on the quantized fading channel randomness. To improve conformity of the generated key, the probability of secret key agreement is formulated, and a novel secret key agreement algorithm is proposed to recursively optimize the channel quantization intervals, maximizing the key agreement probability. Numerical evaluations demonstrate that the key agreement probability achieved by our security protocol given different platoon size, channel quality, and number of quantization intervals. Furthermore, by applying our security protocol, it is shown that the probability that the encrypted data being cracked by an eavesdropper is less than 5%.info:eu-repo/semantics/publishedVersio

  • LCD: Low Latency Command Dissemination for A Platoon of Vehicles
    'Institute of Electrical and Electronics Engineers (IEEE)', 2119
    Co-Authors: Li Kai, Tovar Eduardo, Guizani Mohsen
    Abstract:

    —In a vehicular platoon, a Lead Vehicle that is responsible for managing the platoon’s moving directions and velocity periodically disseminates control commands to following Vehicles based on Vehicle-to-Vehicle communications. However, reducing command dissemination latency with multiple Vehicles while ensuring successful message delivery to the tail Vehicle is challenging. We propose a new linear dynamic programming algorithm using backward induction and interchange arguments to minimize the dissemination latency of the Vehicles. Furthermore, a closed form of dissemination latency in vehicular platoon is obtained by utilizing Markov chain with M/M/1 queuing model. Simulation results confirm that the proposed dynamic programming algorithm improves the dissemination rate by at least 50.9%, compared to similar algorithms in the literature. Moreover, it also approximates the best performance with the maximum gap of up to 0.2 second in terms of latency.info:eu-repo/semantics/publishedVersio

  • LCD: Low Latency Command Dissemination for A Platoon of Vehicles
    2018
    Co-Authors: Li Kai, Ni Wei, Tovar Eduardo, Guizani Mohsen
    Abstract:

    In a vehicular platoon, a Lead Vehicle that is responsible for managing the platoon's moving directions and velocity periodically disseminates control commands to following Vehicles based on Vehicle-to-Vehicle communications. However, reducing command dissemination latency with multiple Vehicles while ensuring successful message delivery to the tail Vehicle is challenging. We propose a new linear dynamic programming algorithm using backward induction and interchange arguments to minimize the dissemination latency of the Vehicles. Furthermore, a closed form of dissemination latency in vehicular platoon is obtained by utilizing Markov chain with M/M/1 queuing model. Simulation results confirm that the proposed dynamic programming algorithm improves the dissemination rate by at least 50.9%, compared to similar algorithms in the literature. Moreover, it also approximates the best performance with the maximum gap of up to 0.2 second in terms of latency.Comment: 8 pages, 5 figures, accepted in IEEE International Conference on Communications (ICC), 201

Ni Wei - One of the best experts on this subject based on the ideXlab platform.

  • Design and Implementation of Secret Key Agreement for Platoon-based Vehicular Cyber-physical Systems
    'Association for Computing Machinery (ACM)', 2120
    Co-Authors: Li Kai, Ni Wei, Emami Yousef, Shen Yiran, Severino Ricardo, Pereira David, Tovar Eduardo
    Abstract:

    In a platoon-based vehicular cyber-physical system (PVCPS), a Lead Vehicle that is responsible for managing the platoon’s moving directions and velocity periodically disseminates control messages to the Vehicles that follow. Securing wireless transmissions of the messages between the Vehicles is critical for privacy and confidentiality of the platoon’s driving pattern. However, due to the broadcast nature of radio channels, the transmissions are vulnerable to eavesdropping. In this article, we propose a cooperative secret key agreement (CoopKey) scheme for encrypting/decrypting the control messages, where the Vehicles in PVCPS generate a unified secret key based on the quantized fading channel randomness. Channel quantization intervals are optimized by dynamic programming to minimize the mismatch of keys. A platooning testbed is built with autonomous robotic Vehicles, where a TelosB wireless node is used for onboard data processing and multihop dissemination. Extensive real-world experiments demonstrate that CoopKey achieves significantly low secret bit mismatch rate in a variety of settings. Moreover, the standard NIST test suite is employed to verify randomness of the generated keys, where the p-values of our CoopKey pass all the randomness tests. We also evaluate CoopKey with an extended platoon size via simulations to investigate the effect of system scalability on performance.info:eu-repo/semantics/publishedVersio

  • Optimal Rate-Adaptive Data Dissemination in Vehicular Platoons
    'Institute of Electrical and Electronics Engineers (IEEE)', 2119
    Co-Authors: Li Kai, Ni Wei, Tovar Eduardo, Guizani Mohsen
    Abstract:

    In intelligent transportation systems, wireless connected Vehicles moving in platoons can improve roads’ throughput. For managing driving status of the platoon, a Lead Vehicle transmits driving information to following autonomous Vehicles by using multi-hop data dissemination. We study a novel data dissemination protocol which investigates a chain-based transmit rate control to reduce data dissemination latency. The optimal resource allocation algorithm is formulated to minimize the total dissemination latency of the platoon under guaranteed bit error rates, and can be judiciously reformulated and solved using standard optimization techniques. A novel dynamic programming algorithm is presented to solve the platooning resource allocation optimization, which uses backward induction to significantly reduce the resource allocation complexity. In addition, we interpret the vehicular platoon as one-dimensional Markov chain, and derive a closed form of dissemination latency. Simulations are carried out to evaluate the performance of the proposed dynamic programming algorithm. The numerical results show that our algorithm achieves optimal solutions with cutting off the complexity by orders of magnitude, while improving dissemination rate in the vehicular platoon.info:eu-repo/semantics/publishedVersio

  • Secret Key Agreement for Data Dissemination in Vehicular Platoons
    'Institute of Electrical and Electronics Engineers (IEEE)', 2119
    Co-Authors: Li Kai, Ni Wei, Tovar Eduardo, Lu Lingyun, Guizani Mohsen
    Abstract:

    In a vehicular platoon, the Lead Vehicle that is responsible for managing the platoon’s moving directions and velocity periodically disseminates messages to the following automated Vehicles in a multi-hop vehicular network. However, due to the broadcast nature of wireless channels, this kind of communication is vulnerable to eavesdropping and message modification. Generating secret keys by extracting the shared randomness in a wireless fading channel is a promising way for wireless communication security. We study a security protocol for data dissemination in the platoon, where the Vehicles cooperatively generate a shared secret key based on the quantized fading channel randomness. To improve conformity of the generated key, the probability of secret key agreement is formulated, and a novel secret key agreement algorithm is proposed to recursively optimize the channel quantization intervals, maximizing the key agreement probability. Numerical evaluations demonstrate that the key agreement probability achieved by our security protocol given different platoon size, channel quality, and number of quantization intervals. Furthermore, by applying our security protocol, the probability that the encrypted data being cracked by an eavesdropper is less than 5%.info:eu-repo/semantics/publishedVersio

  • Cooperative Secret Key Generation for Platoon-Based Vehicular Communications
    'Institute of Electrical and Electronics Engineers (IEEE)', 2119
    Co-Authors: Li Kai, Ni Wei, Tovar Eduardo, Lu Lingyun, Guizani Mohsen
    Abstract:

    In a vehicular platoon, the Lead Vehicle that is responsible for managing the platoon's moving directions and velocity periodically disseminates messages to the following automated Vehicles in a multi-hop vehicular network. However, due to the broadcast nature of wireless channels, Vehicle-to-Vehicle (V2V) communications are vulnerable to eavesdropping and message modification. Generating secret keys by extracting the shared randomness in a wireless fading channel is a promising way for V2V communication security. We study a security scheme for platoon-based V2V communications, where the platooning Vehicles generate a shared secret key based on the quantized fading channel randomness. To improve conformity of the generated key, the probability of secret key agreement is formulated, and a novel secret key agreement algorithm is proposed to recursively optimize the channel quantization intervals, maximizing the key agreement probability. Numerical evaluations demonstrate that the key agreement probability achieved by our security protocol given different platoon size, channel quality, and number of quantization intervals. Furthermore, by applying our security protocol, it is shown that the probability that the encrypted data being cracked by an eavesdropper is less than 5%.info:eu-repo/semantics/publishedVersio

  • Design and Implementation of Secret Key Agreement for Platoon-based Vehicular Cyber-Physical Systems
    'Association for Computing Machinery (ACM)', 2019
    Co-Authors: Li Kai, Ni Wei, Emami Yousef, Shen Yiran, Severino Ricardo, Pereira David, Tovar Eduardo
    Abstract:

    In platoon-based vehicular cyber-physical system (PVCPS), a Lead Vehicle that is responsible for managing the platoon's moving directions and velocity periodically disseminates control messages to the Vehicles that follow. Securing wireless transmissions of the messages between the Vehicles is critical for privacy and confidentiality of platoon's driving pattern. However, due to the broadcast nature of radio channels, the transmissions are vulnerable to eavesdropping. In this paper, we propose a cooperative secret key agreement (CoopKey) scheme for encrypting/decrypting the control messages, where the Vehicles in PVCPS generate a unified secret key based on the quantized fading channel randomness. Channel quantization intervals are optimized by dynamic programming to minimize the mismatch of keys. A platooning testbed is built with autonomous robotic Vehicles, where a TelosB wireless node is used for onboard data processing and multi-hop dissemination. Extensive real-world experiments demonstrate that CoopKey achieves significantly low secret bit mismatch rate in a variety of settings. Moreover, the standard NIST test suite is employed to verify randomness of the generated keys, where the p-values of our CoopKey pass all the randomness tests. We also evaluate CoopKey with an extended platoon size via simulations to investigate the effect of system scalability on performance.Comment: To be published in ACM Transactions on Cyber-Physical Systems (TCPS