• KIPS Transactions on Computer and Communication Systems
• /
• v.2 no.11
• /
• pp.495-502
• /
• 2013

In this paper, we present an anonymous authentication and location assurance protocol for secure location-aware services over vehicular ad hoc networks (VANETs). In other to achieve our goal, we propose the notion of a location-aware signing key so as to strongly bind geographic location information to cryptographic function while providing conditional privacy preservation which is a desirable property for secure vehicular communications. Furthermore, the proposed protocol provides an efficient procedure based on hash chain technique for revocation checking to effectively alleviate communication and computational costs on vehicles in VANETs. Finally, we demonstrate comprehensive analysis to confirm the fulfillment of the security objectives, and the efficiency and effectiveness of the proposed protocol.

• Journal of Internet Technology
• /
• v.21 no.1
• /
• pp.249-264
• /
• 2020

Cellular (C) setups facilitate the connectivity amongst the devices with better provisioning of services to its users. Vehicular networks are one of the representative setups that aim at expanding their functionalities by using the available cellular systems like Long Term Evolution (LTE)-based Evolved Universal Terrestrial Radio Access Network (E-UTRAN) as well as the upcoming Fifth Generation (5G)-based functional architecture. The vehicular networks include Vehicle to Vehicle (V2V), Vehicle to Infrastructure (V2I), Vehicle to Pedestrian (V2P) and Vehicle to Network (V2N), all of which are referred to as Vehicle to Everything (V2X). 5G has dominated the vehicular network and most of the upcoming research is motivated towards the fully functional utilization of 5G-V2X. Despite that, credential management and edge-initiated security are yet to be resolved under 5G-V2X. To further understand the issue, this paper presents security management as a principle of sustainability and key-management. The performance tradeoff is evaluated with the key-updates required to maintain a secure connection between the vehicles and the 5G-terminals. The proposed approach aims at the utilization of high-speed mmWave-based backhaul for enhancing the security operations between the core and the sub-divided functions at the edge of the network through a dual security management framework. The evaluations are conducted using numerical simulations, which help to understand the impact on the sustainability of connections as well as identification of the fail-safe points for secure and fast operations. Furthermore, the evaluations help to follow the multiple tradeoffs of security and performance based on the metrics like mandatory key updates, the range of operations and the probability of connectivity.

• Proceedings of the IEEK Conference
• /
• 2006.06a
• /
• pp.235-236
• /
• 2006

IEEE 802.16 networks support mobile stations (MSs) to access broadband wireless networks while moving at a vehicular speed. However, IEEE 802.16 networks do not provide link layer native multicast capability because of point-to-multipoint connection characteristic. Due to this feature, it is not easy to adopt protocols or applications which need native link layer multicast capability. In order to solve the multicast support problem, we use the built-in LAN emulation feature of IEEE 802.16 which is based on Convergence Sublayer (CS). Our proposed operational procedures support not only the delivery of link local scope multicast packets, but also the delivery of non-link local scope multicast packets such as site local or global scope multicast packets. We also present the method of forming multicast Connection Identifier (CID) which is used to transport IP packets over IEEE 802.16 networks.

• Journal of Digital Convergence
• /
• v.10 no.6
• /
• pp.225-230
• /
• 2012

When a car accident happened, the accident vehicle should broadcast a safe message to its neighbors in multi-hop. However, the pure flooding is difficult to protect a chain-reaction collision because of the frequent collision and the communication delay. To solve this problem, we proposes a back-off algorithm applied to the estimation of the neighbor node count using the t-distribution. And we proposes a MAC protocol preventing the communication delay by separating the neighbor's count collection channel and data channel. As a result, we show the frame reception success rate of our protocol improved more 10% than the previous protocol.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2015.05a
• /
• pp.126-129
• /
• 2015

Device-to-device (D2D) communications, a subset of Proximity-based Services that enables direct communication between LTE network subscribers, is gaining popularity. It is well underway to be adopted in cellular communication systems for pedestrian and connected-vehicles alike. In this paper, we briefly present our model of an Evolved Packet Core Network-assisted device discovery simulator and show the applicability of Proximity-based Services for Vehicular Ad-hoc Networks. Through the performance evaluation based on the developed simulation environment, it is shown that in case when users gather in the same vicinity, as in public transportation, LTE network data can be efficiently offloaded and multicasted through Wi-Fi for e.g. delivering traffic-related information and for the benefit of infotainment service consumers.

• Journal of the Institute of Electronics and Information Engineers
• /
• v.52 no.4
• /
• pp.9-16
• /
• 2015

Quick and safe message transmission is an important research topic of vehicular ad hoc networks (VANET). Most studies assume that the periodic broadcast of beacon-frames between vehicles increases the safety of the driver. In this paper, we propose a medium access control (MAC) protocol and location-based clustering for the VANET to support reliable data transfer. In our proposal, the cluster heade (CH) manage the access and allocate the resources of the node. Our proposal uses simulation to confirm the reduction of the transmission delay and the collision rate of the signal.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.16 no.11
• /
• pp.3638-3657
• /
• 2022

In urban vehicular edge computing (VEC) environments, one edge server always serves many task requests in its coverage which results in the resource-constrained problem. To resolve the problem and improve system utilization, we first design a general hierarchical resource management framework based on typical VEC network structures. Following the framework, a specific interacting protocol is also designed for our decision algorithm. Secondly, a greedy bidding-based multi-hop task scheduling decision algorithm is proposed to realize effective task scheduling in resource-constrained VEC environments. In this algorithm, the goal of maximizing system utility is modeled as an optimization problem with the constraints of task deadlines and available computing resources. Then, an auction mechanism named greedy bidding is used to match task requests to edge servers in the case of multiple hops to maximize the system utility. Simulation results show that our proposal can maximize the number of tasks served in resource constrained VEC networks and improve the system utility.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.17 no.12
• /
• pp.3416-3435
• /
• 2023

Task offloading in vehicular networks is hot topic in the development of autonomous driving. In these scenarios, due to the role of vehicles and pedestrians, task characteristics are changing constantly. The classical deep learning algorithm always uses a pre-trained neural network to optimize task offloading, which leads to system performance degradation. Therefore, this paper proposes a neural network fine-tuning task offloading algorithm, combining with location prediction for pedestrians and vehicles by the Payne model of fluid dynamics and the car-following model, respectively. After the locations are predicted, characteristics of tasks can be obtained and the neural network will be fine-tuned. Finally, the proposed algorithm continuously predicts task characteristics and fine-tunes a neural network to maintain high system performance and meet low delay requirements. From the simulation results, compared with other algorithms, the proposed algorithm still guarantees a lower task offloading delay, especially when congestion occurs.

• The Journal of Korean Institute of Communications and Information Sciences
• /
• v.39B no.4
• /
• pp.216-227
• /
• 2014

Mechanical Relay (McR) is a relaying architecture to enable data communications, where it can endure the transportation delay and intermittent disconnection. Every kind of vehicular infrastructures can be readily utilized for the mechanical relaying in the manner of moving natures, which brings the most significant consequences compared to conventional relaying schemes. In this paper, we analyze the ergodic network throughput of McR in wireless line networks (WLN) to compare the results between employing McRs and direct multi-hopping through the users without McRs. We demonstrate the McR scheme that are not only Ve-SISO but also Ve-SIMO/MISO. The numerical results of ergodic network throughputs contribute to the trade-off relation depending on the speed v of McRs, intensity factors ${\lambda}_u$ and ${\lambda}_r$, and the methods of how McRs are utilized.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.13 no.5
• /
• pp.2338-2356
• /
• 2019

Vehicular ad-hoc network (VANET) is the name of technology, which uses 'mobile internet' to facilitate communication between vehicles. The aim is to ensure road safety and achieve secure communication. Therefore, the reliability of this type of networks is a serious concern. The reliability of VANET is dependent upon proper communication between vehicles within a given amount of time. Therefore a new formula is introduced, the terms of the new formula correspond 1 by 1 to a class special ST route (SRORT). The new formula terms are much lesser than the Inclusion-Exclusion principle. An algorithm for the Source-to-Terminal reliability was presented, the algorithm produced Source-to-Terminal reliability or computed a Source-to-Terminal reliability expression by calculating a class of special networks of the given network. Since the architecture of this class of networks which need to be computed was comparatively trivial, the performance of the new algorithm was superior to the Inclusion-Exclusion principle. Also, we introduce a mobility metric called universal speed factor (USF) which is the extension of the existing speed factor, that suppose same speed of all vehicles at every time. The USF describes an exact relation between the relative speed of consecutive vehicles and the headway distance. The connectivity of vehicles in different mobile situations is analyzed using USF i.e., slow mobility connectivity, static connectivity, and high mobility connectivity. It is observed that $p_c$ probability of connectivity is directly proportional to the mean speed ${\mu}_{\nu}$ till specified threshold ${\mu}_{\tau}$, and decreases after ${\mu}_{\tau}$. Finally, the congested network is connected strongly as compared to the sparse network as shown in the simulation results.