• 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.

• Journal of the Korean Data and Information Science Society
• /
• v.21 no.4
• /
• pp.783-793
• /
• 2010

Several multi-hop applications developed for vehicular ad hoc networks use broadcast as a means to either discover nearby neighbors or propagate useful traffic information to other vehicles located within a certain geographical area. However, the conventional broadcast mechanism may lead to the so-called broadcast storm problem, a scenario in which there is a high level of contention and collisions at the link layer due to an excessive number of broadcast packets. We present a fuzzy alert message dissemination algorithm to improve performance for road safety alert application in Vehicular Ad-hoc Network (VANET). In the proposed algorithm, when a vehicle receives an alert message for the first time, the vehicle rebroadcasts the alert message according to the fuzzy control rules for rebroadcast degree, where the rebroadcast degree depends on the current traffic density of the road and the distance between source vehicle and destination vehicle. Also, the proposed algorithm is the hybrid algorithm that uses broadcast protocol together with token protocol according to traffic density. The performance of the proposed algorithm is evaluated through simulation and compared with that of other alert message dissemination algorithms.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.11 no.12
• /
• pp.5729-5744
• /
• 2017

Vehicular Ad Hoc Networks (VANET) in the large-scale road section usually have typical characteristics of large number of vehicles and unevenly distribution over geographic spaces. These two inherent characteristics lead to the unsatisfactory performance of VANETs. This poor performance is mainly due to fragile communication link and low dissemination efficiency. We propose a novel routing mechanism to address the issue in the paper, which includes a competition-based routing discovery with priority metrics and a local routing repair strategy. In the routing discovery stage, the algorithm uses adaptive scheme to select a stable route by the priorities of routing metrics, which are the length of each hop, as well as the residual lifetime of each link. Comparisons of different ratios over link length and link stability further show outstanding improvements. In the routing repair process, upstream and downstream nodes also compete for the right to establish repair process and to remain as a member of the active route after repair. Our simulation results confirm the improved performance of the proposed algorithm.

• Proceedings of the Korean Institute of Information and Commucation Sciences Conference
• /
• 2010.10a
• /
• pp.54-57
• /
• 2010

Vehicular Ad-hoc Network the core technology of ITS supports safety service or information service to driver and passenger on the roads utilizing V2V and V2I communication. WAVE, the standard of the vehicular ad hoc networks, adopts IEEE 802.11p as MAC protocol and includes the channel coordination algorithm to utilize multiple channels. However, this standard shows the problem related with QoS guarantee of urgent data for driver's safety and the limitation of the performance improvement. In this paper, we introduce WAVE-based Multi-channel MAC protocols that have proposed to resolve above problems and describe their features.

• International Journal of Computer Science & Network Security
• /
• v.23 no.2
• /
• pp.101-110
• /
• 2023

Vehicular Ad Hoc Network (VANET) is considered to be a subclass of Mobile Ad Hoc Networks (MANET). It has some challenges and issues of privacy which require to be solved before practical implementation of the system i.e., location preservation privacy. Many schemes have been proposed. The most prominent is pseudonym change based location preservation scheme. Safety message can be compromised when it sends via a wireless medium, consequently, an adversary can eavesdrop the communication to analyze and track targeted vehicle. The issue can be counter by use of pseudo identity instead of real and their change while communication proves to be a sufficient solution for such problems. In this context, a large amount of literature on pseudonym change strategies has been proposed to solve such problems in VANET. In this paper, we have given details on strategies proposed last two decades on pseudonym change based location preservation along with issues that they focus to resolve and try to give full understanding to readers.

• Proceedings of the Korean Information Science Society Conference
• /
• 2010.06d
• /
• pp.190-195
• /
• 2010

Vehicular ad hoc networks (VANETs) have a number of interesting applications to preserve road safety, notify users about changed road/traffic condition, handling post accident hazards and moreover service oriented applications to make the travel convenient to the drivers. Use of common information format for diverse applications enables the application developers to easily design flexible information dissemination system for new applications or add new features to existing application. This paper introduces a common information format for various applications in VANETs. The main goal of the paper is to design generalized distributed architectures for vehicular networks, which considers diverse application development scenarios and uses common information format. The proposed architectures enable the application developers to flexibly disseminate information to affected or interested user. In this paper, we have given a detail description of each component of the architectures and how they communicate with each other. In future, we will implement the proposed architecture using suitable simulator.

• International journal of advanced smart convergence
• /
• v.8 no.4
• /
• pp.179-187
• /
• 2019

Vehicular density is usually low in a highway environment. Consequently, connectivity of the vehicular ad hoc networks (VANETs) might be poor. We are investigating the problem of deploying the approximation optimal roadside units (RSUs) on the highway covered by VANETs, which employs VANETs to provide excellent connectivity. The goal is to estimate the minimal number of deployed RSUs to guarantee the connectivity probability of the VANET within a given threshold considering that RSUs are to be allocated equidistantly. We apply an approximation algorithm to distribute RSUs locations in the VANETs. Thereafter, performance of the proposed scheme is evaluated by calculating the connectivity probability of the VANET. The simulation results show that there is the threshold value M of implemented RSUs corresponding to each vehicular network with N vehicles. The connectivity probability increases slowly with the number of RSUs getting larger.

• Convergence Security Journal
• /
• v.10 no.1
• /
• pp.41-48
• /
• 2010

Greedy protocols show good performance in Vehicular Ad-hoc Networks (VANETs) environment in general. But they make longer routes causing by surroundings or turn out routing failures in some cases when there are many traffic signals which generate empty streets temporary, or there is no merge roads after a road divide into two roads. When a node selects the next node simply using the distance to the destination node, the longer route is made by traditional greedy protocols in some cases and sometimes the route ends up routing failure. Most of traditional greedy protocols just take into account the distance to the destination to select a next node. Each node needs to consider not only the distance to the destination node but also the direction to the destination while routing a packet because of geographical environment. The proposed routing scheme considers both of the distance and the direction for forwarding packets to make a stable route. And the protocol can configure as the surrounding environment. We evaluate the performance of the protocol using two mobility models and network simulations. Most of network performances are improved rather than in compared with traditional greedy protocols.

• The Journal of The Korea Institute of Intelligent Transport Systems
• /
• v.11 no.3
• /
• pp.70-80
• /
• 2012

In Vehicular Ad-hoc Network(VANET) which constructs networks without fixed infrastructure among vehicles, network topology is frequently changed due to high mobility. In case of urban model, communication disconnections caused by interruptions of communication propagation such as buildings and constructions could be often occurred. Therefore, in VANET environment a routing protocol to complement its characteristics is needed. This paper suggests an algorithm to improve the transmission performance at intersections by approaching of the distance-based broadcasting which utilizes the information of vehicle's position. By using relative velocity among vehicles, it makes the stability of route decision improved and reduces packet collisions through graded priorities in the intersection, and simultaneously improves the performance of data rate. It can be seen that the performance compared with previous algorithm is significantly improved when using the suggested algorithm in the urban traffic environment.

• KSII Transactions on Internet and Information Systems (TIIS)
• /
• v.10 no.9
• /
• pp.4123-4144
• /
• 2016

Vehicular Ad Hoc Networks (VANETs) utilize radio propagation models (RPMs) to predict path loss in vehicular environment. Modern urban vehicular environment contains road infrastructure units that include road tunnels, straight roads, curved roads flyovers and underpasses. Different RPMs were proposed in the past to predict path loss, but modern road infrastructure units especially flyovers and underpasses are neglected previously. Most of the existing RPMs are computationally complex and ignore some of the critical features such as impact of infrastructure units on the signal propagation and the effect of both static and moving radio obstacles on signal attenuation. Therefore, the existing RPMs are incapable of predicting path loss in flyovers and underpass accurately. This paper proposes an RPM to predict path loss for vehicular communication on flyovers and inside underpasses that considers both the static and moving radio obstacles while requiring only marginal overhead. The proposed RPM is validated based upon the field measurements in 5 GHz frequency band. A close agreement is found between the measured and predicted values of path loss.