Vehicle-Key: A Secret Key Establishment Scheme for LoRa-enabled IoV Communications

Yang, Huanqi; Liu, Hongbo; Luo, Chengwen; Wu, Yuezhong; Li, Wei; Zomaya, Albert Y.; Song, Linqi; Xu, Weitao

doi:10.1109/icdcs54860.2022.00081

Cited by 17 publications

(2 citation statements)

References 19 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…For instance, the scale of the network might be much smaller in rural areas as opposed to urban regions, highways, or metropolitan cities. This is because large urban areas have a greater population density [88]. If the network has been severely disrupted in any circumstance, it has the potential to become fragmented, which makes the role of routing particularly important.…”

Section: Routingmentioning

confidence: 99%

The Evolution of Intelligent Transportation Systems: Analyzing the Differences and Similarities between IoV and IoFV

Herich,

Vaščák

2024

Drones

View full text Add to dashboard Cite

The Internet of Vehicles (IoV) and the Internet of Flying Vehicles (IoFV) are integral components of intelligent transportation systems with the potential to revolutionize the way we move people and goods. Although both the IoV and IoFV share a common goal of improving transportation efficiency, safety, and sustainability, they possess distinct characteristics and face unique challenges. To date, the existing literature has predominantly focused on specific aspects of either the IoV or IoFV, but a comprehensive review comparing and contrasting the two domains is still lacking. This review paper aims to address this gap by providing an in-depth analysis of the key differences between the IoV and IoFV systems. The review will examine the technological components, network infrastructure, communication protocols, data management, objectives, applications, challenges, and future trends associated with both domains. Additionally, this paper will explore the potential impact of technologies such as artificial intelligence, machine learning, and blockchain. Ultimately, the paper aims to contribute to a deeper understanding of the implications and potential of these technologies, both in the context of transportation systems and beyond.

show abstract

Section: Routingmentioning

confidence: 99%

The Evolution of Intelligent Transportation Systems: Analyzing the Differences and Similarities between IoV and IoFV

Herich,

Vaščák

2024

Drones

View full text Add to dashboard Cite

show abstract

“…While most PLKG algorithms only focus on the pairwise key generation between two users, Tang et al [19] took advantage of the MIMO antennas available on newer devices to generate group secret keys. PLKG methods have been used for 5G systems [20][21][22][23][24], low-power LoRa wide-area networks [25][26][27], and sensor networks [28,29]. Another application of PLKG is vehicular scenarios.…”

Section: Introductionmentioning

confidence: 99%

Wireless Secret Sharing Game for Internet of Things

Miao

Jiang

2023

Sustainability

View full text Add to dashboard Cite

In the era of Internet of Things (IoT), billions of small but smart wireless devices work together to make our cities more intelligent and sustainable. One challenge is that many IoT devices do not have human interfaces and are very difficult for humans to manage. This creates sustainability and security issues. Enabling automatic secret sharing across heterogeneous devices for cryptography purposes will provide the needed security and sustainability for the underlying IoT infrastructure. Therefore, wireless secret sharing is crucial to the success of smart cities. One secret sharing method is to utilize the effect of the randomness of the wireless channel in the data link layer to generate the common secret between legitimate users. This paper models this secret sharing mechanism from the perspective of game theory. In particular, we formulate a non-cooperative zero-sum game between the legitimate users (Alice and Bob) and an eavesdropper (Eve). Alice and Bob’s strategy is deciding how to exchange packets to protect the secret, and Eve’s strategy is choosing where to stay to better intercept the secret. In a symmetrical game where Eve has the same probability of successfully receiving a packet from Alice and Bob when the transmission distance is the same, we show that both pure and mixed strategy Nash equilibria exist. In an asymmetric game where Eve has different probabilities of successfully receiving a packet from Alice and Bob, a pure strategy may not exist; in this case, we show how a mixed strategy Nash equilibrium can be found. We run simulations to show that our results are better than other approaches.

show abstract